Coverage Report

Created: 2026-09-04 06:14

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