mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-26 12:43:36 +01:00
771f098a4d
New mutation: InsertRepeatedBytes. Updated mutation: EraseByte => EraseBytes. This helps https://github.com/google/sanitizers/issues/710 where libFuzzer was not able to find a known bug. Now it finds it in minutes. Hopefully, the change is general enough to help other targets. llvm-svn: 278687
30 lines
845 B
C++
30 lines
845 B
C++
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
// Simple test for a fuzzer. The fuzzer must find repeated bytes.
|
|
#include <assert.h>
|
|
#include <cstdint>
|
|
#include <cstdlib>
|
|
#include <cstddef>
|
|
#include <iostream>
|
|
|
|
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
|
|
assert(Data);
|
|
// Looking for AAAAAAAAAAAAAAAAAAAAAA or some such.
|
|
size_t CurA = 0, MaxA = 0;
|
|
for (size_t i = 0; i < Size; i++) {
|
|
// Make sure there are no conditionals in the loop so that
|
|
// coverage can't help the fuzzer.
|
|
int EQ = Data[i] == 'A';
|
|
CurA = EQ * (CurA + 1);
|
|
int GT = CurA > MaxA;
|
|
MaxA = GT * CurA + (!GT) * MaxA;
|
|
}
|
|
if (MaxA >= 20) {
|
|
std::cout << "BINGO; Found the target (Max: " << MaxA << "), exiting\n";
|
|
exit(0);
|
|
}
|
|
return 0;
|
|
}
|
|
|