VirtualBox

source: vbox/trunk/src/VBox/Runtime/testcase/tstRTStrCache.cpp@ 53582

Last change on this file since 53582 was 46211, checked in by vboxsync, 12 years ago

More strcache testing and some tuning.
  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 11.1 KB
Line 
1/* $Id: tstRTStrCache.cpp 46211 2013-05-22 11:00:02Z vboxsync $ */
2/** @file
3 * IPRT Testcase - StrCache.
4 */
5
6/*
7 * Copyright (C) 2009-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/strcache.h>
31
32#include <iprt/asm.h>
33#include <iprt/ctype.h>
34#include <iprt/err.h>
35#include <iprt/initterm.h>
36#include <iprt/mem.h>
37#include <iprt/rand.h>
38#include <iprt/string.h>
39#include <iprt/test.h>
40#include <iprt/thread.h>
41#include <iprt/time.h>
42
43
44static void tstShowStats(RTSTRCACHE hStrCache)
45{
46 size_t cbStrings;
47 size_t cbChunks;
48 size_t cbBigEntries;
49 uint32_t cHashCollisions;
50 uint32_t cHashCollisions2;
51 uint32_t cHashInserts;
52 uint32_t cRehashes;
53 uint32_t cStrings = RTStrCacheGetStats(hStrCache, &cbStrings, &cbChunks, &cbBigEntries,
54 &cHashCollisions, &cHashCollisions2, &cHashInserts, &cRehashes);
55 if (cbStrings == UINT32_MAX)
56 {
57 RTTESTI_CHECK(!RTStrCacheIsRealImpl());
58 return;
59 }
60
61 RTTestIValue("Strings", cStrings, RTTESTUNIT_OCCURRENCES);
62 RTTestIValue("Memory overhead", (uint64_t)(cbChunks + cbBigEntries - cbStrings) * 100 / cbStrings, RTTESTUNIT_PCT);
63 if (cHashInserts > 0)
64 {
65 RTTestIValue("Collisions", (uint64_t)cHashCollisions * 100 / cHashInserts, RTTESTUNIT_PCT);
66 RTTestIValue("Collisions2", (uint64_t)cHashCollisions2 * 100 / cHashInserts, RTTESTUNIT_PCT);
67 }
68 RTTestIPrintf(RTTESTLVL_ALWAYS, "cHashInserts=%u cHashCollisions=%u cHashCollisions2=%u cRehashes=%u\n",
69 cHashInserts, cHashCollisions, cHashCollisions2, cRehashes);
70 RTTestIPrintf(RTTESTLVL_ALWAYS, "cbChunks=%zu cbBigEntries=%zu cbStrings=%zu\n", cbChunks, cbBigEntries, cbStrings);
71}
72
73
74/**
75 * Check hash and memory performance.
76 */
77static void tst2(void)
78{
79 RTTestISub("Hash performance");
80
81 /*
82 * Generate test strings using a specific pseudo random generator.
83 */
84 size_t cbStrings = 0;
85 char *apszTests[8192];
86 RTRAND hRand;
87 RTTESTI_CHECK_RC_RETV(RTRandAdvCreateParkMiller(&hRand), VINF_SUCCESS);
88 for (uint32_t i = 0; i < 8192; i++)
89 {
90 char szBuf[8192];
91 uint32_t cch = RTRandAdvU32Ex(hRand, 3, sizeof(szBuf) - 1);
92 RTRandAdvBytes(hRand, szBuf, cch);
93 szBuf[cch] = '\0';
94 for (uint32_t off = 0; off < cch; off++)
95 {
96 uint8_t b = szBuf[off];
97 b &= 0x7f;
98 if (!b || b == 0x7f)
99 b = ' ';
100 else if (RTLocCIsCntrl(b) && b != '\n' && b != '\r' && b != '\t')
101 b += 0x30;
102 szBuf[off] = b;
103 }
104 apszTests[i] = (char *)RTMemDup(szBuf, cch + 1);
105 RTTESTI_CHECK_RETV(apszTests[i] != NULL);
106 cbStrings += cch + 1;
107 }
108 RTRandAdvDestroy(hRand);
109 RTTestIValue("Average string", cbStrings / RT_ELEMENTS(apszTests), RTTESTUNIT_BYTES);
110
111 /*
112 * Test new insertion first time around.
113 */
114 RTSTRCACHE hStrCache;
115 RTTESTI_CHECK_RC_RETV(RTStrCacheCreate(&hStrCache, "hash performance"), VINF_SUCCESS);
116
117 uint64_t nsTsStart = RTTimeNanoTS();
118 for (uint32_t i = 0; i < RT_ELEMENTS(apszTests); i++)
119 RTTESTI_CHECK_RETV(RTStrCacheEnter(hStrCache, apszTests[i]) != NULL);
120 uint64_t cNsElapsed = RTTimeNanoTS() - nsTsStart;
121 RTTestIValue("First insert", cNsElapsed / RT_ELEMENTS(apszTests), RTTESTUNIT_NS_PER_CALL);
122
123 /*
124 * Insert existing strings.
125 */
126 nsTsStart = RTTimeNanoTS();
127 for (uint32_t i = 0; i < 8192; i++)
128 RTTESTI_CHECK(RTStrCacheEnter(hStrCache, apszTests[i]) != NULL);
129 cNsElapsed = RTTimeNanoTS() - nsTsStart;
130 RTTestIValue("Duplicate insert", cNsElapsed / RT_ELEMENTS(apszTests), RTTESTUNIT_NS_PER_CALL);
131
132 tstShowStats(hStrCache);
133 RTTESTI_CHECK_RC(RTStrCacheDestroy(hStrCache), VINF_SUCCESS);
134}
135
136
137/**
138 * Basic API checks.
139 * We'll return if any of these fails.
140 */
141static void tst1(RTSTRCACHE hStrCache)
142{
143 const char *psz;
144
145 /* Simple string entering and length. */
146 RTTESTI_CHECK_RETV(psz = RTStrCacheEnter(hStrCache, "abcdefgh"));
147 RTTESTI_CHECK_RETV(strcmp(psz, "abcdefgh") == 0);
148 RTTESTI_CHECK_RETV(RTStrCacheLength(psz) == strlen("abcdefgh"));
149 RTTESTI_CHECK_RETV(RTStrCacheRelease(hStrCache, psz) == 0);
150
151 RTTESTI_CHECK_RETV(psz = RTStrCacheEnter(hStrCache, "abcdefghijklmnopqrstuvwxyz"));
152 RTTESTI_CHECK_RETV(strcmp(psz, "abcdefghijklmnopqrstuvwxyz") == 0);
153 RTTESTI_CHECK_RETV(RTStrCacheLength(psz) == strlen("abcdefghijklmnopqrstuvwxyz"));
154 RTTESTI_CHECK_RETV(RTStrCacheRelease(hStrCache, psz) == 0);
155
156 /* Unterminated strings. */
157 RTTESTI_CHECK_RETV(psz = RTStrCacheEnterN(hStrCache, "0123456789", 3));
158 RTTESTI_CHECK_RETV(strcmp(psz, "012") == 0);
159 RTTESTI_CHECK_RETV(RTStrCacheLength(psz) == strlen("012"));
160 RTTESTI_CHECK_RETV(RTStrCacheRelease(hStrCache, psz) == 0);
161
162 RTTESTI_CHECK_RETV(psz = RTStrCacheEnterN(hStrCache, "0123456789abcdefghijklmnopqrstuvwxyz", 16));
163 RTTESTI_CHECK_RETV(strcmp(psz, "0123456789abcdef") == 0);
164 RTTESTI_CHECK_RETV(RTStrCacheLength(psz) == strlen("0123456789abcdef"));
165 RTTESTI_CHECK_RETV(RTStrCacheRelease(hStrCache, psz) == 0);
166
167 /* String referencing. */
168 char szTest[4096+16];
169 memset(szTest, 'a', sizeof(szTest));
170 char szTest2[4096+16];
171 memset(szTest2, 'f', sizeof(szTest));
172 for (int32_t i = 4096; i > 3; i /= 3)
173 {
174 void *pv2;
175 RTTESTI_CHECK_RETV(psz = RTStrCacheEnterN(hStrCache, szTest, i));
176 RTTESTI_CHECK_MSG_RETV((pv2 = ASMMemIsAll8(psz, i, 'a')) == NULL && !psz[i], ("i=%#x psz=%p off=%#x\n", i, psz, (uintptr_t)pv2 - (uintptr_t)psz));
177 RTTESTI_CHECK(RTStrCacheRetain(psz) == 2);
178 RTTESTI_CHECK(RTStrCacheRetain(psz) == 3);
179 RTTESTI_CHECK(RTStrCacheRetain(psz) == 4);
180 RTTESTI_CHECK_MSG_RETV((pv2 = ASMMemIsAll8(psz, i, 'a')) == NULL && !psz[i], ("i=%#x psz=%p off=%#x\n", i, psz, (uintptr_t)pv2 - (uintptr_t)psz));
181 RTTESTI_CHECK(RTStrCacheRelease(hStrCache, psz) == 3);
182 RTTESTI_CHECK_MSG_RETV((pv2 = ASMMemIsAll8(psz, i, 'a')) == NULL && !psz[i], ("i=%#x psz=%p off=%#x\n", i, psz, (uintptr_t)pv2 - (uintptr_t)psz));
183 RTTESTI_CHECK(RTStrCacheRetain(psz) == 4);
184 RTTESTI_CHECK(RTStrCacheRetain(psz) == 5);
185 RTTESTI_CHECK(RTStrCacheRetain(psz) == 6);
186 RTTESTI_CHECK(RTStrCacheRelease(hStrCache, psz) == 5);
187 RTTESTI_CHECK(RTStrCacheRelease(hStrCache, psz) == 4);
188 RTTESTI_CHECK_MSG_RETV((pv2 = ASMMemIsAll8(psz, i, 'a')) == NULL && !psz[i], ("i=%#x psz=%p off=%#x\n", i, psz, (uintptr_t)pv2 - (uintptr_t)psz));
189
190 for (uint32_t cRefs = 3;; cRefs--)
191 {
192 RTTESTI_CHECK(RTStrCacheRelease(hStrCache, psz) == cRefs);
193 if (cRefs == 0)
194 break;
195 RTTESTI_CHECK_MSG_RETV((pv2 = ASMMemIsAll8(psz, i, 'a')) == NULL && !psz[i], ("i=%#x psz=%p off=%#x cRefs=%d\n", i, psz, (uintptr_t)pv2 - (uintptr_t)psz, cRefs));
196 for (uint32_t j = 0; j < 42; j++)
197 {
198 const char *psz2;
199 RTTESTI_CHECK_RETV(psz2 = RTStrCacheEnterN(hStrCache, szTest2, i));
200 RTTESTI_CHECK_RETV(psz2 != psz);
201 RTTESTI_CHECK(RTStrCacheRelease(hStrCache, psz2) == 0);
202 RTTESTI_CHECK_MSG_RETV((pv2 = ASMMemIsAll8(psz, i, 'a')) == NULL && !psz[i], ("i=%#x psz=%p off=%#x cRefs=%d\n", i, psz, (uintptr_t)pv2 - (uintptr_t)psz, cRefs));
203 }
204 }
205 }
206
207 /* Lots of allocations. */
208 memset(szTest, 'b', sizeof(szTest));
209 memset(szTest2, 'e', sizeof(szTest));
210 const char *pszTest1Rets[4096 + 16];
211 const char *pszTest2Rets[4096 + 16];
212 for (uint32_t i = 1; i < RT_ELEMENTS(pszTest1Rets); i++)
213 {
214 RTTESTI_CHECK(pszTest1Rets[i] = RTStrCacheEnterN(hStrCache, szTest, i));
215 RTTESTI_CHECK(strlen(pszTest1Rets[i]) == i);
216 RTTESTI_CHECK(pszTest2Rets[i] = RTStrCacheEnterN(hStrCache, szTest2, i));
217 RTTESTI_CHECK(strlen(pszTest2Rets[i]) == i);
218 }
219
220 if (RTStrCacheIsRealImpl())
221 {
222 for (uint32_t i = 1; i < RT_ELEMENTS(pszTest1Rets); i++)
223 {
224 uint32_t cRefs;
225 const char *psz1, *psz2;
226 RTTESTI_CHECK((psz1 = RTStrCacheEnterN(hStrCache, szTest, i)) == pszTest1Rets[i]);
227 RTTESTI_CHECK((psz2 = RTStrCacheEnterN(hStrCache, szTest2, i)) == pszTest2Rets[i]);
228 RTTESTI_CHECK_MSG((cRefs = RTStrCacheRelease(hStrCache, psz1)) == 1, ("cRefs=%#x i=%#x\n", cRefs, i));
229 RTTESTI_CHECK_MSG((cRefs = RTStrCacheRelease(hStrCache, psz2)) == 1, ("cRefs=%#x i=%#x\n", cRefs, i));
230 }
231 }
232
233 for (uint32_t i = 1; i < RT_ELEMENTS(pszTest1Rets); i++)
234 {
235 uint32_t cRefs;
236 RTTESTI_CHECK(strlen(pszTest1Rets[i]) == i);
237 RTTESTI_CHECK_MSG((cRefs = RTStrCacheRelease(hStrCache, pszTest1Rets[i])) == 0, ("cRefs=%#x i=%#x\n", cRefs, i));
238 RTTESTI_CHECK(strlen(pszTest2Rets[i]) == i);
239 RTTESTI_CHECK_MSG((cRefs = RTStrCacheRelease(hStrCache, pszTest2Rets[i])) == 0, ("cRefs=%#x i=%#x\n", cRefs, i));
240 }
241}
242
243
244int main()
245{
246 RTTEST hTest;
247 int rc = RTTestInitAndCreate("tstRTStrCache", &hTest);
248 if (rc)
249 return rc;
250 RTTestBanner(hTest);
251
252 /*
253 * Smoke tests using first the default and then a custom pool.
254 */
255 RTTestSub(hTest, "Smoke test on default cache");
256 tst1(RTSTRCACHE_DEFAULT);
257
258 RTTestSub(hTest, "Smoke test on custom cache");
259 RTSTRCACHE hStrCache;
260 RTTESTI_CHECK_RC(rc = RTStrCacheCreate(&hStrCache, "test 2a"), VINF_SUCCESS);
261 if (RT_SUCCESS(rc))
262 RTTESTI_CHECK_RC(rc = RTStrCacheDestroy(hStrCache), VINF_SUCCESS);
263 RTTESTI_CHECK_RC(rc = RTStrCacheDestroy(NIL_RTSTRCACHE), VINF_SUCCESS);
264 RTTESTI_CHECK_RC(rc = RTStrCacheDestroy(RTSTRCACHE_DEFAULT), VINF_SUCCESS);
265 RTTESTI_CHECK_RC(rc = RTStrCacheDestroy(RTSTRCACHE_DEFAULT), VINF_SUCCESS);
266
267 RTTESTI_CHECK_RC(rc = RTStrCacheCreate(&hStrCache, "test 2b"), VINF_SUCCESS);
268 if (RT_SUCCESS(rc))
269 {
270 tst1(hStrCache);
271 RTTESTI_CHECK_RC(rc = RTStrCacheDestroy(hStrCache), VINF_SUCCESS);
272 }
273
274 /*
275 * Cache performance on relatively real world examples.
276 */
277 tst2();
278
279 /*
280 * Summary.
281 */
282 return RTTestSummaryAndDestroy(hTest);
283}
284
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