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
|
/*
* Copyright (c) 2003 Jeffrey Roberson <jeff@freebsd.org>
* Copyright (c) 2003 Jonathan Mini <mini@freebsd.org>
* 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 unmodified, 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*
* $FreeBSD$
*/
#include <sys/param.h>
#include <sys/types.h>
#include <sys/signalvar.h>
#include <signal.h>
#include <fcntl.h>
#include <unistd.h>
#include <setjmp.h>
#include <errno.h>
#include <pthread.h>
#include <stdlib.h>
#include "thr_private.h"
/* #define DEBUG_SIGNAL */
#ifdef DEBUG_SIGNAL
#define DBG_MSG stdout_debug
#else
#define DBG_MSG(x...)
#endif
__weak_reference(_sigprocmask, sigprocmask);
int
_sigprocmask(int how, const sigset_t *set, sigset_t *oset)
{
sigset_t new;
/*
* Make sure applications can't unblock our synchronization
* signal. We always want to take this with sigwait().
*/
if (set != NULL) {
new = *set;
switch (how) {
case SIG_BLOCK:
case SIG_SETMASK:
SIGADDSET(new, SIGTHR);
break;
case SIG_UNBLOCK:
SIGDELSET(new, SIGTHR);
break;
default:
break;
}
set = &new;
}
return (__sys_sigprocmask(how, set, oset));
}
__weak_reference(_pthread_sigmask, pthread_sigmask);
int
_pthread_sigmask(int how, const sigset_t *set, sigset_t *oset)
{
int error;
/*
* This always sets the mask on the current thread.
*/
error = sigprocmask(how, set, oset);
/*
* pthread_sigmask returns errno or success while sigprocmask returns
* -1 and sets errno.
*/
if (error == -1)
error = errno;
return (error);
}
__weak_reference(_pthread_kill, pthread_kill);
int
_pthread_kill(pthread_t pthread, int sig)
{
if (_thread_initial == NULL)
_thread_init();
return (thr_kill(pthread->thr_id, sig));
}
/*
* User thread signal handler wrapper.
*/
void
_thread_sig_wrapper(int sig, siginfo_t *info, void *context)
{
struct pthread_state_data psd;
struct sigaction *actp;
__siginfohandler_t *handler;
struct umtx *up;
spinlock_t *sp;
/*
* Do a little cleanup handling for those threads in
* queues before calling the signal handler. Signals
* for these threads are temporarily blocked until
* after cleanup handling.
*/
switch (curthread->state) {
case PS_BARRIER_WAIT:
/*
* XXX - The thread has reached the barrier. We can't
* "back it away" from the barrier.
*/
_thread_critical_enter(curthread);
break;
case PS_COND_WAIT:
/*
* Cache the address, since it will not be available
* after it has been backed out.
*/
up = &curthread->data.cond->c_lock;
UMTX_LOCK(up);
_thread_critical_enter(curthread);
_cond_wait_backout(curthread);
UMTX_UNLOCK(up);
break;
case PS_MUTEX_WAIT:
/*
* Cache the address, since it will not be available
* after it has been backed out.
*/
sp = &curthread->data.mutex->lock;
_SPINLOCK(sp);
_thread_critical_enter(curthread);
_mutex_lock_backout(curthread);
_SPINUNLOCK(sp);
break;
default:
/*
* We need to lock the thread to read it's flags.
*/
_thread_critical_enter(curthread);
break;
}
/*
* We save the flags now so that any modifications done as part
* of the backout are reflected when the flags are restored.
*/
psd.psd_flags = curthread->flags;
PTHREAD_SET_STATE(curthread, PS_RUNNING);
_thread_critical_exit(curthread);
actp = proc_sigact_sigaction(sig);
handler = (__siginfohandler_t *)actp->sa_handler;
handler(sig, info, (ucontext_t *)context);
/* Restore the thread's flags, and make it runnable */
_thread_critical_enter(curthread);
curthread->flags = psd.psd_flags;
PTHREAD_SET_STATE(curthread, PS_RUNNING);
_thread_critical_exit(curthread);
}
|
