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
59
60
61
62
63
64
|
/* This test needs to use setrlimit to set the stack size, so it can
only run on Unix. */
/* { dg-do run { target *-*-linux* *-*-solaris* *-*-darwin* } } */
/* { dg-require-effective-target split_stack } */
/* { dg-options "-fsplit-stack" } */
#include <stdarg.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/resource.h>
/* Use a noinline function to ensure that the buffer is not removed
from the stack. */
static void use_buffer (char *buf) __attribute__ ((noinline));
static void
use_buffer (char *buf)
{
buf[0] = '\0';
}
/* Each recursive call uses 10,000 bytes. We call it 1000 times,
using a total of 10,000,000 bytes. If -fsplit-stack is not
working, that will overflow our stack limit. */
static void
down (int i, ...)
{
char buf[10000];
va_list ap;
va_start (ap, i);
if (va_arg (ap, int) != 1
|| va_arg (ap, int) != 2
|| va_arg (ap, int) != 3
|| va_arg (ap, int) != 4
|| va_arg (ap, int) != 5
|| va_arg (ap, int) != 6
|| va_arg (ap, int) != 7
|| va_arg (ap, int) != 8
|| va_arg (ap, int) != 9
|| va_arg (ap, int) != 10)
abort ();
if (i > 0)
{
use_buffer (buf);
down (i - 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
}
}
int
main (void)
{
struct rlimit r;
/* We set a stack limit because we are usually invoked via make, and
make sets the stack limit to be as large as possible. */
r.rlim_cur = 8192 * 1024;
r.rlim_max = 8192 * 1024;
if (setrlimit (RLIMIT_STACK, &r) != 0)
abort ();
down (1000, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
return 0;
}
|
