Coverage Report

Created: 2026-01-22 06:46

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/array.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/array.hpp>
12
13
#include <array>
14
15
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
16
                                      std::size_t size)
17
623
{
18
623
    constexpr auto var_count = 4;
19
20
623
    using array_t = immer::array<int, immer::default_memory_policy>;
21
623
    using size_t  = std::uint8_t;
22
23
623
    auto vars = std::array<array_t, var_count>{};
24
25
910k
    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
26
9.45k
    auto is_valid_index = [](auto& v) {
27
168k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
28
9.45k
    };
29
8.14k
    auto is_valid_size = [](auto& v) {
30
14.8k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
31
8.14k
    };
32
    // limit doing immutable pushes on vectors that are too big already to
33
    // prevent timeouts
34
323k
    auto too_big = [](auto&& v) { return v.size() > (std::size_t{1} << 10); };
35
348k
    return fuzzer_input{data, size}.run([&](auto& in) {
36
348k
        enum ops
37
348k
        {
38
348k
            op_push_back,
39
348k
            op_update,
40
348k
            op_take,
41
348k
            op_push_back_move,
42
348k
            op_update_move,
43
348k
            op_take_move,
44
348k
        };
45
348k
        auto src = read<char>(in, is_valid_var);
46
348k
        auto dst = read<char>(in, is_valid_var);
47
348k
        switch (read<char>(in)) {
48
172k
        case op_push_back: {
49
172k
            if (!too_big(vars[src]))
50
169k
                vars[dst] = vars[src].push_back(42);
51
172k
            break;
52
0
        }
53
3.81k
        case op_update: {
54
3.81k
            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
55
3.81k
            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
56
3.81k
            break;
57
0
        }
58
4.66k
        case op_take: {
59
4.66k
            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
60
4.66k
            vars[dst] = vars[src].take(idx);
61
4.66k
            break;
62
0
        }
63
151k
        case op_push_back_move: {
64
151k
            if (!too_big(vars[src]))
65
150k
                vars[dst] = std::move(vars[src]).push_back(12);
66
151k
            break;
67
0
        }
68
5.64k
        case op_update_move: {
69
5.64k
            auto idx = read<size_t>(in, is_valid_index(vars[src]));
70
5.64k
            vars[dst] =
71
5.64k
                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
72
5.64k
            break;
73
0
        }
74
3.48k
        case op_take_move: {
75
3.48k
            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
76
3.48k
            vars[dst] = std::move(vars[src]).take(idx);
77
3.48k
            break;
78
0
        }
79
5.99k
        default:
80
5.99k
            break;
81
348k
        };
82
347k
        return true;
83
348k
    });
84
623
}