/src/immer/extra/fuzzer/set.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/algorithm.hpp> |
12 | | #include <immer/set.hpp> |
13 | | |
14 | | #include <array> |
15 | | |
16 | | struct colliding_hash_t |
17 | | { |
18 | 558k | std::size_t operator()(std::size_t x) const { return x & ~15; } |
19 | | }; |
20 | | |
21 | | extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data, |
22 | | std::size_t size) |
23 | 3.79k | { |
24 | 3.79k | constexpr auto var_count = 4; |
25 | | |
26 | 3.79k | using set_t = immer::set<std::size_t, colliding_hash_t>; |
27 | | |
28 | 3.79k | auto vars = std::array<set_t, var_count>{}; |
29 | | |
30 | 618k | auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
31 | | |
32 | 184k | return fuzzer_input{data, size}.run([&](auto& in) { |
33 | 184k | enum ops |
34 | 184k | { |
35 | 184k | op_insert, |
36 | 184k | op_erase, |
37 | 184k | op_insert_move, |
38 | 184k | op_erase_move, |
39 | 184k | op_iterate, |
40 | 184k | op_diff |
41 | 184k | }; |
42 | 184k | auto src = read<char>(in, is_valid_var); |
43 | 184k | auto dst = read<char>(in, is_valid_var); |
44 | 184k | switch (read<char>(in)) { |
45 | 72.6k | case op_insert: { |
46 | 72.6k | auto value = read<size_t>(in); |
47 | 72.6k | vars[dst] = vars[src].insert(value); |
48 | 72.6k | break; |
49 | 0 | } |
50 | 6.38k | case op_erase: { |
51 | 6.38k | auto value = read<size_t>(in); |
52 | 6.38k | vars[dst] = vars[src].erase(value); |
53 | 6.38k | break; |
54 | 0 | } |
55 | 30.7k | case op_insert_move: { |
56 | 30.7k | auto value = read<size_t>(in); |
57 | 30.7k | vars[dst] = std::move(vars[src]).insert(value); |
58 | 30.7k | break; |
59 | 0 | } |
60 | 6.26k | case op_erase_move: { |
61 | 6.26k | auto value = read<size_t>(in); |
62 | 6.26k | vars[dst] = vars[src].erase(value); |
63 | 6.26k | break; |
64 | 0 | } |
65 | 4.45k | case op_iterate: { |
66 | 4.45k | auto srcv = vars[src]; |
67 | 111k | for (const auto& v : srcv) { |
68 | 111k | vars[dst] = vars[dst].insert(v); |
69 | 111k | } |
70 | 4.45k | break; |
71 | 0 | } |
72 | 18.8k | case op_diff: { |
73 | 18.8k | auto&& a = vars[src]; |
74 | 18.8k | auto&& b = vars[dst]; |
75 | 18.8k | diff( |
76 | 18.8k | a, |
77 | 18.8k | b, |
78 | 73.0k | [&](auto&& x) { |
79 | 73.0k | assert(!a.count(x)); |
80 | 73.0k | assert(b.count(x)); |
81 | 73.0k | }, |
82 | 74.7k | [&](auto&& x) { |
83 | 74.7k | assert(a.count(x)); |
84 | 74.7k | assert(!b.count(x)); |
85 | 74.7k | }, |
86 | 18.8k | [&](auto&& x, auto&& y) { assert(false); }); |
87 | 18.8k | } |
88 | 60.2k | default: |
89 | 60.2k | break; |
90 | 184k | }; |
91 | 180k | return true; |
92 | 184k | }); |
93 | 3.79k | } |