|
sl@0
|
1 |
// Copyright (c) 2002-2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
2 |
// All rights reserved.
|
|
sl@0
|
3 |
// This component and the accompanying materials are made available
|
|
sl@0
|
4 |
// under the terms of the License "Eclipse Public License v1.0"
|
|
sl@0
|
5 |
// which accompanies this distribution, and is available
|
|
sl@0
|
6 |
// at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
7 |
//
|
|
sl@0
|
8 |
// Initial Contributors:
|
|
sl@0
|
9 |
// Nokia Corporation - initial contribution.
|
|
sl@0
|
10 |
//
|
|
sl@0
|
11 |
// Contributors:
|
|
sl@0
|
12 |
//
|
|
sl@0
|
13 |
// Description:
|
|
sl@0
|
14 |
// e32test\mqueue\t_mqueue.cpp
|
|
sl@0
|
15 |
// Overview:
|
|
sl@0
|
16 |
// Test message queuing
|
|
sl@0
|
17 |
// API Information:
|
|
sl@0
|
18 |
// RMsgQueue, RMsgQueueBase
|
|
sl@0
|
19 |
// Details:
|
|
sl@0
|
20 |
// - Create various illegal and legal private message queues and verify
|
|
sl@0
|
21 |
// results are as expected. Test private message queue functionality in
|
|
sl@0
|
22 |
// both single threaded tests and multi-threaded tests.
|
|
sl@0
|
23 |
// - Create various illegal and legal global named message queues and verify
|
|
sl@0
|
24 |
// results are as expected. Test global named message queue functionality
|
|
sl@0
|
25 |
// in both single threaded tests and multi-threaded tests.
|
|
sl@0
|
26 |
// - Test multi-process queues and template based queues, verify results are
|
|
sl@0
|
27 |
// as expected.
|
|
sl@0
|
28 |
// Platforms/Drives/Compatibility:
|
|
sl@0
|
29 |
// All.
|
|
sl@0
|
30 |
// Assumptions/Requirement/Pre-requisites:
|
|
sl@0
|
31 |
// Failures and causes:
|
|
sl@0
|
32 |
// Base Port information:
|
|
sl@0
|
33 |
//
|
|
sl@0
|
34 |
//
|
|
sl@0
|
35 |
|
|
sl@0
|
36 |
#include <e32test.h>
|
|
sl@0
|
37 |
#include <e32svr.h>
|
|
sl@0
|
38 |
#include <e32msgqueue.h>
|
|
sl@0
|
39 |
#include <f32file.h>
|
|
sl@0
|
40 |
|
|
sl@0
|
41 |
LOCAL_D RTest test(_L("t_mqueue"));
|
|
sl@0
|
42 |
|
|
sl@0
|
43 |
//if the test is to run under the debugger, uncomment the following line
|
|
sl@0
|
44 |
//#define _DEBUGGER_BUILD
|
|
sl@0
|
45 |
|
|
sl@0
|
46 |
const TInt KHeapSize=0x2000;
|
|
sl@0
|
47 |
const TInt KTestValue = 42;
|
|
sl@0
|
48 |
_LIT8(KFillPattern, "1234567890");
|
|
sl@0
|
49 |
|
|
sl@0
|
50 |
_LIT(KGLobalName1, "GlobalMessageQueue1");
|
|
sl@0
|
51 |
|
|
sl@0
|
52 |
|
|
sl@0
|
53 |
LOCAL_C void SingleThreadedTests(RMsgQueueBase& aQueue, TInt aSlots, TInt aSize)
|
|
sl@0
|
54 |
{
|
|
sl@0
|
55 |
test.Printf(_L("Single Threaded Tests"));
|
|
sl@0
|
56 |
|
|
sl@0
|
57 |
|
|
sl@0
|
58 |
TRequestStatus stat;
|
|
sl@0
|
59 |
test.Next(_L("test CancelDataAvailable"));
|
|
sl@0
|
60 |
aQueue.NotifyDataAvailable(stat);
|
|
sl@0
|
61 |
test (stat == KRequestPending);
|
|
sl@0
|
62 |
aQueue.CancelDataAvailable();
|
|
sl@0
|
63 |
User::WaitForRequest(stat);
|
|
sl@0
|
64 |
test (stat == KErrCancel);
|
|
sl@0
|
65 |
|
|
sl@0
|
66 |
TUint8 * pSourceData = (TUint8*)User::Alloc(aSize*2);
|
|
sl@0
|
67 |
test(pSourceData != NULL);
|
|
sl@0
|
68 |
TPtr8 pS(pSourceData, aSize*2, aSize*2);
|
|
sl@0
|
69 |
pS.Repeat(KFillPattern);
|
|
sl@0
|
70 |
|
|
sl@0
|
71 |
TUint8 * pDestinationData = (TUint8*)User::Alloc(aSize*2);
|
|
sl@0
|
72 |
test(pDestinationData != NULL);
|
|
sl@0
|
73 |
TPtr8 pD(pDestinationData, aSize*2, aSize*2);
|
|
sl@0
|
74 |
pD.FillZ();
|
|
sl@0
|
75 |
|
|
sl@0
|
76 |
|
|
sl@0
|
77 |
test.Next(_L("test MessageSize"));
|
|
sl@0
|
78 |
test(aQueue.MessageSize() == aSize);
|
|
sl@0
|
79 |
|
|
sl@0
|
80 |
|
|
sl@0
|
81 |
test.Next(_L("Send a legal message through"));
|
|
sl@0
|
82 |
TInt ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
83 |
test(ret == KErrNone);
|
|
sl@0
|
84 |
|
|
sl@0
|
85 |
test.Next(_L("Receive legal message"));
|
|
sl@0
|
86 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
87 |
test(ret == KErrNone);
|
|
sl@0
|
88 |
TPtr8 p(pS);
|
|
sl@0
|
89 |
p.SetLength(aSize);
|
|
sl@0
|
90 |
pD.SetLength(aSize);
|
|
sl@0
|
91 |
test(p == pD);
|
|
sl@0
|
92 |
pD.FillZ();
|
|
sl@0
|
93 |
|
|
sl@0
|
94 |
test.Next(_L("Send a short message through"));
|
|
sl@0
|
95 |
ret = aQueue.Send(pSourceData, aSize/2);
|
|
sl@0
|
96 |
test(ret == KErrNone);
|
|
sl@0
|
97 |
|
|
sl@0
|
98 |
test.Next(_L("Receive legal message"));
|
|
sl@0
|
99 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
100 |
test(ret == KErrNone);
|
|
sl@0
|
101 |
p.SetLength(aSize/2);
|
|
sl@0
|
102 |
pD.SetLength(aSize/2);
|
|
sl@0
|
103 |
test(p == pD);
|
|
sl@0
|
104 |
pD.FillZ();
|
|
sl@0
|
105 |
|
|
sl@0
|
106 |
test.Next(_L("Test Receive with no message"));
|
|
sl@0
|
107 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
108 |
test(ret == KErrUnderflow);
|
|
sl@0
|
109 |
|
|
sl@0
|
110 |
if (aSlots >= 2)
|
|
sl@0
|
111 |
{
|
|
sl@0
|
112 |
test.Next(_L("Send two legal messages through"));
|
|
sl@0
|
113 |
pS[0] = 0;
|
|
sl@0
|
114 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
115 |
test(ret == KErrNone);
|
|
sl@0
|
116 |
pS[0] = 1;
|
|
sl@0
|
117 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
118 |
test(ret == KErrNone);
|
|
sl@0
|
119 |
|
|
sl@0
|
120 |
test.Next(_L("Receive two legal messages in tx order"));
|
|
sl@0
|
121 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
122 |
test(ret == KErrNone);
|
|
sl@0
|
123 |
test(pD[0] == 0);
|
|
sl@0
|
124 |
pD.FillZ();
|
|
sl@0
|
125 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
126 |
test(ret == KErrNone);
|
|
sl@0
|
127 |
test(pD[0] == 1);
|
|
sl@0
|
128 |
pD.FillZ();
|
|
sl@0
|
129 |
|
|
sl@0
|
130 |
}
|
|
sl@0
|
131 |
|
|
sl@0
|
132 |
test.Next(_L("Test filling the queue to the max"));
|
|
sl@0
|
133 |
TInt x;
|
|
sl@0
|
134 |
for (x = 0; x < aSlots; x++)
|
|
sl@0
|
135 |
{
|
|
sl@0
|
136 |
pS[0] = (TUint8)x;
|
|
sl@0
|
137 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
138 |
test(ret == KErrNone);
|
|
sl@0
|
139 |
}
|
|
sl@0
|
140 |
|
|
sl@0
|
141 |
test.Next(_L("Test one too many sends"));
|
|
sl@0
|
142 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
143 |
test(ret == KErrOverflow);
|
|
sl@0
|
144 |
|
|
sl@0
|
145 |
test.Next(_L("test cancel SpaceAvailable"));
|
|
sl@0
|
146 |
aQueue.NotifySpaceAvailable(stat);
|
|
sl@0
|
147 |
test (stat == KRequestPending);
|
|
sl@0
|
148 |
aQueue.CancelSpaceAvailable();
|
|
sl@0
|
149 |
User::WaitForRequest(stat);
|
|
sl@0
|
150 |
test (stat == KErrCancel);
|
|
sl@0
|
151 |
|
|
sl@0
|
152 |
|
|
sl@0
|
153 |
test.Next(_L("Test emptying the queue"));
|
|
sl@0
|
154 |
|
|
sl@0
|
155 |
for (x = 0; x < aSlots; x++)
|
|
sl@0
|
156 |
{
|
|
sl@0
|
157 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
158 |
test(ret == KErrNone);
|
|
sl@0
|
159 |
test(pD[0] == (TUint8)x );
|
|
sl@0
|
160 |
pD.FillZ();
|
|
sl@0
|
161 |
}
|
|
sl@0
|
162 |
|
|
sl@0
|
163 |
test.Next(_L("test cancel DataAvailable"));
|
|
sl@0
|
164 |
aQueue.NotifyDataAvailable(stat);
|
|
sl@0
|
165 |
test (stat == KRequestPending);
|
|
sl@0
|
166 |
aQueue.CancelDataAvailable();
|
|
sl@0
|
167 |
User::WaitForRequest(stat);
|
|
sl@0
|
168 |
test (stat == KErrCancel);
|
|
sl@0
|
169 |
|
|
sl@0
|
170 |
test.Next(_L("Test one too many receives"));
|
|
sl@0
|
171 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
172 |
test(ret == KErrUnderflow);
|
|
sl@0
|
173 |
|
|
sl@0
|
174 |
|
|
sl@0
|
175 |
test.Next(_L("Test wrap around"));
|
|
sl@0
|
176 |
test.Printf(_L("fill queue to max\n"));
|
|
sl@0
|
177 |
for (x = 0; x < aSlots; x++)
|
|
sl@0
|
178 |
{
|
|
sl@0
|
179 |
pS[0] = (TUint8)x;
|
|
sl@0
|
180 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
181 |
test(ret == KErrNone);
|
|
sl@0
|
182 |
}
|
|
sl@0
|
183 |
|
|
sl@0
|
184 |
test.Printf(_L("half empty the queue\n"));
|
|
sl@0
|
185 |
for (x = 0; x < aSlots/2; x++)
|
|
sl@0
|
186 |
{
|
|
sl@0
|
187 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
188 |
test(ret == KErrNone);
|
|
sl@0
|
189 |
test(pD[0] == (TUint8)x);
|
|
sl@0
|
190 |
pD.FillZ();
|
|
sl@0
|
191 |
}
|
|
sl@0
|
192 |
|
|
sl@0
|
193 |
test.Printf(_L("fill queue to max\n"));
|
|
sl@0
|
194 |
for (x = 0; x < aSlots/2; x++)
|
|
sl@0
|
195 |
{
|
|
sl@0
|
196 |
pS[0] = (TUint8)x;
|
|
sl@0
|
197 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
198 |
test (ret == KErrNone);
|
|
sl@0
|
199 |
}
|
|
sl@0
|
200 |
ret = aQueue.Send(pSourceData, aSize);
|
|
sl@0
|
201 |
test (ret == KErrOverflow);
|
|
sl@0
|
202 |
|
|
sl@0
|
203 |
test.Printf(_L("empty the queue\n"));
|
|
sl@0
|
204 |
for (x = aSlots/2; x < aSlots; x++)
|
|
sl@0
|
205 |
{
|
|
sl@0
|
206 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
207 |
test(ret == KErrNone);
|
|
sl@0
|
208 |
test(pD[0] == (TUint8)x);
|
|
sl@0
|
209 |
}
|
|
sl@0
|
210 |
for (x = 0; x < aSlots/2; x++)
|
|
sl@0
|
211 |
{
|
|
sl@0
|
212 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
213 |
test(ret == KErrNone);
|
|
sl@0
|
214 |
test(pD[0] == (TUint8)x);
|
|
sl@0
|
215 |
}
|
|
sl@0
|
216 |
|
|
sl@0
|
217 |
test.Next(_L("Test queue is empty"));
|
|
sl@0
|
218 |
ret = aQueue.Receive(pDestinationData, aSize);
|
|
sl@0
|
219 |
test(ret == KErrUnderflow);
|
|
sl@0
|
220 |
|
|
sl@0
|
221 |
User::Free(pSourceData);
|
|
sl@0
|
222 |
User::Free(pDestinationData);
|
|
sl@0
|
223 |
}
|
|
sl@0
|
224 |
|
|
sl@0
|
225 |
|
|
sl@0
|
226 |
_LIT(KThread2Name, "thread2");
|
|
sl@0
|
227 |
_LIT(KThread3Name, "thread3");
|
|
sl@0
|
228 |
_LIT(KThread4Name, "thread4");
|
|
sl@0
|
229 |
|
|
sl@0
|
230 |
|
|
sl@0
|
231 |
class TData
|
|
sl@0
|
232 |
{
|
|
sl@0
|
233 |
public:
|
|
sl@0
|
234 |
TData(RMsgQueueBase* aQ, TInt aSize, TInt aSlots,TInt aTest=0, TAny* aData=NULL);
|
|
sl@0
|
235 |
RMsgQueueBase* iQueue;
|
|
sl@0
|
236 |
TInt iSize;
|
|
sl@0
|
237 |
TInt iSlots;
|
|
sl@0
|
238 |
TInt iTest;
|
|
sl@0
|
239 |
TAny* iData;
|
|
sl@0
|
240 |
};
|
|
sl@0
|
241 |
|
|
sl@0
|
242 |
TData::TData(RMsgQueueBase* aQ, TInt aSize, TInt aSlots, TInt aTest, TAny* aData) : iQueue(aQ), iSize(aSize),
|
|
sl@0
|
243 |
iSlots(aSlots), iTest(aTest), iData(aData)
|
|
sl@0
|
244 |
{
|
|
sl@0
|
245 |
//empty
|
|
sl@0
|
246 |
};
|
|
sl@0
|
247 |
|
|
sl@0
|
248 |
|
|
sl@0
|
249 |
|
|
sl@0
|
250 |
LOCAL_C TInt illegalSendEntryPoint(TAny* aData)
|
|
sl@0
|
251 |
{
|
|
sl@0
|
252 |
|
|
sl@0
|
253 |
TData& data = *(TData *)aData;
|
|
sl@0
|
254 |
|
|
sl@0
|
255 |
switch (data.iTest)
|
|
sl@0
|
256 |
{
|
|
sl@0
|
257 |
case 0:
|
|
sl@0
|
258 |
data.iQueue->Send(data.iData, data.iSize*2); //should panic, message size incorrect
|
|
sl@0
|
259 |
break;
|
|
sl@0
|
260 |
|
|
sl@0
|
261 |
case 1:
|
|
sl@0
|
262 |
#ifdef _DEBUGGER_BUILD
|
|
sl@0
|
263 |
#pragma message ("BUILT FOR DEBUGGER")
|
|
sl@0
|
264 |
User::Panic(_L("test"),ECausedException);
|
|
sl@0
|
265 |
#else
|
|
sl@0
|
266 |
data.iQueue->Send((TAny*)0xfeed, data.iSize); //should panic
|
|
sl@0
|
267 |
#endif
|
|
sl@0
|
268 |
break;
|
|
sl@0
|
269 |
|
|
sl@0
|
270 |
case 2:
|
|
sl@0
|
271 |
#ifdef _DEBUGGER_BUILD
|
|
sl@0
|
272 |
#pragma message ("BUILT FOR DEBUGGER")
|
|
sl@0
|
273 |
User::Panic(_L("test"),ECausedException);
|
|
sl@0
|
274 |
#else
|
|
sl@0
|
275 |
data.iQueue->Send((TAny*)0xDEDEDEDE, data.iSize); //dodgy address
|
|
sl@0
|
276 |
#endif
|
|
sl@0
|
277 |
break;
|
|
sl@0
|
278 |
}
|
|
sl@0
|
279 |
|
|
sl@0
|
280 |
test(0); //should never get here. This'll make a Kern Exec 0! as tries to use console from different thread
|
|
sl@0
|
281 |
return 0;
|
|
sl@0
|
282 |
}
|
|
sl@0
|
283 |
|
|
sl@0
|
284 |
|
|
sl@0
|
285 |
LOCAL_C TInt illegalReceiveEntryPoint(TAny* aData)
|
|
sl@0
|
286 |
{
|
|
sl@0
|
287 |
|
|
sl@0
|
288 |
TData& data = *(TData *)aData;
|
|
sl@0
|
289 |
TUint8 buf[256];
|
|
sl@0
|
290 |
|
|
sl@0
|
291 |
switch (data.iTest)
|
|
sl@0
|
292 |
{
|
|
sl@0
|
293 |
case 0:
|
|
sl@0
|
294 |
data.iQueue->Receive(buf, data.iSize*2); //should panic, message size incorrect
|
|
sl@0
|
295 |
break;
|
|
sl@0
|
296 |
|
|
sl@0
|
297 |
case 1:
|
|
sl@0
|
298 |
#ifdef _DEBUGGER_BUILD
|
|
sl@0
|
299 |
#pragma message ("BUILT FOR DEBUGGER")
|
|
sl@0
|
300 |
User::Panic(_L("test"),ECausedException);
|
|
sl@0
|
301 |
#else
|
|
sl@0
|
302 |
data.iQueue->Receive((TAny*)0xfeed, data.iSize); //should panic
|
|
sl@0
|
303 |
#endif
|
|
sl@0
|
304 |
break;
|
|
sl@0
|
305 |
|
|
sl@0
|
306 |
case 2:
|
|
sl@0
|
307 |
#ifdef _DEBUGGER_BUILD
|
|
sl@0
|
308 |
#pragma message ("BUILT FOR DEBUGGER")
|
|
sl@0
|
309 |
User::Panic(_L("test"),ECausedException);
|
|
sl@0
|
310 |
#else
|
|
sl@0
|
311 |
data.iQueue->Receive((TAny*)0xDEDEDEDE, data.iSize); //dodgy address
|
|
sl@0
|
312 |
#endif
|
|
sl@0
|
313 |
break;
|
|
sl@0
|
314 |
|
|
sl@0
|
315 |
}
|
|
sl@0
|
316 |
|
|
sl@0
|
317 |
test(0); //should never get here. This'll make a Kern Exec 0!
|
|
sl@0
|
318 |
return 0;
|
|
sl@0
|
319 |
}
|
|
sl@0
|
320 |
|
|
sl@0
|
321 |
|
|
sl@0
|
322 |
|
|
sl@0
|
323 |
LOCAL_C TInt sendBlockingEntryPoint(TAny* aData)
|
|
sl@0
|
324 |
{
|
|
sl@0
|
325 |
TData& data = *(TData *)aData;
|
|
sl@0
|
326 |
|
|
sl@0
|
327 |
TInt d = KTestValue;
|
|
sl@0
|
328 |
data.iQueue->SendBlocking(&d, 4);
|
|
sl@0
|
329 |
return KErrNone;
|
|
sl@0
|
330 |
}
|
|
sl@0
|
331 |
|
|
sl@0
|
332 |
LOCAL_C TInt receiveBlockingEntryPoint(TAny* aData)
|
|
sl@0
|
333 |
{
|
|
sl@0
|
334 |
TData& data = *(TData *)aData;
|
|
sl@0
|
335 |
|
|
sl@0
|
336 |
TUint8 pData[256];
|
|
sl@0
|
337 |
TPtr8 pD(pData, data.iSize, data.iSize);
|
|
sl@0
|
338 |
pD.FillZ();
|
|
sl@0
|
339 |
data.iQueue->ReceiveBlocking(pData, data.iSize);
|
|
sl@0
|
340 |
test (*(TInt*)pData == KTestValue);
|
|
sl@0
|
341 |
return KErrNone;
|
|
sl@0
|
342 |
}
|
|
sl@0
|
343 |
|
|
sl@0
|
344 |
|
|
sl@0
|
345 |
LOCAL_C TInt notifyDataAvailableEntryPoint(TAny* aData)
|
|
sl@0
|
346 |
{
|
|
sl@0
|
347 |
TData& data = *(TData *)aData;
|
|
sl@0
|
348 |
|
|
sl@0
|
349 |
//check size as well
|
|
sl@0
|
350 |
test(data.iQueue->MessageSize() == data.iSize);
|
|
sl@0
|
351 |
|
|
sl@0
|
352 |
TRequestStatus stat;
|
|
sl@0
|
353 |
data.iQueue->NotifyDataAvailable(stat);
|
|
sl@0
|
354 |
User::WaitForRequest(stat);
|
|
sl@0
|
355 |
return KErrNone;
|
|
sl@0
|
356 |
}
|
|
sl@0
|
357 |
|
|
sl@0
|
358 |
LOCAL_C TInt notifySpaceAvailableEntryPoint(TAny* aData)
|
|
sl@0
|
359 |
{
|
|
sl@0
|
360 |
TData& data = *(TData *)aData;
|
|
sl@0
|
361 |
|
|
sl@0
|
362 |
TRequestStatus stat;
|
|
sl@0
|
363 |
data.iQueue->NotifySpaceAvailable(stat);
|
|
sl@0
|
364 |
User::WaitForRequest(stat);
|
|
sl@0
|
365 |
return KErrNone;
|
|
sl@0
|
366 |
}
|
|
sl@0
|
367 |
|
|
sl@0
|
368 |
|
|
sl@0
|
369 |
|
|
sl@0
|
370 |
LOCAL_C void MultiThreadedTests(RMsgQueueBase& aQueue, TInt aSlots, TInt aSize)
|
|
sl@0
|
371 |
{
|
|
sl@0
|
372 |
test.Next(_L("multi threaded tests"));
|
|
sl@0
|
373 |
RThread thread2;
|
|
sl@0
|
374 |
TInt ret = KErrNone;
|
|
sl@0
|
375 |
|
|
sl@0
|
376 |
TAny* ptr = User::Alloc(aSize);
|
|
sl@0
|
377 |
|
|
sl@0
|
378 |
test.Next(_L("test Send with illegal parameters"));
|
|
sl@0
|
379 |
TInt testnum;
|
|
sl@0
|
380 |
TBool jit = User::JustInTime();
|
|
sl@0
|
381 |
User::SetJustInTime(EFalse);
|
|
sl@0
|
382 |
for (testnum = 0; testnum < 3; testnum++) //testnum range is determined by the number of tests in illegalSendEntryPoint
|
|
sl@0
|
383 |
{
|
|
sl@0
|
384 |
TData data(&aQueue, aSize, aSlots, testnum, ptr);
|
|
sl@0
|
385 |
ret = thread2.Create(KThread2Name, illegalSendEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
386 |
test(KErrNone == ret);
|
|
sl@0
|
387 |
TRequestStatus thread2stat;
|
|
sl@0
|
388 |
thread2.Logon(thread2stat);
|
|
sl@0
|
389 |
thread2.Resume();
|
|
sl@0
|
390 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
391 |
test (thread2.ExitType() == EExitPanic);
|
|
sl@0
|
392 |
switch (testnum)
|
|
sl@0
|
393 |
{
|
|
sl@0
|
394 |
case 0:
|
|
sl@0
|
395 |
test (thread2.ExitReason() == EMsgQueueInvalidLength);
|
|
sl@0
|
396 |
break;
|
|
sl@0
|
397 |
case 1:
|
|
sl@0
|
398 |
test (thread2.ExitReason() == ECausedException);
|
|
sl@0
|
399 |
break;
|
|
sl@0
|
400 |
case 2:
|
|
sl@0
|
401 |
test (thread2.ExitReason() == ECausedException);
|
|
sl@0
|
402 |
break;
|
|
sl@0
|
403 |
}
|
|
sl@0
|
404 |
|
|
sl@0
|
405 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
406 |
}
|
|
sl@0
|
407 |
|
|
sl@0
|
408 |
|
|
sl@0
|
409 |
User::SetJustInTime(jit);
|
|
sl@0
|
410 |
|
|
sl@0
|
411 |
|
|
sl@0
|
412 |
test.Next(_L("test Receive with illegal parameters"));
|
|
sl@0
|
413 |
jit = User::JustInTime();
|
|
sl@0
|
414 |
User::SetJustInTime(EFalse);
|
|
sl@0
|
415 |
|
|
sl@0
|
416 |
|
|
sl@0
|
417 |
for (testnum = 0; testnum < 3; testnum++) //testnum range is determined by the number of tests in illegalReceiveEntryPoint
|
|
sl@0
|
418 |
{
|
|
sl@0
|
419 |
//put something in the queue
|
|
sl@0
|
420 |
aQueue.Send(&testnum, 4);
|
|
sl@0
|
421 |
TData data(&aQueue, aSize, aSlots, testnum, ptr);
|
|
sl@0
|
422 |
ret = thread2.Create(KThread2Name, illegalReceiveEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
423 |
test(KErrNone == ret);
|
|
sl@0
|
424 |
TRequestStatus thread2stat;
|
|
sl@0
|
425 |
thread2.Logon(thread2stat);
|
|
sl@0
|
426 |
thread2.Resume();
|
|
sl@0
|
427 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
428 |
test (thread2.ExitType() == EExitPanic);
|
|
sl@0
|
429 |
|
|
sl@0
|
430 |
switch (testnum)
|
|
sl@0
|
431 |
{
|
|
sl@0
|
432 |
case 0:
|
|
sl@0
|
433 |
test (thread2.ExitReason() == EMsgQueueInvalidLength);
|
|
sl@0
|
434 |
break;
|
|
sl@0
|
435 |
case 1:
|
|
sl@0
|
436 |
test (thread2.ExitReason() == ECausedException);
|
|
sl@0
|
437 |
break;
|
|
sl@0
|
438 |
case 2:
|
|
sl@0
|
439 |
test (thread2.ExitReason() == ECausedException);
|
|
sl@0
|
440 |
break;
|
|
sl@0
|
441 |
}
|
|
sl@0
|
442 |
|
|
sl@0
|
443 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
444 |
}
|
|
sl@0
|
445 |
|
|
sl@0
|
446 |
|
|
sl@0
|
447 |
User::SetJustInTime(jit);
|
|
sl@0
|
448 |
|
|
sl@0
|
449 |
while(KErrNone == aQueue.Receive(ptr, aSize)) //empty the queue
|
|
sl@0
|
450 |
{
|
|
sl@0
|
451 |
//empty,
|
|
sl@0
|
452 |
}
|
|
sl@0
|
453 |
|
|
sl@0
|
454 |
test.Next(_L("multi threaded NotifySpaceAvailable"));
|
|
sl@0
|
455 |
|
|
sl@0
|
456 |
TInt dummydata = KTestValue;
|
|
sl@0
|
457 |
//fill the queue
|
|
sl@0
|
458 |
while (KErrNone == aQueue.Send(&dummydata, sizeof (TInt)))
|
|
sl@0
|
459 |
{
|
|
sl@0
|
460 |
//empty
|
|
sl@0
|
461 |
}
|
|
sl@0
|
462 |
|
|
sl@0
|
463 |
TData data(&aQueue, aSize, aSlots);
|
|
sl@0
|
464 |
ret = thread2.Create(KThread2Name, notifySpaceAvailableEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
465 |
test(KErrNone == ret);
|
|
sl@0
|
466 |
TRequestStatus thread2stat;
|
|
sl@0
|
467 |
thread2.Logon(thread2stat);
|
|
sl@0
|
468 |
thread2.Resume();
|
|
sl@0
|
469 |
|
|
sl@0
|
470 |
//thread2 should be waiting for space available
|
|
sl@0
|
471 |
test (thread2stat == KRequestPending);
|
|
sl@0
|
472 |
aQueue.ReceiveBlocking(ptr, aSize);
|
|
sl@0
|
473 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
474 |
test (thread2stat == KErrNone);
|
|
sl@0
|
475 |
test (thread2.ExitType() == EExitKill);
|
|
sl@0
|
476 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
477 |
//thread 2 has exited OK
|
|
sl@0
|
478 |
|
|
sl@0
|
479 |
//empty the queue
|
|
sl@0
|
480 |
while (KErrNone == aQueue.Receive(ptr, aSize))
|
|
sl@0
|
481 |
{
|
|
sl@0
|
482 |
//empty
|
|
sl@0
|
483 |
}
|
|
sl@0
|
484 |
|
|
sl@0
|
485 |
|
|
sl@0
|
486 |
test.Next(_L("multi threaded SendBlocking, ReceiveBlocking"));
|
|
sl@0
|
487 |
ret = thread2.Create(KThread2Name, receiveBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
488 |
test(KErrNone == ret);
|
|
sl@0
|
489 |
thread2.Logon(thread2stat);
|
|
sl@0
|
490 |
thread2.Resume();
|
|
sl@0
|
491 |
|
|
sl@0
|
492 |
aQueue.SendBlocking(&dummydata, sizeof (TInt));
|
|
sl@0
|
493 |
|
|
sl@0
|
494 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
495 |
test (thread2.ExitType() == EExitKill);
|
|
sl@0
|
496 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
497 |
|
|
sl@0
|
498 |
|
|
sl@0
|
499 |
test.Next(_L("multiple ReceiveBlocking"));
|
|
sl@0
|
500 |
ret = thread2.Create(KThread2Name, receiveBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
501 |
test(KErrNone == ret);
|
|
sl@0
|
502 |
|
|
sl@0
|
503 |
RThread thread3;
|
|
sl@0
|
504 |
ret = thread3.Create(KThread3Name, receiveBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
505 |
test(KErrNone == ret);
|
|
sl@0
|
506 |
|
|
sl@0
|
507 |
RThread thread4;
|
|
sl@0
|
508 |
ret = thread4.Create(KThread4Name, receiveBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
509 |
test(KErrNone == ret);
|
|
sl@0
|
510 |
|
|
sl@0
|
511 |
thread2.Logon(thread2stat);
|
|
sl@0
|
512 |
|
|
sl@0
|
513 |
TRequestStatus thread3stat;
|
|
sl@0
|
514 |
thread3.Logon(thread3stat);
|
|
sl@0
|
515 |
|
|
sl@0
|
516 |
TRequestStatus thread4stat;
|
|
sl@0
|
517 |
thread4.Logon(thread4stat);
|
|
sl@0
|
518 |
|
|
sl@0
|
519 |
thread2.Resume();
|
|
sl@0
|
520 |
User::After(500000);
|
|
sl@0
|
521 |
|
|
sl@0
|
522 |
jit = User::JustInTime();
|
|
sl@0
|
523 |
User::SetJustInTime(EFalse);
|
|
sl@0
|
524 |
|
|
sl@0
|
525 |
thread3.Resume();
|
|
sl@0
|
526 |
thread4.Resume();
|
|
sl@0
|
527 |
|
|
sl@0
|
528 |
|
|
sl@0
|
529 |
User::WaitForRequest(thread3stat, thread4stat);
|
|
sl@0
|
530 |
if (thread3stat != KRequestPending)
|
|
sl@0
|
531 |
User::WaitForRequest(thread4stat);
|
|
sl@0
|
532 |
else
|
|
sl@0
|
533 |
User::WaitForRequest(thread3stat);
|
|
sl@0
|
534 |
User::SetJustInTime(jit);
|
|
sl@0
|
535 |
|
|
sl@0
|
536 |
//threads 3 and 4 have exited
|
|
sl@0
|
537 |
test (thread3.ExitType() == EExitPanic);
|
|
sl@0
|
538 |
test (thread3.ExitReason() == EMsgQueueRequestPending);
|
|
sl@0
|
539 |
test (thread4.ExitType() == EExitPanic);
|
|
sl@0
|
540 |
test (thread4.ExitReason() == EMsgQueueRequestPending);
|
|
sl@0
|
541 |
|
|
sl@0
|
542 |
test (thread2stat == KRequestPending);
|
|
sl@0
|
543 |
aQueue.SendBlocking(&dummydata, sizeof (TInt));
|
|
sl@0
|
544 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
545 |
test (thread2stat == KErrNone);
|
|
sl@0
|
546 |
test (thread2.ExitType() == EExitKill);
|
|
sl@0
|
547 |
|
|
sl@0
|
548 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
549 |
CLOSE_AND_WAIT(thread3);
|
|
sl@0
|
550 |
CLOSE_AND_WAIT(thread4);
|
|
sl@0
|
551 |
|
|
sl@0
|
552 |
|
|
sl@0
|
553 |
//fill the queue
|
|
sl@0
|
554 |
while (KErrNone == aQueue.Send(&dummydata, sizeof (TInt)))
|
|
sl@0
|
555 |
{
|
|
sl@0
|
556 |
//empty
|
|
sl@0
|
557 |
}
|
|
sl@0
|
558 |
|
|
sl@0
|
559 |
test.Next(_L("multiple sendblocking"));
|
|
sl@0
|
560 |
ret = thread2.Create(KThread2Name, sendBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
561 |
test(KErrNone == ret);
|
|
sl@0
|
562 |
ret = thread3.Create(KThread3Name, sendBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
563 |
test(KErrNone == ret);
|
|
sl@0
|
564 |
ret = thread4.Create(KThread4Name, sendBlockingEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
565 |
test(KErrNone == ret);
|
|
sl@0
|
566 |
|
|
sl@0
|
567 |
thread2.Logon(thread2stat);
|
|
sl@0
|
568 |
thread3.Logon(thread3stat);
|
|
sl@0
|
569 |
thread4.Logon(thread4stat);
|
|
sl@0
|
570 |
|
|
sl@0
|
571 |
thread2.Resume();
|
|
sl@0
|
572 |
User::After(500000);
|
|
sl@0
|
573 |
|
|
sl@0
|
574 |
jit = User::JustInTime();
|
|
sl@0
|
575 |
User::SetJustInTime(EFalse);
|
|
sl@0
|
576 |
thread3.Resume();
|
|
sl@0
|
577 |
thread4.Resume();
|
|
sl@0
|
578 |
User::WaitForRequest(thread3stat, thread4stat);
|
|
sl@0
|
579 |
if (thread3stat != KRequestPending)
|
|
sl@0
|
580 |
User::WaitForRequest(thread4stat);
|
|
sl@0
|
581 |
else
|
|
sl@0
|
582 |
User::WaitForRequest(thread3stat);
|
|
sl@0
|
583 |
User::SetJustInTime(jit);
|
|
sl@0
|
584 |
|
|
sl@0
|
585 |
//threads 3 and 4 have exited
|
|
sl@0
|
586 |
test (thread3.ExitType() == EExitPanic);
|
|
sl@0
|
587 |
test (thread3.ExitReason() == EMsgQueueRequestPending);
|
|
sl@0
|
588 |
test (thread4.ExitType() == EExitPanic);
|
|
sl@0
|
589 |
test (thread4.ExitReason() == EMsgQueueRequestPending);
|
|
sl@0
|
590 |
|
|
sl@0
|
591 |
test (thread2stat == KRequestPending);
|
|
sl@0
|
592 |
|
|
sl@0
|
593 |
//consume one to allow the blocking write
|
|
sl@0
|
594 |
test(KErrNone == aQueue.Receive(ptr, aSize));
|
|
sl@0
|
595 |
|
|
sl@0
|
596 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
597 |
test (thread2stat == KErrNone);
|
|
sl@0
|
598 |
test (thread2.ExitType() == EExitKill);
|
|
sl@0
|
599 |
|
|
sl@0
|
600 |
//consume the rest of the queue
|
|
sl@0
|
601 |
while (KErrNone == aQueue.Receive(ptr, aSize))
|
|
sl@0
|
602 |
{
|
|
sl@0
|
603 |
// empty
|
|
sl@0
|
604 |
}
|
|
sl@0
|
605 |
|
|
sl@0
|
606 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
607 |
CLOSE_AND_WAIT(thread3);
|
|
sl@0
|
608 |
CLOSE_AND_WAIT(thread4);
|
|
sl@0
|
609 |
|
|
sl@0
|
610 |
|
|
sl@0
|
611 |
test.Next(_L("multi threaded NotifyDataAvailable"));
|
|
sl@0
|
612 |
ret = thread2.Create(KThread2Name, notifyDataAvailableEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
613 |
test(KErrNone == ret);
|
|
sl@0
|
614 |
thread2.Logon(thread2stat);
|
|
sl@0
|
615 |
thread2.Resume();
|
|
sl@0
|
616 |
|
|
sl@0
|
617 |
//thread2 should be waiting for data available
|
|
sl@0
|
618 |
test (thread2stat == KRequestPending);
|
|
sl@0
|
619 |
aQueue.SendBlocking(&dummydata, sizeof (TInt));
|
|
sl@0
|
620 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
621 |
test (thread2stat == KErrNone);
|
|
sl@0
|
622 |
test (thread2.ExitType() == EExitKill);
|
|
sl@0
|
623 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
624 |
//thread 2 has exited OK
|
|
sl@0
|
625 |
|
|
sl@0
|
626 |
//empty the queue
|
|
sl@0
|
627 |
aQueue.ReceiveBlocking(ptr, aSize);
|
|
sl@0
|
628 |
test (*(TInt*)ptr == dummydata);
|
|
sl@0
|
629 |
|
|
sl@0
|
630 |
//create thread 2 again
|
|
sl@0
|
631 |
ret = thread2.Create(KThread2Name, notifyDataAvailableEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
632 |
test(KErrNone == ret);
|
|
sl@0
|
633 |
thread2.Logon(thread2stat);
|
|
sl@0
|
634 |
thread2.Resume();
|
|
sl@0
|
635 |
|
|
sl@0
|
636 |
//create thread3
|
|
sl@0
|
637 |
ret = thread3.Create(KThread3Name, notifyDataAvailableEntryPoint, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
638 |
test(KErrNone == ret);
|
|
sl@0
|
639 |
thread3.Logon(thread3stat);
|
|
sl@0
|
640 |
User::SetJustInTime(EFalse);
|
|
sl@0
|
641 |
User::After(10000);
|
|
sl@0
|
642 |
thread3.Resume();
|
|
sl@0
|
643 |
|
|
sl@0
|
644 |
User::WaitForRequest(thread3stat);
|
|
sl@0
|
645 |
User::SetJustInTime(jit);
|
|
sl@0
|
646 |
|
|
sl@0
|
647 |
test (thread3.ExitType() == EExitPanic);
|
|
sl@0
|
648 |
test (thread3.ExitReason() == EMsgQueueRequestPending);
|
|
sl@0
|
649 |
CLOSE_AND_WAIT(thread3);
|
|
sl@0
|
650 |
|
|
sl@0
|
651 |
aQueue.SendBlocking(&dummydata, sizeof (TInt));
|
|
sl@0
|
652 |
User::WaitForRequest(thread2stat);
|
|
sl@0
|
653 |
test (thread2stat == KErrNone);
|
|
sl@0
|
654 |
test (thread2.ExitType() == EExitKill);
|
|
sl@0
|
655 |
CLOSE_AND_WAIT(thread2);
|
|
sl@0
|
656 |
|
|
sl@0
|
657 |
//empty the queue
|
|
sl@0
|
658 |
aQueue.ReceiveBlocking(ptr, aSize);
|
|
sl@0
|
659 |
test (*(TInt*)ptr == dummydata);
|
|
sl@0
|
660 |
|
|
sl@0
|
661 |
User::Free(ptr);
|
|
sl@0
|
662 |
}
|
|
sl@0
|
663 |
|
|
sl@0
|
664 |
|
|
sl@0
|
665 |
class TTemplateTestData
|
|
sl@0
|
666 |
{
|
|
sl@0
|
667 |
public:
|
|
sl@0
|
668 |
TTemplateTestData();
|
|
sl@0
|
669 |
TTemplateTestData(TInt a, TUint b, TUint8 c, TBool d, TInt e);
|
|
sl@0
|
670 |
TInt first;
|
|
sl@0
|
671 |
TUint second;
|
|
sl@0
|
672 |
TUint8 bob;
|
|
sl@0
|
673 |
TBool fred;
|
|
sl@0
|
674 |
TInt chipper;
|
|
sl@0
|
675 |
};
|
|
sl@0
|
676 |
|
|
sl@0
|
677 |
TTemplateTestData::TTemplateTestData() : first(0), second(0), bob(0), fred(0), chipper(0)
|
|
sl@0
|
678 |
{
|
|
sl@0
|
679 |
}
|
|
sl@0
|
680 |
|
|
sl@0
|
681 |
TTemplateTestData::TTemplateTestData(TInt a, TUint b, TUint8 c, TBool d, TInt e) : first(a), second(b), bob(c), fred(d), chipper(e)
|
|
sl@0
|
682 |
{
|
|
sl@0
|
683 |
}
|
|
sl@0
|
684 |
|
|
sl@0
|
685 |
|
|
sl@0
|
686 |
enum TQueueType {ECreateLocal, ECreateGlobal};
|
|
sl@0
|
687 |
|
|
sl@0
|
688 |
LOCAL_C TInt illegalQueueCreation(TAny* aData)
|
|
sl@0
|
689 |
{
|
|
sl@0
|
690 |
TData& data = *(TData *)aData;
|
|
sl@0
|
691 |
switch (data.iTest)
|
|
sl@0
|
692 |
{
|
|
sl@0
|
693 |
case ECreateLocal: //CreateLocal
|
|
sl@0
|
694 |
{
|
|
sl@0
|
695 |
RMsgQueueBase queue;
|
|
sl@0
|
696 |
queue.CreateLocal(data.iSlots, data.iSize);
|
|
sl@0
|
697 |
break;
|
|
sl@0
|
698 |
}
|
|
sl@0
|
699 |
case ECreateGlobal: //create global named
|
|
sl@0
|
700 |
{
|
|
sl@0
|
701 |
RMsgQueueBase queue;
|
|
sl@0
|
702 |
queue.CreateGlobal(KGLobalName1, data.iSlots, data.iSize);
|
|
sl@0
|
703 |
break;
|
|
sl@0
|
704 |
}
|
|
sl@0
|
705 |
}
|
|
sl@0
|
706 |
test(0); //should never get here. This'll make a Kern Exec 0! as tries to use console from different thread
|
|
sl@0
|
707 |
return 0;
|
|
sl@0
|
708 |
}
|
|
sl@0
|
709 |
|
|
sl@0
|
710 |
|
|
sl@0
|
711 |
LOCAL_C void TestIllegalCreation(TInt aSlots, TInt aSize, TQueueType aQueueType, TInt aExpectedReason)
|
|
sl@0
|
712 |
{
|
|
sl@0
|
713 |
RThread thread;
|
|
sl@0
|
714 |
TData data(NULL, aSize, aSlots, aQueueType, NULL);
|
|
sl@0
|
715 |
TRequestStatus threadstat;
|
|
sl@0
|
716 |
TBool jit = User::JustInTime();
|
|
sl@0
|
717 |
User::SetJustInTime(EFalse);
|
|
sl@0
|
718 |
TInt ret = thread.Create(KThread2Name, illegalQueueCreation, KDefaultStackSize, KHeapSize, KHeapSize, &data);
|
|
sl@0
|
719 |
test(KErrNone == ret);
|
|
sl@0
|
720 |
thread.Logon(threadstat);
|
|
sl@0
|
721 |
thread.Resume();
|
|
sl@0
|
722 |
User::WaitForRequest(threadstat);
|
|
sl@0
|
723 |
test (thread.ExitType() == EExitPanic);
|
|
sl@0
|
724 |
test (thread.ExitReason() == aExpectedReason);
|
|
sl@0
|
725 |
CLOSE_AND_WAIT(thread);
|
|
sl@0
|
726 |
User::SetJustInTime(jit);
|
|
sl@0
|
727 |
}
|
|
sl@0
|
728 |
|
|
sl@0
|
729 |
TInt DyingDataAvailableThread( TAny* )
|
|
sl@0
|
730 |
{
|
|
sl@0
|
731 |
RMsgQueue<TInt> theQ;
|
|
sl@0
|
732 |
if( KErrNone != theQ.OpenGlobal(_L("TestNotifiedThreadDied")) )
|
|
sl@0
|
733 |
User::Panic( _L("TESTTH"), 0 );
|
|
sl@0
|
734 |
|
|
sl@0
|
735 |
TRequestStatus stat;
|
|
sl@0
|
736 |
theQ.NotifyDataAvailable( stat );
|
|
sl@0
|
737 |
// now just exit
|
|
sl@0
|
738 |
return KErrNone;
|
|
sl@0
|
739 |
}
|
|
sl@0
|
740 |
|
|
sl@0
|
741 |
TInt DyingSpaceAvailableThread( TAny* )
|
|
sl@0
|
742 |
{
|
|
sl@0
|
743 |
RMsgQueue<TInt> theQ;
|
|
sl@0
|
744 |
if( KErrNone != theQ.OpenGlobal(_L("TestNotifiedThreadDied")) )
|
|
sl@0
|
745 |
User::Panic( _L("TESTTH"), 0 );
|
|
sl@0
|
746 |
|
|
sl@0
|
747 |
TRequestStatus stat;
|
|
sl@0
|
748 |
theQ.NotifySpaceAvailable( stat );
|
|
sl@0
|
749 |
// now just exit
|
|
sl@0
|
750 |
return KErrNone;
|
|
sl@0
|
751 |
}
|
|
sl@0
|
752 |
|
|
sl@0
|
753 |
struct TThreadParams
|
|
sl@0
|
754 |
{
|
|
sl@0
|
755 |
TInt imyQHandle;
|
|
sl@0
|
756 |
TRequestStatus* iRequest;
|
|
sl@0
|
757 |
};
|
|
sl@0
|
758 |
|
|
sl@0
|
759 |
TInt DyingRequestDataNotification(TAny* aThreadParams)
|
|
sl@0
|
760 |
{
|
|
sl@0
|
761 |
CTrapCleanup* trapHandler = CTrapCleanup::New();
|
|
sl@0
|
762 |
if(!trapHandler)
|
|
sl@0
|
763 |
return KErrNoMemory;
|
|
sl@0
|
764 |
|
|
sl@0
|
765 |
TThreadParams* tp = reinterpret_cast<TThreadParams*>(aThreadParams);
|
|
sl@0
|
766 |
|
|
sl@0
|
767 |
RMsgQueue<TInt> msgQue2;
|
|
sl@0
|
768 |
msgQue2.SetHandle(tp->imyQHandle);
|
|
sl@0
|
769 |
msgQue2.NotifyDataAvailable(*tp->iRequest);
|
|
sl@0
|
770 |
|
|
sl@0
|
771 |
delete trapHandler;
|
|
sl@0
|
772 |
return KErrNone;
|
|
sl@0
|
773 |
}
|
|
sl@0
|
774 |
|
|
sl@0
|
775 |
void TestNotifiedThreadDied()
|
|
sl@0
|
776 |
{
|
|
sl@0
|
777 |
RThread th;
|
|
sl@0
|
778 |
TRequestStatus stat;
|
|
sl@0
|
779 |
RMsgQueue<TInt> myQ;
|
|
sl@0
|
780 |
test( KErrNone == myQ.CreateGlobal( _L("TestNotifiedThreadDied"), 1 ) );
|
|
sl@0
|
781 |
|
|
sl@0
|
782 |
//Test when thread waiting on data available dies
|
|
sl@0
|
783 |
test( KErrNone == th.Create( _L("DyingDataAvailableThread"), DyingDataAvailableThread, 1024, 1024, 8192, NULL ) );
|
|
sl@0
|
784 |
th.Logon( stat );
|
|
sl@0
|
785 |
th.Resume();
|
|
sl@0
|
786 |
User::WaitForRequest( stat );
|
|
sl@0
|
787 |
test(stat.Int()==KErrNone);
|
|
sl@0
|
788 |
|
|
sl@0
|
789 |
User::After( 1000000 );
|
|
sl@0
|
790 |
|
|
sl@0
|
791 |
myQ.NotifyDataAvailable( stat );
|
|
sl@0
|
792 |
myQ.CancelDataAvailable();
|
|
sl@0
|
793 |
CLOSE_AND_WAIT(th);
|
|
sl@0
|
794 |
|
|
sl@0
|
795 |
//Test when thread waiting on space available dies
|
|
sl@0
|
796 |
myQ.Send(0);//This will fill in the whole message queue and block any thread waiting on space available.
|
|
sl@0
|
797 |
|
|
sl@0
|
798 |
test( KErrNone == th.Create( _L("DyingSpaceAvailableThread"), DyingSpaceAvailableThread, 1024, 1024, 8192, NULL ) );
|
|
sl@0
|
799 |
th.Logon( stat );
|
|
sl@0
|
800 |
th.Resume();
|
|
sl@0
|
801 |
User::WaitForRequest( stat );
|
|
sl@0
|
802 |
test(stat.Int()==KErrNone);
|
|
sl@0
|
803 |
|
|
sl@0
|
804 |
User::After( 1000000 );
|
|
sl@0
|
805 |
|
|
sl@0
|
806 |
myQ.NotifySpaceAvailable( stat );
|
|
sl@0
|
807 |
myQ.CancelSpaceAvailable();
|
|
sl@0
|
808 |
myQ.Close();
|
|
sl@0
|
809 |
CLOSE_AND_WAIT(th);
|
|
sl@0
|
810 |
|
|
sl@0
|
811 |
// Calling cancel notification should not crash as the thread that requested notification dies
|
|
sl@0
|
812 |
test( KErrNone == myQ.CreateLocal(1, EOwnerProcess));
|
|
sl@0
|
813 |
|
|
sl@0
|
814 |
TThreadParams tp;
|
|
sl@0
|
815 |
tp.imyQHandle = myQ.Handle();
|
|
sl@0
|
816 |
tp.iRequest = &stat;
|
|
sl@0
|
817 |
|
|
sl@0
|
818 |
test( KErrNone == th.Create(_L("DyingRequestDataNotificationThread"), DyingRequestDataNotification, KDefaultStackSize,
|
|
sl@0
|
819 |
KHeapSize, KHeapSize, reinterpret_cast<TAny*>(&tp)));
|
|
sl@0
|
820 |
TRequestStatus status;
|
|
sl@0
|
821 |
th.Logon(status);
|
|
sl@0
|
822 |
th.Resume();
|
|
sl@0
|
823 |
th.Close();
|
|
sl@0
|
824 |
|
|
sl@0
|
825 |
User::WaitForRequest(status);
|
|
sl@0
|
826 |
test(status.Int() == KErrNone);
|
|
sl@0
|
827 |
|
|
sl@0
|
828 |
myQ.CancelDataAvailable();
|
|
sl@0
|
829 |
myQ.Close();
|
|
sl@0
|
830 |
|
|
sl@0
|
831 |
}
|
|
sl@0
|
832 |
|
|
sl@0
|
833 |
LOCAL_C void RunTests(void)
|
|
sl@0
|
834 |
{
|
|
sl@0
|
835 |
TInt ret = KErrNone;
|
|
sl@0
|
836 |
test.Start(_L("Testing"));
|
|
sl@0
|
837 |
|
|
sl@0
|
838 |
|
|
sl@0
|
839 |
RMsgQueueBase mqueue;
|
|
sl@0
|
840 |
|
|
sl@0
|
841 |
// LOCAL message queues
|
|
sl@0
|
842 |
|
|
sl@0
|
843 |
|
|
sl@0
|
844 |
test.Next(_L("Check when thread dies waiting to be notified."));
|
|
sl@0
|
845 |
TestNotifiedThreadDied();
|
|
sl@0
|
846 |
|
|
sl@0
|
847 |
test.Next(_L("Create private message queue with 0 length params"));
|
|
sl@0
|
848 |
TestIllegalCreation(0,0,ECreateLocal, EMsgQueueInvalidLength);
|
|
sl@0
|
849 |
|
|
sl@0
|
850 |
test.Next(_L("Create private message queue with 0 slots"));
|
|
sl@0
|
851 |
TestIllegalCreation(0,4,ECreateLocal, EMsgQueueInvalidSlots);
|
|
sl@0
|
852 |
|
|
sl@0
|
853 |
test.Next(_L("Create private message queue with 0 size message"));
|
|
sl@0
|
854 |
TestIllegalCreation(5, 0, ECreateLocal, EMsgQueueInvalidLength);
|
|
sl@0
|
855 |
|
|
sl@0
|
856 |
test.Next(_L("Create private message queue with none multiple of 4 size message"));
|
|
sl@0
|
857 |
TestIllegalCreation(5, 9, ECreateLocal, EMsgQueueInvalidLength);
|
|
sl@0
|
858 |
|
|
sl@0
|
859 |
test.Next(_L("Create private message queue with illegal max length "));
|
|
sl@0
|
860 |
TestIllegalCreation(8,RMsgQueueBase::KMaxLength+1, ECreateLocal, EMsgQueueInvalidLength);
|
|
sl@0
|
861 |
|
|
sl@0
|
862 |
|
|
sl@0
|
863 |
test.Next(_L("Create private message queue, 43 slots, length 8"));
|
|
sl@0
|
864 |
ret = mqueue.CreateLocal(43,8, EOwnerThread);
|
|
sl@0
|
865 |
test (KErrNone == ret);
|
|
sl@0
|
866 |
mqueue.Close();
|
|
sl@0
|
867 |
|
|
sl@0
|
868 |
test.Next(_L("Create private message queue with max length "));
|
|
sl@0
|
869 |
ret = mqueue.CreateLocal(8, RMsgQueueBase::KMaxLength, EOwnerProcess);
|
|
sl@0
|
870 |
test (KErrNone == ret);
|
|
sl@0
|
871 |
mqueue.Close();
|
|
sl@0
|
872 |
|
|
sl@0
|
873 |
test.Next(_L("test private message queue functionality"));
|
|
sl@0
|
874 |
|
|
sl@0
|
875 |
test.Printf(_L("two slots, small queue"));
|
|
sl@0
|
876 |
ret = mqueue.CreateLocal(2, 4);
|
|
sl@0
|
877 |
test(KErrNone == ret);
|
|
sl@0
|
878 |
SingleThreadedTests(mqueue, 2, 4);
|
|
sl@0
|
879 |
MultiThreadedTests(mqueue, 2, 4);
|
|
sl@0
|
880 |
mqueue.Close();
|
|
sl@0
|
881 |
|
|
sl@0
|
882 |
test.Printf(_L("16 slots, max queue"));
|
|
sl@0
|
883 |
ret = mqueue.CreateLocal(16, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
884 |
test(KErrNone == ret);
|
|
sl@0
|
885 |
SingleThreadedTests(mqueue, 16, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
886 |
MultiThreadedTests(mqueue, 16, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
887 |
mqueue.Close();
|
|
sl@0
|
888 |
|
|
sl@0
|
889 |
test.Printf(_L("big slots, max queue"));
|
|
sl@0
|
890 |
ret = mqueue.CreateLocal(KMaxTInt, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
891 |
test(KErrNoMemory == ret);
|
|
sl@0
|
892 |
|
|
sl@0
|
893 |
|
|
sl@0
|
894 |
/**************************************************************************/
|
|
sl@0
|
895 |
// GLOBAL Named message queues
|
|
sl@0
|
896 |
test.Next(_L("Create global named message queue with 0 length params"));
|
|
sl@0
|
897 |
TestIllegalCreation(0, 0, ECreateGlobal, EMsgQueueInvalidLength);
|
|
sl@0
|
898 |
|
|
sl@0
|
899 |
test.Next(_L("Create global named message queue with 0 slots"));
|
|
sl@0
|
900 |
TestIllegalCreation(0, 4, ECreateGlobal, EMsgQueueInvalidSlots);
|
|
sl@0
|
901 |
|
|
sl@0
|
902 |
test.Next(_L("Create global message queue with 0 size message"));
|
|
sl@0
|
903 |
TestIllegalCreation(5, 0, ECreateGlobal, EMsgQueueInvalidLength);
|
|
sl@0
|
904 |
|
|
sl@0
|
905 |
test.Next(_L("Create global message queue with none multiple of 4 size message"));
|
|
sl@0
|
906 |
TestIllegalCreation(5, 9, ECreateGlobal, EMsgQueueInvalidLength);
|
|
sl@0
|
907 |
|
|
sl@0
|
908 |
test.Next(_L("Create global named message queue with illegal max length "));
|
|
sl@0
|
909 |
TestIllegalCreation(8, RMsgQueueBase::KMaxLength+1, ECreateGlobal, EMsgQueueInvalidLength);
|
|
sl@0
|
910 |
|
|
sl@0
|
911 |
test.Next(_L("Create global named message queue"));
|
|
sl@0
|
912 |
ret = mqueue.CreateGlobal(KGLobalName1, 10,8, EOwnerThread);
|
|
sl@0
|
913 |
test (KErrNone == ret);
|
|
sl@0
|
914 |
mqueue.Close();
|
|
sl@0
|
915 |
|
|
sl@0
|
916 |
test.Next(_L("Create global named message queue with max length "));
|
|
sl@0
|
917 |
ret = mqueue.CreateGlobal(KGLobalName1, 8, RMsgQueueBase::KMaxLength, EOwnerProcess);
|
|
sl@0
|
918 |
test (KErrNone == ret);
|
|
sl@0
|
919 |
mqueue.Close();
|
|
sl@0
|
920 |
|
|
sl@0
|
921 |
test.Next(_L("test global named message queue functionality"));
|
|
sl@0
|
922 |
|
|
sl@0
|
923 |
test.Printf(_L("small queue, two slots"));
|
|
sl@0
|
924 |
ret = mqueue.CreateGlobal(KGLobalName1, 2, 4);
|
|
sl@0
|
925 |
test(KErrNone == ret);
|
|
sl@0
|
926 |
SingleThreadedTests(mqueue, 2, 4);
|
|
sl@0
|
927 |
MultiThreadedTests(mqueue, 2, 4);
|
|
sl@0
|
928 |
mqueue.Close();
|
|
sl@0
|
929 |
|
|
sl@0
|
930 |
test.Printf(_L("max queue, 16 slots"));
|
|
sl@0
|
931 |
ret = mqueue.CreateGlobal(KGLobalName1, 16, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
932 |
test(KErrNone == ret);
|
|
sl@0
|
933 |
SingleThreadedTests(mqueue, 16, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
934 |
MultiThreadedTests(mqueue, 16, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
935 |
mqueue.Close();
|
|
sl@0
|
936 |
|
|
sl@0
|
937 |
test.Printf(_L("32byte queue, 1000 slots"));
|
|
sl@0
|
938 |
ret = mqueue.CreateGlobal(KGLobalName1, 1000, 32);
|
|
sl@0
|
939 |
test(KErrNone == ret);
|
|
sl@0
|
940 |
SingleThreadedTests(mqueue, 1000, 32);
|
|
sl@0
|
941 |
MultiThreadedTests(mqueue, 1000, 32);
|
|
sl@0
|
942 |
mqueue.Close();
|
|
sl@0
|
943 |
|
|
sl@0
|
944 |
test.Printf(_L("12 byte queue, 1 slot"));
|
|
sl@0
|
945 |
ret = mqueue.CreateGlobal(KGLobalName1, 1, 12);
|
|
sl@0
|
946 |
test(KErrNone == ret);
|
|
sl@0
|
947 |
SingleThreadedTests(mqueue, 1, 12);
|
|
sl@0
|
948 |
MultiThreadedTests(mqueue, 1, 12);
|
|
sl@0
|
949 |
mqueue.Close();
|
|
sl@0
|
950 |
|
|
sl@0
|
951 |
|
|
sl@0
|
952 |
test.Printf(_L("max queue, maxint! slots"));
|
|
sl@0
|
953 |
ret = mqueue.CreateGlobal(KGLobalName1, KMaxTInt, RMsgQueueBase::KMaxLength);
|
|
sl@0
|
954 |
test(KErrNoMemory == ret);
|
|
sl@0
|
955 |
|
|
sl@0
|
956 |
_LIT(KNonQueueName,"non-queue name");
|
|
sl@0
|
957 |
test.Printf(_L("open a non-existant queue"));
|
|
sl@0
|
958 |
ret = mqueue.OpenGlobal(KNonQueueName, EOwnerProcess);
|
|
sl@0
|
959 |
test(ret == KErrNotFound);
|
|
sl@0
|
960 |
|
|
sl@0
|
961 |
|
|
sl@0
|
962 |
ret = mqueue.CreateGlobal(KGLobalName1, 16, 4);
|
|
sl@0
|
963 |
test(KErrNone == ret);
|
|
sl@0
|
964 |
SingleThreadedTests(mqueue, 16, 4);
|
|
sl@0
|
965 |
MultiThreadedTests(mqueue, 16, 4);
|
|
sl@0
|
966 |
RMsgQueueBase open;
|
|
sl@0
|
967 |
|
|
sl@0
|
968 |
ret = open.OpenGlobal(KGLobalName1);
|
|
sl@0
|
969 |
test(KErrNone == ret);
|
|
sl@0
|
970 |
SingleThreadedTests(open, 16,4);
|
|
sl@0
|
971 |
MultiThreadedTests(open, 16, 4);
|
|
sl@0
|
972 |
|
|
sl@0
|
973 |
|
|
sl@0
|
974 |
test.Next(_L("Send a legal message through"));
|
|
sl@0
|
975 |
TInt src = 45;
|
|
sl@0
|
976 |
TInt dst = 0;
|
|
sl@0
|
977 |
ret = mqueue.Send(&src, sizeof (TInt));
|
|
sl@0
|
978 |
test(ret == KErrNone);
|
|
sl@0
|
979 |
|
|
sl@0
|
980 |
test.Next(_L("Receive legal message"));
|
|
sl@0
|
981 |
ret = open.Receive(&dst, 4);
|
|
sl@0
|
982 |
test(ret == KErrNone);
|
|
sl@0
|
983 |
test (src == dst);
|
|
sl@0
|
984 |
|
|
sl@0
|
985 |
test.Next(_L("Send a legal message through"));
|
|
sl@0
|
986 |
ret = mqueue.Send(&src, sizeof (TInt));
|
|
sl@0
|
987 |
test(ret == KErrNone);
|
|
sl@0
|
988 |
|
|
sl@0
|
989 |
open.Close();
|
|
sl@0
|
990 |
mqueue.Close();
|
|
sl@0
|
991 |
|
|
sl@0
|
992 |
|
|
sl@0
|
993 |
ret = mqueue.CreateGlobal(KNullDesC, 5, 4);
|
|
sl@0
|
994 |
test(KErrNone == ret);
|
|
sl@0
|
995 |
SingleThreadedTests(mqueue, 5,4);
|
|
sl@0
|
996 |
MultiThreadedTests(mqueue, 5, 4);
|
|
sl@0
|
997 |
|
|
sl@0
|
998 |
ret = open.OpenGlobal(KNullDesC);
|
|
sl@0
|
999 |
test(KErrNotFound == ret);
|
|
sl@0
|
1000 |
|
|
sl@0
|
1001 |
mqueue.Close();
|
|
sl@0
|
1002 |
|
|
sl@0
|
1003 |
|
|
sl@0
|
1004 |
test.Next(_L("Multi Process Queue Tests"));
|
|
sl@0
|
1005 |
|
|
sl@0
|
1006 |
_LIT(KQueueA, "A");
|
|
sl@0
|
1007 |
_LIT(KQueueB, "B");
|
|
sl@0
|
1008 |
_LIT(KProcessName, "T_MQUEUEECHO.EXE");
|
|
sl@0
|
1009 |
|
|
sl@0
|
1010 |
RMsgQueueBase inQueue;
|
|
sl@0
|
1011 |
RMsgQueueBase outQueue;
|
|
sl@0
|
1012 |
|
|
sl@0
|
1013 |
TInt sizes[6] = {4,8,16,32,100,256};
|
|
sl@0
|
1014 |
|
|
sl@0
|
1015 |
TInt x;
|
|
sl@0
|
1016 |
for (x = 0; x < 6; x++)
|
|
sl@0
|
1017 |
{
|
|
sl@0
|
1018 |
TUint8* p = (TUint8*)User::Alloc(sizes[x]);
|
|
sl@0
|
1019 |
TRequestStatus stat;
|
|
sl@0
|
1020 |
test (p != NULL);
|
|
sl@0
|
1021 |
ret = inQueue.CreateGlobal(KQueueB, 1, sizes[x]);
|
|
sl@0
|
1022 |
test (KErrNone == ret);
|
|
sl@0
|
1023 |
ret = outQueue.CreateGlobal(KQueueA, 1, sizes[x]);
|
|
sl@0
|
1024 |
test (KErrNone == ret);
|
|
sl@0
|
1025 |
|
|
sl@0
|
1026 |
//start other process
|
|
sl@0
|
1027 |
RProcess proc;
|
|
sl@0
|
1028 |
ret = proc.Create(KProcessName, KNullDesC);
|
|
sl@0
|
1029 |
test (KErrNone == ret);
|
|
sl@0
|
1030 |
|
|
sl@0
|
1031 |
//logon to it
|
|
sl@0
|
1032 |
proc.Logon(stat);
|
|
sl@0
|
1033 |
|
|
sl@0
|
1034 |
proc.Resume();
|
|
sl@0
|
1035 |
|
|
sl@0
|
1036 |
TInt y[64] = {1000};
|
|
sl@0
|
1037 |
|
|
sl@0
|
1038 |
while (--y[0] >= 0)
|
|
sl@0
|
1039 |
{
|
|
sl@0
|
1040 |
outQueue.SendBlocking(&y,sizes[x]);
|
|
sl@0
|
1041 |
inQueue.ReceiveBlocking(p, sizes[x]);
|
|
sl@0
|
1042 |
test (y[0] == *(TInt*)p);
|
|
sl@0
|
1043 |
}
|
|
sl@0
|
1044 |
|
|
sl@0
|
1045 |
User::Free(p);
|
|
sl@0
|
1046 |
inQueue.Close();
|
|
sl@0
|
1047 |
outQueue.Close();
|
|
sl@0
|
1048 |
|
|
sl@0
|
1049 |
//wait for the process to terminate
|
|
sl@0
|
1050 |
User::WaitForRequest(stat);
|
|
sl@0
|
1051 |
test(stat == KErrNone);
|
|
sl@0
|
1052 |
CLOSE_AND_WAIT(proc);
|
|
sl@0
|
1053 |
}
|
|
sl@0
|
1054 |
|
|
sl@0
|
1055 |
test.Next(_L("test templated queue"));
|
|
sl@0
|
1056 |
RMsgQueue<TTemplateTestData> templateQueue;
|
|
sl@0
|
1057 |
TTemplateTestData ch(1,2,3,ETrue,4);
|
|
sl@0
|
1058 |
TTemplateTestData ch2;
|
|
sl@0
|
1059 |
TTemplateTestData ch3;
|
|
sl@0
|
1060 |
|
|
sl@0
|
1061 |
test(KErrNone == templateQueue.CreateLocal(12));
|
|
sl@0
|
1062 |
|
|
sl@0
|
1063 |
test (KErrNone == templateQueue.Send(ch));
|
|
sl@0
|
1064 |
test (ch.first != ch2.first);
|
|
sl@0
|
1065 |
test (ch.chipper != ch2.chipper);
|
|
sl@0
|
1066 |
test (KErrNone == templateQueue.Receive(ch2));
|
|
sl@0
|
1067 |
test (ch.first == ch2.first);
|
|
sl@0
|
1068 |
test (ch.chipper == ch2.chipper);
|
|
sl@0
|
1069 |
|
|
sl@0
|
1070 |
templateQueue.SendBlocking(ch);
|
|
sl@0
|
1071 |
test (ch.first != ch3.first);
|
|
sl@0
|
1072 |
test (ch.chipper != ch3.chipper);
|
|
sl@0
|
1073 |
templateQueue.ReceiveBlocking(ch3);
|
|
sl@0
|
1074 |
test (ch.first == ch3.first);
|
|
sl@0
|
1075 |
test (ch.chipper == ch3.chipper);
|
|
sl@0
|
1076 |
|
|
sl@0
|
1077 |
templateQueue.Close();
|
|
sl@0
|
1078 |
|
|
sl@0
|
1079 |
test(KErrNone == templateQueue.CreateGlobal(KNullDesC, 79));
|
|
sl@0
|
1080 |
templateQueue.Close();
|
|
sl@0
|
1081 |
|
|
sl@0
|
1082 |
_LIT(KTestName, "testQueue");
|
|
sl@0
|
1083 |
|
|
sl@0
|
1084 |
test(KErrNone == templateQueue.CreateGlobal(KTestName, 986));
|
|
sl@0
|
1085 |
|
|
sl@0
|
1086 |
RMsgQueue<TTemplateTestData> templateQueue2;
|
|
sl@0
|
1087 |
test(KErrNone == templateQueue2.OpenGlobal(KTestName));
|
|
sl@0
|
1088 |
templateQueue.Close();
|
|
sl@0
|
1089 |
templateQueue2.Close();
|
|
sl@0
|
1090 |
|
|
sl@0
|
1091 |
|
|
sl@0
|
1092 |
test.Next(_L("Ending test.\n"));
|
|
sl@0
|
1093 |
test.End();
|
|
sl@0
|
1094 |
|
|
sl@0
|
1095 |
test.Close();
|
|
sl@0
|
1096 |
}
|
|
sl@0
|
1097 |
|
|
sl@0
|
1098 |
GLDEF_C TInt E32Main()
|
|
sl@0
|
1099 |
//
|
|
sl@0
|
1100 |
//
|
|
sl@0
|
1101 |
{
|
|
sl@0
|
1102 |
test.Title();
|
|
sl@0
|
1103 |
|
|
sl@0
|
1104 |
// Turn off evil lazy dll unloading
|
|
sl@0
|
1105 |
RLoader l;
|
|
sl@0
|
1106 |
test(l.Connect()==KErrNone);
|
|
sl@0
|
1107 |
test(l.CancelLazyDllUnload()==KErrNone);
|
|
sl@0
|
1108 |
l.Close();
|
|
sl@0
|
1109 |
|
|
sl@0
|
1110 |
RunTests();
|
|
sl@0
|
1111 |
return KErrNone;
|
|
sl@0
|
1112 |
}
|
|
sl@0
|
1113 |
|