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

Source
// 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: 2026-03-09 06:24

Line	Count	Source
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	5.70k	uint32_t depth = 0) {
36	5.70k	constexpr size_t kMaxRepeatedRead = 256;
37	5.70k	constexpr size_t kMaxDepth = 3;
38
39	5.70k	if (depth > kMaxDepth) {
40	815	return;
41	815	}
42	16.0k	while (provider.remaining_bytes() != 0 && decoder.Next().ok()) {
43	12.8k	FieldType field_type = provider.ConsumeEnum<FieldType>();
44	12.8k	switch (field_type) {
45	431	case kUint32:
46	431	if (!decoder.ReadUint32().status().ok()) {
47	162	return;
48	162	}
49	269	break;
50	408	case kPackedUint32: {
51	408	uint32_t packed[kMaxRepeatedRead] = {0};
52	408	if (!decoder.ReadPackedUint32(packed).status().ok()) {
53	115	return;
54	115	}
55	408	} break;
56	293	case kUint64:
57	224	if (!decoder.ReadUint64().status().ok()) {
58	25	return;
59	25	}
60	199	break;
61	373	case kPackedUint64: {
62	373	uint64_t packed[kMaxRepeatedRead] = {0};
63	373	if (!decoder.ReadPackedUint64(packed).status().ok()) {
64	63	return;
65	63	}
66	373	} break;
67	483	case kInt32:
68	483	if (!decoder.ReadInt32().status().ok()) {
69	217	return;
70	217	}
71	266	break;
72	320	case kPackedInt32: {
73	320	int32_t packed[kMaxRepeatedRead] = {0};
74	320	if (!decoder.ReadPackedInt32(packed).status().ok()) {
75	49	return;
76	49	}
77	320	} break;
78	271	case kInt64:
79	231	if (!decoder.ReadInt64().status().ok()) {
80	28	return;
81	28	}
82	203	break;
83	346	case kPackedInt64: {
84	346	int64_t packed[kMaxRepeatedRead] = {0};
85	346	if (!decoder.ReadPackedInt64(packed).status().ok()) {
86	56	return;
87	56	}
88	346	} break;
89	418	case kSint32:
90	418	if (!decoder.ReadSint32().status().ok()) {
91	135	return;
92	135	}
93	283	break;
94	547	case kPackedSint32: {
95	547	int32_t packed[kMaxRepeatedRead] = {0};
96	547	if (!decoder.ReadPackedSint32(packed).status().ok()) {
97	140	return;
98	140	}
99	547	} break;
100	407	case kSint64:
101	269	if (!decoder.ReadSint64().status().ok()) {
102	73	return;
103	73	}
104	196	break;
105	293	case kPackedSint64: {
106	293	int64_t packed[kMaxRepeatedRead] = {0};
107	293	if (!decoder.ReadPackedSint64(packed).status().ok()) {
108	36	return;
109	36	}
110	293	} break;
111	372	case kBool:
112	372	if (!decoder.ReadBool().status().ok()) {
113	175	return;
114	175	}
115	197	break;
116	469	case kFixed32:
117	469	if (!decoder.ReadFixed32().status().ok()) {
118	8	return;
119	8	}
120	461	break;
121	461	case kPackedFixed32: {
122	296	uint32_t packed[kMaxRepeatedRead] = {0};
123	296	if (!decoder.ReadPackedFixed32(packed).status().ok()) {
124	39	return;
125	39	}
126	296	} break;
127	257	case kFixed64:
128	204	if (!decoder.ReadFixed64().status().ok()) {
129	5	return;
130	5	}
131	199	break;
132	599	case kPackedFixed64: {
133	599	uint64_t packed[kMaxRepeatedRead] = {0};
134	599	if (!decoder.ReadPackedFixed64(packed).status().ok()) {
135	47	return;
136	47	}
137	599	} break;
138	552	case kSfixed32:
139	248	if (!decoder.ReadSfixed32().status().ok()) {
140	8	return;
141	8	}
142	240	break;
143	304	case kPackedSfixed32: {
144	304	int32_t packed[kMaxRepeatedRead] = {0};
145	304	if (!decoder.ReadPackedSfixed32(packed).status().ok()) {
146	37	return;
147	37	}
148	304	} break;
149	267	case kSfixed64:
150	203	if (!decoder.ReadSfixed64().status().ok()) {
151	6	return;
152	6	}
153	197	break;
154	309	case kPackedSfixed64: {
155	309	int64_t packed[kMaxRepeatedRead] = {0};
156	309	if (!decoder.ReadPackedSfixed64(packed).status().ok()) {
157	43	return;
158	43	}
159	309	} break;
160	301	case kFloat:
161	301	if (!decoder.ReadFloat().status().ok()) {
162	10	return;
163	10	}
164	291	break;
165	322	case kPackedFloat: {
166	322	float packed[kMaxRepeatedRead] = {0};
167	322	if (!decoder.ReadPackedFloat(packed).status().ok()) {
168	47	return;
169	47	}
170	322	} break;
171	275	case kDouble:
172	214	if (!decoder.ReadDouble().status().ok()) {
173	8	return;
174	8	}
175	206	break;
176	352	case kPackedDouble: {
177	352	double packed[kMaxRepeatedRead] = {0};
178	352	if (!decoder.ReadPackedDouble(packed).status().ok()) {
179	58	return;
180	58	}
181	352	} break;
182	627	case kBytes: {
183	627	std::byte bytes[kMaxRepeatedRead] = {std::byte{0}};
184	627	if (!decoder.ReadBytes(bytes).status().ok()) {
185	59	return;
186	59	}
187	627	} break;
188	568	case kString: {
189	392	char str[kMaxRepeatedRead] = {0};
190	392	if (!decoder.ReadString(str).status().ok()) {
191	57	return;
192	57	}
193	392	} break;
194	3.33k	case kPush: {
195	3.33k	StreamDecoder nested_decoder = decoder.GetNestedDecoder();
196	3.33k	RecursiveFuzzedDecode(provider, nested_decoder, depth + 1);
197	3.33k	} 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	12.8k	}
204	12.8k	}
205	4.89k	}
206
207	2.36k	void TestOneInput(FuzzedDataProvider& provider) {
208	2.36k	constexpr size_t kMaxFuzzedProtoSize = 4096;
209	2.36k	std::vector<std::byte> proto_message_data = provider.ConsumeBytes<std::byte>(
210	2.36k	provider.ConsumeIntegralInRange<size_t>(0, kMaxFuzzedProtoSize));
211	2.36k	stream::MemoryReader memory_reader(proto_message_data);
212	2.36k	StreamDecoder decoder(memory_reader);
213	2.36k	RecursiveFuzzedDecode(provider, decoder);
214	2.36k	}
215
216		} // namespace
217		} // namespace pw::protobuf::fuzz
218
219	16.8k	extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
220	16.8k	FuzzedDataProvider provider(data, size);
221	16.8k	pw::protobuf::fuzz::TestOneInput(provider);
222	16.8k	return 0;
223	16.8k	}