Merge sasid into sptbr
[riscv-isa-sim.git] / riscv / processor.cc
1 // See LICENSE for license details.
2
3 #include "processor.h"
4 #include "extension.h"
5 #include "common.h"
6 #include "config.h"
7 #include "sim.h"
8 #include "mmu.h"
9 #include "htif.h"
10 #include "disasm.h"
11 #include "gdbserver.h"
12 #include <cinttypes>
13 #include <cmath>
14 #include <cstdlib>
15 #include <iostream>
16 #include <assert.h>
17 #include <limits.h>
18 #include <stdexcept>
19 #include <algorithm>
20
21 #undef STATE
22 #define STATE state
23
24 processor_t::processor_t(const char* isa, sim_t* sim, uint32_t id,
25 bool halt_on_reset)
26 : debug(false), sim(sim), ext(NULL), disassembler(new disassembler_t),
27 id(id), run(false), halt_on_reset(halt_on_reset)
28 {
29 parse_isa_string(isa);
30
31 mmu = new mmu_t(sim, this);
32
33 reset(true);
34
35 register_base_instructions();
36 }
37
38 processor_t::~processor_t()
39 {
40 #ifdef RISCV_ENABLE_HISTOGRAM
41 if (histogram_enabled)
42 {
43 fprintf(stderr, "PC Histogram size:%zu\n", pc_histogram.size());
44 for (auto it : pc_histogram)
45 fprintf(stderr, "%0" PRIx64 " %" PRIu64 "\n", it.first, it.second);
46 }
47 #endif
48
49 delete mmu;
50 delete disassembler;
51 }
52
53 static void bad_isa_string(const char* isa)
54 {
55 fprintf(stderr, "error: bad --isa option %s\n", isa);
56 abort();
57 }
58
59 void processor_t::parse_isa_string(const char* str)
60 {
61 std::string lowercase, tmp;
62 for (const char *r = str; *r; r++)
63 lowercase += std::tolower(*r);
64
65 const char* p = lowercase.c_str();
66 const char* all_subsets = "imafdc";
67
68 max_xlen = 64;
69 isa = reg_t(2) << 62;
70
71 if (strncmp(p, "rv32", 4) == 0)
72 max_xlen = 32, isa = reg_t(1) << 30, p += 4;
73 else if (strncmp(p, "rv64", 4) == 0)
74 p += 4;
75 else if (strncmp(p, "rv", 2) == 0)
76 p += 2;
77
78 if (!*p) {
79 p = all_subsets;
80 } else if (*p == 'g') { // treat "G" as "IMAFD"
81 tmp = std::string("imafd") + (p+1);
82 p = &tmp[0];
83 } else if (*p != 'i') {
84 bad_isa_string(str);
85 }
86
87 isa_string = "rv" + std::to_string(max_xlen) + p;
88 isa |= 1L << ('s' - 'a'); // advertise support for supervisor mode
89
90 while (*p) {
91 isa |= 1L << (*p - 'a');
92
93 if (auto next = strchr(all_subsets, *p)) {
94 all_subsets = next + 1;
95 p++;
96 } else if (*p == 'x') {
97 const char* ext = p+1, *end = ext;
98 while (islower(*end))
99 end++;
100 register_extension(find_extension(std::string(ext, end - ext).c_str())());
101 p = end;
102 } else {
103 bad_isa_string(str);
104 }
105 }
106
107 if (supports_extension('D') && !supports_extension('F'))
108 bad_isa_string(str);
109
110 // advertise support for supervisor and user modes
111 isa |= 1L << ('s' - 'a');
112 isa |= 1L << ('u' - 'a');
113 }
114
115 void state_t::reset()
116 {
117 memset(this, 0, sizeof(*this));
118 prv = PRV_M;
119 pc = DEFAULT_RSTVEC;
120 mtvec = DEFAULT_MTVEC;
121 load_reservation = -1;
122 }
123
124 void processor_t::set_debug(bool value)
125 {
126 debug = value;
127 if (ext)
128 ext->set_debug(value);
129 }
130
131 void processor_t::set_histogram(bool value)
132 {
133 histogram_enabled = value;
134 #ifndef RISCV_ENABLE_HISTOGRAM
135 if (value) {
136 fprintf(stderr, "PC Histogram support has not been properly enabled;");
137 fprintf(stderr, " please re-build the riscv-isa-run project using \"configure --enable-histogram\".\n");
138 }
139 #endif
140 }
141
142 void processor_t::reset(bool value)
143 {
144 if (run == !value)
145 return;
146 run = !value;
147
148 state.reset();
149 state.dcsr.halt = halt_on_reset;
150 halt_on_reset = false;
151 set_csr(CSR_MSTATUS, state.mstatus);
152
153 if (ext)
154 ext->reset(); // reset the extension
155 }
156
157 void processor_t::raise_interrupt(reg_t which)
158 {
159 throw trap_t(((reg_t)1 << (max_xlen-1)) | which);
160 }
161
162 static int ctz(reg_t val)
163 {
164 int res = 0;
165 if (val)
166 while ((val & 1) == 0)
167 val >>= 1, res++;
168 return res;
169 }
170
171 void processor_t::take_interrupt()
172 {
173 reg_t pending_interrupts = state.mip & state.mie;
174
175 reg_t mie = get_field(state.mstatus, MSTATUS_MIE);
176 reg_t m_enabled = state.prv < PRV_M || (state.prv == PRV_M && mie);
177 reg_t enabled_interrupts = pending_interrupts & ~state.mideleg & -m_enabled;
178
179 reg_t sie = get_field(state.mstatus, MSTATUS_SIE);
180 reg_t s_enabled = state.prv < PRV_S || (state.prv == PRV_S && sie);
181 enabled_interrupts |= pending_interrupts & state.mideleg & -s_enabled;
182
183 if (enabled_interrupts)
184 raise_interrupt(ctz(enabled_interrupts));
185 }
186
187 static bool validate_priv(reg_t priv)
188 {
189 return priv == PRV_U || priv == PRV_S || priv == PRV_M;
190 }
191
192 void processor_t::set_privilege(reg_t prv)
193 {
194 assert(validate_priv(prv));
195 mmu->flush_tlb();
196 state.prv = prv;
197 }
198
199 void processor_t::enter_debug_mode(uint8_t cause)
200 {
201 state.dcsr.cause = cause;
202 state.dcsr.prv = state.prv;
203 set_privilege(PRV_M);
204 state.dpc = state.pc;
205 state.pc = DEBUG_ROM_START;
206 //debug = true; // TODO
207 }
208
209 void processor_t::take_trap(trap_t& t, reg_t epc)
210 {
211 if (debug) {
212 fprintf(stderr, "core %3d: exception %s, epc 0x%016" PRIx64 "\n",
213 id, t.name(), epc);
214 if (t.has_badaddr())
215 fprintf(stderr, "core %3d: badaddr 0x%016" PRIx64 "\n", id,
216 t.get_badaddr());
217 }
218
219 if (t.cause() == CAUSE_BREAKPOINT && (
220 (state.prv == PRV_M && state.dcsr.ebreakm) ||
221 (state.prv == PRV_H && state.dcsr.ebreakh) ||
222 (state.prv == PRV_S && state.dcsr.ebreaks) ||
223 (state.prv == PRV_U && state.dcsr.ebreaku))) {
224 enter_debug_mode(DCSR_CAUSE_SWBP);
225 return;
226 }
227
228 if (state.dcsr.cause) {
229 state.pc = DEBUG_ROM_EXCEPTION;
230 return;
231 }
232
233 // by default, trap to M-mode, unless delegated to S-mode
234 reg_t bit = t.cause();
235 reg_t deleg = state.medeleg;
236 if (bit & ((reg_t)1 << (max_xlen-1)))
237 deleg = state.mideleg, bit &= ~((reg_t)1 << (max_xlen-1));
238 if (state.prv <= PRV_S && bit < max_xlen && ((deleg >> bit) & 1)) {
239 // handle the trap in S-mode
240 state.pc = state.stvec;
241 state.scause = t.cause();
242 state.sepc = epc;
243 if (t.has_badaddr())
244 state.sbadaddr = t.get_badaddr();
245
246 reg_t s = state.mstatus;
247 s = set_field(s, MSTATUS_SPIE, get_field(s, MSTATUS_UIE << state.prv));
248 s = set_field(s, MSTATUS_SPP, state.prv);
249 s = set_field(s, MSTATUS_SIE, 0);
250 set_csr(CSR_MSTATUS, s);
251 set_privilege(PRV_S);
252 } else {
253 state.pc = state.mtvec;
254 state.mepc = epc;
255 state.mcause = t.cause();
256 if (t.has_badaddr())
257 state.mbadaddr = t.get_badaddr();
258
259 reg_t s = state.mstatus;
260 s = set_field(s, MSTATUS_MPIE, get_field(s, MSTATUS_UIE << state.prv));
261 s = set_field(s, MSTATUS_MPP, state.prv);
262 s = set_field(s, MSTATUS_MIE, 0);
263 set_csr(CSR_MSTATUS, s);
264 set_privilege(PRV_M);
265 }
266
267 yield_load_reservation();
268 }
269
270 void processor_t::disasm(insn_t insn)
271 {
272 uint64_t bits = insn.bits() & ((1ULL << (8 * insn_length(insn.bits()))) - 1);
273 fprintf(stderr, "core %3d: 0x%016" PRIx64 " (0x%08" PRIx64 ") %s\n",
274 id, state.pc, bits, disassembler->disassemble(insn).c_str());
275 }
276
277 static bool validate_vm(int max_xlen, reg_t vm)
278 {
279 if (max_xlen == 64 && (vm == VM_SV39 || vm == VM_SV48))
280 return true;
281 if (max_xlen == 32 && vm == VM_SV32)
282 return true;
283 return vm == VM_MBARE;
284 }
285
286 static int paddr_bits(reg_t vm)
287 {
288 switch (vm) {
289 case VM_SV32: return 34;
290 case VM_SV39: return 50;
291 case VM_SV48: return 50;
292 default: abort();
293 }
294 }
295
296 void processor_t::set_csr(int which, reg_t val)
297 {
298 val = zext_xlen(val);
299 reg_t delegable_ints = MIP_SSIP | MIP_STIP | MIP_SEIP | (1 << IRQ_COP);
300 reg_t all_ints = delegable_ints | MIP_MSIP | MIP_MTIP;
301 switch (which)
302 {
303 case CSR_FFLAGS:
304 dirty_fp_state;
305 state.fflags = val & (FSR_AEXC >> FSR_AEXC_SHIFT);
306 break;
307 case CSR_FRM:
308 dirty_fp_state;
309 state.frm = val & (FSR_RD >> FSR_RD_SHIFT);
310 break;
311 case CSR_FCSR:
312 dirty_fp_state;
313 state.fflags = (val & FSR_AEXC) >> FSR_AEXC_SHIFT;
314 state.frm = (val & FSR_RD) >> FSR_RD_SHIFT;
315 break;
316 case CSR_MSTATUS: {
317 if ((val ^ state.mstatus) &
318 (MSTATUS_VM | MSTATUS_MPP | MSTATUS_MPRV | MSTATUS_PUM))
319 mmu->flush_tlb();
320
321 reg_t mask = MSTATUS_SIE | MSTATUS_SPIE | MSTATUS_MIE | MSTATUS_MPIE
322 | MSTATUS_SPP | MSTATUS_FS | MSTATUS_MPRV | MSTATUS_PUM
323 | (ext ? MSTATUS_XS : 0);
324
325 if (validate_vm(max_xlen, get_field(val, MSTATUS_VM)))
326 mask |= MSTATUS_VM;
327 if (validate_priv(get_field(val, MSTATUS_MPP)))
328 mask |= MSTATUS_MPP;
329
330 state.mstatus = (state.mstatus & ~mask) | (val & mask);
331
332 bool dirty = (state.mstatus & MSTATUS_FS) == MSTATUS_FS;
333 dirty |= (state.mstatus & MSTATUS_XS) == MSTATUS_XS;
334 if (max_xlen == 32)
335 state.mstatus = set_field(state.mstatus, MSTATUS32_SD, dirty);
336 else
337 state.mstatus = set_field(state.mstatus, MSTATUS64_SD, dirty);
338
339 // spike supports the notion of xlen < max_xlen, but current priv spec
340 // doesn't provide a mechanism to run RV32 software on an RV64 machine
341 xlen = max_xlen;
342 break;
343 }
344 case CSR_MIP: {
345 reg_t mask = MIP_SSIP | MIP_STIP;
346 state.mip = (state.mip & ~mask) | (val & mask);
347 break;
348 }
349 case CSR_MIE:
350 state.mie = (state.mie & ~all_ints) | (val & all_ints);
351 break;
352 case CSR_MIDELEG:
353 state.mideleg = (state.mideleg & ~delegable_ints) | (val & delegable_ints);
354 break;
355 case CSR_MEDELEG: {
356 reg_t mask = 0;
357 #define DECLARE_CAUSE(name, value) mask |= 1ULL << (value);
358 #include "encoding.h"
359 #undef DECLARE_CAUSE
360 state.medeleg = (state.medeleg & ~mask) | (val & mask);
361 break;
362 }
363 case CSR_MUCOUNTEREN:
364 state.mucounteren = val & 7;
365 break;
366 case CSR_MSCOUNTEREN:
367 state.mscounteren = val & 7;
368 break;
369 case CSR_SSTATUS: {
370 reg_t mask = SSTATUS_SIE | SSTATUS_SPIE | SSTATUS_SPP | SSTATUS_FS
371 | SSTATUS_XS | SSTATUS_PUM;
372 return set_csr(CSR_MSTATUS, (state.mstatus & ~mask) | (val & mask));
373 }
374 case CSR_SIP:
375 return set_csr(CSR_MIP,
376 (state.mip & ~state.mideleg) | (val & state.mideleg));
377 case CSR_SIE:
378 return set_csr(CSR_MIE,
379 (state.mie & ~state.mideleg) | (val & state.mideleg));
380 case CSR_SPTBR: {
381 // upper bits of sptbr are the ASID; we only support ASID = 0
382 reg_t vm = get_field(state.mstatus, MSTATUS_VM);
383 state.sptbr = val & (((reg_t)1 << (paddr_bits(vm) - PGSHIFT)) - 1);
384 break;
385 }
386 case CSR_SEPC: state.sepc = val; break;
387 case CSR_STVEC: state.stvec = val >> 2 << 2; break;
388 case CSR_SSCRATCH: state.sscratch = val; break;
389 case CSR_SCAUSE: state.scause = val; break;
390 case CSR_SBADADDR: state.sbadaddr = val; break;
391 case CSR_MEPC: state.mepc = val; break;
392 case CSR_MTVEC: state.mtvec = val >> 2 << 2; break;
393 case CSR_MSCRATCH: state.mscratch = val; break;
394 case CSR_MCAUSE: state.mcause = val; break;
395 case CSR_MBADADDR: state.mbadaddr = val; break;
396 case CSR_DCSR:
397 state.dcsr.prv = get_field(val, DCSR_PRV);
398 state.dcsr.step = get_field(val, DCSR_STEP);
399 // TODO: ndreset and fullreset
400 state.dcsr.ebreakm = get_field(val, DCSR_EBREAKM);
401 state.dcsr.ebreakh = get_field(val, DCSR_EBREAKH);
402 state.dcsr.ebreaks = get_field(val, DCSR_EBREAKS);
403 state.dcsr.ebreaku = get_field(val, DCSR_EBREAKU);
404 state.dcsr.halt = get_field(val, DCSR_HALT);
405 break;
406 case CSR_DPC:
407 state.dpc = val;
408 break;
409 case CSR_DSCRATCH:
410 state.dscratch = val;
411 break;
412 }
413 }
414
415 reg_t processor_t::get_csr(int which)
416 {
417 switch (which)
418 {
419 case CSR_FFLAGS:
420 require_fp;
421 if (!supports_extension('F'))
422 break;
423 return state.fflags;
424 case CSR_FRM:
425 require_fp;
426 if (!supports_extension('F'))
427 break;
428 return state.frm;
429 case CSR_FCSR:
430 require_fp;
431 if (!supports_extension('F'))
432 break;
433 return (state.fflags << FSR_AEXC_SHIFT) | (state.frm << FSR_RD_SHIFT);
434 case CSR_TIME:
435 case CSR_INSTRET:
436 case CSR_CYCLE:
437 if ((state.mucounteren >> (which & (xlen-1))) & 1)
438 return get_csr(which + (CSR_MCYCLE - CSR_CYCLE));
439 break;
440 case CSR_STIME:
441 case CSR_SINSTRET:
442 case CSR_SCYCLE:
443 if ((state.mscounteren >> (which & (xlen-1))) & 1)
444 return get_csr(which + (CSR_MCYCLE - CSR_SCYCLE));
445 break;
446 case CSR_MUCOUNTEREN: return state.mucounteren;
447 case CSR_MSCOUNTEREN: return state.mscounteren;
448 case CSR_MUCYCLE_DELTA: return 0;
449 case CSR_MUTIME_DELTA: return 0;
450 case CSR_MUINSTRET_DELTA: return 0;
451 case CSR_MSCYCLE_DELTA: return 0;
452 case CSR_MSTIME_DELTA: return 0;
453 case CSR_MSINSTRET_DELTA: return 0;
454 case CSR_MUCYCLE_DELTAH: if (xlen > 32) break; else return 0;
455 case CSR_MUTIME_DELTAH: if (xlen > 32) break; else return 0;
456 case CSR_MUINSTRET_DELTAH: if (xlen > 32) break; else return 0;
457 case CSR_MSCYCLE_DELTAH: if (xlen > 32) break; else return 0;
458 case CSR_MSTIME_DELTAH: if (xlen > 32) break; else return 0;
459 case CSR_MSINSTRET_DELTAH: if (xlen > 32) break; else return 0;
460 case CSR_MCYCLE: return state.minstret;
461 case CSR_MINSTRET: return state.minstret;
462 case CSR_MCYCLEH: if (xlen > 32) break; else return state.minstret >> 32;
463 case CSR_MINSTRETH: if (xlen > 32) break; else return state.minstret >> 32;
464 case CSR_SSTATUS: {
465 reg_t mask = SSTATUS_SIE | SSTATUS_SPIE | SSTATUS_SPP | SSTATUS_FS
466 | SSTATUS_XS | SSTATUS_PUM;
467 reg_t sstatus = state.mstatus & mask;
468 if ((sstatus & SSTATUS_FS) == SSTATUS_FS ||
469 (sstatus & SSTATUS_XS) == SSTATUS_XS)
470 sstatus |= (xlen == 32 ? SSTATUS32_SD : SSTATUS64_SD);
471 return sstatus;
472 }
473 case CSR_SIP: return state.mip & state.mideleg;
474 case CSR_SIE: return state.mie & state.mideleg;
475 case CSR_SEPC: return state.sepc;
476 case CSR_SBADADDR: return state.sbadaddr;
477 case CSR_STVEC: return state.stvec;
478 case CSR_SCAUSE:
479 if (max_xlen > xlen)
480 return state.scause | ((state.scause >> (max_xlen-1)) << (xlen-1));
481 return state.scause;
482 case CSR_SPTBR: return state.sptbr;
483 case CSR_SSCRATCH: return state.sscratch;
484 case CSR_MSTATUS: return state.mstatus;
485 case CSR_MIP: return state.mip;
486 case CSR_MIE: return state.mie;
487 case CSR_MEPC: return state.mepc;
488 case CSR_MSCRATCH: return state.mscratch;
489 case CSR_MCAUSE: return state.mcause;
490 case CSR_MBADADDR: return state.mbadaddr;
491 case CSR_MISA: return isa;
492 case CSR_MARCHID: return 0;
493 case CSR_MIMPID: return 0;
494 case CSR_MVENDORID: return 0;
495 case CSR_MHARTID: return id;
496 case CSR_MTVEC: return state.mtvec;
497 case CSR_MEDELEG: return state.medeleg;
498 case CSR_MIDELEG: return state.mideleg;
499 case CSR_TDRSELECT: return 0;
500 case CSR_DCSR:
501 {
502 uint32_t v = 0;
503 v = set_field(v, DCSR_XDEBUGVER, 1);
504 v = set_field(v, DCSR_HWBPCOUNT, 0);
505 v = set_field(v, DCSR_NDRESET, 0);
506 v = set_field(v, DCSR_FULLRESET, 0);
507 v = set_field(v, DCSR_PRV, state.dcsr.prv);
508 v = set_field(v, DCSR_STEP, state.dcsr.step);
509 v = set_field(v, DCSR_DEBUGINT, sim->debug_module.get_interrupt(id));
510 v = set_field(v, DCSR_STOPCYCLE, 0);
511 v = set_field(v, DCSR_STOPTIME, 0);
512 v = set_field(v, DCSR_EBREAKM, state.dcsr.ebreakm);
513 v = set_field(v, DCSR_EBREAKH, state.dcsr.ebreakh);
514 v = set_field(v, DCSR_EBREAKS, state.dcsr.ebreaks);
515 v = set_field(v, DCSR_EBREAKU, state.dcsr.ebreaku);
516 v = set_field(v, DCSR_HALT, state.dcsr.halt);
517 v = set_field(v, DCSR_CAUSE, state.dcsr.cause);
518 return v;
519 }
520 case CSR_DPC:
521 return state.dpc;
522 case CSR_DSCRATCH:
523 return state.dscratch;
524 }
525 throw trap_illegal_instruction();
526 }
527
528 reg_t illegal_instruction(processor_t* p, insn_t insn, reg_t pc)
529 {
530 throw trap_illegal_instruction();
531 }
532
533 insn_func_t processor_t::decode_insn(insn_t insn)
534 {
535 // look up opcode in hash table
536 size_t idx = insn.bits() % OPCODE_CACHE_SIZE;
537 insn_desc_t desc = opcode_cache[idx];
538
539 if (unlikely(insn.bits() != desc.match)) {
540 // fall back to linear search
541 insn_desc_t* p = &instructions[0];
542 while ((insn.bits() & p->mask) != p->match)
543 p++;
544 desc = *p;
545
546 if (p->mask != 0 && p > &instructions[0]) {
547 if (p->match != (p-1)->match && p->match != (p+1)->match) {
548 // move to front of opcode list to reduce miss penalty
549 while (--p >= &instructions[0])
550 *(p+1) = *p;
551 instructions[0] = desc;
552 }
553 }
554
555 opcode_cache[idx] = desc;
556 opcode_cache[idx].match = insn.bits();
557 }
558
559 return xlen == 64 ? desc.rv64 : desc.rv32;
560 }
561
562 void processor_t::register_insn(insn_desc_t desc)
563 {
564 instructions.push_back(desc);
565 }
566
567 void processor_t::build_opcode_map()
568 {
569 struct cmp {
570 bool operator()(const insn_desc_t& lhs, const insn_desc_t& rhs) {
571 if (lhs.match == rhs.match)
572 return lhs.mask > rhs.mask;
573 return lhs.match > rhs.match;
574 }
575 };
576 std::sort(instructions.begin(), instructions.end(), cmp());
577
578 for (size_t i = 0; i < OPCODE_CACHE_SIZE; i++)
579 opcode_cache[i] = {1, 0, &illegal_instruction, &illegal_instruction};
580 }
581
582 void processor_t::register_extension(extension_t* x)
583 {
584 for (auto insn : x->get_instructions())
585 register_insn(insn);
586 build_opcode_map();
587 for (auto disasm_insn : x->get_disasms())
588 disassembler->add_insn(disasm_insn);
589 if (ext != NULL)
590 throw std::logic_error("only one extension may be registered");
591 ext = x;
592 x->set_processor(this);
593 }
594
595 void processor_t::register_base_instructions()
596 {
597 #define DECLARE_INSN(name, match, mask) \
598 insn_bits_t name##_match = (match), name##_mask = (mask);
599 #include "encoding.h"
600 #undef DECLARE_INSN
601
602 #define DEFINE_INSN(name) \
603 REGISTER_INSN(this, name, name##_match, name##_mask)
604 #include "insn_list.h"
605 #undef DEFINE_INSN
606
607 register_insn({0, 0, &illegal_instruction, &illegal_instruction});
608 build_opcode_map();
609 }
610
611 bool processor_t::load(reg_t addr, size_t len, uint8_t* bytes)
612 {
613 return false;
614 }
615
616 bool processor_t::store(reg_t addr, size_t len, const uint8_t* bytes)
617 {
618 switch (addr)
619 {
620 case 0:
621 state.mip &= ~MIP_MSIP;
622 if (bytes[0] & 1)
623 state.mip |= MIP_MSIP;
624 return true;
625
626 default:
627 return false;
628 }
629 }