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
213
214
215
216
217
218
219
220
221
222
223
|
/* $Id: tstkLdrHeap.c 29 2009-07-01 20:30:29Z bird $ */
/** @file
* kLdr - Heap testcase.
*/
/*
* Copyright (c) 2006-2007 Knut St. Osmundsen <bird-kStuff-spamix@anduin.net>
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
/*******************************************************************************
* Header Files *
*******************************************************************************/
#include <k/kLdr.h>
#include <k/kHlp.h>
#include <stdio.h>
#include <stdlib.h>
/*******************************************************************************
* Defined Constants And Macros *
*******************************************************************************/
#define CHECK_FATAL(expr) \
do { if (!(expr)) { printf("tstkLdrHeap(%d): FATAL FAILURE - %s\n", __LINE__, #expr); return 1; } \
} while (0)
#define CHECK(expr) \
do { if (!(expr)) { printf("tstkLdrHeap(%d): ERROR - %s\n", __LINE__, #expr); cErrors++; kHlpAssertBreakpoint();} \
} while (0)
/**
* Get a random size.
* @returns random size.
*/
static unsigned RandSize(void)
{
unsigned i = (unsigned)rand() % (256*1024 - 1);
return i ? i : 1;
}
/**
* Get a random index.
* @returns random index.
* @param cEntries The number of entries in the table.
*/
static unsigned RandIdx(unsigned cEntries)
{
unsigned i = (unsigned)rand();
while (i >= cEntries)
i >>= 1;
return i;
}
#if 0
# define kHlpAlloc(a) malloc(a)
# define kHlpFree(a) free(a)
#endif
int main()
{
int cErrors = 0;
int rc;
#define MAX_ALLOCS 256
static struct
{
void *pv;
unsigned cb;
} s_aAllocs[MAX_ALLOCS];
unsigned cAllocs;
unsigned i;
unsigned j;
/*
* Some simple init / term.
*/
rc = kHlpHeapInit();
CHECK_FATAL(!rc);
kHlpHeapTerm();
rc = kHlpHeapInit();
CHECK_FATAL(!rc);
kHlpHeapTerm();
/*
* Simple alloc all, free all in FIFO order.
*/
rc = kHlpHeapInit();
CHECK_FATAL(!rc);
/* 1. allocate all slots. */
for (i = 0; i < MAX_ALLOCS; i++)
{
s_aAllocs[i].cb = RandSize();
s_aAllocs[i].pv = kHlpAlloc(s_aAllocs[i].cb);
CHECK(s_aAllocs[i].pv);
}
/* 2. free all slots. */
for (i = 0; i < MAX_ALLOCS; i++)
kHlpFree(s_aAllocs[i].pv);
/* terminate */
kHlpHeapTerm();
/*
* Simple alloc all, free all in LIFO order.
*/
rc = kHlpHeapInit();
CHECK_FATAL(!rc);
/* 1. allocate all slots. */
for (i = 0; i < MAX_ALLOCS; i++)
{
s_aAllocs[i].cb = RandSize();
s_aAllocs[i].pv = kHlpAlloc(s_aAllocs[i].cb);
CHECK(s_aAllocs[i].pv);
}
/* 2. free all slots. */
i = MAX_ALLOCS;
while (i-- > 0)
kHlpFree(s_aAllocs[i].pv);
/* terminate */
kHlpHeapTerm();
/*
* Bunch of allocations, free half, allocate and free in pairs, free all.
*/
rc = kHlpHeapInit();
CHECK_FATAL(!rc);
/* 1. allocate all slots. */
for (i = 0; i < MAX_ALLOCS; i++)
{
s_aAllocs[i].cb = RandSize();
s_aAllocs[i].pv = kHlpAlloc(s_aAllocs[i].cb);
CHECK(s_aAllocs[i].pv);
}
cAllocs = MAX_ALLOCS;
/* 2. free half (random order). */
while (cAllocs > MAX_ALLOCS / 2)
{
i = RandIdx(cAllocs);
kHlpFree(s_aAllocs[i].pv);
cAllocs--;
if (i != cAllocs)
s_aAllocs[i] = s_aAllocs[cAllocs];
}
/* 3. lots of alloc and free activity. */
for (j = 0; j < MAX_ALLOCS * 32; j++)
{
/* allocate */
unsigned cMax = RandIdx(MAX_ALLOCS / 4) + 1;
while (cAllocs < MAX_ALLOCS && cMax-- > 0)
{
i = cAllocs;
s_aAllocs[i].cb = RandSize();
s_aAllocs[i].pv = kHlpAlloc(s_aAllocs[i].cb);
CHECK(s_aAllocs[i].pv);
cAllocs++;
}
/* free */
cMax = RandIdx(MAX_ALLOCS / 4) + 1;
while (cAllocs > MAX_ALLOCS / 2 && cMax-- > 0)
{
i = RandIdx(cAllocs);
kHlpFree(s_aAllocs[i].pv);
cAllocs--;
if (i != cAllocs)
s_aAllocs[i] = s_aAllocs[cAllocs];
}
}
/* 4. free all */
while (cAllocs > 0)
{
i = RandIdx(cAllocs);
kHlpFree(s_aAllocs[i].pv);
cAllocs--;
if (i != cAllocs)
s_aAllocs[i] = s_aAllocs[cAllocs];
}
/* terminate */
kHlpHeapTerm();
/* summary */
if (!cErrors)
printf("tstkLdrHeap: SUCCESS\n");
else
printf("tstkLdrHeap: FAILURE - %d errors\n", cErrors);
return !!cErrors;
}
|
