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 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
|
/*% rm -f rega.o main.o && cc -g -std=c99 -Wall -DTEST_PMOV -o pmov % *.o
*
* This is a test framwork for the dopm() function
* in rega.c, use it when you want to modify it or
* all the parallel move functions.
*
* You might need to decrease NIReg to see it
* terminate, I used NIReg == 7 at most.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
static void assert_test(char *, int), fail(void), iexec(int *);
#include "../../rega.c"
static void bsinit_(BSet *, uint);
static RMap mbeg;
static Ins ins[NIReg], *ip;
static Blk dummyb = { .ins = ins };
int
main()
{
Ins *i1;
unsigned long long tm, rm, cnt;
RMap mend;
int reg[NIReg], val[NIReg+1];
int t, i, r, nr;
tmp = (Tmp[Tmp0+NIReg]){{{0}}};
for (t=0; t<Tmp0+NIReg; t++)
if (t >= Tmp0) {
tmp[t].cls = Kw;
tmp[t].hint.r = -1;
tmp[t].hint.m = 0;
tmp[t].slot = -1;
sprintf(tmp[t].name, "tmp%d", t-Tmp0+1);
}
bsinit_(mbeg.b, Tmp0+NIReg);
bsinit_(mend.b, Tmp0+NIReg);
cnt = 0;
for (tm = 0; tm < 1ull << (2*NIReg); tm++) {
mbeg.n = 0;
bszero(mbeg.b);
ip = ins;
/* find what temporaries are in copy and
* wether or not they are in register
*/
for (t=0; t<NIReg; t++)
switch ((tm >> (2*t)) & 3) {
case 0:
/* not in copy, not in reg */
break;
case 1:
/* not in copy, in reg */
radd(&mbeg, Tmp0+t, t+1);
break;
case 2:
/* in copy, not in reg */
*ip++ = (Ins){OCopy, Kw, TMP(Tmp0+t), {R, R}};
break;
case 3:
/* in copy, in reg */
*ip++ = (Ins){OCopy, Kw, TMP(Tmp0+t), {R, R}};
radd(&mbeg, Tmp0+t, t+1);
break;
}
if (ip == ins)
/* cancel if the parallel move
* is empty
*/
goto Nxt;
/* find registers for temporaries
* in mbeg
*/
nr = ip - ins;
rm = (1ull << (nr+1)) - 1;
for (i=0; i<nr; i++)
reg[i] = i+1;
for (;;) {
/* set registers on copies
*/
for (i=0, i1=ins; i1<ip; i1++, i++)
i1->arg[0] = TMP(reg[i]);
/* compile the parallel move
*/
rcopy(&mend, &mbeg);
dopm(&dummyb, ip-1, &mend);
cnt++;
/* check that mend contain mappings for
* source registers and does not map any
* assigned temporary, then check that
* all temporaries in mend are mapped in
* mbeg and not used in the copy
*/
for (i1=ins; i1<ip; i1++) {
r = i1->arg[0].val;
assert(rfree(&mend, r) == r);
t = i1->to.val;
assert(!bshas(mend.b, t));
}
for (i=0; i<mend.n; i++) {
t = mend.t[i];
assert(bshas(mbeg.b, t));
t -= Tmp0;
assert(((tm >> (2*t)) & 3) == 1);
}
/* execute the code generated and check
* that all assigned temporaries got their
* value, and that all live variables's
* content got preserved
*/
for (i=1; i<=NIReg; i++)
val[i] = i;
iexec(val);
for (i1=ins; i1<ip; i1++) {
t = i1->to.val;
r = rfind(&mbeg, t);
if (r != -1)
assert(val[r] == i1->arg[0].val);
}
for (i=0; i<mend.n; i++) {
t = mend.t[i];
r = mend.r[i];
assert(val[t-Tmp0+1] == r);
}
/* find the next register assignment */
i = nr - 1;
for (;;) {
r = reg[i];
rm &= ~(1ull<<r);
do
r++;
while (r <= NIReg && (rm & (1ull<<r)));
if (r == NIReg+1) {
if (i == 0)
goto Nxt;
i--;
} else {
rm |= (1ull<<r);
reg[i++] = r;
break;
}
}
for (; i<nr; i++)
for (r=1; r<=NIReg; r++)
if (!(rm & (1ull<<r))) {
rm |= (1ull<<r);
reg[i] = r;
break;
}
}
Nxt: freeall();
}
printf("%llu tests successful!\n", cnt);
exit(0);
}
/* execute what pmgen() wrote (swap, copy) */
#define validr(r) \
rtype(r) == RTmp && \
r.val > 0 && \
r.val <= NIReg
static void
iexec(int val[])
{
Ins *i;
int t;
for (i=insb; i<curi; i++)
switch (i->op) {
default:
assert(!"iexec: missing case\n");
exit(1);
case OSwap:
assert(validr(i->arg[0]));
assert(validr(i->arg[1]));
t = val[i->arg[0].val];
val[i->arg[0].val] = val[i->arg[1].val];
val[i->arg[1].val] = t;
break;
case OCopy:
assert(validr(i->to));
assert(validr(i->arg[0]));
val[i->to.val] = val[i->arg[0].val];
break;
}
}
/* failure diagnostics */
static int re;
static void
replay()
{
RMap mend;
re = 1;
bsinit_(mend.b, Tmp0+NIReg);
rcopy(&mend, &mbeg);
dopm(&dummyb, ip-1, &mend);
}
static void
fail()
{
Ins *i1;
int i;
printf("\nIn registers: ");
for (i=0; i<mbeg.n; i++)
printf("%s(r%d) ",
tmp[mbeg.t[i]].name,
mbeg.r[i]);
printf("\n");
printf("Parallel move:\n");
for (i1=ins; i1<ip; i1++)
printf("\t %s <- r%d\n",
tmp[i1->to.val].name,
i1->arg[0].val);
replay();
abort();
}
static void
assert_test(char *s, int x)
{
if (x)
return;
if (re)
abort();
printf("!assertion failure: %s\n", s);
fail();
}
static void
bsinit_(BSet *bs, uint n)
{
n = (n + NBit-1) / NBit;
bs->nt = n;
bs->t = emalloc(n * sizeof bs->t[0]);
}
/* symbols required by the linker */
char debug['Z'+1];
|