2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2017-08-22 07:25:50 +08:00
|
|
|
|
|
|
|
// Simple test for a fuzzer. The fuzzer must find the deep recursion.
|
|
|
|
// To generate a crashy input:
|
|
|
|
// for((i=0;i<110;i++)); do echo -n ABCDEFGHIJ >> INPUT; done
|
|
|
|
#include <cstddef>
|
|
|
|
#include <cstdint>
|
|
|
|
#include <cstdlib>
|
|
|
|
|
|
|
|
static volatile int Sink;
|
|
|
|
|
|
|
|
void Recursive(const uint8_t *Data, size_t Size, int Depth) {
|
|
|
|
if (Depth > 1000) abort();
|
|
|
|
if (!Size) return;
|
|
|
|
if (*Data == ('A' + Depth % 10))
|
|
|
|
Recursive(Data + 1, Size - 1, Depth + 1);
|
|
|
|
Sink++;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
|
|
|
|
Recursive(Data, Size, 0);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|