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
|
/*
TEST_HEADER
id = $Id$
summary = interleaved APs (like 12, but produce comments for debugging)
language = c
link = testlib.o newfmt.o
parameters = VERBOSE=0 NCELLS=100 NAPS=100 ITERATIONS=100
END_HEADER
*/
/*
This test needs some explanation. The object 'cells' contains
NCELLS references to other objects. NAPS allocation points
are created. At each step, we choose one and nudge it on
a little. Each allocation point goes through the following
cycle of steps: reserve, init, begin commit, end commit.
At the init step, each reference in the reserved object is
set to point randomly to one of the objects referenced by
cells or (with probability PNULL) to NULL. If commit fails,
the object is thrown away. If it succeeds, it is written into
a random reference in cells. Repeat.
Because it has to deal directly with reserve and commit,
this test can't use the nice functions provided by newfmt
all the time.
*/
#include "testlib.h"
#include "mpscamc.h"
#include "newfmt.h"
#define genCOUNT (3)
static mps_gen_param_s testChain[genCOUNT] = {
{ 6000, 0.90 }, { 8000, 0.65 }, { 16000, 0.50 } };
#define PNULL (ranint(100)<25)
#define NUMREFS (ranint(20))
mps_ap_t ap[NAPS];
mycell *p[NAPS];
size_t s[NAPS];
int nrefs[NAPS];
int ap_state[NAPS];
static void test(void *stack_pointer)
{
mps_arena_t arena;
mps_pool_t pool;
mps_thr_t thread;
mps_root_t root;
mps_chain_t chain;
mps_fmt_t format;
mycell *cells;
int h,i,j,k,l;
mycell *pobj;
size_t bytes;
size_t alignment;
mps_addr_t q;
int nextid = 0x1000000;
/* turn on comments about copying and scanning */
formatcomments = VERBOSE;
fixcomments = VERBOSE;
cdie(mps_arena_create(&arena, mps_arena_class_vm(), mmqaArenaSIZE), "create arena");
cdie(mps_thread_reg(&thread, arena), "register thread");
cdie(mps_root_create_thread(&root, arena, thread, stack_pointer), "thread root");
cdie(
mps_fmt_create_A(&format, arena, &fmtA),
"create format");
cdie(mps_chain_create(&chain, arena, genCOUNT, testChain), "chain_create");
cdie(
mps_pool_create(&pool, arena, mps_class_amc(), format, chain),
"create pool");
for (i=0; i<NAPS; i++)
{
die(mps_ap_create(&ap[i], pool, mps_rank_exact()), "create ap");
ap_state[i] = 0;
}
cells = allocone(ap[0], NCELLS);
/* ap_state can have the following values:
0 before reserve
1 after reverse
2 after init
3 after I=A
0 after commit
*/
for(h=0; h<ITERATIONS; h++)
{
comment("%i of %i", h, ITERATIONS);
for(j=0; j<1000; j++)
{
i = ranint(NAPS);
switch (ap_state[i])
{
case 0:
nrefs[i] = NUMREFS;
bytes = offsetof(struct data, ref)+nrefs[i]*sizeof(struct refitem);
alignment = MPS_PF_ALIGN;
bytes = (bytes+alignment-1)&~(alignment-1);
s[i] = bytes;
die(mps_reserve(&q, ap[i], s[i]), "reserve: ");
p[i] = q;
p[i]->data.tag = 0xD033E2A6;
p[i]->data.id = nextid;
ap_state[i] = 1;
commentif(VERBOSE, "%i: reserve %li at %p", i, nextid, q);
nextid +=1;
break;
case 1:
commentif(VERBOSE, "%i: init %li", i, p[i]->data.id);
p[i]->data.tag = MCdata;
p[i]->data.numrefs = nrefs[i];
p[i]->data.size = s[i];
ap_state[i] = 2;
for (k=0; k<nrefs[i]; k++)
{
if PNULL
{ p[i]->data.ref[k].addr = NULL;
p[i]->data.ref[k].id = 0;
}
else
{
l = ranint(NCELLS);
pobj = getref(cells, l);
p[i]->data.ref[k].addr = pobj;
p[i]->data.ref[k].id = (pobj==NULL ? 0 : pobj->data.id);
}
commentif(VERBOSE, " ref %i -> %li", k, p[i]->data.ref[k].id);
}
break;
case 2:
commentif(VERBOSE, "%i: begin commit %li", i, p[i]->data.id);
ap[i]->init = ap[i]->alloc;
ap_state[i] = 3;
break;
case 3:
commentif(VERBOSE, "%i: end commit %li", i, p[i]->data.id);
q=p[i];
if (ap[i]->limit != 0 || mps_ap_trip(ap[i], p[i], s[i]))
{
l = ranint(NCELLS);
setref(cells, l, q);
commentif(VERBOSE, "succeeded %i -> %i", i, l);
}
ap_state[i] = 0;
break;
}
}
checkfrom(cells);
}
commentif(VERBOSE, "Finished main loop");
for (i=0; i<NAPS; i++)
{
switch (ap_state[i])
{
case 1:
commentif(VERBOSE, "%i init", i);
p[i]->data.tag = MCdata;
p[i]->data.numrefs = 0;
p[i]->data.size = s[i];
case 2:
commentif(VERBOSE, "%i begin commit", i);
ap[i]->init = ap[i]->alloc;
case 3:
commentif(VERBOSE, "%i end commit", i);
(void) (ap[i]->limit != 0 || mps_ap_trip(ap[i], p[i], s[i]));
}
mps_ap_destroy(ap[i]);
}
mps_arena_park(arena);
mps_pool_destroy(pool);
comment("Destroyed pool.");
mps_fmt_destroy(format);
comment("Destroyed format.");
mps_chain_destroy(chain);
comment("Destroyed chain.");
mps_root_destroy(root);
comment("Destroyed root.");
mps_thread_dereg(thread);
comment("Deregistered thread.");
mps_arena_destroy(arena);
comment("Destroyed arena.");
}
int main(void)
{
run_test(test);
pass();
return 0;
}
|
