1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
/* SPDX-License-Identifier: MIT */
/* Copyright © 2021 Max Bachmann */
#include "../rapidfuzz_reference/fuzz.hpp"
#include "fuzzing.hpp"
#include <cstdint>
#include <rapidfuzz/fuzz.hpp>
#include <stdexcept>
#include <string>
bool is_close(double a, double b, double epsilon)
{
return fabs(a - b) <= ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * epsilon);
}
void validate_distance(const std::vector<uint8_t>& s1, const std::vector<uint8_t>& s2)
{
auto sim = rapidfuzz::fuzz::partial_ratio(s1, s2);
auto reference_sim = rapidfuzz_reference::partial_ratio(s1, s2);
if (!is_close(sim, reference_sim, 0.0001)) {
print_seq("s1: ", s1);
print_seq("s2: ", s2);
throw std::logic_error(std::string("partial_ratio failed (reference_score = ") +
std::to_string(reference_sim) + std::string(", score = ") +
std::to_string(sim) + ")");
}
}
extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size)
{
std::vector<uint8_t> s1, s2;
if (!extract_strings(data, size, s1, s2)) return 0;
validate_distance(s1, s2);
validate_distance(s2, s1);
/* test long sequences */
for (unsigned int i = 2; i < 9; ++i) {
std::vector<uint8_t> s1_ = vec_multiply(s1, pow<size_t>(2, i));
std::vector<uint8_t> s2_ = vec_multiply(s2, pow<size_t>(2, i));
if (s1_.size() > 10000 || s2_.size() > 10000) break;
validate_distance(s1_, s2_);
validate_distance(s2_, s1_);
validate_distance(s1, s2_);
validate_distance(s2_, s1);
validate_distance(s1_, s2);
validate_distance(s2, s1_);
}
return 0;
}
|
