Coverage Report

Created: 2025-12-14 06:43

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
581k
    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.74k
{
24
3.74k
    constexpr auto var_count = 4;
25
26
3.74k
    using set_t = immer::set<std::size_t, colliding_hash_t>;
27
28
3.74k
    auto vars = std::array<set_t, var_count>{};
29
30
612k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
31
32
182k
    return fuzzer_input{data, size}.run([&](auto& in) {
33
182k
        enum ops
34
182k
        {
35
182k
            op_insert,
36
182k
            op_erase,
37
182k
            op_insert_move,
38
182k
            op_erase_move,
39
182k
            op_iterate,
40
182k
            op_diff
41
182k
        };
42
182k
        auto src = read<char>(in, is_valid_var);
43
182k
        auto dst = read<char>(in, is_valid_var);
44
182k
        switch (read<char>(in)) {
45
71.9k
        case op_insert: {
46
71.9k
            auto value = read<size_t>(in);
47
71.9k
            vars[dst]  = vars[src].insert(value);
48
71.9k
            break;
49
0
        }
50
6.59k
        case op_erase: {
51
6.59k
            auto value = read<size_t>(in);
52
6.59k
            vars[dst]  = vars[src].erase(value);
53
6.59k
            break;
54
0
        }
55
31.2k
        case op_insert_move: {
56
31.2k
            auto value = read<size_t>(in);
57
31.2k
            vars[dst]  = std::move(vars[src]).insert(value);
58
31.2k
            break;
59
0
        }
60
6.04k
        case op_erase_move: {
61
6.04k
            auto value = read<size_t>(in);
62
6.04k
            vars[dst]  = vars[src].erase(value);
63
6.04k
            break;
64
0
        }
65
4.45k
        case op_iterate: {
66
4.45k
            auto srcv = vars[src];
67
104k
            for (const auto& v : srcv) {
68
104k
                vars[dst] = vars[dst].insert(v);
69
104k
            }
70
4.45k
            break;
71
0
        }
72
18.9k
        case op_diff: {
73
18.9k
            auto&& a = vars[src];
74
18.9k
            auto&& b = vars[dst];
75
18.9k
            diff(
76
18.9k
                a,
77
18.9k
                b,
78
82.7k
                [&](auto&& x) {
79
82.7k
                    assert(!a.count(x));
80
82.7k
                    assert(b.count(x));
81
82.7k
                },
82
80.4k
                [&](auto&& x) {
83
80.4k
                    assert(a.count(x));
84
80.4k
                    assert(!b.count(x));
85
80.4k
                },
86
18.9k
                [&](auto&& x, auto&& y) { assert(false); });
87
18.9k
        }
88
58.6k
        default:
89
58.6k
            break;
90
182k
        };
91
178k
        return true;
92
182k
    });
93
3.74k
}