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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
|
// $Id$
#include "tao/Transport_Cache_Manager.h"
#include "tao/Transport.h"
#include "tao/debug.h"
#include "tao/ORB_Core.h"
#include "ace/Handle_Set.h"
#if !defined (__ACE_INLINE__)
# include "tao/Transport_Cache_Manager.inl"
#endif /* __ACE_INLINE__ */
ACE_RCSID (TAO,
Transport_Cache_Manager,
"$Id$")
TAO_Transport_Cache_Manager::TAO_Transport_Cache_Manager (void)
: cache_map_ (),
cache_lock_ (0)
{
}
TAO_Transport_Cache_Manager::~TAO_Transport_Cache_Manager (void)
{
// Delete the lock that we have
delete this->cache_lock_;
}
int
TAO_Transport_Cache_Manager::open (TAO_ORB_Core *orb_core,
size_t size)
{
// Create the cache_lock
this->cache_lock_ =
orb_core->resource_factory ()->create_cached_connection_lock ();
if (this->cache_lock_ == 0)
{
ACE_ERROR_RETURN ((LM_ERROR,
ACE_TEXT ("TAO (%P|%t) ERROR TAO_Transport_Cache_Manager::open: "),
ACE_TEXT ("Lock creation error\n")),
-1);
}
// Now open the cache map
return this->cache_map_.open (size);
}
int
TAO_Transport_Cache_Manager::bind_i (TAO_Cache_ExtId &ext_id,
TAO_Cache_IntId &int_id)
{
// Get the entry too
HASH_MAP_ENTRY *entry = 0;
// When it comes for bind we know the transport is going to be busy
// and is marked for a partcular thread. So, mark it busy
int_id.recycle_state (ACE_RECYCLABLE_BUSY);
int retval = this->cache_map_.bind (ext_id,
int_id,
entry);
if (retval == 0)
{
// The entry has been added to cache succesfully
// Add the cache_map_entry to the transport
int_id.transport () ->cache_map_entry (entry);
}
else if (retval == 1)
{
if (TAO_debug_level > 4 && retval != 0)
{
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%P|%t) TAO_Transport_Cache_Manager::bind_i")
ACE_TEXT (" unable to bind in the first attempt \n")
ACE_TEXT (" So trying with a new index\n")));
}
// There was an entry like this before, so let us do some
// minor adjustments and rebind
retval = this->get_last_index_bind (ext_id,
int_id,
entry);
if (retval == 0)
{
int_id.transport ()->cache_map_entry (entry);
}
}
if (TAO_debug_level > 5 && retval != 0)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) TAO_Transport_Cache_Manager::bind_i")
ACE_TEXT (" unable to bind \n")));
}
return retval;
}
// Used to be in the .inl, but moved here b/c the use of
// TAO_Transport::_duplicate() caused an include file cycle with
// inlining turned on.
int
TAO_Transport_Cache_Manager::find_transport (
TAO_Transport_Descriptor_Interface *prop,
TAO_Transport *&transport)
{
if (prop == 0)
{
transport = 0;
return -1;
}
// Compose the ExternId
TAO_Cache_ExtId ext_id (prop);
TAO_Cache_IntId int_id;
int retval = this->find (ext_id,
int_id);
if (retval == 0)
{
transport = int_id.relinquish_transport ();
}
return retval;
}
int
TAO_Transport_Cache_Manager::find_i (const TAO_Cache_ExtId &key,
TAO_Cache_IntId &value)
{
HASH_MAP_ENTRY *entry = 0;
// Get the entry from the Hash Map
int retval = 0;
// Get the index of the <key>
int index = key.index ();
// Make a temporary object. It does not do a copy.
TAO_Cache_ExtId tmp_key (key.property ());
while (retval == 0)
{
// Look for an entry in the map
retval = this->cache_map_.find (tmp_key,
entry);
// We have an entry in the map, check whether it is idle. If it
// is idle it would be marked as busy.
if (entry)
{
CORBA::Boolean idle =
this->is_entry_idle (entry);
if (idle)
{
// Successfully found a TAO_Transport.
// NOTE: This assignment operator indirectly incurs two
// lock operations since it duplicates and releases
// TAO_Transport objects.
value = entry->int_id_;
if (TAO_debug_level > 4)
{
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%P |%t) index in find <%d>\n"),
entry->ext_id_.index ()));
}
return 0;
}
}
// Bump the index up
tmp_key.index (++index);
}
// If we are here then it is an error
if (TAO_debug_level > 4 && retval != 0)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) TAO_Transport_Cache_Manager::find_i")
ACE_TEXT (" unable to locate a free connection\n")));
}
return retval;
}
int
TAO_Transport_Cache_Manager::rebind_i (const TAO_Cache_ExtId &key,
const TAO_Cache_IntId &value)
{
return this->cache_map_.rebind (key,
value);
}
int
TAO_Transport_Cache_Manager::trybind_i (const TAO_Cache_ExtId &key,
TAO_Cache_IntId &value)
{
return this->cache_map_.trybind (key, value);
}
int
TAO_Transport_Cache_Manager::unbind_i (const TAO_Cache_ExtId &key)
{
return this->cache_map_.unbind (key);
}
int
TAO_Transport_Cache_Manager::unbind_i (const TAO_Cache_ExtId &key,
TAO_Cache_IntId &value)
{
return this->cache_map_.unbind (key,
value);
}
int
TAO_Transport_Cache_Manager::make_idle_i (HASH_MAP_ENTRY *&entry)
{
if (entry == 0)
return -1;
// First get the entry again (if at all things had changed in the
// cache map in the mean time)
HASH_MAP_ENTRY *new_entry = 0;
int retval = this->cache_map_.find (entry->ext_id_,
new_entry);
if (retval == 0)
{
new_entry->int_id_.
recycle_state (ACE_RECYCLABLE_IDLE_AND_PURGABLE);
entry = new_entry;
}
else if (TAO_debug_level > 0 && retval != 0)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) TAO_Transport_Cache_Manager::make_idle_i:\n")
ACE_TEXT ("(%P|%t) unable to locate the entry to make it idle\n")));
}
return retval;
}
int
TAO_Transport_Cache_Manager::close_i (ACE_Handle_Set &reactor_registered,
TAO_EventHandlerSet &unregistered)
{
for (HASH_MAP_ITER iter = this->cache_map_.begin ();
iter != this->cache_map_.end ();
++iter)
{
// First we look through whether we have an entry that has already
// been closed.
if ((*iter).int_id_.recycle_state () != ACE_RECYCLABLE_CLOSED)
{
#if 0
// @@ This code from Connection_Cache_Manager disappeared
// during the changeover; we need the functional equivalent back.
// The problem is that with the locking stuff that we're putting
// in to the Transport, we might want to encapsulate the whole
// exercise of adding to the handle set in a method on the transport
// rather than doing it here. That way, the locking is correct.
if ((*iter).int_id_.handler ()->is_registered ())
{
reactor_registered.set_bit ((*iter).int_id_.handler ()->fetch_handle ());
}
#else
// Get the transport to fill its associated connection's handle in
// the handle sets.
(*iter).int_id_.transport ()->provide_handle (reactor_registered,
unregistered);
#endif
// Inform the transport that has a reference to the entry in the
// map that we are *gone* now. So, the transport should not use
// the reference to the entry that he has, to acces us *at any
// time*.
(*iter).int_id_.transport ()->cache_map_entry (0);
}
}
// Unbind all the entries in the map
this->cache_map_.unbind_all ();
return 0;
}
int
TAO_Transport_Cache_Manager::purge_entry_i (HASH_MAP_ENTRY *&entry)
{
int retval = 0;
if (entry)
{
// Remove the enrty from the Map
retval = this->cache_map_.unbind (entry);
}
// Set the entry pointer to zero
entry = 0;
return retval;
}
void
TAO_Transport_Cache_Manager::mark_invalid_i (HASH_MAP_ENTRY *&entry)
{
if (entry)
{
// Mark the entry as not usable
entry->int_id_.recycle_state (ACE_RECYCLABLE_PURGABLE_BUT_NOT_IDLE);
}
}
int
TAO_Transport_Cache_Manager::get_last_index_bind (TAO_Cache_ExtId &key,
TAO_Cache_IntId &val,
HASH_MAP_ENTRY *&entry)
{
CORBA::ULong ctr = entry->ext_id_.index ();
int retval = 0;
while (retval == 0)
{
// Set the index
key.index (++ctr);
// Check to see if an element exists in the Map. If it exists we
// loop, else we drop out of the loop
retval =
this->cache_map_.find (key);
}
// Now do a bind again with the new index
return this->cache_map_.bind (key,
val,
entry);
}
int
TAO_Transport_Cache_Manager::is_entry_idle (HASH_MAP_ENTRY *&entry)
{
if (entry->int_id_.recycle_state () == ACE_RECYCLABLE_IDLE_AND_PURGABLE ||
entry->int_id_.recycle_state () == ACE_RECYCLABLE_IDLE_BUT_NOT_PURGABLE)
{
// Save that in the transport
entry->int_id_.transport ()->cache_map_entry (entry);
// Mark the connection as busy
entry->int_id_.recycle_state (ACE_RECYCLABLE_BUSY);
return 1;
}
return 0;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
// Instantiations for the Hash Map
template class ACE_Equal_To<TAO_Cache_ExtId>;
template class ACE_Hash<TAO_Cache_ExtId>;
template class ACE_Hash_Map_Entry<TAO_Cache_ExtId, TAO_Cache_IntId>;
template class ACE_Hash_Map_Manager<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Null_Mutex>;
template class ACE_Hash_Map_Iterator<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Null_Mutex>;
template class ACE_Hash_Map_Reverse_Iterator<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Null_Mutex>;
template class ACE_Hash_Map_Manager_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>;
template class ACE_Hash_Map_Iterator_Base_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>;
template class ACE_Hash_Map_Iterator_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>;
template class ACE_Hash_Map_Reverse_Iterator_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>;
template class ACE_Unbounded_Set<ACE_Event_Handler*>;
template class ACE_Unbounded_Set_Iterator<ACE_Event_Handler*>;
template class ACE_Node<ACE_Event_Handler*>;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
// Instantiations for the Hash Map
#pragma instantiate ACE_Equal_To<TAO_Cache_ExtId>
#pragma instantiate ACE_Hash<TAO_Cache_ExtId>
#pragma instantiate ACE_Hash_Map_Entry<TAO_Cache_ExtId, TAO_Cache_IntId>
#pragma instantiate ACE_Hash_Map_Manager<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Null_Mutex>
#pragma instantiate ACE_Hash_Map_Iterator<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Null_Mutex>
#pragma instantiate ACE_Hash_Map_Reverse_Iterator<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Null_Mutex>
#pragma instantiate ACE_Hash_Map_Manager_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>
#pragma instantiate ACE_Hash_Map_Iterator_Base_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>
#pragma instantiate ACE_Hash_Map_Iterator_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>
#pragma instantiate ACE_Hash_Map_Reverse_Iterator_Ex<TAO_Cache_ExtId, TAO_Cache_IntId, ACE_Hash<TAO_Cache_ExtId>, ACE_Equal_To<TAO_Cache_ExtId>, ACE_Null_Mutex>
#pragma instantiate ACE_Unbounded_Set<ACE_Event_Handler*>
#pragma instantiate ACE_Unbounded_Set_Iterator<ACE_Event_Handler*>
#pragma instantiate ACE_Node<ACE_Event_Handler*>
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
|