-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMipsCode.cpp
1041 lines (1003 loc) · 54.3 KB
/
MipsCode.cpp
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
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// Created by hzt on 2023/11/11.
//
#include <map>
#include <string>
#include "IntermediateCode.h"
#include "MipsCode.h"
#include <fstream>
using namespace std;
extern vector<ICode *> mainICodes ;
extern map<string, vector<ICode *>> otherFuncICodes;
extern vector<ICode *>globalDef ;
void MipsCode::assign(IEntry *src1,IEntry *src2,IEntry *dst) { //传进来需要已经values_Id处理好
/*
* 值传递 地址赋
* TODO:需要对全局变量的分类讨论 局部变量也是 写入值编译时不确定时
* TODO：多次写入的更新原则！！！
* */
output << "#assign" << endl;
if (src1->type == 0){
if (src1->canGetValue){
output << "li " << "$t1, " << src1->imm << endl;
}else{
output << "lw " << "$t1, " << src1->startAddress << "($zero)" << endl;
}
if (dst->type == 2){
output << "lw " << "$t2, " << dst->startAddress << "($zero)" << endl;
output << "sw " << "$t1, " << "0($t2)" << endl; // 需要从变量的IEntry的values_Id中取得的 t0 地址 为写语句而生
}else{
output << "sw " << "$t1, " << dst->startAddress << "($zero)" << endl; //dst是值 需要从变量的IEntry的values_Id中取得的
}
dst->canGetValue = false;//后台更新
}else{
output << "#地址拷贝\n";
output<< "lw $t0, "<<src1->startAddress<<"($zero)"<<endl;
output<< "sw $t0, "<< dst->startAddress<< "($zero)"<<endl;
dst->canGetValue = false;
//赋值的地址参数拷贝！！！
// dst->canGetValue = false;
// dst->isGlobal = src1->isGlobal;
// dst->values_Id = src1->values_Id;
// dst->values = src1->values;//none sense
// dst->type = 1;
// dst->total_length = src1->total_length;
// //dst->dim1_length = src1->dim1_length;//以FParam来标准 不需要传递
// dst->offset_IEntry = src1->offset_IEntry;
// dst->startAddress = src1->startAddress;//关于数组地址的属性都要拷贝
//FIXME:其他属性就不用拷贝的？ 理清楚？ isGlobal保持自己 has_return 不可能
}
}
void MipsCode::testRe(){
// 创建一个ofstream对象
// 保存outputFile的原始缓冲区指针
// std::streambuf* outputFileBuffer = std::output.rdbuf();
// 将outputFile的流重定向到outputFile
// std::output.rdbuf(output.rdbuf());
output << ".text\n";
// 重定向结束后，可以将outputFile的流恢复到原始状态
// std::output.rdbuf(outputFileBuffer);
}
void MipsCode::translate() {
// 创建一个ofstream对象
// std::ofstream output("mips.txt");
// 保存outputFile的原始缓冲区指针
// std::streambuf* outputFileBuffer = std::output.rdbuf();
// 将outputFile的流重定向到outputFile
// std::output.rdbuf(output.rdbuf());
/**
* 输出全局的变量定义data段 以及全局变量的初始化
*/
output << ".data 0x10010000\n";
// output << ".data 0x1000\n";
output << "temp: .space 160000\n\n"; // 临时内存区，起始地址为0x10010000 (16) or 268500992 (10)
/**字符串区
# string tokens:
str_1: .asciiz "hello!"
str_3: .asciiz "haha"
str_5: .asciiz "ha"
*/
output << "#strings in printf\n";
for (auto id: strings) {
output << "str_" << id << ": .asciiz " << "\"" << IEntries.at(id)->str << "\"" << endl;
}
for (auto def:globalDef) {
//形如 def src1
IntermediateCodeType type = def->type;
//TODO:名字需要注意 是否在语法分析时准备好名字
switch (type) {
case VAR_Def_Has_Value:
output << def->src1->original_Name << ": .word " ;
for (auto id_init_value:*(def->src1->values_Id)) {
output << IEntries.at(id_init_value )->imm << " ";
}
output << endl;
break;
case VAR_Def_No_Value:
output << def->src1->original_Name << ": .word " ;
for (int i = 0;i<def->src1->total_length;i++) { //单个普通全局变量
output << "0 ";//此时输出值也会是0 在语法分析部分进行了判断补充
}
output << endl;
break;
case ARRAY_VAR_Def_Has_Value:
output << def->src1->original_Name << ": .word " ;
for (auto id_init_value:*(def->src1->values_Id)) {
output << IEntries.at(id_init_value)->imm << " ";
}
output << endl;
break;
case ARRAY_Def_No_Value:
output << def->src1->original_Name << ": .word " ;
for (int i = 0;i<def->src1->total_length;i++) {
output << "0 ";
}
output << endl;
break;
case Const_Def_Has_Value:
output << def->src1->original_Name << ": .word " ;
for (auto id_value:*(def->src1->values_Id)) {
output << IEntries.at(id_value)->imm << " ";
}
output << endl;
break;
case ARRAY_CONST_Def_Has_Value:
output << def->src1->original_Name << ": .word " ;
for (auto id_value:*(def->src1->values_Id)) {
output << IEntries.at(id_value)->imm << " ";
}
output << endl;
break;
default:
break;
}
}
/**
* 输出主函数main的代码ICode
*/
output << ".text 0x00400000 \n";
output << "#主函数main的代码ICode\n";
output << "main:\n";
for (auto ICode: mainICodes) {
IntermediateCodeType type = ICode->type;
IEntry *src1 = ICode->src1;
IEntry *src2 = ICode->src2;
IEntry *dst= ICode->dst;
IEntry **dst_ptr = &dst;
int cnt_param;//for printf_exp
int cnt = 0;//for def sw address
vector<int> *rParam_ids ;
vector<int> *fParam_ids ;
switch (type) {
case Printf:
cnt_param = 0;
output << "#printf语句:" << src2->values_Id->size() << "个exp参数\n";
for (auto id: *src1->strings_iEntry_id) {
/**
la $a0, str_1
li $v0, 4
syscall
lw $a0, 268501012($zero)
li $v0, 1
syscall
*/
if (IEntries.at(id)->str == "%d"){//lw li 1 syscall
IEntry * p = IEntries.at( src2->values_Id->at(cnt_param++));
// IEntry * p_val = IEntries.at(p->values_Id->at(0));//VALUE!!!
IEntry * p_val = p;
if (p_val->canGetValue){
output << "li $a0, " << p_val->imm << endl;
}else{
output << "lw $a0, " << p_val->startAddress << "($zero)" << endl;
}
output << "li $v0, 1" << endl;
output << "syscall" << endl;
}else{
//la li 4 syscall
output << "la $a0, " << "str_" << id << endl;
output << "li $v0, 4" << endl;
output << "syscall" << endl;
}
}
break;
case Add:{
if (src1->canGetValue && src2->canGetValue){
dst->canGetValue = true;
dst->imm = src1->imm + src2->imm;
}else {
if (src1->canGetValue){
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "addu " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else if (src2->canGetValue){
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "addu " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else{
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "addu " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
case Sub:{
if (src1->canGetValue && src2->canGetValue){
dst->canGetValue = true;
dst->imm = src1->imm - src2->imm;
}else {
if (src1->canGetValue){
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "sub " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else if (src2->canGetValue){
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "sub " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else{
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "sub " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
case Mult:{
output << "#执行乘法\n";
if (src1->canGetValue && src2->canGetValue){
dst->canGetValue = true;
dst->imm = src1->imm * src2->imm;
}else {
if (src1->canGetValue){
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "mul " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else if (src2->canGetValue){
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "mul " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else{
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "mul " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
//除法：HI存放余数，LO存放除法结果
case Div:{
output << "#执行div：\n";
if (src1->canGetValue && src2->canGetValue){
dst->canGetValue = true;
dst->imm = src1->imm / src2->imm;
}else {
if (src1->canGetValue){
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mflo " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else if (src2->canGetValue){
output << "li " << "$t1" << ", " << src2->imm << endl;
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mflo " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else{
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mflo " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
//TODO:优化
case Mod:{
if (src1->canGetValue && src2->canGetValue){
dst->canGetValue = true;
dst->imm = src1->imm % src2->imm;
}else {
if (src1->canGetValue){
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mfhi " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else if (src2->canGetValue){
output << "li " << "$t1" << ", " << src2->imm << endl;
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mfhi " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}else{
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mfhi " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
//FIXME:一定是地址？
case Assign:
assign(src1, nullptr,dst);
break;
//FIXME:总是容易陷入误区 得到v0的值已经是运行时 编译的极限块也做不到预知~
case GetInt:
output << "#getint:\n";
output << "\nli $v0, 5\n";
output << "syscall\n";
if (dst->type == 2){
output << "lw " << "$t0" << ", " << dst->startAddress << "($zero)" << endl;
output << "sw " << "$v0" << ", " << "0($t0)" << endl;
}else{
output << "sw " << "$v0" << ", " << dst->startAddress << "($zero)" << endl;//基本不会再被用到了？
}
dst->canGetValue = false;
break;
//TODO：检查格式统一 全都是IEntry格式 可以进行一个canGetElement的优化
case GetAddress:{
output<< "#GetTheAddress sw in dst 's address\n";
if (src2->type == 1){
output<< "lw $t0,"<<IEntries.at(src2->values_Id->at(0))->startAddress<<"($zero)"<<endl;
}else{
if (src2->isGlobal){
output<< "la $t0,"<<src2->original_Name<<endl;
}else{
output<< "li $t0,"<<src2->startAddress<<endl;
}
}
if (src1){
if (src1->canGetValue){
output<< "addu $t0,$t0,"<<src1->imm*4<<endl;
}else{
output<< "lw, $t1,"<<src1->startAddress<<"($zero)"<<endl;
output << "sll $t1,$t1,2"<<endl;
output<< "addu $t0,$t0,$t1"<<endl;
}
}
output<< "sw $t0,"<<dst->startAddress<<"($zero)"<<endl;
break;
}
case GetArrayElement:{//FIXME:数组元素的get需要找到元素地址！！！ 即本身 而不是值的副本 又或者说成是让定义的数组记住它！！
output << "#GetArray Element\n";
int index = 0;
int isNormalArray = src2->type;
if (isNormalArray == 0){//表示array并不是通过函数传递地址而来 即offsetEntry没用 或者认为就是0 即index就是最终索引 s7存放数组元素地址
if (src1->canGetValue){
index += src1->imm;
if (src2->isGlobal){
output << "la " << "$t0" << ", " << src2->original_Name << endl;
output << "li " << "$t1" << ", " << index * 4 << endl;
output << "addu " << "$t0" << ", " << "$t0" << ", " << "$t1" << endl; //value's address in $t2
}else{
output << "li " << "$t0" << ", " << src2->startAddress + index * 4 << endl;
}
//dst——type 1 0
if (dst->type ==0){
output << "lw " << "$t0" << ", 0($t0)" << endl;
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;
}else{
//采用地址传递 内容是地址
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;
// dst->type = 0;
}
}else{
if (src2->isGlobal){
output << "la " << "$t0" << ", " << src2->original_Name << endl;
}else{
output << "li " << "$t0" << ", " << src2->startAddress + index * 4 << endl;
}
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "sll " << "$t1" << ", " << "$t1" << ", 2" << endl;
output << "addu " << "$t0" << ", " << "$t0" << ", " << "$t1" << endl; //value's address in $t2
if (dst->type ==0){
output << "lw " << "$t0" << ", 0($t0)" << endl;
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;//此时dst_ptr的IEntry false 需要lw address 来使用
}else{
//t0地址
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;
// dst->type = 0;
}
}
}else{//不是normal 出现在自定义函数内部的引用数组 此时src2 会是startAddress offset_Entry
output<< "lw $t0,"<<src2->startAddress<<"($zero)"<<endl;
if (src1){
if (src1->canGetValue){
output<< "addu $t0,$t0,"<<src1->imm*4<<endl;
}else{
output<< "lw $t1,"<<src1->startAddress<<"($zero)"<<endl;
output << "sll $t1,$t1,2"<<endl;
output<< "addu $t0,$t0,$t1"<<endl;
}
}
if(dst->type == 0){
output<< "lw $t0,0($t0)"<<endl;
output<< "sw $t0,"<<dst->startAddress<<"($zero)"<<endl;
}else{
output<< "sw $t0,"<<dst->startAddress<<"($zero)"<<endl;
}
}
break;
}
//main函数中的return
case Return:{
output << "li $v0, 10" << endl;
output << "syscall " << endl;
break;
}
/**
* 将实参的 值 地址 按格式给形参 IN src1->valuesId 存储了对应的形参时生成的IEntry
*/
//TODO:函数的格式理解 sp 压栈~虚拟？ IEntry:has_return?
case FuncCall:
rParam_ids = src2->values_Id;//point to value
fParam_ids = src1->values_Id;//point to def
if (rParam_ids->size() != fParam_ids->size()) {
output << "error!!!! rParam_ids->size() = " << rParam_ids->size() << "fParam_ids->size() = " << fParam_ids->size() << "\n";
}
output << "#调用函数" << src1->original_Name << ":\n ";
for (int i = 0; i < rParam_ids->size();i++){
assign(IEntries.at(rParam_ids->at(i)), nullptr,IEntries.at(IEntries.at(fParam_ids->at(i))->values_Id->at(0)));
}
output << endl;
/**
* # Pushing Function Real Params:
addiu $sp, $sp, -30000
sw $ra, 0($sp)
# Call function!
jal Label_1
lw $ra, 0($sp)
# Pop params
addiu $sp, $sp, 30000
*/
//ra 在sp中压栈
output << "addiu $sp, $sp, -4\n";
output << "sw $ra, 0($sp)\n";
//call function
output << "jal " << "_" << src1->original_Name << endl;
//ra 出栈
output << "lw $ra, 0($sp)\n";
output << "addiu $sp, $sp, 4\n";
//函数返回值在v0中 要sw
// output << "sw " << "$v0" << ", " << src1->return_IEntry->startAddress << "($zero)" << endl;//src2 = IEntries.at(func->id)
if (dst != nullptr){
output << "sw " << "$v0" << ", " << dst->startAddress << "($zero)" << endl;//src2 = IEntries.at(func->id)
}
break;
/**
* 函数名标签 就是函数头的名字 形参的IEntry需要在中间代码就生成
* for (auto entry :entries) {
func->values_Id->push_back(entry->id);//传递的最终都是IEntry 值或地址！
}
*/
case FuncDef:
output << "_" << src1->original_Name << ":\n";//函数名标签
output << "#" << src1->original_Name << "部分: ";
for (auto id: *src1->values_Id) {
if(IEntries.at(id)->type == 0){
output << "value:@" << id << " ";
}else{
output << "address:@" << id << " ";
}
}
output << endl;
break;
/**
* 非全局变量的初始化定义
*/
case VAR_Def_Has_Value:
output << "#local_var_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def: " ;
if(IEntries.at(src1->values_Id->at(0))->canGetValue){
// src1->imm = IEntries.at(src1->values_Id->at(0))->imm;
// src1->canGetValue = true;
output << IEntries.at(src1->values_Id->at(0))->imm << " ";
}else{
// output << "";
// output << "lw " << "$t0" << ", " << (IEntries.at(src1->values_Id->at(0))->startAddress) << "($zero)" << endl;
// output << "sw " << "$t0" << ", " << (src1->startAddress) << "($zero)" << endl;
output << "@(" << src1->values_Id->at(0) << ")" << " ";
}
output << endl;
if(IEntries.at(src1->values_Id->at(0))->canGetValue){
output << "li " << "$t0" << ", " << IEntries.at(src1->values_Id->at(0))->imm << endl;
}else{
output << "lw " << "$t0" << ", " << IEntries.at(src1->values_Id->at(0))->startAddress << "($zero)" << endl;
}
output << "sw " << "$t0, " << IEntries.at(src1->values_Id->at(0))->startAddress << "($zero)" << endl;
break;
case VAR_Def_No_Value:
output << "#local_var_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "no_value_def\n " ;
break;
case ARRAY_VAR_Def_Has_Value:
output << "#local_array_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def: " ;
for (auto id_init_value:*(src1->values_Id)) {
if (IEntries.at(id_init_value)->canGetValue){
;//FIXME:编译时可以得出的值 以后要用就再按需取
output << IEntries.at(id_init_value)->imm << " ";
}else{
output << "@(" << id_init_value << ")" << " ";
;//FIXME:编译时不可以得出的值 说明运行后通过getint的变量间接得到值 以后要用就再按需lw sw取 初始值IEntry是有若干个IEntry组成的 可以进行canGetValue的判断
}
}
output << endl;
cnt = 0;
for (auto id_init_value:*(src1->values_Id)) {
if (IEntries.at(id_init_value)->canGetValue){ //认为数组内存是连续存储？
output << "li " << "$t0" << ", " << IEntries.at(id_init_value)->imm << endl;
}else{
output << "lw " << "$t0" << ", " << IEntries.at(id_init_value)->startAddress << "($zero)" << endl;
}
output << "sw " << "$t0, " << src1->startAddress + cnt * 4 << "($zero)" << endl;
cnt++;
}
break;
case ARRAY_Def_No_Value:
output << "#local_array_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def\n " ;
break;
case Const_Def_Has_Value:
output << "#const_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def: " ;
for (auto init_id:*(src1->values_Id)) {
output << IEntries.at(init_id)->imm << " ";
}
cnt = 0;
output << endl;
for (auto id_init_value:*(src1->values_Id)) {
if (IEntries.at(id_init_value)->canGetValue){ //认为数组内存是连续存储？
output << "li " << "$t0" << ", " << IEntries.at(id_init_value)->imm << endl;
}else{
output << "lw " << "$t0" << ", " << IEntries.at(id_init_value)->startAddress << "($zero)" << endl;
}
output << "sw " << "$t0, " << src1->startAddress + cnt * 4 << "($zero)" << endl;
cnt++;
}
break;
case ARRAY_CONST_Def_Has_Value:
output << "#array_const@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "def " ;
for (auto init_id:*(src1->values_Id)) {
output << IEntries.at(init_id)->imm << " ";
}
output << endl;
break;
default:
break;
}
}
/**
* 输出其他函数的代码ICode
*/
output << "#自定义函数的代码ICode\n";
for (const auto& func_codes:otherFuncICodes) {
// output << "_" << func_codes.first << ":\n"; 第一行总是函数的定义头
for (auto ICode: func_codes.second) {
IntermediateCodeType type = ICode->type;
IEntry *src1 = ICode->src1;
IEntry *src2 = ICode->src2;
IEntry *dst = ICode->dst;
IEntry **dst_ptr = &dst;
int cnt_param;//for printf_exp
int cnt = 0;//for def sw address
vector<int> *rParam_ids;
vector<int> *fParam_ids;
switch (type) {
case Printf:
output << "#printf语句:" << src2->values_Id->size() << "个exp参数\n";
cnt_param = 0;
for (auto id: *src1->strings_iEntry_id) {
/**
la $a0, str_1
li $v0, 4
syscall
lw $a0, 268501012($zero)
li $v0, 1
syscall
*/
if (IEntries.at(id)->str == "%d") {//lw li 1 syscall
IEntry *p = IEntries.at(src2->values_Id->at(cnt_param++));
// IEntry * p_val = IEntries.at(p->values_Id->at(0));//VALUE!!!
IEntry *p_val = p;
if (p_val->canGetValue) {
output << "li $a0, " << p_val->imm << endl;
} else {
output << "lw $a0, " << p_val->startAddress << "($zero)" << endl;
}
output << "li $v0, 1" << endl;
output << "syscall" << endl;
} else {
//la li 4 syscall
output << "la $a0, " << "str_" << id << endl;
output << "li $v0, 4" << endl;
output << "syscall" << endl;
}
}
break;
case Add: {
if (src1->canGetValue && src2->canGetValue) {
dst->canGetValue = true;
dst->imm = src1->imm + src2->imm;
} else {
if (src1->canGetValue) {
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "addu " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else if (src2->canGetValue) {
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "addu " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else {
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "addu " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
case Sub: {
if (src1->canGetValue && src2->canGetValue) {
dst->canGetValue = true;
dst->imm = src1->imm - src2->imm;
} else {
if (src1->canGetValue) {
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "sub " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else if (src2->canGetValue) {
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "sub " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else {
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "sub " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
case Mult: {
if (src1->canGetValue && src2->canGetValue) {
dst->canGetValue = true;
dst->imm = src1->imm * src2->imm;
} else {
if (src1->canGetValue) {
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "mul " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else if (src2->canGetValue) {
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "mul " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else {
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "mul " << "$t2" << ", " << "$t0" << ", " << "$t1" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
//除法：HI存放余数，LO存放除法结果
case Div: {
output << "#执行div：\n";
if (src1->canGetValue && src2->canGetValue) {
dst->canGetValue = true;
dst->imm = src1->imm / src2->imm;
} else {
if (src1->canGetValue) {
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mflo " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else if (src2->canGetValue) {
output << "li " << "$t0" << ", " << src2->imm << endl;
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "div " << "$t1" << ", " << "$t0" << endl;
output << "mflo " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else {
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mflo " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
//TODO:优化
case Mod: {
if (src1->canGetValue && src2->canGetValue) {
dst->canGetValue = true;
dst->imm = src1->imm % src2->imm;
} else {
if (src1->canGetValue) {
output << "li " << "$t0" << ", " << src1->imm << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mfhi " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else if (src2->canGetValue) {
output << "li " << "$t1" << ", " << src2->imm << endl;
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mfhi " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
} else {
output << "lw " << "$t0" << ", " << src1->startAddress << "($zero)" << endl;
output << "lw " << "$t1" << ", " << src2->startAddress << "($zero)" << endl;
output << "div " << "$t0" << ", " << "$t1" << endl;
output << "mfhi " << "$t2" << endl;
output << "sw " << "$t2" << ", " << dst->startAddress << "($zero)" << endl;
}
}
}
break;
//FIXME:一定是地址？
case Assign:
assign(src1, nullptr, dst);
break;
//FIXME:总是容易陷入误区 得到v0的值已经是运行时 编译的极限块也做不到预知~
case GetInt:
output << "#getint:\n";
output << "li $v0, 5\n";
output << "syscall\n";
if (dst->type == 2){
output << "lw " << "$t0" << ", " << dst->startAddress << "($zero)" << endl;
output << "sw " << "$v0" << ", " << "0($t0)" << endl;
}else{
output << "sw " << "$v0" << ", " << dst->startAddress << "($zero)" << endl;//基本不会再被用到了？
}
dst->canGetValue = false;
break;
case GetAddress:{
output<< "#GetTheAddress sw in dst 's address\n";
if (src2->type == 1){
output<< "lw $t0,"<<IEntries.at(src2->values_Id->at(0))->startAddress<<"($zero)"<<endl;
}else{
if (src2->isGlobal){
output<< "la $t0,"<<src2->original_Name<<endl;
}else{
output<< "li $t0,"<<src2->startAddress<<endl;
}
}
if (src1){
if (src1->canGetValue){
output<< "addu $t0,$t0,"<<src1->imm*4<<endl;
}else{
output<< "lw, $t1,"<<src1->startAddress<<"($zero)"<<endl;
output << "sll $t1,$t1,2"<<endl;
output<< "addu $t0,$t0,$t1"<<endl;
}
}
output<< "sw $t0,"<<dst->startAddress<<"($zero)"<<endl;
break;
}
//TODO：检查格式统一 全都是IEntry格式 可以进行一个canGetElement的优化
case GetArrayElement:{//FIXME:数组元素的get需要找到元素地址！！！ 即本身 而不是值的副本 又或者说成是让定义的数组记住它！！
output << "#GetArray Element\n";
int index = 0;
int isNormalArray = src2->type;
if (isNormalArray == 0){//表示array并不是通过函数传递地址而来 即offsetEntry没用 或者认为就是0 即index就是最终索引 s7存放数组元素地址
if (src1->canGetValue){
index += src1->imm;
if (src2->isGlobal){
output << "la " << "$t0" << ", " << src2->original_Name << endl;
output << "li " << "$t1" << ", " << index * 4 << endl;
output << "addu " << "$t0" << ", " << "$t0" << ", " << "$t1" << endl; //value's address in $t2
}else{
output << "li " << "$t0" << ", " << src2->startAddress + index * 4 << endl;
}
//dst——type 1 0
if (dst->type ==0){
output << "lw " << "$t0" << ", 0($t0)" << endl;
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;
}else{
//采用地址传递 内容是地址
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;
// dst->type = 0;
}
}else{
if (src2->isGlobal){
output << "la " << "$t0" << ", " << src2->original_Name << endl;
}else{
output << "li " << "$t0" << ", " << src2->startAddress + index * 4 << endl;
}
output << "lw " << "$t1" << ", " << src1->startAddress << "($zero)" << endl;
output << "sll " << "$t1" << ", " << "$t1" << ", 2" << endl;
output << "addu " << "$t0" << ", " << "$t0" << ", " << "$t1" << endl; //value's address in $t2
if (dst->type ==0){
output << "lw " << "$t0" << ", 0($t0)" << endl;
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;//此时dst_ptr的IEntry false 需要lw address 来使用
}else{
//t0地址
output << "sw " << "$t0, " << dst->startAddress << "($zero)" << endl;
// dst->type = 0;
}
}
}else{//不是normal 出现在自定义函数内部的引用数组 此时src2 会是startAddress offset_Entry
output<< "lw $t0,"<<src2->startAddress<<"($zero)"<<endl;
if (src1){
if (src1->canGetValue){
output<< "addu $t0,$t0,"<<src1->imm*4<<endl;
}else{
output<< "lw $t1,"<<src1->startAddress<<"($zero)"<<endl;
output << "sll $t1,$t1,2"<<endl;
output<< "addu $t0,$t0,$t1"<<endl;
}
}
if(dst->type == 0){
output<< "lw $t0,0($t0)"<<endl;
output<< "sw $t0,"<<dst->startAddress<<"($zero)"<<endl;
}else{
output<< "sw $t0,"<<dst->startAddress<<"($zero)"<<endl;
}
}
break;
}
case Return: {
if (src1 != nullptr) {
if (src1->canGetValue) {
output << "li " << "$v0" << ", " << src1->imm << endl;
} else {
output << "lw " << "$v0" << ", " << src1->startAddress << "($zero)" << endl;
}
}
output << "jr " << "$ra" << endl;
break;
}
/**
* 将实参的 值 地址 按格式给形参 IN src1->valuesId 存储了对应的形参时生成的IEntry
*/
//TODO:函数的格式理解 sp 压栈~虚拟？ IEntry:has_return?
case FuncCall:
rParam_ids = src2->values_Id;
fParam_ids = src1->values_Id;
if (rParam_ids->size() != fParam_ids->size()) {
output << "error!!!! rParam_ids->size() = " << rParam_ids->size() << "fParam_ids->size() = " << fParam_ids->size() << "\n";
}
output << "#调用函数" << src1->original_Name << ": \n";
for (int i = 0; i < rParam_ids->size(); i++) {
assign(IEntries.at(rParam_ids->at(i)), nullptr,
IEntries.at(IEntries.at(fParam_ids->at(i))->values_Id->at(0)));
}
output << endl;
/**
* # Pushing Function Real Params:
addiu $sp, $sp, -30000
sw $ra, 0($sp)
# Call function!
jal Label_1
lw $ra, 0($sp)
# Pop params
addiu $sp, $sp, 30000
*/
//ra 在sp中压栈
output << "addiu $sp, $sp, -4\n";
output << "sw $ra, 0($sp)\n";
//call function
output << "jal " << "_" << src1->original_Name << endl;
//ra 出栈
output << "lw $ra, 0($sp)\n";
output << "addiu $sp, $sp, 4\n";
//函数返回值在v0中 要sw 其实这里的sw v0 to somewhere 没有用
// output << "sw " << "$v0" << ", " << src1->return_IEntry->startAddress << "($zero)"<< endl;//src2 = IEntries.at(func->id)
if (dst != nullptr){
output << "sw " << "$v0" << ", " << dst->startAddress << "($zero)" << endl;//src2 = IEntries.at(func->id)
}
break;
/**
* 函数名标签 就是函数头的名字 形参的IEntry需要在中间代码就生成
* for (auto entry :entries) {
func->values_Id->push_back(entry->id);//传递的最终都是IEntry 值或地址！
}
*/
case FuncDef:
output << "_" << src1->original_Name << ":\n";//函数名标签
output << "#" << src1->original_Name << "部分: ";
for (auto id: *src1->values_Id) {
if (IEntries.at(id)->type == 0) {
output << "value:@" << id << " ";
} else {
output << "address:@" << id << " ";
}
}
output << endl;
break;
/**
* 非全局变量的初始化定义
*/
case VAR_Def_Has_Value:
output << "#local_var_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def: ";
if (IEntries.at(src1->values_Id->at(0))->canGetValue) {
// src1->imm = IEntries.at(src1->values_Id->at(0))->imm;
// src1->canGetValue = true;
output << IEntries.at(src1->values_Id->at(0))->imm << " ";
} else {
// output << "";
// output << "lw " << "$t0" << ", " << (IEntries.at(src1->values_Id->at(0))->startAddress) << "($zero)" << endl;
// output << "sw " << "$t0" << ", " << (src1->startAddress) << "($zero)" << endl;
output << "@(" << src1->values_Id->at(0) << ")" << " ";
}
output << endl;
if (IEntries.at(src1->values_Id->at(0))->canGetValue) {
output << "li " << "$t0" << ", " << IEntries.at(src1->values_Id->at(0))->imm << endl;
} else {
output << "lw " << "$t0" << ", " << IEntries.at(src1->values_Id->at(0))->startAddress
<< "($zero)" << endl;
}
output << "sw " << "$t0, " << IEntries.at(src1->values_Id->at(0))->startAddress << "($zero)" << endl;
break;
case VAR_Def_No_Value:
output << "#local_var_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name
<< "no_value_def\n ";
break;
case ARRAY_VAR_Def_Has_Value:
output << "#local_array_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def: ";
for (auto id_init_value: *(src1->values_Id)) {
if (IEntries.at(id_init_value)->canGetValue) { ;//FIXME:编译时可以得出的值 以后要用就再按需取
output << IEntries.at(id_init_value)->imm << " ";
} else {
output << "@(" << id_init_value << ")"
<< " ";;//FIXME:编译时不可以得出的值 说明运行后通过getint的变量间接得到值 以后要用就再按需lw sw取 初始值IEntry是有若干个IEntry组成的 可以进行canGetValue的判断
}
}
output << endl;
cnt = 0;
for (auto id_init_value: *(src1->values_Id)) {
if (IEntries.at(id_init_value)->canGetValue) { //认为数组内存是连续存储？
output << "li " << "$t0" << ", " << IEntries.at(id_init_value)->imm << endl;
} else {
output << "lw " << "$t0" << ", " << IEntries.at(id_init_value)->startAddress << "($zero)"
<< endl;
}
output << "sw " << "$t0, " << src1->startAddress + cnt * 4 << "($zero)" << endl;
cnt++;
}
break;
case ARRAY_Def_No_Value:
output << "#local_array_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def\n ";
break;
case Const_Def_Has_Value:
output << "#const_@" + to_string(ICode->src1->Id) << "_" + src1->original_Name << "_def: ";
for (auto init_value: *(src1->values)) {
output << init_value << " ";
}
output << endl;
cnt = 0;