Coverage Report

Created: 2025-08-03 07:06

/src/immer/extra/fuzzer/set.cpp
Line
Count
Source (jump to first uncovered line)
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
3.37M
    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
86.5k
{
24
86.5k
    constexpr auto var_count = 4;
25
26
86.5k
    using set_t = immer::set<std::size_t, colliding_hash_t>;
27
28
86.5k
    auto vars = std::array<set_t, var_count>{};
29
30
646k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
31
32
171k
    return fuzzer_input{data, size}.run([&](auto& in) {
33
171k
        enum ops
34
171k
        {
35
171k
            op_insert,
36
171k
            op_erase,
37
171k
            op_insert_move,
38
171k
            op_erase_move,
39
171k
            op_iterate,
40
171k
            op_diff
41
171k
        };
42
171k
        auto src = read<char>(in, is_valid_var);
43
171k
        auto dst = read<char>(in, is_valid_var);
44
171k
        switch (read<char>(in)) {
45
71.0k
        case op_insert: {
46
71.0k
            auto value = read<size_t>(in);
47
71.0k
            vars[dst]  = vars[src].insert(value);
48
71.0k
            break;
49
0
        }
50
5.78k
        case op_erase: {
51
5.78k
            auto value = read<size_t>(in);
52
5.78k
            vars[dst]  = vars[src].erase(value);
53
5.78k
            break;
54
0
        }
55
32.1k
        case op_insert_move: {
56
32.1k
            auto value = read<size_t>(in);
57
32.1k
            vars[dst]  = std::move(vars[src]).insert(value);
58
32.1k
            break;
59
0
        }
60
6.47k
        case op_erase_move: {
61
6.47k
            auto value = read<size_t>(in);
62
6.47k
            vars[dst]  = vars[src].erase(value);
63
6.47k
            break;
64
0
        }
65
4.34k
        case op_iterate: {
66
4.34k
            auto srcv = vars[src];
67
127k
            for (const auto& v : srcv) {
68
127k
                vars[dst] = vars[dst].insert(v);
69
127k
            }
70
4.34k
            break;
71
0
        }
72
16.1k
        case op_diff: {
73
16.1k
            auto&& a = vars[src];
74
16.1k
            auto&& b = vars[dst];
75
16.1k
            diff(
76
16.1k
                a,
77
16.1k
                b,
78
80.4k
                [&](auto&& x) {
79
80.4k
                    assert(!a.count(x));
80
80.4k
                    assert(b.count(x));
81
80.4k
                },
82
70.8k
                [&](auto&& x) {
83
70.8k
                    assert(a.count(x));
84
70.8k
                    assert(!b.count(x));
85
70.8k
                },
86
16.1k
                [&](auto&& x, auto&& y) { assert(false); });
87
16.1k
        }
88
48.0k
        default:
89
48.0k
            break;
90
171k
        };
91
167k
        return true;
92
171k
    });
93
86.5k
}