Coverage Report

Created: 2025-10-12 06:29

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/set-st-str-conflict.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/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
60.7M
    {
30
60.7M
        return std::hash<std::string>{}(x) & ~((std::size_t{1} << 48) - 1);
31
60.7M
    }
32
};
33
34
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
35
                                      std::size_t size)
36
84.8k
{
37
84.8k
    constexpr auto var_count = 4;
38
39
84.8k
    using set_t = immer::
40
84.8k
        set<std::string, colliding_hash_t, std::equal_to<>, st_memory, 3>;
41
42
84.8k
    auto vars = std::array<set_t, var_count>{};
43
44
467k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
45
46
149k
    return fuzzer_input{data, size}.run([&](auto& in) {
47
149k
        enum ops
48
149k
        {
49
149k
            op_insert,
50
149k
            op_erase,
51
149k
            op_insert_move,
52
149k
            op_erase_move,
53
149k
            op_iterate,
54
149k
            op_diff
55
149k
        };
56
149k
        auto src = read<char>(in, is_valid_var);
57
149k
        auto dst = read<char>(in, is_valid_var);
58
149k
        assert(vars[src].impl().check_champ());
59
147k
        switch (read<char>(in)) {
60
32.4k
        case op_insert: {
61
32.4k
            auto value = std::to_string(read<size_t>(in));
62
32.4k
            vars[dst]  = vars[src].insert(value);
63
32.4k
            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
31.1k
        case op_insert_move: {
71
31.1k
            auto value = std::to_string(read<size_t>(in));
72
31.1k
            vars[dst]  = std::move(vars[src]).insert(value);
73
31.1k
            break;
74
0
        }
75
16.0k
        case op_erase_move: {
76
16.0k
            auto value = std::to_string(read<size_t>(in));
77
16.0k
            vars[dst]  = std::move(vars[src]).erase(value);
78
16.0k
            break;
79
0
        }
80
9.62k
        case op_iterate: {
81
9.62k
            auto srcv = vars[src];
82
299k
            for (const auto& v : srcv) {
83
299k
                vars[dst] = vars[dst].insert(v);
84
299k
            }
85
9.62k
            break;
86
0
        }
87
30.3k
        case op_diff: {
88
30.3k
            auto&& a = vars[src];
89
30.3k
            auto&& b = vars[dst];
90
30.3k
            diff(
91
30.3k
                a,
92
30.3k
                b,
93
148k
                [&](auto&& x) {
94
148k
                    assert(!a.count(x));
95
148k
                    assert(b.count(x));
96
148k
                },
97
130k
                [&](auto&& x) {
98
130k
                    assert(a.count(x));
99
130k
                    assert(!b.count(x));
100
130k
                },
101
30.3k
                [&](auto&& x, auto&& y) { assert(false); });
102
30.3k
        }
103
46.2k
        default:
104
46.2k
            break;
105
147k
        };
106
146k
        return true;
107
147k
    });
108
84.8k
}