summaryrefslogtreecommitdiff
path: root/tests/Message_Queue_Test.cpp
blob: 6a57250e3eeb9bcae5a1d6f8d1a2b1002d8e1e69 (plain)
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
#include "ace/Message_Queue.h"
#include "ace/Synch.h"
#include <iostream.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 ()
{
  const int ITERATIONS = 5;
  QUEUE queue;

  for (int i = 1; i <= ITERATIONS; i++)
    {
      char *buffer = new char[BUFSIZ];
      sprintf (buffer, "%d", i);
      ACE_Message_Block *entry = new ACE_Message_Block (buffer, sizeof buffer);
      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 ()));
      }  
  }

  return 0;
}