aboutsummaryrefslogtreecommitdiff
path: root/fuzz/fuzz_ds_hash.cpp
diff options
context:
space:
mode:
authorIvan Nardi <12729895+IvanNardi@users.noreply.github.com>2024-04-20 18:15:23 +0200
committerGitHub <noreply@github.com>2024-04-20 18:15:23 +0200
commitef891834699db2b0ed16e32fc2d352e8a8419945 (patch)
treedf39f9d6bf678d5286bdd48dd365a1f4828d14f6 /fuzz/fuzz_ds_hash.cpp
parent905120588bf2a1bb56b280d9accd89e7265b8364 (diff)
fuzz: improvements (#2400)
Create the zip file with all the traces only once. Add a new fuzzer to test "shoco" compression algorithm
Diffstat (limited to 'fuzz/fuzz_ds_hash.cpp')
-rw-r--r--fuzz/fuzz_ds_hash.cpp7
1 files changed, 2 insertions, 5 deletions
diff --git a/fuzz/fuzz_ds_hash.cpp b/fuzz/fuzz_ds_hash.cpp
index 9bb065365..07aa732a6 100644
--- a/fuzz/fuzz_ds_hash.cpp
+++ b/fuzz/fuzz_ds_hash.cpp
@@ -8,7 +8,7 @@
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
FuzzedDataProvider fuzzed_data(data, size);
- u_int16_t i, rc, num_iteration, data_len, is_added = 0;
+ u_int16_t value16, i, rc, num_iteration, data_len, is_added = 0;
std::vector<char>value_added;
ndpi_str_hash *h = NULL;
@@ -30,7 +30,7 @@ extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
data_len = fuzzed_data.ConsumeIntegralInRange(0, 127);
std::vector<char>data = fuzzed_data.ConsumeBytes<char>(data_len);
- rc = ndpi_hash_add_entry(&h, data.data(), data.size(), (u_int16_t)i);
+ rc = ndpi_hash_add_entry(&h, data.data(), data.size(), i);
/* Keep one random entry really added */
if (rc == 0 && fuzzed_data.ConsumeBool()) {
value_added = data;
@@ -41,8 +41,6 @@ extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
/* "Random" search */
num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();
for (i = 0; i < num_iteration; i++) {
- u_int16_t value16;
-
data_len = fuzzed_data.ConsumeIntegralInRange(0, 127);
std::vector<char>data = fuzzed_data.ConsumeBytes<char>(data_len);
@@ -50,7 +48,6 @@ extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
}
/* Search of an added entry */
if (is_added) {
- u_int16_t value16;
ndpi_hash_find_entry(h, value_added.data(), value_added.size(), &value16);
}