1996-01-22 00:23:58 +00:00
|
|
|
/*
|
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.
|
|
|
|
|
* 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
|
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 <stdio.h>
|
|
|
|
|
#include <fcntl.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
#include <unistd.h>
|
|
|
|
|
#ifdef _THREAD_SAFE
|
|
|
|
|
#include <pthread.h>
|
1999-01-11 00:02:37 +00:00
|
|
|
#include <errno.h>
|
1996-01-22 00:23:58 +00:00
|
|
|
#include "pthread_private.h"
|
|
|
|
|
|
|
|
|
|
struct s_thread_info {
|
|
|
|
|
enum pthread_state state;
|
|
|
|
|
char *name;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Static variables: */
|
|
|
|
|
static const struct s_thread_info thread_info[] = {
|
|
|
|
|
{PS_RUNNING , "Running"},
|
|
|
|
|
{PS_SIGTHREAD , "Waiting on signal thread"},
|
|
|
|
|
{PS_MUTEX_WAIT , "Waiting on a mutex"},
|
|
|
|
|
{PS_COND_WAIT , "Waiting on a condition variable"},
|
|
|
|
|
{PS_FDLR_WAIT , "Waiting for a file read lock"},
|
|
|
|
|
{PS_FDLW_WAIT , "Waiting for a file write lock"},
|
|
|
|
|
{PS_FDR_WAIT , "Waiting for read"},
|
1998-04-11 07:47:22 +00:00
|
|
|
{PS_FDW_WAIT , "Waiting for write"},
|
|
|
|
|
{PS_FILE_WAIT , "Waiting for FILE 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
|
|
|
{PS_POLL_WAIT , "Waiting on poll"},
|
1996-01-22 00:23:58 +00:00
|
|
|
{PS_SELECT_WAIT , "Waiting on select"},
|
|
|
|
|
{PS_SLEEP_WAIT , "Sleeping"},
|
|
|
|
|
{PS_WAIT_WAIT , "Waiting process"},
|
1998-09-30 06:29:54 +00:00
|
|
|
{PS_SIGSUSPEND , "Suspended, waiting for a signal"},
|
1996-01-22 00:23:58 +00:00
|
|
|
{PS_SIGWAIT , "Waiting for a signal"},
|
1999-03-23 05:07:56 +00:00
|
|
|
{PS_SPINBLOCK , "Waiting for a spinlock"},
|
1996-01-22 00:23:58 +00:00
|
|
|
{PS_JOIN , "Waiting to join"},
|
|
|
|
|
{PS_SUSPENDED , "Suspended"},
|
|
|
|
|
{PS_DEAD , "Dead"},
|
1999-03-23 05:07:56 +00:00
|
|
|
{PS_DEADLOCK , "Deadlocked"},
|
1996-01-22 00:23:58 +00:00
|
|
|
{PS_STATE_MAX , "Not a real state!"}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
_thread_dump_info(void)
|
|
|
|
|
{
|
1998-09-30 06:29:54 +00:00
|
|
|
char s[512];
|
1996-01-22 00:23:58 +00:00
|
|
|
int fd;
|
|
|
|
|
int i;
|
|
|
|
|
int j;
|
|
|
|
|
pthread_t pthread;
|
1999-01-11 00:02:37 +00:00
|
|
|
char tmpfile[128];
|
1999-03-23 05:07:56 +00:00
|
|
|
pq_list_t *pq_list;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1999-01-11 00:02:37 +00:00
|
|
|
for (i = 0; i < 100000; i++) {
|
|
|
|
|
snprintf(tmpfile, sizeof(tmpfile), "/tmp/uthread.dump.%u.%i",
|
|
|
|
|
getpid(), i);
|
|
|
|
|
/* Open the dump file for append and create it if necessary: */
|
|
|
|
|
if ((fd = _thread_sys_open(tmpfile, O_RDWR | O_CREAT | O_EXCL,
|
|
|
|
|
0666)) < 0) {
|
|
|
|
|
/* Can't open the dump file. */
|
|
|
|
|
if (errno == EEXIST)
|
|
|
|
|
continue;
|
|
|
|
|
/*
|
|
|
|
|
* We only need to continue in case of
|
|
|
|
|
* EEXIT error. Most other error
|
|
|
|
|
* codes means that we will fail all
|
|
|
|
|
* the times.
|
|
|
|
|
*/
|
|
|
|
|
return;
|
|
|
|
|
} else {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (i==100000) {
|
|
|
|
|
/* all 100000 possibilities are in use :( */
|
|
|
|
|
return;
|
1996-01-22 00:23:58 +00:00
|
|
|
} else {
|
|
|
|
|
/* Output a header for active threads: */
|
|
|
|
|
strcpy(s, "\n\n=============\nACTIVE THREADS\n\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
|
|
|
|
/* Enter a loop to report each thread in the global list: */
|
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
|
|
|
TAILQ_FOREACH(pthread, &_thread_list, tle) {
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Find the state: */
|
1998-09-30 06:29:54 +00:00
|
|
|
for (j = 0; j < (sizeof(thread_info) /
|
|
|
|
|
sizeof(struct s_thread_info)) - 1; j++)
|
1996-01-22 00:23:58 +00:00
|
|
|
if (thread_info[j].state == pthread->state)
|
|
|
|
|
break;
|
|
|
|
|
/* Output a record for the current thread: */
|
1998-09-30 06:29:54 +00:00
|
|
|
snprintf(s, sizeof(s),
|
|
|
|
|
"--------------------\nThread %p (%s) prio %3d state %s [%s:%d]\n",
|
|
|
|
|
pthread, (pthread->name == NULL) ?
|
1999-03-23 05:07:56 +00:00
|
|
|
"":pthread->name, pthread->base_priority,
|
1998-09-30 06:29:54 +00:00
|
|
|
thread_info[j].name,
|
|
|
|
|
pthread->fname,pthread->lineno);
|
1996-01-22 00:23:58 +00:00
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
|
|
|
|
/* Check if this is the running thread: */
|
|
|
|
|
if (pthread == _thread_run) {
|
|
|
|
|
/* Output a record for the running thread: */
|
|
|
|
|
strcpy(s, "This is the running thread\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
/* Check if this is the initial thread: */
|
|
|
|
|
if (pthread == _thread_initial) {
|
|
|
|
|
/* Output a record for the initial thread: */
|
|
|
|
|
strcpy(s, "This is the initial thread\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
/* Process according to thread state: */
|
|
|
|
|
switch (pthread->state) {
|
1998-04-11 07:47:22 +00:00
|
|
|
/* File descriptor read lock wait: */
|
1996-01-22 00:23:58 +00:00
|
|
|
case PS_FDLR_WAIT:
|
1997-02-05 23:26:09 +00:00
|
|
|
case PS_FDLW_WAIT:
|
|
|
|
|
case PS_FDR_WAIT:
|
|
|
|
|
case PS_FDW_WAIT:
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Write the lock details: */
|
1998-09-30 06:29:54 +00:00
|
|
|
snprintf(s, sizeof(s), "fd %d[%s:%d]",
|
|
|
|
|
pthread->data.fd.fd,
|
|
|
|
|
pthread->data.fd.fname,
|
|
|
|
|
pthread->data.fd.branch);
|
1996-01-22 00:23:58 +00:00
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
1998-09-30 06:29:54 +00:00
|
|
|
snprintf(s, sizeof(s), "owner %pr/%pw\n",
|
|
|
|
|
_thread_fd_table[pthread->data.fd.fd]->r_owner,
|
|
|
|
|
_thread_fd_table[pthread->data.fd.fd]->w_owner);
|
1996-01-22 00:23:58 +00:00
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
break;
|
1998-04-17 09:39:37 +00:00
|
|
|
case PS_SIGWAIT:
|
1999-09-29 15:18:46 +00:00
|
|
|
snprintf(s, sizeof(s), "sigmask (hi)");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
for (i = _SIG_WORDS - 1; i >= 0; i--) {
|
|
|
|
|
snprintf(s, sizeof(s), "%08x\n",
|
|
|
|
|
pthread->sigmask.__bits[i]);
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
snprintf(s, sizeof(s), "(lo)\n");
|
1998-04-17 09:39:37 +00:00
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
break;
|
1996-01-22 00:23:58 +00:00
|
|
|
|
1998-04-11 07:47:22 +00:00
|
|
|
/*
|
|
|
|
|
* Trap other states that are not explicitly
|
|
|
|
|
* coded to dump information:
|
|
|
|
|
*/
|
1996-01-22 00:23:58 +00:00
|
|
|
default:
|
|
|
|
|
/* Nothing to do here. */
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-03-23 05:07:56 +00:00
|
|
|
/* Output a header for ready threads: */
|
|
|
|
|
strcpy(s, "\n\n=============\nREADY THREADS\n\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
|
|
|
|
/* Enter a loop to report each thread in the ready queue: */
|
|
|
|
|
TAILQ_FOREACH (pq_list, &_readyq.pq_queue, pl_link) {
|
|
|
|
|
TAILQ_FOREACH(pthread, &pq_list->pl_head, pqe) {
|
|
|
|
|
/* Find the state: */
|
|
|
|
|
for (j = 0; j < (sizeof(thread_info) /
|
|
|
|
|
sizeof(struct s_thread_info)) - 1; j++)
|
|
|
|
|
if (thread_info[j].state == pthread->state)
|
|
|
|
|
break;
|
|
|
|
|
/* Output a record for the current thread: */
|
|
|
|
|
snprintf(s, sizeof(s),
|
|
|
|
|
"--------------------\nThread %p (%s) prio %3d state %s [%s:%d]\n",
|
|
|
|
|
pthread, (pthread->name == NULL) ?
|
|
|
|
|
"":pthread->name, pthread->base_priority,
|
|
|
|
|
thread_info[j].name,
|
|
|
|
|
pthread->fname,pthread->lineno);
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Output a header for waiting threads: */
|
|
|
|
|
strcpy(s, "\n\n=============\nWAITING THREADS\n\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
|
|
|
|
/* Enter a loop to report each thread in the waiting queue: */
|
|
|
|
|
TAILQ_FOREACH (pthread, &_waitingq, pqe) {
|
|
|
|
|
/* Find the state: */
|
|
|
|
|
for (j = 0; j < (sizeof(thread_info) /
|
|
|
|
|
sizeof(struct s_thread_info)) - 1; j++)
|
|
|
|
|
if (thread_info[j].state == pthread->state)
|
|
|
|
|
break;
|
|
|
|
|
/* Output a record for the current thread: */
|
|
|
|
|
snprintf(s, sizeof(s),
|
|
|
|
|
"--------------------\nThread %p (%s) prio %3d state %s [%s:%d]\n",
|
|
|
|
|
pthread, (pthread->name == NULL) ?
|
|
|
|
|
"":pthread->name, pthread->base_priority,
|
|
|
|
|
thread_info[j].name,
|
|
|
|
|
pthread->fname,pthread->lineno);
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
|
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
|
|
|
/* Output a header for threads in the work queue: */
|
|
|
|
|
strcpy(s, "\n\n=============\nTHREADS IN WORKQ\n\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
|
|
|
|
/* Enter a loop to report each thread in the waiting queue: */
|
|
|
|
|
TAILQ_FOREACH (pthread, &_workq, qe) {
|
|
|
|
|
/* Find the state: */
|
|
|
|
|
for (j = 0; j < (sizeof(thread_info) /
|
|
|
|
|
sizeof(struct s_thread_info)) - 1; j++)
|
|
|
|
|
if (thread_info[j].state == pthread->state)
|
|
|
|
|
break;
|
|
|
|
|
/* Output a record for the current thread: */
|
|
|
|
|
snprintf(s, sizeof(s),
|
|
|
|
|
"--------------------\nThread %p (%s) prio %3d state %s [%s:%d]\n",
|
|
|
|
|
pthread, (pthread->name == NULL) ?
|
|
|
|
|
"":pthread->name, pthread->base_priority,
|
|
|
|
|
thread_info[j].name,
|
|
|
|
|
pthread->fname,pthread->lineno);
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Check if there are no dead threads: */
|
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
|
|
|
if (TAILQ_FIRST(&_dead_list) == NULL) {
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Output a record: */
|
|
|
|
|
strcpy(s, "\n\nTHERE ARE NO DEAD THREADS\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
} else {
|
|
|
|
|
/* Output a header for dead threads: */
|
|
|
|
|
strcpy(s, "\n\nDEAD THREADS\n\n");
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Enter a loop to report each thread in the global
|
|
|
|
|
* dead thread list:
|
|
|
|
|
*/
|
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
|
|
|
TAILQ_FOREACH(pthread, &_dead_list, dle) {
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Output a record for the current thread: */
|
1998-09-30 06:29:54 +00:00
|
|
|
snprintf(s, sizeof(s),
|
|
|
|
|
"Thread %p prio %3d [%s:%d]\n",
|
1999-03-23 05:07:56 +00:00
|
|
|
pthread, pthread->base_priority,
|
1998-09-30 06:29:54 +00:00
|
|
|
pthread->fname,pthread->lineno);
|
1996-01-22 00:23:58 +00:00
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1997-02-05 23:26:09 +00:00
|
|
|
/* Output a header for file descriptors: */
|
1998-06-09 23:21:05 +00:00
|
|
|
snprintf(s, sizeof(s), "\n\n=============\nFILE DESCRIPTOR TABLE (table size %d)\n\n",_thread_dtablesize);
|
1997-02-05 23:26:09 +00:00
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
|
1996-01-22 00:23:58 +00:00
|
|
|
/* Enter a loop to report file descriptor lock usage: */
|
|
|
|
|
for (i = 0; i < _thread_dtablesize; i++) {
|
|
|
|
|
/*
|
|
|
|
|
* Check if memory is allocated for this file
|
|
|
|
|
* descriptor:
|
|
|
|
|
*/
|
|
|
|
|
if (_thread_fd_table[i] != NULL) {
|
|
|
|
|
/* Report the file descriptor lock status: */
|
1998-09-30 06:29:54 +00:00
|
|
|
snprintf(s, sizeof(s),
|
|
|
|
|
"fd[%3d] read owner %p count %d [%s:%d]\n write owner %p count %d [%s:%d]\n",
|
1996-01-22 00:23:58 +00:00
|
|
|
i,
|
|
|
|
|
_thread_fd_table[i]->r_owner,
|
|
|
|
|
_thread_fd_table[i]->r_lockcount,
|
|
|
|
|
_thread_fd_table[i]->r_fname,
|
|
|
|
|
_thread_fd_table[i]->r_lineno,
|
|
|
|
|
_thread_fd_table[i]->w_owner,
|
|
|
|
|
_thread_fd_table[i]->w_lockcount,
|
|
|
|
|
_thread_fd_table[i]->w_fname,
|
|
|
|
|
_thread_fd_table[i]->w_lineno);
|
|
|
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Close the dump file: */
|
|
|
|
|
_thread_sys_close(fd);
|
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
1998-04-11 07:47:22 +00:00
|
|
|
|
|
|
|
|
/* Set the thread name for debug: */
|
|
|
|
|
void
|
|
|
|
|
pthread_set_name_np(pthread_t thread, char *name)
|
|
|
|
|
{
|
|
|
|
|
/* Check if the caller has specified a valid thread: */
|
|
|
|
|
if (thread != NULL && thread->magic == PTHREAD_MAGIC)
|
|
|
|
|
thread->name = strdup(name);
|
|
|
|
|
return;
|
|
|
|
|
}
|
1996-01-22 00:23:58 +00:00
|
|
|
#endif
|
