Coverage Report

Created: 2026-08-31 06:08

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_input.hpp"
10
11
#include <immer/heap/gc_heap.hpp>
12
#include <immer/refcount/no_refcount_policy.hpp>
13
#include <immer/vector.hpp>
14
#include <immer/vector_transient.hpp>
15
16
#include <array>
17
18
using gc_memory = immer::memory_policy<immer::heap_policy<immer::gc_heap>,
19
                                       immer::no_refcount_policy,
20
                                       immer::default_lock_policy,
21
                                       immer::gc_transience_policy,
22
                                       false>;
23
24
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
25
                                      std::size_t size)
26
83.8k
{
27
83.8k
    auto guard = immer::gc_disable_guard{};
28
29
83.8k
    constexpr auto var_count = 4;
30
83.8k
    constexpr auto bits      = 2;
31
32
83.8k
    using vector_t    = immer::vector<int, gc_memory, bits, bits>;
33
83.8k
    using transient_t = typename vector_t::transient_type;
34
83.8k
    using size_t      = std::uint8_t;
35
36
83.8k
    auto vs = std::array<vector_t, var_count>{};
37
83.8k
    auto ts = std::array<transient_t, var_count>{};
38
39
2.22M
    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
40
83.8k
    auto is_valid_index = [](auto& v) {
41
61.6k
        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
41
37.5k
        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
41
24.1k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
42
25.1k
    };
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
40
4.90k
    auto is_valid_index = [](auto& v) {
41
4.90k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
42
4.90k
    };
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
40
20.1k
    auto is_valid_index = [](auto& v) {
41
20.1k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
42
20.1k
    };
43
83.8k
    auto is_valid_size = [](auto& v) {
44
93.1k
        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
44
35.8k
        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
44
57.2k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
45
76.6k
    };
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
43
32.4k
    auto is_valid_size = [](auto& v) {
44
32.4k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
45
32.4k
    };
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
43
44.2k
    auto is_valid_size = [](auto& v) {
44
44.2k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
45
44.2k
    };
46
47
1.91M
    return fuzzer_input{data, size}.run([&](auto& in) {
48
1.91M
        enum ops
49
1.91M
        {
50
1.91M
            op_transient,
51
1.91M
            op_persistent,
52
1.91M
            op_push_back,
53
1.91M
            op_update,
54
1.91M
            op_take,
55
1.91M
            op_push_back_mut,
56
1.91M
            op_update_mut,
57
1.91M
            op_take_mut,
58
1.91M
        };
59
1.91M
        auto dst = read<char>(in, is_valid_var);
60
1.91M
        switch (read<char>(in)) {
61
68.6k
        case op_transient: {
62
68.6k
            auto src = read<char>(in, is_valid_var);
63
68.6k
            ts[dst]  = vs[src].transient();
64
68.6k
            break;
65
0
        }
66
12.0k
        case op_persistent: {
67
12.0k
            auto src = read<char>(in, is_valid_var);
68
12.0k
            vs[dst]  = ts[src].persistent();
69
12.0k
            break;
70
0
        }
71
6.18k
        case op_push_back: {
72
6.18k
            auto src = read<char>(in, is_valid_var);
73
6.18k
            vs[dst]  = vs[src].push_back(42);
74
6.18k
            break;
75
0
        }
76
4.94k
        case op_update: {
77
4.94k
            auto src = read<char>(in, is_valid_var);
78
4.94k
            auto idx = read<size_t>(in, is_valid_index(vs[src]));
79
4.94k
            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
80
4.94k
            break;
81
0
        }
82
32.4k
        case op_take: {
83
32.4k
            auto src = read<char>(in, is_valid_var);
84
32.4k
            auto idx = read<size_t>(in, is_valid_size(vs[src]));
85
32.4k
            vs[dst]  = vs[src].take(idx);
86
32.4k
            break;
87
0
        }
88
1.71M
        case op_push_back_mut: {
89
1.71M
            ts[dst].push_back(13);
90
1.71M
            break;
91
0
        }
92
20.1k
        case op_update_mut: {
93
20.1k
            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
94
20.1k
            ts[dst].update(idx, [](auto x) { return x + 1; });
95
20.1k
            break;
96
0
        }
97
44.2k
        case op_take_mut: {
98
44.2k
            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
99
44.2k
            ts[dst].take(idx);
100
44.2k
            break;
101
0
        }
102
12.0k
        default:
103
12.0k
            break;
104
1.91M
        };
105
1.91M
        return true;
106
1.91M
    });
107
83.8k
}