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
|
1999-08-05 12:15:30 +00:00
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
1997-02-05 23:26:09 +00:00
|
|
|
* 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.
|
|
|
|
*
|
1999-08-28 00:22:10 +00:00
|
|
|
* $FreeBSD$
|
1997-02-05 23:26:09 +00:00
|
|
|
*/
|
1999-09-29 15:18:46 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/signalvar.h>
|
1997-02-05 23:26:09 +00:00
|
|
|
#include <errno.h>
|
|
|
|
#include <signal.h>
|
|
|
|
#include <pthread.h>
|
|
|
|
#include "pthread_private.h"
|
|
|
|
|
2001-04-10 04:19:21 +00:00
|
|
|
__weak_reference(_pthread_sigmask, pthread_sigmask);
|
2001-01-24 13:03:38 +00:00
|
|
|
|
1997-02-05 23:26:09 +00:00
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_sigmask(int how, const sigset_t *set, sigset_t *oset)
|
1997-02-05 23:26:09 +00:00
|
|
|
{
|
2001-01-24 13:03:38 +00:00
|
|
|
struct pthread *curthread = _get_curthread();
|
2000-10-13 22:12:32 +00:00
|
|
|
sigset_t sigset;
|
|
|
|
int ret = 0;
|
1997-02-05 23:26:09 +00:00
|
|
|
|
|
|
|
/* Check if the existing signal process mask is to be returned: */
|
|
|
|
if (oset != NULL) {
|
|
|
|
/* Return the current mask: */
|
2001-01-24 13:03:38 +00:00
|
|
|
*oset = curthread->sigmask;
|
1997-02-05 23:26:09 +00:00
|
|
|
}
|
|
|
|
/* Check if a new signal set was provided by the caller: */
|
|
|
|
if (set != NULL) {
|
|
|
|
/* Process according to what to do: */
|
|
|
|
switch (how) {
|
|
|
|
/* Block signals: */
|
|
|
|
case SIG_BLOCK:
|
|
|
|
/* Add signals to the existing mask: */
|
2001-01-24 13:03:38 +00:00
|
|
|
SIGSETOR(curthread->sigmask, *set);
|
1997-02-05 23:26:09 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* Unblock signals: */
|
|
|
|
case SIG_UNBLOCK:
|
|
|
|
/* Clear signals from the existing mask: */
|
2001-01-24 13:03:38 +00:00
|
|
|
SIGSETNAND(curthread->sigmask, *set);
|
1997-02-05 23:26:09 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* Set the signal process mask: */
|
|
|
|
case SIG_SETMASK:
|
|
|
|
/* Set the new mask: */
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->sigmask = *set;
|
1997-02-05 23:26:09 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
/* Trap invalid actions: */
|
|
|
|
default:
|
|
|
|
/* Return an invalid argument: */
|
|
|
|
errno = EINVAL;
|
|
|
|
ret = -1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2000-11-09 05:08:26 +00:00
|
|
|
/* Increment the sequence number: */
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->sigmask_seqno++;
|
2000-11-09 05:08:26 +00:00
|
|
|
|
1997-02-05 23:26:09 +00:00
|
|
|
/*
|
2000-10-13 22:12:32 +00:00
|
|
|
* Check if there are pending signals for the running
|
|
|
|
* thread or process that aren't blocked:
|
1997-02-05 23:26:09 +00:00
|
|
|
*/
|
2001-01-24 13:03:38 +00:00
|
|
|
sigset = curthread->sigpend;
|
2000-10-13 22:12:32 +00:00
|
|
|
SIGSETOR(sigset, _process_sigpending);
|
2001-01-24 13:03:38 +00:00
|
|
|
SIGSETNAND(sigset, curthread->sigmask);
|
2000-10-13 22:12:32 +00:00
|
|
|
if (SIGNOTEMPTY(sigset))
|
|
|
|
/*
|
|
|
|
* Call the kernel scheduler which will safely
|
|
|
|
* install a signal frame for the running thread:
|
|
|
|
*/
|
|
|
|
_thread_kern_sched_sig();
|
1997-02-05 23:26:09 +00:00
|
|
|
}
|
1998-04-29 09:59:34 +00:00
|
|
|
|
1997-02-05 23:26:09 +00:00
|
|
|
/* Return the completion status: */
|
|
|
|
return (ret);
|
|
|
|
}
|