1*673dc3d4SNico Weber // Test ASan detection of stack-overflow condition when Linux sends SIGBUS.
2*673dc3d4SNico Weber
3*673dc3d4SNico Weber // RUN: %clangxx_asan -O0 %s -o %t && %env_asan_opts=use_sigaltstack=1 not %run %t 2>&1 | FileCheck %s
4*673dc3d4SNico Weber
5*673dc3d4SNico Weber #include <assert.h>
6*673dc3d4SNico Weber #include <stdio.h>
7*673dc3d4SNico Weber #include <stdlib.h>
8*673dc3d4SNico Weber #include <string.h>
9*673dc3d4SNico Weber #include <unistd.h>
10*673dc3d4SNico Weber #include <sys/mman.h>
11*673dc3d4SNico Weber #include <sys/resource.h>
12*673dc3d4SNico Weber
13*673dc3d4SNico Weber const int BS = 1024;
14*673dc3d4SNico Weber volatile char x;
15*673dc3d4SNico Weber volatile int y = 1;
16*673dc3d4SNico Weber
recursive_func(char * p)17*673dc3d4SNico Weber void recursive_func(char *p) {
18*673dc3d4SNico Weber char buf[BS];
19*673dc3d4SNico Weber buf[rand() % BS] = 1;
20*673dc3d4SNico Weber buf[rand() % BS] = 2;
21*673dc3d4SNico Weber x = buf[rand() % BS];
22*673dc3d4SNico Weber if (y)
23*673dc3d4SNico Weber recursive_func(buf);
24*673dc3d4SNico Weber x = 1; // prevent tail call optimization
25*673dc3d4SNico Weber // CHECK: {{stack-overflow on address 0x.* \(pc 0x.* bp 0x.* sp 0x.* T.*\)}}
26*673dc3d4SNico Weber }
27*673dc3d4SNico Weber
LimitStackAndReexec(int argc,char ** argv)28*673dc3d4SNico Weber void LimitStackAndReexec(int argc, char **argv) {
29*673dc3d4SNico Weber struct rlimit rlim;
30*673dc3d4SNico Weber int res = getrlimit(RLIMIT_STACK, &rlim);
31*673dc3d4SNico Weber assert(res == 0);
32*673dc3d4SNico Weber if (rlim.rlim_cur == RLIM_INFINITY) {
33*673dc3d4SNico Weber rlim.rlim_cur = 256 * 1024;
34*673dc3d4SNico Weber res = setrlimit(RLIMIT_STACK, &rlim);
35*673dc3d4SNico Weber assert(res == 0);
36*673dc3d4SNico Weber
37*673dc3d4SNico Weber execv(argv[0], argv);
38*673dc3d4SNico Weber assert(0 && "unreachable");
39*673dc3d4SNico Weber }
40*673dc3d4SNico Weber }
41*673dc3d4SNico Weber
main(int argc,char ** argv)42*673dc3d4SNico Weber int main(int argc, char **argv) {
43*673dc3d4SNico Weber LimitStackAndReexec(argc, argv);
44*673dc3d4SNico Weber
45*673dc3d4SNico Weber // Map some memory just before the start of the current stack vma.
46*673dc3d4SNico Weber // When the stack grows down and crashes into it, Linux can send
47*673dc3d4SNico Weber // SIGBUS instead of SIGSEGV. See:
48*673dc3d4SNico Weber // http://lkml.iu.edu/hypermail/linux/kernel/1008.1/02299.html
49*673dc3d4SNico Weber const long pagesize = sysconf(_SC_PAGESIZE);
50*673dc3d4SNico Weber FILE *f = fopen("/proc/self/maps", "r");
51*673dc3d4SNico Weber char a[1000];
52*673dc3d4SNico Weber void *p = 0;
53*673dc3d4SNico Weber while (fgets(a, sizeof a, f)) {
54*673dc3d4SNico Weber if (strstr(a, "[stack]")) {
55*673dc3d4SNico Weber unsigned long addr;
56*673dc3d4SNico Weber if (sscanf(a, "%lx", &addr) == 1)
57*673dc3d4SNico Weber p = mmap((void *)(addr - 4 * pagesize), pagesize, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
58*673dc3d4SNico Weber }
59*673dc3d4SNico Weber }
60*673dc3d4SNico Weber assert(p);
61*673dc3d4SNico Weber
62*673dc3d4SNico Weber recursive_func(0);
63*673dc3d4SNico Weber return 0;
64*673dc3d4SNico Weber }
65