1996-01-22 00:23:58 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1995 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-03-23 05:07:56 +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
|
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <errno.h>
|
1998-06-09 23:21:05 +00:00
|
|
|
#include <string.h>
|
1996-01-22 00:23:58 +00:00
|
|
|
#include <pthread.h>
|
2002-09-16 08:45:36 +00:00
|
|
|
#include "thr_private.h"
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
#define THR_IN_CONDQ(thr) (((thr)->sflags & THR_FLAGS_IN_SYNCQ) != 0)
|
|
|
|
#define THR_IN_CONDQ(thr) (((thr)->sflags & THR_FLAGS_IN_SYNCQ) != 0)
|
|
|
|
#define THR_CONDQ_SET(thr) (thr)->sflags |= THR_FLAGS_IN_SYNCQ
|
|
|
|
#define THR_CONDQ_CLEAR(thr) (thr)->sflags &= ~THR_FLAGS_IN_SYNCQ
|
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
|
|
|
* Prototypes
|
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
static inline struct pthread *cond_queue_deq(pthread_cond_t);
|
|
|
|
static inline void cond_queue_remove(pthread_cond_t, pthread_t);
|
|
|
|
static inline void cond_queue_enq(pthread_cond_t, pthread_t);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2003-05-19 23:04:50 +00:00
|
|
|
/*
|
|
|
|
* Double underscore versions are cancellation points. Single underscore
|
|
|
|
* versions are not and are provided for libc internal usage (which
|
|
|
|
* shouldn't introduce cancellation points).
|
|
|
|
*/
|
|
|
|
__weak_reference(__pthread_cond_wait, pthread_cond_wait);
|
|
|
|
__weak_reference(__pthread_cond_timedwait, pthread_cond_timedwait);
|
|
|
|
|
2001-04-10 04:19:21 +00:00
|
|
|
__weak_reference(_pthread_cond_init, pthread_cond_init);
|
|
|
|
__weak_reference(_pthread_cond_destroy, pthread_cond_destroy);
|
|
|
|
__weak_reference(_pthread_cond_signal, pthread_cond_signal);
|
|
|
|
__weak_reference(_pthread_cond_broadcast, pthread_cond_broadcast);
|
2001-01-24 13:03:38 +00:00
|
|
|
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_cond_init(pthread_cond_t *cond, const pthread_condattr_t *cond_attr)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
|
|
|
enum pthread_cond_type type;
|
1996-08-20 08:22:01 +00:00
|
|
|
pthread_cond_t pcond;
|
2003-04-18 05:04:16 +00:00
|
|
|
int flags;
|
1996-01-22 00:23:58 +00:00
|
|
|
int rval = 0;
|
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
if (cond == NULL)
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
1998-04-29 09:59:34 +00:00
|
|
|
else {
|
1996-08-20 08:22:01 +00:00
|
|
|
/*
|
1997-04-11 22:38:22 +00:00
|
|
|
* Check if a pointer to a condition variable attribute
|
|
|
|
* structure was passed by the caller:
|
1996-08-20 08:22:01 +00:00
|
|
|
*/
|
|
|
|
if (cond_attr != NULL && *cond_attr != NULL) {
|
|
|
|
/* Default to a fast condition variable: */
|
|
|
|
type = (*cond_attr)->c_type;
|
2003-04-18 05:04:16 +00:00
|
|
|
flags = (*cond_attr)->c_flags;
|
1996-08-20 08:22:01 +00:00
|
|
|
} else {
|
|
|
|
/* Default to a fast condition variable: */
|
|
|
|
type = COND_TYPE_FAST;
|
2003-04-18 05:04:16 +00:00
|
|
|
flags = 0;
|
1996-08-20 08:22:01 +00:00
|
|
|
}
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1996-08-20 08:22:01 +00:00
|
|
|
/* Process according to condition variable type: */
|
|
|
|
switch (type) {
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Fast condition variable: */
|
1996-08-20 08:22:01 +00:00
|
|
|
case COND_TYPE_FAST:
|
|
|
|
/* Nothing to do here. */
|
|
|
|
break;
|
|
|
|
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Trap invalid condition variable types: */
|
1996-08-20 08:22:01 +00:00
|
|
|
default:
|
|
|
|
/* Return an invalid argument error: */
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
|
|
|
}
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1996-08-20 08:22:01 +00:00
|
|
|
/* Check for no errors: */
|
|
|
|
if (rval == 0) {
|
1997-04-11 22:38:22 +00:00
|
|
|
if ((pcond = (pthread_cond_t)
|
|
|
|
malloc(sizeof(struct pthread_cond))) == NULL) {
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = ENOMEM;
|
2003-04-18 05:04:16 +00:00
|
|
|
} else if (_lock_init(&pcond->c_lock, LCK_ADAPTIVE,
|
2003-04-21 04:02:56 +00:00
|
|
|
_thr_lock_wait, _thr_lock_wakeup) != 0) {
|
2003-04-18 05:04:16 +00:00
|
|
|
free(pcond);
|
|
|
|
rval = ENOMEM;
|
1996-08-20 08:22:01 +00:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Initialise the condition variable
|
|
|
|
* structure:
|
|
|
|
*/
|
1999-03-23 05:07:56 +00:00
|
|
|
TAILQ_INIT(&pcond->c_queue);
|
1996-08-20 08:22:01 +00:00
|
|
|
pcond->c_flags |= COND_FLAGS_INITED;
|
|
|
|
pcond->c_type = type;
|
1999-03-23 05:07:56 +00:00
|
|
|
pcond->c_mutex = NULL;
|
2000-11-09 05:08:26 +00:00
|
|
|
pcond->c_seqno = 0;
|
1996-08-20 08:22:01 +00:00
|
|
|
*cond = pcond;
|
|
|
|
}
|
|
|
|
}
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (rval);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_cond_destroy(pthread_cond_t *cond)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
struct pthread_cond *cv;
|
|
|
|
struct pthread *curthread = _get_curthread();
|
|
|
|
int rval = 0;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
if (cond == NULL || *cond == NULL)
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
1998-04-29 09:59:34 +00:00
|
|
|
else {
|
|
|
|
/* Lock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread, &(*cond)->c_lock);
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
/*
|
|
|
|
* NULL the caller's pointer now that the condition
|
|
|
|
* variable has been destroyed:
|
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
cv = *cond;
|
1998-04-29 09:59:34 +00:00
|
|
|
*cond = NULL;
|
2003-04-18 05:04:16 +00:00
|
|
|
|
|
|
|
/* Unlock the condition variable structure: */
|
|
|
|
THR_LOCK_RELEASE(curthread, &cv->c_lock);
|
|
|
|
|
2003-06-03 02:21:01 +00:00
|
|
|
/* Free the cond lock structure: */
|
|
|
|
_lock_destroy(&cv->c_lock);
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* Free the memory allocated for the condition
|
|
|
|
* variable structure:
|
|
|
|
*/
|
|
|
|
free(cv);
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (rval);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_cond_wait(pthread_cond_t *cond, pthread_mutex_t *mutex)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
2001-01-24 13:03:38 +00:00
|
|
|
struct pthread *curthread = _get_curthread();
|
2000-01-19 07:04:50 +00:00
|
|
|
int rval = 0;
|
2000-11-09 05:08:26 +00:00
|
|
|
int done = 0;
|
2000-01-19 07:04:50 +00:00
|
|
|
int interrupted = 0;
|
2003-04-18 05:04:16 +00:00
|
|
|
int unlock_mutex = 1;
|
2000-11-09 05:08:26 +00:00
|
|
|
int seqno;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-05-19 23:04:50 +00:00
|
|
|
if (cond == NULL)
|
2000-11-09 05:08:26 +00:00
|
|
|
return (EINVAL);
|
1998-04-04 11:33:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If the condition variable is statically initialized,
|
|
|
|
* perform the dynamic initialization:
|
|
|
|
*/
|
2000-11-09 05:08:26 +00:00
|
|
|
if (*cond == NULL &&
|
2003-05-19 23:04:50 +00:00
|
|
|
(rval = pthread_cond_init(cond, NULL)) != 0)
|
2000-11-09 05:08:26 +00:00
|
|
|
return (rval);
|
|
|
|
|
2003-05-24 02:29:25 +00:00
|
|
|
if (!_kse_isthreaded())
|
|
|
|
_kse_setthreaded(1);
|
|
|
|
|
2000-11-09 05:08:26 +00:00
|
|
|
/*
|
|
|
|
* Enter a loop waiting for a condition signal or broadcast
|
|
|
|
* to wake up this thread. A loop is needed in case the waiting
|
|
|
|
* thread is interrupted by a signal to execute a signal handler.
|
|
|
|
* It is not (currently) possible to remain in the waiting queue
|
|
|
|
* while running a handler. Instead, the thread is interrupted
|
|
|
|
* and backed out of the waiting queue prior to executing the
|
|
|
|
* signal handler.
|
|
|
|
*/
|
|
|
|
do {
|
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
|
|
|
/* Lock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread, &(*cond)->c_lock);
|
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
|
|
|
|
1999-05-23 10:55:33 +00:00
|
|
|
/*
|
|
|
|
* If the condvar was statically allocated, properly
|
|
|
|
* initialize the tail queue.
|
|
|
|
*/
|
|
|
|
if (((*cond)->c_flags & COND_FLAGS_INITED) == 0) {
|
|
|
|
TAILQ_INIT(&(*cond)->c_queue);
|
|
|
|
(*cond)->c_flags |= COND_FLAGS_INITED;
|
|
|
|
}
|
|
|
|
|
1996-08-20 08:22:01 +00:00
|
|
|
/* Process according to condition variable type: */
|
|
|
|
switch ((*cond)->c_type) {
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Fast condition variable: */
|
1996-08-20 08:22:01 +00:00
|
|
|
case COND_TYPE_FAST:
|
1999-03-23 05:07:56 +00:00
|
|
|
if ((mutex == NULL) || (((*cond)->c_mutex != NULL) &&
|
|
|
|
((*cond)->c_mutex != *mutex))) {
|
1998-11-06 21:04:02 +00:00
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Return invalid argument error: */
|
|
|
|
rval = EINVAL;
|
1998-11-06 21:04:02 +00:00
|
|
|
} else {
|
1999-11-28 05:38:13 +00:00
|
|
|
/* Reset the timeout and interrupted flags: */
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->timeout = 0;
|
|
|
|
curthread->interrupted = 0;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
|
|
|
* Queue the running thread for the condition
|
|
|
|
* variable:
|
|
|
|
*/
|
2001-01-24 13:03:38 +00:00
|
|
|
cond_queue_enq(*cond, curthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2000-11-09 05:08:26 +00:00
|
|
|
/* Remember the mutex and sequence number: */
|
1999-03-23 05:07:56 +00:00
|
|
|
(*cond)->c_mutex = *mutex;
|
2000-11-09 05:08:26 +00:00
|
|
|
seqno = (*cond)->c_seqno;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Wait forever: */
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->wakeup_time.tv_sec = -1;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Unlock the mutex: */
|
2003-04-18 05:04:16 +00:00
|
|
|
if ((unlock_mutex != 0) &&
|
|
|
|
((rval = _mutex_cv_unlock(mutex)) != 0)) {
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
|
|
|
* Cannot unlock the mutex, so remove
|
|
|
|
* the running thread from the condition
|
|
|
|
* variable queue:
|
|
|
|
*/
|
2001-01-24 13:03:38 +00:00
|
|
|
cond_queue_remove(*cond, curthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Check for no more waiters: */
|
2003-04-18 05:04:16 +00:00
|
|
|
if (TAILQ_FIRST(&(*cond)->c_queue) == NULL)
|
1999-03-23 05:07:56 +00:00
|
|
|
(*cond)->c_mutex = NULL;
|
|
|
|
|
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
|
|
|
}
|
|
|
|
else {
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* Don't unlock the mutex the next
|
|
|
|
* time through the loop (if the
|
|
|
|
* thread has to be requeued after
|
|
|
|
* handling a signal).
|
1999-03-23 05:07:56 +00:00
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
unlock_mutex = 0;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* This thread is active and is in a
|
|
|
|
* critical region (holding the cv
|
|
|
|
* lock); we should be able to safely
|
|
|
|
* set the state.
|
|
|
|
*/
|
2003-05-16 19:58:30 +00:00
|
|
|
THR_SCHED_LOCK(curthread, curthread);
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_SET_STATE(curthread, PS_COND_WAIT);
|
2000-01-19 07:04:50 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/* Remember the CV: */
|
|
|
|
curthread->data.cond = *cond;
|
2003-05-16 19:58:30 +00:00
|
|
|
THR_SCHED_UNLOCK(curthread, curthread);
|
2003-04-18 05:04:16 +00:00
|
|
|
|
|
|
|
/* Unlock the CV structure: */
|
|
|
|
THR_LOCK_RELEASE(curthread,
|
|
|
|
&(*cond)->c_lock);
|
|
|
|
|
|
|
|
/* Schedule the next thread: */
|
|
|
|
_thr_sched_switch(curthread);
|
|
|
|
|
|
|
|
curthread->data.cond = NULL;
|
2001-08-19 20:05:42 +00:00
|
|
|
|
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* XXX - This really isn't a good check
|
|
|
|
* since there can be more than one
|
|
|
|
* thread waiting on the CV. Signals
|
|
|
|
* sent to threads waiting on mutexes
|
|
|
|
* or CVs should really be deferred
|
|
|
|
* until the threads are no longer
|
|
|
|
* waiting, but POSIX says that signals
|
|
|
|
* should be sent "as soon as possible".
|
2001-08-19 20:05:42 +00:00
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
done = (seqno != (*cond)->c_seqno);
|
|
|
|
|
|
|
|
if (THR_IN_SYNCQ(curthread)) {
|
1999-11-28 05:38:13 +00:00
|
|
|
/*
|
|
|
|
* Lock the condition variable
|
|
|
|
* while removing the thread.
|
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread,
|
|
|
|
&(*cond)->c_lock);
|
1999-11-28 05:38:13 +00:00
|
|
|
|
|
|
|
cond_queue_remove(*cond,
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread);
|
1999-11-28 05:38:13 +00:00
|
|
|
|
|
|
|
/* Check for no more waiters: */
|
|
|
|
if (TAILQ_FIRST(&(*cond)->c_queue) == NULL)
|
|
|
|
(*cond)->c_mutex = NULL;
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread,
|
|
|
|
&(*cond)->c_lock);
|
|
|
|
}
|
2000-11-09 05:08:26 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* Save the interrupted flag; locking
|
|
|
|
* the mutex may destroy it.
|
|
|
|
*/
|
|
|
|
interrupted = curthread->interrupted;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Note that even though this thread may
|
|
|
|
* have been canceled, POSIX requires
|
|
|
|
* that the mutex be reaquired prior to
|
|
|
|
* cancellation.
|
|
|
|
*/
|
2003-05-02 11:39:00 +00:00
|
|
|
if (done || interrupted) {
|
2001-08-19 20:05:42 +00:00
|
|
|
rval = _mutex_cv_lock(mutex);
|
2003-04-28 23:56:12 +00:00
|
|
|
unlock_mutex = 1;
|
|
|
|
}
|
1999-03-23 05:07:56 +00:00
|
|
|
}
|
1998-11-06 21:04:02 +00:00
|
|
|
}
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
|
|
|
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Trap invalid condition variable types: */
|
1996-08-20 08:22:01 +00:00
|
|
|
default:
|
1998-11-06 21:04:02 +00:00
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1998-11-06 21:04:02 +00:00
|
|
|
|
1996-08-20 08:22:01 +00:00
|
|
|
/* Return an invalid argument error: */
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
|
|
|
}
|
1999-11-28 05:38:13 +00:00
|
|
|
|
2001-01-24 13:03:38 +00:00
|
|
|
if ((interrupted != 0) && (curthread->continuation != NULL))
|
|
|
|
curthread->continuation((void *) curthread);
|
2000-11-09 05:08:26 +00:00
|
|
|
} while ((done == 0) && (rval == 0));
|
1996-01-22 00:23:58 +00:00
|
|
|
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (rval);
|
|
|
|
}
|
|
|
|
|
2003-05-30 00:21:52 +00:00
|
|
|
__strong_reference(_pthread_cond_wait, _thr_cond_wait);
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
int
|
|
|
|
__pthread_cond_wait(pthread_cond_t *cond, pthread_mutex_t *mutex)
|
|
|
|
{
|
|
|
|
struct pthread *curthread = _get_curthread();
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
_thr_enter_cancellation_point(curthread);
|
|
|
|
ret = _pthread_cond_wait(cond, mutex);
|
|
|
|
_thr_leave_cancellation_point(curthread);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_cond_timedwait(pthread_cond_t * cond, pthread_mutex_t * mutex,
|
1996-01-22 00:23:58 +00:00
|
|
|
const struct timespec * abstime)
|
|
|
|
{
|
2001-01-24 13:03:38 +00:00
|
|
|
struct pthread *curthread = _get_curthread();
|
2000-01-19 07:04:50 +00:00
|
|
|
int rval = 0;
|
2000-11-09 05:08:26 +00:00
|
|
|
int done = 0;
|
2000-01-19 07:04:50 +00:00
|
|
|
int interrupted = 0;
|
2003-04-18 05:04:16 +00:00
|
|
|
int unlock_mutex = 1;
|
2000-11-09 05:08:26 +00:00
|
|
|
int seqno;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-04-22 20:28:33 +00:00
|
|
|
THR_ASSERT(curthread->locklevel == 0,
|
|
|
|
"cv_timedwait: locklevel is not zero!");
|
2003-04-18 05:04:16 +00:00
|
|
|
|
2000-07-17 22:55:05 +00:00
|
|
|
if (abstime == NULL || abstime->tv_sec < 0 || abstime->tv_nsec < 0 ||
|
2003-05-19 23:04:50 +00:00
|
|
|
abstime->tv_nsec >= 1000000000)
|
2000-11-09 05:08:26 +00:00
|
|
|
return (EINVAL);
|
1998-04-04 11:33:01 +00:00
|
|
|
/*
|
2000-07-17 22:55:05 +00:00
|
|
|
* If the condition variable is statically initialized, perform dynamic
|
|
|
|
* initialization.
|
1998-04-04 11:33:01 +00:00
|
|
|
*/
|
2003-05-19 23:04:50 +00:00
|
|
|
if (*cond == NULL && (rval = pthread_cond_init(cond, NULL)) != 0)
|
2000-11-09 05:08:26 +00:00
|
|
|
return (rval);
|
|
|
|
|
2003-05-24 02:29:25 +00:00
|
|
|
if (!_kse_isthreaded())
|
|
|
|
_kse_setthreaded(1);
|
|
|
|
|
2000-11-09 05:08:26 +00:00
|
|
|
/*
|
|
|
|
* Enter a loop waiting for a condition signal or broadcast
|
|
|
|
* to wake up this thread. A loop is needed in case the waiting
|
|
|
|
* thread is interrupted by a signal to execute a signal handler.
|
|
|
|
* It is not (currently) possible to remain in the waiting queue
|
|
|
|
* while running a handler. Instead, the thread is interrupted
|
|
|
|
* and backed out of the waiting queue prior to executing the
|
|
|
|
* signal handler.
|
|
|
|
*/
|
|
|
|
do {
|
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
|
|
|
/* Lock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread, &(*cond)->c_lock);
|
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
|
|
|
|
1999-05-23 10:55:33 +00:00
|
|
|
/*
|
|
|
|
* If the condvar was statically allocated, properly
|
|
|
|
* initialize the tail queue.
|
|
|
|
*/
|
|
|
|
if (((*cond)->c_flags & COND_FLAGS_INITED) == 0) {
|
|
|
|
TAILQ_INIT(&(*cond)->c_queue);
|
|
|
|
(*cond)->c_flags |= COND_FLAGS_INITED;
|
|
|
|
}
|
|
|
|
|
1996-08-20 08:22:01 +00:00
|
|
|
/* Process according to condition variable type: */
|
|
|
|
switch ((*cond)->c_type) {
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Fast condition variable: */
|
1996-08-20 08:22:01 +00:00
|
|
|
case COND_TYPE_FAST:
|
1999-03-23 05:07:56 +00:00
|
|
|
if ((mutex == NULL) || (((*cond)->c_mutex != NULL) &&
|
|
|
|
((*cond)->c_mutex != *mutex))) {
|
|
|
|
/* Return invalid argument error: */
|
|
|
|
rval = EINVAL;
|
1998-11-06 21:04:02 +00:00
|
|
|
|
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1996-08-20 08:22:01 +00:00
|
|
|
} else {
|
1999-03-23 05:07:56 +00:00
|
|
|
/* Set the wakeup time: */
|
2003-04-18 05:04:16 +00:00
|
|
|
curthread->wakeup_time.tv_sec = abstime->tv_sec;
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->wakeup_time.tv_nsec =
|
1999-03-23 05:07:56 +00:00
|
|
|
abstime->tv_nsec;
|
1996-08-20 08:22:01 +00:00
|
|
|
|
1999-11-28 05:38:13 +00:00
|
|
|
/* Reset the timeout and interrupted flags: */
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread->timeout = 0;
|
|
|
|
curthread->interrupted = 0;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Queue the running thread for the condition
|
|
|
|
* variable:
|
|
|
|
*/
|
2001-01-24 13:03:38 +00:00
|
|
|
cond_queue_enq(*cond, curthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2000-11-09 05:08:26 +00:00
|
|
|
/* Remember the mutex and sequence number: */
|
1999-03-23 05:07:56 +00:00
|
|
|
(*cond)->c_mutex = *mutex;
|
2000-11-09 05:08:26 +00:00
|
|
|
seqno = (*cond)->c_seqno;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Unlock the mutex: */
|
2003-04-18 05:04:16 +00:00
|
|
|
if ((unlock_mutex != 0) &&
|
|
|
|
((rval = _mutex_cv_unlock(mutex)) != 0)) {
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* Cannot unlock the mutex; remove the
|
|
|
|
* running thread from the condition
|
1999-03-23 05:07:56 +00:00
|
|
|
* variable queue:
|
|
|
|
*/
|
2001-01-24 13:03:38 +00:00
|
|
|
cond_queue_remove(*cond, curthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Check for no more waiters: */
|
|
|
|
if (TAILQ_FIRST(&(*cond)->c_queue) == NULL)
|
|
|
|
(*cond)->c_mutex = NULL;
|
|
|
|
|
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1999-03-23 05:07:56 +00:00
|
|
|
} else {
|
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* Don't unlock the mutex the next
|
|
|
|
* time through the loop (if the
|
|
|
|
* thread has to be requeued after
|
|
|
|
* handling a signal).
|
1999-03-23 05:07:56 +00:00
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
unlock_mutex = 0;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* This thread is active and is in a
|
|
|
|
* critical region (holding the cv
|
|
|
|
* lock); we should be able to safely
|
|
|
|
* set the state.
|
|
|
|
*/
|
2003-05-16 19:58:30 +00:00
|
|
|
THR_SCHED_LOCK(curthread, curthread);
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_SET_STATE(curthread, PS_COND_WAIT);
|
2000-11-09 05:08:26 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/* Remember the CV: */
|
|
|
|
curthread->data.cond = *cond;
|
2003-05-16 19:58:30 +00:00
|
|
|
THR_SCHED_UNLOCK(curthread, curthread);
|
2003-04-18 05:04:16 +00:00
|
|
|
|
|
|
|
/* Unlock the CV structure: */
|
|
|
|
THR_LOCK_RELEASE(curthread,
|
|
|
|
&(*cond)->c_lock);
|
|
|
|
|
|
|
|
/* Schedule the next thread: */
|
|
|
|
_thr_sched_switch(curthread);
|
|
|
|
|
|
|
|
curthread->data.cond = NULL;
|
2001-08-19 20:05:42 +00:00
|
|
|
|
1999-11-28 05:38:13 +00:00
|
|
|
/*
|
2003-04-18 05:04:16 +00:00
|
|
|
* XXX - This really isn't a good check
|
|
|
|
* since there can be more than one
|
|
|
|
* thread waiting on the CV. Signals
|
|
|
|
* sent to threads waiting on mutexes
|
|
|
|
* or CVs should really be deferred
|
|
|
|
* until the threads are no longer
|
|
|
|
* waiting, but POSIX says that signals
|
|
|
|
* should be sent "as soon as possible".
|
1999-11-28 05:38:13 +00:00
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
done = (seqno != (*cond)->c_seqno);
|
|
|
|
|
|
|
|
if (THR_IN_CONDQ(curthread)) {
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
2001-08-19 20:05:42 +00:00
|
|
|
* Lock the condition variable
|
|
|
|
* while removing the thread.
|
1999-03-23 05:07:56 +00:00
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread,
|
|
|
|
&(*cond)->c_lock);
|
2001-08-19 20:05:42 +00:00
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
cond_queue_remove(*cond,
|
2001-01-24 13:03:38 +00:00
|
|
|
curthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* Check for no more waiters: */
|
|
|
|
if (TAILQ_FIRST(&(*cond)->c_queue) == NULL)
|
|
|
|
(*cond)->c_mutex = NULL;
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread,
|
|
|
|
&(*cond)->c_lock);
|
|
|
|
}
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* Save the interrupted flag; locking
|
|
|
|
* the mutex may destroy it.
|
|
|
|
*/
|
|
|
|
interrupted = curthread->interrupted;
|
|
|
|
if (curthread->timeout != 0) {
|
|
|
|
/* The wait timedout. */
|
|
|
|
rval = ETIMEDOUT;
|
|
|
|
(void)_mutex_cv_lock(mutex);
|
2003-07-02 14:12:37 +00:00
|
|
|
} else if (interrupted || done) {
|
2001-08-19 20:05:42 +00:00
|
|
|
rval = _mutex_cv_lock(mutex);
|
2003-07-02 14:12:37 +00:00
|
|
|
unlock_mutex = 1;
|
|
|
|
}
|
1996-08-20 08:22:01 +00:00
|
|
|
}
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
|
|
|
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Trap invalid condition variable types: */
|
1996-08-20 08:22:01 +00:00
|
|
|
default:
|
1998-11-06 21:04:02 +00:00
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1998-11-06 21:04:02 +00:00
|
|
|
|
1996-08-20 08:22:01 +00:00
|
|
|
/* Return an invalid argument error: */
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
|
2001-01-24 13:03:38 +00:00
|
|
|
if ((interrupted != 0) && (curthread->continuation != NULL))
|
2003-04-18 05:04:16 +00:00
|
|
|
curthread->continuation((void *)curthread);
|
2000-11-09 05:08:26 +00:00
|
|
|
} while ((done == 0) && (rval == 0));
|
1996-01-22 00:23:58 +00:00
|
|
|
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (rval);
|
|
|
|
}
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
int
|
|
|
|
__pthread_cond_timedwait(pthread_cond_t *cond, pthread_mutex_t *mutex,
|
|
|
|
const struct timespec *abstime)
|
|
|
|
{
|
|
|
|
struct pthread *curthread = _get_curthread();
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
_thr_enter_cancellation_point(curthread);
|
|
|
|
ret = _pthread_cond_timedwait(cond, mutex, abstime);
|
|
|
|
_thr_leave_cancellation_point(curthread);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_cond_signal(pthread_cond_t * cond)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
struct pthread *curthread = _get_curthread();
|
|
|
|
struct pthread *pthread;
|
2003-07-23 02:11:07 +00:00
|
|
|
struct kse_mailbox *kmbx;
|
2003-04-18 05:04:16 +00:00
|
|
|
int rval = 0;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-04-22 20:28:33 +00:00
|
|
|
THR_ASSERT(curthread->locklevel == 0,
|
|
|
|
"cv_timedwait: locklevel is not zero!");
|
2000-07-17 22:55:05 +00:00
|
|
|
if (cond == NULL)
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
2000-07-17 22:55:05 +00:00
|
|
|
/*
|
|
|
|
* If the condition variable is statically initialized, perform dynamic
|
|
|
|
* initialization.
|
|
|
|
*/
|
2000-11-16 22:50:33 +00:00
|
|
|
else if (*cond != NULL || (rval = pthread_cond_init(cond, NULL)) == 0) {
|
1998-04-29 09:59:34 +00:00
|
|
|
/* Lock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread, &(*cond)->c_lock);
|
1996-08-20 08:22:01 +00:00
|
|
|
|
|
|
|
/* Process according to condition variable type: */
|
|
|
|
switch ((*cond)->c_type) {
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Fast condition variable: */
|
1996-08-20 08:22:01 +00:00
|
|
|
case COND_TYPE_FAST:
|
2000-11-09 05:08:26 +00:00
|
|
|
/* Increment the sequence number: */
|
|
|
|
(*cond)->c_seqno++;
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
/*
|
|
|
|
* Wakeups have to be done with the CV lock held;
|
|
|
|
* otherwise there is a race condition where the
|
|
|
|
* thread can timeout, run on another KSE, and enter
|
|
|
|
* another blocking state (including blocking on a CV).
|
|
|
|
*/
|
|
|
|
if ((pthread = TAILQ_FIRST(&(*cond)->c_queue))
|
|
|
|
!= NULL) {
|
|
|
|
THR_SCHED_LOCK(curthread, pthread);
|
|
|
|
cond_queue_remove(*cond, pthread);
|
2003-07-18 02:46:30 +00:00
|
|
|
if ((pthread->kseg == curthread->kseg) &&
|
|
|
|
(pthread->active_priority >
|
|
|
|
curthread->active_priority))
|
|
|
|
curthread->critical_yield = 1;
|
2003-07-23 02:11:07 +00:00
|
|
|
kmbx = _thr_setrunnable_unlocked(pthread);
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_SCHED_UNLOCK(curthread, pthread);
|
2003-07-23 02:11:07 +00:00
|
|
|
if (kmbx != NULL)
|
|
|
|
kse_wakeup(kmbx);
|
2000-06-14 17:17:41 +00:00
|
|
|
}
|
1999-03-23 05:07:56 +00:00
|
|
|
/* Check for no more waiters: */
|
|
|
|
if (TAILQ_FIRST(&(*cond)->c_queue) == NULL)
|
|
|
|
(*cond)->c_mutex = NULL;
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
|
|
|
|
1997-04-11 22:38:22 +00:00
|
|
|
/* Trap invalid condition variable types: */
|
1996-08-20 08:22:01 +00:00
|
|
|
default:
|
|
|
|
/* Return an invalid argument error: */
|
1997-11-25 01:29:16 +00:00
|
|
|
rval = EINVAL;
|
1996-08-20 08:22:01 +00:00
|
|
|
break;
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (rval);
|
|
|
|
}
|
|
|
|
|
2003-05-30 00:21:52 +00:00
|
|
|
__strong_reference(_pthread_cond_signal, _thr_cond_signal);
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
int
|
2001-01-24 13:03:38 +00:00
|
|
|
_pthread_cond_broadcast(pthread_cond_t * cond)
|
1996-01-22 00:23:58 +00:00
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
struct pthread *curthread = _get_curthread();
|
|
|
|
struct pthread *pthread;
|
2003-07-23 02:11:07 +00:00
|
|
|
struct kse_mailbox *kmbx;
|
2003-04-18 05:04:16 +00:00
|
|
|
int rval = 0;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
2003-04-22 20:28:33 +00:00
|
|
|
THR_ASSERT(curthread->locklevel == 0,
|
|
|
|
"cv_timedwait: locklevel is not zero!");
|
2000-07-17 22:55:05 +00:00
|
|
|
if (cond == NULL)
|
1998-04-29 09:59:34 +00:00
|
|
|
rval = EINVAL;
|
2000-07-17 22:55:05 +00:00
|
|
|
/*
|
|
|
|
* If the condition variable is statically initialized, perform dynamic
|
|
|
|
* initialization.
|
|
|
|
*/
|
2000-11-16 22:50:33 +00:00
|
|
|
else if (*cond != NULL || (rval = pthread_cond_init(cond, NULL)) == 0) {
|
1998-04-29 09:59:34 +00:00
|
|
|
/* Lock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread, &(*cond)->c_lock);
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
/* Process according to condition variable type: */
|
|
|
|
switch ((*cond)->c_type) {
|
|
|
|
/* Fast condition variable: */
|
|
|
|
case COND_TYPE_FAST:
|
2000-11-09 05:08:26 +00:00
|
|
|
/* Increment the sequence number: */
|
|
|
|
(*cond)->c_seqno++;
|
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
/*
|
|
|
|
* Enter a loop to bring all threads off the
|
|
|
|
* condition queue:
|
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
while ((pthread = TAILQ_FIRST(&(*cond)->c_queue))
|
|
|
|
!= NULL) {
|
|
|
|
THR_SCHED_LOCK(curthread, pthread);
|
|
|
|
cond_queue_remove(*cond, pthread);
|
2003-07-18 02:46:30 +00:00
|
|
|
if ((pthread->kseg == curthread->kseg) &&
|
|
|
|
(pthread->active_priority >
|
|
|
|
curthread->active_priority))
|
|
|
|
curthread->critical_yield = 1;
|
2003-07-23 02:11:07 +00:00
|
|
|
kmbx = _thr_setrunnable_unlocked(pthread);
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_SCHED_UNLOCK(curthread, pthread);
|
2003-07-23 02:11:07 +00:00
|
|
|
if (kmbx != NULL)
|
|
|
|
kse_wakeup(kmbx);
|
1998-04-29 09:59:34 +00:00
|
|
|
}
|
1999-03-23 05:07:56 +00:00
|
|
|
|
|
|
|
/* There are no more waiting threads: */
|
|
|
|
(*cond)->c_mutex = NULL;
|
1998-04-29 09:59:34 +00:00
|
|
|
break;
|
2003-05-30 00:21:52 +00:00
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
/* Trap invalid condition variable types: */
|
|
|
|
default:
|
|
|
|
/* Return an invalid argument error: */
|
|
|
|
rval = EINVAL;
|
|
|
|
break;
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
|
1998-04-29 09:59:34 +00:00
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &(*cond)->c_lock);
|
1996-01-22 00:23:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Return the completion status: */
|
|
|
|
return (rval);
|
|
|
|
}
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2003-05-30 00:21:52 +00:00
|
|
|
__strong_reference(_pthread_cond_broadcast, _thr_cond_broadcast);
|
|
|
|
|
2000-10-13 22:12:32 +00:00
|
|
|
void
|
2003-04-18 05:04:16 +00:00
|
|
|
_cond_wait_backout(struct pthread *curthread)
|
2000-10-13 22:12:32 +00:00
|
|
|
{
|
|
|
|
pthread_cond_t cond;
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
cond = curthread->data.cond;
|
2000-10-13 22:12:32 +00:00
|
|
|
if (cond != NULL) {
|
|
|
|
/* Lock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_ACQUIRE(curthread, &cond->c_lock);
|
2000-10-13 22:12:32 +00:00
|
|
|
|
|
|
|
/* Process according to condition variable type: */
|
|
|
|
switch (cond->c_type) {
|
|
|
|
/* Fast condition variable: */
|
|
|
|
case COND_TYPE_FAST:
|
2003-04-18 05:04:16 +00:00
|
|
|
cond_queue_remove(cond, curthread);
|
2000-10-13 22:12:32 +00:00
|
|
|
|
|
|
|
/* Check for no more waiters: */
|
|
|
|
if (TAILQ_FIRST(&cond->c_queue) == NULL)
|
|
|
|
cond->c_mutex = NULL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Unlock the condition variable structure: */
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_LOCK_RELEASE(curthread, &cond->c_lock);
|
2000-10-13 22:12:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
|
|
|
* Dequeue a waiting thread from the head of a condition queue in
|
|
|
|
* descending priority order.
|
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
static inline struct pthread *
|
1999-03-23 05:07:56 +00:00
|
|
|
cond_queue_deq(pthread_cond_t cond)
|
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
struct pthread *pthread;
|
1999-03-23 05:07:56 +00:00
|
|
|
|
1999-11-28 05:38:13 +00:00
|
|
|
while ((pthread = TAILQ_FIRST(&cond->c_queue)) != NULL) {
|
2000-10-13 22:12:32 +00:00
|
|
|
TAILQ_REMOVE(&cond->c_queue, pthread, sqe);
|
2003-07-02 14:12:37 +00:00
|
|
|
THR_CONDQ_CLEAR(pthread);
|
1999-11-28 05:38:13 +00:00
|
|
|
if ((pthread->timeout == 0) && (pthread->interrupted == 0))
|
|
|
|
/*
|
|
|
|
* Only exit the loop when we find a thread
|
|
|
|
* that hasn't timed out or been canceled;
|
|
|
|
* those threads are already running and don't
|
|
|
|
* need their run state changed.
|
|
|
|
*/
|
|
|
|
break;
|
1999-03-23 05:07:56 +00:00
|
|
|
}
|
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
return (pthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Remove a waiting thread from a condition queue in descending priority
|
|
|
|
* order.
|
|
|
|
*/
|
|
|
|
static inline void
|
2003-04-18 05:04:16 +00:00
|
|
|
cond_queue_remove(pthread_cond_t cond, struct pthread *pthread)
|
1999-03-23 05:07:56 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Because pthread_cond_timedwait() can timeout as well
|
|
|
|
* as be signaled by another thread, it is necessary to
|
|
|
|
* guard against removing the thread from the queue if
|
|
|
|
* it isn't in the queue.
|
|
|
|
*/
|
2003-04-18 05:04:16 +00:00
|
|
|
if (THR_IN_CONDQ(pthread)) {
|
2000-10-13 22:12:32 +00:00
|
|
|
TAILQ_REMOVE(&cond->c_queue, pthread, sqe);
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_CONDQ_CLEAR(pthread);
|
1999-03-23 05:07:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Enqueue a waiting thread to a condition queue in descending priority
|
|
|
|
* order.
|
|
|
|
*/
|
|
|
|
static inline void
|
2003-04-18 05:04:16 +00:00
|
|
|
cond_queue_enq(pthread_cond_t cond, struct pthread *pthread)
|
1999-03-23 05:07:56 +00:00
|
|
|
{
|
2003-04-18 05:04:16 +00:00
|
|
|
struct pthread *tid = TAILQ_LAST(&cond->c_queue, cond_head);
|
1999-03-23 05:07:56 +00:00
|
|
|
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_ASSERT(!THR_IN_SYNCQ(pthread),
|
|
|
|
"cond_queue_enq: thread already queued!");
|
2000-10-13 22:12:32 +00:00
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/*
|
|
|
|
* For the common case of all threads having equal priority,
|
|
|
|
* we perform a quick check against the priority of the thread
|
|
|
|
* at the tail of the queue.
|
|
|
|
*/
|
|
|
|
if ((tid == NULL) || (pthread->active_priority <= tid->active_priority))
|
2000-10-13 22:12:32 +00:00
|
|
|
TAILQ_INSERT_TAIL(&cond->c_queue, pthread, sqe);
|
1999-03-23 05:07:56 +00:00
|
|
|
else {
|
|
|
|
tid = TAILQ_FIRST(&cond->c_queue);
|
|
|
|
while (pthread->active_priority <= tid->active_priority)
|
2000-10-13 22:12:32 +00:00
|
|
|
tid = TAILQ_NEXT(tid, sqe);
|
|
|
|
TAILQ_INSERT_BEFORE(tid, pthread, sqe);
|
1999-03-23 05:07:56 +00:00
|
|
|
}
|
2003-04-18 05:04:16 +00:00
|
|
|
THR_CONDQ_SET(pthread);
|
2000-10-13 22:12:32 +00:00
|
|
|
pthread->data.cond = cond;
|
1999-03-23 05:07:56 +00:00
|
|
|
}
|