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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
|
/* Emergency actions in case of a fatal signal.
Copyright (C) 2003-2004, 2006-2018 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 2003.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
#include <config.h>
/* Specification. */
#include "fatal-signal.h"
#include <stdbool.h>
#include <stdlib.h>
#include <signal.h>
#include <unistd.h>
#include "sig-handler.h"
#include "xalloc.h"
#define SIZEOF(a) (sizeof(a) / sizeof(a[0]))
/* ========================================================================= */
/* The list of fatal signals.
These are those signals whose default action is to terminate the process
without a core dump, except
SIGKILL - because it cannot be caught,
SIGALRM SIGUSR1 SIGUSR2 SIGPOLL SIGIO SIGLOST - because applications
often use them for their own purpose,
SIGPROF SIGVTALRM - because they are used for profiling,
SIGSTKFLT - because it is more similar to SIGFPE, SIGSEGV, SIGBUS,
SIGSYS - because it is more similar to SIGABRT, SIGSEGV,
SIGPWR - because it of too special use,
SIGRTMIN...SIGRTMAX - because they are reserved for application use.
plus
SIGXCPU, SIGXFSZ - because they are quite similar to SIGTERM. */
static int fatal_signals[] =
{
/* ISO C 99 signals. */
#ifdef SIGINT
SIGINT,
#endif
#ifdef SIGTERM
SIGTERM,
#endif
/* POSIX:2001 signals. */
#ifdef SIGHUP
SIGHUP,
#endif
#ifdef SIGPIPE
SIGPIPE,
#endif
/* BSD signals. */
#ifdef SIGXCPU
SIGXCPU,
#endif
#ifdef SIGXFSZ
SIGXFSZ,
#endif
/* Native Windows signals. */
#ifdef SIGBREAK
SIGBREAK,
#endif
0
};
#define num_fatal_signals (SIZEOF (fatal_signals) - 1)
/* Eliminate signals whose signal handler is SIG_IGN. */
static void
init_fatal_signals (void)
{
static bool fatal_signals_initialized = false;
if (!fatal_signals_initialized)
{
size_t i;
for (i = 0; i < num_fatal_signals; i++)
{
struct sigaction action;
if (sigaction (fatal_signals[i], NULL, &action) >= 0
&& get_handler (&action) == SIG_IGN)
fatal_signals[i] = -1;
}
fatal_signals_initialized = true;
}
}
/* ========================================================================= */
typedef void (*action_t) (void);
/* Type of an entry in the actions array.
The 'action' field is accessed from within the fatal_signal_handler(),
therefore we mark it as 'volatile'. */
typedef struct
{
volatile action_t action;
}
actions_entry_t;
/* The registered cleanup actions. */
static actions_entry_t static_actions[32];
static actions_entry_t * volatile actions = static_actions;
static sig_atomic_t volatile actions_count = 0;
static size_t actions_allocated = SIZEOF (static_actions);
/* The saved signal handlers.
Size 32 would not be sufficient: On HP-UX, SIGXCPU = 33, SIGXFSZ = 34. */
static struct sigaction saved_sigactions[64];
/* Uninstall the handlers. */
static void
uninstall_handlers (void)
{
size_t i;
for (i = 0; i < num_fatal_signals; i++)
if (fatal_signals[i] >= 0)
{
int sig = fatal_signals[i];
if (saved_sigactions[sig].sa_handler == SIG_IGN)
saved_sigactions[sig].sa_handler = SIG_DFL;
sigaction (sig, &saved_sigactions[sig], NULL);
}
}
/* The signal handler. It gets called asynchronously. */
static void
fatal_signal_handler (int sig)
{
for (;;)
{
/* Get the last registered cleanup action, in a reentrant way. */
action_t action;
size_t n = actions_count;
if (n == 0)
break;
n--;
actions_count = n;
action = actions[n].action;
/* Execute the action. */
action ();
}
/* Now execute the signal's default action.
If the signal being delivered was blocked, the re-raised signal would be
delivered when this handler returns. But the way we install this handler,
no signal is blocked, and the re-raised signal is delivered already
during raise(). */
uninstall_handlers ();
raise (sig);
}
/* Install the handlers. */
static void
install_handlers (void)
{
size_t i;
struct sigaction action;
action.sa_handler = &fatal_signal_handler;
/* If we get a fatal signal while executing fatal_signal_handler, enter
fatal_signal_handler recursively, since it is reentrant. Hence no
SA_RESETHAND. */
action.sa_flags = SA_NODEFER;
sigemptyset (&action.sa_mask);
for (i = 0; i < num_fatal_signals; i++)
if (fatal_signals[i] >= 0)
{
int sig = fatal_signals[i];
if (!(sig < sizeof (saved_sigactions) / sizeof (saved_sigactions[0])))
abort ();
sigaction (sig, &action, &saved_sigactions[sig]);
}
}
/* Register a cleanup function to be executed when a catchable fatal signal
occurs. */
void
at_fatal_signal (action_t action)
{
static bool cleanup_initialized = false;
if (!cleanup_initialized)
{
init_fatal_signals ();
install_handlers ();
cleanup_initialized = true;
}
if (actions_count == actions_allocated)
{
/* Extend the actions array. Note that we cannot use xrealloc(),
because then the cleanup() function could access an already
deallocated array. */
actions_entry_t *old_actions = actions;
size_t old_actions_allocated = actions_allocated;
size_t new_actions_allocated = 2 * actions_allocated;
actions_entry_t *new_actions =
XNMALLOC (new_actions_allocated, actions_entry_t);
size_t k;
/* Don't use memcpy() here, because memcpy takes non-volatile arguments
and is therefore not guaranteed to complete all memory stores before
the next statement. */
for (k = 0; k < old_actions_allocated; k++)
new_actions[k] = old_actions[k];
actions = new_actions;
actions_allocated = new_actions_allocated;
/* Now we can free the old actions array. */
if (old_actions != static_actions)
free (old_actions);
}
/* The two uses of 'volatile' in the types above (and ISO C 99 section
5.1.2.3.(5)) ensure that we increment the actions_count only after
the new action has been written to the memory location
actions[actions_count]. */
actions[actions_count].action = action;
actions_count++;
}
/* ========================================================================= */
static sigset_t fatal_signal_set;
static void
init_fatal_signal_set (void)
{
static bool fatal_signal_set_initialized = false;
if (!fatal_signal_set_initialized)
{
size_t i;
init_fatal_signals ();
sigemptyset (&fatal_signal_set);
for (i = 0; i < num_fatal_signals; i++)
if (fatal_signals[i] >= 0)
sigaddset (&fatal_signal_set, fatal_signals[i]);
fatal_signal_set_initialized = true;
}
}
/* Temporarily delay the catchable fatal signals. */
void
block_fatal_signals (void)
{
init_fatal_signal_set ();
sigprocmask (SIG_BLOCK, &fatal_signal_set, NULL);
}
/* Stop delaying the catchable fatal signals. */
void
unblock_fatal_signals (void)
{
init_fatal_signal_set ();
sigprocmask (SIG_UNBLOCK, &fatal_signal_set, NULL);
}
|