Coverage Report

Created: 2023-06-07 06:37

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