-
Notifications
You must be signed in to change notification settings - Fork 25
/
Copy pathcpu.rs
438 lines (422 loc) · 17 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
//! The cpu module contains `Cpu` and implementarion for it.
use crate::bus::*;
use crate::dram::*;
/// The `Cpu` struct that contains registers, a program coutner, system bus that connects
/// peripheral devices, and control and status registers.
pub struct Cpu {
/// 32 64-bit integer registers.
pub regs: [u64; 32],
/// Program counter to hold the the dram address of the next instruction that would be executed.
pub pc: u64,
/// System bus that transfers data between CPU and peripheral devices.
pub bus: Bus,
}
impl Cpu {
/// Create a new `Cpu` object.
pub fn new(binary: Vec<u8>) -> Self {
// The stack pointer (SP) must be set up at first.
let mut regs = [0; 32];
regs[2] = DRAM_BASE + DRAM_SIZE;
Self {
regs,
// The program counter starts from the start address of a dram.
pc: DRAM_BASE,
bus: Bus::new(binary),
}
}
/// Print values in all registers (x0-x31).
pub fn dump_registers(&self) {
let mut output = String::from("");
let abi = [
"zero", " ra ", " sp ", " gp ", " tp ", " t0 ", " t1 ", " t2 ", " s0 ", " s1 ", " a0 ",
" a1 ", " a2 ", " a3 ", " a4 ", " a5 ", " a6 ", " a7 ", " s2 ", " s3 ", " s4 ", " s5 ",
" s6 ", " s7 ", " s8 ", " s9 ", " s10", " s11", " t3 ", " t4 ", " t5 ", " t6 ",
];
for i in (0..32).step_by(4) {
output = format!(
"{}\n{}",
output,
format!(
"x{:02}({})={:>#18x} x{:02}({})={:>#18x} x{:02}({})={:>#18x} x{:02}({})={:>#18x}",
i,
abi[i],
self.regs[i],
i + 1,
abi[i + 1],
self.regs[i + 1],
i + 2,
abi[i + 2],
self.regs[i + 2],
i + 3,
abi[i + 3],
self.regs[i + 3],
)
);
}
println!("{}", output);
}
/// Load a value from a dram.
pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, ()> {
self.bus.load(addr, size)
}
/// Store a value to a dram.
pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {
self.bus.store(addr, size, value)
}
/// Get an instruction from the dram.
pub fn fetch(&mut self) -> Result<u64, ()> {
match self.bus.load(self.pc, 32) {
Ok(inst) => Ok(inst),
Err(_e) => Err(()),
}
}
/// Execute an instruction after decoding. Return true if an error happens, otherwise false.
pub fn execute(&mut self, inst: u64) -> Result<(), ()> {
let opcode = inst & 0x7f;
let rd = ((inst >> 7) & 0x1f) as usize;
let rs1 = ((inst >> 15) & 0x1f) as usize;
let rs2 = ((inst >> 20) & 0x1f) as usize;
let funct3 = (inst >> 12) & 0x7;
let funct7 = (inst >> 25) & 0x7f;
// Emulate that register x0 is hardwired with all bits equal to 0.
self.regs[0] = 0;
match opcode {
0x03 => {
// imm[11:0] = inst[31:20]
let imm = ((inst as i32 as i64) >> 20) as u64;
let addr = self.regs[rs1].wrapping_add(imm);
match funct3 {
0x0 => {
// lb
let val = self.load(addr, 8)?;
self.regs[rd] = val as i8 as i64 as u64;
}
0x1 => {
// lh
let val = self.load(addr, 16)?;
self.regs[rd] = val as i16 as i64 as u64;
}
0x2 => {
// lw
let val = self.load(addr, 32)?;
self.regs[rd] = val as i32 as i64 as u64;
}
0x3 => {
// ld
let val = self.load(addr, 64)?;
self.regs[rd] = val;
}
0x4 => {
// lbu
let val = self.load(addr, 8)?;
self.regs[rd] = val;
}
0x5 => {
// lhu
let val = self.load(addr, 16)?;
self.regs[rd] = val;
}
0x6 => {
// lwu
let val = self.load(addr, 32)?;
self.regs[rd] = val;
}
_ => {
println!(
"not implemented yet: opcode {:#x} funct3 {:#x}",
opcode, funct3
);
return Err(());
}
}
}
0x13 => {
// imm[11:0] = inst[31:20]
let imm = ((inst & 0xfff00000) as i32 as i64 >> 20) as u64;
// "The shift amount is encoded in the lower 6 bits of the I-immediate field for RV64I."
let shamt = (imm & 0x3f) as u32;
match funct3 {
0x0 => {
// addi
self.regs[rd] = self.regs[rs1].wrapping_add(imm);
}
0x1 => {
// slli
self.regs[rd] = self.regs[rs1] << shamt;
}
0x2 => {
// slti
self.regs[rd] = if (self.regs[rs1] as i64) < (imm as i64) {
1
} else {
0
};
}
0x3 => {
// sltiu
self.regs[rd] = if self.regs[rs1] < imm { 1 } else { 0 };
}
0x4 => {
// xori
self.regs[rd] = self.regs[rs1] ^ imm;
}
0x5 => {
match funct7 >> 1 {
// srli
0x00 => self.regs[rd] = self.regs[rs1].wrapping_shr(shamt),
// srai
0x10 => {
self.regs[rd] = (self.regs[rs1] as i64).wrapping_shr(shamt) as u64
}
_ => {}
}
}
0x6 => self.regs[rd] = self.regs[rs1] | imm, // ori
0x7 => self.regs[rd] = self.regs[rs1] & imm, // andi
_ => {}
}
}
0x17 => {
// auipc
let imm = (inst & 0xfffff000) as i32 as i64 as u64;
self.regs[rd] = self.pc.wrapping_add(imm).wrapping_sub(4);
}
0x1b => {
let imm = ((inst as i32 as i64) >> 20) as u64;
// "SLLIW, SRLIW, and SRAIW encodings with imm[5] ̸= 0 are reserved."
let shamt = (imm & 0x1f) as u32;
match funct3 {
0x0 => {
// addiw
self.regs[rd] = self.regs[rs1].wrapping_add(imm) as i32 as i64 as u64;
}
0x1 => {
// slliw
self.regs[rd] = self.regs[rs1].wrapping_shl(shamt) as i32 as i64 as u64;
}
0x5 => {
match funct7 {
0x00 => {
// srliw
self.regs[rd] = (self.regs[rs1] as u32).wrapping_shr(shamt) as i32
as i64 as u64;
}
0x20 => {
// sraiw
self.regs[rd] =
(self.regs[rs1] as i32).wrapping_shr(shamt) as i64 as u64;
}
_ => {
println!(
"not implemented yet: opcode {:#x} funct7 {:#x}",
opcode, funct7
);
return Err(());
}
}
}
_ => {
println!(
"not implemented yet: opcode {:#x} funct3 {:#x}",
opcode, funct3
);
return Err(());
}
}
}
0x23 => {
// imm[11:5|4:0] = inst[31:25|11:7]
let imm = (((inst & 0xfe000000) as i32 as i64 >> 20) as u64) | ((inst >> 7) & 0x1f);
let addr = self.regs[rs1].wrapping_add(imm);
match funct3 {
0x0 => self.store(addr, 8, self.regs[rs2])?, // sb
0x1 => self.store(addr, 16, self.regs[rs2])?, // sh
0x2 => self.store(addr, 32, self.regs[rs2])?, // sw
0x3 => self.store(addr, 64, self.regs[rs2])?, // sd
_ => {}
}
}
0x33 => {
// "SLL, SRL, and SRA perform logical left, logical right, and arithmetic right
// shifts on the value in register rs1 by the shift amount held in register rs2.
// In RV64I, only the low 6 bits of rs2 are considered for the shift amount."
let shamt = ((self.regs[rs2] & 0x3f) as u64) as u32;
match (funct3, funct7) {
(0x0, 0x00) => {
// add
self.regs[rd] = self.regs[rs1].wrapping_add(self.regs[rs2]);
}
(0x0, 0x01) => {
// mul
self.regs[rd] = self.regs[rs1].wrapping_mul(self.regs[rs2]);
}
(0x0, 0x20) => {
// sub
self.regs[rd] = self.regs[rs1].wrapping_sub(self.regs[rs2]);
}
(0x1, 0x00) => {
// sll
self.regs[rd] = self.regs[rs1].wrapping_shl(shamt);
}
(0x2, 0x00) => {
// slt
self.regs[rd] = if (self.regs[rs1] as i64) < (self.regs[rs2] as i64) {
1
} else {
0
};
}
(0x3, 0x00) => {
// sltu
self.regs[rd] = if self.regs[rs1] < self.regs[rs2] {
1
} else {
0
};
}
(0x4, 0x00) => {
// xor
self.regs[rd] = self.regs[rs1] ^ self.regs[rs2];
}
(0x5, 0x00) => {
// srl
self.regs[rd] = self.regs[rs1].wrapping_shr(shamt);
}
(0x5, 0x20) => {
// sra
self.regs[rd] = (self.regs[rs1] as i64).wrapping_shr(shamt) as u64;
}
(0x6, 0x00) => {
// or
self.regs[rd] = self.regs[rs1] | self.regs[rs2];
}
(0x7, 0x00) => {
// and
self.regs[rd] = self.regs[rs1] & self.regs[rs2];
}
_ => {
println!(
"not implemented yet: opcode {:#x} funct3 {:#x} funct7 {:#x}",
opcode, funct3, funct7
);
return Err(());
}
}
}
0x37 => {
// lui
self.regs[rd] = (inst & 0xfffff000) as i32 as i64 as u64;
}
0x3b => {
// "The shift amount is given by rs2[4:0]."
let shamt = (self.regs[rs2] & 0x1f) as u32;
match (funct3, funct7) {
(0x0, 0x00) => {
// addw
self.regs[rd] =
self.regs[rs1].wrapping_add(self.regs[rs2]) as i32 as i64 as u64;
}
(0x0, 0x20) => {
// subw
self.regs[rd] =
((self.regs[rs1].wrapping_sub(self.regs[rs2])) as i32) as u64;
}
(0x1, 0x00) => {
// sllw
self.regs[rd] = (self.regs[rs1] as u32).wrapping_shl(shamt) as i32 as u64;
}
(0x5, 0x00) => {
// srlw
self.regs[rd] = (self.regs[rs1] as u32).wrapping_shr(shamt) as i32 as u64;
}
(0x5, 0x20) => {
// sraw
self.regs[rd] = ((self.regs[rs1] as i32) >> (shamt as i32)) as u64;
}
_ => {
println!(
"not implemented yet: opcode {:#x} funct3 {:#x} funct7 {:#x}",
opcode, funct3, funct7
);
return Err(());
}
}
}
0x63 => {
// imm[12|10:5|4:1|11] = inst[31|30:25|11:8|7]
let imm = (((inst & 0x80000000) as i32 as i64 >> 19) as u64)
| ((inst & 0x80) << 4) // imm[11]
| ((inst >> 20) & 0x7e0) // imm[10:5]
| ((inst >> 7) & 0x1e); // imm[4:1]
match funct3 {
0x0 => {
// beq
if self.regs[rs1] == self.regs[rs2] {
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
}
0x1 => {
// bne
if self.regs[rs1] != self.regs[rs2] {
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
}
0x4 => {
// blt
if (self.regs[rs1] as i64) < (self.regs[rs2] as i64) {
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
}
0x5 => {
// bge
if (self.regs[rs1] as i64) >= (self.regs[rs2] as i64) {
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
}
0x6 => {
// bltu
if self.regs[rs1] < self.regs[rs2] {
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
}
0x7 => {
// bgeu
if self.regs[rs1] >= self.regs[rs2] {
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
}
_ => {
println!(
"not implemented yet: opcode {:#x} funct3 {:#x}",
opcode, funct3
);
return Err(());
}
}
}
0x67 => {
// jalr
// Note: Don't add 4 because the pc already moved on.
let t = self.pc;
let imm = ((((inst & 0xfff00000) as i32) as i64) >> 20) as u64;
self.pc = (self.regs[rs1].wrapping_add(imm)) & !1;
self.regs[rd] = t;
}
0x6f => {
// jal
self.regs[rd] = self.pc;
// imm[20|10:1|11|19:12] = inst[31|30:21|20|19:12]
let imm = (((inst & 0x80000000) as i32 as i64 >> 11) as u64) // imm[20]
| (inst & 0xff000) // imm[19:12]
| ((inst >> 9) & 0x800) // imm[11]
| ((inst >> 20) & 0x7fe); // imm[10:1]
self.pc = self.pc.wrapping_add(imm).wrapping_sub(4);
}
_ => {
dbg!(format!("not implemented yet: opcode {:#x}", opcode));
return Err(());
}
}
return Ok(());
}
}