-
Notifications
You must be signed in to change notification settings - Fork 0
/
RiscV.java
1258 lines (1098 loc) · 65.2 KB
/
RiscV.java
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
//------------------------------------------------------------------------------
// Execute Risc V machine code. Little endian RV32I.
// Philip R Brenan at appaapps dot com, Appa Apps Ltd Inc., 2024
//------------------------------------------------------------------------------
package com.AppaApps.Silicon; // Design, emulate and layout digital a binary tree on a silicon chip.
import java.io.*;
import java.util.*;
//D1 Construct // Construct a Risc V program and execute it
public class RiscV extends Chip // Load and execute a program written in RiscV machine code
{final static int XLEN = 32; // Size of instructions
final static boolean github_actions = // Whether we are on a github or not
"true".equals(System.getenv("GITHUB_ACTIONS"));
final static boolean makeSayStop = false; // Turn say into stop if true which is occasionally useful for locating unlabeled say statements.
final String name; // Name of program
final int defaultMaxSimulationSteps = github_actions ? 1000 : 100; // Default maximum simulation steps
final int defaultMinSimulationSteps = 0; // Default minimum simulation steps - we keep going at least this long even if there have been no changes to allow clocked circuits to evolve.
Integer maxSimulationSteps = null; // Maximum simulation steps
Integer minSimulationSteps = null; // Minimum simulation steps - we keep going at least this long even if there have been no changes to allow clocked circuits to evolve.
final Stack<Encode> code = new Stack<>(); // Encoded instructions
final Register[] x = new Register[32]; // General purpose registers
final Register x0, x1, x2, x3, x4, x5, x6, x7, x8, x9,
x10, x11, x12, x13, x14, x15, x16, x17, x18, x19,
x20, x21, x22, x23, x24, x25, x26, x27, x28, x29, x30, x31;
final byte[] memory = new byte[100]; // Memory
int pc = 0; // Program counter
int steps = 0; // Number of steps taken so far in executing the program
final Stack<String> ecall = new Stack<>(); // Ecall executed
TreeMap<String, Label> labels = new TreeMap<>(); // Labels in assembler code
TreeMap<String, Variable> variables = new TreeMap<>(); // Variables in assembler code
int pVariables = 0; // Position of variables in memory
RiscV(String Name) // Create a new program
{name = Name; // Name of chip
for (int i = 0; i < x.length; i++) x[i] = new Register(i); // Create the registers
x0 = x[ 0]; x1 = x[ 1]; x2 = x[ 2]; x3 = x[ 3]; x4 = x[ 4];
x5 = x[ 5]; x6 = x[ 6]; x7 = x[ 7]; x8 = x[ 8]; x9 = x[ 9];
x10 = x[10]; x11 = x[11]; x12 = x[12]; x13 = x[13]; x14 = x[14];
x15 = x[15]; x16 = x[16]; x17 = x[17]; x18 = x[18]; x19 = x[19];
x20 = x[20]; x21 = x[21]; x22 = x[22]; x23 = x[23]; x24 = x[24];
x25 = x[25]; x26 = x[26]; x27 = x[27]; x28 = x[28]; x29 = x[29];
x30 = x[30]; x31 = x[31];
}
RiscV() // Create a new program with the name of the test
{this(Chip.currentTestName());
}
int maxSimulationSteps(int MaxSimulationSteps) {return maxSimulationSteps = MaxSimulationSteps;} // Maximum simulation steps
int minSimulationSteps(int MinSimulationSteps) {return minSimulationSteps = MinSimulationSteps;} // Minimum simulation steps
void simulationSteps(int min, int max) {minSimulationSteps(min); maxSimulationSteps(max);} // Stop cleanly between the specified minimum and maximum number of steps
void simulationSteps(int steps) {minSimulationSteps(steps); maxSimulationSteps(steps);} // Stop cleanly at this number of steps
public String toString() // Convert state chip to string
{final StringBuilder b = new StringBuilder();
b.append("RiscV : " + name + "\n");
b.append("Step : " + steps + "\n");
b.append("Instruction: " + pc + "\n");
int m = 0, r = 0; // Number of memory bytes and registers that are not zero
for (int i = 0; i < x.length; i++) if (x[i].value != 0) ++r; // Print non zero registers
for (int i = 0; i < memory.length; i++) if (memory[i] != 0) ++m; // Print non zero memory
if (r > 0) // Print non zero registers
{b.append("Registers : ");
for (int i = 0; i < x.length; i++)
{final int v = x[i].value;
if (v != 0) b.append(" x"+i+"="+v);
}
b.append("\n");
}
if (m > 0) // Print non zero memory
{b.append("Memory : ");
for (int i = 0; i < memory.length; i++)
{final int v = memory[i];
if (v != 0) b.append(" "+i+"="+v);
}
b.append("\n");
}
return b.toString(); // String describing chip
}
public String printCode() // Print the program being run by the chip
{final StringBuilder b = new StringBuilder();
b.append("RiscV Hex Code: " + name + "\n");
final int N = code.size();
b.append("Line Name Op D S1 S2 T F3 F5 F7 A R Immediate Value\n");
for (int i = 0; i < N; i++) // Print each instruction
b.append(String.format("%04x %s", i, code.elementAt(i).toString()));
return b.toString(); // String describing chip
}
public void ok(String expected) // Confirm the current state of the Risc V chip
{ok(toString(), expected);
}
class Register // Description of a register
{final int x; // Number of register
int value; // Current value of the register
Register(int register) // Describe a register
{x = register;
if (x < 0 || x >=XLEN) stop("Register must be 0 to", XLEN, "not", x);
}
public String toString() {return ""+value;} // Print the value of a register
}
//D1 Emulate // Emulate the execution of a Risc V program
void setLabels() // Set labels so that they address the targets of branch instructions
{final int N = code.size();
for (int i = 0; i < N; i++) code.elementAt(i).setLabel(i);
}
void emulate() // Emulate the execution of the program
{final int actualMaxSimulationSteps = // Actual limit on number of steps
maxSimulationSteps != null ? maxSimulationSteps : defaultMaxSimulationSteps;
final boolean miss = minSimulationSteps != null; // Minimum simulation steps set
pc = 0; // Reset
for (int i = 0; i < x.length; i++) x[i].value = 0; // Clear registers
setLabels(); // Set branch instructions so they address their targets
for (steps = 1; steps <= actualMaxSimulationSteps; ++steps) // Steps in time
{if (pc >= code.size()) return; // Off the end of the code
final Encode e = code.elementAt(pc);
final Decode.Executable d = decode(e);
if (d == null) stop("Need data for instruction", pc);
d.action();
}
if (maxSimulationSteps == null) // Not enough steps available by default
{err("Out of time after", actualMaxSimulationSteps, "steps");
}
}
//D1 Encode and Decode // Encode and decode instructions to and from their binary formats in machine code
class Encode // Encode an instruction
{int instruction; // Resulting instruction
final Label label; // Label describing target of branch instruction
Encode(int opCode, Register rd, Register rs1, Register rs2, // Encode an instruction
int funct3, int funct5, int funct7, int subType, int immediate,
int aq, int rl, Label Label
)
{opCode &= Decode.m_opCode; // Mask input values to desired ranges
funct3 &= Decode.m_funct3;
funct5 &= Decode.m_funct5;
funct7 &= Decode.m_funct7;
subType &= Decode.m_subType;
rl &= Decode.m_rl;
aq &= Decode.m_aq;
instruction = opCode | immediate // Overlay the fields - zero fields will have no effect so this safe.
| (rd != null ? rd.x << 7 : 0)
| (rs1 != null ? rs1.x << 15 : 0)
| (rs2 != null ? rs2.x << 20 : 0)
| (funct3 << 12)
| (subType << 12)
| (funct7 << 25)
| (rl << 25)
| (aq << 26)
| (funct5 << 27);
label = Label;
code.push(this);
}
Encode(int opCode, Register rd, Register rs1, Register rs2, // Encode an instruction without aq or rl or a label
int funct3, int funct5, int funct7, int subType, int immediate
)
{this(opCode, rd, rs1, rs2, funct3, funct5, funct7, subType, immediate,
0, 0, null);
}
Encode(int opCode, Register rd, Register rs1, Register rs2, // Encode an instruction without aq or rl but with a label
int funct3, int funct5, int funct7, int subType, int immediate,
Label label
)
{this(opCode, rd, rs1, rs2, funct3, funct5, funct7, subType, immediate,
0, 0, label);
}
void setLabel(int offset) // Set immediate field from any label referenced by this instruction
{if (label == null) return; // No label
final Decode d = decode(this).details(); // Decode this instruction so we can reassemble it with the current immediate value
final int o = label.offset - offset; // Offset to target instruction from current instruction in blocks of 4 bytes
final int i = switch(d.format) // Choose encoding format for immediate operand
{case "B" -> encodeBImmediate(o << 1); // Offset to target instruction from current instruction in signed blocks of 2 bytes
case "I" -> encodeIImmediate(o << 1); // Offset to target instruction from current instruction in signed blocks of 2 bytes
case "J" -> encodeJImmediate(o << 1); // Offset to target instruction from current instruction in signed blocks of 2 bytes
case "U" -> encodeUImmediate(o << 1); // Offset to target instruction from current instruction in signed blocks of 2 bytes
default -> {stop("Cannot use format", d.format, "in a jump"); yield 0;}
};
final Encode e = new Encode(d.opCode, x[d.rd], x[d.rs1], x[d.rs2], // Encode an instruction without aq or rl or a label
d.funct3, d.funct5, d.funct7, d.subType, i);
code.pop(); // Remove unwanted instruction just added as part of re-encoding. This is safe to do as we have updated the existing instruction that we want to keep.
instruction = e.instruction; // Update current instruction with intermediate value showing offset to the target instruction
}
public String toString() // Instruction as string
{final Decode d = decode(this).details();
return String.format
("%8s %4x %2x %2x %2x %2x %2x %2x %2x %x %x %8x %8x\n",
d.name, d.opCode, d.rd, d.rs1, d.rs2, d.subType, d.funct3, d.funct5,
d.funct7, d.aq ? 1 : 0, d.rl ? 1 : 0, d.immediate, instruction);
}
}
static class Decode // Decode an instruction
{final Encode instruction; // Instruction to be decoded
String format = null; // Format of instruction
String name = null; // Name of instruction
int immediate = 0; // Immediate value
boolean rl = false; // rl
boolean aq = false; // aq
final int rd; // Destination register
final int opCode; // Operation code
final int funct3; // Sub function
final int funct5; // Sub function
final int funct7; // Sub function
final int rs1; // Source 1 register
final int rs2; // Source 2 register
final int subType; // Sub type
final static int p_opCode = 0, l_opCode = 7; // Encoded position of op code
final static int p_rd = 7, l_rd = 5; // Encoded position of destination register
final static int p_funct3 = 12, l_funct3 = 3; // Encoded position of sub function
final static int p_subType = 12, l_subType = 3; // Encoded position of sub type
final static int p_rs1 = 15, l_rs1 = 5; // Encoded position of source register 1
final static int p_rs2 = 20, l_rs2 = 5; // Encoded position of source register 2
final static int p_funct7 = 25, l_funct7 = 7; // Encoded position of sub function
final static int p_rl = 25, l_rl = 1; // Encoded position of rl
final static int p_aq = 26, l_aq = 1; // Encoded position of aq
final static int p_funct5 = 27, l_funct5 = 5; // Encoded position of sub function
final static int m_opCode = 0b111_1111; // Mask for op code
final static int m_rd = 0b001_1111; // Mask for destination register
final static int m_rs1 = 0b001_1111; // Mask for source register 1
final static int m_rs2 = 0b001_1111; // Mask for source register 2
final static int m_funct3 = 0b000_0111; // Mask for sub function 3
final static int m_funct5 = 0b001_1111; // Mask for sub function 5
final static int m_funct7 = 0b111_1111; // Mask for sub function 7
final static int m_subType = 0b000_0111; // Mask for sub type
final static int m_rl = 0b000_0001; // Mask for rl
final static int m_aq = 0b000_0001; // Mask for aq
final static int opLoad = 0b000_0011; // Opcodes - load
final static int opArithImm = 0b001_0011;
final static int opAuiPc = 0b001_0111;
final static int opStore = 0b010_0011;
final static int opArith = 0b011_0011;
final static int opLui = 0b011_0111;
final static int opBranch = 0b110_0011;
final static int opEcall = 0b111_0011;
final static int opJal = 0b110_1111;
final static int opJalr = 0b110_0111;
final static int f3_add = 0; // Funct3 op codes
final static int f3_xor = 4;
final static int f3_or = 6;
final static int f3_and = 7;
final static int f3_sll = 1;
final static int f3_srl = 5;
final static int f3_slt = 2;
final static int f3_sltu = 3;
final static int f3_beq = 0;
final static int f3_bne = 1;
final static int f3_blt = 4;
final static int f3_bge = 5;
final static int f3_bltu = 6;
final static int f3_bgeu = 7;
final static int f3_sb = 0;
final static int f3_sh = 1;
final static int f3_sw = 2;
final static int f3_lb = 0;
final static int f3_lbu = 4;
final static int f3_lh = 1;
final static int f3_lhu = 5;
final static int f3_lw = 2;
final static int f3_jalr = 0;
Decode(String Name, Encode Instruction) // Decode an instruction
{instruction = Instruction;
name = Name;
final int i = instruction.instruction;
opCode = (i >> p_opCode) & m_opCode;
rd = (i >> p_rd ) & m_rd; // Destination register
rs1 = (i >> p_rs1 ) & m_rs1; // Source register 1
rs2 = (i >> p_rs2 ) & m_rs2; // Source register 2
funct3 = (i >> p_funct3 ) & m_funct3; // Sub function
funct5 = (i >> p_funct5 ) & m_funct5; // Sub function
funct7 = (i >> p_funct7 ) & m_funct7; // Sub function
subType = (i >> p_subType) & m_subType; // Sub type
}
Decode(Encode Instruction) // Decode an instruction
{this(null, Instruction);
}
public void action() {} // Action required to implement an instruction
public String toString() // Print instruction
{return name
+ " rd" + rd
+ " opCode" + opCode
+ " funct3" + funct3
+ " funct5" + funct5
+ " funct7" + funct7
+ " rs1" + rs1
+ " rs2" + rs2
+ " subType" + subType;
}
interface Executable // An instruction that can be executed
{public default void action() {stop("Implementation needed");} // Action performed by instruction
Decode details(); // Decoded instruction details
}
class B implements Executable // Decode a B format instruction
{final static int immWidth = 12; // Immediate width. Twice the signed immediate value specifies the offset in bytes of the next instruction relative to the current instruction.
final static int m_31_31 = 0b10000000000000000000000000000000;
final static int m_30_25 = 0b01111110000000000000000000000000;
final static int m_11_08 = 0b00000000000000000000111100000000;
final static int m_07_07 = 0b00000000000000000000000010000000;
static int immediate(int i) // Decode a B format immediate operand
{final int a = ((i & m_31_31) >>> 31) << 11;
final int b = ((i & m_30_25) >>> 25) << 4;
final int c = ((i & m_11_08) >>> 8) << 0;
final int d = ((i & m_07_07) >>> 7) << 10;
return (((a|b|c|d)<<20)>>20)<<1; // The 2*immediate field encodes the offset in bytes, but we need the offset in blocks of 4 bytes because we do not use the 2 byte instructions in this implementations.
}
B(String Name) // Decode B format instruction immediate field
{format = "B"; name = Name; immediate = immediate(instruction.instruction);
}
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format("B %7s %8s rs1=%2d rs2=%2d imm=0x%x, %d",
binaryString(opCode, 7), name, rs1, rs2, immediate, immediate);
}
}
class I implements Executable // Decode an I format instruction
{final static int p_immediate = 20, l_immediate = 12; // Position of immediate value
I(String Name) // Decode instruction
{format = "I"; name = Name;
immediate = instruction.instruction >> p_immediate; // Immediate value
}
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format
("I %7s %8s rd=%2d rs1=%2d funct3=%2x imm=0x%x, %d",
binaryString(opCode, 7), name, rd, rs1, funct3, immediate, immediate);
}
}
class J implements Executable // Decode a J format instruction
{final static int m_31_31 = 0b10000000000000000000000000000000; // Masks for areas of the intermediate value
final static int m_30_21 = 0b01111111111000000000000000000000;
final static int m_20_20 = 0b00000000000100000000000000000000;
final static int m_19_12 = 0b00000000000011111111000000000000;
static int immediate(int i) // Decode J immediate
{final int a = ((i & m_31_31) >>> 31) << 19; // 20
final int b = ((i & m_30_21) >>> 21) << 0; // 10-1
final int c = ((i & m_20_20) >>> 20) << 10; // 11
final int d = ((i & m_19_12) >>> 1) << 0; // 19-12
return ((a|b|c|d)<<12)>>12;
}
J(String Name) // Decode a J format instruction
{format = "J"; name = Name;
immediate = immediate(instruction.instruction); // Immediate value
}
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format("J %7s %8s rd=%2d imm=0x%x, %d",
binaryString(opCode, 7), rd, name, immediate, immediate);
}
}
class R implements Executable // Decode a R format instruction
{R(String Name) {name = Name; format = "R"; } // Decode instruction
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format
("R %7s %8s rd=%2d rs1=%2d rs2=%2d funct3=%2x funct7=%2x",
binaryString(opCode, 7), name, rd, rs1, rs2, funct3, funct7);
}
}
class Ra implements Executable // Decode a R atomic format instruction
{Ra(String Name) // Decode instruction
{name = Name; format = "Ra";
final int i = instruction.instruction;
rl = ((i >>> 25) & 0b1) == 0b1; // rl
aq = ((i >>> 26) & 0b1) == 0b1; // aq
}
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format
("Ra %7s %8s rd=%2d rs1=%2d rs2=%2d funct3=%2x funct5=%2x aq=%d rl=%d",
binaryString(opCode, 7), name, rd, rs1, rs2, funct3, funct5, aq, rl);
}
}
class S implements Executable // Decode a S format instruction
{final static int m_31_25 = 0b11111110000000000000000000000000;
final static int m_11_07 = 0b00000000000000000000111110000000;
static int immediate(int i) // Decode the immediate field of an S format instruction
{final int a = ((i & m_31_25) >>> 25) << 5;
final int b = ((i & m_11_07) >>> 7) << 0;
return ((a|b)<<20)>>20;
}
S(String Name) // Decode instruction
{format = "S"; name = Name;
immediate = immediate(instruction.instruction);
}
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format
("S %7s %8s rd=%2d rs1=%2d rs2=%2d funct3=%2x imm=0x%x, %d",
binaryString(opCode, 7), name, rd, rs1, rs2, funct3,
immediate, immediate);
}
}
class U implements Executable // Decode a U format instruction
{final static int p_immediate = 12, l_immediate = 20; // Position of immediate value
U(String Name) // Decode instruction
{format = "U"; name = Name;
immediate = instruction.instruction >>> p_immediate; // Immediate value
}
public Decode details() {return Decode.this;} // Decoded instruction details
public String toString() // Print instruction
{return String.format("U %7s %8s rd=%2d imm=0x%x, %d",
binaryString(opCode, 7), rd, name, immediate, immediate);
}
}
}
Decode.Executable decode(Encode e) // Decode an instruction
{final Decode d = new Decode(e);
switch(d.opCode)
{case Decode.opArith -> // Arithmetic
{if (d.funct7 == 0)
{switch(d.funct3)
{case Decode.f3_add : return d.new R("add") {public void action() {x[d.rd].value = x[d.rs1].value + x[d.rs2].value; pc++;}};
case Decode.f3_xor : return d.new R("xor") {public void action() {x[d.rd].value = x[d.rs1].value ^ x[d.rs2].value; pc++;}};
case Decode.f3_or : return d.new R("or") {public void action() {x[d.rd].value = x[d.rs1].value | x[d.rs2].value; pc++;}};
case Decode.f3_and : return d.new R("and") {public void action() {x[d.rd].value = x[d.rs1].value & x[d.rs2].value; pc++;}};
case Decode.f3_sll : return d.new R("sll") {public void action() {x[d.rd].value = x[d.rs1].value << x[d.rs2].value; pc++;}};
case Decode.f3_srl : return d.new R("srl") {public void action() {x[d.rd].value = x[d.rs1].value >>> x[d.rs2].value; pc++;}};
case Decode.f3_slt : return d.new R("slt") {public void action() {x[d.rd].value = x[d.rs1].value < x[d.rs2].value ? 1 : 0; pc++;}};
case Decode.f3_sltu: return d.new R("sltu") {public void action() {x[d.rd].value = x[d.rs1].value < x[d.rs2].value ? 1 : 0; pc++;}};
default : return null;
}
}
else if (d.funct7 == 2)
{switch(d.funct3)
{case Decode.f3_add : return d.new I("sub") {public void action() {x[d.rd].value = x[d.rs1].value - d.immediate; pc++;}};
case Decode.f3_srl : return d.new I("sra") {public void action() {x[d.rd].value = x[d.rs1].value >> d.immediate; pc++;}};
default : return null;
}
}
else return null;
}
case Decode.opArithImm -> // Arithmetic with immediate operands
{switch(d.funct3)
{case Decode.f3_add: return d.new I("addi") {public void action() {x[d.rd].value = x[d.rs1].value + d.immediate; pc++;}};
case Decode.f3_xor: return d.new I("xori") {public void action() {x[d.rd].value = x[d.rs1].value ^ d.immediate; pc++;}};
case Decode. f3_or: return d.new I("ori") {public void action() {x[d.rd].value = x[d.rs1].value | d.immediate; pc++;}};
case Decode.f3_and: return d.new I("andi") {public void action() {x[d.rd].value = x[d.rs1].value & d.immediate; pc++;}};
case Decode.f3_sll: return d.new I("slli") {public void action() {x[d.rd].value = x[d.rs1].value << d.immediate; pc++;}};
case Decode.f3_srl:
final Decode dI = d.new I(null).details();
switch((dI.immediate >> 5) & 0b111_1111)
{case 0: return d.new I("srli") {public void action() {x[d.rd].value = x[d.rs1].value >>> d.immediate; pc++;}};
case 2: return d.new I("srai") {public void action() {x[d.rd].value = x[d.rs1].value >> d.immediate; pc++;}};
default: return null;
}
case Decode.f3_slt : return d.new I("slti" ) {public void action() {x[d.rd].value = x[d.rs1].value < d.immediate ? 1 : 0; pc++;}};
case Decode.f3_sltu: return d.new I("sltiu") {public void action() {x[d.rd].value = x[d.rs1].value < d.immediate ? 1 : 0; pc++;}};
default : return null;
}
}
case Decode.opBranch -> // Branch
{switch(d.funct3)
{case Decode. f3_beq: return d.new B("beq") {public void action() {if (x[d.rs1].value == x[d.rs2].value) pc += d.immediate>>1; else pc++;}};
case Decode. f3_bne: return d.new B("bne") {public void action() {if (x[d.rs1].value != x[d.rs2].value) pc += d.immediate>>1; else pc++;}};
case Decode. f3_blt: return d.new B("blt") {public void action() {if (x[d.rs1].value < x[d.rs2].value) pc += d.immediate>>1; else pc++;}};
case Decode. f3_bge: return d.new B("bge") {public void action() {if (x[d.rs1].value >= x[d.rs2].value) pc += d.immediate>>1; else pc++;}};
case Decode.f3_bltu: return d.new B("bltu") {public void action() {if (x[d.rs1].value < x[d.rs2].value) pc += d.immediate>>1; else pc++;}};
case Decode.f3_bgeu: return d.new B("bgeu") {public void action() {if (x[d.rs1].value >= x[d.rs2].value) pc += d.immediate>>1; else pc++;}};
default: return null;
}
}
case Decode.opStore -> // Store
{switch(d.funct3)
{case Decode.f3_sb: return d.new S("sb")
{public void action()
{pc++;
memory[x[d.rs1].value+d.immediate] = (byte) (x[d.rs2].value>>>0 & 0xff);
}
};
case Decode.f3_sh: return d.new S("sh")
{public void action()
{pc++;
memory[x[d.rs1].value+d.immediate] = (byte) (x[d.rs2].value>>>0 & 0xff);
memory[x[d.rs1].value+d.immediate+1] = (byte)((x[d.rs2].value>>>8) & 0xff);
}
};
case Decode.f3_sw: return d.new S("sw")
{public void action()
{pc++;
memory[x[d.rs1].value+d.immediate+0] = (byte)((x[d.rs2].value>>> 0) & 0xff);
memory[x[d.rs1].value+d.immediate+1] = (byte)((x[d.rs2].value>>> 8) & 0xff);
memory[x[d.rs1].value+d.immediate+2] = (byte)((x[d.rs2].value>>>16) & 0xff);
memory[x[d.rs1].value+d.immediate+3] = (byte)((x[d.rs2].value>>>24) & 0xff);
}
};
default: return null;
}
}
case Decode.opLoad -> // Load
{switch(d.funct3)
{case Decode.f3_lb: return d.new I("lb")
{public void action()
{pc++;
x[d.rd].value = memory[x[d.rs1].value+d.immediate];
}
};
case Decode.f3_lbu: return d.new I("lbu")
{public void action()
{pc++;
x[d.rd].value = (memory[x[d.rs1].value+d.immediate]<<24)>>24;
}
};
case Decode.f3_lh: return d.new I("lh")
{public void action()
{pc++;
x[d.rd].value = memory[x[d.rs1].value+d.immediate] |
(memory[x[d.rs1].value+d.immediate+1] << 8);
}
};
case Decode.f3_lhu: return d.new I("lhu")
{public void action()
{pc++;
x[d.rd].value = (memory[x[d.rs1].value+d.immediate] |
(memory[x[d.rs1].value+d.immediate+1] << 8)<<16)>>16;
}
};
case Decode.f3_lw: return d.new I("lw")
{public void action()
{pc++;
x[d.rd].value = memory[x[d.rs1].value+d.immediate+0]
| memory[x[d.rs1].value+d.immediate+1] << 8
| memory[x[d.rs1].value+d.immediate+2] << 16
| memory[x[d.rs1].value+d.immediate+3] << 24;
}
};
default: return null;
}
}
case Decode.opJal -> {return d.new J("jal") // Jump and Link
{public void action()
{if (d.rd > 0) x[d.rd].value = (pc+1)<<1; // PC in 2 byte blocks
pc += d.immediate;
}
};}
case Decode.opJalr -> // Jump and Link register
{switch(d.funct3)
{case Decode.f3_jalr: return d.new I("jalr")
{public void action()
{if (d.rd > 0) x[d.rd].value = (pc+1)<<1;
pc = (d.rs1 > 0 ? x[d.rs1].value : 0) + d.immediate;
}
};
default: return null;
}
}
case Decode.opLui -> // Load upper immediate
{return d.new U("lui")
{public void action()
{++pc;
if (d.rd > 0) x[d.rd].value = d.immediate << 12;
}
};
}
case Decode.opAuiPc -> // Add upper immediate to program counter
{return d.new U("auipc")
{public void action()
{++pc;
x[d.rd].value = pc + d.immediate << 12;
}
};
}
case Decode.opEcall -> // Transfer call to operating system
{return d.new I("ecall")
{public void action()
{++pc;
ecall.push(RiscV.this.toString());
}
};
}
default -> {return null;}
}
}
static int encodeBImmediate(int Immediate) // Encode a B format immediate operand.
{final int i = Immediate >> 1; // The immediate parameter gives us the number of bytes in the offset, but this is guaranteed to be a multiple of two see page 22, riscv-spec-20191213.pdf.
final int a = (((i >>> 11) << 31) & Decode.B.m_31_31);
final int b = (((i >>> 4) << 25) & Decode.B.m_30_25);
final int c = (((i >>> 0) << 8) & Decode.B.m_11_08);
final int d = (((i >>> 10) << 7) & Decode.B.m_07_07);
return a|b|c|d;
}
Encode encodeB(int opCode, Register rs1, Register rs2, int subType, Label label) // Encode a B format instruction
{return new Encode(opCode, null, rs1, rs2, 0, 0, 0, subType, 0, label);
}
Encode encodeI(int opCode, Register rd, Register rs1, int funct3, int Immediate) // Encode an I format instruction
{final int i = encodeIImmediate(Immediate);
return new Encode(opCode, rd, rs1, null, funct3, 0, 0, 0, i);
}
static int encodeIImmediate(int Immediate) // Encode the immediate field of a J format instruction
{return Immediate << Decode.I.p_immediate;
}
Encode encodeI(int opCode, Register rd, Register rs1, int funct3, Label label)// Encode an I format instruction
{return new Encode(opCode, rd, rs1, null, funct3, 0, 0, 0, 0, label);
}
static int encodeJImmediate(int Immediate) // Encode the immediate field of a J format instruction
{final int i = Immediate;
final int a = ((i >>> 19) << 31) & Decode.J.m_31_31;
final int b = (i >>> 0) << 21 & Decode.J.m_30_21;
final int c = ((i >>> 10) << 20) & Decode.J.m_20_20;
final int d = ((i >>> 0) << 1) & Decode.J.m_19_12;
return a|b|c|d;
}
Encode encodeJ(int opCode, Register rd, Label label) // Encode a J format instruction
{return new Encode(opCode, rd, null, null, 0, 0, 0, 0, 0, label);
}
Encode encodeR(int opCode, Register rd, Register rs1, Register rs2, int funct3, int funct7)
{return new Encode(opCode, rd, rs1, rs2, funct3, 0, funct7, 0, 0);
}
Encode encodeRa(int opCode, int funct5, Register rd, Register rs1, Register rs2, int funct3, int aq, int rl)
{return new Encode(opCode, rd, rs1, rs2, funct3, funct5, 0, 0, 0, aq, rl, null);
}
static int encodeSImmediate(int Immediate) // Encode the immediate field of an S format instruction
{final int i = Immediate;
final int a = ((i >>> 5) << 25) & Decode.S.m_31_25;
final int b = ((i >>> 0) << 7) & Decode.S.m_11_07;
return a|b;
}
Encode encodeS(int opCode, Register rs1, Register rs2, int funct3, int Immediate) // Encode an S format instruction
{final int i = encodeSImmediate(Immediate);
return new Encode(opCode, null, rs1, rs2, funct3, 0, 0, 0, i);
}
Encode encodeU(int opCode, Register rd, int Immediate) // Encode a U format instruction
{return new Encode(opCode, rd, null, null, 0, 0, 0, 0,
Immediate << Decode.U.p_immediate);
}
Encode encodeU(int opCode, Register rd, Label label) // Encode a U format instruction
{return new Encode(opCode, rd, null, null, 0, 0, 0, 0, 0, label);
}
static int encodeUImmediate(int Immediate) // Encode the immediate field of a J format instruction
{return Immediate << Decode.U.p_immediate;
}
//D1 Instructions // Instructions
//D2 RV32I // Base integer instruction set v2.1
/*
https://www.cs.sfu.ca/~ashriram/Courses/CS295/assets/notebooks/RISCV/RISCV_CARD.pdf
Inst Name FMT Opcode funct3 funct7 Description (C) Note-
add ADD R 0110011 0x0 0x00 rd = rs1 + rs2
sub SUB R 0110011 0x0 0x20 rd = rs1 - rs2
xor XOR R 0110011 0x4 0x00 rd = rs1 Ë rs2
or OR R 0110011 0x6 0x00 rd = rs1 | rs2
and AND R 0110011 0x7 0x00 rd = rs1 & rs2
sll Shift Left Logical R 0110011 0x1 0x00 rd = rs1 << rs2
srl Shift Right Logical R 0110011 0x5 0x00 rd = rs1 >> rs2
sra Shift Right Arith* R 0110011 0x5 0x20 rd = rs1 >> rs2 msb-extends
slt Set Less Than R 0110011 0x2 0x00 rd = (rs1 < rs2)?1:0
sltu Set Less Than (U) R 0110011 0x3 0x00 rd = (rs1 < rs2)?1:0 zero-extends
*/
Encode add(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 0, 0);}
Encode sub(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 0, 2);}
Encode xor(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 4, 0);}
Encode or(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 6, 0);}
Encode and(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 7, 0);}
Encode sll(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 1, 0);}
Encode srl(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 5, 0);}
Encode sra(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 5, 2);}
Encode slt(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 2, 0);}
Encode sltu(Register rd, Register rs1, Register rs2) {return encodeR(0b011_0011, rd, rs1, rs2, 3, 0);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
addi ADD Immediate I 0010011 0x0 rd = rs1 + imm
xori XOR Immediate I 0010011 0x4 rd = rs1 Ë imm
ori OR Immediate I 0010011 0x6 rd = rs1 | imm
andi AND Immediate I 0010011 0x7 rd = rs1 & imm
slli Shift Left Logical Imm I 0010011 0x1 imm[5:11]=0x00 rd = rs1 << imm[0:4]
srli Shift Right Logical Imm I 0010011 0x5 imm[5:11]=0x00 rd = rs1 >> imm[0:4]
srai Shift Right Arith Imm I 0010011 0x5 imm[5:11]=0x20 rd = rs1 >> imm[0:4] msb-extends
slti Set Less Than Imm I 0010011 0x2 rd = (rs1 < imm)?1:0
sltiu Set Less Than Imm (U) I 0010011 0x3 rd = (rs1 < imm)?1:0 zero-extends
*/
Encode addi(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x0, immediate & 0xfff);}
Encode xori(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x4, immediate & 0xfff);}
Encode ori(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x6, immediate & 0xfff);}
Encode andi(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x7, immediate & 0xfff);}
Encode slli(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x1, immediate & 0b1_1111);}
Encode srli(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x5, immediate & 0b1_1111);}
Encode srai(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x5, (immediate & 0b1_1111) & (2<<5));}
Encode slti(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x2, immediate & 0xfff);}
Encode sltiu(Register rd, Register rs1, int immediate) {return encodeI(0b001_0011, rd, rs1, 0x3, immediate & 0xfff);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
lb Load Byte I 0000011 0x0 rd = M[rs1+imm][0:7]
lh Load Half I 0000011 0x1 rd = M[rs1+imm][0:15]
lw Load Word I 0000011 0x2 rd = M[rs1+imm][0:31]
lbu Load Byte (U) I 0000011 0x4 rd = M[rs1+imm][0:7] zero-extends
lhu Load Half (U) I 0000011 0x5 rd = M[rs1+imm][0:15] zero-extends
*/
Encode lb(Register rd, Register rs1, int immediate) {return encodeI(0b000_0011, rd, rs1, 0x0, immediate & 0xff);}
Encode lh(Register rd, Register rs1, int immediate) {return encodeI(0b000_0011, rd, rs1, 0x1, immediate & 0xffff);}
Encode lw(Register rd, Register rs1, int immediate) {return encodeI(0b000_0011, rd, rs1, 0x2, immediate & 0xffff_ffff);}
Encode lbu(Register rd, Register rs1, int immediate) {return encodeI(0b000_0011, rd, rs1, 0x4, immediate & 0xff);}
Encode lhu(Register rd, Register rs1, int immediate) {return encodeI(0b000_0011, rd, rs1, 0x5, immediate & 0xffff);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
sb Store Byte S 0100011 0x0 M[rs1+imm][0:7] = rs2[0:7]
sh Store Half S 0100011 0x1 M[rs1+imm][0:15] = rs2[0:15]
sw Store Word S 0100011 0x2 M[rs1+imm][0:31] = rs2[0:31]
*/
Encode sb(Register rs1, Register rs2, int immediate) {return encodeS(0b010_0011, rs1, rs2, 0, immediate);}
Encode sh(Register rs1, Register rs2, int immediate) {return encodeS(0b010_0011, rs1, rs2, 1, immediate);}
Encode sw(Register rs1, Register rs2, int immediate) {return encodeS(0b010_0011, rs1, rs2, 2, immediate);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
beq Branch == B 1100011 0x0 if(rs1 == rs2) PC += imm
bne Branch != B 1100011 0x1 if(rs1 != rs2) PC += imm
blt Branch < B 1100011 0x4 if(rs1 < rs2) PC += imm
bge Branch ⥠B 1100011 0x5 if(rs1 >= rs2) PC += imm
bltu Branch < (U) B 1100011 0x6 if(rs1 < rs2) PC += imm zero-extends
bgeu Branch ⥠(U) B 1100011 0x7 if(rs1 >= rs2) PC += imm zero-extends
*/
Encode beq(Register rs1, Register rs2, Label l) {return encodeB(0b110_0011, rs1, rs2, 0, l);}
Encode bne(Register rs1, Register rs2, Label l) {return encodeB(0b110_0011, rs1, rs2, 1, l);}
Encode blt(Register rs1, Register rs2, Label l) {return encodeB(0b110_0011, rs1, rs2, 4, l);}
Encode bge(Register rs1, Register rs2, Label l) {return encodeB(0b110_0011, rs1, rs2, 5, l);}
Encode bltu(Register rs1, Register rs2, Label l) {return encodeB(0b110_0011, rs1, rs2, 6, l);}
Encode bgeu(Register rs1, Register rs2, Label l) {return encodeB(0b110_0011, rs1, rs2, 7, l);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
jal Jump And Link J 1101111 rd = PC+4; PC += imm
jalr Jump And Link Reg I 1100111 0x0 rd = PC+4; PC = rs1 + imm
*/
Encode jal (Register rd, Label l) {return encodeJ(0b110_1111, rd, l);}
Encode jalr(Register rd, Register rs1, Label l) {return encodeI(0b110_0111, rd, rs1, 0, l);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
lui Load Upper Imm U 0110111 rd = imm << 12
*/
Encode lui(Register rd, int immediate) {return encodeU(0b011_0111, rd, immediate & 0xfff);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
auipc Add Upper Imm to PC U 0010111 rd = PC + (imm << 12)
*/
Encode auipc(Register rd, int immediate) {return encodeU(0b001_0111, rd, immediate & 0xfff);}
Encode auipc(Register rd, Label l) {return encodeU(0b001_0111, rd, l);}
/*
Inst Name FMT Opcode funct3 funct7 Description (C) Note
ecall Environment Call I 1110011 0x0 imm=0x0 Transfer control to OS
ebreak Environment Break I 1110011 0x0 imm=0x1 Transfer control to debug
*/
Encode ecall() {return encodeI(0b111_0011, null, null, 0, 0);}
Encode ebreak() {return encodeI(0b111_0011, null, null, 0, 1);}
//D1 Utility routines // Utility routines
//D2 Numeric routines // Numeric routines
static double max(double n, double...rest) // Maximum number from a list of one or more numbers
{double m = n;
for (int i = 0; i < rest.length; ++i) m = rest[i] > m ? rest[i] : m;
return m;
}
static double min(double n, double...rest) // Minimum number from a list of one or more numbers
{double m = n;
for (int i = 0; i < rest.length; ++i) m = rest[i] < m ? rest[i] : m;
return m;
}
int nextPowerOfTwo(int n) // If this is a power of two return it, else return the next power of two greater than this number
{int p = 1;
for (int i = 0; i < 32; ++i, p *= 2) if (p >= n) return p;
stop("Cannot find next power of two for", n);
return -1;
}
int logTwo(int n) // Log 2 of containing power of 2
{int p = 1;
for (int i = 0; i < 32; ++i, p *= 2) if (p >= n) return i;
stop("Cannot find log two for", n);
return -1;
}
static int powerTwo(int n) {return 1 << n;} // Power of 2
static int powerOf (int a, int b) // Raise a to the power b
{int v = 1; for (int i = 0; i < b; ++i) v *= a; return v;
}
//D1 Labels // Labels are used to define locations in code
class Label // Label defining a location in code
{final String name; // Name of label
int offset = 0; // Instruction following label if known
Label(String Name) // Create label assumed to be just after the current instruction
{name = Name;
offset = code.size();
labels.put(name, this); // Index label
}
void set() {offset = code.size();} // Set a label to the current point in the code
}
//D1 Variables // Variables are symbolic names for fixed locations in memory
class Variable // Variable/Array definition
{final String name; // Name of
final int at; // Offset of variable either from start of memory or from start of a structure
final int width; // Width of variable
final int size; // Number of elements in variable
Variable(String Name, int Width, int Size) // Create variable
{name = Name; width = Width; size = Size;
pVariables = (at = pVariables) + width * size; // Offset of this variable
variables.put(name, this); // Save variable
}
int at(int i) {return at;} // Offset to an element in an array
int at() {return at(0);} // Offset to start of variable
}
//D0
static void test_immediate_b() // Immediate b
{final int N = powerTwo(10);
if(true)
{final int i = 3;
final int e = encodeBImmediate(+i*2);
final int d = Decode.B.immediate(e);
ok(d, +i*2);
}
for (int i = 0; i < N; i++)
{final int e = encodeBImmediate(+i*2);
final int d = Decode.B.immediate(e);
ok(d, +i*2);
}
for (int i = 0; i < N; i++)
{final int e = encodeBImmediate(-i*2);
final int d = Decode.B.immediate(e);
ok(d, -i*2);
}
ok(encodeBImmediate(-2), Decode.B.m_31_31|Decode.B.m_30_25|Decode.B.m_11_08|Decode.B.m_07_07);
}
static void test_immediate_j() // Immediate j
{final int N = powerTwo(19);
for (int i = 1; i < N; i++)
{final int e = encodeJImmediate(+i);
final int d = Decode.J.immediate(e);
ok(d, +i);
}
for (int i = 0; i < N; i++)
{final int e = encodeJImmediate(-i);
final int d = Decode.J.immediate(e);
ok(d, -i);
}
ok(encodeJImmediate(-1), Decode.J.m_31_31|Decode.J.m_30_21|Decode.J.m_20_20|Decode.J.m_19_12);
}
static void test_immediate_s() // Immediate s
{final int N = powerTwo(11);
for (int i = 1; i < N; i++)
{final int e = encodeSImmediate(+i);
final int d = Decode.S.immediate(e);
ok(d, +i);
}
for (int i = 0; i < N; i++)
{final int e = encodeSImmediate(-i);
final int d = Decode.S.immediate(e);
ok(d, -i);
}
ok(encodeSImmediate(-1), Decode.S.m_31_25 | Decode.S.m_11_07);
}
static void test_add() // Add
{RiscV r = new RiscV();
r.addi(r.x31, r.x0, 2);
r.add (r.x30, r.x31, r.x31);
ok(r.decode(r.code.elementAt(0)), "I 0010011 addi rd=31 rs1= 0 funct3= 0 imm=0x2, 2");
ok(r.decode(r.code.elementAt(1)), "R 0110011 add rd=30 rs1=31 rs2=31 funct3= 0 funct7= 0");
r.emulate();
ok(r.x31, 2);
ok(r.x30, 4);
}
static void test_slt() // Fibonacci
{RiscV r = new RiscV(); // New Risc V machine and program
Register z = r.x0; // Zero
Register a = r.x1; // A
Register b = r.x2; // B
Register c = r.x31; // C = A < B
Register d = r.x30; // D = A >= B
r.addi(a, z, 10);
r.addi(b, z, 201);
r.slt (c, a, b); // a < b
r.slt (d, b, a); // a >= b
r.emulate(); // Run the program
r.ok("""
RiscV : slt
Step : 5