Coverage Report

Created: 2026-01-25 06:56

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/vector-st.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/vector.hpp>
12
13
#include <array>
14
15
using st_memory = immer::memory_policy<immer::heap_policy<immer::cpp_heap>,
16
                                       immer::unsafe_refcount_policy,
17
                                       immer::no_lock_policy,
18
                                       immer::no_transience_policy,
19
                                       false>;
20
21
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
22
                                      std::size_t size)
23
2.34k
{
24
2.34k
    constexpr auto var_count = 4;
25
2.34k
    constexpr auto bits      = 2;
26
27
2.34k
    using vector_t = immer::vector<int, st_memory, bits, bits>;
28
2.34k
    using size_t   = std::uint8_t;
29
30
2.34k
    auto vars = std::array<vector_t, var_count>{};
31
32
2.95M
    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
33
25.8k
    auto is_valid_index = [](auto& v) {
34
71.0k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
35
25.8k
    };
36
54.0k
    auto is_valid_size = [](auto& v) {
37
66.8k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
38
54.0k
    };
39
40
1.41M
    return fuzzer_input{data, size}.run([&](auto& in) {
41
1.41M
        enum ops
42
1.41M
        {
43
1.41M
            op_push_back,
44
1.41M
            op_update,
45
1.41M
            op_take,
46
1.41M
            op_push_back_move,
47
1.41M
            op_update_move,
48
1.41M
            op_take_move,
49
1.41M
        };
50
1.41M
        auto src = read<char>(in, is_valid_var);
51
1.41M
        auto dst = read<char>(in, is_valid_var);
52
1.41M
        switch (read<char>(in)) {
53
1.15M
        case op_push_back: {
54
1.15M
            vars[dst] = vars[src].push_back(42);
55
1.15M
            break;
56
0
        }
57
19.9k
        case op_update: {
58
19.9k
            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
59
19.9k
            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
60
19.9k
            break;
61
0
        }
62
18.7k
        case op_take: {
63
18.7k
            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
64
18.7k
            vars[dst] = vars[src].take(idx);
65
18.7k
            break;
66
0
        }
67
177k
        case op_push_back_move: {
68
177k
            vars[dst] = std::move(vars[src]).push_back(12);
69
177k
            break;
70
0
        }
71
5.91k
        case op_update_move: {
72
5.91k
            auto idx = read<size_t>(in, is_valid_index(vars[src]));
73
5.91k
            vars[dst] =
74
5.91k
                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
75
5.91k
            break;
76
0
        }
77
35.3k
        case op_take_move: {
78
35.3k
            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
79
35.3k
            vars[dst] = std::move(vars[src]).take(idx);
80
35.3k
            break;
81
0
        }
82
3.31k
        default:
83
3.31k
            break;
84
1.41M
        };
85
1.41M
        return true;
86
1.41M
    });
87
2.34k
}