File: StackOverflowTest.cpp

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (26 lines) | stat: -rw-r--r-- 667 bytes parent folder | download | duplicates (23) 
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
 
// 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

// Stack overflow test for a fuzzer. The fuzzer must find the string "Hi" and
// cause a stack overflow.
#include <cstddef>
#include <cstdint>

volatile int x;
volatile int y = 1;

void infinite_recursion(char *p) {
  char *buf = nullptr;

  if (y)
    infinite_recursion(buf);

  x = 1;
}

extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
  if (Size >= 2 && Data[0] == 'H' && Data[1] == 'i')
    infinite_recursion(nullptr);
  return 0;
}