Coverage Report

Created: 2026-10-28 06:04

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
624
{
18
624
    constexpr auto var_count = 4;
19
20
624
    using array_t = immer::array<int, immer::default_memory_policy>;
21
624
    using size_t  = std::uint8_t;
22
23
624
    auto vars = std::array<array_t, var_count>{};
24
25
969k
    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
26
11.3k
    auto is_valid_index = [](auto& v) {
27
103k
        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
28
11.3k
    };
29
9.10k
    auto is_valid_size = [](auto& v) {
30
18.1k
        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
31
9.10k
    };
32
    // limit doing immutable pushes on vectors that are too big already to
33
    // prevent timeouts
34
319k
    auto too_big = [](auto&& v) { return v.size() > (std::size_t{1} << 10); };
35
351k
    return fuzzer_input{data, size}.run([&](auto& in) {
36
351k
        enum ops
37
351k
        {
38
351k
            op_push_back,
39
351k
            op_update,
40
351k
            op_take,
41
351k
            op_push_back_move,
42
351k
            op_update_move,
43
351k
            op_take_move,
44
351k
        };
45
351k
        auto src = read<char>(in, is_valid_var);
46
351k
        auto dst = read<char>(in, is_valid_var);
47
351k
        switch (read<char>(in)) {
48
191k
        case op_push_back: {
49
191k
            if (!too_big(vars[src]))
50
181k
                vars[dst] = vars[src].push_back(42);
51
191k
            break;
52
0
        }
53
3.24k
        case op_update: {
54
3.24k
            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
55
3.24k
            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
56
3.24k
            break;
57
0
        }
58
3.95k
        case op_take: {
59
3.95k
            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
60
3.95k
            vars[dst] = vars[src].take(idx);
61
3.95k
            break;
62
0
        }
63
128k
        case op_push_back_move: {
64
128k
            if (!too_big(vars[src]))
65
123k
                vars[dst] = std::move(vars[src]).push_back(12);
66
128k
            break;
67
0
        }
68
8.12k
        case op_update_move: {
69
8.12k
            auto idx = read<size_t>(in, is_valid_index(vars[src]));
70
8.12k
            vars[dst] =
71
8.12k
                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
72
8.12k
            break;
73
0
        }
74
5.14k
        case op_take_move: {
75
5.14k
            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
76
5.14k
            vars[dst] = std::move(vars[src]).take(idx);
77
5.14k
            break;
78
0
        }
79
10.0k
        default:
80
10.0k
            break;
81
351k
        };
82
350k
        return true;
83
351k
    });
84
624
}