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
|
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//
#include "fuzzer_gc_guard.hpp"
#include "fuzzer_input.hpp"
#include <immer/heap/gc_heap.hpp>
#include <immer/map.hpp>
#include <immer/refcount/no_refcount_policy.hpp>
#include <immer/algorithm.hpp>
#include <array>
using gc_memory = immer::memory_policy<immer::heap_policy<immer::gc_heap>,
immer::no_refcount_policy,
immer::default_lock_policy,
immer::gc_transience_policy,
false>;
struct colliding_hash_t
{
std::size_t operator()(std::size_t x) const { return x & ~15; }
};
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
std::size_t size)
{
auto guard = fuzzer_gc_guard{};
constexpr auto var_count = 4;
using map_t = immer::
map<std::size_t, int, colliding_hash_t, std::equal_to<>, gc_memory>;
auto vars = std::array<map_t, var_count>{};
auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
return fuzzer_input{data, size}.run([&](auto& in) {
enum ops
{
op_set,
op_erase,
op_set_move,
op_erase_move,
op_iterate,
op_find,
op_update,
op_update_move,
op_update_if_exists,
op_update_if_exists_move,
op_diff
};
auto src = read<char>(in, is_valid_var);
auto dst = read<char>(in, is_valid_var);
switch (read<char>(in)) {
case op_set: {
auto value = read<size_t>(in);
vars[dst] = vars[src].set(value, 42);
break;
}
case op_erase: {
auto value = read<size_t>(in);
vars[dst] = vars[src].erase(value);
break;
}
case op_set_move: {
auto value = read<size_t>(in);
vars[dst] = std::move(vars[src]).set(value, 42);
break;
}
case op_erase_move: {
auto value = read<size_t>(in);
vars[dst] = std::move(vars[src]).erase(value);
break;
}
case op_iterate: {
auto srcv = vars[src];
for (const auto& v : srcv) {
vars[dst] = vars[dst].set(v.first, v.second);
}
break;
}
case op_find: {
auto value = read<size_t>(in);
auto res = vars[src].find(value);
if (res != nullptr) {
vars[dst] = vars[dst].set(*res, 42);
}
break;
}
case op_update: {
auto key = read<size_t>(in);
vars[dst] = vars[src].update(key, [](int x) { return x + 1; });
break;
}
case op_update_move: {
auto key = read<size_t>(in);
vars[dst] =
std::move(vars[src]).update(key, [](int x) { return x + 1; });
break;
}
case op_update_if_exists: {
auto key = read<size_t>(in);
vars[dst] =
vars[src].update_if_exists(key, [](int x) { return x + 1; });
break;
}
case op_update_if_exists_move: {
auto key = read<size_t>(in);
vars[dst] = std::move(vars[src]).update_if_exists(
key, [](int x) { return x + 1; });
break;
}
case op_diff: {
auto&& a = vars[src];
auto&& b = vars[dst];
diff(
a,
b,
[&](auto&& x) {
assert(!a.count(x.first));
assert(b.count(x.first));
},
[&](auto&& x) {
assert(a.count(x.first));
assert(!b.count(x.first));
},
[&](auto&& x, auto&& y) {
assert(x.first == y.first);
assert(x.second != y.second);
});
}
default:
break;
};
return true;
});
}
|
