1997-02-05 23:26:09 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1997 John Birrell <jb@cimlogic.com.au>.
|
|
|
|
* 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.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by John Birrell.
|
|
|
|
* 4. Neither the name of the author nor the names of any co-contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include <signal.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#ifdef _THREAD_SAFE
|
|
|
|
#include <pthread.h>
|
|
|
|
#include "pthread_private.h"
|
|
|
|
|
|
|
|
int
|
|
|
|
sigwait(const sigset_t * set, int *sig)
|
|
|
|
{
|
1998-08-25 11:19:14 +00:00
|
|
|
int ret = 0;
|
|
|
|
int i;
|
1998-09-30 06:27:31 +00:00
|
|
|
sigset_t tempset;
|
1998-08-25 11:19:14 +00:00
|
|
|
struct sigaction act;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Specify the thread kernel signal handler.
|
|
|
|
*/
|
|
|
|
act.sa_handler = (void (*) ()) _thread_sig_handler;
|
|
|
|
act.sa_flags = SA_RESTART;
|
|
|
|
act.sa_mask = *set;
|
1997-02-05 23:26:09 +00:00
|
|
|
|
1998-08-25 11:19:14 +00:00
|
|
|
/*
|
|
|
|
* These signals can't be waited on.
|
|
|
|
*/
|
|
|
|
sigdelset(&act.sa_mask, SIGKILL);
|
|
|
|
sigdelset(&act.sa_mask, SIGSTOP);
|
1999-03-23 05:07:56 +00:00
|
|
|
sigdelset(&act.sa_mask, _SCHED_SIGNAL);
|
1998-08-25 11:19:14 +00:00
|
|
|
sigdelset(&act.sa_mask, SIGCHLD);
|
|
|
|
sigdelset(&act.sa_mask, SIGINFO);
|
1997-02-05 23:26:09 +00:00
|
|
|
|
1998-09-30 06:27:31 +00:00
|
|
|
/* Check to see if a pending signal is in the wait mask. */
|
|
|
|
if (tempset = (_thread_run->sigpend & act.sa_mask)) {
|
|
|
|
/* Enter a loop to find a pending signal: */
|
|
|
|
for (i = 1; i < NSIG; i++) {
|
|
|
|
if (sigismember (&tempset, i))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clear the pending signal: */
|
|
|
|
sigdelset(&_thread_run->sigpend,i);
|
|
|
|
|
|
|
|
/* Return the signal number to the caller: */
|
|
|
|
*sig = i;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1998-08-25 11:19:14 +00:00
|
|
|
/*
|
|
|
|
* Enter a loop to find the signals that are SIG_DFL. For
|
|
|
|
* these signals we must install a dummy signal handler in
|
|
|
|
* order for the kernel to pass them in to us. POSIX says
|
|
|
|
* that the application must explicitly install a dummy
|
|
|
|
* handler for signals that are SIG_IGN in order to sigwait
|
1998-09-30 06:27:31 +00:00
|
|
|
* on them. Note that SIG_IGN signals are left in the
|
|
|
|
* mask because a subsequent sigaction could enable an
|
|
|
|
* ignored signal.
|
1998-08-25 11:19:14 +00:00
|
|
|
*/
|
|
|
|
for (i = 1; i < NSIG; i++) {
|
|
|
|
if (sigismember(&act.sa_mask, i)) {
|
1998-09-30 06:27:31 +00:00
|
|
|
if (_thread_sigact[i - 1].sa_handler == SIG_DFL)
|
1998-08-25 11:19:14 +00:00
|
|
|
if (_thread_sys_sigaction(i,&act,NULL) != 0)
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (ret == 0) {
|
1997-02-05 23:26:09 +00:00
|
|
|
|
1998-09-30 06:27:31 +00:00
|
|
|
/*
|
|
|
|
* Save the wait signal mask. The wait signal
|
|
|
|
* mask is independent of the threads signal mask
|
|
|
|
* and requires separate storage.
|
|
|
|
*/
|
|
|
|
_thread_run->data.sigwait = &act.sa_mask;
|
1997-02-05 23:26:09 +00:00
|
|
|
|
1998-08-25 11:19:14 +00:00
|
|
|
/* Wait for a signal: */
|
|
|
|
_thread_kern_sched_state(PS_SIGWAIT, __FILE__, __LINE__);
|
|
|
|
|
|
|
|
/* Return the signal number to the caller: */
|
|
|
|
*sig = _thread_run->signo;
|
|
|
|
|
1998-09-30 06:27:31 +00:00
|
|
|
/*
|
|
|
|
* Probably unnecessary, but since it's in a union struct
|
|
|
|
* we don't know how it could be used in the future.
|
|
|
|
*/
|
|
|
|
_thread_run->data.sigwait = NULL;
|
1998-08-25 11:19:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Restore the sigactions: */
|
|
|
|
act.sa_handler = SIG_DFL;
|
|
|
|
for (i = 1; i < NSIG; i++) {
|
|
|
|
if (sigismember(&act.sa_mask, i) &&
|
|
|
|
(_thread_sigact[i - 1].sa_handler == SIG_DFL)) {
|
|
|
|
if (_thread_sys_sigaction(i,&act,NULL) != 0)
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
}
|
1997-02-05 23:26:09 +00:00
|
|
|
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
#endif
|