Coverage Report

Created: 2026-10-28 06:04

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/map-st.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/map.hpp>
12
13
#include <immer/algorithm.hpp>
14
15
#include <array>
16
17
using st_memory = immer::memory_policy<immer::heap_policy<immer::cpp_heap>,
18
                                       immer::unsafe_refcount_policy,
19
                                       immer::no_lock_policy,
20
                                       immer::no_transience_policy,
21
                                       false>;
22
23
struct colliding_hash_t
24
{
25
590k
    std::size_t operator()(std::size_t x) const { return x & ~15; }
26
};
27
28
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
29
                                      std::size_t size)
30
4.96k
{
31
4.96k
    constexpr auto var_count = 4;
32
33
4.96k
    using map_t = immer::
34
4.96k
        map<std::size_t, int, colliding_hash_t, std::equal_to<>, st_memory>;
35
36
4.96k
    auto vars = std::array<map_t, var_count>{};
37
38
402k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
39
40
134k
    return fuzzer_input{data, size}.run([&](auto& in) {
41
134k
        enum ops
42
134k
        {
43
134k
            op_set,
44
134k
            op_erase,
45
134k
            op_set_move,
46
134k
            op_erase_move,
47
134k
            op_iterate,
48
134k
            op_find,
49
134k
            op_update,
50
134k
            op_update_move,
51
134k
            op_diff
52
134k
        };
53
134k
        auto src = read<char>(in, is_valid_var);
54
134k
        auto dst = read<char>(in, is_valid_var);
55
134k
        switch (read<char>(in)) {
56
55.9k
        case op_set: {
57
55.9k
            auto value = read<size_t>(in);
58
55.9k
            vars[dst]  = vars[src].set(value, 42);
59
55.9k
            break;
60
0
        }
61
6.40k
        case op_erase: {
62
6.40k
            auto value = read<size_t>(in);
63
6.40k
            vars[dst]  = vars[src].erase(value);
64
6.40k
            break;
65
0
        }
66
8.98k
        case op_set_move: {
67
8.98k
            auto value = read<size_t>(in);
68
8.98k
            vars[dst]  = std::move(vars[src]).set(value, 42);
69
8.98k
            break;
70
0
        }
71
9.10k
        case op_erase_move: {
72
9.10k
            auto value = read<size_t>(in);
73
9.10k
            vars[dst]  = std::move(vars[src]).erase(value);
74
9.10k
            break;
75
0
        }
76
6.99k
        case op_iterate: {
77
6.99k
            auto srcv = vars[src];
78
43.2k
            for (const auto& v : srcv) {
79
43.2k
                vars[dst] = vars[dst].set(v.first, v.second);
80
43.2k
            }
81
6.99k
            break;
82
0
        }
83
1.55k
        case op_find: {
84
1.55k
            auto value = read<size_t>(in);
85
1.55k
            auto res   = vars[src].find(value);
86
1.55k
            if (res != nullptr) {
87
602
                vars[dst] = vars[dst].set(*res, 42);
88
602
            }
89
1.55k
            break;
90
0
        }
91
2.37k
        case op_update: {
92
2.37k
            auto key  = read<size_t>(in);
93
2.37k
            vars[dst] = vars[src].update(key, [](int x) { return x + 1; });
94
2.37k
            break;
95
0
        }
96
16.5k
        case op_update_move: {
97
16.5k
            auto key = read<size_t>(in);
98
16.5k
            vars[dst] =
99
16.5k
                std::move(vars[src]).update(key, [](int x) { return x + 1; });
100
16.5k
            break;
101
0
        }
102
12.1k
        case op_diff: {
103
12.1k
            auto&& a = vars[src];
104
12.1k
            auto&& b = vars[dst];
105
12.1k
            diff(
106
12.1k
                a,
107
12.1k
                b,
108
91.0k
                [&](auto&& x) {
109
91.0k
                    assert(!a.count(x.first));
110
91.0k
                    assert(b.count(x.first));
111
91.0k
                },
112
118k
                [&](auto&& x) {
113
118k
                    assert(a.count(x.first));
114
118k
                    assert(!b.count(x.first));
115
118k
                },
116
12.1k
                [&](auto&& x, auto&& y) {
117
6.98k
                    assert(x.first == y.first);
118
6.98k
                    assert(x.second != y.second);
119
6.98k
                });
120
12.1k
        }
121
21.7k
        default:
122
21.7k
            break;
123
134k
        };
124
129k
        return true;
125
134k
    });
126
4.96k
}