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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// tests
//
// = FILENAME
// Message_Queue_Test.cpp
//
// = DESCRIPTION
// This is a simple test of the ACE_Message_Queue that
// illustrates how to use the forward and reverse iterators.
//
// = AUTHOR
// Irfan Pyarali
//
// ============================================================================
#include "test_config.h"
#include "ace/Message_Queue.h"
#include "ace/Synch.h"
typedef ACE_Message_Queue <ACE_NULL_SYNCH> QUEUE;
typedef ACE_Message_Queue_Iterator <ACE_NULL_SYNCH> ITERATOR;
typedef ACE_Message_Queue_Reverse_Iterator <ACE_NULL_SYNCH> REVERSE_ITERATOR;
int
main (int, char *[])
{
ACE_START_TEST ("Message_Queue_Test");
const int ITERATIONS = 5;
char buffer[ITERATIONS][BUFSIZ];
QUEUE queue (32 * 1024);
int i;
for (i = 0; i < ITERATIONS; i++)
{
ACE_OS::sprintf (buffer[i], "%d", i+1);
ACE_Message_Block *entry;
ACE_NEW_RETURN (entry, ACE_Message_Block (buffer[i], sizeof buffer[i]), -1);
if (queue.is_full ())
ACE_ERROR_RETURN ((LM_ERROR,
"QUEUE:: the message queue is full on iteration %u!\n",
i+1),
-1);
if (queue.enqueue (entry) == -1)
ACE_ERROR_RETURN ((LM_ERROR, "QUEUE::enqueue\n"), -1);
}
ACE_DEBUG ((LM_DEBUG, "\nForward Iterations\n"));
{
ITERATOR iterator (queue);
for (ACE_Message_Block *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
ACE_DEBUG ((LM_DEBUG, "%s\n", entry->base ()));
}
ACE_DEBUG ((LM_DEBUG, "\nReverse Iterations\n"));
{
REVERSE_ITERATOR iterator (queue);
for (ACE_Message_Block *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
ACE_DEBUG ((LM_DEBUG, "%s\n", entry->base ()));
}
ACE_DEBUG ((LM_DEBUG, "\nForward Iterations\n"));
{
QUEUE::ITERATOR iterator (queue);
for (ACE_Message_Block *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
ACE_DEBUG ((LM_DEBUG, "%s\n", entry->base ()));
}
ACE_DEBUG ((LM_DEBUG, "\nReverse Iterations\n"));
{
QUEUE::REVERSE_ITERATOR iterator (queue);
for (ACE_Message_Block *entry = 0;
iterator.next (entry) != 0;
iterator.advance ())
ACE_DEBUG ((LM_DEBUG, "%s\n", entry->base ()));
}
ACE_END_TEST;
return 0;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
template class ACE_Message_Queue_Iterator<ACE_NULL_SYNCH>;
template class ACE_Message_Queue_Reverse_Iterator<ACE_NULL_SYNCH>;
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#pragma instantiate ACE_Message_Queue_Iterator<ACE_NULL_SYNCH>
#pragma instantiate ACE_Message_Queue_Reverse_Iterator<ACE_NULL_SYNCH>
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
|
