mirror of
https://github.com/momo5502/emulator.git
synced 2026-01-19 03:33:56 +00:00
124 lines
2.7 KiB
C++
124 lines
2.7 KiB
C++
#include "input_generator.hpp"
|
|
|
|
#include <cassert>
|
|
|
|
namespace fuzzer
|
|
{
|
|
namespace
|
|
{
|
|
constexpr size_t MAX_TOP_SCORER = 20;
|
|
|
|
void mutate_input(random_generator& rng, std::vector<uint8_t>& input)
|
|
{
|
|
if (input.empty() || rng.get(3) == 0)
|
|
{
|
|
const auto new_bytes = rng.get_geometric<size_t>() + 1;
|
|
input.resize(input.size() + new_bytes);
|
|
}
|
|
else if (rng.get(10) == 0)
|
|
{
|
|
const auto remove_bytes = rng.get_geometric<size_t>() % input.size();
|
|
input.resize(input.size() - remove_bytes);
|
|
}
|
|
|
|
const auto mutations = (rng.get_geometric<size_t>() + 1) % input.size();
|
|
|
|
|
|
for (size_t i = 0; i < mutations; ++i)
|
|
{
|
|
const auto index = rng.get<size_t>(input.size());
|
|
input[index] = rng.get<uint8_t>();
|
|
}
|
|
}
|
|
}
|
|
|
|
input_generator::input_generator() = default;
|
|
|
|
std::vector<uint8_t> input_generator::generate_next_input()
|
|
{
|
|
std::vector<uint8_t> input{};
|
|
std::unique_lock lock{this->mutex_};
|
|
|
|
if (!this->top_scorer_.empty())
|
|
{
|
|
const auto index = this->rng.get<size_t>() % this->top_scorer_.size();
|
|
input = this->top_scorer_[index].data;
|
|
}
|
|
|
|
mutate_input(this->rng, input);
|
|
|
|
return input;
|
|
}
|
|
|
|
void input_generator::access_input(const std::function<input_handler>& handler)
|
|
{
|
|
auto next_input = this->generate_next_input();
|
|
const auto score = handler(next_input);
|
|
|
|
input_entry e{};
|
|
e.data = std::move(next_input);
|
|
e.score = score;
|
|
|
|
this->store_input_entry(std::move(e));
|
|
}
|
|
|
|
input_entry input_generator::get_highest_scorer()
|
|
{
|
|
std::unique_lock lock{this->mutex_};
|
|
return this->highest_scorer_;
|
|
}
|
|
|
|
double input_generator::get_average_score()
|
|
{
|
|
std::unique_lock lock{this->mutex_};
|
|
|
|
double score{0.0};
|
|
for (const auto& e : this->top_scorer_)
|
|
{
|
|
score += static_cast<double>(e.score);
|
|
}
|
|
|
|
return score / static_cast<double>(this->top_scorer_.size());
|
|
}
|
|
|
|
void input_generator::store_input_entry(input_entry entry)
|
|
{
|
|
std::unique_lock lock{this->mutex_};
|
|
|
|
if (entry.score < this->lowest_score && this->rng.get(40) != 0)
|
|
{
|
|
return;
|
|
}
|
|
|
|
if (entry.score > this->highest_scorer_.score)
|
|
{
|
|
this->highest_scorer_ = entry;
|
|
}
|
|
|
|
if (this->top_scorer_.size() < MAX_TOP_SCORER)
|
|
{
|
|
this->top_scorer_.emplace_back(std::move(entry));
|
|
return;
|
|
}
|
|
|
|
const auto insert_at_random = this->rng.get(10) == 0;
|
|
const auto index = insert_at_random
|
|
? (this->rng.get<size_t>() % this->top_scorer_.size())
|
|
: this->lowest_scorer;
|
|
|
|
this->top_scorer_[index] = std::move(entry);
|
|
|
|
this->lowest_score = this->top_scorer_[0].score;
|
|
this->lowest_scorer = 0;
|
|
|
|
for (size_t i = 1; i < this->top_scorer_.size(); ++i)
|
|
{
|
|
if (this->top_scorer_[i].score < this->lowest_score)
|
|
{
|
|
this->lowest_score = this->top_scorer_[i].score;
|
|
this->lowest_scorer = i;
|
|
}
|
|
}
|
|
}
|
|
}
|