Coverage Report

Created: 2026-08-31 06:07

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/map-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/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
15.7M
    {
28
15.7M
        return std::hash<std::string>{}(x) & ~((std::size_t{1} << 48) - 1);
29
15.7M
    }
30
};
31
32
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
33
                                      std::size_t size)
34
3.63k
{
35
3.63k
    constexpr auto var_count = 4;
36
37
3.63k
    using map_t = immer::map<std::string,
38
3.63k
                             immer::box<std::string>,
39
3.63k
                             colliding_hash_t,
40
3.63k
                             std::equal_to<>,
41
3.63k
                             st_memory,
42
3.63k
                             3>;
43
44
3.63k
    auto vars = std::array<map_t, var_count>{};
45
46
1.52M
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
47
48
401k
    return fuzzer_input{data, size}.run([&](auto& in) {
49
401k
        enum ops
50
401k
        {
51
401k
            op_set,
52
401k
            op_erase,
53
401k
            op_set_move,
54
401k
            op_erase_move,
55
401k
            op_iterate,
56
401k
            op_find,
57
401k
            op_update,
58
401k
            op_update_move,
59
401k
            op_diff
60
401k
        };
61
401k
        auto src = read<char>(in, is_valid_var);
62
401k
        auto dst = read<char>(in, is_valid_var);
63
401k
        assert(vars[src].impl().check_champ());
64
398k
        switch (read<char>(in)) {
65
24.1k
        case op_set: {
66
24.1k
            auto value = std::to_string(read<size_t>(in));
67
24.1k
            vars[dst]  = vars[src].set(value, "foo");
68
24.1k
            break;
69
0
        }
70
16.5k
        case op_erase: {
71
16.5k
            auto value = std::to_string(read<size_t>(in));
72
16.5k
            vars[dst]  = vars[src].erase(value);
73
16.5k
            break;
74
0
        }
75
16.0k
        case op_set_move: {
76
16.0k
            auto value = std::to_string(read<size_t>(in));
77
16.0k
            vars[dst]  = std::move(vars[src]).set(value, "foo");
78
16.0k
            break;
79
0
        }
80
10.2k
        case op_erase_move: {
81
10.2k
            auto value = std::to_string(read<size_t>(in));
82
10.2k
            vars[dst]  = std::move(vars[src]).erase(value);
83
10.2k
            break;
84
0
        }
85
10.9k
        case op_iterate: {
86
10.9k
            auto srcv = vars[src];
87
167k
            for (const auto& v : srcv) {
88
167k
                vars[dst] = vars[dst].set(v.first, v.second);
89
167k
            }
90
10.9k
            break;
91
0
        }
92
5.99k
        case op_find: {
93
5.99k
            auto value = std::to_string(read<size_t>(in));
94
5.99k
            auto res   = vars[src].find(value);
95
5.99k
            if (res != nullptr) {
96
3.96k
                vars[dst] = vars[dst].set(*res, "foo");
97
3.96k
            }
98
5.99k
            break;
99
0
        }
100
138k
        case op_update: {
101
138k
            auto key  = std::to_string(read<size_t>(in));
102
138k
            vars[dst] = vars[src].update(
103
138k
                key, [](std::string x) { return std::move(x) + "bar"; });
104
138k
            break;
105
0
        }
106
137k
        case op_update_move: {
107
137k
            auto key  = std::to_string(read<size_t>(in));
108
137k
            vars[dst] = std::move(vars[src]).update(
109
137k
                key, [](std::string x) { return std::move(x) + "baz"; });
110
137k
            break;
111
0
        }
112
23.4k
        case op_diff: {
113
23.4k
            auto&& a = vars[src];
114
23.4k
            auto&& b = vars[dst];
115
23.4k
            diff(
116
23.4k
                a,
117
23.4k
                b,
118
171k
                [&](auto&& x) {
119
171k
                    assert(!a.count(x.first));
120
171k
                    assert(b.count(x.first));
121
171k
                },
122
189k
                [&](auto&& x) {
123
189k
                    assert(a.count(x.first));
124
189k
                    assert(!b.count(x.first));
125
189k
                },
126
60.2k
                [&](auto&& x, auto&& y) {
127
60.2k
                    assert(x.first == y.first);
128
60.2k
                    assert(x.second != y.second);
129
60.2k
                });
130
23.4k
        }
131
37.5k
        default:
132
37.5k
            break;
133
398k
        };
134
397k
        return true;
135
398k
    });
136
3.63k
}