Coverage Report

Created: 2025-11-09 06:33

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/vector-gc.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_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
2.19k
{
28
2.19k
    auto guard = fuzzer_gc_guard{};
29
30
2.19k
    constexpr auto var_count = 4;
31
2.19k
    constexpr auto bits      = 2;
32
33
2.19k
    using vector_t    = immer::vector<int, gc_memory, bits, bits>;
34
2.19k
    using transient_t = typename vector_t::transient_type;
35
2.19k
    using size_t      = std::uint8_t;
36
37
2.19k
    auto vs = std::array<vector_t, var_count>{};
38
2.19k
    auto ts = std::array<transient_t, var_count>{};
39
40
2.12M
    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
41
20.6k
    auto is_valid_index = [](auto& v) {
42
43.3k
        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
5.65k
        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
37.6k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
43
20.6k
    };
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.05k
    auto is_valid_index = [](auto& v) {
42
4.05k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
43
4.05k
    };
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
16.6k
    auto is_valid_index = [](auto& v) {
42
16.6k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
43
16.6k
    };
44
61.4k
    auto is_valid_size = [](auto& v) {
45
73.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
28.9k
        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
44.3k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
46
61.4k
    };
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
25.8k
    auto is_valid_size = [](auto& v) {
45
25.8k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
46
25.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
35.5k
    auto is_valid_size = [](auto& v) {
45
35.5k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
46
35.5k
    };
47
48
1.87M
    return fuzzer_input{data, size}.run([&](auto& in) {
49
1.87M
        enum ops
50
1.87M
        {
51
1.87M
            op_transient,
52
1.87M
            op_persistent,
53
1.87M
            op_push_back,
54
1.87M
            op_update,
55
1.87M
            op_take,
56
1.87M
            op_push_back_mut,
57
1.87M
            op_update_mut,
58
1.87M
            op_take_mut,
59
1.87M
        };
60
1.87M
        auto dst = read<char>(in, is_valid_var);
61
1.87M
        switch (read<char>(in)) {
62
50.1k
        case op_transient: {
63
50.1k
            auto src = read<char>(in, is_valid_var);
64
50.1k
            ts[dst]  = vs[src].transient();
65
50.1k
            break;
66
0
        }
67
7.33k
        case op_persistent: {
68
7.33k
            auto src = read<char>(in, is_valid_var);
69
7.33k
            vs[dst]  = ts[src].persistent();
70
7.33k
            break;
71
0
        }
72
3.28k
        case op_push_back: {
73
3.28k
            auto src = read<char>(in, is_valid_var);
74
3.28k
            vs[dst]  = vs[src].push_back(42);
75
3.28k
            break;
76
0
        }
77
4.09k
        case op_update: {
78
4.09k
            auto src = read<char>(in, is_valid_var);
79
4.09k
            auto idx = read<size_t>(in, is_valid_index(vs[src]));
80
4.09k
            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
81
4.09k
            break;
82
0
        }
83
25.8k
        case op_take: {
84
25.8k
            auto src = read<char>(in, is_valid_var);
85
25.8k
            auto idx = read<size_t>(in, is_valid_size(vs[src]));
86
25.8k
            vs[dst]  = vs[src].take(idx);
87
25.8k
            break;
88
0
        }
89
1.72M
        case op_push_back_mut: {
90
1.72M
            ts[dst].push_back(13);
91
1.72M
            break;
92
0
        }
93
16.6k
        case op_update_mut: {
94
16.6k
            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
95
16.6k
            ts[dst].update(idx, [](auto x) { return x + 1; });
96
16.6k
            break;
97
0
        }
98
35.5k
        case op_take_mut: {
99
35.5k
            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
100
35.5k
            ts[dst].take(idx);
101
35.5k
            break;
102
0
        }
103
11.2k
        default:
104
11.2k
            break;
105
1.87M
        };
106
1.87M
        return true;
107
1.87M
    });
108
2.19k
}