1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
/*
* Copyright (c) 1995 John Birrell <jb@cimlogic.com.au>.
* 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 acknowledgement:
* This product includes software developed by John Birrell.
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS 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 THE REGENTS OR 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.
*
*/
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#ifdef _THREAD_SAFE
#include <pthread.h>
#include "pthread_private.h"
/* Static variables: */
static struct pthread_key key_table[PTHREAD_DATAKEYS_MAX];
int
pthread_keycreate(pthread_key_t * key, void (*destructor) (void *))
{
for ((*key) = 0; (*key) < PTHREAD_DATAKEYS_MAX; (*key)++) {
if (key_table[(*key)].count == 0) {
key_table[(*key)].count++;
key_table[(*key)].destructor = destructor;
return (0);
}
}
return (EAGAIN);
}
int
pthread_key_delete(pthread_key_t key)
{
int ret;
int status;
/* Block signals: */
_thread_kern_sig_block(&status);
if (key < PTHREAD_DATAKEYS_MAX) {
switch (key_table[key].count) {
case 1:
key_table[key].destructor = NULL;
key_table[key].count = 0;
case 0:
ret = 0;
break;
default:
ret = EBUSY;
}
} else {
ret = EINVAL;
}
/* Unblock signals: */
_thread_kern_sig_unblock(status);
return (ret);
}
void
_thread_cleanupspecific(void)
{
void *data;
int key;
int itr;
int status;
/* Block signals: */
_thread_kern_sig_block(&status);
for (itr = 0; itr < _POSIX_THREAD_DESTRUTOR_ITERATIONS; itr++) {
for (key = 0; key < PTHREAD_DATAKEYS_MAX; key++) {
if (_thread_run->specific_data_count) {
if (_thread_run->specific_data[key]) {
data = (void *) _thread_run->specific_data[key];
_thread_run->specific_data[key] = NULL;
_thread_run->specific_data_count--;
if (key_table[key].destructor) {
key_table[key].destructor(data);
}
key_table[key].count--;
}
} else {
free(_thread_run->specific_data);
/* Unblock signals: */
_thread_kern_sig_unblock(status);
return;
}
}
}
free(_thread_run->specific_data);
/* Unblock signals: */
_thread_kern_sig_unblock(status);
}
static inline const void **
pthread_key_allocate_data(void)
{
const void **new_data;
if ((new_data = (const void **) malloc(sizeof(void *) * PTHREAD_DATAKEYS_MAX)) != NULL) {
memset((void *) new_data, 0, sizeof(void *) * PTHREAD_DATAKEYS_MAX);
}
return (new_data);
}
int
pthread_setspecific(pthread_key_t key, const void *value)
{
pthread_t pthread;
int ret = 0;
int status;
/* Block signals: */
_thread_kern_sig_block(&status);
/* Point to the running thread: */
pthread = _thread_run;
/*
* Enter a loop for signal handler threads to find the parent thread
* which has the specific data associated with it:
*/
while (pthread->parent_thread != NULL) {
/* Point to the parent thread: */
pthread = pthread->parent_thread;
}
if ((pthread->specific_data) || (pthread->specific_data = pthread_key_allocate_data())) {
if ((key < PTHREAD_DATAKEYS_MAX) && (key_table)) {
if (key_table[key].count) {
if (pthread->specific_data[key] == NULL) {
if (value != NULL) {
pthread->specific_data_count++;
key_table[key].count++;
}
} else {
if (value == NULL) {
pthread->specific_data_count--;
key_table[key].count--;
}
}
pthread->specific_data[key] = value;
ret = 0;
} else {
ret = EINVAL;
}
} else {
ret = EINVAL;
}
} else {
ret = ENOMEM;
}
/* Unblock signals: */
_thread_kern_sig_unblock(status);
return (ret);
}
int
pthread_getspecific(pthread_key_t key, void **p_data)
{
pthread_t pthread;
int rval = 0;
int status;
/* Block signals: */
_thread_kern_sig_block(&status);
/* Point to the running thread: */
pthread = _thread_run;
/*
* Enter a loop for signal handler threads to find the parent thread
* which has the specific data associated with it:
*/
while (pthread->parent_thread != NULL) {
/* Point to the parent thread: */
pthread = pthread->parent_thread;
}
/* Check for errors: */
if (pthread == NULL || p_data == NULL) {
/* Return an invalid argument error: */
_thread_seterrno(_thread_run, EINVAL);
rval = -1;
}
/* Check if there is specific data: */
else if (pthread->specific_data != NULL && (key < PTHREAD_DATAKEYS_MAX) && (key_table)) {
/* Check if this key has been used before: */
if (key_table[key].count) {
/* Return the value: */
*p_data = (void *) pthread->specific_data[key];
} else {
/*
* This key has not been used before, so return NULL
* instead:
*/
*p_data = NULL;
}
} else {
/* No specific data has been created, so just return NULL: */
*p_data = NULL;
}
/* Unblock signals: */
_thread_kern_sig_unblock(status);
return (rval);
}
#endif
|
