mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-21 18:29:46 +00:00
ae0620c4e9
Introduce -mllvm -sanitizer-coverage-8bit-counters=1 which adds imprecise thread-unfriendly 8-bit coverage counters. The run-time library maps these 8-bit counters to 8-bit bitsets in the same way AFL (http://lcamtuf.coredump.cx/afl/technical_details.txt) does: counter values are divided into 8 ranges and based on the counter value one of the bits in the bitset is set. The AFL ranges are used here: 1, 2, 3, 4-7, 8-15, 16-31, 32-127, 128+. These counters provide a search heuristic for single-threaded coverage-guided fuzzers, we do not expect them to be useful for other purposes. Depending on the value of -fsanitize-coverage=[123] flag, these counters will be added to the function entry blocks (=1), every basic block (=2), or every edge (=3). Use these counters as an optional search heuristic in the Fuzzer library. Add a test where this heuristic is critical. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@231166 91177308-0d34-0410-b5e6-96231b3b80d8
15 lines
344 B
C++
15 lines
344 B
C++
// Test for a fuzzer: must find the case where a particular basic block is
|
|
// executed many times.
|
|
#include <iostream>
|
|
|
|
extern "C" void TestOneInput(const uint8_t *Data, size_t Size) {
|
|
int Num = 0;
|
|
for (size_t i = 0; i < Size; i++)
|
|
if (Data[i] == 'A' + i)
|
|
Num++;
|
|
if (Num >= 4) {
|
|
std::cerr << "BINGO!\n";
|
|
exit(1);
|
|
}
|
|
}
|