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
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
|
// $Id$
#if !defined (ACE_MESSAGE_QUEUE_C)
#define ACE_MESSAGE_QUEUE_C
#include "ace/Message_Queue.h"
#include "ace/Log_Msg.h"
#if !defined (__ACE_INLINE__)
#include "ace/Message_Queue.i"
#endif /* __ACE_INLINE__ */
ACE_RCSID(ace, Message_Queue, "$Id$")
#if defined (VXWORKS)
////////////////////////////////
// class ACE_Message_Queue_Vx //
////////////////////////////////
void
ACE_Message_Queue_Vx::dump (void) const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Message_Queue_Vx::dump");
ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
switch (this->state_)
{
case ACE_Message_Queue_Base::ACTIVATED:
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("state = ACTIVATED\n")));
break;
case ACE_Message_Queue_Base::DEACTIVATED:
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("state = DEACTIVATED\n")));
break;
case ACE_Message_Queue_Base::PULSED:
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("state = PULSED\n")));
break;
}
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("low_water_mark = %d\n")
ACE_LIB_TEXT ("high_water_mark = %d\n")
ACE_LIB_TEXT ("cur_bytes = %d\n")
ACE_LIB_TEXT ("cur_length = %d\n")
ACE_LIB_TEXT ("cur_count = %d\n")
ACE_LIB_TEXT ("head_ = %u\n")
ACE_LIB_TEXT ("MSG_Q_ID = %u\n"),
this->low_water_mark_,
this->high_water_mark_,
this->cur_bytes_,
this->cur_length_,
this->cur_count_,
this->head_,
this->tail_));
ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
#endif /* ACE_HAS_DUMP */
}
ACE_Message_Queue_Vx::ACE_Message_Queue_Vx (size_t max_messages,
size_t max_message_length,
ACE_Notification_Strategy *ns)
: ACE_Message_Queue<ACE_NULL_SYNCH> (0, 0, ns),
max_messages_ (ACE_static_cast (int, max_messages)),
max_message_length_ (ACE_static_cast (int, max_message_length))
{
ACE_TRACE ("ACE_Message_Queue_Vx::ACE_Message_Queue_Vx");
if (this->open (max_messages_, max_message_length_, ns) == -1)
ACE_ERROR ((LM_ERROR, ACE_LIB_TEXT ("open")));
}
ACE_Message_Queue_Vx::~ACE_Message_Queue_Vx (void)
{
ACE_TRACE ("ACE_Message_Queue_Vx::~ACE_Message_Queue_Vx");
if (this->tail_ != 0 && this->close () == -1)
ACE_ERROR ((LM_ERROR, ACE_LIB_TEXT ("close")));
}
// Don't bother locking since if someone calls this function more than
// once for the same queue, we're in bigger trouble than just
// concurrency control!
int
ACE_Message_Queue_Vx::open (size_t max_messages,
size_t max_message_length,
ACE_Notification_Strategy *ns)
{
ACE_TRACE ("ACE_Message_Queue_Vx::open");
this->high_water_mark_ = 0;
this->low_water_mark_ = 0;
this->cur_bytes_ = 0;
this->cur_length_ = 0;
this->cur_count_ = 0;
this->head_ = 0;
this->notification_strategy_ = ns;
this->max_messages_ = ACE_static_cast (int, max_messages);
this->max_message_length_ = ACE_static_cast (int, max_message_length);
if (tail_)
{
// Had already created a msgQ, so delete it.
close ();
activate_i ();
}
return (this->tail_ =
ACE_reinterpret_cast (ACE_Message_Block *,
::msgQCreate (max_messages_,
max_message_length_,
MSG_Q_FIFO))) == 0 ? -1 : 0;
}
// Clean up the queue if we have not already done so!
int
ACE_Message_Queue_Vx::close (void)
{
ACE_TRACE ("ACE_Message_Queue_Vx::close");
// Don't lock, because we don't have a lock. It shouldn't be
// necessary, anyways.
this->deactivate_i ();
// Don't bother to free up the remaining message on the list,
// because we don't have any way to iterate over what's in the
// queue.
return ::msgQDelete (msgq ());
}
int
ACE_Message_Queue_Vx::signal_enqueue_waiters (void)
{
// No-op.
return 0;
}
int
ACE_Message_Queue_Vx::signal_dequeue_waiters (void)
{
// No-op.
return 0;
}
int
ACE_Message_Queue_Vx::enqueue_tail_i (ACE_Message_Block *new_item)
{
ACE_TRACE ("ACE_Message_Queue_Vx::enqueue_tail_i");
if (new_item == 0)
return -1;
// Don't try to send a composite message!!!! Only the first
// block will be sent.
this->cur_count_++;
// Always use this method to actually send a message on the queue.
if (::msgQSend (msgq (),
new_item->rd_ptr (),
new_item->size (),
WAIT_FOREVER,
MSG_PRI_NORMAL) == OK)
return ::msgQNumMsgs (msgq ());
else
return -1;
}
int
ACE_Message_Queue_Vx::enqueue_head_i (ACE_Message_Block *new_item)
{
ACE_TRACE ("ACE_Message_Queue_Vx::enqueue_head_i");
// Just delegate to enqueue_tail_i.
return enqueue_tail_i (new_item);
}
int
ACE_Message_Queue_Vx::enqueue_i (ACE_Message_Block *new_item)
{
ACE_TRACE ("ACE_Message_Queue_Vx::enqueue_i");
if (new_item == 0)
return -1;
if (this->head_ == 0)
// Should always take this branch.
return this->enqueue_head_i (new_item);
else
ACE_NOTSUP_RETURN (-1);
}
int
ACE_Message_Queue_Vx::enqueue_deadline_i (ACE_Message_Block *new_item)
{
ACE_TRACE ("ACE_Message_Queue_Vx::enqueue_deadline_i");
// Just delegate to enqueue_tail_i.
return enqueue_tail_i (new_item);
}
// Actually get the first ACE_Message_Block (no locking, so must be
// called with locks held). This method assumes that the queue has at
// least one item in it when it is called.
int
ACE_Message_Queue_Vx::dequeue_head_i (ACE_Message_Block *&first_item)
{
ACE_TRACE ("ACE_Message_Queue_Vx::dequeue_head_i");
// We don't allocate a new Message_Block: the caller must provide
// it, and must ensure that it is big enough (without chaining).
if (first_item == 0 || first_item->wr_ptr () == 0)
return -1;
if (::msgQReceive (msgq (),
first_item->wr_ptr (),
first_item->size (),
WAIT_FOREVER) == ERROR)
return -1;
else
return ::msgQNumMsgs (msgq ());
}
int
ACE_Message_Queue_Vx::dequeue_prio_i (ACE_Message_Block *& /*dequeued*/)
{
ACE_TRACE ("ACE_Message_Queue_Vx::dequeue_prio_i");
ACE_NOTSUP_RETURN (-1);
}
int
ACE_Message_Queue_Vx::dequeue_tail_i (ACE_Message_Block *& /*dequeued*/)
{
ACE_TRACE ("ACE_Message_Queue_Vx::dequeue_tail_i");
ACE_NOTSUP_RETURN (-1);
}
int
ACE_Message_Queue_Vx::dequeue_deadline_i (ACE_Message_Block *& /*dequeued*/)
{
ACE_TRACE ("ACE_Message_Queue_Vx::dequeue_deadline_i");
ACE_NOTSUP_RETURN (-1);
}
// Take a look at the first item without removing it.
int
ACE_Message_Queue_Vx::wait_not_full_cond (ACE_Guard<ACE_Null_Mutex> &mon,
ACE_Time_Value *tv)
{
// Always return here, and let the VxWorks message queue handle blocking.
ACE_UNUSED_ARG (mon);
ACE_UNUSED_ARG (tv);
return 0;
}
int
ACE_Message_Queue_Vx::wait_not_empty_cond (ACE_Guard<ACE_Null_Mutex> &mon,
ACE_Time_Value *tv)
{
// Always return here, and let the VxWorks message queue handle blocking.
ACE_UNUSED_ARG (mon);
ACE_UNUSED_ARG (tv);
return 0;
}
#if ! defined (ACE_NEEDS_FUNC_DEFINITIONS)
int
ACE_Message_Queue_Vx::peek_dequeue_head (ACE_Message_Block *&,
ACE_Time_Value *tv)
{
ACE_UNUSED_ARG (tv);
ACE_NOTSUP_RETURN (-1);
}
#endif /* ! ACE_NEEDS_FUNC_DEFINITIONS */
#endif /* VXWORKS */
#if defined (ACE_WIN32) && (ACE_HAS_WINNT4 != 0)
ACE_Message_Queue_NT::ACE_Message_Queue_NT (DWORD max_threads)
: max_cthrs_ (max_threads),
cur_thrs_ (0),
cur_bytes_ (0),
cur_length_ (0),
cur_count_ (0),
completion_port_ (ACE_INVALID_HANDLE)
{
ACE_TRACE ("ACE_Message_Queue_NT::ACE_Message_Queue_NT");
this->open (max_threads);
}
int
ACE_Message_Queue_NT::open (DWORD max_threads)
{
ACE_TRACE ("ACE_Message_Queue_NT::open");
this->max_cthrs_ = max_threads;
this->completion_port_ = ::CreateIoCompletionPort (ACE_INVALID_HANDLE,
0,
ACE_Message_Queue_Base::WAS_ACTIVE,
max_threads);
return (this->completion_port_ == 0 ? -1 : 0);
}
int
ACE_Message_Queue_NT::close (void)
{
ACE_TRACE ("ACE_Message_Queue_NT::close");
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
this->deactivate ();
return (::CloseHandle (this->completion_port_) ? 0 : -1 );
}
ACE_Message_Queue_NT::~ACE_Message_Queue_NT (void)
{
ACE_TRACE ("ACE_Message_Queue_NT::~ACE_Message_Queue_NT");
this->close ();
}
int
ACE_Message_Queue_NT::enqueue (ACE_Message_Block *new_item,
ACE_Time_Value *)
{
ACE_TRACE ("ACE_Message_Queue_NT::enqueue");
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
if (this->state_ != ACE_Message_Queue_Base::DEACTIVATED)
{
size_t msize = new_item->total_size ();
size_t mlength = new_item->total_length ();
// Note - we send ACTIVATED in the 3rd arg to tell the completion
// routine it's _NOT_ being woken up because of deactivate().
#if defined (ACE_WIN64)
ULONG_PTR state_to_post;
#else
DWORD state_to_post;
#endif /* ACE_WIN64 */
state_to_post = ACE_Message_Queue_Base::ACTIVATED;
if (::PostQueuedCompletionStatus (this->completion_port_,
ACE_static_cast (DWORD, msize),
state_to_post,
ACE_reinterpret_cast (LPOVERLAPPED, new_item)))
{
// Update the states once I succeed.
this->cur_bytes_ += msize;
this->cur_length_ += mlength;
return ++this->cur_count_;
}
}
else
errno = ESHUTDOWN;
// Fail to enqueue the message.
return -1;
}
int
ACE_Message_Queue_NT::dequeue (ACE_Message_Block *&first_item,
ACE_Time_Value *timeout)
{
ACE_TRACE ("ACE_Message_Queue_NT::dequeue_head");
{
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
// Make sure the MQ is not deactivated before proceeding.
if (this->state_ == ACE_Message_Queue_Base::DEACTIVATED)
{
errno = ESHUTDOWN; // Operation on deactivated MQ not allowed.
return -1;
}
else
++this->cur_thrs_; // Increase the waiting thread count.
}
#if defined (ACE_WIN64)
ULONG_PTR queue_state;
#else
DWORD queue_state;
#endif /* ACE_WIN64 */
DWORD msize;
// Get a message from the completion port.
int retv = ::GetQueuedCompletionStatus (this->completion_port_,
&msize,
&queue_state,
ACE_reinterpret_cast (LPOVERLAPPED *, &first_item),
(timeout == 0 ? INFINITE : timeout->msec ()));
{
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
--this->cur_thrs_; // Decrease waiting thread count.
if (retv)
{
if (queue_state == ACE_Message_Queue_Base::ACTIVATED)
{ // Really get a valid MB from the queue.
--this->cur_count_;
this->cur_bytes_ -= msize;
this->cur_length_ -= first_item->total_length ();
return this->cur_count_;
}
else // Woken up by deactivate () or pulse ().
errno = ESHUTDOWN;
}
}
return -1;
}
int
ACE_Message_Queue_NT::deactivate (void)
{
ACE_TRACE ("ACE_Message_Queue_NT::deactivate");
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
int previous_state = this->state_;
if (previous_state != ACE_Message_Queue_Base::DEACTIVATED)
{
this->state_ = ACE_Message_Queue_Base::DEACTIVATED;
// Get the number of shutdown messages necessary to wake up all
// waiting threads.
DWORD cntr =
this->cur_thrs_ - ACE_static_cast (DWORD, this->cur_count_);
while (cntr-- > 0)
::PostQueuedCompletionStatus (this->completion_port_,
0,
this->state_,
0);
}
return previous_state;
}
int
ACE_Message_Queue_NT::activate (void)
{
ACE_TRACE ("ACE_Message_Queue_NT::activate");
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
int previous_status = this->state_;
this->state_ = ACE_Message_Queue_Base::ACTIVATED;
return previous_status;
}
int
ACE_Message_Queue_NT::pulse (void)
{
ACE_TRACE ("ACE_Message_Queue_NT::pulse");
ACE_GUARD_RETURN (ACE_Thread_Mutex, ace_mon, this->lock_, -1);
int previous_state = this->state_;
if (previous_state != ACE_Message_Queue_Base::DEACTIVATED)
{
this->state_ = ACE_Message_Queue_Base::PULSED;
// Get the number of shutdown messages necessary to wake up all
// waiting threads.
DWORD cntr =
this->cur_thrs_ - ACE_static_cast (DWORD, this->cur_count_);
while (cntr-- > 0)
::PostQueuedCompletionStatus (this->completion_port_,
0,
this->state_,
0);
}
return previous_state;
}
void
ACE_Message_Queue_NT::dump (void) const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Message_Queue_NT::dump");
ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
switch (this->state_)
{
case ACE_Message_Queue_Base::ACTIVATED:
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("state = ACTIVATED\n")));
break;
case ACE_Message_Queue_Base::DEACTIVATED:
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("state = DEACTIVATED\n")));
break;
case ACE_Message_Queue_Base::PULSED:
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("state = PULSED\n")));
break;
}
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("max_cthrs_ = %d\n")
ACE_LIB_TEXT ("cur_thrs_ = %d\n")
ACE_LIB_TEXT ("cur_bytes = %d\n")
ACE_LIB_TEXT ("cur_length = %d\n")
ACE_LIB_TEXT ("cur_count = %d\n")
ACE_LIB_TEXT ("completion_port_ = %x\n"),
this->max_cthrs_,
this->cur_thrs_,
this->cur_bytes_,
this->cur_length_,
this->cur_count_,
this->completion_port_));
ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
#endif /* ACE_HAS_DUMP */
}
#endif /* ACE_WIN32 && ACE_HAS_WINNT4 != 0 */
#endif /* ACE_MESSAGE_QUEUE_C */
|