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
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
|
/* $OpenBSD: mkext.c,v 1.6 2007/10/27 13:55:00 ragge Exp $ */
/*
* Generate defines for the needed hardops.
*/
#include "pass2.h"
#include <string.h>
int chkop[DSIZE];
void mktables(void);
char *cname = "external.c";
char *hname = "external.h";
FILE *fc, *fh;
/*
* masks for matching dope with shapes
*/
int mamask[] = {
SIMPFLG, /* OPSIMP */
SIMPFLG|ASGFLG, /* ASG OPSIMP */
COMMFLG, /* OPCOMM */
COMMFLG|ASGFLG, /* ASG OPCOMM */
MULFLG, /* OPMUL */
MULFLG|ASGFLG, /* ASG OPMUL */
DIVFLG, /* OPDIV */
DIVFLG|ASGFLG, /* ASG OPDIV */
UTYPE, /* OPUNARY */
TYFLG, /* ASG OPUNARY is senseless */
LTYPE, /* OPLEAF */
TYFLG, /* ASG OPLEAF is senseless */
0, /* OPANY */
ASGOPFLG|ASGFLG, /* ASG OPANY */
LOGFLG, /* OPLOG */
TYFLG, /* ASG OPLOG is senseless */
FLOFLG, /* OPFLOAT */
FLOFLG|ASGFLG, /* ASG OPFLOAT */
SHFFLG, /* OPSHFT */
SHFFLG|ASGFLG, /* ASG OPSHIFT */
SPFLG, /* OPLTYPE */
TYFLG, /* ASG OPLTYPE is senseless */
};
struct checks {
int op, type;
char *name;
} checks[] = {
{ MUL, TLONGLONG, "SMULLL", },
{ DIV, TLONGLONG, "SDIVLL", },
{ MOD, TLONGLONG, "SMODLL", },
{ PLUS, TLONGLONG, "SPLUSLL", },
{ MINUS, TLONGLONG, "SMINUSLL", },
{ MUL, TULONGLONG, "UMULLL", },
{ DIV, TULONGLONG, "UDIVLL", },
{ MOD, TULONGLONG, "UMODLL", },
{ PLUS, TULONGLONG, "UPLUSLL", },
{ MINUS, TULONGLONG, "UMINUSLL", },
{ 0, 0, 0, },
};
int rstatus[] = { RSTATUS };
int roverlay[MAXREGS][MAXREGS] = { ROVERLAP };
int regclassmap[NUMCLASS][MAXREGS];
static void
compl(struct optab *q, char *str)
{
printf("table entry %td, op %s: %s\n", q - table, opst[q->op], str);
}
int
main(int argc, char *argv[])
{
struct optab *q;
struct checks *ch;
int i, j, areg, breg, creg, dreg, mx;
char *bitary;
int bitsz, rval, nelem;
mkdope();
for (q = table; q->op != FREE; q++) {
if (q->op >= OPSIMP)
continue;
if ((q->ltype & TLONGLONG) &&
(q->rtype & TLONGLONG))
chkop[q->op] |= TLONGLONG;
if ((q->ltype & TULONGLONG) &&
(q->rtype & TULONGLONG))
chkop[q->op] |= TULONGLONG;
}
if ((fc = fopen(cname, "w")) == NULL) {
perror("open cfile");
return(1);
}
if ((fh = fopen(hname, "w")) == NULL) {
perror("open hfile");
return(1);
}
for (ch = checks; ch->op != 0; ch++) {
if ((chkop[ch->op] & ch->type) == 0)
fprintf(fh, "#define NEED_%s\n", ch->name);
}
fprintf(fc, "#include \"pass2.h\"\n");
/* create fast-lookup tables */
mktables();
/* create efficient bitset sizes */
if (sizeof(long) == 8) { /* 64-bit arch */
bitary = "long";
bitsz = 64;
} else {
bitary = "int";
bitsz = sizeof(int) == 4 ? 32 : 16;
}
fprintf(fh, "#define NUMBITS %d\n", bitsz);
fprintf(fh, "#define BITSET(arr, bit) "
"(arr[bit/NUMBITS] |= ((%s)1 << (bit & (NUMBITS-1))))\n",
bitary);
fprintf(fh, "#define BITCLEAR(arr, bit) "
"(arr[bit/NUMBITS] &= ~((%s)1 << (bit & (NUMBITS-1))))\n",
bitary);
fprintf(fh, "#define TESTBIT(arr, bit) "
"(arr[bit/NUMBITS] & ((%s)1 << (bit & (NUMBITS-1))))\n",
bitary);
fprintf(fh, "typedef %s bittype;\n", bitary);
/* register class definitions, used by graph-coloring */
/* TODO */
/* Sanity-check the table */
rval = 0;
for (q = table; q->op != FREE; q++) {
if (q->op == ASSIGN) {
#define F(x) (q->visit & x && q->rewrite & (RLEFT|RRIGHT) && \
q->lshape & ~x && q->rshape & ~x)
if (F(INAREG) || F(INBREG) || F(INCREG) || F(INDREG)) {
compl(q, "may match without result register");
rval++;
}
#undef F
if ((q->visit & INREGS) && !(q->rewrite & RDEST)) {
compl(q, "ASSIGN reclaim must be RDEST");
rval++;
}
}
if (q->rewrite & (RESC1|RESC2|RESC3) && q->visit & FOREFF)
compl(q, "FOREFF may cause reclaim of wrong class");
}
/* print out list of scratched and permanent registers */
fprintf(fh, "extern int tempregs[], permregs[];\n");
fprintf(fc, "int tempregs[] = { ");
for (i = j = 0; i < MAXREGS; i++)
if (rstatus[i] & TEMPREG)
fprintf(fc, "%d, ", i), j++;
fprintf(fc, "-1 };\n");
fprintf(fh, "#define NTEMPREG %d\n", j+1);
fprintf(fh, "#define FREGS %d\n", j); /* XXX - to die */
fprintf(fc, "int permregs[] = { ");
for (i = j = 0; i < MAXREGS; i++)
if (rstatus[i] & PERMREG)
fprintf(fc, "%d, ", i), j++;
fprintf(fc, "-1 };\n");
fprintf(fh, "#define NPERMREG %d\n", j+1);
/*
* The register allocator uses bitmasks of registers for each class.
*/
areg = breg = creg = dreg = 0;
for (i = 0; i < MAXREGS; i++) {
for (j = 0; j < NUMCLASS; j++)
regclassmap[j][i] = -1;
if (rstatus[i] & SAREG) regclassmap[0][i] = areg++;
if (rstatus[i] & SBREG) regclassmap[1][i] = breg++;
if (rstatus[i] & SCREG) regclassmap[2][i] = creg++;
if (rstatus[i] & SDREG) regclassmap[3][i] = dreg++;
}
fprintf(fh, "#define AREGCNT %d\n", areg);
fprintf(fh, "#define BREGCNT %d\n", breg);
fprintf(fh, "#define CREGCNT %d\n", creg);
fprintf(fh, "#define DREGCNT %d\n", dreg);
if (areg > bitsz)
printf("%d regs in class A (max %d)\n", areg, bitsz), rval++;
if (breg > bitsz)
printf("%d regs in class B (max %d)\n", breg, bitsz), rval++;
if (creg > bitsz)
printf("%d regs in class C (max %d)\n", creg, bitsz), rval++;
if (dreg > bitsz)
printf("%d regs in class D (max %d)\n", dreg, bitsz), rval++;
fprintf(fc, "static int amap[MAXREGS][NUMCLASS] = {\n");
for (i = 0; i < MAXREGS; i++) {
int ba, bb, bc, bd, r;
ba = bb = bc = bd = 0;
if (rstatus[i] & SAREG) ba = (1 << regclassmap[0][i]);
if (rstatus[i] & SBREG) bb = (1 << regclassmap[1][i]);
if (rstatus[i] & SCREG) bc = (1 << regclassmap[2][i]);
if (rstatus[i] & SDREG) bd = (1 << regclassmap[3][i]);
for (j = 0; roverlay[i][j] >= 0; j++) {
r = roverlay[i][j];
if (rstatus[r] & SAREG)
ba |= (1 << regclassmap[0][r]);
if (rstatus[r] & SBREG)
bb |= (1 << regclassmap[1][r]);
if (rstatus[r] & SCREG)
bc |= (1 << regclassmap[2][r]);
if (rstatus[r] & SDREG)
bd |= (1 << regclassmap[3][r]);
}
fprintf(fc, "\t{ 0x%x", ba);
if (NUMCLASS > 1) fprintf(fc, ",0x%x", bb);
if (NUMCLASS > 2) fprintf(fc, ",0x%x", bc);
if (NUMCLASS > 3) fprintf(fc, ",0x%x", bd);
fprintf(fc, " },\n");
}
fprintf(fc, "};\n");
fprintf(fh, "int aliasmap(int class, int regnum);\n");
fprintf(fc, "int\naliasmap(int class, int regnum)\n{\n");
fprintf(fc, " return amap[regnum][class-1];\n}\n");
/* routines to convert back from color to regnum */
mx = areg;
if (breg > mx) mx = breg;
if (creg > mx) mx = creg;
if (dreg > mx) mx = dreg;
if (mx > (sizeof(int)*8)-1) {
printf("too many regs in a class, use two classes instead\n");
printf("%d > %zu\n", mx, (sizeof(int)*8)-1);
rval++;
}
fprintf(fc, "static int rmap[NUMCLASS][%d] = {\n", mx);
for (j = 0; j < NUMCLASS; j++) {
int cl = (1 << (j+1));
fprintf(fc, "\t{ ");
for (i = 0; i < MAXREGS; i++)
if (rstatus[i] & cl) fprintf(fc, "%d, ", i);
fprintf(fc, "},\n");
}
fprintf(fc, "};\n\n");
fprintf(fh, "int color2reg(int color, int class);\n");
fprintf(fc, "int\ncolor2reg(int color, int class)\n{\n");
fprintf(fc, " return rmap[class-1][color];\n}\n");
/* used by register allocator */
fprintf(fc, "int regK[] = { 0, %d, %d, %d, %d };\n",
areg, breg, creg, dreg);
fprintf(fc, "int\nclassmask(int class)\n{\n");
fprintf(fc, "\tif(class == CLASSA) return 0x%x;\n", (1 << areg)-1);
fprintf(fc, "\tif(class == CLASSB) return 0x%x;\n", (1 << breg)-1);
fprintf(fc, "\tif(class == CLASSC) return 0x%x;\n", (1 << creg)-1);
fprintf(fc, "\treturn 0x%x;\n}\n", (1 << dreg)-1);
fprintf(fh, "int interferes(int reg1, int reg2);\n");
nelem = (MAXREGS+bitsz-1)/bitsz;
fprintf(fc, "static bittype ovlarr[MAXREGS][%d] = {\n", nelem);
for (i = 0; i < MAXREGS; i++) {
int el[10];
memset(el, 0, sizeof(el));
el[i/bitsz] = 1 << (i % bitsz);
for (j = 0; roverlay[i][j] >= 0; j++) {
int k = roverlay[i][j];
el[k/bitsz] |= (1 << (k % bitsz));
}
fprintf(fc, "{ ");
for (j = 0; j < MAXREGS; j += bitsz)
fprintf(fc, "0x%x, ", el[j/bitsz]);
fprintf(fc, " },\n");
}
fprintf(fc, "};\n");
fprintf(fc, "int\ninterferes(int reg1, int reg2)\n{\n");
fprintf(fc, "return TESTBIT(ovlarr[reg1], reg2);\n}\n");
fclose(fc);
fclose(fh);
return rval;
}
#define P(x) fprintf x
void
mktables()
{
struct optab *op;
int mxalen = 0, curalen;
int i;
// P((fc, "#include \"pass2.h\"\n\n"));
for (i = 0; i <= MAXOP; i++) {
curalen = 0;
P((fc, "static int op%d[] = { ", i));
if (dope[i] != 0)
for (op = table; op->op != FREE; op++) {
if (op->op < OPSIMP) {
if (op->op == i) {
P((fc, "%td, ", op - table));
curalen++;
}
} else {
int opmtemp;
if ((opmtemp=mamask[op->op - OPSIMP])&SPFLG) {
if (i==NAME || i==ICON || i==TEMP ||
i==OREG || i == REG) {
P((fc, "%td, ", op - table));
curalen++;
}
} else if ((dope[i]&(opmtemp|ASGFLG))==opmtemp){
P((fc, "%td, ", op - table));
curalen++;
}
}
}
if (curalen > mxalen)
mxalen = curalen;
P((fc, "-1 };\n"));
}
P((fc, "\n"));
P((fc, "int *qtable[] = { \n"));
for (i = 0; i <= MAXOP; i++) {
P((fc, " op%d,\n", i));
}
P((fc, "};\n"));
P((fh, "#define MAXOPLEN %d\n", mxalen+1));
}
|
