Coverage Report

Created: 2026-02-26 06:20

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