head 1.19; access; symbols PTH_2_0_7:1.18 PTH_2_0_6:1.17 PTH_2_0_5:1.17 PTH_2_0_4:1.17 PTH_2_0_3:1.16 PTH_2_0_2:1.16 PTH_2_0_1:1.16 PTH_2_0_0:1.15 PTH_2_0b2:1.14 PTH_2_0b1:1.14 PTH_2_0b0:1.14 PTH_1_4:1.13.0.2 PTH_1_4_1:1.13 PTH_1_4_0:1.12 PTH_1_3_7:1.10 PTH_1_4a3:1.10 PTH_1_3_6:1.10 PTH_1_4a2:1.10 PTH_1_3_5:1.10 PTH_1_4a1:1.10 PTH_1_3_4:1.10 PTH_1_3:1.10.0.2 PTH_1_3_3:1.10 PTH_1_3_2:1.10 PTH_1_3_1:1.10 PTH_1_3_0:1.10 PTH_1_3b3:1.10 PTH_1_2_3:1.7.2.1 PTH_1_3b2:1.10 PTH_1_3b1:1.10 PTH_1_3a5:1.10 PTH_1_3a4:1.10 PTH_1_3a3:1.10 PTH_1_2_2:1.7.2.1 PTH_1_3a2:1.10 PTH_1_2_1:1.7.2.1 PTH_1_3a1:1.8 PTH_1_2:1.7.0.2 PTH_1_2_0:1.7 PTH_1_2b8:1.6 PTH_1_2b7:1.6 PTH_1_1_6:1.5 PTH_1_2b6:1.6 PTH_1_2b5:1.6 PTH_1_2b4:1.6 PTH_1_2b3:1.6 PTH_1_2b2:1.5 PTH_1_2b1:1.5 PTH_1_1_5:1.5 PTH_1_0_6:1.4 PTH_1_0_5:1.4 PTH_1_0:1.4.0.2 PTH_1_1:1.5.0.2 PTH_1_1_4:1.5 PTH_1_1_3:1.5 PTH_1_1_2:1.5 PTH_1_1_1:1.5 PTH_1_1_0:1.5 PTH_1_1b7:1.4 PTH_1_1b6:1.4 PTH_1_1b5:1.4 PTH_1_1b4:1.4 PTH_1_1b3:1.4 PTH_1_1b2:1.4 PTH_1_1b1:1.4 PTH_1_0_4:1.4 PTH_1_0_3:1.4 PTH_1_0_2:1.4 PTH_1_0_1:1.4 PTH_1_0_0:1.4 PTH_1_0b8:1.4 PTH_1_0b7:1.4 PTH_1_0b6:1.4 PTH_1_0b5:1.4 PTH_1_0b4:1.3; locks; strict; comment @ * @; 1.19 date 2007.01.01.18.23.53; author rse; state Exp; branches; next 1.18; commitid 9DhdiirNzQPBIP0s; 1.18 date 2006.06.08.17.54.52; author rse; state Exp; branches; next 1.17; commitid x8N3mLVdQgkbdeAr; 1.17 date 2004.12.31.19.34.45; author rse; state Exp; branches; next 1.16; 1.16 date 2004.07.13.10.50.49; author rse; state Exp; branches; next 1.15; 1.15 date 2003.01.01.15.49.11; author rse; state Exp; branches; next 1.14; 1.14 date 2002.10.24.15.21.13; author rse; state Exp; branches; next 1.13; 1.13 date 2002.01.27.11.03.40; author rse; state Exp; branches; next 1.12; 1.12 date 2001.03.24.14.51.04; author rse; state Exp; branches; next 1.11; 1.11 date 2000.10.03.09.26.47; author rse; state Exp; branches; next 1.10; 1.10 date 99.12.30.21.59.00; author rse; state Exp; branches; next 1.9; 1.9 date 99.11.09.08.11.31; author rse; state Exp; branches; next 1.8; 1.8 date 99.11.01.10.27.19; author rse; state Exp; branches; next 1.7; 1.7 date 99.10.31.11.46.12; author rse; state Exp; branches 1.7.2.1; next 1.6; 1.6 date 99.09.17.08.01.55; author rse; state Exp; branches; next 1.5; 1.5 date 99.08.19.15.08.52; author rse; state Exp; branches; next 1.4; 1.4 date 99.07.10.14.21.17; author rse; state Exp; branches; next 1.3; 1.3 date 99.07.08.10.34.01; author rse; state Exp; branches; next 1.2; 1.2 date 99.07.08.10.19.11; author rse; state Exp; branches; next 1.1; 1.1 date 99.07.08.09.41.00; author rse; state Exp; branches; next ; 1.7.2.1 date 99.11.01.10.25.00; author rse; state Exp; branches; next ; desc @@ 1.19 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_fork.c: Pth process forking support */ /* ``Every day of my life I am forced to add another name to the list of people who piss me off!'' -- Calvin */ #include "pth_p.h" struct pth_atfork_st { void (*prepare)(void *); void (*parent)(void *); void (*child)(void *); void *arg; }; static struct pth_atfork_st pth_atfork_list[PTH_ATFORK_MAX]; static int pth_atfork_idx = 0; int pth_atfork_push(void (*prepare)(void *), void (*parent)(void *), void (*child)(void *), void *arg) { if (pth_atfork_idx > PTH_ATFORK_MAX-1) return pth_error(FALSE, ENOMEM); pth_atfork_list[pth_atfork_idx].prepare = prepare; pth_atfork_list[pth_atfork_idx].parent = parent; pth_atfork_list[pth_atfork_idx].child = child; pth_atfork_list[pth_atfork_idx].arg = arg; pth_atfork_idx++; return TRUE; } int pth_atfork_pop(void) { if (pth_atfork_idx <= 0) return FALSE; pth_atfork_idx--; return TRUE; } pid_t pth_fork(void) { pid_t pid; int i; /* run preparation handlers in LIFO order */ for (i = pth_atfork_idx-1; i >= 0; i--) if (pth_atfork_list[i].prepare != NULL) pth_atfork_list[i].prepare(pth_atfork_list[i].arg); /* fork the process */ if ((pid = pth_sc(fork)()) == -1) return FALSE; /* handle parent and child contexts */ if (pid != 0) { /* Parent: */ /* run parent handlers in FIFO order */ for (i = 0; i <= pth_atfork_idx-1; i++) if (pth_atfork_list[i].parent != NULL) pth_atfork_list[i].parent(pth_atfork_list[i].arg); } else { /* Child: */ /* kick out all threads except for the current one and the scheduler */ pth_scheduler_drop(); /* run child handlers in FIFO order */ for (i = 0; i <= pth_atfork_idx-1; i++) if (pth_atfork_list[i].child != NULL) pth_atfork_list[i].child(pth_atfork_list[i].arg); } return pid; } @ 1.18 log @Adjusted all copyright messages for new year 2006 @ text @d3 1 a3 1 ** Copyright (c) 1999-2006 Ralf S. Engelschall @ 1.17 log @Adjusted all copyright messages for new year 2005. @ text @d3 1 a3 1 ** Copyright (c) 1999-2005 Ralf S. Engelschall @ 1.16 log @Adjusted all copyright messages for new year 2004. @ text @d3 1 a3 1 ** Copyright (c) 1999-2004 Ralf S. Engelschall @ 1.15 log @Adjusted all copyright messages for new year 2003. @ text @d3 1 a3 1 ** Copyright (c) 1999-2003 Ralf S. Engelschall @ 1.14 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.13 log @bump copyright year @ text @d46 1 a46 1 return_errno(FALSE, ENOMEM); @ 1.12 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2001 Ralf S. Engelschall @ 1.11 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2000 Ralf S. Engelschall @ 1.10 log @*** empty log message *** @ text @d23 1 a23 1 ** pth_fork.c: Pth forking support @ 1.9 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999 Ralf S. Engelschall @ 1.8 log @*** empty log message *** @ text @d42 1 a42 1 int pth_atfork_push(void (*prepare)(void *), void (*parent)(void *), d61 1 a61 1 } d69 1 a69 1 for (i = pth_atfork_idx-1; i >= 0; i--) d82 1 a82 1 for (i = 0; i <= pth_atfork_idx-1; i++) d93 1 a93 1 for (i = 0; i <= pth_atfork_idx-1; i++) @ 1.7 log @*** empty log message *** @ text @d2 1 a2 2 ** pth_fork.c -- Pth forking support ** d22 2 @ 1.7.2.1 log @*** empty log message *** @ text @d2 2 a3 1 ** GNU Pth - The GNU Portable Threads a22 2 ** ** pth_fork.c: Pth forking support @ 1.6 log @*** empty log message *** @ text @d12 1 a12 1 ** version 2 of the License, or (at your option) any later version. @ 1.5 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.4 log @*** empty log message *** @ text @d24 5 a28 1 @ 1.3 log @*** empty log message *** @ text @d69 1 a69 1 if ((pid = fork()) == -1) @ 1.2 log @*** empty log message *** @ text @d2 1 a2 1 ** pth_fork.c -- PTH forking support @ 1.1 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/. @