VirtualBox

source: vbox/trunk/src/VBox/Runtime/testcase/tstRTMemCache.cpp@ 32878

Last change on this file since 32878 was 28800, checked in by vboxsync, 15 years ago

Automated rebranding to Oracle copyright/license strings via filemuncher
  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 11.3 KB
Line 
1/* $Id: tstRTMemCache.cpp 28800 2010-04-27 08:22:32Z vboxsync $ */
2/** @file
3 * IPRT Testcase - RTMemCache.
4 */
5
6/*
7 * Copyright (C) 2010 Oracle Corporation
8 *
9 * This file is part of VirtualBox Open Source Edition (OSE), as
10 * available from http://www.virtualbox.org. This file is free software;
11 * you can redistribute it and/or modify it under the terms of the GNU
12 * General Public License (GPL) as published by the Free Software
13 * Foundation, in version 2 as it comes in the "COPYING" file of the
14 * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
15 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
16 *
17 * The contents of this file may alternatively be used under the terms
18 * of the Common Development and Distribution License Version 1.0
19 * (CDDL) only, as it comes in the "COPYING.CDDL" file of the
20 * VirtualBox OSE distribution, in which case the provisions of the
21 * CDDL are applicable instead of those of the GPL.
22 *
23 * You may elect to license modified versions of this file under the
24 * terms and conditions of either the GPL or the CDDL or both.
25 */
26
27/*******************************************************************************
28* Header Files *
29*******************************************************************************/
30#include <iprt/memcache.h>
31
32#include <iprt/asm.h>
33#include <iprt/err.h>
34#include <iprt/initterm.h>
35#include <iprt/mem.h>
36#include <iprt/param.h>
37#include <iprt/rand.h>
38#include <iprt/string.h>
39#include <iprt/semaphore.h>
40#include <iprt/test.h>
41#include <iprt/time.h>
42#include <iprt/thread.h>
43
44
45/*******************************************************************************
46* Structures and Typedefs *
47*******************************************************************************/
48typedef struct TST3THREAD
49{
50 RTTHREAD hThread;
51 RTSEMEVENTMULTI hEvt;
52 uint64_t volatile cIterations;
53 uint32_t cbObject;
54 bool fUseCache;
55} TST3THREAD, *PTST3THREAD;
56
57
58/*******************************************************************************
59* Global Variables *
60*******************************************************************************/
61/** The test handle */
62static RTTEST g_hTest;
63/** Global mem cache handle for use in some of the testcases. */
64static RTMEMCACHE g_hMemCache;
65/** Stop indicator for tst3 threads. */
66static bool volatile g_fTst3Stop;
67
68
69/**
70 * Basic API checks.
71 * We'll return if any of these fails.
72 */
73static void tst1(void)
74{
75 RTTestISub("Basics");
76
77 /* Create one without constructor or destructor. */
78 uint32_t const cObjects = PAGE_SIZE * 2 / 256;
79 RTMEMCACHE hMemCache;
80 RTTESTI_CHECK_RC_RETV(RTMemCacheCreate(&hMemCache, 256, cObjects, 32, NULL, NULL, NULL, 0 /*fFlags*/), VINF_SUCCESS);
81 RTTESTI_CHECK_RETV(hMemCache != NIL_RTMEMCACHE);
82
83 /* Allocate a bit and free it again. */
84 void *pv = NULL;
85 RTTESTI_CHECK_RC_RETV(RTMemCacheAllocEx(hMemCache, &pv), VINF_SUCCESS);
86 RTTESTI_CHECK_RETV(pv != NULL);
87 RTTESTI_CHECK_RETV(RT_ALIGN_P(pv, 32) == pv);
88 RTMemCacheFree(hMemCache, pv);
89
90 RTTESTI_CHECK((pv = RTMemCacheAlloc(hMemCache)) != NULL);
91 RTMemCacheFree(hMemCache, pv);
92
93 /* Allocate everything and free it again, checking size constraints. */
94 for (uint32_t iLoop = 0; iLoop < 20; iLoop++)
95 {
96 /* Allocate everything. */
97 void *apv[cObjects];
98 for (uint32_t i = 0; i < cObjects; i++)
99 {
100 apv[i] = NULL;
101 RTTESTI_CHECK_RC(RTMemCacheAllocEx(hMemCache, &apv[i]), VINF_SUCCESS);
102 }
103
104 /* Check that we've got it all. */
105 int rc;
106 RTTESTI_CHECK_RC(rc = RTMemCacheAllocEx(hMemCache, &pv), VERR_MEM_CACHE_MAX_SIZE);
107 if (RT_SUCCESS(rc))
108 RTMemCacheFree(hMemCache, pv);
109
110 RTTESTI_CHECK((pv = RTMemCacheAlloc(hMemCache)) == NULL);
111 RTMemCacheFree(hMemCache, pv);
112
113 /* Free all the allocations. */
114 for (uint32_t i = 0; i < cObjects; i++)
115 {
116 RTMemCacheFree(hMemCache, apv[i]);
117
118 RTTESTI_CHECK((pv = RTMemCacheAlloc(hMemCache)) != NULL);
119 RTMemCacheFree(hMemCache, pv);
120 }
121 }
122
123 /* Destroy it. */
124 RTTESTI_CHECK_RC(RTMemCacheDestroy(hMemCache), VINF_SUCCESS);
125 RTTESTI_CHECK_RC(RTMemCacheDestroy(NIL_RTMEMCACHE), VINF_SUCCESS);
126}
127
128
129
130/** Constructor for tst2. */
131static DECLCALLBACK(int) tst2Ctor(RTMEMCACHE hMemCache, void *pvObj, void *pvUser)
132{
133 RTTESTI_CHECK(hMemCache == g_hMemCache);
134 RTTESTI_CHECK(ASMMemIsAll8(pvObj, 256, 0) == NULL);
135
136 if (*(bool *)pvUser)
137 return VERR_RESOURCE_BUSY;
138
139 strcat((char *)pvObj, "ctor was called\n");
140 return VINF_SUCCESS;
141}
142
143
144/** Destructor for tst2. Checks that it was constructed and used twice. */
145static DECLCALLBACK(void) tst2Dtor(RTMEMCACHE hMemCache, void *pvObj, void *pvUser)
146{
147 RTTESTI_CHECK(!strcmp((char *)pvObj, "ctor was called\nused\nused\n"));
148 strcat((char *)pvObj, "dtor was called\n");
149}
150
151/**
152 * Test constructor / destructor.
153 */
154static void tst2(void)
155{
156 RTTestISub("Ctor/Dtor");
157
158 /* Create one without constructor or destructor. */
159 bool fFail = false;
160 uint32_t const cObjects = PAGE_SIZE * 2 / 256;
161 RTTESTI_CHECK_RC_RETV(RTMemCacheCreate(&g_hMemCache, 256, cObjects, 32, tst2Ctor, tst2Dtor, &fFail, 0 /*fFlags*/), VINF_SUCCESS);
162
163 /* A failure run first. */
164 fFail = true;
165 void *pv = (void *)0x42;
166 RTTESTI_CHECK_RC_RETV(RTMemCacheAllocEx(g_hMemCache, &pv), VERR_RESOURCE_BUSY);
167 RTTESTI_CHECK(pv == (void *)0x42);
168 fFail = false;
169
170 /* To two rounds where we allocate all the objects and free them again. */
171 for (uint32_t iLoop = 0; iLoop < 2; iLoop++)
172 {
173 void *apv[cObjects];
174 for (uint32_t i = 0; i < cObjects; i++)
175 {
176 apv[i] = NULL;
177 RTTESTI_CHECK_RC_RETV(RTMemCacheAllocEx(g_hMemCache, &apv[i]), VINF_SUCCESS);
178 if (iLoop == 0)
179 RTTESTI_CHECK(!strcmp((char *)apv[i], "ctor was called\n"));
180 else
181 RTTESTI_CHECK(!strcmp((char *)apv[i], "ctor was called\nused\n"));
182 strcat((char *)apv[i], "used\n");
183 }
184
185 RTTESTI_CHECK_RETV((pv = RTMemCacheAlloc(g_hMemCache)) == NULL);
186 RTMemCacheFree(g_hMemCache, pv);
187
188 for (uint32_t i = 0; i < cObjects; i++)
189 RTMemCacheFree(g_hMemCache, apv[i]);
190 }
191
192 /* Cone, destroy the cache. */
193 RTTESTI_CHECK_RC(RTMemCacheDestroy(g_hMemCache), VINF_SUCCESS);
194}
195
196
197/**
198 * Thread that allocates
199 * @returns
200 * @param hThreadSelf The thread.
201 * @param pvArg Pointer to fUseCache.
202 */
203static DECLCALLBACK(int) tst3Thread(RTTHREAD hThreadSelf, void *pvArg)
204{
205 PTST3THREAD pThread = (PTST3THREAD)(pvArg);
206 size_t cbObject = pThread->cbObject;
207 uint64_t cIterations = 0;
208
209 /* wait for the kick-off */
210 RTTEST_CHECK_RC_OK(g_hTest, RTSemEventMultiWait(pThread->hEvt, RT_INDEFINITE_WAIT));
211
212 /* allocate and free loop */
213 if (pThread->fUseCache)
214 {
215 while (!g_fTst3Stop)
216 {
217 void *apv[64];
218 for (unsigned i = 0; i < RT_ELEMENTS(apv); i++)
219 {
220 apv[i] = RTMemCacheAlloc(g_hMemCache);
221 RTTEST_CHECK(g_hTest, apv[i] != NULL);
222 }
223 for (unsigned i = 0; i < RT_ELEMENTS(apv); i++)
224 RTMemCacheFree(g_hMemCache, apv[i]);
225
226 cIterations += RT_ELEMENTS(apv);
227 }
228 }
229 else
230 {
231 while (!g_fTst3Stop)
232 {
233 void *apv[64];
234
235 for (unsigned i = 0; i < RT_ELEMENTS(apv); i++)
236 {
237 apv[i] = RTMemAlloc(cbObject);
238 RTTEST_CHECK(g_hTest, apv[i] != NULL);
239 }
240
241 for (unsigned i = 0; i < RT_ELEMENTS(apv); i++)
242 RTMemFree(apv[i]);
243
244 cIterations += RT_ELEMENTS(apv);
245 }
246 }
247
248 /* report back the status */
249 pThread->cIterations = cIterations;
250 return VINF_SUCCESS;
251}
252
253/**
254 * Time constrained test with and unlimited N threads.
255 */
256static void tst3(uint32_t cThreads, uint32_t cbObject, int iMethod, uint32_t cSecs)
257{
258 RTTestISubF("Benchmark - %u threads, %u bytes, %u secs, %s", cThreads, cbObject, cSecs,
259 iMethod == 0 ? "RTMemCache"
260 : "RTMemAlloc");
261
262 /*
263 * Create a cache with unlimited space, a start semaphore and line up
264 * the threads.
265 */
266 RTTESTI_CHECK_RC_RETV(RTMemCacheCreate(&g_hMemCache, cbObject, 0 /*cbAlignment*/, UINT32_MAX, NULL, NULL, NULL, 0 /*fFlags*/), VINF_SUCCESS);
267
268 RTSEMEVENTMULTI hEvt;
269 RTTESTI_CHECK_RC_OK_RETV(RTSemEventMultiCreate(&hEvt));
270
271 TST3THREAD aThreads[64];
272 RTTESTI_CHECK_RETV(cThreads < RT_ELEMENTS(aThreads));
273
274 ASMAtomicWriteBool(&g_fTst3Stop, false);
275 for (uint32_t i = 0; i < cThreads; i++)
276 {
277 aThreads[i].hThread = NIL_RTTHREAD;
278 aThreads[i].cIterations = 0;
279 aThreads[i].fUseCache = iMethod == 0;
280 aThreads[i].cbObject = cbObject;
281 aThreads[i].hEvt = hEvt;
282 RTTESTI_CHECK_RC_OK_RETV(RTThreadCreateF(&aThreads[i].hThread, tst3Thread, &aThreads[i], 0,
283 RTTHREADTYPE_DEFAULT, RTTHREADFLAGS_WAITABLE, "tst3-%u", i));
284 }
285
286 /*
287 * Start the race.
288 */
289 RTTimeNanoTS(); /* warmup */
290
291 uint64_t uStartTS = RTTimeNanoTS();
292 RTTESTI_CHECK_RC_OK_RETV(RTSemEventMultiSignal(hEvt));
293 RTThreadSleep(cSecs * 1000);
294 ASMAtomicWriteBool(&g_fTst3Stop, true);
295 for (uint32_t i = 0; i < cThreads; i++)
296 RTTESTI_CHECK_RC_OK_RETV(RTThreadWait(aThreads[i].hThread, 60*1000, NULL));
297 uint64_t cElapsedNS = RTTimeNanoTS() - uStartTS;
298
299 /*
300 * Sum up the counts.
301 */
302 uint64_t cIterations = 0;
303 for (uint32_t i = 0; i < cThreads; i++)
304 cIterations += aThreads[i].cIterations;
305
306 RTTestIPrintf(RTTESTLVL_ALWAYS, "%'8u iterations per second, %'llu ns on avg\n",
307 (unsigned)((long double)cIterations * 1000000000.0 / cElapsedNS),
308 cElapsedNS / cIterations);
309
310 /* clean up */
311 RTTESTI_CHECK_RC(RTMemCacheDestroy(g_hMemCache), VINF_SUCCESS);
312 RTTESTI_CHECK_RC_OK(RTSemEventMultiDestroy(hEvt));
313}
314
315static void tst3AllMethods(uint32_t cThreads, uint32_t cbObject, uint32_t cSecs)
316{
317 tst3(cThreads, cbObject, 0, cSecs);
318 tst3(cThreads, cbObject, 1, cSecs);
319}
320
321
322int main(int argc, char **argv)
323{
324 RTTEST hTest;
325 int rc = RTTestInitAndCreate("tstRTMemCache", &hTest);
326 if (rc)
327 return rc;
328 RTTestBanner(hTest);
329 g_hTest = hTest;
330
331 tst1();
332 tst2();
333 if (RTTestIErrorCount() == 0)
334 {
335 uint32_t cSecs = argc == 1 ? 5 : 2;
336 /* threads, cbObj, cSecs */
337 tst3AllMethods( 1, 256, cSecs);
338 tst3AllMethods( 1, 32, cSecs);
339 tst3AllMethods( 1, 8, cSecs);
340 tst3AllMethods( 1, 2, cSecs);
341 tst3AllMethods( 1, 1, cSecs);
342
343 tst3AllMethods( 3, 256, cSecs);
344 tst3AllMethods( 3, 128, cSecs);
345 tst3AllMethods( 3, 64, cSecs);
346 tst3AllMethods( 3, 32, cSecs);
347 tst3AllMethods( 3, 2, cSecs);
348 tst3AllMethods( 3, 1, cSecs);
349
350 tst3AllMethods( 16, 32, cSecs);
351 }
352
353 /*
354 * Summary.
355 */
356 return RTTestSummaryAndDestroy(hTest);
357}
358
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette