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
|
/**
* @file
*
* @brief Set Specific Key
* @ingroup POSIXAPI
*/
/*
* Copyright (c) 2012 Zhongwei Yao.
* COPYRIGHT (c) 1989-2014.
* On-Line Applications Research Corporation (OAR).
*
* The license and distribution terms for this file may be
* found in the file LICENSE in this distribution or at
* http://www.rtems.org/license/LICENSE.
*/
#if HAVE_CONFIG_H
#include "config.h"
#endif
#include <rtems/posix/keyimpl.h>
#include <rtems/score/thread.h>
#include <rtems/score/chainimpl.h>
#include <errno.h>
static int _POSIX_Keys_Set_value(
pthread_key_t key,
const void *value,
POSIX_Keys_Control *the_key,
Thread_Control *executing,
RBTree_Node *rb_node
)
{
POSIX_Keys_Key_value_pair *key_value_pair;
if ( rb_node != NULL ) {
key_value_pair = POSIX_KEYS_RBTREE_NODE_TO_KEY_VALUE_PAIR( rb_node );
key_value_pair->value = RTEMS_DECONST( void *, value );
} else {
key_value_pair = _POSIX_Keys_Key_value_pair_allocate();
if ( key_value_pair == NULL ) {
return ENOMEM;
}
key_value_pair->key = key;
key_value_pair->thread = executing;
key_value_pair->value = RTEMS_DECONST( void *, value );
/*
* The insert can only go wrong if the same node is already in a unique
* tree. This has been already checked with the _RBTree_Find().
*/
_RBTree_Insert(
&_POSIX_Keys_Key_value_lookup_tree,
&key_value_pair->Key_value_lookup_node,
_POSIX_Keys_Key_value_compare,
true
);
_Chain_Append_unprotected(
&executing->Key_Chain,
&key_value_pair->Key_values_per_thread_node
);
}
return 0;
}
static int _POSIX_Keys_Delete_value(
pthread_key_t key,
POSIX_Keys_Control *the_key,
RBTree_Node *rb_node
)
{
if ( rb_node != NULL ) {
POSIX_Keys_Key_value_pair *key_value_pair =
POSIX_KEYS_RBTREE_NODE_TO_KEY_VALUE_PAIR( rb_node );
_POSIX_Keys_Free_key_value_pair( key_value_pair );
}
return 0;
}
/*
* 17.1.2 Thread-Specific Data Management, P1003.1c/Draft 10, p. 165
*/
int pthread_setspecific(
pthread_key_t key,
const void *value
)
{
POSIX_Keys_Control *the_key;
Objects_Locations location;
Thread_Control *executing;
RBTree_Node *rb_node;
int eno;
the_key = _POSIX_Keys_Get( key, &location );
switch ( location ) {
case OBJECTS_LOCAL:
executing = _Thread_Executing;
rb_node = _POSIX_Keys_Find( key, executing );
if ( value != NULL ) {
eno = _POSIX_Keys_Set_value( key, value, the_key, executing, rb_node );
} else {
eno = _POSIX_Keys_Delete_value( key, the_key, rb_node );
}
_Objects_Put( &the_key->Object );
return eno;
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* should never happen */
#endif
case OBJECTS_ERROR:
break;
}
return EINVAL;
}
|
