File: sanitizer_coverage_stack_depth.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (30 lines) | stat: -rw-r--r-- 784 bytes parent folder | download | duplicates (30) 
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
 
// Tests -fsanitize-coverage=stack-depth
//
// RUN: %clangxx -O0 -std=c++11 -fsanitize-coverage=stack-depth %s -o %t
// RUN: %run %t 2>&1 | FileCheck %s --implicit-check-not Assertion{{.*}}failed
// RUN: %clangxx -O0 -std=c++11 -fsanitize-coverage=trace-pc-guard,stack-depth \
// RUN:     %s -o %t
// RUN: %run %t 2>&1 | FileCheck %s --implicit-check-not Assertion{{.*}}failed

#include <cstdint>
#include <cstdio>
#include <cassert>

thread_local uintptr_t __sancov_lowest_stack;
uintptr_t last_stack;

void foo(int recurse) {
  assert(__sancov_lowest_stack < last_stack);
  last_stack = __sancov_lowest_stack;
  if (recurse <= 0) return;
  foo(recurse - 1);
}

int main() {
  last_stack = __sancov_lowest_stack;
  foo(100);
  printf("Success!\n");
  return 0;
}

// CHECK: Success!