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
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
|
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include "ast.h"
#include "ssa.h"
#include "mips.h"
int reg_v0 = 2;
int reg_v1 = 3;
int memcpy_cnt;
static int save_pos[32];
static int used_reg[32];
void mips_prologue() {
CVList_t v;
CSList_t s;
printf(".data 0x10000000\n");
for (v = gvars; v; v = v->next)
{
CVar_t var = v->var;
printf("\t.align 2\n");
printf("_%s:\n", var->name);
var->start = -1;
if (var->initr)
{
CNode *initr = var->initr->chd;
assert(var->initr->rec.subtype == INITR_NORM);
switch (initr->ext.type->type)
{
case CINT:
printf("\t.word %ld\n", initr->ext.const_val);
break;
case CCHAR:
printf("\t.byte %ld\n", initr->ext.const_val);
break;
case CPTR:
{
CType_t ref = initr->ext.type->rec.ref;
printf("\t.word ");
switch (ref->type)
{
case CFUNC:
printf("%s\n", initr->rec.strval);
break;
case CCHAR:
printf("_str_%d\n", ((CSList_t)initr->ext.const_val)->id);
break;
default: assert(0);
}
}
break;
default: assert(0);
}
}
else
printf("\t.space %d\n", calc_size(var->type));
}
printf("\t.align 2\n");
for (s = cstrs; s; s = s->next)
{
printf("_str_%d:\n", s->id);
printf("\t.asciiz \"%s\"\n", s->str);
}
/* pre-calc done */
printf(".text\n");
}
void mips_load(int reg, COpr_t opr) {
CVar_t var = opr->spill->info.var;
CType_t type = opr->type;
if (type->type == CSTRUCT ||
type->type == CUNION ||
type->type == CARR)
{
if (var->loc > 0)
printf("\tla $%d, _%s\n", reg, var->name);
else
printf("\taddiu $%d, $sp, %d\n", reg, var->start);
}
else
{
const char *l = type->type == CCHAR ? "lb" : "lw";
if (var->loc > 0)
printf("\t%s $%d, _%s\n", l, reg, var->name);
else
printf("\t%s $%d, %d($sp)\t#%s\n", l, reg, var->start, var->name);
}
}
void mips_store(int reg, COpr_t opr) {
CVar_t var = opr->spill->info.var;
CType_t type = opr->type;
const char *l = type->type == CCHAR ? "sb" : "sw";
/* TODO: struct */
if (var->loc > 0)
printf("\t%s $%d, _%s\n", l, reg, var->name);
else if (opr->reg == -1)
printf("\t%s $%d, %d($sp)\t#%s\n", l, reg, var->start, var->name);
}
int mips_to_reg(COpr_t opr, int reg0) {
if (opr->kind == IMM)
{
printf("\tli $%d, %d\n", reg0, opr->info.imm);
return reg0;
}
else if (opr->kind == IMMS)
{
printf("\tla $%d, _str_%d\n", reg0, opr->info.cstr->id);
return reg0;
}
else if (opr->kind == IMMF)
{
printf("\tla $%d, _func_%s\n", reg0, opr->info.str);
return reg0;
}
if (opr->reg != -1)
return opr->reg;
mips_load(reg0, opr);
return reg0;
}
void mips_memcpy() {
printf("\tj _mem_cond%d\n", memcpy_cnt);
printf("_mem_loop%d:\n", memcpy_cnt);
printf("\tlw $5, 0($%d)\n", reg_v0);
printf("\tsw $5, 0($%d)\n", reg_v1);
printf("\taddiu $%d, $%d, 4\n", reg_v1, reg_v1);
printf("\taddiu $%d, $%d, 4\n", reg_v0, reg_v0);
printf("\taddiu $a0, $a0, -4\n");
printf("_mem_cond%d:\n", memcpy_cnt);
printf("\tbnez $a0, _mem_loop%d\n", memcpy_cnt);
memcpy_cnt++;
}
/* memcpy requires three arguments */
#define RESERVED_CALL_SIZE 12
void mips_space_alloc() {
int local_size = func->rec.func.local_size;
int arg_size = RESERVED_CALL_SIZE;
int bret_size = 0;
int tmp_size = 0;
int offset = 0;
int prev = 0;
int save_size = MAX_AVAIL_REGS * INT_SIZE;
CBlock_t p;
COList_t d;
CVar_t v;
for (d = defs; d; d = d->next)
{
COpr_t opr = d->opr;
assert(opr->par == opr);
if (opr->kind == TMP && opr->reg == -1)
{
int t = opr->type->type;
tmp_size += align_shift(tmp_size);
opr->info.var->start = tmp_size;
if (t == CSTRUCT || t == CUNION || t == CARR)
tmp_size += PTR_SIZE;
else if (t == CVOID)
tmp_size += INT_SIZE;
else
tmp_size += calc_size(opr->type);
}
}
for (p = entry; p; p = p->next)
{
CInst_t i, ih = p->insts;
for (i = ih->next; i != ih; i = i->next)
{
if (i->op == PUSH)
{
COpr_t arg = i->src1;
offset += align_shift(offset);
i->offset = offset;
if (arg->kind == IMM)
offset += INT_SIZE;
else if (arg->kind == IMMS)
offset += PTR_SIZE;
else if (arg->kind == IMMF)
offset += PTR_SIZE;
else
{
CType_t t = arg->type;
if (t->type == CARR)
offset += PTR_SIZE;
else
offset += calc_size(t);
}
}
else if (i->op == CALL)
{
CType_t rt = i->dest->type;
if (offset > arg_size)
arg_size = offset;
offset = 0;
if (rt->type == CSTRUCT || rt->type == CUNION)
{
bret_size += align_shift(bret_size);
i->bret = bret_size;
bret_size += calc_size(rt);
}
else i->bret = -1;
}
}
}
prev += arg_size;
prev += align_shift(prev);
/* adjust offset for local variables */
for (v = func->rec.func.local; v; v = v->next)
v->start += prev;
prev += local_size;
prev += align_shift(prev);
{
int i;
for (i = 0; i < MAX_AVAIL_REGS; i++)
save_pos[avail_regs[i]] = prev + i * INT_SIZE;
save_pos[30] = save_size;
save_size += INT_SIZE;
}
prev += save_size;
/* adjust offset for spilled temporaries */
for (d = defs; d; d = d->next)
{
COpr_t opr = d->opr;
assert(opr->par == opr);
if (opr->kind == TMP && opr->reg == -1)
opr->info.var->start += prev;
}
prev += tmp_size;
prev += align_shift(prev);
for (p = entry; p; p = p->next)
{
CInst_t i, ih = p->insts;
for (i = ih->next; i != ih; i = i->next)
if (i->op == CALL && i->bret != -1)
i->bret += prev;
}
prev += bret_size;
prev += align_shift(prev);
prev += 4; /* return address */
for (v = func->rec.func.params; v; v = v->next)
v->start += prev; /* skip the whole frame to reach args */
func->rec.func.frame_size = prev;
}
void mips_func_begin() {
int fsize = func->rec.func.frame_size;
if (fsize < 0x8000)
printf("\taddiu $sp, $sp, -%d\n", fsize);
else
{
printf("\tli $%d, %d\n", reg_v0, -fsize);
printf("\taddu $sp, $sp, $%d\n", reg_v0);
}
printf("\tsw $31, %d($sp) #%s\n", fsize - 4, func->name);
}
void mips_func_end() {
int fsize = func->rec.func.frame_size;
printf("_ret_%s:\n", func->name);
printf("\tlw $31, %d($sp)\n", fsize - 4);
if (fsize < 0x8000)
printf("\taddiu $sp, $sp, %d\n", fsize);
else
{
printf("\tli $%d, %d\n", reg_v0, fsize);
printf("\taddu $sp, $sp, $%d\n", reg_v0);
}
printf("\tjr $31\n");
}
#define IN_IMM(x) (-0x8000 <= (x) && (x) < 0x8000)
void mips_generate() {
CBlock_t p;
CType_t rt = func->rec.func.ret;
/* int arg_cnt = 0; */
mips_space_alloc();
if (strcmp(func->name, "main"))
printf("_func_%s:\n",func->name);
else
printf("main:\n");
mips_func_begin();
for (p = entry; p; p = p->next)
{
if (p->ref) printf("_L%d:\n", p->id + gbbase);
CInst_t i, ih = p->insts;
const char *bop;
for (i = ih->next; i != ih; i = i->next)
{
int flag = 1, swap;
if (i->dest && i->dest->reg == -2 && i->dest->kind == TMP && i->op != CALL)
continue;
printf("# ");
cinst_print(stdout, i);
switch (i->op)
{
case LOAD:
if (i->dest->kind == VAR &&
i->dest->reg > 0) /* &&
i->dest->info.var->loc >= 0) */
mips_load(i->dest->reg, i->dest);
break;
case MOVE:
{
/* TODO: struct */
int rs;
int rd = i->dest->reg;
CType_t type = i->dest->type;
if ((type->type == CSTRUCT || type->type == CUNION) && i->dest->kind == VAR)
{
rs = mips_to_reg(i->src1, reg_v0);
/* assert(i->dest->kind == VAR); */
printf("\tsw $%d, 4($sp)\n", rs);
if (rd < 0) rd = reg_v0;
mips_load(rd, i->dest);
printf("\tsw $%d, 0($sp)\n", rd);
printf("\tli $%d, %d\n", reg_v0, calc_size(type));
printf("\tsw $%d, 8($sp)\n", reg_v0);
/* don't need to save current registers because
* memcpy doesn't interfere with them */
printf("\tjal _func_memcpy\n");
}
else
{
if (i->dest->reg > 0 && i->src1->kind == IMM)
{
printf("\tli $%d %d\n", i->dest->reg, i->src1->info.imm);
}
else
{
rs = mips_to_reg(i->src1, reg_v0);
if (rd > 0)
{
if (rd != rs) printf("\tmove $%d $%d\n", rd, rs);
}
else
rd = rs;
}
if (i->dest->reg == -1 ||
(i->dest->kind == VAR &&
i->dest->info.var->loc > 0))
mips_store(rd, i->dest);
}
}
break;
case BEQZ:
{
int rs = mips_to_reg(i->src1, reg_v0);
printf("\tbeqz $%d, _L%d\n", rs, i->dest->info.imm);
}
break;
case BNEZ:
{
int rs = mips_to_reg(i->src1, reg_v0);
printf("\tbnez $%d, _L%d\n", rs, i->dest->info.imm);
}
break;
case GOTO:
printf("\tj _L%d\n", i->dest->info.imm);
break;
case ARR:
{
CType_t type = i->src1->type;
int arr = mips_to_reg(i->src1, reg_v0);
int rd;
const char *l;
if (type->type == CARR)
type = type->rec.arr.elem;
else
type = type->rec.ref;
l = type->type == CCHAR ? "lb" : "lw";
if (i->src2->kind == IMM)
{
int index = i->src2->info.imm;
rd = i->dest->reg;
if (rd < 0) rd = reg_v1;
printf("\t%s $%d, %d($%d)\n", l, rd, index, arr);
}
else
{
int index = mips_to_reg(i->src2, reg_v1);
rd = i->dest->reg;
if (rd < 0) rd = reg_v0;
printf("\taddu $%d, $%d, $%d\n", reg_v1, arr, index);
printf("\t%s $%d, 0($%d)\n", l, rd, reg_v1);
}
if (i->dest->reg == -1 || i->dest->kind == VAR)
mips_store(rd, i->dest);
}
break;
case WARR:
{
CType_t type = i->wtype;
int arr = mips_to_reg(i->dest, reg_v1);
const char *s;
int rs;
/*
if (type->type == CARR)
type = type->rec.arr.elem;
else
type = type->rec.ref;
*/
s = type->type == CCHAR ? "sb" : "sw";
if (type->type == CSTRUCT || type->type == CUNION)
{
if (i->src2->kind == IMM)
printf("\taddiu $%d, $%d, %d\n", reg_v1, arr, i->src2->info.imm);
else
{
int index = mips_to_reg(i->src2, reg_v0);
printf("\taddu $%d, $%d, $%d\n", reg_v1, arr, index);
}
rs = mips_to_reg(i->src1, reg_v0);
printf("\tmove $%d, $%d\n", reg_v0, rs);
printf("\tli $a0, %d\n", calc_size(type));
mips_memcpy();
}
else
{
if (i->src2->kind == IMM)
{
rs = mips_to_reg(i->src1, reg_v0);
if (type->type == CSTRUCT || type->type == CUNION)
{
printf("\tmove $%d, $%d\n", reg_v0, rs);
printf("\taddiu $%d, $%d, $%d\n", reg_v1, arr, i->src2->info.imm);
printf("\tli $a0, %d\n", calc_size(type));
mips_memcpy();
}
else
printf("\t%s $%d, %d($%d)\n", s, rs, i->src2->info.imm, arr);
}
else
{
int index = mips_to_reg(i->src2, reg_v0);
printf("\taddu $%d, $%d, $%d\n", reg_v0, arr, index);
rs = mips_to_reg(i->src1, reg_v1);
printf("\t%s $%d, 0($%d)\n", s, rs, reg_v0);
}
}
}
break;
case PUSH:
{
int rs = mips_to_reg(i->src1, reg_v0);
/*
if (arg_cnt < 4)
{
printf("\tmove $%d, $%d\n", arg_cnt + 4, rs);
}
else
{
*/
CType_t type = i->src1->type;
if (type && (type->type == CSTRUCT || type->type == CUNION))
{
printf("\taddiu $%d, $sp, %d\n", reg_v1, i->offset);
printf("\tmove $%d, $%d\n", reg_v0, rs);
printf("\tli $a0, %d\n", calc_size(type));
mips_memcpy();
}
else
printf("\tsw $%d, %d($sp) # push\n", rs, i->offset);
/* }
arg_cnt++; */
}
break;
case CALL:
{
COList_t p;
int rd = i->dest->reg;
int j;
memset(used_reg, 0, sizeof used_reg);
if (rt->type == CSTRUCT || rt->type == CUNION)
used_reg[30] = 1; /* save $fp */
for (p = defs; p; p = p->next)
{
COpr_t opr = p->opr;
if (opr->reg != -1 &&
(opr->kind == TMP || opr->info.var->loc <= 0) &&
overlap_with_beg(opr, i->id))
used_reg[opr->reg] = 1;
}
for (j = 0; j < 32; j++)
if (used_reg[j])
printf("\tsw $%d, %d($sp) # save reg\n", j, save_pos[j]);
if (i->bret != -1)
{
if (i->dest->kind == TMP)
printf("\taddiu $fp, $sp, %d\n", i->bret);
else
mips_load(30, i->dest);
}
if (i->src1->kind == IMMF)
printf("\tjal %s%s\n",
strcmp(i->src1->info.str, "main") ? "_func_" : "",
i->src1->info.str);
else
printf("\tjalr $%d\n", mips_to_reg(i->src1, reg_v0));
for (j = 0; j < 32; j++)
if (used_reg[j])
printf("\tlw $%d, %d($sp) # load reg\n", j, save_pos[j]);
for (p = defs; p; p = p->next)
{
COpr_t opr = p->opr;
if (opr->reg != -1 &&
opr->kind == VAR &&
opr->info.var->loc > 0 &&
overlap_with_beg(opr, i->id))
mips_load(opr->reg, opr);
}
if (rd != -2)
{
if (i->bret != -1 && i->dest->kind == VAR)
{
if (rd == -1)
rd = mips_to_reg(i->dest, reg_v1);
if (reg_v1 != rd)
printf("\tmove $%d, $%d\n", reg_v1, rd);
printf("\tli $a0, %d\n", calc_size(i->dest->type));
mips_memcpy();
}
else
{
if (rd != -1)
printf("\tmove $%d, $%d\n", rd, reg_v0);
if (i->dest->reg == -1 || i->dest->kind == VAR)
mips_store(reg_v0, i->dest);
}
}
}
break;
case RET:
{
if (i->src1)
{
if (rt->type == CSTRUCT || rt->type == CUNION)
{
int rs = mips_to_reg(i->src1, reg_v0);
assert(i->src1->kind == VAR || i->src1->kind == TMP);
printf("\tsw $%d, 4($sp)\n", rs);
printf("\tsw $fp, 0($sp)\n");
printf("\tli $%d, %d\n", reg_v0, calc_size(rt));
printf("\tsw $%d, 8($sp)\n", reg_v0);
printf("\tjal _func_memcpy\n");
printf("\tmove $%d, $fp\n", reg_v0);
}
else
{
if (i->src1->reg != -1)
{
if (i->src1->kind == IMM)
printf("\tli $%d, %d\n", reg_v0, i->src1->info.imm);
else
printf("\tmove $%d, $%d\n", reg_v0, mips_to_reg(i->src1, reg_v1));
}
else
{
mips_to_reg(i->src1, reg_v0);
}
}
}
printf("\tj _ret_%s\n", func->name);
}
break;
case ADDR:
{
assert(i->src1->kind == VAR ||
i->src1->kind == IMMF);
int rd = i->dest->reg;
if (rd < 0) rd = reg_v0;
if (i->src1->kind == IMMF)
printf("\tla $%d, %s\n", rd, i->src1->info.str);
else
{
CVar_t var = i->src1->spill->info.var;
if (var->loc > 0)
printf("\tla $%d, _%s\n", rd, var->name);
else
printf("\taddiu $%d, $sp, %d\n", rd, var->start);
if (i->dest->reg == -1 || i->dest->kind == VAR)
mips_store(rd, i->dest);
}
}
break;
default: flag = 0;
}
if (flag) continue;
flag = 1;
swap = 0;
switch (i->op)
{
case MUL: bop = "mul"; break;
case DIV: bop = "divu"; break;
case MOD: bop = "rem"; break;
case ADD: bop = "addu"; swap = 1; break;
case SUB: bop = "subu"; break;
case SHL: bop = "sllv"; break;
case SHR: bop = "srlv"; break;
case AND: bop = "and"; swap = 1; break;
case XOR: bop = "xor"; swap = 1; break;
case OR: bop = "or"; swap = 1; break;
case NOR: bop = "nor"; break;
case EQ: bop = "seq"; break;
case NE: bop = "sne"; break;
case LT: bop = "slt"; break;
case GT: bop = "sgt"; break;
case LE: bop = "sle"; break;
case GE: bop = "sge"; break;
default: flag = 0;
}
if (flag)
{
int rs, rt;
int rd = i->dest->reg;
if (rd < 0) rd = reg_v0;
if (swap)
{
COpr_t t;
if (i->src1->kind == IMM)
{
t = i->src1;
i->src1 = i->src2;
i->src2 = t;
}
if (i->src2->kind == IMM && IN_IMM(i->src2->info.imm))
{
switch (i->op)
{
case ADD: bop = "addiu"; break;
case AND: bop = "andi"; break;
case XOR: bop = "xori"; break;
case OR: bop = "ori"; break;
default: ;
}
rs = mips_to_reg(i->src1, reg_v0);
printf("\t%s $%d, $%d, %d\n",
bop, rd, rs, i->src2->info.imm);
}
else swap = 0;
}
if (!swap)
{
rs = mips_to_reg(i->src1, reg_v0);
rt = mips_to_reg(i->src2, reg_v1);
printf("\t%s $%d, $%d, $%d\n", bop, rd, rs, rt);
}
if (i->dest->reg == -1 || i->dest->kind == VAR)
mips_store(rd, i->dest);
continue;
}
if (i->op == NEG)
{
int rs = mips_to_reg(i->src1, reg_v0);
int rd = i->dest->reg;
if (rd < 0) rd = reg_v0;
printf("\tnegu $%d, $%d\n", rd, rs);
if (i->dest->reg == -1 || i->dest->kind == VAR)
mips_store(rd, i->dest);
}
}
}
mips_func_end();
}
|