/src/immer/extra/fuzzer/array.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/array.hpp> |
12 | | |
13 | | #include <array> |
14 | | |
15 | | extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data, |
16 | | std::size_t size) |
17 | 647 | { |
18 | 647 | constexpr auto var_count = 4; |
19 | | |
20 | 647 | using array_t = immer::array<int, immer::default_memory_policy>; |
21 | 647 | using size_t = std::uint8_t; |
22 | | |
23 | 647 | auto vars = std::array<array_t, var_count>{}; |
24 | | |
25 | 942k | auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
26 | 9.54k | auto is_valid_index = [](auto& v) { |
27 | 125k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; |
28 | 9.54k | }; |
29 | 8.80k | auto is_valid_size = [](auto& v) { |
30 | 13.9k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; |
31 | 8.80k | }; |
32 | | // limit doing immutable pushes on vectors that are too big already to |
33 | | // prevent timeouts |
34 | 330k | auto too_big = [](auto&& v) { return v.size() > (std::size_t{1} << 10); }; |
35 | 360k | return fuzzer_input{data, size}.run([&](auto& in) { |
36 | 360k | enum ops |
37 | 360k | { |
38 | 360k | op_push_back, |
39 | 360k | op_update, |
40 | 360k | op_take, |
41 | 360k | op_push_back_move, |
42 | 360k | op_update_move, |
43 | 360k | op_take_move, |
44 | 360k | }; |
45 | 360k | auto src = read<char>(in, is_valid_var); |
46 | 360k | auto dst = read<char>(in, is_valid_var); |
47 | 360k | switch (read<char>(in)) { |
48 | 216k | case op_push_back: { |
49 | 216k | if (!too_big(vars[src])) |
50 | 173k | vars[dst] = vars[src].push_back(42); |
51 | 216k | break; |
52 | 0 | } |
53 | 2.64k | case op_update: { |
54 | 2.64k | auto idx = read<size_t>(in, is_valid_index(vars[src])); |
55 | 2.64k | vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); |
56 | 2.64k | break; |
57 | 0 | } |
58 | 6.25k | case op_take: { |
59 | 6.25k | auto idx = read<size_t>(in, is_valid_size(vars[src])); |
60 | 6.25k | vars[dst] = vars[src].take(idx); |
61 | 6.25k | break; |
62 | 0 | } |
63 | 113k | case op_push_back_move: { |
64 | 113k | if (!too_big(vars[src])) |
65 | 100k | vars[dst] = std::move(vars[src]).push_back(12); |
66 | 113k | break; |
67 | 0 | } |
68 | 6.90k | case op_update_move: { |
69 | 6.90k | auto idx = read<size_t>(in, is_valid_index(vars[src])); |
70 | 6.90k | vars[dst] = |
71 | 6.90k | std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); |
72 | 6.90k | break; |
73 | 0 | } |
74 | 2.54k | case op_take_move: { |
75 | 2.54k | auto idx = read<size_t>(in, is_valid_size(vars[src])); |
76 | 2.54k | vars[dst] = std::move(vars[src]).take(idx); |
77 | 2.54k | break; |
78 | 0 | } |
79 | 10.6k | default: |
80 | 10.6k | break; |
81 | 360k | }; |
82 | 359k | return true; |
83 | 360k | }); |
84 | 647 | } |