1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
#include "ndpi_api.h"
#include "fuzz_common_code.h"
#include <stdint.h>
#include <stdio.h>
#include <assert.h>
#include "fuzzer/FuzzedDataProvider.h"
static void process_ptree_data(ndpi_prefix_t *prefix, void *data) {
/* Nothing to do */
assert(prefix && data == NULL);
}
static void process3_ptree_data(ndpi_patricia_node_t *node, void *data, void *user_data) {
/* Nothing to do */
assert(node && data == NULL && user_data == NULL);
}
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
FuzzedDataProvider fuzzed_data(data, size);
u_int16_t i, num_iteration, ip_len;
ndpi_patricia_tree_t *p, *p_cloned;
u_int16_t maxbits;
int is_added = 0;
ndpi_prefix_t prefix, prefix_added;
u_char *ip;
ndpi_patricia_node_t *node;
int tree_type; /* 0: ipv4, 1: ipv6, 2: mac */
/* Just to have some data */
if (fuzzed_data.remaining_bytes() < 1024)
return -1;
/* To allow memory allocation failures */
fuzz_set_alloc_callbacks_and_seed(size);
tree_type = fuzzed_data.ConsumeIntegralInRange(0, 2);
if (tree_type == 0)
maxbits = 32;
else if (tree_type == 1)
maxbits = 128;
else
maxbits = 48;
p = ndpi_patricia_new(maxbits);
ndpi_patricia_get_maxbits(p);
ndpi_patricia_process(p, process_ptree_data);
ndpi_patricia_walk_tree_inorder(p, process3_ptree_data, NULL);
/* "Random" add */
num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();
for (i = 0; i < num_iteration; i++) {
if (tree_type == 0) {
if(fuzzed_data.remaining_bytes() > 4) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(4);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 33); /* 33 to force error */
ndpi_fill_prefix_v4(&prefix, (struct in_addr *)ip, ip_len, 32);
node = ndpi_patricia_lookup(p, &prefix);
/* Keep one random node really added */
if (node && is_added == 0 && fuzzed_data.ConsumeBool()) {
is_added = 1;
prefix_added = prefix;
/* Some random operations on this node */
ndpi_patricia_get_node_prefix(node);
ndpi_patricia_get_node_bits(node);
ndpi_patricia_set_node_data(node, NULL);
assert(ndpi_patricia_get_node_data(node) == NULL);
ndpi_patricia_set_node_u64(node, 0);
assert(ndpi_patricia_get_node_u64(node) == 0);
}
}
} else if (tree_type == 1){
if(fuzzed_data.remaining_bytes() > 16) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(16);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 129); /* 129 to force error */
ndpi_fill_prefix_v6(&prefix, (const struct in6_addr *)ip, ip_len, 128);
node = ndpi_patricia_lookup(p, &prefix);
/* Keep one random node really added */
if (node && is_added == 0 && fuzzed_data.ConsumeBool()) {
is_added = 1;
prefix_added = prefix;
/* Some random operations on this node */
ndpi_patricia_get_node_prefix(node);
ndpi_patricia_get_node_bits(node);
ndpi_patricia_set_node_data(node, NULL);
assert(ndpi_patricia_get_node_data(node) == NULL);
ndpi_patricia_set_node_u64(node, 0);
assert(ndpi_patricia_get_node_u64(node) == 0);
}
}
} else {
if(fuzzed_data.remaining_bytes() > 6) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(6);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 49); /* 49 to force error */
ndpi_fill_prefix_mac(&prefix, ip, ip_len, 48);
node = ndpi_patricia_lookup(p, &prefix);
/* Keep one random node really added */
if (node && is_added == 0 && fuzzed_data.ConsumeBool()) {
is_added = 1;
prefix_added = prefix;
/* Some random operations on this node */
ndpi_patricia_get_node_prefix(node);
ndpi_patricia_get_node_bits(node);
ndpi_patricia_set_node_data(node, NULL);
assert(ndpi_patricia_get_node_data(node) == NULL);
ndpi_patricia_set_node_u64(node, 0);
assert(ndpi_patricia_get_node_u64(node) == 0);
}
}
}
}
ndpi_patricia_process(p, process_ptree_data);
ndpi_patricia_walk_tree_inorder(p, process3_ptree_data, NULL);
/* "Random" exact search. Remove if found */
num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();
for (i = 0; i < num_iteration; i++) {
if (tree_type == 0) {
if(fuzzed_data.remaining_bytes() > 4) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(4);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 32);
ndpi_fill_prefix_v4(&prefix, (struct in_addr *)ip, ip_len, 32);
node = ndpi_patricia_search_exact(p, &prefix);
if (node)
ndpi_patricia_remove(p, node);
}
} else if (tree_type == 1) {
if(fuzzed_data.remaining_bytes() > 16) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(16);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 128);
ndpi_fill_prefix_v6(&prefix, (const struct in6_addr *)ip, ip_len, 128);
node = ndpi_patricia_search_exact(p, &prefix);
if (node)
ndpi_patricia_remove(p, node);
}
} else {
if(fuzzed_data.remaining_bytes() > 6) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(6);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 48);
ndpi_fill_prefix_mac(&prefix, ip, ip_len, 48);
node = ndpi_patricia_search_exact(p, &prefix);
if (node)
ndpi_patricia_remove(p, node);
}
}
}
/* Exact search of an added node */
if (is_added)
ndpi_patricia_search_exact(p, &prefix_added);
/* "Random" best search. Remove if found */
num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();
for (i = 0; i < num_iteration; i++) {
if (tree_type == 0) {
if(fuzzed_data.remaining_bytes() > 4) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(4);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 32);
ndpi_fill_prefix_v4(&prefix, (struct in_addr *)ip, ip_len, 32);
node = ndpi_patricia_search_best(p, &prefix);
if (node)
ndpi_patricia_remove(p, node);
}
} else if (tree_type == 1) {
if(fuzzed_data.remaining_bytes() > 16) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(16);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 128);
ndpi_fill_prefix_v6(&prefix, (const struct in6_addr *)ip, ip_len, 128);
node = ndpi_patricia_search_best(p, &prefix);
if (node)
ndpi_patricia_remove(p, node);
}
} else {
if(fuzzed_data.remaining_bytes() > 6) {
std::vector<u_int8_t>data = fuzzed_data.ConsumeBytes<u_int8_t>(6);
ip = data.data();
ip_len = fuzzed_data.ConsumeIntegralInRange(0, 48);
ndpi_fill_prefix_mac(&prefix, ip, ip_len, 48);
node = ndpi_patricia_search_best(p, &prefix);
if (node)
ndpi_patricia_remove(p, node);
}
}
}
/* Best search of an added node */
if (is_added)
ndpi_patricia_search_best(p, &prefix_added);
p_cloned = ndpi_patricia_clone(p);
ndpi_patricia_process(p_cloned, process_ptree_data);
ndpi_patricia_walk_tree_inorder(p_cloned, process3_ptree_data, NULL);
ndpi_patricia_destroy(p, NULL);
ndpi_patricia_destroy(p_cloned, NULL);
return 0;
}
|