1*673dc3d4SNico Weber // Regression test for:
2*673dc3d4SNico Weber // http://code.google.com/p/address-sanitizer/issues/detail?id=37
3*673dc3d4SNico Weber 
4*673dc3d4SNico Weber // RUN: %clangxx_asan -O0 %s -o %t && %run %t | FileCheck %s
5*673dc3d4SNico Weber // RUN: %clangxx_asan -O1 %s -o %t && %run %t | FileCheck %s
6*673dc3d4SNico Weber // RUN: %clangxx_asan -O2 %s -o %t && %run %t | FileCheck %s
7*673dc3d4SNico Weber // RUN: %clangxx_asan -O3 %s -o %t && %run %t | FileCheck %s
8*673dc3d4SNico Weber 
9*673dc3d4SNico Weber #include <stdio.h>
10*673dc3d4SNico Weber #include <sched.h>
11*673dc3d4SNico Weber #include <sys/syscall.h>
12*673dc3d4SNico Weber #include <sys/types.h>
13*673dc3d4SNico Weber #include <sys/wait.h>
14*673dc3d4SNico Weber #include <unistd.h>
15*673dc3d4SNico Weber 
Child(void * arg)16*673dc3d4SNico Weber int Child(void *arg) {
17*673dc3d4SNico Weber   char x[32] = {0};  // Stack gets poisoned.
18*673dc3d4SNico Weber   printf("Child:  %p\n", x);
19*673dc3d4SNico Weber   _exit(1);  // NoReturn, stack will remain unpoisoned unless we do something.
20*673dc3d4SNico Weber }
21*673dc3d4SNico Weber 
main(int argc,char ** argv)22*673dc3d4SNico Weber int main(int argc, char **argv) {
23*673dc3d4SNico Weber   const int kStackSize = 1 << 20;
24*673dc3d4SNico Weber   char __attribute__((aligned(16))) child_stack[kStackSize + 1];
25*673dc3d4SNico Weber   char *sp = child_stack + kStackSize;  // Stack grows down.
26*673dc3d4SNico Weber   printf("Parent: %p\n", sp);
27*673dc3d4SNico Weber   pid_t clone_pid = clone(Child, sp, CLONE_FILES | CLONE_VM, NULL);
28*673dc3d4SNico Weber   int status;
29*673dc3d4SNico Weber   pid_t wait_result = waitpid(clone_pid, &status, __WCLONE);
30*673dc3d4SNico Weber   if (wait_result < 0) {
31*673dc3d4SNico Weber     perror("waitpid");
32*673dc3d4SNico Weber     return 0;
33*673dc3d4SNico Weber   }
34*673dc3d4SNico Weber   if (wait_result == clone_pid && WIFEXITED(status)) {
35*673dc3d4SNico Weber     // Make sure the child stack was indeed unpoisoned.
36*673dc3d4SNico Weber     for (int i = 0; i < kStackSize; i++)
37*673dc3d4SNico Weber       child_stack[i] = i;
38*673dc3d4SNico Weber     int ret = child_stack[argc - 1];
39*673dc3d4SNico Weber     printf("PASSED\n");
40*673dc3d4SNico Weber     // CHECK: PASSED
41*673dc3d4SNico Weber     return ret;
42*673dc3d4SNico Weber   }
43*673dc3d4SNico Weber   return 0;
44*673dc3d4SNico Weber }
45