2 #include <libc/string.h>
3 #include <lunaix/mm/page.h>
4 #include <lunaix/mm/pmm.h>
5 #include <lunaix/mm/vmm.h>
6 #include <lunaix/spike.h>
13 // TODO: something here?
19 x86_page_table* dir = (x86_page_table*)pmm_alloc_page();
20 for (size_t i = 0; i < PG_MAX_ENTRIES; i++) {
21 dir->entry[i] = PTE_NULL;
24 // 递归映射,方便我们在软件层面进行查表地址转换
25 dir->entry[PG_MAX_ENTRIES - 1] = NEW_L1_ENTRY(T_SELF_REF_PERM, dir);
31 __vmm_map_internal(uint32_t l1_inx,
37 x86_page_table* l1pt = (x86_page_table*)L1_BASE_VADDR;
38 x86_page_table* l2pt = (x86_page_table*)L2_VADDR(l1_inx);
40 // See if attr make sense
43 if (!l1pt->entry[l1_inx]) {
44 x86_page_table* new_l1pt_pa = pmm_alloc_page();
51 l1pt->entry[l1_inx] = NEW_L1_ENTRY(attr, new_l1pt_pa);
52 memset((void*)L2_VADDR(l1_inx), 0, PG_SIZE);
55 if (!forced && l2pt->entry[l2_inx]) {
59 l2pt->entry[l2_inx] = NEW_L2_ENTRY(attr, pa);
65 vmm_map_page(void* va, void* pa, pt_attr tattr)
72 assert(((uintptr_t)va & 0xFFFU) == 0) assert(((uintptr_t)pa & 0xFFFU) == 0);
74 uint32_t l1_index = L1_INDEX(va);
75 uint32_t l2_index = L2_INDEX(va);
76 x86_page_table* l1pt = (x86_page_table*)L1_BASE_VADDR;
78 // 在页表与页目录中找到一个可用的空位进行映射(位于va或其附近)
79 x86_pte_t l1pte = l1pt->entry[l1_index];
80 x86_page_table* l2pt = (x86_page_table*)L2_VADDR(l1_index);
81 while (l1pte && l1_index < PG_MAX_ENTRIES) {
82 if (l2_index == PG_MAX_ENTRIES) {
85 l1pte = l1pt->entry[l1_index];
86 l2pt = (x86_page_table*)L2_VADDR(l1_index);
88 // 页表有空位,只需要开辟一个新的 PTE (Level 2)
89 if (l2pt && !l2pt->entry[l2_index]) {
90 l2pt->entry[l2_index] = NEW_L2_ENTRY(tattr, pa);
91 return (void*)V_ADDR(l1_index, l2_index, PG_OFFSET(va));
97 if (l1_index > PG_MAX_ENTRIES) {
101 if (!__vmm_map_internal(l1_index, l2_index, (uintptr_t)pa, tattr, false)) {
105 return (void*)V_ADDR(l1_index, l2_index, PG_OFFSET(va));
109 vmm_fmap_page(void* va, void* pa, pt_attr tattr)
115 assert(((uintptr_t)va & 0xFFFU) == 0) assert(((uintptr_t)pa & 0xFFFU) == 0);
117 uint32_t l1_index = L1_INDEX(va);
118 uint32_t l2_index = L2_INDEX(va);
120 if (!__vmm_map_internal(l1_index, l2_index, (uintptr_t)pa, tattr, true)) {
126 return (void*)V_ADDR(l1_index, l2_index, PG_OFFSET(va));
130 vmm_alloc_page(void* vpn, pt_attr tattr)
132 void* pp = pmm_alloc_page();
133 void* result = vmm_map_page(vpn, pp, tattr);
141 vmm_alloc_pages(void* va, size_t sz, pt_attr tattr)
143 assert((uintptr_t)va % PG_SIZE == 0) assert(sz % PG_SIZE == 0);
146 for (size_t i = 0; i < (sz >> PG_SIZE_BITS); i++, va_ += PG_SIZE) {
147 void* pp = pmm_alloc_page();
148 uint32_t l1_index = L1_INDEX(va_);
149 uint32_t l2_index = L2_INDEX(va_);
150 if (!pp || !__vmm_map_internal(
151 l1_index, l2_index, (uintptr_t)pp, tattr, false)) {
152 // if one failed, release previous allocated pages.
154 for (size_t j = 0; j < i; j++, va_ += PG_SIZE) {
166 vmm_unmap_page(void* va)
168 assert(((uintptr_t)va & 0xFFFU) == 0);
170 uint32_t l1_index = L1_INDEX(va);
171 uint32_t l2_index = L2_INDEX(va);
172 x86_page_table* l1pt = (x86_page_table*)L1_BASE_VADDR;
174 x86_pte_t l1pte = l1pt->entry[l1_index];
177 x86_page_table* l2pt = (x86_page_table*)L2_VADDR(l1_index);
178 x86_pte_t l2pte = l2pt->entry[l2_index];
179 if (IS_CACHED(l2pte)) {
180 pmm_free_page((void*)l2pte);
183 l2pt->entry[l2_index] = PTE_NULL;
190 assert(((uintptr_t)va & 0xFFFU) == 0);
192 uint32_t l1_index = L1_INDEX(va);
193 uint32_t l2_index = L2_INDEX(va);
195 x86_page_table* l1pt = (x86_page_table*)L1_BASE_VADDR;
196 x86_pte_t l1pte = l1pt->entry[l1_index];
198 v_mapping mapping = { .flags = 0, .pa = 0, .pn = 0 };
201 ((x86_page_table*)L2_VADDR(l1_index))->entry[l2_index];
203 mapping.flags = PG_ENTRY_FLAGS(l2pte);
204 mapping.pa = PG_ENTRY_ADDR(l2pte);
205 mapping.pn = mapping.pa >> PG_SIZE_BITS;
215 return (void*)vmm_lookup(va).pa;