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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
|
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)signalvar.h 8.6 (Berkeley) 2/19/95
* $FreeBSD$
*/
#ifndef _SYS_SIGNALVAR_H_
#define _SYS_SIGNALVAR_H_
#include <sys/queue.h>
#include <sys/_lock.h>
#include <sys/_mutex.h>
#include <sys/signal.h>
/*
* Kernel signal definitions and data structures,
* not exported to user programs.
*/
/*
* Logical process signal actions and state, needed only within the process
* The mapping between sigacts and proc structures is 1:1 except for rfork()
* processes masquerading as threads which use one structure for the whole
* group. All members are locked by the included mutex. The reference count
* and mutex must be last for the bcopy in sigacts_copy() to work.
*/
struct sigacts {
sig_t ps_sigact[_SIG_MAXSIG]; /* Disposition of signals. */
sigset_t ps_catchmask[_SIG_MAXSIG]; /* Signals to be blocked. */
sigset_t ps_sigonstack; /* Signals to take on sigstack. */
sigset_t ps_sigintr; /* Signals that interrupt syscalls. */
sigset_t ps_sigreset; /* Signals that reset when caught. */
sigset_t ps_signodefer; /* Signals not masked while handled. */
sigset_t ps_siginfo; /* Signals that want SA_SIGINFO args. */
sigset_t ps_sigignore; /* Signals being ignored. */
sigset_t ps_sigcatch; /* Signals being caught by user. */
sigset_t ps_freebsd4; /* signals using freebsd4 ucontext. */
sigset_t ps_osigset; /* Signals using <= 3.x osigset_t. */
sigset_t ps_usertramp; /* SunOS compat; libc sigtramp. XXX */
int ps_flag;
int ps_refcnt;
struct mtx ps_mtx;
};
#define PS_NOCLDWAIT 0x0001 /* No zombies if child dies */
#define PS_NOCLDSTOP 0x0002 /* No SIGCHLD when children stop. */
#define PS_CLDSIGIGN 0x0004 /* The SIGCHLD handler is SIG_IGN. */
#if defined(_KERNEL) && defined(COMPAT_43)
/*
* Compatibility.
*/
typedef struct {
struct osigcontext si_sc;
int si_signo;
int si_code;
union sigval si_value;
} osiginfo_t;
struct osigaction {
union {
void (*__sa_handler)(int);
void (*__sa_sigaction)(int, osiginfo_t *, void *);
} __sigaction_u; /* signal handler */
osigset_t sa_mask; /* signal mask to apply */
int sa_flags; /* see signal options below */
};
typedef void __osiginfohandler_t(int, osiginfo_t *, void *);
#endif /* _KERNEL && COMPAT_43 */
/* additional signal action values, used only temporarily/internally */
#define SIG_CATCH ((__sighandler_t *)2)
#define SIG_HOLD ((__sighandler_t *)3)
/*
* get signal action for process and signal; currently only for current process
*/
#define SIGACTION(p, sig) (p->p_sigacts->ps_sigact[_SIG_IDX(sig)])
/*
* sigset_t manipulation macros
*/
#define SIGADDSET(set, signo) \
((set).__bits[_SIG_WORD(signo)] |= _SIG_BIT(signo))
#define SIGDELSET(set, signo) \
((set).__bits[_SIG_WORD(signo)] &= ~_SIG_BIT(signo))
#define SIGEMPTYSET(set) \
do { \
int __i; \
for (__i = 0; __i < _SIG_WORDS; __i++) \
(set).__bits[__i] = 0; \
} while (0)
#define SIGFILLSET(set) \
do { \
int __i; \
for (__i = 0; __i < _SIG_WORDS; __i++) \
(set).__bits[__i] = ~0U; \
} while (0)
#define SIGISMEMBER(set, signo) \
((set).__bits[_SIG_WORD(signo)] & _SIG_BIT(signo))
#define SIGISEMPTY(set) (__sigisempty(&(set)))
#define SIGNOTEMPTY(set) (!__sigisempty(&(set)))
#define SIGSETEQ(set1, set2) (__sigseteq(&(set1), &(set2)))
#define SIGSETNEQ(set1, set2) (!__sigseteq(&(set1), &(set2)))
#define SIGSETOR(set1, set2) \
do { \
int __i; \
for (__i = 0; __i < _SIG_WORDS; __i++) \
(set1).__bits[__i] |= (set2).__bits[__i]; \
} while (0)
#define SIGSETAND(set1, set2) \
do { \
int __i; \
for (__i = 0; __i < _SIG_WORDS; __i++) \
(set1).__bits[__i] &= (set2).__bits[__i]; \
} while (0)
#define SIGSETNAND(set1, set2) \
do { \
int __i; \
for (__i = 0; __i < _SIG_WORDS; __i++) \
(set1).__bits[__i] &= ~(set2).__bits[__i]; \
} while (0)
#define SIGSETLO(set1, set2) ((set1).__bits[0] = (set2).__bits[0])
#define SIGSETOLD(set, oset) ((set).__bits[0] = (oset))
#define SIG_CANTMASK(set) \
SIGDELSET(set, SIGKILL), SIGDELSET(set, SIGSTOP)
#define SIG_STOPSIGMASK(set) \
SIGDELSET(set, SIGSTOP), SIGDELSET(set, SIGTSTP), \
SIGDELSET(set, SIGTTIN), SIGDELSET(set, SIGTTOU)
#define SIG_CONTSIGMASK(set) \
SIGDELSET(set, SIGCONT)
#define sigcantmask (sigmask(SIGKILL) | sigmask(SIGSTOP))
#define SIG2OSIG(sig, osig) (osig = (sig).__bits[0])
#define OSIG2SIG(osig, sig) SIGEMPTYSET(sig); (sig).__bits[0] = osig
static __inline int
__sigisempty(sigset_t *set)
{
int i;
for (i = 0; i < _SIG_WORDS; i++) {
if (set->__bits[i])
return (0);
}
return (1);
}
static __inline int
__sigseteq(sigset_t *set1, sigset_t *set2)
{
int i;
for (i = 0; i < _SIG_WORDS; i++) {
if (set1->__bits[i] != set2->__bits[i])
return (0);
}
return (1);
}
struct osigevent {
int sigev_notify; /* Notification type */
union {
int __sigev_signo; /* Signal number */
int __sigev_notify_kqueue;
} __sigev_u;
union sigval sigev_value; /* Signal value */
};
typedef struct ksiginfo {
TAILQ_ENTRY(ksiginfo) ksi_link;
siginfo_t ksi_info;
int ksi_flags;
struct sigqueue *ksi_sigq;
} ksiginfo_t;
#define ksi_signo ksi_info.si_signo
#define ksi_errno ksi_info.si_errno
#define ksi_code ksi_info.si_code
#define ksi_pid ksi_info.si_pid
#define ksi_uid ksi_info.si_uid
#define ksi_status ksi_info.si_status
#define ksi_addr ksi_info.si_addr
#define ksi_value ksi_info.si_value
#define ksi_band ksi_info.si_band
#define ksi_trapno ksi_info.si_trapno
#define ksi_overrun ksi_info.si_overrun
#define ksi_timerid ksi_info.si_timerid
#define ksi_mqd ksi_info.si_mqd
/* bits for ksi_flags */
#define KSI_TRAP 0x01 /* Generated by trap. */
#define KSI_EXT 0x02 /* Externally managed ksi. */
#define KSI_INS 0x04 /* Directly insert ksi, not the copy */
#define KSI_COPYMASK KSI_TRAP
#define KSI_ONQ(ksi) ((ksi)->ksi_sigq != NULL)
typedef struct sigqueue {
sigset_t sq_signals;
TAILQ_HEAD(, ksiginfo) sq_list;
struct proc *sq_proc;
int sq_flags;
} sigqueue_t;
/* Flags for ksi_flags */
#define SQ_INIT 0x01
#ifdef _KERNEL
/* Return nonzero if process p has an unmasked pending signal. */
#define SIGPENDING(td) \
(!SIGISEMPTY((td)->td_siglist) && \
!sigsetmasked(&(td)->td_siglist, &(td)->td_sigmask))
/*
* Return the value of the pseudo-expression ((*set & ~*mask) != 0). This
* is an optimized version of SIGISEMPTY() on a temporary variable
* containing SIGSETNAND(*set, *mask).
*/
static __inline int
sigsetmasked(sigset_t *set, sigset_t *mask)
{
int i;
for (i = 0; i < _SIG_WORDS; i++) {
if (set->__bits[i] & ~mask->__bits[i])
return (0);
}
return (1);
}
#define ksiginfo_init(ksi) \
do { \
bzero(ksi, sizeof(ksiginfo_t)); \
} while(0)
#define ksiginfo_init_trap(ksi) \
do { \
ksiginfo_t *kp = ksi; \
bzero(kp, sizeof(ksiginfo_t)); \
kp->ksi_flags |= KSI_TRAP; \
} while(0)
static __inline void
ksiginfo_copy(ksiginfo_t *src, ksiginfo_t *dst)
{
(dst)->ksi_info = src->ksi_info;
(dst)->ksi_flags = (src->ksi_flags & KSI_COPYMASK);
}
struct pgrp;
struct thread;
struct proc;
struct sigio;
struct mtx;
extern int sugid_coredump; /* Sysctl variable kern.sugid_coredump */
extern struct mtx sigio_lock;
/*
* Lock the pointers for a sigio object in the underlying objects of
* a file descriptor.
*/
#define SIGIO_LOCK() mtx_lock(&sigio_lock)
#define SIGIO_TRYLOCK() mtx_trylock(&sigio_lock)
#define SIGIO_UNLOCK() mtx_unlock(&sigio_lock)
#define SIGIO_LOCKED() mtx_owned(&sigio_lock)
#define SIGIO_ASSERT(type) mtx_assert(&sigio_lock, type)
/*
* Machine-independent functions:
*/
int cursig(struct thread *td);
void execsigs(struct proc *p);
void gsignal(int pgid, int sig);
void killproc(struct proc *p, char *why);
void pgsigio(struct sigio **, int signum, int checkctty);
void pgsignal(struct pgrp *pgrp, int sig, int checkctty);
void postsig(int sig);
void psignal(struct proc *p, int sig);
int psignal_event(struct proc *p, struct sigevent *, ksiginfo_t *);
struct sigacts *sigacts_alloc(void);
void sigacts_copy(struct sigacts *dest, struct sigacts *src);
void sigacts_free(struct sigacts *ps);
struct sigacts *sigacts_hold(struct sigacts *ps);
int sigacts_shared(struct sigacts *ps);
void sigexit(struct thread *td, int signum) __dead2;
int sig_ffs(sigset_t *set);
void siginit(struct proc *p);
void signotify(struct thread *td);
int tdsignal(struct proc *p, struct thread *td, int sig,
ksiginfo_t *ksi);
void trapsignal(struct thread *td, ksiginfo_t *);
int ptracestop(struct thread *td, int sig);
ksiginfo_t * ksiginfo_alloc(int);
void ksiginfo_free(ksiginfo_t *);
void sigqueue_init(struct sigqueue *queue, struct proc *p);
void sigqueue_flush(struct sigqueue *queue);
void sigqueue_delete_proc(struct proc *p, int sig);
void sigqueue_delete_set(struct sigqueue *queue, sigset_t *set);
void sigqueue_delete(struct sigqueue *queue, int sig);
void sigqueue_move_set(struct sigqueue *src, sigqueue_t *dst, sigset_t *);
int sigqueue_get(struct sigqueue *queue, int sig, ksiginfo_t *info);
int sigqueue_add(struct sigqueue *queue, int sig, ksiginfo_t *info);
void sigqueue_collect_set(struct sigqueue *queue, sigset_t *set);
void sigqueue_move(struct sigqueue *, struct sigqueue *, int sig);
void sigqueue_delete_set_proc(struct proc *, sigset_t *);
void sigqueue_delete_stopmask_proc(struct proc *);
void sigqueue_take(ksiginfo_t *ksi);
/*
* Machine-dependent functions:
*/
void sendsig(sig_t, ksiginfo_t *, sigset_t *retmask);
#endif /* _KERNEL */
#endif /* !_SYS_SIGNALVAR_H_ */
|