memcheck/tests/wrap3.c

   1
   2 #include <stdio.h>
   3 #include "valgrind.h"
   4
   5 /* Check that function wrapping works for a mutually recursive
   6    pair. */
   7
   8 int fact1 ( int n );
   9 int fact2 ( int n );
  10
  11 /* This is needed to stop gcc4 turning 'fact' into a loop */
  12 __attribute__((noinline))
  13 int mul ( int x, int y ) { return x * y; }
  14
  15 __attribute((noinline))
  16 int fact1 ( int n )
  17 {
  18    if (n == 0) return 1; else return mul(n, fact2(n-1));
  19 }
  20 __attribute((noinline))
  21 int fact2 ( int n )
  22 {
  23    if (n == 0) return 1; else return mul(n, fact1(n-1));
  24 }
  25
  26
  27 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n )
  28 {
  29    int    r;
  30    OrigFn fn;
  31    VALGRIND_GET_ORIG_FN(fn);
  32    printf("in wrapper1-pre:  fact(%d)\n", n);
  33    CALL_FN_W_W(r,fn,n);
  34    printf("in wrapper1-post: fact(%d) = %d\n", n, r);
  35    return r;
  36 }
  37
  38 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact2) ( int n )
  39 {
  40    int    r;
  41    OrigFn fn;
  42    VALGRIND_GET_ORIG_FN(fn);
  43    printf("in wrapper2-pre:  fact(%d)\n", n);
  44    CALL_FN_W_W(r,fn,n);
  45    printf("in wrapper2-post: fact(%d) = %d\n", n, r);
  46    return r;
  47 }
  48
  49 /* --------------- */
  50
  51 int main ( void )
  52 {
  53    int r;
  54    printf("computing fact1(5)\n");
  55    r = fact1(5);
  56    printf("fact1(5) = %d\n", r);
  57    return 0;
  58 }