merge(3p/immer): Subtree merge at 'ad3e3556d' as 'third_party/immer'
Change-Id: I9636a41ad44b4218293833fd3e9456d9b07c731b
This commit is contained in:
commit
1213b086a1
311 changed files with 74223 additions and 0 deletions
103
third_party/immer/extra/fuzzer/array-gc.cpp
vendored
Normal file
103
third_party/immer/extra/fuzzer/array-gc.cpp
vendored
Normal file
|
|
@ -0,0 +1,103 @@
|
|||
//
|
||||
// immer: immutable data structures for C++
|
||||
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
|
||||
//
|
||||
// This software is distributed under the Boost Software License, Version 1.0.
|
||||
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
|
||||
//
|
||||
|
||||
#include "fuzzer_input.hpp"
|
||||
|
||||
#include <immer/array.hpp>
|
||||
#include <immer/array_transient.hpp>
|
||||
#include <immer/heap/gc_heap.hpp>
|
||||
#include <immer/refcount/no_refcount_policy.hpp>
|
||||
|
||||
#include <array>
|
||||
|
||||
using gc_memory = immer::memory_policy<immer::heap_policy<immer::gc_heap>,
|
||||
immer::no_refcount_policy,
|
||||
immer::gc_transience_policy,
|
||||
false>;
|
||||
|
||||
extern "C" int LLVMFuzzerTestOneInput(const std::uint8_t* data,
|
||||
std::size_t size)
|
||||
{
|
||||
constexpr auto var_count = 4;
|
||||
|
||||
using array_t = immer::array<int, gc_memory>;
|
||||
using transient_t = typename array_t::transient_type;
|
||||
using size_t = std::uint8_t;
|
||||
|
||||
auto vs = std::array<array_t, var_count>{};
|
||||
auto ts = std::array<transient_t, var_count>{};
|
||||
|
||||
auto is_valid_var = [&](auto idx) { return idx >= 0 && idx < var_count; };
|
||||
auto is_valid_index = [](auto& v) {
|
||||
return [&](auto idx) { return idx >= 0 && idx < v.size(); };
|
||||
};
|
||||
auto is_valid_size = [](auto& v) {
|
||||
return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
|
||||
};
|
||||
|
||||
return fuzzer_input{data, size}.run([&](auto& in) {
|
||||
enum ops
|
||||
{
|
||||
op_transient,
|
||||
op_persistent,
|
||||
op_push_back,
|
||||
op_update,
|
||||
op_take,
|
||||
op_push_back_mut,
|
||||
op_update_mut,
|
||||
op_take_mut,
|
||||
};
|
||||
auto dst = read<char>(in, is_valid_var);
|
||||
switch (read<char>(in)) {
|
||||
case op_transient: {
|
||||
auto src = read<char>(in, is_valid_var);
|
||||
ts[dst] = vs[src].transient();
|
||||
break;
|
||||
}
|
||||
case op_persistent: {
|
||||
auto src = read<char>(in, is_valid_var);
|
||||
vs[dst] = ts[src].persistent();
|
||||
break;
|
||||
}
|
||||
case op_push_back: {
|
||||
auto src = read<char>(in, is_valid_var);
|
||||
vs[dst] = vs[src].push_back(42);
|
||||
break;
|
||||
}
|
||||
case op_update: {
|
||||
auto src = read<char>(in, is_valid_var);
|
||||
auto idx = read<size_t>(in, is_valid_index(vs[src]));
|
||||
vs[dst] = vs[src].update(idx, [](auto x) { return x + 1; });
|
||||
break;
|
||||
}
|
||||
case op_take: {
|
||||
auto src = read<char>(in, is_valid_var);
|
||||
auto idx = read<size_t>(in, is_valid_size(vs[src]));
|
||||
vs[dst] = vs[src].take(idx);
|
||||
break;
|
||||
}
|
||||
case op_push_back_mut: {
|
||||
ts[dst].push_back(13);
|
||||
break;
|
||||
}
|
||||
case op_update_mut: {
|
||||
auto idx = read<size_t>(in, is_valid_index(ts[dst]));
|
||||
ts[dst].update(idx, [](auto x) { return x + 1; });
|
||||
break;
|
||||
}
|
||||
case op_take_mut: {
|
||||
auto idx = read<size_t>(in, is_valid_size(ts[dst]));
|
||||
ts[dst].take(idx);
|
||||
break;
|
||||
}
|
||||
default:
|
||||
break;
|
||||
};
|
||||
return true;
|
||||
});
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue