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
|
//=============================================================================
/**
* @file Simple_Message_Block_Test.cpp
*
* $Id: Simple_Message_Block_Test.cpp 93638 2011-03-24 13:16:05Z johnnyw $
*
* This test program is a torture test that illustrates how
* ACE_Message_Block reference counting works, how and when locks
* are used, how memory is managed, and how continuation chains
* of message blocks are made. Ideally used with purify :-)
*
*
* @author Irfan Pyarali <irfan@cs.wustl.edu>
*/
//=============================================================================
#include "test_config.h"
#include "ace/Message_Block.h"
#include "ace/Synch_Traits.h"
#include "ace/Lock_Adapter_T.h"
#include "ace/OS_NS_string.h"
#include "ace/Thread_Mutex.h"
int
run_main (int, ACE_TCHAR *[])
{
ACE_START_TEST (ACE_TEXT ("Simple_Message_Block_Test"));
{
// Checks normal stack deletes.
ACE_Message_Block mb;
}
{
// Checks normal heap deletes.
ACE_Message_Block *mb = 0;
ACE_NEW_RETURN (mb, ACE_Message_Block, -1);
mb->release ();
}
{
// Checks continuation of message blocks on the stack.
ACE_Message_Block mb1 (1024);
ACE_Message_Block mb2 (1024);
mb1.cont (&mb2);
}
{
// Checks continuation of message blocks on the heap.
ACE_Message_Block *mb1;
ACE_Message_Block *mb2;
ACE_NEW_RETURN (mb1, ACE_Message_Block (1024), -1);
ACE_NEW_RETURN (mb2, ACE_Message_Block (1024), -1);
mb1->cont (mb2);
mb1->release ();
}
// Same set of tests but with locking_strategy set.
{
ACE_Lock_Adapter <ACE_SYNCH_MUTEX> mutex;
ACE_Lock *lock = &mutex;
{
// Checks normal stack deletes.
ACE_Message_Block mb;
mb.locking_strategy (lock);
}
{
// Checks normal heap deletes.
ACE_Message_Block *mb = 0;
ACE_NEW_RETURN (mb, ACE_Message_Block, -1);
mb->locking_strategy (lock);
mb->release ();
}
{
// Checks continuation of message blocks on the stack with one
// lock strategy.
ACE_Message_Block mb1 (1024);
ACE_Message_Block mb2 (1024);
mb1.locking_strategy (lock);
mb1.cont (&mb2);
}
{
// Checks continuation of message blocks on the heap with one
// lock strategy.
ACE_Message_Block *mb1;
ACE_Message_Block *mb2;
ACE_NEW_RETURN (mb1, ACE_Message_Block (1024), -1);
ACE_NEW_RETURN (mb2, ACE_Message_Block (1024), -1);
mb1->locking_strategy (lock);
mb1->cont (mb2);
mb1->release ();
}
{
// Checks continuation of message blocks on the stack with two
// lock strategy.
ACE_Message_Block mb1 (1024);
ACE_Message_Block mb2 (1024);
mb1.locking_strategy (lock);
mb2.locking_strategy (lock);
mb1.cont (&mb2);
}
{
// Checks continuation of message blocks on the heap with two
// lock strategy
ACE_Message_Block *mb1;
ACE_Message_Block *mb2;
ACE_NEW_RETURN (mb1, ACE_Message_Block (1024), -1);
ACE_NEW_RETURN (mb2, ACE_Message_Block (1024), -1);
mb1->locking_strategy (lock);
mb2->locking_strategy (lock);
mb1->cont (mb2);
mb1->release ();
}
{
// Checks continuation of message blocks on the heap with two
// lock strategy where the second one is a duplicate of the
// first
ACE_Message_Block *mb1;
ACE_NEW_RETURN (mb1, ACE_Message_Block (1024), -1);
mb1->locking_strategy (lock);
ACE_Message_Block *mb2 = mb1->duplicate ();
mb1->cont (mb2);
mb1->release ();
}
}
{
// Checks continuation of message blocks on the heap with two
// different lock strategies
ACE_Lock_Adapter <ACE_SYNCH_MUTEX> lock1;
ACE_Lock_Adapter <ACE_SYNCH_MUTEX> lock2;
ACE_Message_Block *mb1;
ACE_Message_Block *mb2;
ACE_NEW_RETURN (mb1, ACE_Message_Block (1024), -1);
ACE_NEW_RETURN (mb2, ACE_Message_Block (1024), -1);
mb1->locking_strategy (&lock1);
mb2->locking_strategy (&lock2);
mb1->cont (mb2);
mb1->release ();
}
{
// Checks failure of copy when "virtual" allocation (using mark)
// is too small
char message[]="abcdefghijklmnop";
ACE_Message_Block mb1 (ACE_OS::strlen (message) + 1);
ACE_Message_Block mb2 (ACE_OS::strlen (message) + 1);
// Resize mb2 so that we mark for use less than the allocated buffer
if (mb2.size (ACE_OS::strlen (message) + 1 - 10) == -1)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) Resize test failed ..\n")));
}
// We expect this to succeed
if (mb1.copy (message, ACE_OS::strlen (message) + 1) == -1)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) Copy test failed ..\n")));
}
// We expect this to fail
if (mb2.copy (message, ACE_OS::strlen (message) + 1) != -1)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) Copy test succeeded when it should have failed ..\n")));
}
// We also expect this to fail
if (mb2.copy (message) != -1)
{
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%P|%t) Copy test succeeded when it should have failed ..\n")));
}
}
ACE_END_TEST;
return 0;
}
|
