/src/immer/extra/fuzzer/map-st.cpp
Line | Count | Source |
1 | | // |
2 | | // immer: immutable data structures for C++ |
3 | | // Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente |
4 | | // |
5 | | // This software is distributed under the Boost Software License, Version 1.0. |
6 | | // See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt |
7 | | // |
8 | | |
9 | | #include "fuzzer_input.hpp" |
10 | | |
11 | | #include <immer/map.hpp> |
12 | | |
13 | | #include <immer/algorithm.hpp> |
14 | | |
15 | | #include <array> |
16 | | |
17 | | using st_memory = immer::memory_policy<immer::heap_policy<immer::cpp_heap>, |
18 | | immer::unsafe_refcount_policy, |
19 | | immer::no_lock_policy, |
20 | | immer::no_transience_policy, |
21 | | false>; |
22 | | |
23 | | struct colliding_hash_t |
24 | | { |
25 | 800k | std::size_t operator()(std::size_t x) const { return x & ~15; } |
26 | | }; |
27 | | |
28 | | extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data, |
29 | | std::size_t size) |
30 | 5.07k | { |
31 | 5.07k | constexpr auto var_count = 4; |
32 | | |
33 | 5.07k | using map_t = immer:: |
34 | 5.07k | map<std::size_t, int, colliding_hash_t, std::equal_to<>, st_memory>; |
35 | | |
36 | 5.07k | auto vars = std::array<map_t, var_count>{}; |
37 | | |
38 | 646k | auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
39 | | |
40 | 203k | return fuzzer_input{data, size}.run([&](auto& in) { |
41 | 203k | enum ops |
42 | 203k | { |
43 | 203k | op_set, |
44 | 203k | op_erase, |
45 | 203k | op_set_move, |
46 | 203k | op_erase_move, |
47 | 203k | op_iterate, |
48 | 203k | op_find, |
49 | 203k | op_update, |
50 | 203k | op_update_move, |
51 | 203k | op_diff |
52 | 203k | }; |
53 | 203k | auto src = read<char>(in, is_valid_var); |
54 | 203k | auto dst = read<char>(in, is_valid_var); |
55 | 203k | switch (read<char>(in)) { |
56 | 83.4k | case op_set: { |
57 | 83.4k | auto value = read<size_t>(in); |
58 | 83.4k | vars[dst] = vars[src].set(value, 42); |
59 | 83.4k | break; |
60 | 0 | } |
61 | 9.97k | case op_erase: { |
62 | 9.97k | auto value = read<size_t>(in); |
63 | 9.97k | vars[dst] = vars[src].erase(value); |
64 | 9.97k | break; |
65 | 0 | } |
66 | 15.4k | case op_set_move: { |
67 | 15.4k | auto value = read<size_t>(in); |
68 | 15.4k | vars[dst] = std::move(vars[src]).set(value, 42); |
69 | 15.4k | break; |
70 | 0 | } |
71 | 20.3k | case op_erase_move: { |
72 | 20.3k | auto value = read<size_t>(in); |
73 | 20.3k | vars[dst] = std::move(vars[src]).erase(value); |
74 | 20.3k | break; |
75 | 0 | } |
76 | 8.35k | case op_iterate: { |
77 | 8.35k | auto srcv = vars[src]; |
78 | 303k | for (const auto& v : srcv) { |
79 | 303k | vars[dst] = vars[dst].set(v.first, v.second); |
80 | 303k | } |
81 | 8.35k | break; |
82 | 0 | } |
83 | 2.00k | case op_find: { |
84 | 2.00k | auto value = read<size_t>(in); |
85 | 2.00k | auto res = vars[src].find(value); |
86 | 2.00k | if (res != nullptr) { |
87 | 764 | vars[dst] = vars[dst].set(*res, 42); |
88 | 764 | } |
89 | 2.00k | break; |
90 | 0 | } |
91 | 6.95k | case op_update: { |
92 | 6.95k | auto key = read<size_t>(in); |
93 | 6.95k | vars[dst] = vars[src].update(key, [](int x) { return x + 1; }); |
94 | 6.95k | break; |
95 | 0 | } |
96 | 16.1k | case op_update_move: { |
97 | 16.1k | auto key = read<size_t>(in); |
98 | 16.1k | vars[dst] = |
99 | 16.1k | std::move(vars[src]).update(key, [](int x) { return x + 1; }); |
100 | 16.1k | break; |
101 | 0 | } |
102 | 17.1k | case op_diff: { |
103 | 17.1k | auto&& a = vars[src]; |
104 | 17.1k | auto&& b = vars[dst]; |
105 | 17.1k | diff( |
106 | 17.1k | a, |
107 | 17.1k | b, |
108 | 67.1k | [&](auto&& x) { |
109 | 67.1k | assert(!a.count(x.first)); |
110 | 67.1k | assert(b.count(x.first)); |
111 | 67.1k | }, |
112 | 84.2k | [&](auto&& x) { |
113 | 84.2k | assert(a.count(x.first)); |
114 | 84.2k | assert(!b.count(x.first)); |
115 | 84.2k | }, |
116 | 17.1k | [&](auto&& x, auto&& y) { |
117 | 4.55k | assert(x.first == y.first); |
118 | 4.55k | assert(x.second != y.second); |
119 | 4.55k | }); |
120 | 17.1k | } |
121 | 36.2k | default: |
122 | 36.2k | break; |
123 | 203k | }; |
124 | 198k | return true; |
125 | 203k | }); |
126 | 5.07k | } |