/src/immer/extra/fuzzer/vector-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/vector.hpp> |
12 | | |
13 | | #include <array> |
14 | | |
15 | | using st_memory = immer::memory_policy<immer::heap_policy<immer::cpp_heap>, |
16 | | immer::unsafe_refcount_policy, |
17 | | immer::no_lock_policy, |
18 | | immer::no_transience_policy, |
19 | | false>; |
20 | | |
21 | | extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data, |
22 | | std::size_t size) |
23 | 86.4k | { |
24 | 86.4k | constexpr auto var_count = 4; |
25 | 86.4k | constexpr auto bits = 2; |
26 | | |
27 | 86.4k | using vector_t = immer::vector<int, st_memory, bits, bits>; |
28 | 86.4k | using size_t = std::uint8_t; |
29 | | |
30 | 86.4k | auto vars = std::array<vector_t, var_count>{}; |
31 | | |
32 | 3.55M | auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
33 | 86.4k | auto is_valid_index = [](auto& v) { |
34 | 59.1k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; |
35 | 29.1k | }; |
36 | 86.4k | auto is_valid_size = [](auto& v) { |
37 | 70.0k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; |
38 | 53.7k | }; |
39 | | |
40 | 1.71M | return fuzzer_input{data, size}.run([&](auto& in) { |
41 | 1.71M | enum ops |
42 | 1.71M | { |
43 | 1.71M | op_push_back, |
44 | 1.71M | op_update, |
45 | 1.71M | op_take, |
46 | 1.71M | op_push_back_move, |
47 | 1.71M | op_update_move, |
48 | 1.71M | op_take_move, |
49 | 1.71M | }; |
50 | 1.71M | auto src = read<char>(in, is_valid_var); |
51 | 1.71M | auto dst = read<char>(in, is_valid_var); |
52 | 1.71M | switch (read<char>(in)) { |
53 | 1.44M | case op_push_back: { |
54 | 1.44M | vars[dst] = vars[src].push_back(42); |
55 | 1.44M | break; |
56 | 0 | } |
57 | 22.6k | case op_update: { |
58 | 22.6k | auto idx = read<size_t>(in, is_valid_index(vars[src])); |
59 | 22.6k | vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); |
60 | 22.6k | break; |
61 | 0 | } |
62 | 19.5k | case op_take: { |
63 | 19.5k | auto idx = read<size_t>(in, is_valid_size(vars[src])); |
64 | 19.5k | vars[dst] = vars[src].take(idx); |
65 | 19.5k | break; |
66 | 0 | } |
67 | 186k | case op_push_back_move: { |
68 | 186k | vars[dst] = std::move(vars[src]).push_back(12); |
69 | 186k | break; |
70 | 0 | } |
71 | 6.55k | case op_update_move: { |
72 | 6.55k | auto idx = read<size_t>(in, is_valid_index(vars[src])); |
73 | 6.55k | vars[dst] = |
74 | 6.55k | std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); |
75 | 6.55k | break; |
76 | 0 | } |
77 | 34.2k | case op_take_move: { |
78 | 34.2k | auto idx = read<size_t>(in, is_valid_size(vars[src])); |
79 | 34.2k | vars[dst] = std::move(vars[src]).take(idx); |
80 | 34.2k | break; |
81 | 0 | } |
82 | 5.71k | default: |
83 | 5.71k | break; |
84 | 1.71M | }; |
85 | 1.71M | return true; |
86 | 1.71M | }); |
87 | 86.4k | } |