2 * Copyright (c) 1995 John Birrell <jb@cimlogic.com.au>.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by John Birrell.
16 * 4. Neither the name of the author nor the names of any co-contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 #include "pthread_private.h"
42 /* Static variables: */
43 static struct pthread_key key_table[PTHREAD_KEYS_MAX];
46 pthread_key_create(pthread_key_t * key, void (*destructor) (void *))
48 for ((*key) = 0; (*key) < PTHREAD_KEYS_MAX; (*key)++) {
49 /* Lock the key table entry: */
50 _SPINLOCK(&key_table[*key].lock);
52 if (key_table[(*key)].allocated == 0) {
53 key_table[(*key)].allocated = 1;
54 key_table[(*key)].destructor = destructor;
56 /* Unlock the key table entry: */
57 _SPINUNLOCK(&key_table[*key].lock);
61 /* Unlock the key table entry: */
62 _SPINUNLOCK(&key_table[*key].lock);
68 pthread_key_delete(pthread_key_t key)
72 if (key < PTHREAD_KEYS_MAX) {
73 /* Lock the key table entry: */
74 _SPINLOCK(&key_table[key].lock);
76 if (key_table[key].allocated)
77 key_table[key].allocated = 0;
81 /* Unlock the key table entry: */
82 _SPINUNLOCK(&key_table[key].lock);
89 _thread_cleanupspecific(void)
94 void (*destructor)( void *);
96 for (itr = 0; itr < PTHREAD_DESTRUCTOR_ITERATIONS; itr++) {
97 for (key = 0; key < PTHREAD_KEYS_MAX; key++) {
98 if (_thread_run->specific_data_count) {
99 /* Lock the key table entry: */
100 _SPINLOCK(&key_table[key].lock);
103 if (key_table[key].allocated) {
104 if (_thread_run->specific_data[key]) {
105 data = (void *) _thread_run->specific_data[key];
106 _thread_run->specific_data[key] = NULL;
107 _thread_run->specific_data_count--;
108 destructor = key_table[key].destructor;
112 /* Unlock the key table entry: */
113 _SPINUNLOCK(&key_table[key].lock);
116 * If there is a destructore, call it
117 * with the key table entry unlocked:
122 free(_thread_run->specific_data);
123 _thread_run->specific_data = NULL;
128 free(_thread_run->specific_data);
129 _thread_run->specific_data = NULL;
132 static inline const void **
133 pthread_key_allocate_data(void)
135 const void **new_data;
136 if ((new_data = (const void **) malloc(sizeof(void *) * PTHREAD_KEYS_MAX)) != NULL) {
137 memset((void *) new_data, 0, sizeof(void *) * PTHREAD_KEYS_MAX);
143 pthread_setspecific(pthread_key_t key, const void *value)
148 /* Point to the running thread: */
149 pthread = _thread_run;
151 if ((pthread->specific_data) ||
152 (pthread->specific_data = pthread_key_allocate_data())) {
153 if (key < PTHREAD_KEYS_MAX) {
154 if (key_table[key].allocated) {
155 if (pthread->specific_data[key] == NULL) {
157 pthread->specific_data_count++;
160 pthread->specific_data_count--;
162 pthread->specific_data[key] = value;
174 pthread_getspecific(pthread_key_t key)
179 /* Point to the running thread: */
180 pthread = _thread_run;
182 /* Check if there is specific data: */
183 if (pthread->specific_data != NULL && key < PTHREAD_KEYS_MAX) {
184 /* Check if this key has been used before: */
185 if (key_table[key].allocated) {
186 /* Return the value: */
187 data = (void *) pthread->specific_data[key];
190 * This key has not been used before, so return NULL
196 /* No specific data has been created, so just return NULL: */