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
|
// $Id$
#include "ace/Priority_Reactor.h"
#include "ace/Malloc_T.h"
ACE_RCSID(ace, Priority_Reactor, "$Id$")
typedef ACE_Unbounded_Queue_Iterator<ACE_Event_Tuple> QUEUE_ITERATOR;
// Its iterator.
typedef ACE_Cached_Allocator<ACE_Node<ACE_Event_Tuple>, ACE_SYNCH_NULL_MUTEX> TUPLE_ALLOCATOR;
// Defines the memory allocator used, no need for locking because it
// is only used in one thread of control.
ACE_ALLOC_HOOK_DEFINE(ACE_Priority_Reactor)
// Initialize ACE_Select_Reactor.
#define npriorities \
ACE_Event_Handler::HI_PRIORITY-ACE_Event_Handler::LO_PRIORITY+1
void
ACE_Priority_Reactor::init_bucket (void)
{
// Allocate enough space for all the handles.
// TODO: This can be wrong, maybe we should use other kind of
// allocator here?
ACE_NEW (this->tuple_allocator_,
TUPLE_ALLOCATOR (ACE_Select_Reactor::DEFAULT_SIZE));
// The event handlers are assigned to a new As the Event
ACE_NEW (this->bucket_,
QUEUE *[npriorities]);
// This loops "ensures" exception safety.
for (int i = 0; i < npriorities; ++i)
ACE_NEW (this->bucket_[i],
QUEUE (this->tuple_allocator_));
}
ACE_Priority_Reactor::ACE_Priority_Reactor (ACE_Sig_Handler *sh,
ACE_Timer_Queue *tq)
: ACE_Select_Reactor(sh, tq),
bucket_ (0),
tuple_allocator_ (0)
{
ACE_TRACE ("ACE_Priority_Reactor::ACE_Priority_Reactor");
this->init_bucket ();
}
ACE_Priority_Reactor::ACE_Priority_Reactor (size_t size,
int rs,
ACE_Sig_Handler *sh,
ACE_Timer_Queue *tq)
: ACE_Select_Reactor (size, rs, sh, tq),
bucket_ (0),
tuple_allocator_ (0)
{
ACE_TRACE ("ACE_Priority_Reactor::ACE_Priority_Reactor");
this->init_bucket ();
}
ACE_Priority_Reactor::~ACE_Priority_Reactor (void)
{
ACE_TRACE ("ACE_Priority_Reactor::~ACE_Priority_Reactor");
for (int i = 0; i < npriorities; ++i)
delete this->bucket_[i];
delete[] this->bucket_;
delete tuple_allocator_;
}
void
ACE_Priority_Reactor::build_bucket (ACE_Handle_Set &dispatch_mask,
int &min_priority,
int &max_priority)
{
ACE_Handle_Set_Iterator handle_iter (dispatch_mask);
for (ACE_HANDLE handle;
(handle = handle_iter ()) != ACE_INVALID_HANDLE;
)
{
ACE_Event_Tuple et (this->handler_rep_.find (handle),
handle);
int prio = et.event_handler_->priority ();
// If the priority is out of range assign the minimum priority.
if (prio < ACE_Event_Handler::LO_PRIORITY
|| prio > ACE_Event_Handler::HI_PRIORITY)
prio = ACE_Event_Handler::LO_PRIORITY;
bucket_[prio]->enqueue_tail (et);
// Update the priority ranges....
if (min_priority > prio)
min_priority = prio;
if (max_priority < prio)
max_priority = prio;
}
}
int
ACE_Priority_Reactor::dispatch_io_set (int number_of_active_handles,
int& number_dispatched,
int mask,
ACE_Handle_Set& dispatch_mask,
ACE_Handle_Set& ready_mask,
ACE_EH_PTMF callback)
{
ACE_TRACE ("ACE_Priority_Reactor::dispatch_io_set");
if (number_of_active_handles == 0)
return 0;
// The range for which there exists any Event_Tuple is computed on
// the ordering loop, minimizing iterations on the dispatching loop.
int min_priority =
ACE_Event_Handler::HI_PRIORITY;
int max_priority =
ACE_Event_Handler::LO_PRIORITY;
(void) this->build_bucket (dispatch_mask,
min_priority,
max_priority);
for (int i = max_priority; i >= min_priority; --i)
{
while (!bucket_[i]->is_empty ()
&& number_dispatched < number_of_active_handles)
{
ACE_Event_Tuple et;
bucket_[i]->dequeue_head (et);
this->notify_handle (et.handle_,
mask,
ready_mask,
et.event_handler_,
callback);
number_dispatched++;
// clear the bit from that dispatch mask,
// so when we need to restart the iteration (rebuilding the iterator...)
// we will not dispatch the already dipatched handlers
this->clear_dispatch_mask (et.handle_,
mask);
if (this->state_changed_)
{
this->state_changed_ = false; // so it will not rebuild it ...
}
}
// Even if we are aborting the loop due to this->state_changed
// or another error we still want to cleanup the buckets.
bucket_[i]->reset ();
}
return 0;
}
void
ACE_Priority_Reactor::dump (void) const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Priority_Reactor::dump");
ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
ACE_Select_Reactor::dump ();
ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
#endif /* ACE_HAS_DUMP */
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
template class ACE_Unbounded_Queue<ACE_Event_Tuple>;
template class ACE_Unbounded_Queue_Iterator<ACE_Event_Tuple>;
template class ACE_Node<ACE_Event_Tuple>;
template class ACE_Cached_Allocator<ACE_Node<ACE_Event_Tuple>, ACE_SYNCH_NULL_MUTEX>;
template class ACE_Locked_Free_List<ACE_Cached_Mem_Pool_Node<ACE_Node<ACE_Event_Tuple> >,ACE_SYNCH_NULL_MUTEX>;
template class ACE_Free_List<ACE_Cached_Mem_Pool_Node<ACE_Node<ACE_Event_Tuple> > >;
template class ACE_Cached_Mem_Pool_Node<ACE_Node<ACE_Event_Tuple> >;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#pragma instantiate ACE_Unbounded_Queue<ACE_Event_Tuple>
#pragma instantiate ACE_Unbounded_Queue_Iterator<ACE_Event_Tuple>
#pragma instantiate ACE_Node<ACE_Event_Tuple>
#pragma instantiate ACE_Cached_Allocator<ACE_Node<ACE_Event_Tuple>, ACE_SYNCH_NULL_MUTEX>
#pragma instantiate ACE_Locked_Free_List<ACE_Cached_Mem_Pool_Node<ACE_Node<ACE_Event_Tuple> >,ACE_SYNCH_NULL_MUTEX>
#pragma instantiate ACE_Free_List<ACE_Cached_Mem_Pool_Node<ACE_Node<ACE_Event_Tuple> > >
#pragma instantiate ACE_Cached_Mem_Pool_Node<ACE_Node<ACE_Event_Tuple> >
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
|
