58a7cc5d1b
o Runnable threads are now maintained in priority queues. The
implementation requires two things:
1.) The priority queues must be protected during insertion
and removal of threads. Since the kernel scheduler
must modify the priority queues, a spinlock for
protection cannot be used. The functions
_thread_kern_sched_defer() and _thread_kern_sched_undefer()
were added to {un}defer kernel scheduler activation.
2.) A thread (active) priority change can be performed only
when the thread is removed from the priority queue. The
implementation uses a threads active priority when
inserting it into the queue.
A by-product is that thread switches are much faster. A
separate queue is used for waiting and/or blocked threads,
and it is searched at most 2 times in the kernel scheduler
when there are active threads. It should be possible to
reduce this to once by combining polling of threads waiting
on I/O with the loop that looks for timed out threads and
the minimum timeout value.
o Functions to defer kernel scheduler activation were added. These
are _thread_kern_sched_defer() and _thread_kern_sched_undefer()
and may be called recursively. These routines do not block the
scheduling signal, but latch its occurrence. The signal handler
will not call the kernel scheduler when the running thread has
deferred scheduling, but it will be called when running thread
undefers scheduling.
o Added support for _POSIX_THREAD_PRIORITY_SCHEDULING. All the
POSIX routines required by this should now be implemented.
One note, SCHED_OTHER, SCHED_FIFO, and SCHED_RR are required
to be defined by including pthread.h. These defines are currently
in sched.h. I modified pthread.h to include sched.h but don't
know if this is the proper thing to do.
o Added support for priority protection and inheritence mutexes.
This allows definition of _POSIX_THREAD_PRIO_PROTECT and
_POSIX_THREAD_PRIO_INHERIT.
o Added additional error checks required by POSIX for mutexes and
condition variables.
o Provided a wrapper for sigpending which is marked as a hidden
syscall.
o Added a non-portable function as a debugging aid to allow an
application to monitor thread context switches. An application
can install a routine that gets called everytime a thread
(explicitly created by the application) gets context switched.
The routine gets passed the pthread IDs of the threads that are
being switched in and out.
Submitted by: Dan Eischen <eischen@vigrid.com>
Changes by me:
o Added a PS_SPINBLOCK state to deal with the priority inversion
problem most often (I think) seen by threads calling malloc/free/realloc.
o Dispatch signals to the running thread directly rather than at a
context switch to avoid the situation where the switch never occurs.
133 lines
4.2 KiB
C
133 lines
4.2 KiB
C
/*
|
|
* 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)
|
|
{
|
|
int ret = 0;
|
|
int i;
|
|
sigset_t tempset;
|
|
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;
|
|
|
|
/*
|
|
* These signals can't be waited on.
|
|
*/
|
|
sigdelset(&act.sa_mask, SIGKILL);
|
|
sigdelset(&act.sa_mask, SIGSTOP);
|
|
sigdelset(&act.sa_mask, _SCHED_SIGNAL);
|
|
sigdelset(&act.sa_mask, SIGCHLD);
|
|
sigdelset(&act.sa_mask, SIGINFO);
|
|
|
|
/* 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);
|
|
}
|
|
|
|
/*
|
|
* 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
|
|
* on them. Note that SIG_IGN signals are left in the
|
|
* mask because a subsequent sigaction could enable an
|
|
* ignored signal.
|
|
*/
|
|
for (i = 1; i < NSIG; i++) {
|
|
if (sigismember(&act.sa_mask, i)) {
|
|
if (_thread_sigact[i - 1].sa_handler == SIG_DFL)
|
|
if (_thread_sys_sigaction(i,&act,NULL) != 0)
|
|
ret = -1;
|
|
}
|
|
}
|
|
if (ret == 0) {
|
|
|
|
/*
|
|
* 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;
|
|
|
|
/* Wait for a signal: */
|
|
_thread_kern_sched_state(PS_SIGWAIT, __FILE__, __LINE__);
|
|
|
|
/* Return the signal number to the caller: */
|
|
*sig = _thread_run->signo;
|
|
|
|
/*
|
|
* 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;
|
|
}
|
|
|
|
/* 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;
|
|
}
|
|
}
|
|
|
|
/* Return the completion status: */
|
|
return (ret);
|
|
}
|
|
#endif
|