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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/* SPDX-License-Identifier: MIT */
/* Copyright © 2021 Max Bachmann */
#include "../rapidfuzz_reference/LCSseq.hpp"
#include "fuzzing.hpp"
#include <rapidfuzz/details/Range.hpp>
#include <rapidfuzz/distance/LCSseq.hpp>
#include <stdexcept>
#include <string>
template <size_t MaxLen>
void validate_simd(const std::vector<uint8_t>& s1, const std::vector<uint8_t>& s2)
{
#ifdef RAPIDFUZZ_SIMD
size_t count = s1.size() / MaxLen + ((s1.size() % MaxLen) != 0);
rapidfuzz::experimental::MultiLCSseq<MaxLen> scorer(count);
std::vector<std::vector<uint8_t>> strings;
for (auto it1 = s1.begin(); it1 != s1.end(); it1 += MaxLen) {
if (std::distance(it1, s1.end()) < static_cast<ptrdiff_t>(MaxLen)) {
strings.emplace_back(it1, s1.end());
break;
}
else {
strings.emplace_back(it1, it1 + MaxLen);
}
}
for (const auto& s : strings)
scorer.insert(s);
std::vector<size_t> simd_results(scorer.result_count());
scorer.similarity(&simd_results[0], simd_results.size(), s2);
for (size_t i = 0; i < strings.size(); ++i) {
size_t reference_score = rapidfuzz_reference::lcs_seq_similarity(strings[i], s2);
if (reference_score != simd_results[i]) {
print_seq("s1: ", s1);
print_seq("s2: ", s2);
throw std::logic_error(std::string("lcs distance using simd failed (score_cutoff = ") +
std::string(", reference_score = ") + std::to_string(reference_score) +
std::string(", score = ") + std::to_string(simd_results[i]) + ")");
}
}
#else
(void)s1;
(void)s2;
#endif
}
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;
}
if (s1.size() == 0) {
return 0;
}
validate_simd<8>(s1, s2);
validate_simd<16>(s1, s2);
validate_simd<32>(s1, s2);
validate_simd<64>(s1, s2);
return 0;
}
|
