1*7c3d14c8STreehugger Robot // Test for direct coverage writing with lots of data.
2*7c3d14c8STreehugger Robot // Current implementation maps output file in chunks of 64K. This test overflows
3*7c3d14c8STreehugger Robot // 1 chunk.
4*7c3d14c8STreehugger Robot
5*7c3d14c8STreehugger Robot // RUN: %clangxx_asan -fsanitize-coverage=func -O0 -DSHARED %s -shared -o %dynamiclib -fPIC
6*7c3d14c8STreehugger Robot // RUN: %clangxx_asan -fsanitize-coverage=func -O0 %s %libdl -o %t
7*7c3d14c8STreehugger Robot
8*7c3d14c8STreehugger Robot // RUN: rm -rf %T/coverage-direct-large
9*7c3d14c8STreehugger Robot
10*7c3d14c8STreehugger Robot // RUN: mkdir -p %T/coverage-direct-large/normal && cd %T/coverage-direct-large/normal
11*7c3d14c8STreehugger Robot // RUN: %env_asan_opts=coverage=1:coverage_direct=0:verbosity=1 %run %t %dynamiclib
12*7c3d14c8STreehugger Robot // RUN: %sancov print *.sancov >out.txt
13*7c3d14c8STreehugger Robot // RUN: cd ../..
14*7c3d14c8STreehugger Robot
15*7c3d14c8STreehugger Robot // RUN: mkdir -p %T/coverage-direct-large/direct && cd %T/coverage-direct-large/direct
16*7c3d14c8STreehugger Robot // RUN: %env_asan_opts=coverage=1:coverage_direct=1:verbosity=1 %run %t %dynamiclib
17*7c3d14c8STreehugger Robot // RUN: %sancov rawunpack *.sancov.raw
18*7c3d14c8STreehugger Robot // RUN: %sancov print *.sancov >out.txt
19*7c3d14c8STreehugger Robot // RUN: cd ../..
20*7c3d14c8STreehugger Robot
21*7c3d14c8STreehugger Robot // RUN: diff -u coverage-direct-large/normal/out.txt coverage-direct-large/direct/out.txt
22*7c3d14c8STreehugger Robot //
23*7c3d14c8STreehugger Robot // XFAIL: android
24*7c3d14c8STreehugger Robot
25*7c3d14c8STreehugger Robot #define F0(Q, x) Q(x)
26*7c3d14c8STreehugger Robot #define F1(Q, x) \
27*7c3d14c8STreehugger Robot F0(Q, x##0) F0(Q, x##1) F0(Q, x##2) F0(Q, x##3) F0(Q, x##4) F0(Q, x##5) \
28*7c3d14c8STreehugger Robot F0(Q, x##6) F0(Q, x##7) F0(Q, x##8) F0(Q, x##9)
29*7c3d14c8STreehugger Robot #define F2(Q, x) \
30*7c3d14c8STreehugger Robot F1(Q, x##0) F1(Q, x##1) F1(Q, x##2) F1(Q, x##3) F1(Q, x##4) F1(Q, x##5) \
31*7c3d14c8STreehugger Robot F1(Q, x##6) F1(Q, x##7) F1(Q, x##8) F1(Q, x##9)
32*7c3d14c8STreehugger Robot #define F3(Q, x) \
33*7c3d14c8STreehugger Robot F2(Q, x##0) F2(Q, x##1) F2(Q, x##2) F2(Q, x##3) F2(Q, x##4) F2(Q, x##5) \
34*7c3d14c8STreehugger Robot F2(Q, x##6) F2(Q, x##7) F2(Q, x##8) F2(Q, x##9)
35*7c3d14c8STreehugger Robot #define F4(Q, x) \
36*7c3d14c8STreehugger Robot F3(Q, x##0) F3(Q, x##1) F3(Q, x##2) F3(Q, x##3) F3(Q, x##4) F3(Q, x##5) \
37*7c3d14c8STreehugger Robot F3(Q, x##6) F3(Q, x##7) F3(Q, x##8) F3(Q, x##9)
38*7c3d14c8STreehugger Robot
39*7c3d14c8STreehugger Robot #define DECL(x) __attribute__((noinline)) static void x() {}
40*7c3d14c8STreehugger Robot #define CALL(x) x();
41*7c3d14c8STreehugger Robot
F4(DECL,f)42*7c3d14c8STreehugger Robot F4(DECL, f)
43*7c3d14c8STreehugger Robot
44*7c3d14c8STreehugger Robot #ifdef SHARED
45*7c3d14c8STreehugger Robot extern "C" void so_entry() {
46*7c3d14c8STreehugger Robot F4(CALL, f)
47*7c3d14c8STreehugger Robot }
48*7c3d14c8STreehugger Robot #else
49*7c3d14c8STreehugger Robot
50*7c3d14c8STreehugger Robot #include <assert.h>
51*7c3d14c8STreehugger Robot #include <dlfcn.h>
52*7c3d14c8STreehugger Robot #include <stdio.h>
53*7c3d14c8STreehugger Robot int main(int argc, char **argv) {
54*7c3d14c8STreehugger Robot F4(CALL, f)
55*7c3d14c8STreehugger Robot assert(argc > 1);
56*7c3d14c8STreehugger Robot void *handle1 = dlopen(argv[1], RTLD_LAZY); // %dynamiclib
57*7c3d14c8STreehugger Robot assert(handle1);
58*7c3d14c8STreehugger Robot void (*so_entry)() = (void (*)())dlsym(handle1, "so_entry");
59*7c3d14c8STreehugger Robot assert(so_entry);
60*7c3d14c8STreehugger Robot so_entry();
61*7c3d14c8STreehugger Robot
62*7c3d14c8STreehugger Robot return 0;
63*7c3d14c8STreehugger Robot }
64*7c3d14c8STreehugger Robot
65*7c3d14c8STreehugger Robot #endif // SHARED
66