head 1.45; access; symbols PTH_2_0_7:1.44 PTH_2_0_6:1.43 PTH_2_0_5:1.43 PTH_2_0_4:1.43 PTH_2_0_3:1.42 PTH_2_0_2:1.42 PTH_2_0_1:1.42 PTH_2_0_0:1.41 PTH_2_0b2:1.40 PTH_2_0b1:1.40 PTH_2_0b0:1.40 PTH_1_4:1.37.0.2 PTH_1_4_1:1.37 PTH_1_4_0:1.35 PTH_1_3_7:1.34 PTH_1_4a3:1.34 PTH_1_3_6:1.34 PTH_1_4a2:1.34 PTH_1_3_5:1.34 PTH_1_4a1:1.34 PTH_1_3_4:1.34 PTH_1_3:1.34.0.2 PTH_1_3_3:1.34 PTH_1_3_2:1.33 PTH_1_3_1:1.33 PTH_1_3_0:1.33 PTH_1_3b3:1.33 PTH_1_2_3:1.29.2.2 PTH_1_3b2:1.33 PTH_1_3b1:1.32 PTH_1_3a5:1.32 PTH_1_3a4:1.32 PTH_1_3a3:1.32 PTH_1_2_2:1.29.2.1 PTH_1_3a2:1.32 PTH_1_2_1:1.29.2.1 PTH_1_3a1:1.30 PTH_1_2:1.29.0.2 PTH_1_2_0:1.29 PTH_1_2b8:1.28 PTH_1_2b7:1.28 PTH_1_1_6:1.27 PTH_1_2b6:1.28 PTH_1_2b5:1.28 PTH_1_2b4:1.28 PTH_1_2b3:1.28 PTH_1_2b2:1.27 PTH_1_2b1:1.27 PTH_1_1_5:1.27 PTH_1_0_6:1.20 PTH_1_0_5:1.20 PTH_1_0:1.20.0.2 PTH_1_1:1.27.0.2 PTH_1_1_4:1.27 PTH_1_1_3:1.26 PTH_1_1_2:1.26 PTH_1_1_1:1.26 PTH_1_1_0:1.26 PTH_1_1b7:1.25 PTH_1_1b6:1.25 PTH_1_1b5:1.24 PTH_1_1b4:1.23 PTH_1_1b3:1.23 PTH_1_1b2:1.22 PTH_1_1b1:1.22 PTH_1_0_4:1.20 PTH_1_0_3:1.20 PTH_1_0_2:1.20 PTH_1_0_1:1.20 PTH_1_0_0:1.20 PTH_1_0b8:1.20 PTH_1_0b7:1.20 PTH_1_0b6:1.20 PTH_1_0b5:1.20 PTH_1_0b4:1.20 PTH_1_0b3:1.18 PTH_1_0b2:1.18 PTH_1_0b1:1.17 PTH_0_9_21:1.15 PTH_0_9_20:1.14 PTH_0_9_19:1.14 PTH_0_9_18:1.13 PTH_0_9_17:1.10 PTH_0_9_16:1.9 PTH_0_9_15:1.9 PTH_0_9_14:1.9 PTH_0_9_13:1.8 PTH_0_9_12:1.6 PTH_0_9_11:1.5 PTH_0_9_10:1.5 PTH_0_9_9:1.4 PTH_0_9_8:1.4 PTH_0_9_7:1.2 PTH_0_9_6:1.2 PTH_0_9_5:1.1.1.1 PTH_0_9_4:1.1.1.1 PTH_0_9_3:1.1.1.1 PTH_0_9_2:1.1.1.1 PTH_0_9_1:1.1.1.1 PTH_0_9_0:1.1.1.1 RSE:1.1.1; locks; strict; comment @ * @; 1.45 date 2007.01.01.18.23.53; author rse; state Exp; branches; next 1.44; commitid 9DhdiirNzQPBIP0s; 1.44 date 2006.06.08.17.54.53; author rse; state Exp; branches; next 1.43; commitid x8N3mLVdQgkbdeAr; 1.43 date 2004.12.31.19.34.45; author rse; state Exp; branches; next 1.42; 1.42 date 2004.07.13.10.50.49; author rse; state Exp; branches; next 1.41; 1.41 date 2003.01.01.15.49.12; author rse; state Exp; branches; next 1.40; 1.40 date 2002.11.03.11.15.05; author rse; state Exp; branches; next 1.39; 1.39 date 2002.10.24.15.21.14; author rse; state Exp; branches; next 1.38; 1.38 date 2002.01.30.13.07.08; author rse; state Exp; branches; next 1.37; 1.37 date 2002.01.27.11.03.41; author rse; state Exp; branches; next 1.36; 1.36 date 2001.03.30.11.15.34; author rse; state Exp; branches; next 1.35; 1.35 date 2001.03.24.14.51.05; author rse; state Exp; branches; next 1.34; 1.34 date 2000.03.09.12.11.51; author rse; state Exp; branches; next 1.33; 1.33 date 2000.01.27.12.53.02; author rse; state Exp; branches; next 1.32; 1.32 date 99.12.30.21.59.01; author rse; state Exp; branches; next 1.31; 1.31 date 99.11.09.08.11.32; author rse; state Exp; branches; next 1.30; 1.30 date 99.11.01.10.27.20; author rse; state Exp; branches; next 1.29; 1.29 date 99.10.31.11.46.13; author rse; state Exp; branches 1.29.2.1; next 1.28; 1.28 date 99.09.17.08.01.55; author rse; state Exp; branches; next 1.27; 1.27 date 99.08.30.13.45.01; author rse; state Exp; branches; next 1.26; 1.26 date 99.08.19.15.08.53; author rse; state Exp; branches; next 1.25; 1.25 date 99.08.18.08.26.21; author rse; state Exp; branches; next 1.24; 1.24 date 99.08.17.08.08.36; author rse; state Exp; branches; next 1.23; 1.23 date 99.08.11.09.14.09; author rse; state Exp; branches; next 1.22; 1.22 date 99.08.07.12.05.26; author rse; state Exp; branches; next 1.21; 1.21 date 99.08.04.14.36.11; author rse; state Exp; branches; next 1.20; 1.20 date 99.07.08.10.34.01; author rse; state Exp; branches; next 1.19; 1.19 date 99.07.08.10.19.11; author rse; state Exp; branches; next 1.18; 1.18 date 99.07.04.12.05.35; author rse; state Exp; branches; next 1.17; 1.17 date 99.06.28.09.45.24; author rse; state Exp; branches; next 1.16; 1.16 date 99.06.27.15.38.04; author rse; state Exp; branches; next 1.15; 1.15 date 99.06.26.12.30.55; author rse; state Exp; branches; next 1.14; 1.14 date 99.06.21.14.24.47; author rse; state Exp; branches; next 1.13; 1.13 date 99.06.19.15.44.16; author rse; state Exp; branches; next 1.12; 1.12 date 99.06.19.15.11.35; author rse; state Exp; branches; next 1.11; 1.11 date 99.06.19.13.00.14; author rse; state Exp; branches; next 1.10; 1.10 date 99.06.18.09.25.40; author rse; state Exp; branches; next 1.9; 1.9 date 99.06.01.15.51.33; author rse; state Exp; branches; next 1.8; 1.8 date 99.06.01.09.55.26; author rse; state Exp; branches; next 1.7; 1.7 date 99.05.31.12.43.00; author rse; state Exp; branches; next 1.6; 1.6 date 99.05.30.13.08.37; author rse; state Exp; branches; next 1.5; 1.5 date 99.05.28.09.05.13; author rse; state Exp; branches; next 1.4; 1.4 date 99.05.24.11.45.15; author rse; state Exp; branches; next 1.3; 1.3 date 99.05.24.07.58.13; author rse; state Exp; branches; next 1.2; 1.2 date 99.05.22.14.37.53; author rse; state Exp; branches; next 1.1; 1.1 date 99.05.13.12.18.16; author rse; state Exp; branches 1.1.1.1; next ; 1.29.2.1 date 99.11.01.10.25.01; author rse; state Exp; branches; next 1.29.2.2; 1.29.2.2 date 2000.02.04.22.07.18; author rse; state Exp; branches; next ; 1.1.1.1 date 99.05.13.12.18.16; author rse; state Exp; branches; next ; desc @@ 1.45 log @Adjusted all copyright messages for new year 2007. @ text @/* ** GNU Pth - The GNU Portable Threads ** Copyright (c) 1999-2007 Ralf S. Engelschall ** ** This file is part of GNU Pth, a non-preemptive thread scheduling ** library which can be found at http://www.gnu.org/software/pth/. ** ** This library is free software; you can redistribute it and/or ** modify it under the terms of the GNU Lesser General Public ** License as published by the Free Software Foundation; either ** version 2.1 of the License, or (at your option) any later version. ** ** This library is distributed in the hope that it will be useful, ** but WITHOUT ANY WARRANTY; without even the implied warranty of ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ** Lesser General Public License for more details. ** ** You should have received a copy of the GNU Lesser General Public ** License along with this library; if not, write to the Free Software ** Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 ** USA, or contact Ralf S. Engelschall . ** ** pth_tcb.c: Pth thread control block handling */ /* Patient: Doctor, it hurts when I do this! Doctor: Well, then don't do it. */ #include "pth_p.h" #if cpp #define PTH_TCB_NAMELEN 40 /* thread control block */ struct pth_st { /* priority queue handling */ pth_t q_next; /* next thread in pool */ pth_t q_prev; /* previous thread in pool */ int q_prio; /* (relative) priority of thread when queued */ /* standard thread control block ingredients */ int prio; /* base priority of thread */ char name[PTH_TCB_NAMELEN];/* name of thread (mainly for debugging) */ int dispatches; /* total number of thread dispatches */ pth_state_t state; /* current state indicator for thread */ /* timing */ pth_time_t spawned; /* time point at which thread was spawned */ pth_time_t lastran; /* time point at which thread was last running */ pth_time_t running; /* time range the thread was already running */ /* event handling */ pth_event_t events; /* events the tread is waiting for */ /* per-thread signal handling */ sigset_t sigpending; /* set of pending signals */ int sigpendcnt; /* number of pending signals */ /* machine context */ pth_mctx_t mctx; /* last saved machine state of thread */ char *stack; /* pointer to thread stack */ unsigned int stacksize; /* size of thread stack */ long *stackguard; /* stack overflow guard */ int stackloan; /* stack type */ void *(*start_func)(void *); /* start routine */ void *start_arg; /* start argument */ /* thread joining */ int joinable; /* whether thread is joinable */ void *join_arg; /* joining argument */ /* per-thread specific storage */ const void **data_value; /* thread specific values */ int data_count; /* number of stored values */ /* cancellation support */ int cancelreq; /* cancellation request is pending */ unsigned int cancelstate; /* cancellation state of thread */ pth_cleanup_t *cleanups; /* stack of thread cleanup handlers */ /* mutex ring */ pth_ring_t mutexring; /* ring of aquired mutex structures */ #ifdef PTH_EX /* per-thread exception handling */ ex_ctx_t ex_ctx; /* exception handling context */ #endif }; #endif /* cpp */ intern const char *pth_state_names[] = { "scheduler", "new", "ready", "running", "waiting", "dead" }; #if defined(MINSIGSTKSZ) && !defined(SIGSTKSZ) #define SIGSTKSZ MINSIGSTKSZ #endif #if !defined(SIGSTKSZ) #define SIGSTKSZ 8192 #endif /* allocate a thread control block */ intern pth_t pth_tcb_alloc(unsigned int stacksize, void *stackaddr) { pth_t t; if (stacksize > 0 && stacksize < SIGSTKSZ) stacksize = SIGSTKSZ; if ((t = (pth_t)malloc(sizeof(struct pth_st))) == NULL) return NULL; t->stacksize = stacksize; t->stack = NULL; t->stackguard = NULL; t->stackloan = (stackaddr != NULL ? TRUE : FALSE); if (stacksize > 0) { /* stacksize == 0 means "main" thread */ if (stackaddr != NULL) t->stack = (char *)(stackaddr); else { if ((t->stack = (char *)malloc(stacksize)) == NULL) { pth_shield { free(t); } return NULL; } } #if PTH_STACKGROWTH < 0 /* guard is at lowest address (alignment is guarrantied) */ t->stackguard = (long *)((long)t->stack); /* double cast to avoid alignment warning */ #else /* guard is at highest address (be careful with alignment) */ t->stackguard = (long *)(t->stack+(((stacksize/sizeof(long))-1)*sizeof(long))); #endif *t->stackguard = 0xDEAD; } return t; } /* free a thread control block */ intern void pth_tcb_free(pth_t t) { if (t == NULL) return; if (t->stack != NULL && !t->stackloan) free(t->stack); if (t->data_value != NULL) free(t->data_value); if (t->cleanups != NULL) pth_cleanup_popall(t, FALSE); free(t); return; } @ 1.44 log @Adjusted all copyright messages for new year 2006 @ text @d3 1 a3 1 ** Copyright (c) 1999-2006 Ralf S. Engelschall @ 1.43 log @Adjusted all copyright messages for new year 2005. @ text @d3 1 a3 1 ** Copyright (c) 1999-2005 Ralf S. Engelschall @ 1.42 log @Adjusted all copyright messages for new year 2004. @ text @d3 1 a3 1 ** Copyright (c) 1999-2004 Ralf S. Engelschall @ 1.41 log @Adjusted all copyright messages for new year 2003. @ text @d3 1 a3 1 ** Copyright (c) 1999-2003 Ralf S. Engelschall @ 1.40 log @Added thread attribute PTH_ATTR_DISPATCHES which (in bounded attribute objects) is incremented every time the context is switched to the associated thread. This can be used for statistical information. @ text @d3 1 a3 1 ** Copyright (c) 1999-2002 Ralf S. Engelschall @ 1.39 log @Internally switch from "errno_shield {...}" to "pth_shield {...}" and from "return_errno(..)" to "return pth_error(...)" in order to make the internal error handling a little bit more consistent. @ text @d43 1 @ 1.38 log @Add optional support for OSSP ex based exception handling. GNU Pth (still) does not throw exceptions by itself, but handles the per-thread exception context of OSSP ex to make exception handling local to a thread. @ text @d119 1 a119 1 errno_shield { free(t); } @ 1.37 log @bump copyright year @ text @d81 5 @ 1.36 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2001 Ralf S. Engelschall @ 1.35 log @*** empty log message *** @ text @d45 1 a45 1 /* timing */ @ 1.34 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2000 Ralf S. Engelschall @ 1.33 log @*** empty log message *** @ text @d85 1 a85 1 intern char *pth_state_names[] = { @ 1.32 log @*** empty log message *** @ text @d114 1 a114 1 free(t); @ 1.31 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999 Ralf S. Engelschall @ 1.30 log @*** empty log message *** @ text @d85 2 a86 2 intern char *pth_state_names[] = { "scheduler", "new", "ready", "running", "waiting", "dead" @ 1.29 log @*** empty log message *** @ text @d2 1 a2 2 ** pth_tcb.c -- Pth thread control block handling ** d22 2 @ 1.29.2.1 log @*** empty log message *** @ text @d2 2 a3 1 ** GNU Pth - The GNU Portable Threads a22 2 ** ** pth_tcb.c: Pth thread control block handling @ 1.29.2.2 log @*** empty log message *** @ text @d114 1 a114 1 errno_shield { free(t); } @ 1.28 log @*** empty log message *** @ text @d12 1 a12 1 ** version 2 of the License, or (at your option) any later version. @ 1.27 log @*** empty log message *** @ text @d10 1 a10 1 ** modify it under the terms of the GNU Library General Public d17 1 a17 1 ** Library General Public License for more details. d19 1 a19 1 ** You should have received a copy of the GNU Library General Public @ 1.26 log @*** empty log message *** @ text @d35 3 a37 3 pth_t q_next; /* next thread in pool */ pth_t q_prev; /* previous thread in pool */ int q_prio; /* (relative) priority of thread when queued */ d40 3 a42 3 int prio; /* base priority of thread */ char name[PTH_TCB_NAMELEN];/* name of thread (mainly for debugging) */ pth_state_t state; /* current state indicator for thread */ d44 2 a45 2 /* timing */ pth_time_t spawned; /* time point at which thread was spawned */ d47 1 a47 1 pth_time_t running; /* time range the thread was already running */ d50 1 a50 1 pth_event_t events; /* events the tread is waiting for */ d53 2 a54 2 sigset_t sigpending; /* set of pending signals */ int sigpendcnt; /* number of pending signals */ d57 7 a63 7 pth_mctx_t mctx; /* last saved machine state of thread */ char *stack; /* pointer to thread stack */ unsigned int stacksize; /* size of thread stack */ long *stackguard; /* stack overflow guard */ int stackloan; /* stack type */ void *(*start_func)(void *); /* start routine */ void *start_arg; /* start argument */ d66 2 a67 2 int joinable; /* whether thread is joinable */ void *join_arg; /* joining argument */ d70 2 a71 2 const void **data_value; /* thread specific values */ int data_count; /* number of stored values */ d74 3 a76 3 int cancelreq; /* cancellation request is pending */ unsigned int cancelstate; /* cancellation state of thread */ pth_cleanup_t *cleanups; /* stack of thread cleanup handlers */ d79 1 a79 1 pth_ring_t mutexring; /* ring of aquired mutex structures */ @ 1.25 log @*** empty log message *** @ text @d24 2 a25 1 @ 1.24 log @*** empty log message *** @ text @d99 1 a99 1 if (stacksize < SIGSTKSZ) d107 1 a107 1 if (stacksize > 0) { @ 1.23 log @*** empty log message *** @ text @d101 1 a101 1 if ((t = malloc(sizeof(struct pth_st))) == NULL) d111 1 a111 1 if ((t->stack = malloc(stacksize)) == NULL) { @ 1.22 log @*** empty log message *** @ text @d118 1 a118 1 t->stackguard = (long *)(t->stack); @ 1.21 log @*** empty log message *** @ text @d116 7 a122 6 if (PTH_STACKSGROWDOWN) /* guard is at lowest address (alignment is guarrantied) */ t->stackguard = (long *)(t->stack); else /* guard is at highest address (be careful with alignment) */ t->stackguard = (long *)(t->stack+(((stacksize/sizeof(long))-1)*sizeof(long))); @ 1.20 log @*** empty log message *** @ text @d60 1 d106 1 d132 1 a132 1 if (t->stack != NULL) @ 1.19 log @*** empty log message *** @ text @d2 1 a2 1 ** pth_tcb.c -- PTH thread control block handling @ 1.18 log @*** empty log message *** @ text @d6 2 a7 2 ** This file is part of PTH, a non-preemptive thread scheduling library ** which can be found at http://www.gnu.org/software/pth/. @ 1.17 log @*** empty log message *** @ text @d7 1 a7 1 ** which can be found at http://www.engelschall.com/sw/pth/. @ 1.16 log @*** empty log message *** @ text @d51 4 @ 1.15 log @*** empty log message *** @ text @a28 9 /* thread states */ typedef enum pth_state_en { pth_state_scheduler = 0, pth_state_new, pth_state_ready, pth_state_waiting, pth_state_dead } pth_state_t; a40 1 unsigned int flags; /* controlling flags */ @ 1.14 log @*** empty log message *** @ text @d106 1 a106 1 if ((t = (pth_t)malloc(sizeof(struct pth_st))) == NULL) d115 1 a115 1 if ((t->stack = (char *)malloc(stacksize)) == NULL) { @ 1.13 log @*** empty log message *** @ text @d81 3 @ 1.12 log @*** empty log message *** @ text @d77 4 a80 2 /* per-thread cleanup handlers */ pth_cleanup_t *cleanups; /* stack of cleanup handlers */ @ 1.11 log @*** empty log message *** @ text @d136 1 a136 1 pth_cleanup_popall(FALSE); @ 1.10 log @*** empty log message *** @ text @d43 3 a45 3 pth_t q_next; /* next thread in pool */ pth_t q_prev; /* previous thread in pool */ int q_prio; /* (relative) priority of thread when queued */ d48 4 a51 4 int prio; /* base priority of thread */ char name[PTH_TCB_NAMELEN];/* name of thread (mainly for debugging) */ unsigned int flags; /* controlling flags */ pth_state_t state; /* current state indicator for thread */ d54 3 a56 3 pth_time_t spawned; /* time point at which thread was spawned */ pth_time_t lastran; /* time point at which thread was last running */ pth_time_t running; /* time range the thread was already running */ d59 1 a59 1 pth_event_t events; /* events the tread is waiting for */ d62 6 a67 6 pth_mctx_t mctx; /* last saved machine state of thread */ char *stack; /* pointer to thread stack */ unsigned int stacksize; /* size of thread stack */ long *stackguard; /* stack overflow guard */ void *(*start_func)(void *); /* start routine */ void *start_arg; /* start argument */ d70 2 a71 2 int joinable; /* whether thread is joinable */ void *join_arg; /* joining argument */ d74 5 a78 2 const void **data_value; /* thread specific values */ int data_count; /* number of stored values */ d133 4 @ 1.9 log @*** empty log message *** @ text @d65 1 d100 3 a102 2 t->stacksize = stacksize; t->stack = NULL; d112 7 @ 1.8 log @*** empty log message *** @ text @d38 2 d49 1 a49 1 char *name; /* name of thread (debugging only) */ @ 1.7 log @*** empty log message *** @ text @d20 1 a20 1 ** License along with this library; if not, write to the Free @ 1.6 log @*** empty log message *** @ text @d89 1 a89 1 intern pth_t pth_tcb_alloc(unsigned int stacksize) d97 1 a98 1 t->stacksize = stacksize; d100 7 a106 3 if ((t->stack = (char *)malloc(stacksize)) == NULL) { free(t); return NULL; @ 1.5 log @*** empty log message *** @ text @d57 1 a57 2 pth_event_t *events_waiting; /* events the tread is still waiting for */ pth_event_t *events_occurred; /* events which already occurred */ @ 1.4 log @*** empty log message *** @ text @d27 52 a78 1 char *pth_state_names[] = { d90 1 a90 1 pth_t pth_tcb_alloc(unsigned int stacksize) d110 1 a110 1 void pth_tcb_free(pth_t t) @ 1.3 log @*** empty log message *** @ text @d50 1 a50 1 if ((t->stack = (void *)malloc(stacksize)) == NULL) { @ 1.2 log @*** empty log message *** @ text @d6 1 a6 1 ** This file is part of PTH, a non-preemtive thread scheduling library @ 1.1 log @Initial revision @ text @a0 40 /* ==================================================================== * Copyright (c) 1999 Ralf S. Engelschall. 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 acknowledgment: * "This product includes software developed by * Ralf S. Engelschall ." * * 4. Redistributions of any form whatsoever must retain the following * acknowledgment: * "This product includes software developed by * Ralf S. Engelschall ." * * THIS SOFTWARE IS PROVIDED BY RALF S. ENGELSCHALL ``AS IS'' AND ANY * EXPRESSED 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 RALF S. ENGELSCHALL OR * ITS 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. * ==================================================================== */ d2 21 a22 2 ** Non-Preemtive Scheduler Library (PTH) ** pth_tcb.c -- thread control block code @ 1.1.1.1 log @Import of PTH into CVS @ text @@