mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
2ee531c66a
llvm-svn: 238059
48 lines
1.4 KiB
C++
48 lines
1.4 KiB
C++
// Simple test for a fuzzer.
|
|
// The fuzzer must find the string "Hi!" preceded by a magic value.
|
|
// Uses UserSuppliedFuzzer which ensures that the magic is present.
|
|
#include <cstdint>
|
|
#include <cassert>
|
|
#include <cstdlib>
|
|
#include <cstddef>
|
|
#include <cstring>
|
|
#include <iostream>
|
|
|
|
#include "FuzzerInterface.h"
|
|
|
|
static const uint64_t kMagic = 8860221463604ULL;
|
|
|
|
class MyFuzzer : public fuzzer::UserSuppliedFuzzer {
|
|
public:
|
|
void TargetFunction(const uint8_t *Data, size_t Size) {
|
|
if (Size <= 10) return;
|
|
if (memcmp(Data, &kMagic, sizeof(kMagic))) return;
|
|
// It's hard to get here w/o advanced fuzzing techniques (e.g. cmp tracing).
|
|
// So, we simply 'fix' the data in the custom mutator.
|
|
if (Data[8] == 'H') {
|
|
if (Data[9] == 'i') {
|
|
if (Data[10] == '!') {
|
|
std::cout << "BINGO; Found the target, exiting\n";
|
|
exit(1);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// Custom mutator.
|
|
virtual size_t Mutate(uint8_t *Data, size_t Size, size_t MaxSize) {
|
|
assert(MaxSize > sizeof(kMagic));
|
|
if (Size < sizeof(kMagic))
|
|
Size = sizeof(kMagic);
|
|
// "Fix" the data, then mutate.
|
|
memcpy(Data, &kMagic, std::min(MaxSize, sizeof(kMagic)));
|
|
return BasicMutate(Data + sizeof(kMagic), Size - sizeof(kMagic),
|
|
MaxSize - sizeof(kMagic));
|
|
}
|
|
// No need to redefine CrossOver() here.
|
|
};
|
|
|
|
int main(int argc, char **argv) {
|
|
MyFuzzer F;
|
|
fuzzer::FuzzerDriver(argc, argv, F);
|
|
}
|