mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-22 20:43:44 +02:00
29 lines
737 B
C++
29 lines
737 B
C++
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
// Test that we can find the minimal item in the corpus (3 bytes: "FUZ").
|
|
#include <cstdint>
|
|
#include <cstdlib>
|
|
#include <cstddef>
|
|
#include <cstring>
|
|
#include <cstdio>
|
|
|
|
static volatile int Sink;
|
|
|
|
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
|
|
int8_t Ids[256];
|
|
memset(Ids, -1, sizeof(Ids));
|
|
for (size_t i = 0; i < Size; i++)
|
|
if (Ids[Data[i]] == -1)
|
|
Ids[Data[i]] = i;
|
|
int F = Ids[(unsigned char)'F'];
|
|
int U = Ids[(unsigned char)'U'];
|
|
int Z = Ids[(unsigned char)'Z'];
|
|
if (F >= 0 && U > F && Z > U) {
|
|
Sink++;
|
|
// printf("IDS: %d %d %d\n", F, U, Z);
|
|
}
|
|
return 0;
|
|
}
|
|
|