head 1.22; access; symbols PTH_2_0_7:1.21 PTH_2_0_6:1.20 PTH_2_0_5:1.20 PTH_2_0_4:1.20 PTH_2_0_3:1.19 PTH_2_0_2:1.19 PTH_2_0_1:1.19 PTH_2_0_0:1.18 PTH_2_0b2:1.17 PTH_2_0b1:1.17 PTH_2_0b0:1.17 PTH_1_4:1.16.0.2 PTH_1_4_1:1.16 PTH_1_4_0:1.15 PTH_1_3_7:1.14 PTH_1_4a3:1.14 PTH_1_3_6:1.14 PTH_1_4a2:1.14 PTH_1_3_5:1.14 PTH_1_4a1:1.14 PTH_1_3_4:1.14 PTH_1_3:1.14.0.2 PTH_1_3_3:1.14 PTH_1_3_2:1.14 PTH_1_3_1:1.14 PTH_1_3_0:1.14 PTH_1_3b3:1.14 PTH_1_2_3:1.11.2.1 PTH_1_3b2:1.14 PTH_1_3b1:1.14 PTH_1_3a5:1.14 PTH_1_3a4:1.14 PTH_1_3a3:1.14 PTH_1_2_2:1.11.2.1 PTH_1_3a2:1.14 PTH_1_2_1:1.11.2.1 PTH_1_3a1:1.12 PTH_1_2:1.11.0.2 PTH_1_2_0:1.11 PTH_1_2b8:1.10 PTH_1_2b7:1.10 PTH_1_1_6:1.9 PTH_1_2b6:1.10 PTH_1_2b5:1.10 PTH_1_2b4:1.10 PTH_1_2b3:1.10 PTH_1_2b2:1.9 PTH_1_2b1:1.9 PTH_1_1_5:1.9 PTH_1_0_6:1.7 PTH_1_0_5:1.7 PTH_1_0:1.7.0.2 PTH_1_1:1.9.0.2 PTH_1_1_4:1.9 PTH_1_1_3:1.9 PTH_1_1_2:1.9 PTH_1_1_1:1.9 PTH_1_1_0:1.9 PTH_1_1b7:1.8 PTH_1_1b6:1.8 PTH_1_1b5:1.8 PTH_1_1b4:1.7 PTH_1_1b3:1.7 PTH_1_1b2:1.7 PTH_1_1b1:1.7 PTH_1_0_4:1.7 PTH_1_0_3:1.7 PTH_1_0_2:1.7 PTH_1_0_1:1.7 PTH_1_0_0:1.7 PTH_1_0b8:1.7 PTH_1_0b7:1.7 PTH_1_0b6:1.7 PTH_1_0b5:1.7 PTH_1_0b4:1.7 PTH_1_0b3:1.5 PTH_1_0b2:1.5 PTH_1_0b1:1.4 PTH_0_9_21:1.4 PTH_0_9_20:1.3 PTH_0_9_19:1.2 PTH_0_9_18:1.2; locks; strict; comment @ * @; 1.22 date 2007.01.01.18.23.52; author rse; state Exp; branches; next 1.21; commitid 9DhdiirNzQPBIP0s; 1.21 date 2006.06.08.17.54.52; author rse; state Exp; branches; next 1.20; commitid x8N3mLVdQgkbdeAr; 1.20 date 2004.12.31.19.34.45; author rse; state Exp; branches; next 1.19; 1.19 date 2004.07.13.10.50.49; author rse; state Exp; branches; next 1.18; 1.18 date 2003.01.01.15.49.11; author rse; state Exp; branches; next 1.17; 1.17 date 2002.10.24.15.21.13; author rse; state Exp; branches; next 1.16; 1.16 date 2002.01.27.11.03.40; author rse; state Exp; branches; next 1.15; 1.15 date 2001.03.24.14.51.04; author rse; state Exp; branches; next 1.14; 1.14 date 99.12.30.21.59.00; author rse; state Exp; branches; next 1.13; 1.13 date 99.11.09.08.11.31; author rse; state Exp; branches; next 1.12; 1.12 date 99.11.01.10.27.19; author rse; state Exp; branches; next 1.11; 1.11 date 99.10.31.11.46.12; author rse; state Exp; branches 1.11.2.1; next 1.10; 1.10 date 99.09.17.08.01.54; author rse; state Exp; branches; next 1.9; 1.9 date 99.08.19.15.08.52; author rse; state Exp; branches; next 1.8; 1.8 date 99.08.17.08.08.35; author rse; state Exp; branches; next 1.7; 1.7 date 99.07.08.10.34.01; author rse; state Exp; branches; next 1.6; 1.6 date 99.07.08.10.19.10; author rse; state Exp; branches; next 1.5; 1.5 date 99.07.04.12.05.35; author rse; state Exp; branches; next 1.4; 1.4 date 99.06.26.12.30.55; author rse; state Exp; branches; next 1.3; 1.3 date 99.06.24.12.07.32; author rse; state Exp; branches; next 1.2; 1.2 date 99.06.19.15.11.35; author rse; state Exp; branches; next 1.1; 1.1 date 99.06.19.13.00.13; author rse; state Exp; branches; next ; 1.11.2.1 date 99.11.01.10.24.59; author rse; state Exp; branches; next ; desc @@ 1.22 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_clean.c: Pth per-thread cleanup handler */ /* ``The concept seems to be clear by now. It has been defined several times by example of what it is not.'' -- Unknown */ #include "pth_p.h" #if cpp typedef struct pth_cleanup_st pth_cleanup_t; struct pth_cleanup_st { pth_cleanup_t *next; void (*func)(void *); void *arg; }; #endif /* cpp */ int pth_cleanup_push(void (*func)(void *), void *arg) { pth_cleanup_t *cleanup; if (func == NULL) return pth_error(FALSE, EINVAL); if ((cleanup = (pth_cleanup_t *)malloc(sizeof(pth_cleanup_t))) == NULL) return pth_error(FALSE, ENOMEM); cleanup->func = func; cleanup->arg = arg; cleanup->next = pth_current->cleanups; pth_current->cleanups = cleanup; return TRUE; } int pth_cleanup_pop(int execute) { pth_cleanup_t *cleanup; int rc; rc = FALSE; if ((cleanup = pth_current->cleanups) != NULL) { pth_current->cleanups = cleanup->next; if (execute) cleanup->func(cleanup->arg); free(cleanup); rc = TRUE; } return rc; } intern void pth_cleanup_popall(pth_t t, int execute) { pth_cleanup_t *cleanup; while ((cleanup = t->cleanups) != NULL) { t->cleanups = cleanup->next; if (execute) cleanup->func(cleanup->arg); free(cleanup); } return; } @ 1.21 log @Adjusted all copyright messages for new year 2006 @ text @d3 1 a3 1 ** Copyright (c) 1999-2006 Ralf S. Engelschall @ 1.20 log @Adjusted all copyright messages for new year 2005. @ text @d3 1 a3 1 ** Copyright (c) 1999-2005 Ralf S. Engelschall @ 1.19 log @Adjusted all copyright messages for new year 2004. @ text @d3 1 a3 1 ** Copyright (c) 1999-2004 Ralf S. Engelschall @ 1.18 log @Adjusted all copyright messages for new year 2003. @ text @d3 1 a3 1 ** Copyright (c) 1999-2003 Ralf S. Engelschall @ 1.17 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 @d3 1 a3 1 ** Copyright (c) 1999-2002 Ralf S. Engelschall @ 1.16 log @bump copyright year @ text @d47 1 a47 1 return_errno(FALSE, EINVAL); d49 1 a49 1 return_errno(FALSE, ENOMEM); @ 1.15 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2001 Ralf S. Engelschall @ 1.14 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2000 Ralf S. Engelschall @ 1.13 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999 Ralf S. Engelschall @ 1.12 log @*** empty log message *** @ text @d25 2 a26 2 /* ``The concept seems to be clear by now. It has been defined several times d45 1 a45 1 d61 1 a61 1 @ 1.11 log @*** empty log message *** @ text @d2 1 a2 2 ** pth_clean.c -- Pth per-thread cleanup handler ** d22 2 @ 1.11.2.1 log @*** empty log message *** @ text @d2 2 a3 1 ** GNU Pth - The GNU Portable Threads a22 2 ** ** pth_clean.c: Pth per-thread cleanup handler @ 1.10 log @*** empty log message *** @ text @d12 1 a12 1 ** version 2 of the License, or (at your option) any later version. @ 1.9 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.8 log @*** empty log message *** @ text @d24 4 a27 1 @ 1.7 log @*** empty log message *** @ text @d44 1 a44 1 if ((cleanup = malloc(sizeof(pth_cleanup_t))) == NULL) @ 1.6 log @*** empty log message *** @ text @d2 1 a2 1 ** pth_clean.c -- PTH per-thread cleanup handler @ 1.5 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.4 log @*** empty log message *** @ text @d7 1 a7 1 ** which can be found at http://www.engelschall.com/sw/pth/. @ 1.3 log @*** empty log message *** @ text @d44 1 a44 1 if ((cleanup = (pth_cleanup_t *)malloc(sizeof(pth_cleanup_t))) == NULL) @ 1.2 log @*** empty log message *** @ text @d38 1 a38 1 void pth_cleanup_push(void (*func)(void *), void *arg) d42 2 d45 1 a45 1 return; d50 1 a50 1 return; d53 1 a53 1 void pth_cleanup_pop(int execute) d56 1 d58 1 d64 1 d66 1 a66 1 return; @ 1.1 log @*** empty log message *** @ text @d64 1 a64 1 intern void pth_cleanup_popall(int execute) d66 8 a73 2 while (pth_current->cleanups != NULL) pth_cleanup_pop(execute); @