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
|
/* ``Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* The Initial Developer of the Original Code is Ericsson Utvecklings AB.
* Portions created by Ericsson are Copyright 1999, Ericsson Utvecklings
* AB. All Rights Reserved.''
*
* $Id$
*/
#include "testcase_driver.h"
#include "allocator_test.h"
#include <stdio.h>
#define MAX_TEST_SIZE 100000000
char *
testcase_name(void)
{
return "bucket_index";
}
void test_it(TestCaseState_t *tcs, unsigned sbct);
void
testcase_run(TestCaseState_t *tcs)
{
testcase_printf(tcs, "No of buckets = %lu:\n\n", NO_OF_BKTS);
test_it(tcs, 1);
test_it(tcs, 0);
test_it(tcs, 1024);
test_it(tcs, 10240);
}
void
testcase_cleanup(TestCaseState_t *tcs)
{
if (tcs->extra) {
STOP_ALC(tcs->extra);
tcs->extra = NULL;
}
}
void
test_it(TestCaseState_t *tcs, unsigned sbct)
{
Ulong max_cont_test_sz;
char sbct_buf[21];
char *argv[] = {"-tas", "gf", "-tsbct", NULL, NULL};
int no_changes;
Ulong bi;
Ulong min_sz;
Ulong prev_bi;
Ulong sz;
Allctr_t *a;
no_changes = 0;
prev_bi = -1;
if (sbct) {
sprintf(sbct_buf, "%d", sbct);
argv[3] = sbct_buf;
}
else
argv[2] = NULL;
max_cont_test_sz = 2*sbct*1024;
if (max_cont_test_sz < 1000000)
max_cont_test_sz = 1000000;
testcase_printf(tcs, "Testing with sbct = %s\n",
sbct ? sbct_buf : "default");
a = START_ALC("bkt_ix_", 0, argv);
tcs->extra = (void *) a;
ASSERT(tcs, a);
sz = MIN_BLK_SZ(a);
while(sz < ((((Ulong)1) << 31) - 1)) {
bi = BKT_IX(a, sz);
if (prev_bi != bi) {
ASSERT(tcs, prev_bi + 1 == bi);
min_sz = BKT_MIN_SZ(a, bi);
ASSERT(tcs, sz == min_sz);
testcase_printf(tcs, "sz=%d->ix=%d ", sz, bi);
no_changes++;
}
prev_bi = bi;
if (sz < max_cont_test_sz)
sz++;
else
sz += 100000000;
}
testcase_printf(tcs, "\n\n");
ASSERT(tcs, no_changes == NO_OF_BKTS);
STOP_ALC(a);
tcs->extra = NULL;
testcase_printf(tcs, "Test with sbct=%s succeeded\n",
sbct ? sbct_buf : "default");
}
|
