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
|
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <qbt/nodes.h>
#include <qbt/debug.h>
#include <qbt/vec.h>
void insadd(struct blk *b, enum insn_type o, enum val_type t, struct val r,
struct val a0, struct val a1)
{
struct insn i = insn_create(o, t, r, a0, a1);
vec_append(&b->insns, &i);
}
int64_t idalloc(struct fn *f, const char *id)
{
int64_t t = idmatch(f, id);
if (t >= 0) {
return t;
}
t = f->ntmp++;
vec_append(&f->tmps, &(struct tmp_map){.id = id, .v = t});
return t;
}
int64_t idmatch(struct fn *f, const char *id)
{
foreach_tmp(i, f->tmps) {
struct tmp_map t = tmp_at(f->tmps, i);
if (strcmp(t.id, id) == 0)
return t.v;
}
return -1;
}
void finish_block(struct blk *b, enum insn_type cmp, struct val a0,
struct val a1, const char *label)
{
assert(cmp >= BEQ && cmp <= RET && "illegal comparison type for block");
b->btype = cmp;
b->cmp[0] = a0;
b->cmp[1] = a1;
b->to = label;
}
struct blk *new_block(struct fn *f)
{
struct blk *b = calloc(1, sizeof(struct blk));
b->id = ++f->nblk;
b->visited = 0;
b->insns = vec_create(sizeof(struct insn));
b->params = vec_create(sizeof(struct val));
b->args1 = vec_create(sizeof(struct val));
b->args2 = vec_create(sizeof(struct val));
vec_append(&f->blks, &b);
return b;
}
static struct label_map label_find(struct fn *f, const char *name)
{
foreach_label(i, f->labels) {
struct label_map m = label_at(f->labels, i);
if (strcmp(m.id, name) == 0)
return m;
}
return (struct label_map){.id = NULL, .b = NULL};
}
bool blk_empty(struct blk *b)
{
return vec_len(&b->insns) == 0;
}
void finish_function(struct fn *f, const char *name)
{
/** @todo check that returns match */
f->name = name;
/* last block should always be empty and can be removed */
struct blk *last_blk = blk_pop(f->blks);
if (!blk_empty(last_blk)) {
error("last block not empty, %s missing return?", name);
abort();
}
destroy_block(last_blk);
last_blk = blk_back(f->blks);
/* somewhat arbitrary restriction but I guess but makes the
* implementation a bit simpler */
assert(last_blk->btype == RET);
last_blk->s1 = NULL;
last_blk->s2 = NULL;
foreach_blk(i, f->blks) {
struct blk *b = blk_at(f->blks, i);
if (!b->to)
continue;
struct label_map m = label_find(f, b->to);
if (!m.id) {
error("no label %s", b->to);
abort();
}
b->s2 = m.b;
if (b->btype == J)
b->s1 = b->s2;
}
}
struct fn *new_function()
{
struct fn *f = calloc(1, sizeof(struct fn));
f->blks = vec_create(sizeof(struct blk *));
f->tmps = vec_create(sizeof(struct tmp_map));
f->labels = vec_create(sizeof(struct label_map));
f->has_calls = false;
f->max_callee_save = 0;
/* empty block */
new_block(f);
return f;
}
void destroy_function(struct fn *f)
{
vec_destroy(&f->tmps);
vec_destroy(&f->labels);
foreach_blk(i, f->blks) {
struct blk *b = blk_at(f->blks, i);
destroy_block(b);
}
vec_destroy(&f->blks);
free(f);
}
void destroy_block(struct blk *b)
{
vec_destroy(&b->insns);
vec_destroy(&b->params);
vec_destroy(&b->args1);
vec_destroy(&b->args2);
free(b);
}
void new_label(struct fn *f, struct blk *b, const char *name)
{
vec_append(&f->labels, &(struct label_map){.id = name, .b = b});
}
void dump_val(struct val val) {
long long r = val.r;
long long v = val.v;
const char *s = val.s;
switch (val.class) {
case REG: printf("r%lli", r); break;
case TMP: printf("t%lli", r); break;
case IMM: printf("%lli", v); break;
case MEM: printf("(r%lli, %lli)", r, v); break;
case REF: printf("\"%s\"", s); break;
case NOCLASS: break;
}
}
void dump_insn(struct insn i)
{
printf("//\t");
if (hasclass(i.out)) {
dump_val(i.out);
printf(" ");
}
printf("%s", op_str(i.type));
if (hasclass(i.in[0])) {
printf(" ");
dump_val(i.in[0]);
}
if (hasclass(i.in[1])) {
printf(" ");
dump_val(i.in[1]);
}
if (i.flags)
printf("*");
printf("\n");
}
bool return_blk(struct blk *b)
{
return b->btype == RET;
}
void dump_block(struct blk *b)
{
printf("//\t/*** block %lld ", (long long)b->id);
if (b->name) printf("\"%s\" ", b->name);
printf("(");
foreach_blk_param(pi, b->params) {
struct val v = blk_param_at(b->params, pi);
dump_val(v);
printf(", ");
}
printf(") ");
printf("***/\n");
foreach_insn(i, b->insns) {
struct insn n = insn_at(b->insns, i);
dump_insn(n);
}
if (return_blk(b)) {
printf("//\tRETURN\n");
return;
}
assert(b->s2);
struct blk *s2 = b->s2;
printf("//\t%s ", op_str(b->btype));
dump_val(b->cmp[0]);
printf(" ");
dump_val(b->cmp[1]);
printf(" -> %lli (", (long long)s2->id);
foreach_blk_param(pi, b->args2) {
struct val a = blk_param_at(b->args2, pi);
dump_val(a);
printf(", ");
}
printf("), else %lli (", (long long)b->s1->id);
foreach_blk_param(pi, b->args1) {
struct val a = blk_param_at(b->args1, pi);
dump_val(a);
printf(", ");
}
printf(")\n");
}
void dump_function(struct fn *f) {
printf("//\t/*** function %s ***/\n", f->name);
foreach_blk(i, f->blks) {
struct blk *b = blk_at(f->blks, i);
dump_block(b);
}
printf("\n");
}
|
