-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsimulartor.cpp
More file actions
826 lines (783 loc) · 21.2 KB
/
Copy pathsimulartor.cpp
File metadata and controls
826 lines (783 loc) · 21.2 KB
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
//
// Created by zfq on 2021/3/8.
//
#include "simulartor.h"
#include <stdio.h>
#include <stdlib.h>
long long reg[37];
void parser(int vm[],ifstream &infile, string outfile){
///initialize register list
for (long long & i : reg){
i=0;
}
///pc points to current text
int pc=0;
///gp points to static data area
int gp=0x500000;
///sp points to the end of dynamic memory
int sp=0xa00000;
reg[28]=gp;
reg[29]=sp;
///register reserved for ll/sc
reg[35]=0;
reg[36]=0;
while(vm[pc]!=0){
string instruct=bitset<32>(vm[pc]).to_string();
if(instruct.substr(0,6)=="000000"){
pc=r_type_parser(instruct,pc,infile,outfile,vm);
}
else if(instruct.substr(0,6)=="011100"){
pc=rsp_type_parser(instruct,pc,vm);
}
else if(instruct.substr(0,5)=="00001"){
pc=j_type_parser(instruct,pc);
}
else{
pc=i_type_parser(instruct,pc,vm);
}
pc++;
}
}
int r_type_parser(const string& instruct,int pc,ifstream &infile, string outfile,int* vm){
int rs=bitset<5>(instruct.substr(6,5)).to_ulong();
int rt=bitset<5>(instruct.substr(11,5)).to_ulong();
int rd=bitset<5>(instruct.substr(16,5)).to_ulong();
int shamt=bitset<5>(instruct.substr(21,5)).to_ulong();
int funct=bitset<6>(instruct.substr(26,6)).to_ulong();
bool flag= false;
int a0,a1,b0,b1,hi,lo,temp;
switch (funct) {
case 0:
///sll
reg[rd]=reg[rt]<<shamt;
break;
case 2:
///srl
reg[rd]=reg[rt]>>shamt;
break;
case 3:
///sra
reg[rd]= ((unsigned int) reg[rt]) >> shamt;
break;
case 4:
///sllv
reg[rd]=reg[rt]<<reg[rs];
break;
case 6:
///srlv
reg[rd]=reg[rt]>>reg[rs];
break;
case 7:
///srav
reg[rd]= ((unsigned int) reg[rt]) >>reg[rs];
break;
case 8:
///jr
pc=reg[rs]-1;
break;
case 9:
///jalr
reg[rd]=pc;
pc=reg[rs]-1;
break;
case 12:
///syscall
syscall(reg[2],infile,outfile,vm);
break;
case 13:
///break
cerr<<"Error in line 8: Runtime exception at 0x00400010: break instruction executed; no code given.";
throw runtime_error("break instruct exectted");
case 16:
///mfhi
reg[rd]=reg[33];
break;
case 17:
///mthi
reg[33]=reg[rs];
break;
case 18:
///mflo
reg[rd]=reg[34];
break;
case 19:
///mtlo
reg[34]=reg[rs];
break;
case 24:
///mult
flag=((rs/rt)<0||(rt/rs)<0);
rs=abs(reg[rs]);
rt=abs(reg[rt]);
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
hi=a1*b1+((a1*b0+b1*a0)>>16);
lo=((a1*b0+b1*a0)<<16)+a0*b0;
if(flag){
hi=0xffffffff-hi+1;
lo=0xffffffff-lo+1;
}
reg[33]=hi;
reg[34]=lo;
break;
case 25:
///multu
rs=reg[rs];
rt=reg[rt];
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
hi=a1*b1+((a1*b0+b1*a0)>>16);
lo=((a1*b0+b1*a0)<<16)+a0*b0;
reg[33]=hi;
reg[34]=lo;
break;
case 26:
///div
hi=reg[rs]/reg[rt];
lo=reg[rs]%reg[rt];
reg[33]=hi;
reg[34]=lo;
break;
case 27:
///divu
hi=(unsigned int)(reg[rs]/reg[rt]);
lo=(unsigned int)(reg[rs]%reg[rt]);
reg[33]=hi;
reg[34]=lo;
break;
case 32:
///add
try{
a0=reg[rs];
a1=reg[rt];
temp=a0+a1;
if(signbit(a0)==signbit(a1)){
if(signbit(a0)!=signbit(temp)){
throw overflow_error("IntegerOverflow");
}
}
reg[rd]=temp;
break;
}catch (overflow_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
case 33:
///addu
a0=reg[rs];
a1=reg[rt];
reg[rd]=a0+a1;
break;
case 34:
///sub
try{
a0=reg[rs];
a1=reg[rt];
temp=a0-a1;
if(signbit(a0)==signbit(a1)){
if(signbit(a0)!=signbit(temp)){
throw overflow_error("IntegerOverflow");
}
}
reg[rd]=temp;
break;
}catch (overflow_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
case 35:
///subu
a0=reg[rs];
a1=reg[rt];
reg[rd]=a0-a1;
break;
case 36:
///and
reg[rd]=reg[rs] bitand reg[rt];
break;
case 37:
///or
reg[rd]=reg[rs] bitor reg[rt];
break;
case 38:
///xor
reg[rd]=reg[rs] ^ reg[rt];
break;
case 39:
///nor
reg[rd]=~(reg[rs] bitor reg[rt]);
break;
case 42:
///slt
reg[rd]=(reg[rs]<reg[rt]);
break;
case 43:
///sltu
reg[rd]=((unsigned int)reg[rs]<(unsigned int)reg[rt]);
break;
case 48:
///tge
try{
a0=reg[rs];
a1=reg[rt];
if(a0>=a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
case 49:
/// tgeu
try{
a0=reg[rs];
a1=reg[rt];
if((unsigned int)a0>=(unsigned int)a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
case 50:
///tlt
try{
a0=reg[rs];
a1=reg[rt];
if(a0<a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
case 51:
///tltu
try{
a0=reg[rs];
a1=reg[rt];
if((unsigned int)a0<(unsigned int)a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
case 52:
///teq
try{
a0=reg[rs];
a1=reg[rt];
if(a0==a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
case 53:
///tequ
try{
a0=reg[rs];
a1=reg[rt];
if((unsigned int)a0==(unsigned int)a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
case 54:
///tne
try{
a0=reg[rs];
a1=reg[rt];
if(a0!=a1){
throw runtime_error("trap");
}
}catch (runtime_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
break;
default:
cout<<"wtf?"<<endl;
break;
}
return pc;
}
void syscall(int i,ifstream &infile,string outfile,int*vm){
string string1;
FILE* f;
unsigned char temp;
char* src, *c,*buffer= nullptr;
int fd,sz,size;
int* a,x,count=0;
stringstream ss;
switch (i) {
case 1:
//print int
a=(int*)reg[4];
f=fopen(outfile.c_str(), "a+");
fprintf(f,"%d",a);
fclose(f);
cout<<a<<endl;
break;
case 4:
//print string
src=(char*)to_real_address(reg[4],vm);
f=fopen(outfile.c_str(), "a+");
do{
memcpy(&temp,src,1);
ss<<temp;
src++;
count++;
}while(temp!=0);
getline(ss,string1,'\0');
fprintf(f,"%s",string1.c_str());
fclose(f);
cout<<string1<<endl;
break;
case 5:
//read int
getline(infile,string1);
reg[2]=stoi(string1);
break;
case 8:
//read string
getline(infile,string1);
c= const_cast<char *>(string1.c_str());
src=(char*)to_real_address(reg[4],vm);
memcpy(c,src,reg[5]);
break;
case 9:
//sbrk
reg[2]=0x600000;
break;
case 10:
//exit
exit(0);
case 11:
//print char
f=fopen(outfile.c_str(), "a+");
c=(char*)reg[4];
memcpy(&temp,c,1);
ss<<temp;
ss>>string1;
fprintf(f,"%s",string1.c_str());
fclose(f);
cout<<(char)reg[4];
break;
case 12:
//read char
getline(infile,string1);
c= const_cast<char *>(string1.c_str());
src=(char*)to_real_address(reg[4],vm);
memcpy(c,src,1);
break;
case 13:
c= const_cast<char *>(string1.c_str());
src=(char*)to_real_address(reg[4],vm);
do {
memcpy(c, src, 1);
ss<<c;
src++;
} while (c!=0);
ss>>string1;
if(reg[6]==0){
fd=open(string1.c_str(), O_RDONLY|O_CREAT, "r");
}else{
fd=open(string1.c_str(), O_WRONLY, "w");
}
reg[2]=fd;
break;
case 14:
fd=reg[4];
buffer=(char*)to_real_address(reg[5],vm);
size=reg[6];
sz= read(fd,buffer,size);
reg[2]=sz;
break;
case 15:
fd=reg[4];
buffer=(char*)to_real_address(reg[5],vm);
size=reg[6];
sz= write(fd,buffer,size);
reg[2]=sz;
break;
case 16:
fd=reg[4];
close(fd);
break;
case 17:
exit(reg[4]);
default:
break;
}
}
int rsp_type_parser(const string &instruct,int pc,int vm[]){
int rs=bitset<5>(instruct.substr(6,5)).to_ulong();
int rt=bitset<5>(instruct.substr(11,5)).to_ulong();
int rd=bitset<5>(instruct.substr(16,5)).to_ulong();
int funct=bitset<6>(instruct.substr(26,6)).to_ulong();
int a0,a1,b0,b1,hi,lo,temp;
bool flag;
switch (funct) {
case 0:
///madd
flag=((rs/rt)<0||(rt/rs)<0);
rs=abs(reg[rs]);
rt=abs(reg[rt]);
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
hi=a1*b1+((a1*b0+b1*a0)>>16);
lo=((a1*b0+b1*a0)<<16)+a0*b0;
if(flag){
hi=0xffffffff-hi+1;
lo=0xffffffff-lo+1;
}
reg[33]=reg[33]+hi;
reg[34]=reg[34]+lo;
break;
case 1:
///maddu
rs=reg[rs];
rt=reg[rt];
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
hi=a1*b1+((a1*b0+b1*a0)>>16);
lo=((a1*b0+b1*a0)<<16)+a0*b0;
reg[33]=reg[33]+hi;
reg[34]=reg[34]+lo;
break;
case 2:
///mul
rs=reg[rs];
rt=reg[rt];
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
lo=((a1*b0+b1*a0)<<16)+a0*b0;
reg[rd]=lo;
break;
case 4:
///msub
flag=((rs/rt)<0||(rt/rs)<0);
rs=abs(reg[rs]);
rt=abs(reg[rt]);
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
hi=a1*b1+((a1*b0+b1*a0)>>16);
lo=((a1*b0+b1*a0)<<16)+a0*b0;
if(flag){
hi=0xffffffff-hi+1;
lo=0xffffffff-lo+1;
}
reg[33]=reg[33]-hi;
reg[34]=reg[34]-lo;
break;
case 5:
///msubu
rs=reg[rs];
rt=reg[rt];
a0=bitset<16>(rs).to_ulong();
a1=bitset<16>(rs>>16).to_ulong();
b0=bitset<16>(rt).to_ulong();
b1=bitset<16>(rt>>16).to_ulong();
hi=a1*b1+((a1*b0+b1*a0)>>16);
lo=((a1*b0+b1*a0)<<16)+a0*b0;
reg[33]=reg[33]-hi;
reg[34]=reg[34]-lo;
break;
case 33:
///clo
temp=reg[rs];
for (int i=0;i<32;i++){
if(bitset<32>(temp).to_string().at(i)=='0'){
reg[rd]=i;
break;
}
}
break;
case 34:
///clz
temp=reg[rs];
for (int i=0;i<32;i++){
if(bitset<32>(temp).to_string().at(i)=='1'){
reg[rd]=i;
break;
}
}
break;
default:
break;
}
return pc;
}
int i_type_parser(const string &instruct,int pc,int* vm){
int rs=bitset<5>(instruct.substr(6,5)).to_ulong();
int rt=bitset<5>(instruct.substr(11,5)).to_ulong();
int opcode=bitset<6>(instruct.substr(0,6)).to_ulong();
int offset=bitset<16>(instruct.substr(16,16)).to_ulong();
int temp;
char* tmp;
switch (opcode) {
case 1:
if(rt==0){
///bltz
if(reg[rs]<0){
pc+=offset;
break;
}
}else if(rt==1){
///bgez
if(reg[rs]>=0){
pc+=offset;
break;
}
}
break;
case 4:
///beq
if(reg[rs]==reg[rt]){
pc+=sign_extend(offset);
}
break;
case 5:
///bne
if(reg[rs]!=reg[rt]){
pc+=sign_extend(offset);
}
break;
case 6:
///blez
if(reg[rs]<=0){
pc+=sign_extend(offset);
}
break;
case 7:
///
if(reg[rs]>0){
pc+=sign_extend(offset);
}
break;
case 8:
///addi
try{
offset=sign_extend(offset);
temp=reg[rs]+offset;
if(signbit(reg[rs])==signbit(offset)){
if(signbit(reg[rs])!=signbit(temp)){
throw overflow_error("IntegerOverflow");
}
}
reg[rt]=temp;
break;
}catch (overflow_error &e){
cerr<<e.what()<<endl;
exit(-1);
}
case 9:
///addiu
reg[rt]=reg[rs]+offset;
break;
case 10:
///slti
if (reg[rs]<offset){
reg[rt]=1;
}else{
reg[rt]=0;
}
break;
case 11:
///sltiu
if (reg[rs]<(unsigned int)offset){
reg[rt]=1;
}else{
reg[rt]=0;
}
break;
case 12:
///andi
reg[rt]=(reg[rs] bitand offset);
break;
case 13:
///ori
reg[rt]=(reg[rs] bitor offset);
break;
case 14:
///xori
reg[rt]=(reg[rs]^offset);
break;
case 15:
///lui
reg[rt]=(offset<<16);
break;
case 32:
///lb
tmp=(char*)to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(®[rt],tmp,1);
if (reg[rt]>>7==1){
reg[rt]=0xffffff00 bitor reg[rt];
}
break;
case 33:
///lh
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(®[rt],tmp,2);
if (reg[rt]>>15==1){
reg[rt]=0xffffff00 bitor reg[rt];
}
break;
case 35:
///lw
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(®[rt],tmp,4);
break;
case 36:
///lbu
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(®[rt],tmp,1);
break;
case 37:
///lhu
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(®[rt],tmp,2);
break;
case 40:
///sb
tmp=(char*)to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(tmp,®[rt],1);
break;
case 41:
///sh
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=offset;
memcpy(tmp,®[rt],2);
break;
case 42:
///swl
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=4*(offset/4);
check_ll(tmp);
memcpy(tmp,®[rt],offset%4+1);
break;
case 43:
///sw
tmp=(char*)to_real_address(reg[rs],vm);
tmp+=offset;
check_ll(tmp);
memcpy(tmp,®[rt],4);
break;
case 46:
///swr
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=4*(offset/4);
check_ll(tmp);
memcpy(tmp,®[rt],4);
*tmp=*tmp<<(8*(offset%4));
break;
case 48:
///ll
if(!LL){
LL= true;
tmp=(char*)to_real_address(reg[rs],vm);
tmp+=offset;
memcpy(®[rt],tmp,4);
reg[35]=(unsigned long)tmp;
break;
}
break;
case 56:
///sc
if(LL){
tmp=(char*)to_real_address(reg[rs],vm);
tmp+=offset;
memcpy(tmp,®[rt],4);
reg[rt]=1;
LL= false;
}else{
reg[rt]=0;
}
break;
case 50:
///lwl
tmp=(char*) to_real_address(reg[rs],vm);
tmp+=4*(offset/4);
check_ll(tmp);
memcpy(®[rt],tmp,offset%4+1);
break;
case 51:
///lwr
tmp=(char*) to_real_address(reg[rs],vm);
check_ll(tmp);
tmp+=4*(offset/4);
memcpy(®[rt],tmp,4);
*tmp=*tmp<<(8*(offset%4));
break;
}
return pc;
}
void check_ll(void* x){
if((unsigned long) x==reg[35]){
LL= false;
}
}
int j_type_parser(const string &instruct,int pc){
int opcode=bitset<6>(instruct.substr(0,6)).to_ulong();
int jump=bitset<26>(instruct.substr(6,26)).to_ulong();
switch (opcode) {
case 2:
///j
pc=jump-1;
break;
case 3:
///jal
reg[31]=pc+1;
pc=jump-1;
break;
default:
break;
}
return pc;
}
void* to_real_address(int v_add,int* vm){
void* ptr= (void *) ((ulong) (&vm[0]) +v_add-0x400000);
return ptr;
}
long sign_extend(int a){
if(a>>15==0){
return (0xffffffff bitand a);
}else{
return (0xffff0000 bitor a);
}
}