/src/immer/extra/fuzzer/vector-gc.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_gc_guard.hpp" |
10 | | #include "fuzzer_input.hpp" |
11 | | |
12 | | #include <immer/heap/gc_heap.hpp> |
13 | | #include <immer/refcount/no_refcount_policy.hpp> |
14 | | #include <immer/vector.hpp> |
15 | | #include <immer/vector_transient.hpp> |
16 | | |
17 | | #include <array> |
18 | | |
19 | | using gc_memory = immer::memory_policy<immer::heap_policy<immer::gc_heap>, |
20 | | immer::no_refcount_policy, |
21 | | immer::default_lock_policy, |
22 | | immer::gc_transience_policy, |
23 | | false>; |
24 | | |
25 | | extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data, |
26 | | std::size_t size) |
27 | 82.6k | { |
28 | 82.6k | auto guard = fuzzer_gc_guard{}; |
29 | | |
30 | 82.6k | constexpr auto var_count = 4; |
31 | 82.6k | constexpr auto bits = 2; |
32 | | |
33 | 82.6k | using vector_t = immer::vector<int, gc_memory, bits, bits>; |
34 | 82.6k | using transient_t = typename vector_t::transient_type; |
35 | 82.6k | using size_t = std::uint8_t; |
36 | | |
37 | 82.6k | auto vs = std::array<vector_t, var_count>{}; |
38 | 82.6k | auto ts = std::array<transient_t, var_count>{}; |
39 | | |
40 | 2.01M | auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
41 | 82.6k | auto is_valid_index = [](auto& v) { |
42 | 84.5k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_1::operator()<immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const::{lambda(auto:1)#1}::operator()<unsigned char>(unsigned char) const Line | Count | Source | 42 | 64.6k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; |
vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_1::operator()<immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const::{lambda(auto:1)#1}::operator()<unsigned char>(unsigned char) const Line | Count | Source | 42 | 19.9k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; |
|
43 | 21.5k | }; vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_1::operator()<immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const Line | Count | Source | 41 | 4.31k | auto is_valid_index = [](auto& v) { | 42 | 4.31k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; | 43 | 4.31k | }; |
vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_1::operator()<immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const Line | Count | Source | 41 | 17.2k | auto is_valid_index = [](auto& v) { | 42 | 17.2k | return [&](auto idx) { return idx >= 0 && idx < v.size(); }; | 43 | 17.2k | }; |
|
44 | 82.6k | auto is_valid_size = [](auto& v) { |
45 | 80.3k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_2::operator()<immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const::{lambda(auto:1)#1}::operator()<unsigned char>(unsigned char) const Line | Count | Source | 45 | 30.5k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; |
vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_2::operator()<immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const::{lambda(auto:1)#1}::operator()<unsigned char>(unsigned char) const Line | Count | Source | 45 | 49.7k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; |
|
46 | 65.2k | }; vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_2::operator()<immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const Line | Count | Source | 44 | 27.8k | auto is_valid_size = [](auto& v) { | 45 | 27.8k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; | 46 | 27.8k | }; |
vector-gc.cpp:auto LLVMFuzzerTestOneInput::$_2::operator()<immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::vector_transient<int, immer::memory_policy<immer::heap_policy<immer::gc_heap>, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&) const Line | Count | Source | 44 | 37.4k | auto is_valid_size = [](auto& v) { | 45 | 37.4k | return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; | 46 | 37.4k | }; |
|
47 | | |
48 | 1.74M | return fuzzer_input{data, size}.run([&](auto& in) { |
49 | 1.74M | enum ops |
50 | 1.74M | { |
51 | 1.74M | op_transient, |
52 | 1.74M | op_persistent, |
53 | 1.74M | op_push_back, |
54 | 1.74M | op_update, |
55 | 1.74M | op_take, |
56 | 1.74M | op_push_back_mut, |
57 | 1.74M | op_update_mut, |
58 | 1.74M | op_take_mut, |
59 | 1.74M | }; |
60 | 1.74M | auto dst = read<char>(in, is_valid_var); |
61 | 1.74M | switch (read<char>(in)) { |
62 | 51.8k | case op_transient: { |
63 | 51.8k | auto src = read<char>(in, is_valid_var); |
64 | 51.8k | ts[dst] = vs[src].transient(); |
65 | 51.8k | break; |
66 | 0 | } |
67 | 9.08k | case op_persistent: { |
68 | 9.08k | auto src = read<char>(in, is_valid_var); |
69 | 9.08k | vs[dst] = ts[src].persistent(); |
70 | 9.08k | break; |
71 | 0 | } |
72 | 22.9k | case op_push_back: { |
73 | 22.9k | auto src = read<char>(in, is_valid_var); |
74 | 22.9k | vs[dst] = vs[src].push_back(42); |
75 | 22.9k | break; |
76 | 0 | } |
77 | 4.35k | case op_update: { |
78 | 4.35k | auto src = read<char>(in, is_valid_var); |
79 | 4.35k | auto idx = read<size_t>(in, is_valid_index(vs[src])); |
80 | 4.35k | vs[dst] = vs[src].update(idx, [](auto x) { return x + 1; }); |
81 | 4.35k | break; |
82 | 0 | } |
83 | 27.8k | case op_take: { |
84 | 27.8k | auto src = read<char>(in, is_valid_var); |
85 | 27.8k | auto idx = read<size_t>(in, is_valid_size(vs[src])); |
86 | 27.8k | vs[dst] = vs[src].take(idx); |
87 | 27.8k | break; |
88 | 0 | } |
89 | 1.55M | case op_push_back_mut: { |
90 | 1.55M | ts[dst].push_back(13); |
91 | 1.55M | break; |
92 | 0 | } |
93 | 17.2k | case op_update_mut: { |
94 | 17.2k | auto idx = read<size_t>(in, is_valid_index(ts[dst])); |
95 | 17.2k | ts[dst].update(idx, [](auto x) { return x + 1; }); |
96 | 17.2k | break; |
97 | 0 | } |
98 | 37.4k | case op_take_mut: { |
99 | 37.4k | auto idx = read<size_t>(in, is_valid_size(ts[dst])); |
100 | 37.4k | ts[dst].take(idx); |
101 | 37.4k | break; |
102 | 0 | } |
103 | 15.0k | default: |
104 | 15.0k | break; |
105 | 1.74M | }; |
106 | 1.74M | return true; |
107 | 1.74M | }); |
108 | 82.6k | } |