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
39 #include "pthread_private.h"
43 volatile int allocated;
46 void (*destructor) ();
49 /* Static variables: */
50 static struct pthread_key key_table[PTHREAD_KEYS_MAX];
52 __weak_reference(_pthread_key_create, pthread_key_create);
53 __weak_reference(_pthread_key_delete, pthread_key_delete);
54 __weak_reference(_pthread_getspecific, pthread_getspecific);
55 __weak_reference(_pthread_setspecific, pthread_setspecific);
59 _pthread_key_create(pthread_key_t * key, void (*destructor) (void *))
61 for ((*key) = 0; (*key) < PTHREAD_KEYS_MAX; (*key)++) {
62 /* Lock the key table entry: */
63 _SPINLOCK(&key_table[*key].lock);
65 if (key_table[(*key)].allocated == 0) {
66 key_table[(*key)].allocated = 1;
67 key_table[(*key)].destructor = destructor;
68 key_table[(*key)].seqno++;
70 /* Unlock the key table entry: */
71 _SPINUNLOCK(&key_table[*key].lock);
75 /* Unlock the key table entry: */
76 _SPINUNLOCK(&key_table[*key].lock);
82 _pthread_key_delete(pthread_key_t key)
86 if (key < PTHREAD_KEYS_MAX) {
87 /* Lock the key table entry: */
88 _SPINLOCK(&key_table[key].lock);
90 if (key_table[key].allocated)
91 key_table[key].allocated = 0;
95 /* Unlock the key table entry: */
96 _SPINUNLOCK(&key_table[key].lock);
103 _thread_cleanupspecific(void)
105 struct pthread *curthread = _get_curthread();
109 void (*destructor)( void *);
111 for (itr = 0; itr < PTHREAD_DESTRUCTOR_ITERATIONS; itr++) {
112 for (key = 0; key < PTHREAD_KEYS_MAX; key++) {
113 if (curthread->specific_data_count > 0) {
114 /* Lock the key table entry: */
115 _SPINLOCK(&key_table[key].lock);
118 if (key_table[key].allocated &&
119 (curthread->specific[key].data != NULL)) {
120 if (curthread->specific[key].seqno ==
121 key_table[key].seqno) {
122 data = (void *) curthread->specific[key].data;
123 destructor = key_table[key].destructor;
125 curthread->specific[key].data = NULL;
126 curthread->specific_data_count--;
129 /* Unlock the key table entry: */
130 _SPINUNLOCK(&key_table[key].lock);
133 * If there is a destructore, call it
134 * with the key table entry unlocked:
139 free(curthread->specific);
140 curthread->specific = NULL;
145 if (curthread->specific != NULL) {
146 free(curthread->specific);
147 curthread->specific = NULL;
151 static inline struct pthread_specific_elem *
152 pthread_key_allocate_data(void)
154 struct pthread_specific_elem *new_data;
156 new_data = (struct pthread_specific_elem *)
157 malloc(sizeof(struct pthread_specific_elem) * PTHREAD_KEYS_MAX);
158 if (new_data != NULL) {
159 memset((void *) new_data, 0,
160 sizeof(struct pthread_specific_elem) * PTHREAD_KEYS_MAX);
166 _pthread_setspecific(pthread_key_t key, const void *value)
168 struct pthread *pthread;
171 /* Point to the running thread: */
172 pthread = _get_curthread();
174 if ((pthread->specific) ||
175 (pthread->specific = pthread_key_allocate_data())) {
176 if (key < PTHREAD_KEYS_MAX) {
177 if (key_table[key].allocated) {
178 if (pthread->specific[key].data == NULL) {
180 pthread->specific_data_count++;
183 pthread->specific_data_count--;
185 pthread->specific[key].data = value;
186 pthread->specific[key].seqno =
187 key_table[key].seqno;
199 _pthread_getspecific(pthread_key_t key)
201 struct pthread *pthread;
204 /* Point to the running thread: */
205 pthread = _get_curthread();
207 /* Check if there is specific data: */
208 if (pthread->specific != NULL && key < PTHREAD_KEYS_MAX) {
209 /* Check if this key has been used before: */
210 if (key_table[key].allocated &&
211 (pthread->specific[key].seqno == key_table[key].seqno)) {
212 /* Return the value: */
213 data = (void *) pthread->specific[key].data;
216 * This key has not been used before, so return NULL
222 /* No specific data has been created, so just return NULL: */