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
|
// $Id$
// ============================================================================
//
// = LIBRARY
// tests
//
// = FILENAME
// Timer_Queue_Test.cpp
//
// = DESCRIPTION
// This is a simple test of <ACE_Timer_Queue> and two of its
// subclasses (<ACE_Timer_List> and <ACE_Timer_Heap>). The test
// sets up a bunch of timers and then adds them to a timer
// queue. The functionality of the timer queue is then tested. No
// command line arguments are needed to run the test.
//
// = AUTHOR
// Prashant Jain and Douglas C. Schmidt
//
// ============================================================================
#include "ace/Profile_Timer.h"
#include "ace/Timer_List.h"
#include "ace/Timer_Heap.h"
#include "test_config.h"
// Number of iterations for the performance tests.
static int max_iterations = ACE_DEFAULT_TIMERS * 100 ;
// Keep track of the timer ids that were assigned to us.
static int *timer_ids = 0;
class Example_Handler : public ACE_Event_Handler
{
public:
virtual int handle_timeout (const ACE_Time_Value &,
const void *arg)
{
ACE_ASSERT ((int) arg == 42);
return 0;
}
};
static void
test_functionality (ACE_Timer_Queue *tq)
{
Example_Handler eh;
ACE_ASSERT (tq->is_empty ());
ACE_ASSERT (ACE_Time_Value::zero == ACE_Time_Value (0));
int timer_id;
timer_id = tq->schedule (&eh, (const void *) 1, ACE_OS::gettimeofday ());
ACE_ASSERT (timer_id != -1);
ACE_ASSERT (tq->schedule (&eh, (const void *) 42,
ACE_OS::gettimeofday ()) != -1);
ACE_ASSERT (tq->schedule (&eh, (const void *) 42,
ACE_OS::gettimeofday ()) != -1);
ACE_ASSERT (tq->cancel (timer_id) == 1);
ACE_ASSERT (tq->is_empty () == 0);
ACE_ASSERT (tq->expire () == 2);
ACE_ASSERT (tq->schedule (&eh, (const void *) 4, ACE_OS::gettimeofday
()) != -1);
ACE_ASSERT (tq->schedule (&eh, (const void *) 5, ACE_OS::gettimeofday
()) != -1);
ACE_ASSERT (tq->cancel (&eh) == 2);
ACE_ASSERT (tq->is_empty ());
ACE_ASSERT (tq->expire () == 0);
}
static void
test_performance (ACE_Timer_Queue *tq,
const char *test_name)
{
Example_Handler eh;
ACE_Profile_Timer timer;
int i;
ACE_ASSERT (tq->is_empty ());
ACE_ASSERT (ACE_Time_Value::zero == ACE_Time_Value (0));
// Test the amount of time required to schedule all the timers.
timer.start ();
for (i = 0; i < max_iterations; i++)
{
timer_ids[i] = tq->schedule (&eh, (const void *) 42, ACE_OS::gettimeofday ());
ACE_ASSERT (timer_ids[i] != -1);
}
ACE_ASSERT (tq->is_empty () == 0);
timer.stop ();
ACE_Profile_Timer::ACE_Elapsed_Time et;
timer.elapsed_time (et);
ACE_DEBUG ((LM_DEBUG, "time to schedule %d timers for %s\n",
max_iterations, test_name));
ACE_DEBUG ((LM_DEBUG, "real time = %f secs, user time = %f secs, system time = %f secs\n",
et.real_time, et.user_time, et.system_time));
ACE_DEBUG ((LM_DEBUG, "time per call = %f usecs\n",
(et.user_time / double (max_iterations)) * 1000000));
// Test the amount of time required to cancel all the timers. We
// start from the "back" in order to measure the worst case
// performance for the <ACE_Timer_List> (which uses linear search).
timer.start ();
for (i = max_iterations - 1; i >= 0; i--)
tq->cancel (timer_ids[i]);
ACE_ASSERT (tq->is_empty ());
timer.stop ();
timer.elapsed_time (et);
ACE_DEBUG ((LM_DEBUG, "time to cancel %d timers for %s\n",
max_iterations, test_name));
ACE_DEBUG ((LM_DEBUG, "real time = %f secs, user time = %f secs, system time = %f secs\n",
et.real_time, et.user_time, et.system_time));
ACE_DEBUG ((LM_DEBUG, "time per call = %f usecs\n",
(et.user_time / double (max_iterations)) * 1000000));
// Test the amount of time required to schedule and expire all the
// timers.
timer.start ();
for (i = 0; i < max_iterations; i++)
ACE_ASSERT (tq->schedule (&eh, (const void *) 42, ACE_OS::gettimeofday ()) != -1);
ACE_ASSERT (tq->is_empty () == 0);
// Expire all the timers.
tq->expire ();
timer.stop ();
timer.elapsed_time (et);
ACE_DEBUG ((LM_DEBUG, "time to schedule and expire %d timers for %s\n",
max_iterations, test_name));
ACE_DEBUG ((LM_DEBUG, "real time = %f secs, user time = %f secs, system time = %f secs\n",
et.real_time, et.user_time, et.system_time));
ACE_DEBUG ((LM_DEBUG, "time per call = %f usecs\n",
(et.user_time / double (max_iterations)) * 1000000));
}
struct Timer_Queues
{
ACE_Timer_Queue *queue_;
// Pointer to the subclass of <ACE_Timer_Queue> that we're testing.
const char *name_;
// Name of the Queue that we're testing.
};
static Timer_Queues timer_queues[] =
{
{ 0, "ACE_Timer_Heap (preallocated)" },
{ 0, "ACE_Timer_Heap (non-preallocated)" },
{ new ACE_Timer_List, "ACE_Timer_List" },
{ 0, 0 },
};
int
main (int argc, char *argv[])
{
ACE_START_TEST ("Timer_Queue_Test");
if (argc > 1)
max_iterations = ACE_OS::atoi (argv[1]);
// Preallocate memory.
ACE_NEW_RETURN (timer_queues[0].queue_,
ACE_Timer_Heap (ACE_DEFAULT_TIMERS, 1),
// ACE_Timer_Heap (max_iterations, 1),
-1);
// Don't preallocate memory.
ACE_NEW_RETURN (timer_queues[1].queue_,
ACE_Timer_Heap,
// ACE_Timer_Heap (max_iterations),
-1);
ACE_NEW_RETURN (timer_ids,
int[max_iterations],
-1);
for (int i = 0; timer_queues[i].name_ != 0; i++)
{
ACE_DEBUG ((LM_DEBUG, "**** starting test of %s\n",
timer_queues[i].name_));
test_performance (timer_queues[i].queue_, timer_queues[i].name_);
test_functionality (timer_queues[i].queue_);
delete timer_queues[i].queue_;
}
ACE_END_TEST;
return 0;
}
|
