/src/immer/extra/fuzzer/map-st.cpp
Line | Count | Source (jump to first uncovered line) |
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 | 4.26M | 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 | 86.4k | { |
31 | 86.4k | constexpr auto var_count = 4; |
32 | | |
33 | 86.4k | using map_t = immer:: |
34 | 86.4k | map<std::size_t, int, colliding_hash_t, std::equal_to<>, st_memory>; |
35 | | |
36 | 86.4k | auto vars = std::array<map_t, var_count>{}; |
37 | | |
38 | 667k | auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
39 | | |
40 | 207k | return fuzzer_input{data, size}.run([&](auto& in) { |
41 | 207k | enum ops |
42 | 207k | { |
43 | 207k | op_set, |
44 | 207k | op_erase, |
45 | 207k | op_set_move, |
46 | 207k | op_erase_move, |
47 | 207k | op_iterate, |
48 | 207k | op_find, |
49 | 207k | op_update, |
50 | 207k | op_update_move, |
51 | 207k | op_diff |
52 | 207k | }; |
53 | 207k | auto src = read<char>(in, is_valid_var); |
54 | 207k | auto dst = read<char>(in, is_valid_var); |
55 | 207k | switch (read<char>(in)) { |
56 | 90.8k | case op_set: { |
57 | 90.8k | auto value = read<size_t>(in); |
58 | 90.8k | vars[dst] = vars[src].set(value, 42); |
59 | 90.8k | break; |
60 | 0 | } |
61 | 10.8k | case op_erase: { |
62 | 10.8k | auto value = read<size_t>(in); |
63 | 10.8k | vars[dst] = vars[src].erase(value); |
64 | 10.8k | break; |
65 | 0 | } |
66 | 14.4k | case op_set_move: { |
67 | 14.4k | auto value = read<size_t>(in); |
68 | 14.4k | vars[dst] = std::move(vars[src]).set(value, 42); |
69 | 14.4k | break; |
70 | 0 | } |
71 | 17.0k | case op_erase_move: { |
72 | 17.0k | auto value = read<size_t>(in); |
73 | 17.0k | vars[dst] = std::move(vars[src]).erase(value); |
74 | 17.0k | break; |
75 | 0 | } |
76 | 8.33k | case op_iterate: { |
77 | 8.33k | auto srcv = vars[src]; |
78 | 278k | for (const auto& v : srcv) { |
79 | 278k | vars[dst] = vars[dst].set(v.first, v.second); |
80 | 278k | } |
81 | 8.33k | break; |
82 | 0 | } |
83 | 2.54k | case op_find: { |
84 | 2.54k | auto value = read<size_t>(in); |
85 | 2.54k | auto res = vars[src].find(value); |
86 | 2.54k | if (res != nullptr) { |
87 | 1.02k | vars[dst] = vars[dst].set(*res, 42); |
88 | 1.02k | } |
89 | 2.54k | break; |
90 | 0 | } |
91 | 7.22k | case op_update: { |
92 | 7.22k | auto key = read<size_t>(in); |
93 | 7.22k | vars[dst] = vars[src].update(key, [](int x) { return x + 1; }); |
94 | 7.22k | break; |
95 | 0 | } |
96 | 16.7k | case op_update_move: { |
97 | 16.7k | auto key = read<size_t>(in); |
98 | 16.7k | vars[dst] = |
99 | 16.7k | std::move(vars[src]).update(key, [](int x) { return x + 1; }); |
100 | 16.7k | break; |
101 | 0 | } |
102 | 14.6k | case op_diff: { |
103 | 14.6k | auto&& a = vars[src]; |
104 | 14.6k | auto&& b = vars[dst]; |
105 | 14.6k | diff( |
106 | 14.6k | a, |
107 | 14.6k | b, |
108 | 121k | [&](auto&& x) { |
109 | 121k | assert(!a.count(x.first)); |
110 | 0 | assert(b.count(x.first)); |
111 | 121k | }, |
112 | 155k | [&](auto&& x) { |
113 | 155k | assert(a.count(x.first)); |
114 | 0 | assert(!b.count(x.first)); |
115 | 155k | }, |
116 | 14.6k | [&](auto&& x, auto&& y) { |
117 | 4.71k | assert(x.first == y.first); |
118 | 0 | assert(x.second != y.second); |
119 | 4.71k | }); |
120 | 14.6k | } |
121 | 34.7k | default: |
122 | 34.7k | break; |
123 | 207k | }; |
124 | 202k | return true; |
125 | 207k | }); |
126 | 86.4k | } |