memcheck/tests/solaris/lsframe2.c


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

/* Demonstrate Memcheck correctly handling chain of 64 recursive
   calls, each of which allocates a 1 M array on the stack.  Requires
   --main-stacksize=67117057 (on amd64-linux) or above, but works fine
   if you specify that. */

#include <stdio.h>

#define N_MBYTES 64
#define N_INTS_PER_MBYTE (1048576 / sizeof(int))

int rec(int depth)
{
   int i, zzz;
   int arr[N_INTS_PER_MBYTE];
   if (depth == 0) return 0;
   for (i = 0; i < N_INTS_PER_MBYTE; i++)
      arr[i] = i * depth;
   zzz = rec(depth-1);
   for (i = 0; i < N_INTS_PER_MBYTE; i++)
       zzz += arr[i];
   return zzz;
}

int main(void)
{
   int sum;
   printf("lsframe2: start\n");
   sum = rec(N_MBYTES);
   printf("lsframe2: done, result is %d\n", sum);
   return 0;
}