Coverage Report

Created: 2025-08-29 06:16

/src/immer/extra/fuzzer/set-st-str-conflict.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/box.hpp>
12
#include <immer/heap/gc_heap.hpp>
13
#include <immer/refcount/no_refcount_policy.hpp>
14
#include <immer/set.hpp>
15
16
#include <immer/algorithm.hpp>
17
18
#include <array>
19
20
using st_memory = immer::memory_policy<immer::heap_policy<immer::cpp_heap>,
21
                                       immer::unsafe_refcount_policy,
22
                                       immer::no_lock_policy,
23
                                       immer::no_transience_policy,
24
                                       false>;
25
26
struct colliding_hash_t
27
{
28
    std::size_t operator()(const std::string& x) const
29
15.2M
    {
30
15.2M
        return std::hash<std::string>{}(x) & ~((std::size_t{1} << 48) - 1);
31
15.2M
    }
32
};
33
34
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
35
                                      std::size_t size)
36
2.24k
{
37
2.24k
    constexpr auto var_count = 4;
38
39
2.24k
    using set_t = immer::
40
2.24k
        set<std::string, colliding_hash_t, std::equal_to<>, st_memory, 3>;
41
42
2.24k
    auto vars = std::array<set_t, var_count>{};
43
44
461k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
45
46
146k
    return fuzzer_input{data, size}.run([&](auto& in) {
47
146k
        enum ops
48
146k
        {
49
146k
            op_insert,
50
146k
            op_erase,
51
146k
            op_insert_move,
52
146k
            op_erase_move,
53
146k
            op_iterate,
54
146k
            op_diff
55
146k
        };
56
146k
        auto src = read<char>(in, is_valid_var);
57
146k
        auto dst = read<char>(in, is_valid_var);
58
146k
        assert(vars[src].impl().check_champ());
59
144k
        switch (read<char>(in)) {
60
32.2k
        case op_insert: {
61
32.2k
            auto value = std::to_string(read<size_t>(in));
62
32.2k
            vars[dst]  = vars[src].insert(value);
63
32.2k
            break;
64
0
        }
65
11.5k
        case op_erase: {
66
11.5k
            auto value = std::to_string(read<size_t>(in));
67
11.5k
            vars[dst]  = vars[src].erase(value);
68
11.5k
            break;
69
0
        }
70
32.4k
        case op_insert_move: {
71
32.4k
            auto value = std::to_string(read<size_t>(in));
72
32.4k
            vars[dst]  = std::move(vars[src]).insert(value);
73
32.4k
            break;
74
0
        }
75
15.6k
        case op_erase_move: {
76
15.6k
            auto value = std::to_string(read<size_t>(in));
77
15.6k
            vars[dst]  = std::move(vars[src]).erase(value);
78
15.6k
            break;
79
0
        }
80
9.78k
        case op_iterate: {
81
9.78k
            auto srcv = vars[src];
82
330k
            for (const auto& v : srcv) {
83
330k
                vars[dst] = vars[dst].insert(v);
84
330k
            }
85
9.78k
            break;
86
0
        }
87
26.3k
        case op_diff: {
88
26.3k
            auto&& a = vars[src];
89
26.3k
            auto&& b = vars[dst];
90
26.3k
            diff(
91
26.3k
                a,
92
26.3k
                b,
93
161k
                [&](auto&& x) {
94
161k
                    assert(!a.count(x));
95
161k
                    assert(b.count(x));
96
161k
                },
97
141k
                [&](auto&& x) {
98
141k
                    assert(a.count(x));
99
141k
                    assert(!b.count(x));
100
141k
                },
101
26.3k
                [&](auto&& x, auto&& y) { assert(false); });
102
26.3k
        }
103
42.4k
        default:
104
42.4k
            break;
105
144k
        };
106
144k
        return true;
107
144k
    });
108
2.24k
}