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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
/* Verify longjmp fortify checking does not reject signal stacks.
Test case mostly written by Paolo Bonzini <pbonzini@redhat.com>. */
#include <assert.h>
#include <setjmp.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <unistd.h>
static int do_test (void);
#define TEST_FUNCTION do_test ()
#include "../test-skeleton.c"
static jmp_buf mainloop;
static sigset_t mainsigset;
static volatile sig_atomic_t pass;
static void
write_indented (const char *str)
{
for (int i = 0; i < pass; ++i)
write_message (" ");
write_message (str);
}
static void
stackoverflow_handler (int sig)
{
stack_t altstack;
/* Sanity check to keep test from looping forever (in case the longjmp
chk code is slightly broken). */
pass++;
sigaltstack (NULL, &altstack);
write_indented ("in signal handler\n");
if (altstack.ss_flags & SS_ONSTACK)
write_indented ("on alternate stack\n");
siglongjmp (mainloop, pass);
}
static volatile int *
recurse_1 (int n, volatile int *p)
{
if (n >= 0)
*recurse_1 (n + 1, p) += n;
return p;
}
static int
recurse (int n)
{
int sum = 0;
return *recurse_1 (n, &sum);
}
static int
do_test (void)
{
char mystack[SIGSTKSZ];
stack_t altstack;
struct sigaction action;
sigset_t emptyset;
/* Before starting the endless recursion, try to be friendly to the user's
machine. On some Linux 2.2.x systems, there is no stack limit for user
processes at all. We don't want to kill such systems. */
struct rlimit rl;
rl.rlim_cur = rl.rlim_max = 0x100000; /* 1 MB */
setrlimit (RLIMIT_STACK, &rl);
/* Install the alternate stack. */
altstack.ss_sp = mystack;
altstack.ss_size = sizeof (mystack);
altstack.ss_flags = 0; /* no SS_DISABLE */
if (sigaltstack (&altstack, NULL) < 0)
{
puts ("first sigaltstack failed");
return 0;
}
/* Install the SIGSEGV handler. */
sigemptyset (&action.sa_mask);
action.sa_handler = &stackoverflow_handler;
action.sa_flags = SA_ONSTACK;
sigaction (SIGSEGV, &action, (struct sigaction *) NULL);
sigaction (SIGBUS, &action, (struct sigaction *) NULL);
/* Save the current signal mask. */
sigemptyset (&emptyset);
sigprocmask (SIG_BLOCK, &emptyset, &mainsigset);
/* Provoke two stack overflows in a row. */
if (sigsetjmp (mainloop, 1) != 0)
{
assert (pass != 0);
printf ("%*sout of signal handler\n", pass, "");
}
else
assert (pass == 0);
sigaltstack (NULL, &altstack);
if (altstack.ss_flags & SS_ONSTACK)
printf ("%*son alternate stack\n", pass, "");
else
printf ("%*snot on alternate stack\n", pass, "");
if (pass < 2)
{
recurse (0);
puts ("recurse call returned");
return 2;
}
altstack.ss_flags |= SS_DISABLE;
if (sigaltstack (&altstack, NULL) == -1)
printf ("disabling alternate stack failed\n");
else
printf ("disabling alternate stack succeeded \n");
/* Restore the signal handlers, in case we trigger a crash after the
tests above. */
signal (SIGBUS, SIG_DFL);
signal (SIGSEGV, SIG_DFL);
return 0;
}
|
