1*10ab2aceSGeorge Karpenkov // This file is distributed under the University of Illinois Open Source
2*10ab2aceSGeorge Karpenkov // License. See LICENSE.TXT for details.
3*10ab2aceSGeorge Karpenkov 
4*10ab2aceSGeorge Karpenkov // Simple test for a fuzzer. The fuzzer must find the deep recursion.
5*10ab2aceSGeorge Karpenkov // To generate a crashy input:
6*10ab2aceSGeorge Karpenkov // for((i=0;i<110;i++)); do echo -n ABCDEFGHIJ  >> INPUT; done
7*10ab2aceSGeorge Karpenkov #include <cstddef>
8*10ab2aceSGeorge Karpenkov #include <cstdint>
9*10ab2aceSGeorge Karpenkov #include <cstdlib>
10*10ab2aceSGeorge Karpenkov 
11*10ab2aceSGeorge Karpenkov static volatile int Sink;
12*10ab2aceSGeorge Karpenkov 
13*10ab2aceSGeorge Karpenkov void Recursive(const uint8_t *Data, size_t Size, int Depth) {
14*10ab2aceSGeorge Karpenkov   if (Depth > 1000) abort();
15*10ab2aceSGeorge Karpenkov   if (!Size) return;
16*10ab2aceSGeorge Karpenkov   if (*Data == ('A' + Depth % 10))
17*10ab2aceSGeorge Karpenkov     Recursive(Data + 1, Size - 1, Depth + 1);
18*10ab2aceSGeorge Karpenkov   Sink++;
19*10ab2aceSGeorge Karpenkov }
20*10ab2aceSGeorge Karpenkov 
21*10ab2aceSGeorge Karpenkov extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
22*10ab2aceSGeorge Karpenkov   Recursive(Data, Size, 0);
23*10ab2aceSGeorge Karpenkov   return 0;
24*10ab2aceSGeorge Karpenkov }
25*10ab2aceSGeorge Karpenkov 
26