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
|
#include "lisc.h"
/* For x86_64, we have to:
*
* - check that constants are used only in
* places allowed by the machine
*
* - explicit machine register contraints
* on instructions like division.
*
* - lower calls (future, I have to think
* about their representation and the
* way I deal with structs/unions in the
* ABI)
*/
extern Ins insb[NIns], *curi; /* shared work buffer */
static void
emit(short op, Ref to, Ref arg0, Ref arg1)
{
if (curi == insb)
diag("isel: too many instructions");
*--curi = (Ins){op, to, {arg0, arg1}};
}
static int
newtmp(int type, Fn *fn)
{
static int n;
int t;
t = fn->ntmp++;
fn->tmp = realloc(fn->tmp, fn->ntmp * sizeof fn->tmp[0]);
if (!fn->tmp)
diag("isel: out of memory");
fn->tmp[t] = (Tmp){.type = type};
sprintf(fn->tmp[t].name, "isel%d", ++n);
return t;
}
static int
islong(Ref r, Fn *fn)
{
return rtype(r) == RTmp && fn->tmp[r.val].type == TLong;
}
static void
selcmp(Ref arg[2], Fn *fn)
{
Ref r;
int t;
t = -1;
if (rtype(arg[0]) == RCon) {
r = arg[1];
arg[1] = arg[0];
arg[0] = r;
if (rtype(r) == RCon) {
/* todo, use the constant
* size to dimension the
* constant */
t = newtmp(TWord, fn);
arg[0] = TMP(t);
}
}
if (islong(arg[0], fn) || islong(arg[1], fn))
emit(OXCmpl, R, arg[1], arg[0]);
else
emit(OXCmpw, R, arg[1], arg[0]);
if (t != -1)
emit(OCopy, TMP(t), r, R);
}
static void
sel(Ins i, Fn *fn)
{
Ref r0, r1, ra, rd;
int t, ty, c;
switch (i.op) {
case ODiv:
case ORem:
ty = fn->tmp[i.to.val].type;
switch (ty) {
default:
diag("isel: invalid division");
case TWord:
ra = REG(EAX);
rd = REG(EDX);
break;
case TLong:
ra = REG(RAX);
rd = REG(RDX);
break;
}
r0 = i.op == ODiv ? ra : rd;
r1 = i.op == ODiv ? rd : ra;
emit(OCopy, i.to, r0, R);
emit(OCopy, R, r1, R);
if (rtype(i.arg[1]) == RCon) {
/* immediates not allowed for
* divisions in x86
*/
t = newtmp(ty, fn);
r0 = TMP(t);
} else
r0 = i.arg[1];
emit(OXDiv, R, r0, R);
emit(OSign, rd, ra, R);
emit(OCopy, ra, i.arg[0], R);
if (rtype(i.arg[1]) == RCon)
emit(OCopy, r0, i.arg[1], R);
break;
case OAdd:
case OSub:
case OCopy:
emit(i.op, i.to, i.arg[0], i.arg[1]);
break;
case OStore:
case OStoreb:
case OStores:
r0 = i.arg[0];
goto Load;
case OLoad:
case OLoadss:
case OLoadus:
case OLoadsb:
case OLoadub:
r0 = i.arg[0];
if (rtype(r0) == RCon) {
t = newtmp(TLong, fn);
r0 = TMP(t);
}
Load:
r1 = i.arg[1];
if (rtype(r1) == RCon) {
t = newtmp(TLong, fn);
r1 = TMP(t);
}
emit(i.op, i.to, r0, r1);
if (!req(r0, i.arg[0]))
emit(OCopy, r0, i.arg[0], R);
if (!req(r1, i.arg[1]))
emit(OCopy, r1, i.arg[1], R);
break;
case ONop:
break;
default:
if (OCmp <= i.op && i.op <= OCmp1) {
c = i.op - OCmp;
if (rtype(i.arg[0]) == RCon)
c = COP(c);
emit(OXSet+c, i.to, R, R);
selcmp(i.arg, fn);
break;
}
diag("isel: non-exhaustive implementation");
}
}
static Ins *
flagi(Ins *i0, Ins *i)
{
while (i>i0)
switch ((--i)->op) {
default:
if (OCmp <= i->op && i->op <= OCmp1)
return i;
return 0;
case OAdd: /* <arch> flag-setting */
case OSub:
return i;
case OCopy: /* <arch> flag-transparent */
case OStore:
case OLoad:;
}
return 0;
}
static void
seljmp(Blk *b, Fn *fn)
{
Ref r;
int c;
Ins *fi;
if (b->jmp.type != JJnz)
return;
r = b->jmp.arg;
b->jmp.arg = R;
assert(!req(r, R));
if (rtype(r) == RCon) {
b->jmp.type = JJmp;
if (req(r, CON_Z))
b->s1 = b->s2;
b->s2 = 0;
return;
}
fi = flagi(b->ins, &b->ins[b->nins]);
if (fi && req(fi->to, r)) {
if (OCmp <= fi->op && fi->op <= OCmp1) {
c = fi->op - OCmp;
if (rtype(fi->arg[0]) == RCon)
c = COP(c);
b->jmp.type = JXJc + c;
if (fn->tmp[r.val].nuse == 1) {
assert(fn->tmp[r.val].ndef==1);
selcmp(fi->arg, fn);
*fi = (Ins){ONop, R, {R, R}};
}
} else
b->jmp.type = JXJc + Cne;
} else {
selcmp((Ref[2]){r, CON_Z}, fn);
b->jmp.type = JXJc + Cne;
}
}
/* instruction selection
* requires use counts (as given by parsing)
*/
void
isel(Fn *fn)
{
Blk *b;
Ins *i;
uint nins;
for (b=fn->start; b; b=b->link) {
curi = &insb[NIns];
seljmp(b, fn);
for (i=&b->ins[b->nins]; i>b->ins;) {
sel(*--i, fn);
}
nins = &insb[NIns] - curi;
free(b->ins);
b->ins = alloc(nins * sizeof b->ins[0]);
memcpy(b->ins, curi, nins * sizeof b->ins[0]);
b->nins = nins;
}
}
|
