blob: 1219eb9e1c574f83fc4f11e2a390dc93799bcd12 (
plain)
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
|
/* pthread_key_create. Hurd version.
Copyright (C) 2002-2021 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C 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.
The GNU C 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 the GNU C Library; if not, see
<https://www.gnu.org/licenses/>. */
#include <pthread.h>
#include <stdlib.h>
#include <assert.h>
#include <pt-internal.h>
#include <pthreadP.h>
pthread_mutex_t __pthread_key_lock;
void (**__pthread_key_destructors) (void *arg);
int __pthread_key_size;
int __pthread_key_count;
int __pthread_key_invalid_count;
int
__pthread_key_create (pthread_key_t *key, void (*destructor) (void *))
{
/* Where to look for the next key slot. */
static int index;
__pthread_key_lock_ready ();
__pthread_mutex_lock (&__pthread_key_lock);
do_search:
/* Use the search hint and try to find a free slot. */
for (; index < __pthread_key_count
&& __pthread_key_destructors[index] != PTHREAD_KEY_INVALID; index++)
;
/* See if we actually found a free element. */
if (index < __pthread_key_count)
{
assert (__pthread_key_destructors[index] == PTHREAD_KEY_INVALID);
assert (__pthread_key_invalid_count > 0);
__pthread_key_invalid_count--;
__pthread_key_destructors[index] = destructor;
*key = index++;
__pthread_mutex_unlock (&__pthread_key_lock);
return 0;
}
assert (index == __pthread_key_count);
/* No space at the end. */
if (__pthread_key_size == __pthread_key_count)
{
/* See if it is worth looking for a free element. */
if (__pthread_key_invalid_count > 4
&& __pthread_key_invalid_count > __pthread_key_size / 8)
{
index = 0;
goto do_search;
}
/* Resize the array. */
{
void *t;
int newsize;
if (__pthread_key_size == 0)
newsize = 8;
else
newsize = __pthread_key_size * 2;
t = realloc (__pthread_key_destructors,
newsize * sizeof (*__pthread_key_destructors));
if (t == NULL)
{
__pthread_mutex_unlock (&__pthread_key_lock);
return ENOMEM;
}
__pthread_key_size = newsize;
__pthread_key_destructors = t;
}
}
__pthread_key_destructors[index] = destructor;
*key = index;
index++;
__pthread_key_count++;
__pthread_mutex_unlock (&__pthread_key_lock);
return 0;
}
weak_alias (__pthread_key_create, pthread_key_create)
hidden_def (__pthread_key_create)
|
