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
|
// $Id$
#include "ObjectKey_Table.h"
#include "ORB_Core.h"
#include "Refcounted_ObjectKey.h"
ACE_RCSID(tao,
ObjectKey_Table,
"$Id$")
int
TAO::Less_Than_ObjectKey::operator () (const TAO::ObjectKey &lhs,
const TAO::ObjectKey &rhs) const
{
if (lhs.length () < rhs.length ())
{
return 1;
}
else if (lhs.length () > rhs.length ())
{
return 0;
}
for (CORBA::ULong i = 0; i < rhs.length (); ++i)
{
if (lhs[i] < rhs[i])
{
return 1;
}
}
return 0;
}
/********************************************************/
TAO::ObjectKey_Table::ObjectKey_Table (void)
: lock_ (0)
, table_ ()
{
}
TAO::ObjectKey_Table::~ObjectKey_Table (void)
{
this->table_.close ();
delete this->lock_;
}
int
TAO::ObjectKey_Table::init (TAO_ORB_Core *oc)
{
/// Create the lock that is needed for internal usage.
this->lock_ =
oc->resource_factory ()->create_object_key_table_lock ();
return 0;
}
int
TAO::ObjectKey_Table::bind (const TAO::ObjectKey &key,
TAO::Refcounted_ObjectKey *&key_new)
{
key_new = 0;
int retval = 0;
{
ACE_GUARD_RETURN (ACE_Lock,
ace_mon,
*this->lock_,
0);
// This is a tradeoff.. We could avoid this two stage process of
// using a find () and then a bind () , which would make things
// efficient. BUT we may have to do allocation upfront and delete if
// bind () returns with an entry. We take one of the routes that
// avoids allocation.
retval = this->table_.find (key,
key_new);
if (retval == -1)
{
return this->bind_i (key,
key_new);
}
(void) key_new->incr_refcount ();
}
return retval;
}
int
TAO::ObjectKey_Table::unbind (TAO::Refcounted_ObjectKey *&key_new)
{
ACE_GUARD_RETURN (ACE_Lock,
ace_mon,
*this->lock_,
0);
// If the refcount has dropped to 1, just go ahead and unbind it
// from the table.
if (key_new && key_new->decr_refcount () == 1)
{
return this->unbind_i (key_new);
}
return 0;
}
int
TAO::ObjectKey_Table::destroy (void)
{
if (this->table_.current_size ())
{
ACE_GUARD_RETURN (ACE_Lock,
ace_mon,
*this->lock_,
0);
TABLE::ITERATOR end_iter = this->table_.end ();
TABLE::ITERATOR start;
while ((start = this->table_.begin ()) != end_iter)
{
TABLE::ENTRY &ent = (*start);
ent.item ()->decr_refcount ();
this->table_.unbind (&ent);
}
}
return 0;
}
int
TAO::ObjectKey_Table::bind_i (const TAO::ObjectKey &key,
TAO::Refcounted_ObjectKey *&key_new)
{
ACE_NEW_RETURN (key_new,
TAO::Refcounted_ObjectKey (key),
-1);
int retval = this->table_.bind (key,
key_new);
if (retval != -1)
{
key_new->incr_refcount ();
}
else
{
key_new->decr_refcount ();
}
return retval;
}
int
TAO::ObjectKey_Table::unbind_i (TAO::Refcounted_ObjectKey *&key_new)
{
TAO::Refcounted_ObjectKey *tmp = 0;
if (this->table_.unbind (key_new->object_key (),
tmp) != -1)
{
// @@ Cant do much if the unbind fails.
// Remove our refcount on the ObjectKey
(void) tmp->decr_refcount ();
}
return 0;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
template class ACE_RB_Tree <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>;
template class ACE_RB_Tree_Iterator_Base <class TAO::ObjectKey,
class TAO::Refcounted_ObjectKey *,
class TAO::Less_Than_ObjectKey,
class ACE_Null_Mutex>;
template class ACE_RB_Tree_Iterator <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>;
template class ACE_RB_Tree_Reverse_Iterator <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>;
template class ACE_RB_Tree_Node <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *>;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#pragma instantiate ACE_RB_Tree <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>
#pragma instantiate ACE_RB_Tree_Iterator_Base <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>
#pragma instantiate ACE_RB_Tree_Iterator <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>
#pragma instantiate ACE_RB_Tree_Reverse_Iterator <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *,
TAO::Less_Than_ObjectKey,
ACE_Null_Mutex>
#pragma instantiate ACE_RB_Tree_Node <TAO::ObjectKey,
TAO::Refcounted_ObjectKey *>
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
|
