Coverage Report

Created: 2023-06-07 06:37

/src/immer/extra/fuzzer/map-st-str-conflict.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) & ~((std::size_t{1} << 48) - 1);
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
79.4k
                             3>;
43
44
79.4k
    auto vars = std::array<map_t, var_count>{};
45
46
1.84M
    auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
47
48
471k
    return fuzzer_input{data, size}.run([&](auto& in) {
49
471k
        enum ops
50
471k
        {
51
471k
            op_set,
52
471k
            op_erase,
53
471k
            op_set_move,
54
471k
            op_erase_move,
55
471k
            op_iterate,
56
471k
            op_find,
57
471k
            op_update,
58
471k
            op_update_move,
59
471k
            op_diff
60
471k
        };
61
471k
        auto src = read<char>(in, is_valid_var);
62
471k
        auto dst = read<char>(in, is_valid_var);
63
471k
        assert(vars[src].impl().check_champ());
64
0
        switch (read<char>(in)) {
65
32.1k
        case op_set: {
66
32.1k
            auto value = std::to_string(read<size_t>(in));
67
32.1k
            vars[dst]  = vars[src].set(value, "foo");
68
32.1k
            break;
69
0
        }
70
18.5k
        case op_erase: {
71
18.5k
            auto value = std::to_string(read<size_t>(in));
72
18.5k
            vars[dst]  = vars[src].erase(value);
73
18.5k
            break;
74
0
        }
75
22.3k
        case op_set_move: {
76
22.3k
            auto value = std::to_string(read<size_t>(in));
77
22.3k
            vars[dst]  = std::move(vars[src]).set(value, "foo");
78
22.3k
            break;
79
0
        }
80
11.5k
        case op_erase_move: {
81
11.5k
            auto value = std::to_string(read<size_t>(in));
82
11.5k
            vars[dst]  = std::move(vars[src]).erase(value);
83
11.5k
            break;
84
0
        }
85
14.9k
        case op_iterate: {
86
14.9k
            auto srcv = vars[src];
87
635k
            for (const auto& v : srcv) {
88
635k
                vars[dst] = vars[dst].set(v.first, v.second);
89
635k
            }
90
14.9k
            break;
91
0
        }
92
9.52k
        case op_find: {
93
9.52k
            auto value = std::to_string(read<size_t>(in));
94
9.52k
            auto res   = vars[src].find(value);
95
9.52k
            if (res != nullptr) {
96
6.87k
                vars[dst] = vars[dst].set(*res, "foo");
97
6.87k
            }
98
9.52k
            break;
99
0
        }
100
231k
        case op_update: {
101
231k
            auto key  = std::to_string(read<size_t>(in));
102
231k
            vars[dst] = vars[src].update(
103
231k
                key, [](std::string x) { return std::move(x) + "bar"; });
104
231k
            break;
105
0
        }
106
79.8k
        case op_update_move: {
107
79.8k
            auto key  = std::to_string(read<size_t>(in));
108
79.8k
            vars[dst] = std::move(vars[src]).update(
109
79.8k
                key, [](std::string x) { return std::move(x) + "baz"; });
110
79.8k
            break;
111
0
        }
112
28.7k
        case op_diff: {
113
28.7k
            auto&& a = vars[src];
114
28.7k
            auto&& b = vars[dst];
115
28.7k
            diff(
116
28.7k
                a,
117
28.7k
                b,
118
255k
                [&](auto&& x) {
119
255k
                    assert(!a.count(x.first));
120
0
                    assert(b.count(x.first));
121
255k
                },
122
263k
                [&](auto&& x) {
123
263k
                    assert(a.count(x.first));
124
0
                    assert(!b.count(x.first));
125
263k
                },
126
28.7k
                [&](auto&& x, auto&& y) {
127
24.5k
                    assert(x.first == y.first);
128
0
                    assert(x.second != y.second);
129
24.5k
                });
130
28.7k
        }
131
47.3k
        default:
132
47.3k
            break;
133
471k
        };
134
467k
        return true;
135
471k
    });
136
79.4k
}