/src/ndpi/fuzz/fuzz_ds_hash.cpp
Line | Count | Source |
1 | | #include "ndpi_api.h" |
2 | | #include "fuzz_common_code.h" |
3 | | |
4 | | #include <stdint.h> |
5 | | #include <stdio.h> |
6 | | #include <assert.h> |
7 | | #include "fuzzer/FuzzedDataProvider.h" |
8 | | |
9 | 486 | extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) { |
10 | 486 | FuzzedDataProvider fuzzed_data(data, size); |
11 | 486 | u_int16_t i, rc, num_iteration, data_len, is_added = 0; |
12 | 486 | u_int64_t value64; |
13 | 486 | std::vector<char>value_added; |
14 | 486 | ndpi_str_hash *h = NULL; |
15 | | |
16 | | /* Just to have some data */ |
17 | 486 | if (fuzzed_data.remaining_bytes() < 1024) |
18 | 18 | return -1; |
19 | | |
20 | | /* To allow memory allocation failures */ |
21 | 468 | fuzz_set_alloc_callbacks_and_seed(size); |
22 | | |
23 | 468 | if (fuzzed_data.ConsumeBool()) |
24 | 414 | ndpi_hash_init(&h); |
25 | 54 | else |
26 | 54 | ndpi_hash_init(NULL); |
27 | | |
28 | 468 | num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>(); |
29 | 70.2k | for (i = 0; i < num_iteration; i++) { |
30 | | |
31 | 69.8k | data_len = fuzzed_data.ConsumeIntegralInRange(0, 127); |
32 | 69.8k | std::vector<char>data = fuzzed_data.ConsumeBytes<char>(data_len); |
33 | | |
34 | 69.8k | rc = ndpi_hash_add_entry(&h, data.data(), data.size(), i, NULL); |
35 | | /* Keep one random entry really added */ |
36 | 69.8k | if (rc == 0 && fuzzed_data.ConsumeBool()) { |
37 | 16.7k | value_added = data; |
38 | 16.7k | is_added = 1; |
39 | 16.7k | } |
40 | 69.8k | } |
41 | | |
42 | | /* "Random" search */ |
43 | 468 | num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>(); |
44 | 31.9k | for (i = 0; i < num_iteration; i++) { |
45 | 31.4k | data_len = fuzzed_data.ConsumeIntegralInRange(0, 127); |
46 | 31.4k | std::vector<char>data = fuzzed_data.ConsumeBytes<char>(data_len); |
47 | | |
48 | 31.4k | ndpi_hash_find_entry(h, data.data(), data.size(), &value64); |
49 | 31.4k | } |
50 | | /* Search of an added entry */ |
51 | 468 | if (is_added) { |
52 | 361 | ndpi_hash_find_entry(h, value_added.data(), value_added.size(), &value64); |
53 | 361 | } |
54 | | |
55 | 468 | if (fuzzed_data.ConsumeBool()) |
56 | 72 | ndpi_hash_free(NULL); |
57 | | |
58 | 468 | ndpi_hash_free(&h); |
59 | | |
60 | 468 | return 0; |
61 | 486 | } |