|
| 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/fuzzer_input.hpp> |
| 10 | + |
| 11 | +#include <immer/box.hpp> |
| 12 | +#include <immer/flex_vector.hpp> |
| 13 | + |
| 14 | +#include <fmt/ranges.h> |
| 15 | +#include <immer/experimental/immer-archive/rbts/load.hpp> |
| 16 | +#include <immer/experimental/immer-archive/rbts/save.hpp> |
| 17 | + |
| 18 | +#include <array> |
| 19 | + |
| 20 | +namespace { |
| 21 | +void require_eq(const auto& a, const auto& b) |
| 22 | +{ |
| 23 | + if (a != b) { |
| 24 | + throw std::runtime_error{ |
| 25 | + fmt::format("{} != {}", fmt::join(a, ", "), fmt::join(b, ", "))}; |
| 26 | + } |
| 27 | +} |
| 28 | +} // namespace |
| 29 | + |
| 30 | +extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data, |
| 31 | + std::size_t size) |
| 32 | +{ |
| 33 | + constexpr auto var_count = 8; |
| 34 | + constexpr auto bits = 2; |
| 35 | + |
| 36 | + using vector_t = |
| 37 | + immer::flex_vector<int, immer::default_memory_policy, bits, bits>; |
| 38 | + using size_t = std::uint8_t; |
| 39 | + |
| 40 | + const auto check_save_and_load = [&](const auto& vec) { |
| 41 | + auto ar = immer_archive::rbts::make_save_archive_for(vec); |
| 42 | + auto vector_id = immer_archive::container_id{}; |
| 43 | + std::tie(ar, vector_id) = immer_archive::rbts::save_to_archive(vec, ar); |
| 44 | + |
| 45 | + auto loader = |
| 46 | + immer_archive::rbts::make_loader_for(vec, fix_leaf_nodes(ar)); |
| 47 | + auto loaded = loader.load(vector_id); |
| 48 | + require_eq(vec, loaded); |
| 49 | + }; |
| 50 | + |
| 51 | + auto vars = std::array<vector_t, var_count>{}; |
| 52 | + |
| 53 | + auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; }; |
| 54 | + auto is_valid_var_neq = [](auto other) { |
| 55 | + return [=](auto idx) { |
| 56 | + return idx >= 0 && idx < var_count && idx != other; |
| 57 | + }; |
| 58 | + }; |
| 59 | + auto is_valid_index = [](auto& v) { |
| 60 | + return [&](auto idx) { return idx >= 0 && idx < v.size(); }; |
| 61 | + }; |
| 62 | + auto is_valid_size = [](auto& v) { |
| 63 | + return [&](auto idx) { return idx >= 0 && idx <= v.size(); }; |
| 64 | + }; |
| 65 | + auto can_concat = [](auto&& v1, auto&& v2) { |
| 66 | + return v1.size() + v2.size() < vector_t::max_size() / 4; |
| 67 | + }; |
| 68 | + auto can_compare = [](auto&& v) { |
| 69 | + // avoid comparing vectors that are too big, and hence, slow to compare |
| 70 | + return v.size() < (1 << 15); |
| 71 | + }; |
| 72 | + return fuzzer_input{data, size}.run([&](auto& in) { |
| 73 | + enum ops |
| 74 | + { |
| 75 | + op_push_back, |
| 76 | + op_update, |
| 77 | + op_take, |
| 78 | + op_drop, |
| 79 | + op_concat, |
| 80 | + op_push_back_move, |
| 81 | + op_update_move, |
| 82 | + op_take_move, |
| 83 | + op_drop_move, |
| 84 | + op_concat_move_l, |
| 85 | + op_concat_move_r, |
| 86 | + op_concat_move_lr, |
| 87 | + op_insert, |
| 88 | + op_erase, |
| 89 | + op_compare, |
| 90 | + }; |
| 91 | + auto src = read<char>(in, is_valid_var); |
| 92 | + auto dst = read<char>(in, is_valid_var); |
| 93 | + const auto op = read<char>(in); |
| 94 | + SPDLOG_DEBUG("op = {}", static_cast<int>(op)); |
| 95 | + switch (op) { |
| 96 | + case op_push_back: { |
| 97 | + vars[dst] = vars[src].push_back(42); |
| 98 | + break; |
| 99 | + } |
| 100 | + case op_update: { |
| 101 | + auto idx = read<size_t>(in, is_valid_index(vars[src])); |
| 102 | + vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; }); |
| 103 | + break; |
| 104 | + } |
| 105 | + case op_take: { |
| 106 | + auto idx = read<size_t>(in, is_valid_size(vars[src])); |
| 107 | + vars[dst] = vars[src].take(idx); |
| 108 | + break; |
| 109 | + } |
| 110 | + case op_drop: { |
| 111 | + auto idx = read<size_t>(in, is_valid_size(vars[src])); |
| 112 | + vars[dst] = vars[src].drop(idx); |
| 113 | + break; |
| 114 | + } |
| 115 | + case op_concat: { |
| 116 | + auto src2 = read<char>(in, is_valid_var); |
| 117 | + if (can_concat(vars[src], vars[src2])) |
| 118 | + vars[dst] = vars[src] + vars[src2]; |
| 119 | + break; |
| 120 | + } |
| 121 | + case op_push_back_move: { |
| 122 | + vars[dst] = std::move(vars[src]).push_back(21); |
| 123 | + break; |
| 124 | + } |
| 125 | + case op_update_move: { |
| 126 | + auto idx = read<size_t>(in, is_valid_index(vars[src])); |
| 127 | + vars[dst] = |
| 128 | + std::move(vars[src]).update(idx, [](auto x) { return x + 1; }); |
| 129 | + break; |
| 130 | + } |
| 131 | + case op_take_move: { |
| 132 | + auto idx = read<size_t>(in, is_valid_size(vars[src])); |
| 133 | + vars[dst] = std::move(vars[src]).take(idx); |
| 134 | + break; |
| 135 | + } |
| 136 | + case op_drop_move: { |
| 137 | + auto idx = read<size_t>(in, is_valid_size(vars[src])); |
| 138 | + vars[dst] = std::move(vars[src]).drop(idx); |
| 139 | + break; |
| 140 | + } |
| 141 | + case op_concat_move_l: { |
| 142 | + auto src2 = read<char>(in, is_valid_var_neq(src)); |
| 143 | + if (can_concat(vars[src], vars[src2])) |
| 144 | + vars[dst] = std::move(vars[src]) + vars[src2]; |
| 145 | + break; |
| 146 | + } |
| 147 | + case op_concat_move_r: { |
| 148 | + auto src2 = read<char>(in, is_valid_var_neq(src)); |
| 149 | + if (can_concat(vars[src], vars[src2])) |
| 150 | + vars[dst] = vars[src] + std::move(vars[src2]); |
| 151 | + break; |
| 152 | + } |
| 153 | + case op_concat_move_lr: { |
| 154 | + auto src2 = read<char>(in, is_valid_var_neq(src)); |
| 155 | + if (can_concat(vars[src], vars[src2])) |
| 156 | + vars[dst] = std::move(vars[src]) + std::move(vars[src2]); |
| 157 | + break; |
| 158 | + } |
| 159 | + case op_compare: { |
| 160 | + using std::swap; |
| 161 | + if (can_compare(vars[src]) && vars[src] == vars[dst]) |
| 162 | + swap(vars[src], vars[dst]); |
| 163 | + break; |
| 164 | + } |
| 165 | + case op_erase: { |
| 166 | + auto idx = read<size_t>(in, is_valid_index(vars[src])); |
| 167 | + vars[dst] = vars[src].erase(idx); |
| 168 | + break; |
| 169 | + } |
| 170 | + case op_insert: { |
| 171 | + auto idx = read<size_t>(in, is_valid_size(vars[src])); |
| 172 | + vars[dst] = vars[src].insert(idx, immer::box<int>{42}); |
| 173 | + break; |
| 174 | + } |
| 175 | + default: |
| 176 | + break; |
| 177 | + }; |
| 178 | + |
| 179 | + check_save_and_load(vars[src]); |
| 180 | + check_save_and_load(vars[dst]); |
| 181 | + |
| 182 | + return true; |
| 183 | + }); |
| 184 | +} |
0 commit comments