1996-01-22 00:23:58 +00:00
|
|
|
/*
|
2003-04-18 07:09:43 +00:00
|
|
|
* Copyright (c) 2003 Daniel M. Eischen <deischen@gdeb.com>
|
1998-04-29 09:59:34 +00:00
|
|
|
* Copyright (c) 1995-1998 John Birrell <jb@cimlogic.com.au>
|
1996-01-22 00:23:58 +00:00
|
|
|
* 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.
|
2007-01-12 07:26:21 +00:00
|
|
|
* 3. Neither the name of the author nor the names of any co-contributors
|
1996-01-22 00:23:58 +00:00
|
|
|
* 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
|
1996-01-22 00:23:58 +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$
|
1996-01-22 00:23:58 +00:00
|
|
|
*/
|
2007-11-30 17:20:29 +00:00
|
|
|
|
|
|
|
#include "namespace.h"
|
1996-01-22 00:23:58 +00:00
|
|
|
#include <errno.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <unistd.h>
|
1999-11-28 19:47:43 +00:00
|
|
|
#include <stddef.h>
|
1996-01-22 00:23:58 +00:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <machine/reg.h>
|
|
|
|
#include <pthread.h>
|
2007-11-30 17:20:29 +00:00
|
|
|
#include "un-namespace.h"
|
2002-09-16 08:45:36 +00:00
|
|
|
#include "thr_private.h"
|
1998-04-11 07:47:22 +00:00
|
|
|
#include "libc_private.h"
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2006-03-13 00:59:51 +00:00
|
|
|
LT10_COMPAT_PRIVATE(_pthread_create);
|
|
|
|
LT10_COMPAT_DEFAULT(pthread_create);
|
|
|
|
|
2003-04-22 20:28:33 +00:00
|
|
|
static void free_thread(struct pthread *curthread, struct pthread *thread);
|
2003-04-18 05:04:16 +00:00
|
|
|
static int create_stack(struct pthread_attr *pattr);
|
2003-07-17 23:02:30 +00:00
|
|
|
static void free_stack(struct pthread_attr *pattr);
|
2003-04-18 05:04:16 +00:00
|
|
|
static void thread_start(struct pthread *curthread,
|
|
|
|
void *(*start_routine) (void *), void *arg);
|
|
|
|
|
2001-04-10 04:19:21 +00:00
|
|
|
__weak_reference(_pthread_create, pthread_create);
|
2001-01-24 13:03:38 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* Some notes on new thread creation and first time initializion
|
|
|
|
* to enable multi-threading.
|
|
|
|
*
|
|
|
|
* There are basically two things that need to be done.
|
|
|
|
*
|
|
|
|
* 1) The internal library variables must be initialized.
|
|
|
|
* 2) Upcalls need to be enabled to allow multiple threads
|
|
|
|
* to be run.
|
|
|
|
*
|
|
|
|
* The first may be done as a result of other pthread functions
|
|
|
|
* being called. When _thr_initial is null, _libpthread_init is
|
|
|
|
* called to initialize the internal variables; this also creates
|
|
|
|
* or sets the initial thread. It'd be nice to automatically
|
|
|
|
* have _libpthread_init called on program execution so we don't
|
|
|
|
* have to have checks throughout the library.
|
|
|
|
*
|
|
|
|
* The second part is only triggered by the creation of the first
|
|
|
|
* thread (other than the initial/main thread). If the thread
|
|
|
|
* being created is a scope system thread, then a new KSE/KSEG
|
|
|
|
* pair needs to be allocated. Also, if upcalls haven't been
|
|
|
|
* enabled on the initial thread's KSE, they must be now that
|
|
|
|
* there is more than one thread; this could be delayed until
|
|
|
|
* the initial KSEG has more than one thread.
|
|
|
|
*/
|
1996-01-22 00:23:58 +00:00
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_create(pthread_t * thread, const pthread_attr_t * attr,
|
1998-04-29 09:59:34 +00:00
|
|
|
void *(*start_routine) (void *), void *arg)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
struct pthread *curthread, *new_thread;
|
|
|
|
struct kse *kse = NULL;
|
|
|
|
struct kse_group *kseg = NULL;
|
|
|
|
kse_critical_t crit;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (_thr_initial == NULL)
|
|
|
|
_libpthread_init(NULL);
|
|
|
|
|
2003-04-21 04:02:56 +00:00
|
|
|
/*
|
|
|
|
* Turn on threaded mode, if failed, it is unnecessary to
|
|
|
|
* do further work.
|
|
|
|
*/
|
|
|
|
if (_kse_isthreaded() == 0 && _kse_setthreaded(1)) {
|
|
|
|
return (EAGAIN);
|
|
|
|
}
|
2003-04-18 05:04:16 +00:00
|
|
|
curthread = _get_curthread();
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-04-21 04:02:56 +00:00
|
|
|
/*
|
|
|
|
* Allocate memory for the thread structure.
|
|
|
|
* Some functions use malloc, so don't put it
|
|
|
|
* in a critical region.
|
|
|
|
*/
|
2003-04-18 07:09:43 +00:00
|
|
|
if ((new_thread = _thr_alloc(curthread)) == NULL) {
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Insufficient memory to create a thread: */
|
|
|
|
ret = EAGAIN;
|
|
|
|
} else {
|
|
|
|
/* Check if default thread attributes are required: */
|
2003-04-18 05:04:16 +00:00
|
|
|
if (attr == NULL || *attr == NULL)
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Use the default thread attributes: */
|
2003-04-18 05:04:16 +00:00
|
|
|
new_thread->attr = _pthread_attr_default;
|
2003-09-14 22:52:16 +00:00
|
|
|
else {
|
2003-04-18 05:04:16 +00:00
|
|
|
new_thread->attr = *(*attr);
|
2003-09-14 22:52:16 +00:00
|
|
|
if ((*attr)->sched_inherit == PTHREAD_INHERIT_SCHED) {
|
|
|
|
/* inherit scheduling contention scop */
|
|
|
|
if (curthread->attr.flags & PTHREAD_SCOPE_SYSTEM)
|
|
|
|
new_thread->attr.flags |= PTHREAD_SCOPE_SYSTEM;
|
|
|
|
else
|
|
|
|
new_thread->attr.flags &= ~PTHREAD_SCOPE_SYSTEM;
|
|
|
|
/*
|
|
|
|
* scheduling policy and scheduling parameters will be
|
|
|
|
* inherited in following code.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
}
|
2004-08-12 12:12:12 +00:00
|
|
|
if (_thread_scope_system > 0)
|
2004-08-07 15:15:38 +00:00
|
|
|
new_thread->attr.flags |= PTHREAD_SCOPE_SYSTEM;
|
2004-08-12 12:12:12 +00:00
|
|
|
else if ((_thread_scope_system < 0)
|
|
|
|
&& (thread != &_thr_sig_daemon))
|
|
|
|
new_thread->attr.flags &= ~PTHREAD_SCOPE_SYSTEM;
|
2003-04-18 05:04:16 +00:00
|
|
|
if (create_stack(&new_thread->attr) != 0) {
|
|
|
|
/* Insufficient memory to create a stack: */
|
|
|
|
ret = EAGAIN;
|
2003-04-18 07:09:43 +00:00
|
|
|
_thr_free(curthread, new_thread);
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
2003-04-18 05:04:16 +00:00
|
|
|
else if (((new_thread->attr.flags & PTHREAD_SCOPE_SYSTEM) != 0) &&
|
2003-07-17 23:02:30 +00:00
|
|
|
(((kse = _kse_alloc(curthread, 1)) == NULL)
|
2003-04-18 07:09:43 +00:00
|
|
|
|| ((kseg = _kseg_alloc(curthread)) == NULL))) {
|
2003-04-18 05:04:16 +00:00
|
|
|
/* Insufficient memory to create a new KSE/KSEG: */
|
|
|
|
ret = EAGAIN;
|
2003-05-24 02:29:25 +00:00
|
|
|
if (kse != NULL) {
|
2003-08-05 22:46:00 +00:00
|
|
|
kse->k_kcb->kcb_kmbx.km_flags |= KMF_DONE;
|
2003-04-18 07:09:43 +00:00
|
|
|
_kse_free(curthread, kse);
|
2003-05-24 02:29:25 +00:00
|
|
|
}
|
2003-07-17 23:02:30 +00:00
|
|
|
free_stack(&new_thread->attr);
|
2003-04-18 07:09:43 +00:00
|
|
|
_thr_free(curthread, new_thread);
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
2001-07-20 04:23:11 +00:00
|
|
|
else {
|
2003-04-18 05:04:16 +00:00
|
|
|
if (kseg != NULL) {
|
|
|
|
/* Add the KSE to the KSEG's list of KSEs. */
|
2003-05-24 02:29:25 +00:00
|
|
|
TAILQ_INSERT_HEAD(&kseg->kg_kseq, kse, k_kgqe);
|
|
|
|
kseg->kg_ksecount = 1;
|
2003-04-18 05:04:16 +00:00
|
|
|
kse->k_kseg = kseg;
|
|
|
|
kse->k_schedq = &kseg->kg_schedq;
|
1999-07-05 00:35:19 +00:00
|
|
|
}
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* Write a magic value to the thread structure
|
|
|
|
* to help identify valid ones:
|
|
|
|
*/
|
|
|
|
new_thread->magic = THR_MAGIC;
|
1999-07-11 05:56:37 +00:00
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
new_thread->slice_usec = -1;
|
|
|
|
new_thread->start_routine = start_routine;
|
|
|
|
new_thread->arg = arg;
|
1999-11-28 05:38:13 +00:00
|
|
|
new_thread->cancelflags = PTHREAD_CANCEL_ENABLE |
|
|
|
|
PTHREAD_CANCEL_DEFERRED;
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/* No thread is wanting to join to this one: */
|
|
|
|
new_thread->joiner = NULL;
|
1998-04-04 07:27:29 +00:00
|
|
|
|
2003-04-21 04:02:56 +00:00
|
|
|
/*
|
|
|
|
* Initialize the machine context.
|
|
|
|
* Enter a critical region to get consistent context.
|
|
|
|
*/
|
|
|
|
crit = _kse_critical_enter();
|
2003-08-05 22:46:00 +00:00
|
|
|
THR_GETCONTEXT(&new_thread->tcb->tcb_tmbx.tm_context);
|
2003-07-17 23:02:30 +00:00
|
|
|
/* Initialize the thread for signals: */
|
|
|
|
new_thread->sigmask = curthread->sigmask;
|
2003-04-21 04:02:56 +00:00
|
|
|
_kse_critical_leave(crit);
|
2003-08-05 22:46:00 +00:00
|
|
|
|
|
|
|
new_thread->tcb->tcb_tmbx.tm_udata = new_thread;
|
|
|
|
new_thread->tcb->tcb_tmbx.tm_context.uc_sigmask =
|
2003-04-18 05:04:16 +00:00
|
|
|
new_thread->sigmask;
|
2003-08-05 22:46:00 +00:00
|
|
|
new_thread->tcb->tcb_tmbx.tm_context.uc_stack.ss_size =
|
2003-04-18 05:04:16 +00:00
|
|
|
new_thread->attr.stacksize_attr;
|
2003-08-05 22:46:00 +00:00
|
|
|
new_thread->tcb->tcb_tmbx.tm_context.uc_stack.ss_sp =
|
2003-04-18 05:04:16 +00:00
|
|
|
new_thread->attr.stackaddr_attr;
|
2003-08-05 22:46:00 +00:00
|
|
|
makecontext(&new_thread->tcb->tcb_tmbx.tm_context,
|
2003-08-06 00:23:40 +00:00
|
|
|
(void (*)(void))thread_start, 3, new_thread,
|
2003-04-18 05:04:16 +00:00
|
|
|
start_routine, arg);
|
1996-01-22 00:23:58 +00:00
|
|
|
/*
|
|
|
|
* Check if this thread is to inherit the scheduling
|
2000-11-09 05:08:26 +00:00
|
|
|
* attributes from its parent:
|
1996-01-22 00:23:58 +00:00
|
|
|
*/
|
2003-09-14 22:52:16 +00:00
|
|
|
if (new_thread->attr.sched_inherit == PTHREAD_INHERIT_SCHED) {
|
2003-04-21 04:02:56 +00:00
|
|
|
/*
|
|
|
|
* Copy the scheduling attributes.
|
|
|
|
* Lock the scheduling lock to get consistent
|
|
|
|
* scheduling parameters.
|
|
|
|
*/
|
|
|
|
THR_SCHED_LOCK(curthread, curthread);
|
2000-10-13 22:12:32 +00:00
|
|
|
new_thread->base_priority =
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->base_priority &
|
2003-04-18 05:04:16 +00:00
|
|
|
~THR_SIGNAL_PRIORITY;
|
2000-10-13 22:12:32 +00:00
|
|
|
new_thread->attr.prio =
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->base_priority &
|
2003-04-18 05:04:16 +00:00
|
|
|
~THR_SIGNAL_PRIORITY;
|
2000-10-13 22:12:32 +00:00
|
|
|
new_thread->attr.sched_policy =
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->attr.sched_policy;
|
2003-04-21 04:02:56 +00:00
|
|
|
THR_SCHED_UNLOCK(curthread, curthread);
|
1996-01-22 00:23:58 +00:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Use just the thread priority, leaving the
|
|
|
|
* other scheduling attributes as their
|
2000-11-09 05:08:26 +00:00
|
|
|
* default values:
|
1996-01-22 00:23:58 +00:00
|
|
|
*/
|
2000-10-13 22:12:32 +00:00
|
|
|
new_thread->base_priority =
|
|
|
|
new_thread->attr.prio;
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
1999-03-23 05:07:56 +00:00
|
|
|
new_thread->active_priority = new_thread->base_priority;
|
|
|
|
new_thread->inherited_priority = 0;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/* Initialize the mutex queue: */
|
|
|
|
TAILQ_INIT(&new_thread->mutexq);
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Initialise hooks in the thread structure: */
|
2002-03-19 22:58:56 +00:00
|
|
|
new_thread->specific = NULL;
|
2003-09-14 22:52:16 +00:00
|
|
|
new_thread->specific_data_count = 0;
|
1996-01-22 00:23:58 +00:00
|
|
|
new_thread->cleanup = NULL;
|
|
|
|
new_thread->flags = 0;
|
2004-10-23 23:28:36 +00:00
|
|
|
new_thread->tlflags = 0;
|
2004-12-18 18:07:37 +00:00
|
|
|
new_thread->sigbackout = NULL;
|
2000-01-19 07:04:50 +00:00
|
|
|
new_thread->continuation = NULL;
|
2003-09-14 22:52:16 +00:00
|
|
|
new_thread->wakeup_time.tv_sec = -1;
|
|
|
|
new_thread->lock_switch = 0;
|
|
|
|
sigemptyset(&new_thread->sigpend);
|
|
|
|
new_thread->check_pending = 0;
|
|
|
|
new_thread->locklevel = 0;
|
2004-01-08 15:37:09 +00:00
|
|
|
new_thread->rdlock_count = 0;
|
2003-12-29 23:21:09 +00:00
|
|
|
new_thread->sigstk.ss_sp = 0;
|
|
|
|
new_thread->sigstk.ss_size = 0;
|
|
|
|
new_thread->sigstk.ss_flags = SS_DISABLE;
|
Check pending signals, if there is signal will be unblocked by
sigsuspend, thread shouldn't wait, in old code, it may be
ignored.
When a signal handler is invoked in sigsuspend, thread gets
two different signal masks, one is in thread structure,
sigprocmask() can retrieve it, another is in ucontext
which is a third parameter of signal handler, the former is
the result of sigsuspend mask ORed with sigaction's sa_mask
and current signal, the later is the mask in thread structure
before sigsuspend is called. After signal handler is called,
the mask in ucontext should be copied into thread structure,
and becomes CURRENT signal mask, then sigsuspend returns to
user code.
Reviewed by: deischen
Tested by: Sean McNeil <sean@mcneil.com>
2004-06-12 07:40:01 +00:00
|
|
|
new_thread->oldsigmask = NULL;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-05-04 16:17:01 +00:00
|
|
|
if (new_thread->attr.suspend == THR_CREATE_SUSPENDED) {
|
2003-04-18 05:04:16 +00:00
|
|
|
new_thread->state = PS_SUSPENDED;
|
2003-05-04 16:17:01 +00:00
|
|
|
new_thread->flags = THR_FLAGS_SUSPENDED;
|
|
|
|
}
|
2003-04-18 05:04:16 +00:00
|
|
|
else
|
|
|
|
new_thread->state = PS_RUNNING;
|
|
|
|
|
In the words of the author:
o The polling mechanism for I/O readiness was changed from
select() to poll(). In additon, a wrapped version of poll()
is now provided.
o The wrapped select routine now converts each fd_set to a
poll array so that the thread scheduler doesn't have to
perform a bitwise search for selected fds each time file
descriptors are polled for I/O readiness.
o The thread scheduler was modified to use a new queue (_workq)
for threads that need work. Threads waiting for I/O readiness
and spinblocks are added to the work queue in addition to the
waiting queue. This reduces the time spent forming/searching
the array of file descriptors being polled.
o The waiting queue (_waitingq) is now maintained in order of
thread wakeup time. This allows the thread scheduler to
find the nearest wakeup time by looking at the first thread
in the queue instead of searching the entire queue.
o Removed file descriptor locking for select/poll routines. An
application should not rely on the threads library for providing
this locking; if necessary, the application should use mutexes
to protect selecting/polling of file descriptors.
o Retrieve and use the kernel clock rate/resolution at startup
instead of hardcoding the clock resolution to 10 msec (tested
with kernel running at 1000 HZ).
o All queues have been changed to use queue.h macros. These
include the queues of all threads, dead threads, and threads
waiting for file descriptor locks.
o Added reinitialization of the GC mutex and condition variable
after a fork. Also prevented reallocation of the ready queue
after a fork.
o Prevented the wrapped close routine from closing the thread
kernel pipes.
o Initialized file descriptor table for stdio entries at thread
init.
o Provided additional flags to indicate to what queues threads
belong.
o Moved TAILQ initialization for statically allocated mutex and
condition variables to after the spinlock.
o Added dispatching of signals to pthread_kill. Removing the
dispatching of signals from thread activation broke sigsuspend
when pthread_kill was used to send a signal to a thread.
o Temporarily set the state of a thread to PS_SUSPENDED when it
is first created and placed in the list of threads so that it
will not be accidentally scheduled before becoming a member
of one of the scheduling queues.
o Change the signal handler to queue signals to the thread kernel
pipe if the scheduling queues are protected. When scheduling
queues are unprotected, signals are then dequeued and handled.
o Ensured that all installed signal handlers block the scheduling
signal and that the scheduling signal handler blocks all
other signals. This ensures that the signal handler is only
interruptible for and by non-scheduling signals. An atomic
lock is used to decide which instance of the signal handler
will handle pending signals.
o Removed _lock_thread_list and _unlock_thread_list as they are
no longer used to protect the thread list.
o Added missing RCS IDs to modified files.
o Added checks for appropriate queue membership and activity when
adding, removing, and searching the scheduling queues. These
checks add very little overhead and are enabled when compiled
with _PTHREADS_INVARIANTS defined. Suggested and implemented
by Tor Egge with some modification by me.
o Close a race condition in uthread_close. (Tor Egge)
o Protect the scheduling queues while modifying them in
pthread_cond_signal and _thread_fd_unlock. (Tor Egge)
o Ensure that when a thread gets a mutex, the mutex is on that
threads list of owned mutexes. (Tor Egge)
o Set the kernel-in-scheduler flag in _thread_kern_sched_state
and _thread_kern_sched_state_unlock to prevent a scheduling
signal from calling the scheduler again. (Tor Egge)
o Don't use TAILQ_FOREACH macro while searching the waiting
queue for threads in a sigwait state, because a change of
state destroys the TAILQ link. It is actually safe to do
so, though, because once a sigwaiting thread is found, the
loop ends and the function returns. (Tor Egge)
o When dispatching signals to threads, make the thread inherit
the signal deferral flag of the currently running thread.
(Tor Egge)
Submitted by: Daniel Eischen <eischen@vigrid.com> and
Tor Egge <Tor.Egge@fast.no>
1999-06-20 08:28:48 +00:00
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* System scope threads have their own kse and
|
|
|
|
* kseg. Process scope threads are all hung
|
|
|
|
* off the main process kseg.
|
In the words of the author:
o The polling mechanism for I/O readiness was changed from
select() to poll(). In additon, a wrapped version of poll()
is now provided.
o The wrapped select routine now converts each fd_set to a
poll array so that the thread scheduler doesn't have to
perform a bitwise search for selected fds each time file
descriptors are polled for I/O readiness.
o The thread scheduler was modified to use a new queue (_workq)
for threads that need work. Threads waiting for I/O readiness
and spinblocks are added to the work queue in addition to the
waiting queue. This reduces the time spent forming/searching
the array of file descriptors being polled.
o The waiting queue (_waitingq) is now maintained in order of
thread wakeup time. This allows the thread scheduler to
find the nearest wakeup time by looking at the first thread
in the queue instead of searching the entire queue.
o Removed file descriptor locking for select/poll routines. An
application should not rely on the threads library for providing
this locking; if necessary, the application should use mutexes
to protect selecting/polling of file descriptors.
o Retrieve and use the kernel clock rate/resolution at startup
instead of hardcoding the clock resolution to 10 msec (tested
with kernel running at 1000 HZ).
o All queues have been changed to use queue.h macros. These
include the queues of all threads, dead threads, and threads
waiting for file descriptor locks.
o Added reinitialization of the GC mutex and condition variable
after a fork. Also prevented reallocation of the ready queue
after a fork.
o Prevented the wrapped close routine from closing the thread
kernel pipes.
o Initialized file descriptor table for stdio entries at thread
init.
o Provided additional flags to indicate to what queues threads
belong.
o Moved TAILQ initialization for statically allocated mutex and
condition variables to after the spinlock.
o Added dispatching of signals to pthread_kill. Removing the
dispatching of signals from thread activation broke sigsuspend
when pthread_kill was used to send a signal to a thread.
o Temporarily set the state of a thread to PS_SUSPENDED when it
is first created and placed in the list of threads so that it
will not be accidentally scheduled before becoming a member
of one of the scheduling queues.
o Change the signal handler to queue signals to the thread kernel
pipe if the scheduling queues are protected. When scheduling
queues are unprotected, signals are then dequeued and handled.
o Ensured that all installed signal handlers block the scheduling
signal and that the scheduling signal handler blocks all
other signals. This ensures that the signal handler is only
interruptible for and by non-scheduling signals. An atomic
lock is used to decide which instance of the signal handler
will handle pending signals.
o Removed _lock_thread_list and _unlock_thread_list as they are
no longer used to protect the thread list.
o Added missing RCS IDs to modified files.
o Added checks for appropriate queue membership and activity when
adding, removing, and searching the scheduling queues. These
checks add very little overhead and are enabled when compiled
with _PTHREADS_INVARIANTS defined. Suggested and implemented
by Tor Egge with some modification by me.
o Close a race condition in uthread_close. (Tor Egge)
o Protect the scheduling queues while modifying them in
pthread_cond_signal and _thread_fd_unlock. (Tor Egge)
o Ensure that when a thread gets a mutex, the mutex is on that
threads list of owned mutexes. (Tor Egge)
o Set the kernel-in-scheduler flag in _thread_kern_sched_state
and _thread_kern_sched_state_unlock to prevent a scheduling
signal from calling the scheduler again. (Tor Egge)
o Don't use TAILQ_FOREACH macro while searching the waiting
queue for threads in a sigwait state, because a change of
state destroys the TAILQ link. It is actually safe to do
so, though, because once a sigwaiting thread is found, the
loop ends and the function returns. (Tor Egge)
o When dispatching signals to threads, make the thread inherit
the signal deferral flag of the currently running thread.
(Tor Egge)
Submitted by: Daniel Eischen <eischen@vigrid.com> and
Tor Egge <Tor.Egge@fast.no>
1999-06-20 08:28:48 +00:00
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
if ((new_thread->attr.flags & PTHREAD_SCOPE_SYSTEM) == 0) {
|
|
|
|
new_thread->kseg = _kse_initial->k_kseg;
|
|
|
|
new_thread->kse = _kse_initial;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
kse->k_curthread = NULL;
|
|
|
|
kse->k_kseg->kg_flags |= KGF_SINGLE_THREAD;
|
|
|
|
new_thread->kse = kse;
|
|
|
|
new_thread->kseg = kse->k_kseg;
|
2003-08-05 22:46:00 +00:00
|
|
|
kse->k_kcb->kcb_kmbx.km_udata = kse;
|
|
|
|
kse->k_kcb->kcb_kmbx.km_curthread = NULL;
|
2003-04-18 05:04:16 +00:00
|
|
|
}
|
1998-04-29 09:59:34 +00:00
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* Schedule the new thread starting a new KSEG/KSE
|
|
|
|
* pair if necessary.
|
1999-03-23 05:07:56 +00:00
|
|
|
*/
|
2003-04-22 20:28:33 +00:00
|
|
|
ret = _thr_schedule_add(curthread, new_thread);
|
|
|
|
if (ret != 0)
|
|
|
|
free_thread(curthread, new_thread);
|
2003-06-28 09:41:59 +00:00
|
|
|
else {
|
|
|
|
/* Return a pointer to the thread structure: */
|
|
|
|
(*thread) = new_thread;
|
|
|
|
}
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Return the status: */
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
2003-04-22 20:28:33 +00:00
|
|
|
static void
|
|
|
|
free_thread(struct pthread *curthread, struct pthread *thread)
|
|
|
|
{
|
2003-07-17 23:02:30 +00:00
|
|
|
free_stack(&thread->attr);
|
2003-04-22 20:28:33 +00:00
|
|
|
if ((thread->attr.flags & PTHREAD_SCOPE_SYSTEM) != 0) {
|
|
|
|
/* Free the KSE and KSEG. */
|
|
|
|
_kseg_free(thread->kseg);
|
|
|
|
_kse_free(curthread, thread->kse);
|
|
|
|
}
|
|
|
|
_thr_free(curthread, thread);
|
|
|
|
}
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
static int
|
|
|
|
create_stack(struct pthread_attr *pattr)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
int ret;
|
2001-01-24 13:03:38 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/* Check if a stack was specified in the thread attributes: */
|
|
|
|
if ((pattr->stackaddr_attr) != NULL) {
|
|
|
|
pattr->guardsize_attr = 0;
|
2003-05-24 02:29:25 +00:00
|
|
|
pattr->flags |= THR_STACK_USER;
|
2003-04-18 05:04:16 +00:00
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ret = _thr_stack_alloc(pattr);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
2003-07-17 23:02:30 +00:00
|
|
|
static void
|
|
|
|
free_stack(struct pthread_attr *pattr)
|
|
|
|
{
|
|
|
|
struct kse *curkse;
|
|
|
|
kse_critical_t crit;
|
|
|
|
|
|
|
|
if ((pattr->flags & THR_STACK_USER) == 0) {
|
|
|
|
crit = _kse_critical_enter();
|
|
|
|
curkse = _get_curkse();
|
|
|
|
KSE_LOCK_ACQUIRE(curkse, &_thread_list_lock);
|
|
|
|
/* Stack routines don't use malloc/free. */
|
|
|
|
_thr_stack_free(pattr);
|
|
|
|
KSE_LOCK_RELEASE(curkse, &_thread_list_lock);
|
|
|
|
_kse_critical_leave(crit);
|
|
|
|
}
|
|
|
|
}
|
2003-04-18 05:04:16 +00:00
|
|
|
|
|
|
|
static void
|
2007-11-30 17:20:29 +00:00
|
|
|
thread_start(struct pthread *curthread __unused, void *(*start_routine) (void *),
|
2003-04-18 05:04:16 +00:00
|
|
|
void *arg)
|
|
|
|
{
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Run the current thread's start routine with argument: */
|
2007-11-30 17:20:29 +00:00
|
|
|
_pthread_exit(start_routine(arg));
|
1996-01-22 00:23:58 +00:00
|
|
|
|
|
|
|
/* This point should never be reached. */
|
|
|
|
PANIC("Thread has resumed after exit");
|
|
|
|
}
|