Coverage Report

Created: 2025-11-11 06:12

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