Coverage Report

Created: 2025-07-18 06:34

/src/immer/extra/fuzzer/map-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/map.hpp>
13
14
#include <immer/algorithm.hpp>
15
16
#include <array>
17
18
using st_memory = immer::memory_policy<immer::heap_policy<immer::cpp_heap>,
19
                                       immer::unsafe_refcount_policy,
20
                                       immer::no_lock_policy,
21
                                       immer::no_transience_policy,
22
                                       false>;
23
24
struct colliding_hash_t
25
{
26
    std::size_t operator()(const std::string& x) const
27
11.8M
    {
28
11.8M
        return std::hash<std::string>{}(x) & ~((std::size_t{1} << 48) - 1);
29
11.8M
    }
30
};
31
32
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
33
                                      std::size_t size)
34
3.72k
{
35
3.72k
    constexpr auto var_count = 4;
36
37
3.72k
    using map_t = immer::map<std::string,
38
3.72k
                             immer::box<std::string>,
39
3.72k
                             colliding_hash_t,
40
3.72k
                             std::equal_to<>,
41
3.72k
                             st_memory,
42
3.72k
                             3>;
43
44
3.72k
    auto vars = std::array<map_t, var_count>{};
45
46
1.50M
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
47
48
410k
    return fuzzer_input{data, size}.run([&](auto& in) {
49
410k
        enum ops
50
410k
        {
51
410k
            op_set,
52
410k
            op_erase,
53
410k
            op_set_move,
54
410k
            op_erase_move,
55
410k
            op_iterate,
56
410k
            op_find,
57
410k
            op_update,
58
410k
            op_update_move,
59
410k
            op_diff
60
410k
        };
61
410k
        auto src = read<char>(in, is_valid_var);
62
410k
        auto dst = read<char>(in, is_valid_var);
63
410k
        assert(vars[src].impl().check_champ());
64
0
        switch (read<char>(in)) {
65
22.9k
        case op_set: {
66
22.9k
            auto value = std::to_string(read<size_t>(in));
67
22.9k
            vars[dst]  = vars[src].set(value, "foo");
68
22.9k
            break;
69
0
        }
70
15.3k
        case op_erase: {
71
15.3k
            auto value = std::to_string(read<size_t>(in));
72
15.3k
            vars[dst]  = vars[src].erase(value);
73
15.3k
            break;
74
0
        }
75
15.5k
        case op_set_move: {
76
15.5k
            auto value = std::to_string(read<size_t>(in));
77
15.5k
            vars[dst]  = std::move(vars[src]).set(value, "foo");
78
15.5k
            break;
79
0
        }
80
10.3k
        case op_erase_move: {
81
10.3k
            auto value = std::to_string(read<size_t>(in));
82
10.3k
            vars[dst]  = std::move(vars[src]).erase(value);
83
10.3k
            break;
84
0
        }
85
11.4k
        case op_iterate: {
86
11.4k
            auto srcv = vars[src];
87
122k
            for (const auto& v : srcv) {
88
122k
                vars[dst] = vars[dst].set(v.first, v.second);
89
122k
            }
90
11.4k
            break;
91
0
        }
92
5.75k
        case op_find: {
93
5.75k
            auto value = std::to_string(read<size_t>(in));
94
5.75k
            auto res   = vars[src].find(value);
95
5.75k
            if (res != nullptr) {
96
3.89k
                vars[dst] = vars[dst].set(*res, "foo");
97
3.89k
            }
98
5.75k
            break;
99
0
        }
100
157k
        case op_update: {
101
157k
            auto key  = std::to_string(read<size_t>(in));
102
157k
            vars[dst] = vars[src].update(
103
157k
                key, [](std::string x) { return std::move(x) + "bar"; });
104
157k
            break;
105
0
        }
106
133k
        case op_update_move: {
107
133k
            auto key  = std::to_string(read<size_t>(in));
108
133k
            vars[dst] = std::move(vars[src]).update(
109
133k
                key, [](std::string x) { return std::move(x) + "baz"; });
110
133k
            break;
111
0
        }
112
21.8k
        case op_diff: {
113
21.8k
            auto&& a = vars[src];
114
21.8k
            auto&& b = vars[dst];
115
21.8k
            diff(
116
21.8k
                a,
117
21.8k
                b,
118
131k
                [&](auto&& x) {
119
131k
                    assert(!a.count(x.first));
120
0
                    assert(b.count(x.first));
121
131k
                },
122
148k
                [&](auto&& x) {
123
148k
                    assert(a.count(x.first));
124
0
                    assert(!b.count(x.first));
125
148k
                },
126
56.1k
                [&](auto&& x, auto&& y) {
127
56.1k
                    assert(x.first == y.first);
128
0
                    assert(x.second != y.second);
129
56.1k
                });
130
21.8k
        }
131
33.7k
        default:
132
33.7k
            break;
133
410k
        };
134
406k
        return true;
135
410k
    });
136
3.72k
}