fbeb36e4bf
thread switches should be on par with that under scheduler
activations.
o Timing is achieved through the use of a fixed interval
timer (ITIMER_PROF) to count scheduling ticks instead
of retrieving the time-of-day upon every thread switch
and calculating elapsed real time.
o Polling for I/O readiness is performed once for each
scheduling tick instead of every thread switch.
o The non-signal saving/restoring versions of setjmp/longjmp
are used to save and restore thread contexts. This may
allow the removal of _THREAD_SAFE macros from setjmp()
and longjmp() - needs more investigation.
Change signal handling so that signals are handled in the
context of the thread that is receiving the signal. When
signals are dispatched to a thread, a special signal handling
frame is created on top of the target threads stack. The
frame contains the threads saved state information and a new
context in which the thread can run. The applications signal
handler is invoked through a wrapper routine that knows how
to restore the threads saved state and unwind to previous
frames.
Fix interruption of threads due to signals. Some states
were being improperly interrupted while other states were
not being interrupted. This should fix several PRs.
Signal handlers, which are invoked as a result of a process
signal (not by pthread_kill()), are now called with the
code (or siginfo_t if SA_SIGINFO was set in sa_flags) and
sigcontext_t as received from the process signal handler.
Modify the search for a thread to which a signal is delivered.
The search algorithm is now:
o First thread found in sigwait() with signal in wait mask.
o First thread found sigsuspend()'d on the signal.
o Current thread if signal is unmasked.
o First thread found with signal unmasked.
Collapse machine dependent support into macros defined in
pthread_private.h. These should probably eventually be moved
into separate MD files.
Change the range of settable priorities to be compliant with
POSIX (0-31). The threads library uses higher priorities
internally for real-time threads (not yet implemented) and
threads executing signal handlers. Real-time threads and
threads running signal handlers add 64 and 32, respectively,
to a threads base priority.
Some other small changes and cleanups.
PR: 17757 18559 21943
Reviewed by: jasone
316 lines
10 KiB
C
316 lines
10 KiB
C
/*
|
|
* Copyright (c) 1995-1998 John Birrell <jb@cimlogic.com.au>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by John Birrell.
|
|
* 4. Neither the name of the author nor the names of any co-contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <fcntl.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#ifdef _THREAD_SAFE
|
|
#include <pthread.h>
|
|
#include <errno.h>
|
|
#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"},
|
|
{PS_FDW_WAIT , "Waiting for write"},
|
|
{PS_FILE_WAIT , "Waiting for FILE lock"},
|
|
{PS_POLL_WAIT , "Waiting on poll"},
|
|
{PS_SELECT_WAIT , "Waiting on select"},
|
|
{PS_SLEEP_WAIT , "Sleeping"},
|
|
{PS_WAIT_WAIT , "Waiting process"},
|
|
{PS_SIGSUSPEND , "Suspended, waiting for a signal"},
|
|
{PS_SIGWAIT , "Waiting for a signal"},
|
|
{PS_SPINBLOCK , "Waiting for a spinlock"},
|
|
{PS_JOIN , "Waiting to join"},
|
|
{PS_SUSPENDED , "Suspended"},
|
|
{PS_DEAD , "Dead"},
|
|
{PS_DEADLOCK , "Deadlocked"},
|
|
{PS_STATE_MAX , "Not a real state!"}
|
|
};
|
|
|
|
void
|
|
_thread_dump_info(void)
|
|
{
|
|
char s[512];
|
|
int fd;
|
|
int i;
|
|
int j;
|
|
pthread_t pthread;
|
|
char tmpfile[128];
|
|
pq_list_t *pq_list;
|
|
|
|
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;
|
|
} 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: */
|
|
TAILQ_FOREACH(pthread, &_thread_list, tle) {
|
|
/* 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));
|
|
|
|
/* 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) {
|
|
/* File descriptor read lock wait: */
|
|
case PS_FDLR_WAIT:
|
|
case PS_FDLW_WAIT:
|
|
case PS_FDR_WAIT:
|
|
case PS_FDW_WAIT:
|
|
/* Write the lock details: */
|
|
snprintf(s, sizeof(s), "fd %d[%s:%d]",
|
|
pthread->data.fd.fd,
|
|
pthread->data.fd.fname,
|
|
pthread->data.fd.branch);
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
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);
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
break;
|
|
case PS_SIGWAIT:
|
|
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");
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
break;
|
|
|
|
/*
|
|
* Trap other states that are not explicitly
|
|
* coded to dump information:
|
|
*/
|
|
default:
|
|
/* Nothing to do here. */
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* 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));
|
|
}
|
|
|
|
/* 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));
|
|
}
|
|
|
|
/* Check if there are no dead threads: */
|
|
if (TAILQ_FIRST(&_dead_list) == NULL) {
|
|
/* 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:
|
|
*/
|
|
TAILQ_FOREACH(pthread, &_dead_list, dle) {
|
|
/* Output a record for the current thread: */
|
|
snprintf(s, sizeof(s),
|
|
"Thread %p prio %3d [%s:%d]\n",
|
|
pthread, pthread->base_priority,
|
|
pthread->fname,pthread->lineno);
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
}
|
|
}
|
|
|
|
/* Output a header for file descriptors: */
|
|
snprintf(s, sizeof(s), "\n\n=============\nFILE DESCRIPTOR TABLE (table size %d)\n\n",_thread_dtablesize);
|
|
_thread_sys_write(fd, s, strlen(s));
|
|
|
|
/* 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: */
|
|
snprintf(s, sizeof(s),
|
|
"fd[%3d] read owner %p count %d [%s:%d]\n write owner %p count %d [%s:%d]\n",
|
|
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);
|
|
}
|
|
}
|
|
|
|
/* 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) {
|
|
if (thread->name != NULL) {
|
|
/* Free space for previous name. */
|
|
free(thread->name);
|
|
}
|
|
thread->name = strdup(name);
|
|
}
|
|
}
|
|
#endif
|