Coverage Report

Created: 2026-01-22 06:46

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
832k
    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
5.04k
{
31
5.04k
    constexpr auto var_count = 4;
32
33
5.04k
    using map_t = immer::
34
5.04k
        map<std::size_t, int, colliding_hash_t, std::equal_to<>, st_memory>;
35
36
5.04k
    auto vars = std::array<map_t, var_count>{};
37
38
647k
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
39
40
204k
    return fuzzer_input{data, size}.run([&](auto& in) {
41
204k
        enum ops
42
204k
        {
43
204k
            op_set,
44
204k
            op_erase,
45
204k
            op_set_move,
46
204k
            op_erase_move,
47
204k
            op_iterate,
48
204k
            op_find,
49
204k
            op_update,
50
204k
            op_update_move,
51
204k
            op_diff
52
204k
        };
53
204k
        auto src = read<char>(in, is_valid_var);
54
204k
        auto dst = read<char>(in, is_valid_var);
55
204k
        switch (read<char>(in)) {
56
82.9k
        case op_set: {
57
82.9k
            auto value = read<size_t>(in);
58
82.9k
            vars[dst]  = vars[src].set(value, 42);
59
82.9k
            break;
60
0
        }
61
9.78k
        case op_erase: {
62
9.78k
            auto value = read<size_t>(in);
63
9.78k
            vars[dst]  = vars[src].erase(value);
64
9.78k
            break;
65
0
        }
66
18.2k
        case op_set_move: {
67
18.2k
            auto value = read<size_t>(in);
68
18.2k
            vars[dst]  = std::move(vars[src]).set(value, 42);
69
18.2k
            break;
70
0
        }
71
17.7k
        case op_erase_move: {
72
17.7k
            auto value = read<size_t>(in);
73
17.7k
            vars[dst]  = std::move(vars[src]).erase(value);
74
17.7k
            break;
75
0
        }
76
8.39k
        case op_iterate: {
77
8.39k
            auto srcv = vars[src];
78
279k
            for (const auto& v : srcv) {
79
279k
                vars[dst] = vars[dst].set(v.first, v.second);
80
279k
            }
81
8.39k
            break;
82
0
        }
83
2.06k
        case op_find: {
84
2.06k
            auto value = read<size_t>(in);
85
2.06k
            auto res   = vars[src].find(value);
86
2.06k
            if (res != nullptr) {
87
783
                vars[dst] = vars[dst].set(*res, 42);
88
783
            }
89
2.06k
            break;
90
0
        }
91
6.91k
        case op_update: {
92
6.91k
            auto key  = read<size_t>(in);
93
6.91k
            vars[dst] = vars[src].update(key, [](int x) { return x + 1; });
94
6.91k
            break;
95
0
        }
96
15.7k
        case op_update_move: {
97
15.7k
            auto key = read<size_t>(in);
98
15.7k
            vars[dst] =
99
15.7k
                std::move(vars[src]).update(key, [](int x) { return x + 1; });
100
15.7k
            break;
101
0
        }
102
17.9k
        case op_diff: {
103
17.9k
            auto&& a = vars[src];
104
17.9k
            auto&& b = vars[dst];
105
17.9k
            diff(
106
17.9k
                a,
107
17.9k
                b,
108
84.6k
                [&](auto&& x) {
109
84.6k
                    assert(!a.count(x.first));
110
84.6k
                    assert(b.count(x.first));
111
84.6k
                },
112
95.2k
                [&](auto&& x) {
113
95.2k
                    assert(a.count(x.first));
114
95.2k
                    assert(!b.count(x.first));
115
95.2k
                },
116
17.9k
                [&](auto&& x, auto&& y) {
117
4.45k
                    assert(x.first == y.first);
118
4.45k
                    assert(x.second != y.second);
119
4.45k
                });
120
17.9k
        }
121
37.9k
        default:
122
37.9k
            break;
123
204k
        };
124
199k
        return true;
125
204k
    });
126
5.04k
}