1 | /* $Id: tstRTHeapSimple.cpp 28800 2010-04-27 08:22:32Z vboxsync $ */
|
---|
2 | /** @file
|
---|
3 | * IPRT Testcase - Simple Heap.
|
---|
4 | */
|
---|
5 |
|
---|
6 | /*
|
---|
7 | * Copyright (C) 2006-2007 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/heap.h>
|
---|
31 | #include <iprt/initterm.h>
|
---|
32 | #include <iprt/err.h>
|
---|
33 | #include <iprt/stream.h>
|
---|
34 | #include <iprt/string.h>
|
---|
35 | #include <iprt/param.h>
|
---|
36 | #include <iprt/assert.h>
|
---|
37 | #include <iprt/log.h>
|
---|
38 | #include <iprt/test.h>
|
---|
39 |
|
---|
40 |
|
---|
41 | int main(int argc, char *argv[])
|
---|
42 | {
|
---|
43 | /*
|
---|
44 | * Init runtime.
|
---|
45 | */
|
---|
46 | RTTEST hTest;
|
---|
47 | int rc = RTTestInitAndCreate("tstRTHeapSimple", &hTest);
|
---|
48 | if (rc)
|
---|
49 | return rc;
|
---|
50 | RTTestBanner(hTest);
|
---|
51 |
|
---|
52 | /*
|
---|
53 | * Create a heap.
|
---|
54 | */
|
---|
55 | RTTestSub(hTest, "Basics");
|
---|
56 | static uint8_t s_abMem[128*1024];
|
---|
57 | RTHEAPSIMPLE Heap;
|
---|
58 | RTTESTI_CHECK_RC(rc = RTHeapSimpleInit(&Heap, &s_abMem[1], sizeof(s_abMem) - 1), VINF_SUCCESS);
|
---|
59 | if (RT_FAILURE(rc))
|
---|
60 | return RTTestSummaryAndDestroy(hTest);
|
---|
61 |
|
---|
62 | /*
|
---|
63 | * Try allocate.
|
---|
64 | */
|
---|
65 | static struct TstHeapSimpleOps
|
---|
66 | {
|
---|
67 | size_t cb;
|
---|
68 | unsigned uAlignment;
|
---|
69 | void *pvAlloc;
|
---|
70 | unsigned iFreeOrder;
|
---|
71 | } s_aOps[] =
|
---|
72 | {
|
---|
73 | { 16, 0, NULL, 0 }, // 0
|
---|
74 | { 16, 4, NULL, 1 },
|
---|
75 | { 16, 8, NULL, 2 },
|
---|
76 | { 16, 16, NULL, 5 },
|
---|
77 | { 16, 32, NULL, 4 },
|
---|
78 | { 32, 0, NULL, 3 }, // 5
|
---|
79 | { 31, 0, NULL, 6 },
|
---|
80 | { 1024, 0, NULL, 8 },
|
---|
81 | { 1024, 32, NULL, 10 },
|
---|
82 | { 1024, 32, NULL, 12 },
|
---|
83 | { PAGE_SIZE, PAGE_SIZE, NULL, 13 }, // 10
|
---|
84 | { 1024, 32, NULL, 9 },
|
---|
85 | { PAGE_SIZE, 32, NULL, 11 },
|
---|
86 | { PAGE_SIZE, PAGE_SIZE, NULL, 14 },
|
---|
87 | { 16, 0, NULL, 15 },
|
---|
88 | { 9, 0, NULL, 7 }, // 15
|
---|
89 | { 16, 0, NULL, 7 },
|
---|
90 | { 36, 0, NULL, 7 },
|
---|
91 | { 16, 0, NULL, 7 },
|
---|
92 | { 12344, 0, NULL, 7 },
|
---|
93 | { 50, 0, NULL, 7 }, // 20
|
---|
94 | { 16, 0, NULL, 7 },
|
---|
95 | };
|
---|
96 | unsigned i;
|
---|
97 | RTHeapSimpleDump(Heap, (PFNRTHEAPSIMPLEPRINTF)RTPrintf); /** @todo Add some detail info output with a signature identical to RTPrintf. */
|
---|
98 | size_t cbBefore = RTHeapSimpleGetFreeSize(Heap);
|
---|
99 | static char szFill[] = "01234567890abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
|
---|
100 |
|
---|
101 | /* allocate */
|
---|
102 | for (i = 0; i < RT_ELEMENTS(s_aOps); i++)
|
---|
103 | {
|
---|
104 | s_aOps[i].pvAlloc = RTHeapSimpleAlloc(Heap, s_aOps[i].cb, s_aOps[i].uAlignment);
|
---|
105 | RTTESTI_CHECK_MSG(s_aOps[i].pvAlloc, ("RTHeapSimpleAlloc(%p, %#x, %#x,) -> NULL i=%d\n", (void *)Heap, s_aOps[i].cb, s_aOps[i].uAlignment, i));
|
---|
106 | if (!s_aOps[i].pvAlloc)
|
---|
107 | return RTTestSummaryAndDestroy(hTest);
|
---|
108 |
|
---|
109 | memset(s_aOps[i].pvAlloc, szFill[i], s_aOps[i].cb);
|
---|
110 | RTTESTI_CHECK_MSG(RT_ALIGN_P(s_aOps[i].pvAlloc, (s_aOps[i].uAlignment ? s_aOps[i].uAlignment : 8)) == s_aOps[i].pvAlloc,
|
---|
111 | ("RTHeapSimpleAlloc(%p, %#x, %#x,) -> %p\n", (void *)Heap, s_aOps[i].cb, s_aOps[i].uAlignment, i));
|
---|
112 | if (!s_aOps[i].pvAlloc)
|
---|
113 | return RTTestSummaryAndDestroy(hTest);
|
---|
114 | }
|
---|
115 |
|
---|
116 | /* free and allocate the same node again. */
|
---|
117 | for (i = 0; i < RT_ELEMENTS(s_aOps); i++)
|
---|
118 | {
|
---|
119 | if (!s_aOps[i].pvAlloc)
|
---|
120 | continue;
|
---|
121 | //RTPrintf("debug: i=%d pv=%#x cb=%#zx align=%#zx cbReal=%#zx\n", i, s_aOps[i].pvAlloc,
|
---|
122 | // s_aOps[i].cb, s_aOps[i].uAlignment, RTHeapSimpleSize(Heap, s_aOps[i].pvAlloc));
|
---|
123 | size_t cbBeforeSub = RTHeapSimpleGetFreeSize(Heap);
|
---|
124 | RTHeapSimpleFree(Heap, s_aOps[i].pvAlloc);
|
---|
125 | size_t cbAfterSubFree = RTHeapSimpleGetFreeSize(Heap);
|
---|
126 |
|
---|
127 | void *pv;
|
---|
128 | pv = RTHeapSimpleAlloc(Heap, s_aOps[i].cb, s_aOps[i].uAlignment);
|
---|
129 | RTTESTI_CHECK_MSG(pv, ("RTHeapSimpleAlloc(%p, %#x, %#x,) -> NULL i=%d\n", (void *)Heap, s_aOps[i].cb, s_aOps[i].uAlignment, i));
|
---|
130 | if (!pv)
|
---|
131 | return RTTestSummaryAndDestroy(hTest);
|
---|
132 | //RTPrintf("debug: i=%d pv=%p cbReal=%#zx cbBeforeSub=%#zx cbAfterSubFree=%#zx cbAfterSubAlloc=%#zx \n", i, pv, RTHeapSimpleSize(Heap, pv),
|
---|
133 | // cbBeforeSub, cbAfterSubFree, RTHeapSimpleGetFreeSize(Heap));
|
---|
134 | if (pv != s_aOps[i].pvAlloc)
|
---|
135 | RTTestIPrintf(RTTESTLVL_ALWAYS, "Warning: Free+Alloc returned different address. new=%p old=%p i=%d\n", pv, s_aOps[i].pvAlloc, i);
|
---|
136 | s_aOps[i].pvAlloc = pv;
|
---|
137 | size_t cbAfterSubAlloc = RTHeapSimpleGetFreeSize(Heap);
|
---|
138 | if (cbBeforeSub != cbAfterSubAlloc)
|
---|
139 | {
|
---|
140 | RTTestIPrintf(RTTESTLVL_ALWAYS, "Warning: cbBeforeSub=%#zx cbAfterSubFree=%#zx cbAfterSubAlloc=%#zx. i=%d\n",
|
---|
141 | cbBeforeSub, cbAfterSubFree, cbAfterSubAlloc, i);
|
---|
142 | //return 1; - won't work correctly until we start creating free block instead of donating memory on alignment.
|
---|
143 | }
|
---|
144 | }
|
---|
145 |
|
---|
146 | /* make a copy of the heap and the to-be-freed list. */
|
---|
147 | static uint8_t s_abMemCopy[sizeof(s_abMem)];
|
---|
148 | memcpy(s_abMemCopy, s_abMem, sizeof(s_abMem));
|
---|
149 | uintptr_t offDelta = (uintptr_t)&s_abMemCopy[0] - (uintptr_t)&s_abMem[0];
|
---|
150 | RTHEAPSIMPLE hHeapCopy = (RTHEAPSIMPLE)((uintptr_t)Heap + offDelta);
|
---|
151 | static struct TstHeapSimpleOps s_aOpsCopy[RT_ELEMENTS(s_aOps)];
|
---|
152 | memcpy(&s_aOpsCopy[0], &s_aOps[0], sizeof(s_aOps));
|
---|
153 |
|
---|
154 | /* free it in a specific order. */
|
---|
155 | int cFreed = 0;
|
---|
156 | for (i = 0; i < RT_ELEMENTS(s_aOps); i++)
|
---|
157 | {
|
---|
158 | unsigned j;
|
---|
159 | for (j = 0; j < RT_ELEMENTS(s_aOps); j++)
|
---|
160 | {
|
---|
161 | if ( s_aOps[j].iFreeOrder != i
|
---|
162 | || !s_aOps[j].pvAlloc)
|
---|
163 | continue;
|
---|
164 | //RTPrintf("j=%d i=%d free=%d cb=%d pv=%p\n", j, i, RTHeapSimpleGetFreeSize(Heap), s_aOps[j].cb, s_aOps[j].pvAlloc);
|
---|
165 | RTHeapSimpleFree(Heap, s_aOps[j].pvAlloc);
|
---|
166 | s_aOps[j].pvAlloc = NULL;
|
---|
167 | cFreed++;
|
---|
168 | }
|
---|
169 | }
|
---|
170 | RTTESTI_CHECK(cFreed == RT_ELEMENTS(s_aOps));
|
---|
171 | RTTestIPrintf(RTTESTLVL_ALWAYS, "i=done free=%d\n", RTHeapSimpleGetFreeSize(Heap));
|
---|
172 |
|
---|
173 | /* check that we're back at the right amount of free memory. */
|
---|
174 | size_t cbAfter = RTHeapSimpleGetFreeSize(Heap);
|
---|
175 | if (cbBefore != cbAfter)
|
---|
176 | {
|
---|
177 | RTTestIPrintf(RTTESTLVL_ALWAYS,
|
---|
178 | "Warning: Either we've split out an alignment chunk at the start, or we've got\n"
|
---|
179 | " an alloc/free accounting bug: cbBefore=%d cbAfter=%d\n", cbBefore, cbAfter);
|
---|
180 | RTHeapSimpleDump(Heap, (PFNRTHEAPSIMPLEPRINTF)RTPrintf);
|
---|
181 | }
|
---|
182 |
|
---|
183 | /* relocate and free the bits in heap2 now. */
|
---|
184 | RTTestSub(hTest, "RTHeapSimpleRelocate");
|
---|
185 | rc = RTHeapSimpleRelocate(hHeapCopy, offDelta);
|
---|
186 | RTTESTI_CHECK_RC(rc, VINF_SUCCESS);
|
---|
187 | if (RT_SUCCESS(rc))
|
---|
188 | {
|
---|
189 | /* free it in a specific order. */
|
---|
190 | int cFreed2 = 0;
|
---|
191 | for (i = 0; i < RT_ELEMENTS(s_aOpsCopy); i++)
|
---|
192 | {
|
---|
193 | unsigned j;
|
---|
194 | for (j = 0; j < RT_ELEMENTS(s_aOpsCopy); j++)
|
---|
195 | {
|
---|
196 | if ( s_aOpsCopy[j].iFreeOrder != i
|
---|
197 | || !s_aOpsCopy[j].pvAlloc)
|
---|
198 | continue;
|
---|
199 | //RTPrintf("j=%d i=%d free=%d cb=%d pv=%p\n", j, i, RTHeapSimpleGetFreeSize(hHeapCopy), s_aOpsCopy[j].cb, s_aOpsCopy[j].pvAlloc);
|
---|
200 | RTHeapSimpleFree(hHeapCopy, (uint8_t *)s_aOpsCopy[j].pvAlloc + offDelta);
|
---|
201 | s_aOpsCopy[j].pvAlloc = NULL;
|
---|
202 | cFreed2++;
|
---|
203 | }
|
---|
204 | }
|
---|
205 | RTTESTI_CHECK(cFreed2 == RT_ELEMENTS(s_aOpsCopy));
|
---|
206 |
|
---|
207 | /* check that we're back at the right amount of free memory. */
|
---|
208 | size_t cbAfterCopy = RTHeapSimpleGetFreeSize(hHeapCopy);
|
---|
209 | RTTESTI_CHECK_MSG(cbAfterCopy == cbAfter, ("cbAfterCopy=%zu cbAfter=%zu\n", cbAfterCopy, cbAfter));
|
---|
210 | }
|
---|
211 |
|
---|
212 |
|
---|
213 | return RTTestSummaryAndDestroy(hTest);
|
---|
214 | }
|
---|
215 |
|
---|