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
|
/*
TEST_HEADER
id = $Id$
summary = new MVFF allocation test
language = c
link = testlib.o
parameters = QUEUES=100 ITERATIONS=1000
END_HEADER
*/
#include <time.h>
#include "testlib.h"
#include "mpscmvff.h"
#include "mpsavm.h"
#define MAXNUMBER 1000000
mps_arena_t arena;
mps_bool_t slotHigh, arenaHigh, firstFit;
static struct {mps_addr_t addr; size_t size;} queue[MAXNUMBER];
enum {SEQ=0, RAN=1, SEQGAP=2, RANGAP=3, DUMMY=4};
static char *tdesc[] = {"sequential", "random",
"sequential gap", "random gap", "dummy"};
static void setobj(mps_addr_t a, size_t size, unsigned char val)
{
unsigned char *b;
b = a;
while (size>0)
{
*b=val;
/* comment("%p = %i", b, (int) val);
*/
b++;
size--;
}
}
static int chkobj(mps_addr_t a, size_t size, unsigned char val)
{
unsigned char *b;
b = a;
while (size>0)
{
/* comment("%p == %i", b, (int) val);
*/
if (*b != val) return 0;
b++;
size--;
}
return 1;
}
static void dt(int kind,
size_t extendBy, size_t avgSize, size_t align,
unsigned long mins, unsigned long maxs, int number, int iter)
{
mps_pool_t pool;
int i, hd;
clock_t time0, time1;
size_t size;
double secs;
asserts(number <= MAXNUMBER, "number too big");
time0 = clock();
asserts(time0 != -1, "processor time not available");
die(
mps_pool_create(&pool, arena, mps_class_mvff(),
extendBy, avgSize, align, slotHigh, arenaHigh, firstFit),
"create MVFF pool");
for(hd=0; hd<number; hd++)
{
size = ranrange(mins, maxs);
if ((ranint(2) && (kind & 2)) || (kind==DUMMY))
{
queue[hd].addr=NULL;
}
else
{
die(mps_alloc(&queue[hd].addr, pool, size), "alloc");
setobj(queue[hd].addr, size, (unsigned char) (hd%256));
queue[hd].size = size;
}
};
hd=-1;
for(i=0; i<iter; i++)
{
if (kind & 1) hd = ranint(number);
else {ranint(number); hd=(hd+1)%number;} /* call raninit anyway
to use same time */
if (queue[hd].addr != NULL)
{
asserts(chkobj(queue[hd].addr, queue[hd].size, (unsigned char) (hd%256)),
"corrupt at %p (%s: %x, %x, %x, %c%c%c, %lx, %lx, %i, %i)",
queue[hd].addr,
tdesc[kind], (int) extendBy, (int) avgSize, (int) align,
slotHigh ? 'S' : 's', arenaHigh ? 'A' : 'a', firstFit ? 'F' : 'f',
mins, maxs, number, iter);
mps_free(pool, queue[hd].addr, queue[hd].size);
}
size = ranrange(mins, maxs);
if ((ranint(2) && (kind & 2)) || (kind==DUMMY))
{
queue[hd].addr=NULL;
}
else
{
die(mps_alloc(&queue[hd].addr, pool, size),"alloc");
setobj(queue[hd].addr, size, (unsigned char) (hd%256));
queue[hd].size = size;
}
}
mps_pool_destroy(pool);
time1=clock();
secs=(time1-time0)/(double)CLOCKS_PER_SEC;
comment("%s test (%x, %x, %x, %c%c%c, %lx, %lx, %i, %i) in %.2f s",
tdesc[kind], (int) extendBy, (int) avgSize, (int) align,
slotHigh ? 'S' : 's', arenaHigh ? 'A' : 'a', firstFit ? 'F' : 'f',
mins, maxs, number, iter, secs);
}
static void test(void *stack_pointer)
{
mps_thr_t thread;
size_t avgSize;
size_t align = sizeof(void*);
unsigned long extendBy, minSize = sizeof(int), maxSize;
int i, j, kind;
cdie(mps_arena_create(&arena, mps_arena_class_vm(), (size_t) (1024*1024*50)), "create arena");
cdie(mps_thread_reg(&thread, arena), "register thread");
for (i = 0; i < 5 * 2 * 2 * 2 * 2 * 2; ++i) {
j = i;
slotHigh = j % 2; j /= 2;
arenaHigh = j % 2; j /= 2;
firstFit = j % 2; j /= 2;
extendBy = j % 2 ? 4096 : 65536; j /= 2;
avgSize = j % 2 ? 32 : extendBy / 2;
maxSize = j % 2 ? 64 : extendBy; j /= 2;
kind = j % 5; j /= 5;
dt(kind, extendBy, avgSize, align, minSize, maxSize, QUEUES, ITERATIONS);
}
mps_thread_dereg(thread);
mps_arena_destroy(arena);
}
int main(void)
{
run_test(test);
pass();
return 0;
}
|
