-
Notifications
You must be signed in to change notification settings - Fork 129
/
Copy pathreg-alloc.c
787 lines (704 loc) · 25.2 KB
/
reg-alloc.c
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
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
/*
* shecc - Self-Hosting and Educational C Compiler.
*
* shecc is freely redistributable under the BSD 2 clause license. See the
* file "LICENSE" for information on usage and redistribution of this file.
*/
/* Allocate registers from IR. The linear-scan algorithm now expects a minimum
* of 7 available registers (typical for RISC-style architectures).
*
* TODO: Implement the "-O level" option. This allocator now always drops the
* dead variable and does NOT wrtie it back to the stack.
*/
#include <stdbool.h>
#include "defs.h"
#include "globals.c"
/* Aligns size to nearest multiple of 4, this meets
* ARMv7's alignment requirement.
*
* This function should
* be called whenever handling with user-defined type's
* size.
*/
int align_size(int i)
{
return i <= 4 ? 4 : (i + 3) & ~3;
}
bool check_live_out(basic_block_t *bb, var_t *var)
{
for (int i = 0; i < bb->live_out_idx; i++) {
if (bb->live_out[i] == var)
return true;
}
return false;
}
void refresh(basic_block_t *bb, insn_t *insn)
{
for (int i = 0; i < REG_CNT; i++) {
if (!REGS[i].var)
continue;
if (check_live_out(bb, REGS[i].var))
continue;
if (REGS[i].var->consumed < insn->idx) {
REGS[i].var = NULL;
REGS[i].polluted = 0;
}
}
}
ph2_ir_t *bb_add_ph2_ir(basic_block_t *bb, opcode_t op)
{
ph2_ir_t *n = arena_alloc(BB_ARENA, sizeof(ph2_ir_t));
n->op = op;
if (!bb->ph2_ir_list.head)
bb->ph2_ir_list.head = n;
else
bb->ph2_ir_list.tail->next = n;
bb->ph2_ir_list.tail = n;
return n;
}
/* Priority of spilling:
* - live_out variable
* - farthest local variable
*/
void spill_var(basic_block_t *bb, var_t *var, int idx)
{
if (!REGS[idx].polluted) {
REGS[idx].var = NULL;
return;
}
if (!var->offset) {
var->offset = bb->belong_to->func->stack_size;
bb->belong_to->func->stack_size += 4;
}
ph2_ir_t *ir = var->is_global ? bb_add_ph2_ir(bb, OP_global_store)
: bb_add_ph2_ir(bb, OP_store);
ir->src0 = idx;
ir->src1 = var->offset;
REGS[idx].var = NULL;
REGS[idx].polluted = 0;
}
/* Return the index of register for given variable. Otherwise, return -1. */
int find_in_regs(var_t *var)
{
for (int i = 0; i < REG_CNT; i++) {
if (REGS[i].var == var)
return i;
}
return -1;
}
void load_var(basic_block_t *bb, var_t *var, int idx)
{
ph2_ir_t *ir = var->is_global ? bb_add_ph2_ir(bb, OP_global_load)
: bb_add_ph2_ir(bb, OP_load);
ir->src0 = var->offset;
ir->dest = idx;
REGS[idx].var = var;
REGS[idx].polluted = 0;
}
int prepare_operand(basic_block_t *bb, var_t *var, int operand_0)
{
int i = find_in_regs(var);
if (i > -1)
return i;
for (i = 0; i < REG_CNT; i++) {
if (!REGS[i].var) {
load_var(bb, var, i);
return i;
}
}
for (i = 0; i < REG_CNT; i++) {
if (i == operand_0)
continue;
if (check_live_out(bb, REGS[i].var)) {
spill_var(bb, REGS[i].var, i);
load_var(bb, var, i);
return i;
}
}
/* spill farthest local */
int spilled = 0;
for (i = 0; i < REG_CNT; i++) {
if (!REGS[i].var)
continue;
if (REGS[i].var->consumed > REGS[spilled].var->consumed)
spilled = i;
}
spill_var(bb, REGS[spilled].var, spilled);
load_var(bb, var, spilled);
return spilled;
}
int prepare_dest(basic_block_t *bb, var_t *var, int operand_0, int operand_1)
{
int i = find_in_regs(var);
if (i > -1) {
REGS[i].polluted = 1;
return i;
}
for (i = 0; i < REG_CNT; i++) {
if (!REGS[i].var) {
REGS[i].var = var;
REGS[i].polluted = 1;
return i;
}
}
for (i = 0; i < REG_CNT; i++) {
if (i == operand_0)
continue;
if (i == operand_1)
continue;
if (check_live_out(bb, REGS[i].var)) {
spill_var(bb, REGS[i].var, i);
REGS[i].var = var;
REGS[i].polluted = 1;
return i;
}
}
/* spill farthest local */
int spilled = 0;
for (i = 0; i < REG_CNT; i++) {
if (i == operand_0)
continue;
if (i == operand_1)
continue;
if (!REGS[i].var)
continue;
if (REGS[i].var->consumed > REGS[spilled].var->consumed)
spilled = i;
}
spill_var(bb, REGS[spilled].var, spilled);
REGS[spilled].var = var;
REGS[spilled].polluted = 1;
return spilled;
}
void spill_alive(basic_block_t *bb, insn_t *insn)
{
for (int i = 0; i < REG_CNT; i++) {
if (!REGS[i].var)
continue;
if (check_live_out(bb, REGS[i].var)) {
spill_var(bb, REGS[i].var, i);
continue;
}
if (REGS[i].var->consumed > insn->idx) {
spill_var(bb, REGS[i].var, i);
continue;
}
}
}
void spill_live_out(basic_block_t *bb)
{
for (int i = 0; i < REG_CNT; i++) {
if (!REGS[i].var)
continue;
if (!check_live_out(bb, REGS[i].var)) {
REGS[i].var = NULL;
REGS[i].polluted = 0;
continue;
}
if (!var_check_killed(REGS[i].var, bb)) {
REGS[i].var = NULL;
REGS[i].polluted = 0;
continue;
}
spill_var(bb, REGS[i].var, i);
}
}
/* The operand of 'OP_push' should not been killed until function called. */
void extend_liveness(basic_block_t *bb, insn_t *insn, var_t *var, int offset)
{
if (check_live_out(bb, var))
return;
if (insn->idx + offset > var->consumed)
var->consumed = insn->idx + offset;
}
void reg_alloc()
{
/* TODO: .bss and .data section */
for (insn_t *global_insn = GLOBAL_FUNC.fn->bbs->insn_list.head; global_insn;
global_insn = global_insn->next) {
ph2_ir_t *ir;
int dest, src0;
switch (global_insn->opcode) {
case OP_allocat:
if (global_insn->rd->array_size) {
global_insn->rd->offset = GLOBAL_FUNC.stack_size;
GLOBAL_FUNC.stack_size += PTR_SIZE;
src0 = GLOBAL_FUNC.stack_size;
if (global_insn->rd->is_ptr)
GLOBAL_FUNC.stack_size +=
align_size(PTR_SIZE * global_insn->rd->array_size);
else {
type_t *type = find_type(global_insn->rd->type_name, 0);
GLOBAL_FUNC.stack_size +=
align_size(global_insn->rd->array_size * type->size);
}
dest =
prepare_dest(GLOBAL_FUNC.fn->bbs, global_insn->rd, -1, -1);
ir = bb_add_ph2_ir(GLOBAL_FUNC.fn->bbs, OP_global_address_of);
ir->src0 = src0;
ir->dest = dest;
spill_var(GLOBAL_FUNC.fn->bbs, global_insn->rd, dest);
} else {
global_insn->rd->offset = GLOBAL_FUNC.stack_size;
if (global_insn->rd->is_ptr)
GLOBAL_FUNC.stack_size += PTR_SIZE;
else if (strcmp(global_insn->rd->type_name, "int") &&
strcmp(global_insn->rd->type_name, "char") &&
strcmp(global_insn->rd->type_name, "_Bool")) {
type_t *type = find_type(global_insn->rd->type_name, 0);
GLOBAL_FUNC.stack_size += align_size(type->size);
} else
/* 'char' is aligned to one byte for the convenience */
GLOBAL_FUNC.stack_size += 4;
}
break;
case OP_load_constant:
dest = prepare_dest(GLOBAL_FUNC.fn->bbs, global_insn->rd, -1, -1);
ir = bb_add_ph2_ir(GLOBAL_FUNC.fn->bbs, OP_load_constant);
ir->src0 = global_insn->rd->init_val;
ir->dest = dest;
break;
case OP_assign:
src0 = prepare_operand(GLOBAL_FUNC.fn->bbs, global_insn->rs1, -1);
dest = prepare_dest(GLOBAL_FUNC.fn->bbs, global_insn->rd, src0, -1);
ir = bb_add_ph2_ir(GLOBAL_FUNC.fn->bbs, OP_assign);
ir->src0 = src0;
ir->dest = dest;
spill_var(GLOBAL_FUNC.fn->bbs, global_insn->rd, dest);
/* release the unused constant number in register manually */
REGS[src0].polluted = 0;
REGS[src0].var = NULL;
break;
default:
printf("Unsupported global operation\n");
abort();
}
}
for (fn_t *fn = FUNC_LIST.head; fn; fn = fn->next) {
fn->visited++;
if (!strcmp(fn->func->return_def.var_name, "main"))
MAIN_BB = fn->bbs;
for (int i = 0; i < REG_CNT; i++)
REGS[i].var = NULL;
/* set arguments available */
for (int i = 0; i < fn->func->num_params; i++) {
REGS[i].var = fn->func->param_defs[i].subscripts[0];
REGS[i].polluted = 1;
}
/* variadic function implementation */
if (fn->func->va_args) {
for (int i = 0; i < MAX_PARAMS; i++) {
ph2_ir_t *ir = bb_add_ph2_ir(fn->bbs, OP_store);
if (i < fn->func->num_params)
fn->func->param_defs[i].subscripts[0]->offset =
fn->func->stack_size;
ir->src0 = i;
ir->src1 = fn->func->stack_size;
fn->func->stack_size += 4;
}
}
for (basic_block_t *bb = fn->bbs; bb; bb = bb->rpo_next) {
int is_pushing_args = 0, args = 0;
bb->visited++;
for (insn_t *insn = bb->insn_list.head; insn; insn = insn->next) {
func_t *func;
ph2_ir_t *ir;
int dest, src0, src1;
int sz, clear_reg;
refresh(bb, insn);
switch (insn->opcode) {
case OP_unwound_phi:
src0 = prepare_operand(bb, insn->rs1, -1);
if (!insn->rd->offset) {
insn->rd->offset = bb->belong_to->func->stack_size;
bb->belong_to->func->stack_size += 4;
}
ir = bb_add_ph2_ir(bb, OP_store);
ir->src0 = src0;
ir->src1 = insn->rd->offset;
break;
case OP_allocat:
if ((!strcmp(insn->rd->type_name, "void") ||
!strcmp(insn->rd->type_name, "int") ||
!strcmp(insn->rd->type_name, "char") ||
!strcmp(insn->rd->type_name, "_Bool")) &&
insn->rd->array_size == 0)
break;
insn->rd->offset = fn->func->stack_size;
fn->func->stack_size += PTR_SIZE;
src0 = fn->func->stack_size;
if (insn->rd->is_ptr)
sz = PTR_SIZE;
else {
type_t *type = find_type(insn->rd->type_name, 0);
sz = type->size;
}
if (insn->rd->array_size)
fn->func->stack_size +=
align_size(insn->rd->array_size * sz);
else
fn->func->stack_size += align_size(sz);
dest = prepare_dest(bb, insn->rd, -1, -1);
ir = bb_add_ph2_ir(bb, OP_address_of);
ir->src0 = src0;
ir->dest = dest;
break;
case OP_load_constant:
case OP_load_data_address:
if (insn->rd->consumed == -1)
break;
dest = prepare_dest(bb, insn->rd, -1, -1);
ir = bb_add_ph2_ir(bb, insn->opcode);
ir->src0 = insn->rd->init_val;
ir->dest = dest;
/* store global variable immediately after assignment */
if (insn->rd->is_global) {
ir = bb_add_ph2_ir(bb, OP_global_store);
ir->src0 = dest;
ir->src1 = insn->rd->offset;
REGS[dest].polluted = 0;
}
break;
case OP_address_of:
/* make sure variable is on stack */
if (!insn->rs1->offset) {
insn->rs1->offset = bb->belong_to->func->stack_size;
bb->belong_to->func->stack_size += 4;
for (int i = 0; i < REG_CNT; i++)
if (REGS[i].var == insn->rs1) {
ir = bb_add_ph2_ir(bb, OP_store);
ir->src0 = i;
ir->src1 = insn->rs1->offset;
}
}
dest = prepare_dest(bb, insn->rd, -1, -1);
if (insn->rs1->is_global)
ir = bb_add_ph2_ir(bb, OP_global_address_of);
else
ir = bb_add_ph2_ir(bb, OP_address_of);
ir->src0 = insn->rs1->offset;
ir->dest = dest;
break;
case OP_assign:
if (insn->rd->consumed == -1)
break;
src0 = find_in_regs(insn->rs1);
/* If operand is loaded from stack, clear the original slot
* after moving.
*/
if (src0 > -1)
clear_reg = 0;
else {
clear_reg = 1;
src0 = prepare_operand(bb, insn->rs1, -1);
}
dest = prepare_dest(bb, insn->rd, src0, -1);
ir = bb_add_ph2_ir(bb, OP_assign);
ir->src0 = src0;
ir->dest = dest;
/* store global variable immediately after assignment */
if (insn->rd->is_global) {
ir = bb_add_ph2_ir(bb, OP_global_store);
ir->src0 = dest;
ir->src1 = insn->rd->offset;
REGS[dest].polluted = 0;
}
if (clear_reg)
REGS[src0].var = NULL;
break;
case OP_read:
src0 = prepare_operand(bb, insn->rs1, -1);
dest = prepare_dest(bb, insn->rd, src0, -1);
ir = bb_add_ph2_ir(bb, OP_read);
ir->src0 = src0;
ir->src1 = insn->sz;
ir->dest = dest;
break;
case OP_write:
if (insn->rs2->is_func) {
src0 = prepare_operand(bb, insn->rs1, -1);
ir = bb_add_ph2_ir(bb, OP_address_of_func);
ir->src0 = src0;
strcpy(ir->func_name, insn->rs2->var_name);
} else {
/* FIXME: Avoid outdated content in register after
* storing, but causing some redundant spilling.
*/
spill_alive(bb, insn);
src0 = prepare_operand(bb, insn->rs1, -1);
src1 = prepare_operand(bb, insn->rs2, src0);
ir = bb_add_ph2_ir(bb, OP_write);
ir->src0 = src0;
ir->src1 = src1;
ir->dest = insn->sz;
}
break;
case OP_branch:
src0 = prepare_operand(bb, insn->rs1, -1);
/* REGS[src0].var had been set to NULL, but the actual
* content is still holded in the register.
*/
spill_live_out(bb);
ir = bb_add_ph2_ir(bb, OP_branch);
ir->src0 = src0;
ir->then_bb = bb->then_;
ir->else_bb = bb->else_;
break;
case OP_push:
extend_liveness(bb, insn, insn->rs1, insn->sz);
if (!is_pushing_args) {
spill_alive(bb, insn);
is_pushing_args = 1;
}
src0 = prepare_operand(bb, insn->rs1, -1);
ir = bb_add_ph2_ir(bb, OP_assign);
ir->src0 = src0;
ir->dest = args++;
REGS[ir->dest].var = insn->rs1;
REGS[ir->dest].polluted = 0;
break;
case OP_call:
func = find_func(insn->str);
if (!func->num_params)
spill_alive(bb, insn);
ir = bb_add_ph2_ir(bb, OP_call);
strcpy(ir->func_name, insn->str);
is_pushing_args = 0;
args = 0;
for (int i = 0; i < REG_CNT; i++)
REGS[i].var = NULL;
break;
case OP_indirect:
if (!args)
spill_alive(bb, insn);
src0 = prepare_operand(bb, insn->rs1, -1);
ir = bb_add_ph2_ir(bb, OP_load_func);
ir->src0 = src0;
bb_add_ph2_ir(bb, OP_indirect);
is_pushing_args = 0;
args = 0;
break;
case OP_func_ret:
dest = prepare_dest(bb, insn->rd, -1, -1);
ir = bb_add_ph2_ir(bb, OP_assign);
ir->src0 = 0;
ir->dest = dest;
break;
case OP_return:
if (insn->rs1)
src0 = prepare_operand(bb, insn->rs1, -1);
else
src0 = -1;
ir = bb_add_ph2_ir(bb, OP_return);
ir->src0 = src0;
break;
case OP_add:
case OP_sub:
case OP_mul:
case OP_div:
case OP_mod:
case OP_lshift:
case OP_rshift:
case OP_eq:
case OP_neq:
case OP_gt:
case OP_geq:
case OP_lt:
case OP_leq:
case OP_bit_and:
case OP_bit_or:
case OP_bit_xor:
src0 = prepare_operand(bb, insn->rs1, -1);
src1 = prepare_operand(bb, insn->rs2, src0);
dest = prepare_dest(bb, insn->rd, src0, src1);
ir = bb_add_ph2_ir(bb, insn->opcode);
ir->src0 = src0;
ir->src1 = src1;
ir->dest = dest;
break;
case OP_negate:
case OP_bit_not:
case OP_log_not:
src0 = prepare_operand(bb, insn->rs1, -1);
dest = prepare_dest(bb, insn->rd, src0, -1);
ir = bb_add_ph2_ir(bb, insn->opcode);
ir->src0 = src0;
ir->dest = dest;
break;
default:
printf("Unknown opcode\n");
abort();
}
}
if (bb->next)
spill_live_out(bb);
if (bb == fn->exit)
continue;
/* append jump instruction for the normal block only */
if (!bb->next)
continue;
if (bb->next == fn->exit)
continue;
/* jump to the beginning of loop or over the else block */
if (bb->next->visited == fn->visited ||
bb->next->rpo != bb->rpo + 1) {
ph2_ir_t *ir = bb_add_ph2_ir(bb, OP_jump);
ir->next_bb = bb->next;
}
}
/* handle implicit return */
for (int i = 0; i < MAX_BB_PRED; i++) {
basic_block_t *bb = fn->exit->prev[i].bb;
if (!bb)
continue;
if (strcmp(fn->func->return_def.type_name, "void"))
continue;
if (bb->insn_list.tail)
if (bb->insn_list.tail->opcode == OP_return)
continue;
ph2_ir_t *ir = bb_add_ph2_ir(bb, OP_return);
ir->src0 = -1;
}
}
}
void dump_ph2_ir()
{
for (int i = 0; i < ph2_ir_idx; i++) {
ph2_ir_t *ph2_ir = PH2_IR_FLATTEN[i];
int rd = ph2_ir->dest + 48;
int rs1 = ph2_ir->src0 + 48;
int rs2 = ph2_ir->src1 + 48;
switch (ph2_ir->op) {
case OP_define:
printf("%s:", ph2_ir->func_name);
break;
case OP_block_start:
case OP_block_end:
case OP_allocat:
continue;
case OP_assign:
printf("\t%%x%c = %%x%c", rd, rs1);
break;
case OP_load_constant:
printf("\tli %%x%c, $%d", rd, ph2_ir->src0);
break;
case OP_load_data_address:
printf("\t%%x%c = .data(%d)", rd, ph2_ir->src0);
break;
case OP_address_of:
printf("\t%%x%c = %%sp + %d", rd, ph2_ir->src0);
break;
case OP_global_address_of:
printf("\t%%x%c = %%gp + %d", rd, ph2_ir->src0);
break;
case OP_label:
printf("%s:", ph2_ir->func_name);
break;
case OP_branch:
printf("\tbr %%x%c", rs1);
break;
case OP_jump:
printf("\tj %s", ph2_ir->func_name);
break;
case OP_call:
printf("\tcall @%s", ph2_ir->func_name);
break;
case OP_return:
if (ph2_ir->src0 == -1)
printf("\tret");
else
printf("\tret %%x%c", rs1);
break;
case OP_load:
printf("\tload %%x%c, %d(sp)", rd, ph2_ir->src0);
break;
case OP_store:
printf("\tstore %%x%c, %d(sp)", rs1, ph2_ir->src1);
break;
case OP_global_load:
printf("\tload %%x%c, %d(gp)", rd, ph2_ir->src0);
break;
case OP_global_store:
printf("\tstore %%x%c, %d(gp)", rs1, ph2_ir->src1);
break;
case OP_read:
printf("\t%%x%c = (%%x%c)", rd, rs1);
break;
case OP_write:
printf("\t(%%x%c) = %%x%c", rs2, rs1);
break;
case OP_address_of_func:
printf("\t(%%x%c) = @%s", rs1, ph2_ir->func_name);
break;
case OP_load_func:
printf("\tload %%t0, %d(sp)", ph2_ir->src0);
break;
case OP_global_load_func:
printf("\tload %%t0, %d(gp)", ph2_ir->src0);
break;
case OP_indirect:
printf("\tindirect call @(%%t0)");
break;
case OP_negate:
printf("\tneg %%x%c, %%x%c", rd, rs1);
break;
case OP_add:
printf("\t%%x%c = add %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_sub:
printf("\t%%x%c = sub %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_mul:
printf("\t%%x%c = mul %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_div:
printf("\t%%x%c = div %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_mod:
printf("\t%%x%c = mod %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_eq:
printf("\t%%x%c = eq %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_neq:
printf("\t%%x%c = neq %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_gt:
printf("\t%%x%c = gt %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_lt:
printf("\t%%x%c = lt %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_geq:
printf("\t%%x%c = geq %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_leq:
printf("\t%%x%c = leq %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_bit_and:
printf("\t%%x%c = and %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_bit_or:
printf("\t%%x%c = or %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_bit_not:
printf("\t%%x%c = not %%x%c", rd, rs1);
break;
case OP_bit_xor:
printf("\t%%x%c = xor %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_log_not:
printf("\t%%x%c = not %%x%c", rd, rs1);
break;
case OP_rshift:
printf("\t%%x%c = rshift %%x%c, %%x%c", rd, rs1, rs2);
break;
case OP_lshift:
printf("\t%%x%c = lshift %%x%c, %%x%c", rd, rs1, rs2);
break;
default:
break;
}
printf("\n");
}
}