Coverage Report

Created: 2026-07-16 06:03

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
2.19k
{
27
2.19k
    auto guard = immer::gc_disable_guard{};
28
29
2.19k
    constexpr auto var_count = 4;
30
2.19k
    constexpr auto bits      = 2;
31
32
2.19k
    using vector_t    = immer::vector<int, gc_memory, bits, bits>;
33
2.19k
    using transient_t = typename vector_t::transient_type;
34
2.19k
    using size_t      = std::uint8_t;
35
36
2.19k
    auto vs = std::array<vector_t, var_count>{};
37
2.19k
    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
26.3k
    auto is_valid_index = [](auto& v) {
41
32.4k
        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
8.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
41
23.8k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
42
26.3k
    };
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
5.10k
    auto is_valid_index = [](auto& v) {
41
5.10k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
42
5.10k
    };
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
21.2k
    auto is_valid_index = [](auto& v) {
41
21.2k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
42
21.2k
    };
43
65.5k
    auto is_valid_size = [](auto& v) {
44
83.5k
        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
26.0k
        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.5k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
45
65.5k
    };
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
21.9k
    auto is_valid_size = [](auto& v) {
44
21.9k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
45
21.9k
    };
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
43.6k
    auto is_valid_size = [](auto& v) {
44
43.6k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
45
43.6k
    };
46
47
1.92M
    return fuzzer_input{data, size}.run([&](auto& in) {
48
1.92M
        enum ops
49
1.92M
        {
50
1.92M
            op_transient,
51
1.92M
            op_persistent,
52
1.92M
            op_push_back,
53
1.92M
            op_update,
54
1.92M
            op_take,
55
1.92M
            op_push_back_mut,
56
1.92M
            op_update_mut,
57
1.92M
            op_take_mut,
58
1.92M
        };
59
1.92M
        auto dst = read<char>(in, is_valid_var);
60
1.92M
        switch (read<char>(in)) {
61
64.5k
        case op_transient: {
62
64.5k
            auto src = read<char>(in, is_valid_var);
63
64.5k
            ts[dst]  = vs[src].transient();
64
64.5k
            break;
65
0
        }
66
7.57k
        case op_persistent: {
67
7.57k
            auto src = read<char>(in, is_valid_var);
68
7.57k
            vs[dst]  = ts[src].persistent();
69
7.57k
            break;
70
0
        }
71
4.91k
        case op_push_back: {
72
4.91k
            auto src = read<char>(in, is_valid_var);
73
4.91k
            vs[dst]  = vs[src].push_back(42);
74
4.91k
            break;
75
0
        }
76
5.13k
        case op_update: {
77
5.13k
            auto src = read<char>(in, is_valid_var);
78
5.13k
            auto idx = read<size_t>(in, is_valid_index(vs[src]));
79
5.13k
            vs[dst]  = vs[src].update(idx, [](auto x) { return x + 1; });
80
5.13k
            break;
81
0
        }
82
21.9k
        case op_take: {
83
21.9k
            auto src = read<char>(in, is_valid_var);
84
21.9k
            auto idx = read<size_t>(in, is_valid_size(vs[src]));
85
21.9k
            vs[dst]  = vs[src].take(idx);
86
21.9k
            break;
87
0
        }
88
1.74M
        case op_push_back_mut: {
89
1.74M
            ts[dst].push_back(13);
90
1.74M
            break;
91
0
        }
92
21.2k
        case op_update_mut: {
93
21.2k
            auto idx = read<size_t>(in, is_valid_index(ts[dst]));
94
21.2k
            ts[dst].update(idx, [](auto x) { return x + 1; });
95
21.2k
            break;
96
0
        }
97
43.6k
        case op_take_mut: {
98
43.6k
            auto idx = read<size_t>(in, is_valid_size(ts[dst]));
99
43.6k
            ts[dst].take(idx);
100
43.6k
            break;
101
0
        }
102
12.5k
        default:
103
12.5k
            break;
104
1.92M
        };
105
1.92M
        return true;
106
1.92M
    });
107
2.19k
}