1 | // RUN: %clangxx_asan -O2 %s -o %t |
2 | // RUN: %env_asan_opts=fast_unwind_on_malloc=1 not %run %t 2>&1 | FileCheck %s --check-prefix=CHECK-FAST |
3 | // RUN: %env_asan_opts=fast_unwind_on_malloc=0 not %run %t 2>&1 | FileCheck %s --check-prefix=CHECK-SLOW |
4 | |
5 | // Test how well we unwind in presence of qsort in the stack |
6 | // (i.e. if we can unwind through a function compiled w/o frame pointers). |
7 | // https://code.google.com/p/address-sanitizer/issues/detail?id=137 |
8 | |
9 | // Fast unwinder is only available on x86_64 and i386. |
10 | // REQUIRES: x86-target-arch |
11 | |
12 | // REQUIRES: compiler-rt-optimized |
13 | |
14 | #include <stdlib.h> |
15 | #include <stdio.h> |
16 | |
17 | int *GlobalPtr; |
18 | |
19 | extern "C" { |
20 | int QsortCallback(const void *a, const void *b) { |
21 | char *x = (char*)a; |
22 | char *y = (char*)b; |
23 | printf(format: "Calling QsortCallback\n" ); |
24 | GlobalPtr = new int[10]; |
25 | return (int)*x - (int)*y; |
26 | } |
27 | |
28 | __attribute__((noinline)) |
29 | void MyQsort(char *a, size_t size) { |
30 | printf(format: "Calling qsort\n" ); |
31 | qsort(base: a, nmemb: size, size: sizeof(char), compar: QsortCallback); |
32 | printf(format: "Done\n" ); // Avoid tail call. |
33 | } |
34 | } // extern "C" |
35 | |
36 | int main() { |
37 | char a[2] = {1, 2}; |
38 | MyQsort(a, size: 2); |
39 | return GlobalPtr[10]; |
40 | } |
41 | |
42 | // Fast unwind may not unwind through qsort. |
43 | // CHECK-FAST: ERROR: AddressSanitizer: heap-buffer-overflow |
44 | // CHECK-FAST: is located 0 bytes after |
45 | // CHECK-FAST: #0{{.*}}operator new |
46 | // CHECK-FAST-NEXT: #1{{.*}}QsortCallback |
47 | |
48 | // CHECK-SLOW: ERROR: AddressSanitizer: heap-buffer-overflow |
49 | // CHECK-SLOW: is located 0 bytes after |
50 | // CHECK-SLOW: #0{{.*}}operator new |
51 | // CHECK-SLOW-NEXT: #1{{.*}}QsortCallback |
52 | // CHECK-SLOW: #{{.*}}MyQsort |
53 | // CHECK-SLOW-NEXT: #{{.*}}main |
54 | |