/proc/self/cwd/pw_protobuf/decoder_fuzzer.cc

Source (jump to first uncovered line)
// Copyright 2022 The Pigweed Authors
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not
// use this file except in compliance with the License. You may obtain a copy of
// the License at
//
//     https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
// License for the specific language governing permissions and limitations under
// the License.

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <cstring>
#include <vector>

#include "fuzz.h"
#include "pw_fuzzer/fuzzed_data_provider.h"
#include "pw_protobuf/stream_decoder.h"
#include "pw_span/span.h"
#include "pw_status/status.h"
#include "pw_status/status_with_size.h"
#include "pw_stream/memory_stream.h"
#include "pw_stream/stream.h"

namespace pw::protobuf::fuzz {
namespace {

void RecursiveFuzzedDecode(FuzzedDataProvider& provider,
                           StreamDecoder& decoder,
                           uint32_t depth = 0) {
  constexpr size_t kMaxRepeatedRead = 256;
  constexpr size_t kMaxDepth = 3;

  if (depth > kMaxDepth) {
    return;
  }
  while (provider.remaining_bytes() != 0 && decoder.Next().ok()) {
    FieldType field_type = provider.ConsumeEnum<FieldType>();
    switch (field_type) {
      case kUint32:
        if (!decoder.ReadUint32().status().ok()) {
          return;
        }
        break;
      case kPackedUint32: {
        uint32_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedUint32(packed).status().ok()) {
          return;
        }
      } break;
      case kUint64:
        if (!decoder.ReadUint64().status().ok()) {
          return;
        }
        break;
      case kPackedUint64: {
        uint64_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedUint64(packed).status().ok()) {
          return;
        }
      } break;
      case kInt32:
        if (!decoder.ReadInt32().status().ok()) {
          return;
        }
        break;
      case kPackedInt32: {
        int32_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedInt32(packed).status().ok()) {
          return;
        }
      } break;
      case kInt64:
        if (!decoder.ReadInt64().status().ok()) {
          return;
        }
        break;
      case kPackedInt64: {
        int64_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedInt64(packed).status().ok()) {
          return;
        }
      } break;
      case kSint32:
        if (!decoder.ReadSint32().status().ok()) {
          return;
        }
        break;
      case kPackedSint32: {
        int32_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedSint32(packed).status().ok()) {
          return;
        }
      } break;
      case kSint64:
        if (!decoder.ReadSint64().status().ok()) {
          return;
        }
        break;
      case kPackedSint64: {
        int64_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedSint64(packed).status().ok()) {
          return;
        }
      } break;
      case kBool:
        if (!decoder.ReadBool().status().ok()) {
          return;
        }
        break;
      case kFixed32:
        if (!decoder.ReadFixed32().status().ok()) {
          return;
        }
        break;
      case kPackedFixed32: {
        uint32_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedFixed32(packed).status().ok()) {
          return;
        }
      } break;
      case kFixed64:
        if (!decoder.ReadFixed64().status().ok()) {
          return;
        }
        break;
      case kPackedFixed64: {
        uint64_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedFixed64(packed).status().ok()) {
          return;
        }
      } break;
      case kSfixed32:
        if (!decoder.ReadSfixed32().status().ok()) {
          return;
        }
        break;
      case kPackedSfixed32: {
        int32_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedSfixed32(packed).status().ok()) {
          return;
        }
      } break;
      case kSfixed64:
        if (!decoder.ReadSfixed64().status().ok()) {
          return;
        }
        break;
      case kPackedSfixed64: {
        int64_t packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedSfixed64(packed).status().ok()) {
          return;
        }
      } break;
      case kFloat:
        if (!decoder.ReadFloat().status().ok()) {
          return;
        }
        break;
      case kPackedFloat: {
        float packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedFloat(packed).status().ok()) {
          return;
        }
      } break;
      case kDouble:
        if (!decoder.ReadDouble().status().ok()) {
          return;
        }
        break;
      case kPackedDouble: {
        double packed[kMaxRepeatedRead] = {0};
        if (!decoder.ReadPackedDouble(packed).status().ok()) {
          return;
        }
      } break;
      case kBytes: {
        std::byte bytes[kMaxRepeatedRead] = {std::byte{0}};
        if (!decoder.ReadBytes(bytes).status().ok()) {
          return;
        }
      } break;
      case kString: {
        char str[kMaxRepeatedRead] = {0};
        if (!decoder.ReadString(str).status().ok()) {
          return;
        }
      } break;
      case kPush: {
        StreamDecoder nested_decoder = decoder.GetNestedDecoder();
        RecursiveFuzzedDecode(provider, nested_decoder, depth + 1);
      } break;
      case kPop:
        if (depth > 0) {
          // Special "field". The marks the end of a nested message.
          return;
        }
    }
  }
}

void TestOneInput(FuzzedDataProvider& provider) {
  constexpr size_t kMaxFuzzedProtoSize = 4096;
  std::vector<std::byte> proto_message_data = provider.ConsumeBytes<std::byte>(
      provider.ConsumeIntegralInRange<size_t>(0, kMaxFuzzedProtoSize));
  stream::MemoryReader memory_reader(proto_message_data);
  StreamDecoder decoder(memory_reader);
  RecursiveFuzzedDecode(provider, decoder);
}

}  // namespace
}  // namespace pw::protobuf::fuzz

extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
  FuzzedDataProvider provider(data, size);
  pw::protobuf::fuzz::TestOneInput(provider);
  return 0;
}

Coverage Report

Created: 2024-01-24 07:14

Line	Count	Source (jump to first uncovered line)
1		// Copyright 2022 The Pigweed Authors
2		//
3		// Licensed under the Apache License, Version 2.0 (the "License"); you may not
4		// use this file except in compliance with the License. You may obtain a copy of
5		// the License at
6		//
7		// https://www.apache.org/licenses/LICENSE-2.0
8		//
9		// Unless required by applicable law or agreed to in writing, software
10		// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
11		// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
12		// License for the specific language governing permissions and limitations under
13		// the License.
14
15		#include <algorithm>
16		#include <cstddef>
17		#include <cstdint>
18		#include <cstring>
19		#include <vector>
20
21		#include "fuzz.h"
22		#include "pw_fuzzer/fuzzed_data_provider.h"
23		#include "pw_protobuf/stream_decoder.h"
24		#include "pw_span/span.h"
25		#include "pw_status/status.h"
26		#include "pw_status/status_with_size.h"
27		#include "pw_stream/memory_stream.h"
28		#include "pw_stream/stream.h"
29
30		namespace pw::protobuf::fuzz {
31		namespace {
32
33		void RecursiveFuzzedDecode(FuzzedDataProvider& provider,
34		StreamDecoder& decoder,
35	4.27k	uint32_t depth = 0) {
36	4.27k	constexpr size_t kMaxRepeatedRead = 256;
37	4.27k	constexpr size_t kMaxDepth = 3;
38
39	4.27k	if (depth > kMaxDepth) {
40	426	return;
41	426	}
42	12.8k	while (provider.remaining_bytes() != 0 && decoder.Next().ok()) {
43	10.3k	FieldType field_type = provider.ConsumeEnum<FieldType>();
44	10.3k	switch (field_type) {
45	364	case kUint32:
46	364	if (!decoder.ReadUint32().status().ok()) {
47	102	return;
48	102	}
49	262	break;
50	398	case kPackedUint32: {
51	398	uint32_t packed[kMaxRepeatedRead] = {0};
52	398	if (!decoder.ReadPackedUint32(packed).status().ok()) {
53	122	return;
54	122	}
55	398	} break;
56	315	case kUint64:
57	315	if (!decoder.ReadUint64().status().ok()) {
58	16	return;
59	16	}
60	299	break;
61	473	case kPackedUint64: {
62	473	uint64_t packed[kMaxRepeatedRead] = {0};
63	473	if (!decoder.ReadPackedUint64(packed).status().ok()) {
64	63	return;
65	63	}
66	473	} break;
67	414	case kInt32:
68	414	if (!decoder.ReadInt32().status().ok()) {
69	140	return;
70	140	}
71	274	break;
72	312	case kPackedInt32: {
73	312	int32_t packed[kMaxRepeatedRead] = {0};
74	312	if (!decoder.ReadPackedInt32(packed).status().ok()) {
75	47	return;
76	47	}
77	312	} break;
78	265	case kInt64:
79	247	if (!decoder.ReadInt64().status().ok()) {
80	16	return;
81	16	}
82	231	break;
83	280	case kPackedInt64: {
84	280	int64_t packed[kMaxRepeatedRead] = {0};
85	280	if (!decoder.ReadPackedInt64(packed).status().ok()) {
86	41	return;
87	41	}
88	280	} break;
89	450	case kSint32:
90	450	if (!decoder.ReadSint32().status().ok()) {
91	119	return;
92	119	}
93	331	break;
94	441	case kPackedSint32: {
95	441	int32_t packed[kMaxRepeatedRead] = {0};
96	441	if (!decoder.ReadPackedSint32(packed).status().ok()) {
97	139	return;
98	139	}
99	441	} break;
100	302	case kSint64:
101	227	if (!decoder.ReadSint64().status().ok()) {
102	22	return;
103	22	}
104	205	break;
105	300	case kPackedSint64: {
106	300	int64_t packed[kMaxRepeatedRead] = {0};
107	300	if (!decoder.ReadPackedSint64(packed).status().ok()) {
108	39	return;
109	39	}
110	300	} break;
111	261	case kBool:
112	244	if (!decoder.ReadBool().status().ok()) {
113	156	return;
114	156	}
115	88	break;
116	345	case kFixed32:
117	345	if (!decoder.ReadFixed32().status().ok()) {
118	3	return;
119	3	}
120	342	break;
121	342	case kPackedFixed32: {
122	283	uint32_t packed[kMaxRepeatedRead] = {0};
123	283	if (!decoder.ReadPackedFixed32(packed).status().ok()) {
124	28	return;
125	28	}
126	283	} break;
127	255	case kFixed64:
128	210	if (!decoder.ReadFixed64().status().ok()) {
129	8	return;
130	8	}
131	202	break;
132	317	case kPackedFixed64: {
133	317	uint64_t packed[kMaxRepeatedRead] = {0};
134	317	if (!decoder.ReadPackedFixed64(packed).status().ok()) {
135	28	return;
136	28	}
137	317	} break;
138	289	case kSfixed32:
139	253	if (!decoder.ReadSfixed32().status().ok()) {
140	8	return;
141	8	}
142	245	break;
143	297	case kPackedSfixed32: {
144	297	int32_t packed[kMaxRepeatedRead] = {0};
145	297	if (!decoder.ReadPackedSfixed32(packed).status().ok()) {
146	28	return;
147	28	}
148	297	} break;
149	269	case kSfixed64:
150	207	if (!decoder.ReadSfixed64().status().ok()) {
151	7	return;
152	7	}
153	200	break;
154	260	case kPackedSfixed64: {
155	260	int64_t packed[kMaxRepeatedRead] = {0};
156	260	if (!decoder.ReadPackedSfixed64(packed).status().ok()) {
157	29	return;
158	29	}
159	260	} break;
160	266	case kFloat:
161	266	if (!decoder.ReadFloat().status().ok()) {
162	13	return;
163	13	}
164	253	break;
165	263	case kPackedFloat: {
166	263	float packed[kMaxRepeatedRead] = {0};
167	263	if (!decoder.ReadPackedFloat(packed).status().ok()) {
168	28	return;
169	28	}
170	263	} break;
171	235	case kDouble:
172	211	if (!decoder.ReadDouble().status().ok()) {
173	11	return;
174	11	}
175	200	break;
176	329	case kPackedDouble: {
177	329	double packed[kMaxRepeatedRead] = {0};
178	329	if (!decoder.ReadPackedDouble(packed).status().ok()) {
179	35	return;
180	35	}
181	329	} break;
182	344	case kBytes: {
183	344	std::byte bytes[kMaxRepeatedRead] = {std::byte{0}};
184	344	if (!decoder.ReadBytes(bytes).status().ok()) {
185	45	return;
186	45	}
187	344	} break;
188	371	case kString: {
189	371	char str[kMaxRepeatedRead] = {0};
190	371	if (!decoder.ReadString(str).status().ok()) {
191	49	return;
192	49	}
193	371	} break;
194	1.93k	case kPush: {
195	1.93k	StreamDecoder nested_decoder = decoder.GetNestedDecoder();
196	1.93k	RecursiveFuzzedDecode(provider, nested_decoder, depth + 1);
197	1.93k	} break;
198	0	case kPop:
199	0	if (depth > 0) {
200		// Special "field". The marks the end of a nested message.
201	0	return;
202	0	}
203	10.3k	}
204	10.3k	}
205	3.84k	}
206
207	2.33k	void TestOneInput(FuzzedDataProvider& provider) {
208	2.33k	constexpr size_t kMaxFuzzedProtoSize = 4096;
209	2.33k	std::vector<std::byte> proto_message_data = provider.ConsumeBytes<std::byte>(
210	2.33k	provider.ConsumeIntegralInRange<size_t>(0, kMaxFuzzedProtoSize));
211	2.33k	stream::MemoryReader memory_reader(proto_message_data);
212	2.33k	StreamDecoder decoder(memory_reader);
213	2.33k	RecursiveFuzzedDecode(provider, decoder);
214	2.33k	}
215
216		} // namespace
217		} // namespace pw::protobuf::fuzz
218
219	6.07k	extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
220	6.07k	FuzzedDataProvider provider(data, size);
221	6.07k	pw::protobuf::fuzz::TestOneInput(provider);
222	6.07k	return 0;
223	6.07k	}