/
cpu.rs
865 lines (840 loc) · 39.5 KB
/
cpu.rs
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
pub const REGISTERS_COUNT: usize = 32;
use std::cmp;
use std::num::FpCategory;
use std::process::exit;
use num_bigint::{BigInt, BigUint};
use num_traits::cast::ToPrimitive;
use crate::*;
pub struct Cpu {
pub xregs: [i64; REGISTERS_COUNT],
pub fregs: [f64; REGISTERS_COUNT],
pub pc: usize,
/*
* 31 8 7 5 4 0
* | Reserved | Rounding Mode (frm) | Accrued Exceptions (fflags) |
* | NV | DZ | OF | UF | NX |
* 24 3 1 1 1 1 1
*/
pub fcsr: u32,
}
fn set_memory8(index: usize, mem: &mut Vec<u8>, val: u8) {
mem[index] = val
}
fn set_memory16(index: usize, mem: &mut Vec<u8>, val: u16) {
mem[index] = (val & 0xFF) as u8;
mem[index + 1] = ((val & 0xFF00) >> 8) as u8;
}
fn set_memory32(index: usize, mem: &mut Vec<u8>, val: u32) {
mem[index] = (val & 0xFF) as u8;
mem[index + 1] = ((val & 0xFF00) >> 8) as u8;
mem[index + 2] = ((val & 0xFF0000) >> 16) as u8;
mem[index + 3] = ((val & 0xFF000000) >> 24) as u8;
}
fn set_memory64(index: usize, mem: &mut Vec<u8>, val: u64) {
mem[index] = (val & 0xFF) as u8;
mem[index + 1] = ((val & 0xFF00) >> 8) as u8;
mem[index + 2] = ((val & 0xFF0000) >> 16) as u8;
mem[index + 3] = ((val & 0xFF000000) >> 24) as u8;
mem[index + 4] = ((val & 0xFF00000000) >> 32) as u8;
mem[index + 5] = ((val & 0xFF0000000000) >> 40) as u8;
mem[index + 6] = ((val & 0xFF000000000000) >> 48) as u8;
mem[index + 7] = ((val & 0xFF00000000000000) >> 56) as u8;
}
fn get_memory8(index: usize, mem: &Vec<u8>) -> u8 {
mem[index]
}
fn get_memory16(index: usize, mem: &Vec<u8>) -> u16 {
// little endian
return (mem[index] as u16) | ((mem[index + 1] as u16) << 8);
}
fn get_memory32(index: usize, mem: &Vec<u8>) -> u32 {
// little endian
return (mem[index] as u32)
| ((mem[index + 1] as u32) << 8)
| ((mem[index + 2] as u32) << 16)
| ((mem[index + 3] as u32) << 24);
}
fn get_memory64(index: usize, mem: &Vec<u8>) -> u64 {
// little endian
return (mem[index] as u64)
| ((mem[index + 1] as u64) << 8)
| ((mem[index + 2] as u64) << 16)
| ((mem[index + 3] as u64) << 24)
| ((mem[index + 4] as u64) << 32)
| ((mem[index + 5] as u64) << 40)
| ((mem[index + 6] as u64) << 48)
| ((mem[index + 7] as u64) << 56);
}
impl Cpu {
pub fn new() -> Cpu {
Cpu {
xregs: [0; REGISTERS_COUNT],
fregs: [0.0; REGISTERS_COUNT],
pc: 0,
fcsr: 0,
}
}
pub fn reset(&mut self) {
self.pc = 0;
self.fcsr = 0;
for i in 0..REGISTERS_COUNT {
self.xregs[i] = 0;
self.fregs[i] = 0.0;
}
}
pub fn start(&mut self, mem: &mut Vec<u8>) {
let size = mem.len();
let mut i = 0;
while self.pc < size {
let binary = self.fetch(mem);
self.execute(binary, mem);
self.pc += 4;
// TODO: Remove the following check.
// This is for avoiding an infinite execution.
i += 1;
if i > 1000 {
exit(1);
}
}
}
fn fetch(&mut self, mem: &Vec<u8>) -> u32 {
get_memory32(self.pc, mem)
}
// This function is public because it's called from a unit test.
pub fn execute(&mut self, binary: u32, mem: &mut Vec<u8>) {
let opcode = binary & 0x0000007F;
let rd = ((binary & 0x00000F80) >> 7) as usize;
let rs1 = ((binary & 0x000F8000) >> 15) as usize;
let rs2 = ((binary & 0x01F00000) >> 20) as usize;
let funct3 = (binary & 0x00007000) >> 12;
let funct7 = (binary & 0xFE000000) >> 25;
let xregs = &mut self.xregs;
let fregs = &mut self.fregs;
log(&format!(
"execute pc: {} ({:#x}), opcode: {} ({:#x}, {:#b}), binary: {:#x}",
self.pc, self.pc, opcode, opcode, opcode, binary
));
match opcode {
0x03 => {
// I-type
let offset = (((binary & 0xFFF00000) as i32) as i64) >> 20;
let addr = (xregs[rs1] + offset) as usize;
match funct3 {
0x0 => xregs[rd] = (get_memory8(addr, mem) as i8) as i64, // lb
0x1 => xregs[rd] = (get_memory16(addr, mem) as i16) as i64, // lh
0x2 => xregs[rd] = (get_memory32(addr, mem) as i32) as i64, // lw
0x3 => xregs[rd] = get_memory64(addr, mem) as i64, // ld
0x4 => xregs[rd] = (get_memory8(addr, mem) as i64) & 0xFF, // lbu
0x5 => xregs[rd] = (get_memory16(addr, mem) as i64) & 0xFFFF, // lhu
0x6 => xregs[rd] = (get_memory32(addr, mem) as i64) & 0xFFFFFFFF, // lwu
_ => {}
}
}
0x07 => {
// I-type (RV32F and RV64F)
let offset = (((binary & 0xFFF00000) as i32) as i64) >> 20;
let addr = (xregs[rs1] + offset) as usize;
match funct3 {
0x2 => fregs[rd] = f64::from_bits(get_memory32(addr, mem) as u64), // flw
0x3 => fregs[rd] = f64::from_bits(get_memory64(addr, mem)), // fld
_ => {}
}
}
0x0F => {
// I-type
// fence instructions are not supportted yet because this emulator executes a
// binary sequentially on a single thread.
// fence i is a part of the Zifencei extension.
match funct3 {
0x0 => {} // fence
0x1 => {} // fence.i
_ => {}
}
}
0x13 => {
// I-type
let imm = (((binary & 0xFFF00000) as i32) as i64) >> 20;
// shamt size is 5 bits for RV32I and 6 bits for RV64I.
// let shamt = (binary & 0x01F00000) >> 20; // This is for RV32I
let shamt = (binary & 0x03F00000) >> 20;
let funct6 = funct7 >> 1;
match funct3 {
0x0 => xregs[rd] = xregs[rs1].wrapping_add(imm), // addi
0x1 => xregs[rd] = ((xregs[rs1] as u64) << shamt) as i64, // slli
0x2 => xregs[rd] = if xregs[rs1] < imm { 1 } else { 0 }, // slti
0x3 => {
xregs[rd] = if (xregs[rs1] as u64) < (imm as u64) {
1
} else {
0
}
} // sltiu
0x4 => xregs[rd] = xregs[rs1] ^ imm, // xori
0x5 => {
match funct6 {
0x00 => xregs[rd] = ((xregs[rs1] as u64) >> shamt) as i64, // srli
0x10 => xregs[rd] = xregs[rs1] >> shamt, // srai
_ => {}
}
}
0x6 => xregs[rd] = xregs[rs1] | imm, // ori
0x7 => xregs[rd] = xregs[rs1] & imm, // andi
_ => {}
}
}
0x17 => {
// U-type
// AUIPC forms a 32-bit offset from the 20-bit U-immediate, filling
// in the lowest 12 bits with zeros.
let imm = ((binary & 0xFFFFF000) as i32) as i64;
xregs[rd] = (self.pc as i64) + imm; // auipc
}
0x1B => {
// I-type (RV64I only)
let imm = (((binary & 0xFFF00000) as i32) as i64) >> 20;
let shamt = (binary & 0x01F00000) >> 20;
match funct3 {
0x0 => {
xregs[rd] = (((xregs[rs1].wrapping_add(imm)) & 0xFFFFFFFF) as i32) as i64
} // addiw
0x1 => xregs[rd] = (((xregs[rs1] << shamt) & 0xFFFFFFFF) as i32) as i64, // slliw
0x5 => {
match funct7 {
0x00 => xregs[rd] = ((xregs[rs1] as u32) >> shamt) as i64, // srliw
0x20 => xregs[rd] = ((xregs[rs1] as i32) >> shamt) as i64, // sraiw
_ => {}
}
}
_ => {}
}
}
0x23 => {
// S-type
let imm11_5 = (((binary & 0xFE000000) as i32) as i64) >> 25;
let imm4_0 = ((binary & 0x00000F80) >> 7) as u64;
let offset = (((imm11_5 << 5) as u64) | imm4_0) as i64;
let addr = (xregs[rs1] + offset) as usize;
match funct3 {
0x0 => set_memory8(addr, mem, xregs[rs2] as u8), // sb
0x1 => set_memory16(addr, mem, xregs[rs2] as u16), // sh
0x2 => set_memory32(addr, mem, xregs[rs2] as u32), // sw
0x3 => set_memory64(addr, mem, xregs[rs2] as u64), // sd
_ => {}
}
}
0x27 => {
// S-type (RV32F and RV64F)
let imm11_5 = (((binary & 0xFE000000) as i32) as i64) >> 25;
let imm4_0 = ((binary & 0x00000F80) >> 7) as u64;
let offset = (((imm11_5 << 5) as u64) | imm4_0) as i64;
let addr = (xregs[rs1] + offset) as usize;
match funct3 {
0x2 => set_memory32(addr, mem, (fregs[rs2] as f32).to_bits()), // fsw
0x3 => set_memory64(addr, mem, fregs[rs2].to_bits()), // fsd
_ => {}
}
}
0x2F => {
// R-type (RV32A and RV64A)
let funct5 = (funct7 & 0b1111100) >> 2;
let _aq = (funct7 & 0b0000010) >> 1; // acquire access
let _rl = funct7 & 0b0000001; // release access
match (funct3, funct5) {
// TODO: If the address is not naturally aligned, a misaligned address
// exception or an access exception will be generated.
(0x2, 0x00) => {
// amoadd.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(
xregs[rs1] as usize,
mem,
(t.wrapping_add(xregs[rs2] as i32)) as u32,
);
xregs[rd] = t as i64;
}
(0x3, 0x00) => {
// amoadd.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, t.wrapping_add(xregs[rs2]) as u64);
xregs[rd] = t;
}
(0x2, 0x01) => {
// amoswap.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(xregs[rs1] as usize, mem, xregs[rs2] as u32);
xregs[rd] = t as i64;
}
(0x3, 0x01) => {
// amoswap.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, xregs[rs2] as u64);
xregs[rd] = t;
}
(0x2, 0x02) => {
xregs[rd] = (get_memory32(xregs[rs1] as usize, mem) as i32) as i64
} // lr.w
(0x3, 0x02) => xregs[rd] = get_memory64(xregs[rs1] as usize, mem) as i64, // lr.d
(0x2, 0x03) => {
// TODO: Write a nonzero error code if the store fails.
// sc.w
xregs[rd] = 0;
set_memory32(xregs[rs1] as usize, mem, xregs[rs2] as u32);
}
(0x3, 0x03) => {
// TODO: Write a nonzero error code if the store fails.
// sc.d
xregs[rd] = 0;
set_memory64(xregs[rs1] as usize, mem, xregs[rs2] as u64);
}
(0x2, 0x04) => {
// amoxor.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(xregs[rs1] as usize, mem, (t ^ (xregs[rs2] as i32)) as u32);
xregs[rd] = t as i64;
}
(0x3, 0x04) => {
// amoxor.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, (t ^ xregs[rs2]) as u64);
xregs[rd] = t;
}
(0x2, 0x08) => {
// amoor.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(xregs[rs1] as usize, mem, (t | (xregs[rs2] as i32)) as u32);
xregs[rd] = t as i64;
}
(0x3, 0x08) => {
// amoor.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, (t | xregs[rs2]) as u64);
xregs[rd] = t;
}
(0x2, 0x0c) => {
// amoand.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(xregs[rs1] as usize, mem, (t & (xregs[rs2] as i32)) as u32);
xregs[rd] = t as i64;
}
(0x3, 0x0c) => {
// amoand.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, (t & xregs[rs2]) as u64);
xregs[rd] = t;
}
(0x2, 0x10) => {
// amomin.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(
xregs[rs1] as usize,
mem,
cmp::min(t, xregs[rs2] as i32) as u32,
);
xregs[rd] = t as i64;
}
(0x3, 0x10) => {
// amomin.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, cmp::min(t, xregs[rs2]) as u64);
xregs[rd] = t;
}
(0x2, 0x14) => {
// amomax.w
let t = get_memory32(xregs[rs1] as usize, mem) as i32;
set_memory32(
xregs[rs1] as usize,
mem,
cmp::max(t, xregs[rs2] as i32) as u32,
);
xregs[rd] = t as i64;
}
(0x3, 0x14) => {
// amomax.d
let t = get_memory64(xregs[rs1] as usize, mem) as i64;
set_memory64(xregs[rs1] as usize, mem, cmp::max(t, xregs[rs2]) as u64);
xregs[rd] = t;
}
(0x2, 0x18) => {
// amominu.w
let t = get_memory32(xregs[rs1] as usize, mem);
set_memory32(xregs[rs1] as usize, mem, cmp::min(t, xregs[rs2] as u32));
xregs[rd] = (t as i32) as i64;
}
(0x3, 0x18) => {
// amominu.d
let t = get_memory64(xregs[rs1] as usize, mem);
set_memory64(xregs[rs1] as usize, mem, cmp::min(t, xregs[rs2] as u64));
xregs[rd] = t as i64;
}
(0x2, 0x1c) => {
// amomaxu.w
let t = get_memory32(xregs[rs1] as usize, mem);
set_memory32(xregs[rs1] as usize, mem, cmp::max(t, xregs[rs2] as u32));
xregs[rd] = (t as i32) as i64;
}
(0x3, 0x1c) => {
// amomaxu.d
let t = get_memory64(xregs[rs1] as usize, mem);
set_memory64(xregs[rs1] as usize, mem, cmp::max(t, xregs[rs2] as u64));
xregs[rd] = t as i64;
}
_ => {}
}
}
0x33 => {
// R-type (RV32I and RV32M)
let shamt = xregs[rs2] as u64;
match (funct3, funct7) {
(0x0, 0x00) => xregs[rd] = xregs[rs1].wrapping_add(xregs[rs2]), // add
(0x0, 0x01) => xregs[rd] = xregs[rs1].wrapping_mul(xregs[rs2]), // mul
(0x0, 0x20) => xregs[rd] = xregs[rs1].wrapping_sub(xregs[rs2]), // sub
(0x1, 0x00) => xregs[rd] = ((xregs[rs1] as u64) << shamt) as i64, // sll
(0x1, 0x01) => {
// mulh
let n1 = BigInt::from(xregs[rs1]);
let n2 = BigInt::from(xregs[rs2]);
xregs[rd] = ((n1 * n2) >> 64).to_i64().unwrap();
}
(0x2, 0x00) => xregs[rd] = if xregs[rs1] < xregs[rs2] { 1 } else { 0 }, // slt
(0x2, 0x01) => {
// mulhsu
// get the most significant bit
let sign = ((xregs[rs1] as u64) & 0x80000000_00000000) as i64;
// xregs[rs1] is signed and xregs[rs2] is unsigned
let n1 = BigUint::from((xregs[rs1] as u64) & 0xefffffff_ffffffff);
let n2 = BigUint::from(xregs[rs2] as u64);
xregs[rd] = sign | ((n1 * n2) >> 64).to_i64().unwrap();
}
(0x3, 0x00) => {
xregs[rd] = if (xregs[rs1] as u64) < (xregs[rs2] as u64) {
1
} else {
0
}
} // sltu
(0x3, 0x01) => {
// mulhu
let n1 = BigUint::from(xregs[rs1] as u64);
let n2 = BigUint::from(xregs[rs2] as u64);
xregs[rd] = ((n1 * n2) >> 64).to_i64().unwrap();
}
(0x4, 0x00) => xregs[rd] = xregs[rs1] ^ xregs[rs2], // xor
(0x4, 0x01) => xregs[rd] = xregs[rs1].wrapping_div(xregs[rs2]), // div
(0x5, 0x00) => xregs[rd] = ((xregs[rs1] as u64) >> shamt) as i64, // srl
(0x5, 0x01) => {
// divu
let dividend = xregs[rs1] as u64;
let divisor = xregs[rs2] as u64;
xregs[rd] = dividend.wrapping_div(divisor) as i64;
}
(0x5, 0x20) => xregs[rd] = xregs[rs1] >> shamt, // sra
(0x6, 0x00) => xregs[rd] = xregs[rs1] | xregs[rs2], // or
(0x6, 0x01) => xregs[rd] = xregs[rs1] % xregs[rs2], // rem
(0x7, 0x00) => xregs[rd] = xregs[rs1] & xregs[rs2], // and
(0x7, 0x01) => {
// remu
let dividend = xregs[rs1] as u64;
let divisor = xregs[rs2] as u64;
xregs[rd] = (dividend % divisor) as i64;
}
_ => {}
};
}
0x37 => {
// U-type
// LUI places the U-immediate value in the top 20 bits of the destination
// register rd, filling in the lowest 12 bits with zeros.
xregs[rd] = ((binary & 0xFFFFF000) as i32) as i64; // lui
}
0x3B => {
// R-type (RV64I and RV64M)
// The shift amount is given by rs2[4:0].
let shamt = (xregs[rs2] & 0x1F) as u32;
match (funct3, funct7) {
(0x0, 0x00) => {
xregs[rd] = ((xregs[rs1].wrapping_add(xregs[rs2])) as i32) as i64
} // addw
(0x0, 0x01) => {
// mulw
let n1 = xregs[rs1] as i32;
let n2 = xregs[rs2] as i32;
let result = n1.wrapping_mul(n2);
xregs[rd] = result as i64;
}
(0x0, 0x20) => {
xregs[rd] = ((xregs[rs1].wrapping_sub(xregs[rs2])) as i32) as i64
} // subw
(0x1, 0x00) => xregs[rd] = (((xregs[rs1] as u32) << shamt) as i32) as i64, // sllw
(0x4, 0x01) => {
// divw
let dividend = xregs[rs1] as i32;
let divisor = xregs[rs2] as i32;
xregs[rd] = dividend.wrapping_div(divisor) as i64;
}
(0x5, 0x00) => xregs[rd] = (((xregs[rs1] as u32) >> shamt) as i32) as i64, // srlw
(0x5, 0x01) => {
// divuw
let dividend = xregs[rs1] as u32;
let divisor = xregs[rs2] as u32;
xregs[rd] = (dividend.wrapping_div(divisor) as i32) as i64;
}
(0x5, 0x20) => xregs[rd] = ((xregs[rs1] as i32) >> (shamt as i32)) as i64, // sraw
(0x6, 0x01) => {
// remw
let dividend = xregs[rs1] as i32;
let divisor = xregs[rs2] as i32;
xregs[rd] = dividend.wrapping_rem(divisor) as i64;
}
(0x7, 0x01) => {
// remuw
let dividend = xregs[rs1] as u32;
let divisor = xregs[rs2] as u32;
xregs[rd] = (dividend.wrapping_rem(divisor) as i32) as i64;
}
_ => {}
}
}
0x43 => {
// R4-type (RV32F and RV64F)
// TODO: support the rounding mode encoding (rm).
let rs3 = ((binary & 0xF8000000) >> 27) as usize;
let funct2 = (binary & 0x03000000) >> 25;
match funct2 {
0x0 => {
fregs[rd] =
(fregs[rs1] as f32).mul_add(fregs[rs2] as f32, fregs[rs3] as f32) as f64
} // fmadd.s
0x1 => fregs[rd] = fregs[rs1].mul_add(fregs[rs2], fregs[rs3]), // fmadd.d
_ => {}
}
}
0x47 => {
// R4-type (RV32F and RV64F)
// TODO: support the rounding mode encoding (rm).
let rs3 = ((binary & 0xF8000000) >> 27) as usize;
let funct2 = (binary & 0x03000000) >> 25;
match funct2 {
0x0 => {
fregs[rd] = (fregs[rs1] as f32)
.mul_add(fregs[rs2] as f32, -fregs[rs3] as f32)
as f64
} // fmsub.s
0x1 => fregs[rd] = fregs[rs1].mul_add(fregs[rs2], -fregs[rs3]), // fmsub.d
_ => {}
}
}
0x4B => {
// R4-type (RV32F and RV64F)
// TODO: support the rounding mode encoding (rm).
let rs3 = ((binary & 0xF8000000) >> 27) as usize;
let funct2 = (binary & 0x03000000) >> 25;
match funct2 {
0x0 => {
fregs[rd] = (-fregs[rs1] as f32)
.mul_add(fregs[rs2] as f32, fregs[rs3] as f32)
as f64
} // fnmadd.s
0x1 => fregs[rd] = (-fregs[rs1]).mul_add(fregs[rs2], fregs[rs3]), // fnmadd.d
_ => {}
}
}
0x4F => {
// R4-type (RV32F and RV64F)
// TODO: support the rounding mode encoding (rm).
let rs3 = ((binary & 0xF8000000) >> 27) as usize;
let funct2 = (binary & 0x03000000) >> 25;
match funct2 {
0x0 => {
fregs[rd] = (-fregs[rs1] as f32)
.mul_add(fregs[rs2] as f32, -fregs[rs3] as f32)
as f64
} // fnmsub.s
0x1 => fregs[rd] = (-fregs[rs1]).mul_add(fregs[rs2], -fregs[rs3]), // fnmsub.d
_ => {}
}
}
0x53 => {
// R-type (RV32F and RV64F)
// TODO: support the rounding mode encoding (rm).
// TODO: NaN Boxing of Narrower Values (Spec 12.2).
// TODO: set exception flags.
/*
* Floating-point instructions align with the IEEE 754 (1985).
* The format consist of three fields: a sign bit, a biased exponent, and a fraction.
*
* | sign(1) | exponent(8) | fraction(23) |
* 31 0
*
*/
match funct7 {
0x00 => fregs[rd] = (fregs[rs1] as f32 + fregs[rs2] as f32) as f64, // fadd.s
0x01 => fregs[rd] = fregs[rs1] + fregs[rs2], // fadd.d
0x04 => fregs[rd] = (fregs[rs1] as f32 - fregs[rs2] as f32) as f64, // fsub.s
0x05 => fregs[rd] = fregs[rs1] - fregs[rs2], // fsub.d
0x08 => fregs[rd] = (fregs[rs1] as f32 * fregs[rs2] as f32) as f64, // fmul.s
0x09 => fregs[rd] = fregs[rs1] * fregs[rs2], // fmul.d
0x0c => fregs[rd] = (fregs[rs1] as f32 / fregs[rs2] as f32) as f64, // fdiv.s
0x0d => fregs[rd] = fregs[rs1] / fregs[rs2], // fdiv.d
0x10 => {
match funct3 {
0x0 => fregs[rd] = fregs[rs1].copysign(fregs[rs2]), // fsgnj.s
0x1 => fregs[rd] = fregs[rs1].copysign(-fregs[rs2]), // fsgnjn.s
0x2 => {
let sign1 = (fregs[rs1] as f32).to_bits() & 0x80000000;
let sign2 = (fregs[rs2] as f32).to_bits() & 0x80000000;
let other = (fregs[rs1] as f32).to_bits() & 0x7FFFFFFF;
// fsgnjx.s
fregs[rd] = f32::from_bits((sign1 ^ sign2) | other) as f64;
}
_ => {}
}
}
0x11 => {
match funct3 {
0x0 => fregs[rd] = fregs[rs1].copysign(fregs[rs2]), // fsgnj.d
0x1 => fregs[rd] = fregs[rs1].copysign(-fregs[rs2]), // fsgnjn.d
0x2 => {
let sign1 = fregs[rs1].to_bits() & 0x80000000_00000000;
let sign2 = fregs[rs2].to_bits() & 0x80000000_00000000;
let other = fregs[rs1].to_bits() & 0x7FFFFFFF_FFFFFFFF;
// fsgnjx.d
fregs[rd] = f64::from_bits((sign1 ^ sign2) | other);
}
_ => {}
}
}
0x14 => {
match funct3 {
0x0 => fregs[rd] = fregs[rs1].min(fregs[rs2]), // fmin.s
0x1 => fregs[rd] = fregs[rs1].max(fregs[rs2]), // fmax.s
_ => {}
}
}
0x15 => {
match funct3 {
0x0 => fregs[rd] = fregs[rs1].min(fregs[rs2]), // fmin.d
0x1 => fregs[rd] = fregs[rs1].max(fregs[rs2]), // fmax.d
_ => {}
}
}
0x20 => fregs[rd] = fregs[rs1], // fcvt.s.d
0x21 => fregs[rd] = (fregs[rs1] as f32) as f64, // fcvt.d.s
0x2c => fregs[rd] = (fregs[rs1] as f32).sqrt() as f64, // fsqrt.s
0x2d => fregs[rd] = fregs[rs1].sqrt(), // fsqrt.d
0x50 => {
match funct3 {
0x0 => xregs[rd] = if fregs[rs1] <= fregs[rs2] { 1 } else { 0 }, // fle.s
0x1 => xregs[rd] = if fregs[rs1] < fregs[rs2] { 1 } else { 0 }, // flt.s
0x2 => xregs[rd] = if fregs[rs1] == fregs[rs2] { 1 } else { 0 }, // feq.s
_ => {}
}
}
0x51 => {
match funct3 {
0x0 => xregs[rd] = if fregs[rs1] <= fregs[rs2] { 1 } else { 0 }, // fle.d
0x1 => xregs[rd] = if fregs[rs1] < fregs[rs2] { 1 } else { 0 }, // flt.d
0x2 => xregs[rd] = if fregs[rs1] == fregs[rs2] { 1 } else { 0 }, // feq.d
_ => {}
}
}
0x60 => {
match rs2 {
0x0 => xregs[rd] = ((fregs[rs1] as f32).round() as i32) as i64, // fcvt.w.s
0x1 => xregs[rd] = (((fregs[rs1] as f32).round() as u32) as i32) as i64, // fcvt.wu.s
0x2 => xregs[rd] = (fregs[rs1] as f32).round() as i64, // fcvt.l.s
0x3 => xregs[rd] = ((fregs[rs1] as f32).round() as u64) as i64, // fcvt.lu.s
_ => {}
}
}
0x61 => {
match rs2 {
0x0 => xregs[rd] = (fregs[rs1].round() as i32) as i64, // fcvt.w.d
0x1 => xregs[rd] = ((fregs[rs1].round() as u32) as i32) as i64, // fcvt.wu.d
0x2 => xregs[rd] = fregs[rs1].round() as i64, // fcvt.l.d
0x3 => xregs[rd] = (fregs[rs1].round() as u64) as i64, // fcvt.lu.d
_ => {}
}
}
0x68 => {
match rs2 {
0x0 => fregs[rd] = ((xregs[rs1] as i32) as f32) as f64, // fcvt.s.w
0x1 => fregs[rd] = ((xregs[rs1] as u32) as f32) as f64, // fcvt.s.wu
0x2 => fregs[rd] = (xregs[rs1] as f32) as f64, // fcvt.s.l
0x3 => fregs[rd] = ((xregs[rs1] as u64) as f32) as f64, // fcvt.s.lu
_ => {}
}
}
0x69 => {
match rs2 {
0x0 => fregs[rd] = (xregs[rs1] as i32) as f64, // fcvt.d.w
0x1 => fregs[rd] = (xregs[rs1] as u32) as f64, // fcvt.d.wu
0x2 => fregs[rd] = xregs[rs1] as f64, // fcvt.d.l
0x3 => fregs[rd] = (xregs[rs1] as u64) as f64, // fcvt.d.lu
_ => {}
}
}
0x70 => {
match funct3 {
0x0 => xregs[rd] = (fregs[rs1] as i32) as i64, // fmv.x.w
0x1 => {
// fclass.s
let f = fregs[rs1];
match f.classify() {
FpCategory::Infinite => {
xregs[rd] = if f.is_sign_negative() { 0 } else { 7 }
}
FpCategory::Normal => {
xregs[rd] = if f.is_sign_negative() { 1 } else { 6 }
}
FpCategory::Subnormal => {
xregs[rd] = if f.is_sign_negative() { 2 } else { 5 }
}
FpCategory::Zero => {
xregs[rd] = if f.is_sign_negative() { 3 } else { 4 }
}
// Don't support a signaling NaN, only support a quiet NaN.
FpCategory::Nan => xregs[rd] = 9,
}
}
_ => {}
}
}
0x71 => {
match funct3 {
0x0 => xregs[rd] = fregs[rs1] as i64, // fmv.x.d
0x1 => {
// fclass.d
let f = fregs[rs1];
match f.classify() {
FpCategory::Infinite => {
xregs[rd] = if f.is_sign_negative() { 0 } else { 7 }
}
FpCategory::Normal => {
xregs[rd] = if f.is_sign_negative() { 1 } else { 6 }
}
FpCategory::Subnormal => {
xregs[rd] = if f.is_sign_negative() { 2 } else { 5 }
}
FpCategory::Zero => {
xregs[rd] = if f.is_sign_negative() { 3 } else { 4 }
}
// Don't support a signaling NaN, only support a quiet NaN.
FpCategory::Nan => xregs[rd] = 9,
}
}
_ => {}
}
}
0x78 => fregs[rd] = ((xregs[rs1] as i32) as f32) as f64, // fmv.w.x
0x79 => fregs[rd] = xregs[rs1] as f64, // fmv.d.x
_ => {}
}
}
0x63 => {
// B-type
let imm12 = (((binary & 0x80000000) as i32) as i64) >> 31;
let imm10_5 = ((binary & 0x7E000000) >> 25) as u64;
let imm4_1 = ((binary & 0x00000F00) >> 8) as u64;
let imm11 = ((binary & 0x00000080) >> 7) as u64;
let offset =
((imm12 << 12) as u64 | (imm11 << 11) | (imm10_5 << 5) | (imm4_1 << 1)) as i64;
match funct3 {
0x0 => {
// beq
if xregs[rs1] == xregs[rs2] {
self.pc = ((self.pc as i64) + offset - 4) as usize;
}
}
0x1 => {
// bne
if xregs[rs1] != xregs[rs2] {
self.pc = ((self.pc as i64) + offset - 4) as usize;
}
}
0x4 => {
// blt
if xregs[rs1] < xregs[rs2] {
self.pc = ((self.pc as i64) + offset - 4) as usize;
}
}
0x5 => {
// bge
if xregs[rs1] >= xregs[rs2] {
self.pc = ((self.pc as i64) + offset - 4) as usize;
}
}
0x6 => {
// bltu
if (xregs[rs1] as u64) < (xregs[rs2] as u64) {
self.pc = ((self.pc as i64) + offset - 4) as usize;
}
}
0x7 => {
// bgeu
if (xregs[rs1] as u64) >= (xregs[rs2] as u64) {
self.pc = ((self.pc as i64) + offset - 4) as usize;
}
}
_ => {}
}
}
0x67 => {
// I-type
// jalr
xregs[rd] = (self.pc as i64) + 4;
let imm = (((binary & 0xFFF00000) as i32) as i64) >> 20;
self.pc = ((xregs[rs1] + imm - 4) & !1) as usize;
}
0x6F => {
// J-type
// jal
xregs[rd] = (self.pc as i64) + 4;
let imm20 = (((binary & 0x80000000) as i32) as i64) >> 31;
let imm10_1 = ((binary & 0x7FE00000) >> 21) as u64;
let imm11 = ((binary & 0x100000) >> 20) as u64;
let imm19_12 = ((binary & 0xFF000) >> 12) as u64;
let offset =
((imm20 << 20) as u64 | (imm19_12 << 12) | (imm11 << 11) | (imm10_1 << 1))
as i64;
let tmp = (self.pc as i64) + offset - 4;
self.pc = tmp as usize;
}
0x73 => {
// I-type
let funct12 = (((binary & 0xFFF00000) as i32) as i64) >> 20;
let _csr = (((binary & 0xFFF00000) as i32) as i64) >> 20;
match funct3 {
0x0 => {
match funct12 {
// TODO: implement ecall and ebreak
// ecall makes a request of the execution environment by raising an
// environment call exception.
// ebreak makes a request of the debugger by raising a breakpoint
// exception.
0x0 => {} // ecall
0x1 => {} // ebreak
_ => {}
}
}
// TODO: implement RV32/RV64 Zicsr Standard Extension
0x1 => {} // csrrw
0x2 => {} // csrrs
0x3 => {} // csrrc
0x5 => {} // csrrwi
0x6 => {} // csrrsi
0x7 => {} // csrrci
_ => {}
}
}
_ => {
let text = format!(
"not implemented opcode {} ({:#x}, {:#b})",
opcode, opcode, opcode
);
log(&text);
render(&text);
exit(1);
}
}
}
}