2023-01-25 19:05:47 +02:00
|
|
|
#include <BAN/Errors.h>
|
2023-04-14 13:30:21 +03:00
|
|
|
#include <kernel/Memory/kmalloc.h>
|
|
|
|
#include <kernel/Memory/MMU.h>
|
2023-01-25 19:05:47 +02:00
|
|
|
|
|
|
|
#define PAGE_SIZE 0x1000
|
|
|
|
#define PAGE_MASK ~(PAGE_SIZE - 1)
|
|
|
|
|
|
|
|
#define CLEANUP_STRUCTURE(s) \
|
|
|
|
for (uint64_t i = 0; i < 512; i++) \
|
2023-03-01 20:15:58 +02:00
|
|
|
if (s[i] & Flags::Present) \
|
2023-01-25 19:05:47 +02:00
|
|
|
goto cleanup_done; \
|
|
|
|
kfree(s)
|
|
|
|
|
|
|
|
static MMU* s_instance = nullptr;
|
|
|
|
|
2023-02-01 21:05:44 +02:00
|
|
|
void MMU::intialize()
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
ASSERT(s_instance == nullptr);
|
|
|
|
s_instance = new MMU();
|
|
|
|
}
|
|
|
|
|
2023-02-01 21:05:44 +02:00
|
|
|
MMU& MMU::get()
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
ASSERT(s_instance);
|
|
|
|
return *s_instance;
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint64_t* allocate_page_aligned_page()
|
|
|
|
{
|
|
|
|
void* page = kmalloc(PAGE_SIZE, PAGE_SIZE);
|
|
|
|
ASSERT(page);
|
|
|
|
memset(page, 0, PAGE_SIZE);
|
|
|
|
return (uint64_t*)page;
|
|
|
|
}
|
|
|
|
|
|
|
|
MMU::MMU()
|
|
|
|
{
|
2023-03-06 23:38:05 +02:00
|
|
|
// Identity map from 4 KiB -> 6 MiB
|
2023-01-25 19:05:47 +02:00
|
|
|
m_highest_paging_struct = allocate_page_aligned_page();
|
|
|
|
|
|
|
|
uint64_t* pdpt = allocate_page_aligned_page();
|
2023-03-01 20:15:58 +02:00
|
|
|
m_highest_paging_struct[0] = (uint64_t)pdpt | Flags::ReadWrite | Flags::Present;
|
2023-01-25 19:05:47 +02:00
|
|
|
|
|
|
|
uint64_t* pd = allocate_page_aligned_page();
|
2023-03-01 20:15:58 +02:00
|
|
|
pdpt[0] = (uint64_t)pd | Flags::ReadWrite | Flags::Present;
|
2023-01-25 19:05:47 +02:00
|
|
|
|
2023-03-06 23:38:05 +02:00
|
|
|
for (uint32_t i = 0; i < 3; i++)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
uint64_t* pt = allocate_page_aligned_page();
|
|
|
|
for (uint64_t j = 0; j < 512; j++)
|
2023-03-01 20:15:58 +02:00
|
|
|
pt[j] = (i << 21) | (j << 12) | Flags::ReadWrite | Flags::Present;
|
|
|
|
pd[i] = (uint64_t)pt | Flags::ReadWrite | Flags::Present;
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Unmap 0 -> 4 KiB
|
|
|
|
uint64_t* pt1 = (uint64_t*)(pd[0] & PAGE_MASK);
|
|
|
|
pt1[0] = 0;
|
|
|
|
|
|
|
|
// Load the new pml4
|
|
|
|
asm volatile("movq %0, %%cr3" :: "r"(m_highest_paging_struct));
|
|
|
|
}
|
|
|
|
|
2023-01-30 18:54:04 +02:00
|
|
|
MMU::~MMU()
|
|
|
|
{
|
|
|
|
uint64_t* pml4 = m_highest_paging_struct;
|
|
|
|
for (uint32_t pml4e = 0; pml4e < 512; pml4e++)
|
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pml4[pml4e] & Flags::Present))
|
2023-01-30 18:54:04 +02:00
|
|
|
continue;
|
|
|
|
uint64_t* pdpt = (uint64_t*)(pml4[pml4e] & PAGE_MASK);
|
|
|
|
for (uint32_t pdpte = 0; pdpte < 512; pdpte++)
|
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pdpt[pdpte] & Flags::Present))
|
2023-01-30 18:54:04 +02:00
|
|
|
continue;
|
|
|
|
uint64_t* pd = (uint64_t*)(pdpt[pdpte] & PAGE_MASK);
|
|
|
|
for (uint32_t pde = 0; pde < 512; pde++)
|
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pd[pde] & Flags::Present))
|
2023-01-30 18:54:04 +02:00
|
|
|
continue;
|
|
|
|
kfree((void*)(pd[pde] & PAGE_MASK));
|
|
|
|
}
|
|
|
|
kfree(pd);
|
|
|
|
}
|
|
|
|
kfree(pdpt);
|
|
|
|
}
|
|
|
|
kfree(pml4);
|
|
|
|
}
|
|
|
|
|
2023-03-01 20:15:58 +02:00
|
|
|
void MMU::allocate_page(uintptr_t address, uint8_t flags)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
ASSERT((address >> 48) == 0);
|
|
|
|
|
2023-03-01 20:15:58 +02:00
|
|
|
ASSERT(flags & Flags::Present);
|
|
|
|
bool should_invalidate = false;
|
|
|
|
|
2023-01-25 19:05:47 +02:00
|
|
|
address &= PAGE_MASK;
|
|
|
|
|
|
|
|
uint64_t pml4e = (address >> 39) & 0x1FF;
|
|
|
|
uint64_t pdpte = (address >> 30) & 0x1FF;
|
|
|
|
uint64_t pde = (address >> 21) & 0x1FF;
|
|
|
|
uint64_t pte = (address >> 12) & 0x1FF;
|
|
|
|
|
|
|
|
uint64_t* pml4 = m_highest_paging_struct;
|
2023-03-01 20:15:58 +02:00
|
|
|
if ((pml4[pml4e] & flags) != flags)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pml4[pml4e] & Flags::Present))
|
|
|
|
pml4[pml4e] = (uint64_t)allocate_page_aligned_page();
|
|
|
|
pml4[pml4e] = (pml4[pml4e] & PAGE_MASK) | flags;
|
|
|
|
should_invalidate = true;
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t* pdpt = (uint64_t*)(pml4[pml4e] & PAGE_MASK);
|
2023-03-01 20:15:58 +02:00
|
|
|
if ((pdpt[pdpte] & flags) != flags)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pdpt[pdpte] & Flags::Present))
|
|
|
|
pdpt[pdpte] = (uint64_t)allocate_page_aligned_page();
|
|
|
|
pdpt[pdpte] = (pdpt[pdpte] & PAGE_MASK) | flags;
|
|
|
|
should_invalidate = true;
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t* pd = (uint64_t*)(pdpt[pdpte] & PAGE_MASK);
|
2023-03-01 20:15:58 +02:00
|
|
|
if ((pd[pde] & flags) != flags)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pd[pde] & Flags::Present))
|
|
|
|
pd[pde] = (uint64_t)allocate_page_aligned_page();
|
|
|
|
pd[pde] = (pd[pde] & PAGE_MASK) | flags;
|
|
|
|
should_invalidate = true;
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t* pt = (uint64_t*)(pd[pde] & PAGE_MASK);
|
2023-03-01 20:15:58 +02:00
|
|
|
if ((pt[pte] & flags) != flags)
|
2023-01-26 02:35:11 +02:00
|
|
|
{
|
2023-03-01 20:15:58 +02:00
|
|
|
pt[pte] = address | flags;
|
|
|
|
should_invalidate = true;
|
2023-01-26 02:35:11 +02:00
|
|
|
}
|
2023-03-01 20:15:58 +02:00
|
|
|
|
|
|
|
if (should_invalidate)
|
|
|
|
asm volatile("invlpg (%0)" :: "r"(address) : "memory");
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|
|
|
|
|
2023-03-01 20:15:58 +02:00
|
|
|
void MMU::allocate_range(uintptr_t address, ptrdiff_t size, uint8_t flags)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
uintptr_t s_page = address & PAGE_MASK;
|
|
|
|
uintptr_t e_page = (address + size - 1) & PAGE_MASK;
|
|
|
|
for (uintptr_t page = s_page; page <= e_page; page += PAGE_SIZE)
|
2023-03-01 20:15:58 +02:00
|
|
|
allocate_page(page, flags);
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|
|
|
|
|
2023-02-01 21:05:44 +02:00
|
|
|
void MMU::unallocate_page(uintptr_t address)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
ASSERT((address >> 48) == 0);
|
|
|
|
|
|
|
|
address &= PAGE_MASK;
|
|
|
|
|
|
|
|
uint64_t pml4e = (address >> 39) & 0x1FF;
|
|
|
|
uint64_t pdpte = (address >> 30) & 0x1FF;
|
|
|
|
uint64_t pde = (address >> 21) & 0x1FF;
|
|
|
|
uint64_t pte = (address >> 12) & 0x1FF;
|
|
|
|
|
|
|
|
uint64_t* pml4 = m_highest_paging_struct;
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pml4[pml4e] & Flags::Present))
|
2023-01-26 02:35:11 +02:00
|
|
|
return;
|
2023-01-25 19:05:47 +02:00
|
|
|
|
|
|
|
uint64_t* pdpt = (uint64_t*)(pml4[pml4e] & PAGE_MASK);
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pdpt[pdpte] & Flags::Present))
|
2023-01-26 02:35:11 +02:00
|
|
|
return;
|
2023-01-25 19:05:47 +02:00
|
|
|
|
|
|
|
uint64_t* pd = (uint64_t*)(pdpt[pdpte] & PAGE_MASK);
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pd[pde] & Flags::Present))
|
2023-01-26 02:35:11 +02:00
|
|
|
return;
|
2023-01-25 19:05:47 +02:00
|
|
|
|
|
|
|
uint64_t* pt = (uint64_t*)(pd[pde] & PAGE_MASK);
|
2023-03-01 20:15:58 +02:00
|
|
|
if (!(pt[pte] & Flags::Present))
|
2023-01-26 02:35:11 +02:00
|
|
|
return;
|
2023-01-25 19:05:47 +02:00
|
|
|
|
|
|
|
pt[pte] = 0;
|
|
|
|
|
|
|
|
CLEANUP_STRUCTURE(pt);
|
|
|
|
pd[pde] = 0;
|
|
|
|
CLEANUP_STRUCTURE(pd);
|
|
|
|
pdpt[pdpte] = 0;
|
|
|
|
CLEANUP_STRUCTURE(pdpt);
|
|
|
|
pml4[pml4e] = 0;
|
|
|
|
cleanup_done:
|
|
|
|
|
|
|
|
asm volatile("invlpg (%0)" :: "r"(address) : "memory");
|
|
|
|
}
|
|
|
|
|
2023-02-01 21:05:44 +02:00
|
|
|
void MMU::unallocate_range(uintptr_t address, ptrdiff_t size)
|
2023-01-25 19:05:47 +02:00
|
|
|
{
|
|
|
|
uintptr_t s_page = address & PAGE_MASK;
|
|
|
|
uintptr_t e_page = (address + size - 1) & PAGE_MASK;
|
|
|
|
for (uintptr_t page = s_page; page <= e_page; page += PAGE_SIZE)
|
2023-02-01 21:05:44 +02:00
|
|
|
unallocate_page(page);
|
2023-01-25 19:05:47 +02:00
|
|
|
}
|