head 1.35; access; symbols PTH_2_0_7:1.34 PTH_2_0_6:1.33 PTH_2_0_5:1.33 PTH_2_0_4:1.33 PTH_2_0_3:1.32 PTH_2_0_2:1.31 PTH_2_0_1:1.31 PTH_2_0_0:1.30 PTH_2_0b2:1.29 PTH_2_0b1:1.29 PTH_2_0b0:1.29 PTH_1_4:1.28.0.2 PTH_1_4_1:1.28 PTH_1_4_0:1.27 PTH_1_3_7:1.26 PTH_1_4a3:1.26 PTH_1_3_6:1.26 PTH_1_4a2:1.26 PTH_1_3_5:1.26 PTH_1_4a1:1.26 PTH_1_3_4:1.26 PTH_1_3:1.26.0.2 PTH_1_3_3:1.26 PTH_1_3_2:1.26 PTH_1_3_1:1.26 PTH_1_3_0:1.26 PTH_1_3b3:1.26 PTH_1_2_3:1.22.2.2 PTH_1_3b2:1.26 PTH_1_3b1:1.26 PTH_1_3a5:1.26 PTH_1_3a4:1.26 PTH_1_3a3:1.26 PTH_1_2_2:1.22.2.2 PTH_1_3a2:1.25 PTH_1_2_1:1.22.2.1 PTH_1_3a1:1.23 PTH_1_2:1.22.0.2 PTH_1_2_0:1.22 PTH_1_2b8:1.21 PTH_1_2b7:1.21 PTH_1_1_6:1.20 PTH_1_2b6:1.21 PTH_1_2b5:1.21 PTH_1_2b4:1.21 PTH_1_2b3:1.21 PTH_1_2b2:1.20 PTH_1_2b1:1.20 PTH_1_1_5:1.20 PTH_1_0_6:1.17 PTH_1_0_5:1.17 PTH_1_0:1.17.0.2 PTH_1_1:1.20.0.2 PTH_1_1_4:1.20 PTH_1_1_3:1.19 PTH_1_1_2:1.19 PTH_1_1_1:1.19 PTH_1_1_0:1.19 PTH_1_1b7:1.18 PTH_1_1b6:1.18 PTH_1_1b5:1.18 PTH_1_1b4:1.17 PTH_1_1b3:1.17 PTH_1_1b2:1.17 PTH_1_1b1:1.17 PTH_1_0_4:1.17 PTH_1_0_3:1.17 PTH_1_0_2:1.17 PTH_1_0_1:1.17 PTH_1_0_0:1.17 PTH_1_0b8:1.17 PTH_1_0b7:1.17 PTH_1_0b6:1.17 PTH_1_0b5:1.17 PTH_1_0b4:1.17 PTH_1_0b3:1.14 PTH_1_0b2:1.14 PTH_1_0b1:1.13 PTH_0_9_21:1.12 PTH_0_9_20:1.10 PTH_0_9_19:1.8 PTH_0_9_18:1.8 PTH_0_9_17:1.7 PTH_0_9_16:1.7 PTH_0_9_15:1.7 PTH_0_9_14:1.7 PTH_0_9_13:1.6 PTH_0_9_12:1.5 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.3 PTH_0_9_6:1.3 PTH_0_9_5:1.2 PTH_0_9_4:1.1 PTH_0_9_3:1.1; locks; strict; comment @ * @; 1.35 date 2007.01.01.18.23.52; author rse; state Exp; branches; next 1.34; commitid 9DhdiirNzQPBIP0s; 1.34 date 2006.06.08.17.54.52; author rse; state Exp; branches; next 1.33; commitid x8N3mLVdQgkbdeAr; 1.33 date 2004.12.31.19.34.45; author rse; state Exp; branches; next 1.32; 1.32 date 2004.10.14.14.42.34; author rse; state Exp; branches; next 1.31; 1.31 date 2004.07.13.10.50.49; author rse; state Exp; branches; next 1.30; 1.30 date 2003.01.01.15.49.11; author rse; state Exp; branches; next 1.29; 1.29 date 2002.10.24.15.21.13; author rse; state Exp; branches; next 1.28; 1.28 date 2002.01.27.11.03.40; author rse; state Exp; branches; next 1.27; 1.27 date 2001.03.24.14.51.04; author rse; state Exp; branches; next 1.26; 1.26 date 2000.01.07.22.08.05; author rse; state Exp; branches; next 1.25; 1.25 date 99.12.30.21.59.00; author rse; state Exp; branches; next 1.24; 1.24 date 99.11.09.08.11.31; author rse; state Exp; branches; next 1.23; 1.23 date 99.11.01.10.27.19; author rse; state Exp; branches; next 1.22; 1.22 date 99.10.31.11.46.12; author rse; state Exp; branches 1.22.2.1; next 1.21; 1.21 date 99.09.17.08.01.55; author rse; state Exp; branches; next 1.20; 1.20 date 99.08.28.14.08.06; author rse; state Exp; branches; next 1.19; 1.19 date 99.08.19.15.08.52; author rse; state Exp; branches; next 1.18; 1.18 date 99.08.17.08.08.35; author rse; state Exp; branches; next 1.17; 1.17 date 99.07.08.10.34.01; author rse; state Exp; branches; next 1.16; 1.16 date 99.07.08.10.19.11; author rse; state Exp; branches; next 1.15; 1.15 date 99.07.08.09.41.00; author rse; state Exp; branches; next 1.14; 1.14 date 99.07.04.12.05.35; author rse; state Exp; branches; next 1.13; 1.13 date 99.06.27.15.38.04; author rse; state Exp; branches; next 1.12; 1.12 date 99.06.26.12.51.27; author rse; state Exp; branches; next 1.11; 1.11 date 99.06.26.12.30.55; author rse; state Exp; branches; next 1.10; 1.10 date 99.06.25.15.14.35; author rse; state Exp; branches; next 1.9; 1.9 date 99.06.24.12.07.32; author rse; state Exp; branches; next 1.8; 1.8 date 99.06.19.15.11.35; author rse; state Exp; branches; next 1.7; 1.7 date 99.06.01.15.43.32; author rse; state Exp; branches; next 1.6; 1.6 date 99.06.01.09.55.26; author rse; state Exp; branches; next 1.5; 1.5 date 99.05.28.09.05.11; author rse; state Exp; branches; next 1.4; 1.4 date 99.05.24.07.58.13; author rse; state Exp; branches; next 1.3; 1.3 date 99.05.22.14.37.52; author rse; state Exp; branches; next 1.2; 1.2 date 99.05.21.15.22.32; author rse; state Exp; branches; next 1.1; 1.1 date 99.05.14.19.33.37; author rse; state Exp; branches; next ; 1.22.2.1 date 99.11.01.10.24.59; author rse; state Exp; branches; next 1.22.2.2; 1.22.2.2 date 2000.01.07.23.16.17; author rse; state Exp; branches; next ; desc @@ 1.35 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_data.c: Pth per-thread specific data */ /* ``Breakthrough ideas are not from teams.'' --- Hans von Ohain */ #include "pth_p.h" struct pth_keytab_st { int used; void (*destructor)(void *); }; static struct pth_keytab_st pth_keytab[PTH_KEY_MAX]; int pth_key_create(pth_key_t *key, void (*func)(void *)) { if (key == NULL) return pth_error(FALSE, EINVAL); for ((*key) = 0; (*key) < PTH_KEY_MAX; (*key)++) { if (pth_keytab[(*key)].used == FALSE) { pth_keytab[(*key)].used = TRUE; pth_keytab[(*key)].destructor = func; return TRUE; } } return pth_error(FALSE, EAGAIN); } int pth_key_delete(pth_key_t key) { if (key < 0 || key >= PTH_KEY_MAX) return pth_error(FALSE, EINVAL); if (!pth_keytab[key].used) return pth_error(FALSE, ENOENT); pth_keytab[key].used = FALSE; return TRUE; } int pth_key_setdata(pth_key_t key, const void *value) { if (key < 0 || key >= PTH_KEY_MAX) return pth_error(FALSE, EINVAL); if (!pth_keytab[key].used) return pth_error(FALSE, ENOENT); if (pth_current->data_value == NULL) { pth_current->data_value = (const void **)calloc(1, sizeof(void *)*PTH_KEY_MAX); if (pth_current->data_value == NULL) return pth_error(FALSE, ENOMEM); } if (pth_current->data_value[key] == NULL) { if (value != NULL) pth_current->data_count++; } else { if (value == NULL) pth_current->data_count--; } pth_current->data_value[key] = value; return TRUE; } void *pth_key_getdata(pth_key_t key) { if (key < 0 || key >= PTH_KEY_MAX) return pth_error((void *)NULL, EINVAL); if (!pth_keytab[key].used) return pth_error((void *)NULL, ENOENT); if (pth_current->data_value == NULL) return (void *)NULL; return (void *)pth_current->data_value[key]; } intern void pth_key_destroydata(pth_t t) { void *data; int key; int itr; void (*destructor)(void *); if (t == NULL) return; if (t->data_value == NULL) return; /* POSIX thread iteration scheme */ for (itr = 0; itr < PTH_DESTRUCTOR_ITERATIONS; itr++) { for (key = 0; key < PTH_KEY_MAX; key++) { if (t->data_count > 0) { destructor = NULL; data = NULL; if (pth_keytab[key].used) { if (t->data_value[key] != NULL) { data = (void *)t->data_value[key]; t->data_value[key] = NULL; t->data_count--; destructor = pth_keytab[key].destructor; } } if (destructor != NULL) destructor(data); } if (t->data_count == 0) break; } if (t->data_count == 0) break; } free(t->data_value); t->data_value = NULL; return; } @ 1.34 log @Adjusted all copyright messages for new year 2006 @ text @d3 1 a3 1 ** Copyright (c) 1999-2006 Ralf S. Engelschall @ 1.33 log @Adjusted all copyright messages for new year 2005. @ text @d3 1 a3 1 ** Copyright (c) 1999-2005 Ralf S. Engelschall @ 1.32 log @Better error checking in pth_key_xxx() functions. @ text @d3 1 a3 1 ** Copyright (c) 1999-2004 Ralf S. Engelschall @ 1.31 log @Adjusted all copyright messages for new year 2004. @ text @d39 2 d53 1 a53 1 if (key >= PTH_KEY_MAX) d56 1 a56 1 return pth_error(FALSE, EINVAL); d63 1 a63 1 if (key >= PTH_KEY_MAX) d66 1 a66 1 return pth_error(FALSE, EINVAL); d86 1 a86 1 if (key >= PTH_KEY_MAX) d89 1 a89 1 return pth_error((void *)NULL, EINVAL); @ 1.30 log @Adjusted all copyright messages for new year 2003. @ text @d3 1 a3 1 ** Copyright (c) 1999-2003 Ralf S. Engelschall @ 1.29 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.28 log @bump copyright year @ text @d46 1 a46 1 return_errno(FALSE, EAGAIN); d52 1 a52 1 return_errno(FALSE, EINVAL); d54 1 a54 1 return_errno(FALSE, EINVAL); d62 1 a62 1 return_errno(FALSE, EINVAL); d64 1 a64 1 return_errno(FALSE, EINVAL); d68 1 a68 1 return_errno(FALSE, ENOMEM); d85 1 a85 1 return_errno(NULL, EINVAL); d87 1 a87 1 return_errno(NULL, EINVAL); d89 1 a89 1 return NULL; @ 1.27 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2001 Ralf S. Engelschall @ 1.26 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999-2000 Ralf S. Engelschall @ 1.25 log @*** empty log message *** @ text @d111 1 a111 1 if (t->data_value[key]) { d116 1 a116 1 } @ 1.24 log @*** empty log message *** @ text @d3 1 a3 1 ** Copyright (c) 1999 Ralf S. Engelschall @ 1.23 log @*** empty log message *** @ text @d25 1 a25 1 /* ``Breakthrough ideas d73 1 a73 1 } @ 1.22 log @*** empty log message *** @ text @d2 1 a2 2 ** pth_data.c -- Pth per-thread specific data ** d22 2 @ 1.22.2.1 log @*** empty log message *** @ text @d2 2 a3 1 ** GNU Pth - The GNU Portable Threads a22 2 ** ** pth_data.c: Pth per-thread specific data @ 1.22.2.2 log @*** empty log message *** @ text @d111 1 a111 1 if (t->data_value[key] != NULL) { d116 1 a116 1 } @ 1.21 log @*** empty log message *** @ text @d12 1 a12 1 ** version 2 of the License, or (at your option) any later version. @ 1.20 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.19 log @*** empty log message *** @ text @d65 1 a65 1 pth_current->data_value = (const void **)malloc(sizeof(void *)*PTH_KEY_MAX); a67 1 memset((void *)pth_current->data_value, 0, sizeof(void *)*PTH_KEY_MAX); @ 1.18 log @*** empty log message *** @ text @d24 3 a26 1 @ 1.17 log @*** empty log message *** @ text @d63 1 a63 1 pth_current->data_value = malloc(sizeof(void *)*PTH_KEY_MAX); @ 1.16 log @*** empty log message *** @ text @d2 1 a2 1 ** pth_data.c -- PTH per-thread specific data @ 1.15 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.14 log @*** empty log message *** @ text @a26 3 #if cpp /* key structure */ a30 2 #endif /* cpp */ @ 1.13 log @*** empty log message *** @ text @d7 1 a7 1 ** which can be found at http://www.engelschall.com/sw/pth/. @ 1.12 log @*** empty log message *** @ text @d124 2 d127 2 @ 1.11 log @*** empty log message *** @ text @d37 1 a37 1 static struct pth_keytab_st pth_keytab[PTH_KEYS_MAX]; d41 1 a41 1 for ((*key) = 0; (*key) < PTH_KEYS_MAX; (*key)++) { d53 1 a53 1 if (key >= PTH_KEYS_MAX) d63 1 a63 1 if (key >= PTH_KEYS_MAX) d68 1 a68 1 pth_current->data_value = malloc(sizeof(void *)*PTH_KEYS_MAX); d71 1 a71 1 memset((void *)pth_current->data_value, 0, sizeof(void *)*PTH_KEYS_MAX); d87 1 a87 1 if (key >= PTH_KEYS_MAX) d109 1 a109 1 for (key = 0; key < PTH_KEYS_MAX; key++) { @ 1.10 log @*** empty log message *** @ text @d68 1 a68 1 pth_current->data_value = (const void **)malloc(sizeof(void *)*PTH_KEYS_MAX); @ 1.9 log @*** empty log message *** @ text @d92 1 a92 1 return_errno(NULL, 0); @ 1.8 log @*** empty log message *** @ text @d45 1 a45 1 return 0; d48 1 a48 1 return EAGAIN; d54 1 a54 1 return EINVAL; d56 1 a56 1 return EINVAL; d58 1 a58 1 return 0; d64 1 a64 1 return EINVAL; d66 1 a66 1 return EINVAL; d70 1 a70 1 return ENOMEM; d82 1 a82 1 return 0; d88 1 a88 1 return NULL; d90 1 a90 1 return NULL; d92 1 a92 1 return NULL; d103 2 @ 1.7 log @*** empty log message *** @ text @d96 1 a96 1 intern void pth_key_destroydata(void) d103 1 a103 1 if (pth_current->data_value == NULL) d108 1 a108 1 if (pth_current->data_count > 0) { d112 4 a115 4 if (pth_current->data_value[key]) { data = (void *)pth_current->data_value[key]; pth_current->data_value[key] = NULL; pth_current->data_count--; d124 2 a125 2 free(pth_current->data_value); pth_current->data_value = NULL; @ 1.6 log @*** empty log message *** @ text @d29 1 a29 1 /* event structure */ @ 1.5 log @*** empty log message *** @ text @d20 1 a20 1 ** License along with this library; if not, write to the Free @ 1.4 log @*** empty log message *** @ text @d27 10 d96 1 a96 1 void pth_key_destroydata(void) @ 1.3 log @*** empty log message *** @ text @d6 1 a6 1 ** This file is part of PTH, a non-preemtive thread scheduling library @ 1.2 log @*** empty log message *** @ 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_data.c -- per-thread specific data code @ 1.1 log @*** empty log message *** @ text @d72 1 a72 1 int pth_setspecific(pth_key_t key, const void *value) d96 1 a96 1 void *pth_getspecific(pth_key_t key) d107 1 a107 1 void pth_destroyspecific(void) @