Coverage Report

Created: 2026-01-25 06:57

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
60.3M
    {
28
60.3M
        return std::hash<std::string>{}(x) & ~((std::size_t{1} << 48) - 1);
29
60.3M
    }
30
};
31
32
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
33
                                      std::size_t size)
34
85.1k
{
35
85.1k
    constexpr auto var_count = 4;
36
37
85.1k
    using map_t = immer::map<std::string,
38
85.1k
                             immer::box<std::string>,
39
85.1k
                             colliding_hash_t,
40
85.1k
                             std::equal_to<>,
41
85.1k
                             st_memory,
42
85.1k
                             3>;
43
44
85.1k
    auto vars = std::array<map_t, var_count>{};
45
46
1.46M
    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
397k
        switch (read<char>(in)) {
65
20.9k
        case op_set: {
66
20.9k
            auto value = std::to_string(read<size_t>(in));
67
20.9k
            vars[dst]  = vars[src].set(value, "foo");
68
20.9k
            break;
69
0
        }
70
15.4k
        case op_erase: {
71
15.4k
            auto value = std::to_string(read<size_t>(in));
72
15.4k
            vars[dst]  = vars[src].erase(value);
73
15.4k
            break;
74
0
        }
75
15.1k
        case op_set_move: {
76
15.1k
            auto value = std::to_string(read<size_t>(in));
77
15.1k
            vars[dst]  = std::move(vars[src]).set(value, "foo");
78
15.1k
            break;
79
0
        }
80
8.94k
        case op_erase_move: {
81
8.94k
            auto value = std::to_string(read<size_t>(in));
82
8.94k
            vars[dst]  = std::move(vars[src]).erase(value);
83
8.94k
            break;
84
0
        }
85
11.1k
        case op_iterate: {
86
11.1k
            auto srcv = vars[src];
87
134k
            for (const auto& v : srcv) {
88
134k
                vars[dst] = vars[dst].set(v.first, v.second);
89
134k
            }
90
11.1k
            break;
91
0
        }
92
5.31k
        case op_find: {
93
5.31k
            auto value = std::to_string(read<size_t>(in));
94
5.31k
            auto res   = vars[src].find(value);
95
5.31k
            if (res != nullptr) {
96
3.48k
                vars[dst] = vars[dst].set(*res, "foo");
97
3.48k
            }
98
5.31k
            break;
99
0
        }
100
132k
        case op_update: {
101
132k
            auto key  = std::to_string(read<size_t>(in));
102
132k
            vars[dst] = vars[src].update(
103
132k
                key, [](std::string x) { return std::move(x) + "bar"; });
104
132k
            break;
105
0
        }
106
155k
        case op_update_move: {
107
155k
            auto key  = std::to_string(read<size_t>(in));
108
155k
            vars[dst] = std::move(vars[src]).update(
109
155k
                key, [](std::string x) { return std::move(x) + "baz"; });
110
155k
            break;
111
0
        }
112
19.6k
        case op_diff: {
113
19.6k
            auto&& a = vars[src];
114
19.6k
            auto&& b = vars[dst];
115
19.6k
            diff(
116
19.6k
                a,
117
19.6k
                b,
118
114k
                [&](auto&& x) {
119
114k
                    assert(!a.count(x.first));
120
114k
                    assert(b.count(x.first));
121
114k
                },
122
125k
                [&](auto&& x) {
123
125k
                    assert(a.count(x.first));
124
125k
                    assert(!b.count(x.first));
125
125k
                },
126
49.8k
                [&](auto&& x, auto&& y) {
127
49.8k
                    assert(x.first == y.first);
128
49.8k
                    assert(x.second != y.second);
129
49.8k
                });
130
19.6k
        }
131
32.2k
        default:
132
32.2k
            break;
133
397k
        };
134
397k
        return true;
135
397k
    });
136
85.1k
}