summaryrefslogtreecommitdiff
path: root/test/fuzzer/LargeTest.cpp
blob: 83ed6197180196fa283d77bf9256534292f7a314 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.

// A fuzz target with lots of edges.
#include <cstdint>
#include <cstdlib>

static inline void break_optimization(const void *arg) {
    __asm__ __volatile__("" : : "r" (arg) : "memory");
}

#define A                                         \
  do {                                            \
    i++;                                          \
    c++;                                          \
    if (Data[(i + __LINE__) % Size] == (c % 256)) \
      break_optimization(Data);                   \
    else                                          \
      break_optimization(0);                      \
  } while (0)

// for (int i = 0, n = Data[(__LINE__ - 1) % Size] % 16; i < n; i++)

#define B do{A; A; A; A; A; A; A; A; A; A; A; A; A; A; A; A; A; A; }while(0)
#define C do{B; B; B; B; B; B; B; B; B; B; B; B; B; B; B; B; B; B; }while(0)
#define D do{C; C; C; C; C; C; C; C; C; C; C; C; C; C; C; C; C; C; }while(0)
#define E do{D; D; D; D; D; D; D; D; D; D; D; D; D; D; D; D; D; D; }while(0)

volatile int sink;
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
  if (!Size) return 0;
  int c = 0;
  int i = 0;
  D;
  return 0;
}