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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
#include <stdio.h>
#include "valgrind.h"
/* Check that function wrapping works for a mutually recursive
pair. */
int fact1 ( int n );
int fact2 ( int n );
/* This is needed to stop gcc4 turning 'fact' into a loop */
__attribute__((noinline))
int mul ( int x, int y ) { return x * y; }
__attribute((noinline))
int fact1 ( int n )
{
if (n == 0) return 1; else return mul(n, fact2(n-1));
}
__attribute((noinline))
int fact2 ( int n )
{
if (n == 0) return 1; else return mul(n, fact1(n-1));
}
int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n )
{
int r;
OrigFn fn;
VALGRIND_GET_ORIG_FN(fn);
printf("in wrapper1-pre: fact(%d)\n", n);
CALL_FN_W_W(r,fn,n);
printf("in wrapper1-post: fact(%d) = %d\n", n, r);
return r;
}
int I_WRAP_SONAME_FNNAME_ZU(NONE,fact2) ( int n )
{
int r;
OrigFn fn;
VALGRIND_GET_ORIG_FN(fn);
printf("in wrapper2-pre: fact(%d)\n", n);
CALL_FN_W_W(r,fn,n);
printf("in wrapper2-post: fact(%d) = %d\n", n, r);
return r;
}
/* --------------- */
int main ( void )
{
int r;
printf("computing fact1(5)\n");
r = fact1(5);
printf("fact1(5) = %d\n", r);
return 0;
}
|
