blob: 38196bed6c7768c6121e8144a44f4a083cb4366f (
plain)
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
65
66
67
68
|
/* 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 <stdlib.h>
#include <string.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, size_t) __attribute__ ((noinline));
static void
use_buffer (char *buf, size_t c)
{
size_t i;
for (i = 0; i < c; ++i)
buf[i] = (char) i;
}
/* Each recursive call uses 10 * i bytes. We call it 1000 times,
using a total of 5,000,000 bytes. If -fsplit-stack is not working,
that will overflow our stack limit. */
static void
down1 (int i)
{
char buf[10 * i];
if (i > 0)
{
use_buffer (buf, 10 * i);
down1 (i - 1);
}
}
/* Same thing, using alloca. */
static void
down2 (int i)
{
char *buf = alloca (10 * i);
if (i > 0)
{
use_buffer (buf, 10 * i);
down2 (i - 1);
}
}
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 ();
down1 (1000);
down2 (1000);
return 0;
}
|
