Walk page tables to translate addresses.
[riscv-isa-sim.git] / riscv / mmu.cc
1 // See LICENSE for license details.
2
3 #include "mmu.h"
4 #include "sim.h"
5 #include "processor.h"
6
7 mmu_t::mmu_t(sim_t* sim, processor_t* proc)
8 : sim(sim), proc(proc)
9 {
10 flush_tlb();
11 }
12
13 mmu_t::~mmu_t()
14 {
15 }
16
17 void mmu_t::flush_icache()
18 {
19 for (size_t i = 0; i < ICACHE_ENTRIES; i++)
20 icache[i].tag = -1;
21 }
22
23 void mmu_t::flush_tlb()
24 {
25 memset(tlb_insn_tag, -1, sizeof(tlb_insn_tag));
26 memset(tlb_load_tag, -1, sizeof(tlb_load_tag));
27 memset(tlb_store_tag, -1, sizeof(tlb_store_tag));
28
29 flush_icache();
30 }
31
32 reg_t mmu_t::translate(reg_t addr, access_type type)
33 {
34 if (!proc)
35 return addr;
36
37 reg_t mode = proc->state.prv;
38 bool pum = false;
39 if (type != FETCH) {
40 if (get_field(proc->state.mstatus, MSTATUS_MPRV))
41 mode = get_field(proc->state.mstatus, MSTATUS_MPP);
42 pum = (mode == PRV_S && get_field(proc->state.mstatus, MSTATUS_PUM));
43 }
44 if (get_field(proc->state.mstatus, MSTATUS_VM) == VM_MBARE)
45 mode = PRV_M;
46
47 if (mode == PRV_M) {
48 reg_t msb_mask = (reg_t(2) << (proc->xlen-1))-1; // zero-extend from xlen
49 return addr & msb_mask;
50 }
51 return walk(addr, type, mode > PRV_U, pum) | (addr & (PGSIZE-1));
52 }
53
54 const uint16_t* mmu_t::fetch_slow_path(reg_t vaddr)
55 {
56 reg_t paddr = translate(vaddr, FETCH);
57
58 // mmu_t::walk() returns -1 if it can't find a match. Of course -1 could also
59 // be a valid address.
60 if (paddr == ~(reg_t) 0 && vaddr != ~(reg_t) 0) {
61 throw trap_instruction_access_fault(vaddr);
62 }
63
64 if (sim->addr_is_mem(paddr)) {
65 refill_tlb(vaddr, paddr, FETCH);
66 return (const uint16_t*)sim->addr_to_mem(paddr);
67 } else {
68 if (!sim->mmio_load(paddr, sizeof fetch_temp, (uint8_t*)&fetch_temp))
69 throw trap_instruction_access_fault(vaddr);
70 return &fetch_temp;
71 }
72 }
73
74 void mmu_t::load_slow_path(reg_t addr, reg_t len, uint8_t* bytes)
75 {
76 reg_t paddr = translate(addr, LOAD);
77 fprintf(stderr, "load_slow_path 0x%lx -> 0x%lx\n", addr, paddr);
78 if (sim->addr_is_mem(paddr)) {
79 memcpy(bytes, sim->addr_to_mem(paddr), len);
80 if (tracer.interested_in_range(paddr, paddr + PGSIZE, LOAD))
81 tracer.trace(paddr, len, LOAD);
82 else
83 refill_tlb(addr, paddr, LOAD);
84 } else if (!sim->mmio_load(paddr, len, bytes)) {
85 throw trap_load_access_fault(addr);
86 }
87 }
88
89 void mmu_t::store_slow_path(reg_t addr, reg_t len, const uint8_t* bytes)
90 {
91 reg_t paddr = translate(addr, STORE);
92 fprintf(stderr, "store_slow_path 0x%lx -> 0x%lx\n", addr, paddr);
93 if (sim->addr_is_mem(paddr)) {
94 memcpy(sim->addr_to_mem(paddr), bytes, len);
95 if (tracer.interested_in_range(paddr, paddr + PGSIZE, STORE))
96 tracer.trace(paddr, len, STORE);
97 else
98 refill_tlb(addr, paddr, STORE);
99 } else if (!sim->mmio_store(paddr, len, bytes)) {
100 throw trap_store_access_fault(addr);
101 }
102 }
103
104 void mmu_t::refill_tlb(reg_t vaddr, reg_t paddr, access_type type)
105 {
106 reg_t idx = (vaddr >> PGSHIFT) % TLB_ENTRIES;
107 reg_t expected_tag = vaddr >> PGSHIFT;
108
109 if (tlb_load_tag[idx] != expected_tag) tlb_load_tag[idx] = -1;
110 if (tlb_store_tag[idx] != expected_tag) tlb_store_tag[idx] = -1;
111 if (tlb_insn_tag[idx] != expected_tag) tlb_insn_tag[idx] = -1;
112
113 if (type == FETCH) tlb_insn_tag[idx] = expected_tag;
114 else if (type == STORE) tlb_store_tag[idx] = expected_tag;
115 else tlb_load_tag[idx] = expected_tag;
116
117 tlb_data[idx] = sim->addr_to_mem(paddr) - vaddr;
118 }
119
120 reg_t mmu_t::walk(reg_t addr, access_type type, bool supervisor, bool pum)
121 {
122 int levels, ptidxbits, ptesize;
123 switch (get_field(proc->get_state()->mstatus, MSTATUS_VM))
124 {
125 case VM_SV32: levels = 2; ptidxbits = 10; ptesize = 4; break;
126 case VM_SV39: levels = 3; ptidxbits = 9; ptesize = 8; break;
127 case VM_SV48: levels = 4; ptidxbits = 9; ptesize = 8; break;
128 default: abort();
129 }
130
131 // verify bits xlen-1:va_bits-1 are all equal
132 int va_bits = PGSHIFT + levels * ptidxbits;
133 reg_t mask = (reg_t(1) << (proc->xlen - (va_bits-1))) - 1;
134 reg_t masked_msbs = (addr >> (va_bits-1)) & mask;
135 if (masked_msbs != 0 && masked_msbs != mask)
136 return -1;
137
138 reg_t base = proc->get_state()->sptbr << PGSHIFT;
139 int ptshift = (levels - 1) * ptidxbits;
140 for (int i = 0; i < levels; i++, ptshift -= ptidxbits) {
141 reg_t idx = (addr >> (PGSHIFT + ptshift)) & ((1 << ptidxbits) - 1);
142
143 // check that physical address of PTE is legal
144 reg_t pte_addr = base + idx * ptesize;
145 if (!sim->addr_is_mem(pte_addr))
146 break;
147
148 void* ppte = sim->addr_to_mem(pte_addr);
149 reg_t pte = ptesize == 4 ? *(uint32_t*)ppte : *(uint64_t*)ppte;
150 fprintf(stderr, "walk pte entry 0x%lx = 0x%lx\n", pte_addr, pte);
151 reg_t ppn = pte >> PTE_PPN_SHIFT;
152
153 if (PTE_TABLE(pte)) { // next level of page table
154 base = ppn << PGSHIFT;
155 } else if (pum && PTE_CHECK_PERM(pte, 0, type == STORE, type == FETCH)) {
156 break;
157 } else if (!PTE_CHECK_PERM(pte, supervisor, type == STORE, type == FETCH)) {
158 break;
159 } else {
160 // set referenced and possibly dirty bits.
161 *(uint32_t*)ppte |= PTE_R | ((type == STORE) * PTE_D);
162 // for superpage mappings, make a fake leaf PTE for the TLB's benefit.
163 reg_t vpn = addr >> PGSHIFT;
164 reg_t value = (ppn | (vpn & ((reg_t(1) << ptshift) - 1))) << PGSHIFT;
165 fprintf(stderr, "walk 0x%lx -> 0x%lx\n", addr, value);
166 return value;
167 }
168 }
169
170 return -1;
171 }
172
173 void mmu_t::register_memtracer(memtracer_t* t)
174 {
175 flush_tlb();
176 tracer.hook(t);
177 }