aboutsummaryrefslogtreecommitdiff
path: root/riscv/mmu.h
blob: 49a5f0bd1808689ba7d8e8f5e1ae479889279923 (plain)
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
// See LICENSE for license details.

#ifndef _RISCV_MMU_H
#define _RISCV_MMU_H

#include "decode.h"
#include "trap.h"
#include "common.h"
#include "config.h"
#include "processor.h"
#include "memtracer.h"
#include <vector>

// virtual memory configuration
typedef reg_t pte_t;
const reg_t LEVELS = sizeof(pte_t) == sizeof(uint64_t) ? 3 : 2;
const reg_t PGSHIFT = 13;
const reg_t PGSIZE = 1 << PGSHIFT;
const reg_t PTIDXBITS = PGSHIFT - (sizeof(pte_t) == 8 ? 3 : 2);
const reg_t VPN_BITS = PTIDXBITS * LEVELS;
const reg_t PPN_BITS = 8*sizeof(reg_t) - PGSHIFT;
const reg_t VA_BITS = VPN_BITS + PGSHIFT;

// page table entry (PTE) fields
#define PTE_T    0x001 // Entry is a page Table descriptor
#define PTE_E    0x002 // Entry is a page table Entry
#define PTE_R    0x004 // Referenced
#define PTE_D    0x008 // Dirty
#define PTE_UX   0x010 // User eXecute permission
#define PTE_UW   0x020 // User Read permission
#define PTE_UR   0x040 // User Write permission
#define PTE_SX   0x080 // Supervisor eXecute permission
#define PTE_SW   0x100 // Supervisor Read permission
#define PTE_SR   0x200 // Supervisor Write permission
#define PTE_PERM (PTE_SR | PTE_SW | PTE_SX | PTE_UR | PTE_UW | PTE_UX)
#define PTE_PPN_SHIFT  13 // LSB of physical page number in the PTE

// this class implements a processor's port into the virtual memory system.
// an MMU and instruction cache are maintained for simulator performance.
class mmu_t
{
public:
  mmu_t(char* _mem, size_t _memsz);
  ~mmu_t();

  // template for functions that load an aligned value from memory
  #define load_func(type) \
    type##_t load_##type(reg_t addr) { \
      if(unlikely(addr % sizeof(type##_t))) \
      { \
        badvaddr = addr; \
        throw trap_load_address_misaligned; \
      } \
      reg_t paddr = translate(addr, sizeof(type##_t), false, false); \
      return *(type##_t*)(mem + paddr); \
    } \
    type##_t load_reserved_##type(reg_t addr) { \
      load_reservation = addr; \
      return load_##type(addr); \
    }

  // load value from memory at aligned address; zero extend to register width
  load_func(uint8)
  load_func(uint16)
  load_func(uint32)
  load_func(uint64)

  // load value from memory at aligned address; sign extend to register width
  load_func(int8)
  load_func(int16)
  load_func(int32)
  load_func(int64)

  // template for functions that store an aligned value to memory
  #define store_func(type) \
    void store_##type(reg_t addr, type##_t val) { \
      if(unlikely(addr % sizeof(type##_t))) \
      { \
        badvaddr = addr; \
        throw trap_store_address_misaligned; \
      } \
      reg_t paddr = translate(addr, sizeof(type##_t), true, false); \
      *(type##_t*)(mem + paddr) = val; \
    } \
    reg_t store_conditional_##type(reg_t addr, type##_t val) { \
      if (addr == load_reservation) { \
        store_##type(addr, val); \
        return 0; \
      } else return 1; \
    }

  // store value to memory at aligned address
  store_func(uint8)
  store_func(uint16)
  store_func(uint32)
  store_func(uint64)

  struct insn_fetch_t
  {
    insn_func_t func;
    insn_t insn;
  };

  // load instruction from memory at aligned address.
  inline insn_fetch_t load_insn(reg_t addr)
  {
#ifdef RISCV_ENABLE_RVC
# error TODO: Make MMU instruction cache support 2-byte alignment
#endif
    reg_t idx = (addr/sizeof(insn_t::itype)) % ICACHE_ENTRIES;
    if (unlikely(icache_tag[idx] != addr))
    {
      reg_t paddr = translate(addr, sizeof(insn_t::itype), false, true);
      insn_fetch_t fetch;
      fetch.insn.itype = *(decltype(insn_t::itype)*)(mem + paddr);
      fetch.func = proc->decode_insn(fetch.insn);

      reg_t idx = (paddr/sizeof(insn_t::itype)) % ICACHE_ENTRIES;
      icache_tag[idx] = addr;
      icache_data[idx] = fetch;

      if (tracer.interested_in_range(paddr, paddr + sizeof(insn_t::itype), false, true))
      {
        icache_tag[idx] = -1;
        tracer.trace(paddr, sizeof(insn_t::itype), false, true);
      }
    }
    return icache_data[idx];
  }

  reg_t get_badvaddr() { return badvaddr; }
  reg_t get_ptbr() { return ptbr; }
  void set_ptbr(reg_t addr) { ptbr = addr & ~(PGSIZE-1); flush_tlb(); }
  void set_processor(processor_t* p) { proc = p; flush_tlb(); }

  void flush_tlb();
  void flush_icache();
  void yield_load_reservation() { load_reservation = -1; }

  void register_memtracer(memtracer_t*);

private:
  char* mem;
  size_t memsz;
  reg_t load_reservation;
  reg_t badvaddr;
  reg_t ptbr;
  processor_t* proc;
  memtracer_list_t tracer;

  // implement an instruction cache for simulator performance
  static const reg_t ICACHE_ENTRIES = 256;
  insn_fetch_t icache_data[ICACHE_ENTRIES];

  // implement a TLB for simulator performance
  static const reg_t TLB_ENTRIES = 256;
  reg_t tlb_data[TLB_ENTRIES];
  reg_t tlb_insn_tag[TLB_ENTRIES];
  reg_t tlb_load_tag[TLB_ENTRIES];
  reg_t tlb_store_tag[TLB_ENTRIES];
  reg_t icache_tag[ICACHE_ENTRIES];

  // finish translation on a TLB miss and upate the TLB
  reg_t refill_tlb(reg_t addr, reg_t bytes, bool store, bool fetch);

  // perform a page table walk for a given virtual address
  pte_t walk(reg_t addr);

  // translate a virtual address to a physical address
  reg_t translate(reg_t addr, reg_t bytes, bool store, bool fetch)
  {
    reg_t idx = (addr >> PGSHIFT) % TLB_ENTRIES;

    reg_t* tlb_tag = fetch ? tlb_insn_tag : store ? tlb_store_tag :tlb_load_tag;
    reg_t expected_tag = addr & ~(PGSIZE-1);
    if(likely(tlb_tag[idx] == expected_tag))
      return ((uintptr_t)addr & (PGSIZE-1)) + tlb_data[idx];

    return refill_tlb(addr, bytes, store, fetch);
  }
  
  friend class processor_t;
};

#endif