diff options
Diffstat (limited to 'llvm/lib/Fuzzer/test/RepeatedBytesTest.cpp')
-rw-r--r-- | llvm/lib/Fuzzer/test/RepeatedBytesTest.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/llvm/lib/Fuzzer/test/RepeatedBytesTest.cpp b/llvm/lib/Fuzzer/test/RepeatedBytesTest.cpp deleted file mode 100644 index 31868cf8c54..00000000000 --- a/llvm/lib/Fuzzer/test/RepeatedBytesTest.cpp +++ /dev/null @@ -1,31 +0,0 @@ -// 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 <cstddef> -#include <cstdint> -#include <cstdlib> -#include <iostream> -#include <ostream> - -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" - << std::flush; - exit(0); - } - return 0; -} - |