Coverage Report

Created: 2026-09-01 06:47

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/set.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/algorithm.hpp>
12
#include <immer/set.hpp>
13
14
#include <array>
15
16
struct colliding_hash_t
17
{
18
846k
    std::size_t operator()(std::size_t x) const { return x & ~15; }
19
};
20
21
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
22
                                      std::size_t size)
23
3.81k
{
24
3.81k
    constexpr auto var_count = 4;
25
26
3.81k
    using set_t = immer::set<std::size_t, colliding_hash_t>;
27
28
3.81k
    auto vars = std::array<set_t, var_count>{};
29
30
582k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
31
32
183k
    return fuzzer_input{data, size}.run([&](auto& in) {
33
183k
        enum ops
34
183k
        {
35
183k
            op_insert,
36
183k
            op_erase,
37
183k
            op_insert_move,
38
183k
            op_erase_move,
39
183k
            op_iterate,
40
183k
            op_diff
41
183k
        };
42
183k
        auto src = read<char>(in, is_valid_var);
43
183k
        auto dst = read<char>(in, is_valid_var);
44
183k
        switch (read<char>(in)) {
45
71.8k
        case op_insert: {
46
71.8k
            auto value = read<size_t>(in);
47
71.8k
            vars[dst]  = vars[src].insert(value);
48
71.8k
            break;
49
0
        }
50
6.88k
        case op_erase: {
51
6.88k
            auto value = read<size_t>(in);
52
6.88k
            vars[dst]  = vars[src].erase(value);
53
6.88k
            break;
54
0
        }
55
30.2k
        case op_insert_move: {
56
30.2k
            auto value = read<size_t>(in);
57
30.2k
            vars[dst]  = std::move(vars[src]).insert(value);
58
30.2k
            break;
59
0
        }
60
5.90k
        case op_erase_move: {
61
5.90k
            auto value = read<size_t>(in);
62
5.90k
            vars[dst]  = vars[src].erase(value);
63
5.90k
            break;
64
0
        }
65
4.40k
        case op_iterate: {
66
4.40k
            auto srcv = vars[src];
67
122k
            for (const auto& v : srcv) {
68
122k
                vars[dst] = vars[dst].insert(v);
69
122k
            }
70
4.40k
            break;
71
0
        }
72
23.4k
        case op_diff: {
73
23.4k
            auto&& a = vars[src];
74
23.4k
            auto&& b = vars[dst];
75
23.4k
            diff(
76
23.4k
                a,
77
23.4k
                b,
78
143k
                [&](auto&& x) {
79
143k
                    assert(!a.count(x));
80
143k
                    assert(b.count(x));
81
143k
                },
82
144k
                [&](auto&& x) {
83
144k
                    assert(a.count(x));
84
144k
                    assert(!b.count(x));
85
144k
                },
86
23.4k
                [&](auto&& x, auto&& y) { assert(false); });
87
23.4k
        }
88
60.6k
        default:
89
60.6k
            break;
90
183k
        };
91
179k
        return true;
92
183k
    });
93
3.81k
}