894 lines
22 KiB
C
894 lines
22 KiB
C
/*
|
|
* Copyright (c) 2006-2022, RT-Thread Development Team
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*
|
|
* Change Logs:
|
|
* Date Author Notes
|
|
* 2019-11-01 Jesven The first version
|
|
* 2022-12-13 WangXiaoyao Hot-pluggable, extensible
|
|
* page management algorithm
|
|
* 2023-02-20 WangXiaoyao Multi-list page-management
|
|
* 2023-11-28 Shell Bugs fix for page_install on shadow region
|
|
*/
|
|
#include <rtthread.h>
|
|
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
#include "mm_fault.h"
|
|
#include "mm_private.h"
|
|
#include "mm_aspace.h"
|
|
#include "mm_flag.h"
|
|
#include "mm_page.h"
|
|
#include <mmu.h>
|
|
|
|
#define DBG_TAG "mm.page"
|
|
#define DBG_LVL DBG_WARNING
|
|
#include <rtdbg.h>
|
|
|
|
RT_STATIC_ASSERT(order_huge_pg, RT_PAGE_MAX_ORDER > ARCH_PAGE_SHIFT - 2);
|
|
RT_STATIC_ASSERT(size_width, sizeof(rt_size_t) == sizeof(void *));
|
|
|
|
#ifdef RT_USING_SMART
|
|
#include "lwp_arch_comm.h"
|
|
#endif /* RT_USING_SMART */
|
|
|
|
static rt_size_t init_mpr_align_start;
|
|
static rt_size_t init_mpr_align_end;
|
|
static void *init_mpr_cont_start;
|
|
|
|
static struct rt_varea mpr_varea;
|
|
|
|
static struct rt_page *page_list_low[RT_PAGE_MAX_ORDER];
|
|
static struct rt_page *page_list_high[RT_PAGE_MAX_ORDER];
|
|
static RT_DEFINE_SPINLOCK(_spinlock);
|
|
|
|
#define page_start ((rt_page_t)rt_mpr_start)
|
|
|
|
static rt_size_t page_nr;
|
|
static rt_size_t _high_pages_nr;
|
|
static rt_size_t early_offset;
|
|
|
|
static const char *get_name(rt_varea_t varea)
|
|
{
|
|
return "master-page-record";
|
|
}
|
|
|
|
static void hint_free(rt_mm_va_hint_t hint)
|
|
{
|
|
hint->flags = MMF_MAP_FIXED;
|
|
hint->limit_start = rt_kernel_space.start;
|
|
hint->limit_range_size = rt_kernel_space.size;
|
|
hint->prefer = rt_mpr_start;
|
|
}
|
|
|
|
static void on_page_fault(struct rt_varea *varea, struct rt_aspace_fault_msg *msg)
|
|
{
|
|
char *init_start = (void *)init_mpr_align_start;
|
|
char *init_end = (void *)init_mpr_align_end;
|
|
if ((char *)msg->fault_vaddr < init_end && (char *)msg->fault_vaddr >= init_start)
|
|
{
|
|
rt_size_t offset = (char *)msg->fault_vaddr - init_start;
|
|
msg->response.status = MM_FAULT_STATUS_OK;
|
|
msg->response.vaddr = (char *)init_mpr_cont_start + offset;
|
|
msg->response.size = ARCH_PAGE_SIZE;
|
|
}
|
|
else
|
|
{
|
|
rt_mm_dummy_mapper.on_page_fault(varea, msg);
|
|
}
|
|
}
|
|
|
|
static struct rt_mem_obj mm_page_mapper = {
|
|
.get_name = get_name,
|
|
.on_page_fault = on_page_fault,
|
|
.hint_free = hint_free,
|
|
};
|
|
|
|
#ifdef RT_DEBUGING_PAGE_LEAK
|
|
static volatile int enable;
|
|
static rt_page_t _trace_head;
|
|
#define TRACE_ALLOC(pg, size) _trace_alloc(pg, __builtin_return_address(0), size)
|
|
#define TRACE_FREE(pgaddr, size) _trace_free(pgaddr, __builtin_return_address(0), size)
|
|
|
|
static long _alloc_cnt;
|
|
|
|
void rt_page_leak_trace_start()
|
|
{
|
|
// TODO multicore safety
|
|
_trace_head = NULL;
|
|
_alloc_cnt = 0;
|
|
enable = 1;
|
|
}
|
|
MSH_CMD_EXPORT(rt_page_leak_trace_start, start page leak tracer);
|
|
|
|
static void _collect()
|
|
{
|
|
rt_page_t page = _trace_head;
|
|
if (!page)
|
|
{
|
|
rt_kprintf("ok! ALLOC CNT %ld\n", _alloc_cnt);
|
|
}
|
|
else
|
|
{
|
|
while (page)
|
|
{
|
|
rt_page_t next = page->tl_next;
|
|
void *pg_va = rt_page_page2addr(page);
|
|
LOG_W("LEAK: %p, allocator: %p, size bits: %lx", pg_va, page->caller, page->trace_size);
|
|
rt_pages_free(pg_va, page->trace_size);
|
|
page = next;
|
|
}
|
|
}
|
|
}
|
|
|
|
void rt_page_leak_trace_stop()
|
|
{
|
|
// TODO multicore safety
|
|
enable = 0;
|
|
_collect();
|
|
}
|
|
MSH_CMD_EXPORT(rt_page_leak_trace_stop, stop page leak tracer);
|
|
|
|
static void _trace_alloc(rt_page_t page, void *caller, size_t size_bits)
|
|
{
|
|
if (enable)
|
|
{
|
|
page->caller = caller;
|
|
page->trace_size = size_bits;
|
|
page->tl_prev = NULL;
|
|
page->tl_next = NULL;
|
|
|
|
_alloc_cnt++;
|
|
if (_trace_head == NULL)
|
|
{
|
|
_trace_head = page;
|
|
}
|
|
else
|
|
{
|
|
_trace_head->tl_prev = page;
|
|
page->tl_next = _trace_head;
|
|
_trace_head = page;
|
|
}
|
|
}
|
|
}
|
|
|
|
void _report(rt_page_t page, size_t size_bits, char *msg)
|
|
{
|
|
void *pg_va = rt_page_page2addr(page);
|
|
LOG_W("%s: %p, allocator: %p, size bits: %lx", msg, pg_va, page->caller, page->trace_size);
|
|
rt_kprintf("backtrace\n");
|
|
rt_backtrace();
|
|
}
|
|
|
|
static void _trace_free(rt_page_t page, void *caller, size_t size_bits)
|
|
{
|
|
if (enable)
|
|
{
|
|
/* free after free */
|
|
if (page->trace_size == 0xabadcafe)
|
|
{
|
|
_report(page, size_bits, "free after free");
|
|
return ;
|
|
}
|
|
else if (page->trace_size != size_bits)
|
|
{
|
|
rt_kprintf("free with size bits %lx\n", size_bits);
|
|
_report(page, size_bits, "incompatible size bits parameter");
|
|
return ;
|
|
}
|
|
|
|
if (page->ref_cnt == 0)
|
|
{
|
|
_alloc_cnt--;
|
|
if (page->tl_prev)
|
|
page->tl_prev->tl_next = page->tl_next;
|
|
if (page->tl_next)
|
|
page->tl_next->tl_prev = page->tl_prev;
|
|
|
|
if (page == _trace_head)
|
|
_trace_head = page->tl_next;
|
|
|
|
page->tl_prev = NULL;
|
|
page->tl_next = NULL;
|
|
page->trace_size = 0xabadcafe;
|
|
}
|
|
}
|
|
}
|
|
#else
|
|
#define TRACE_ALLOC(x, y)
|
|
#define TRACE_FREE(x, y)
|
|
#endif
|
|
|
|
static inline void *page_to_addr(rt_page_t page)
|
|
{
|
|
return (void *)(((page - page_start) << ARCH_PAGE_SHIFT) - PV_OFFSET);
|
|
}
|
|
|
|
static inline rt_page_t addr_to_page(rt_page_t pg_start, void *addr)
|
|
{
|
|
addr = (char *)addr + PV_OFFSET;
|
|
return &pg_start[((rt_ubase_t)addr >> ARCH_PAGE_SHIFT)];
|
|
}
|
|
|
|
#define FLOOR(val, align) (((rt_size_t)(val) + (align)-1) & ~((align)-1))
|
|
|
|
const rt_size_t shadow_mask =
|
|
((1ul << (RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1)) - 1);
|
|
|
|
const rt_size_t rt_mpr_size = FLOOR(
|
|
((1ul << (ARCH_VADDR_WIDTH - ARCH_PAGE_SHIFT))) * sizeof(struct rt_page),
|
|
ARCH_PAGE_SIZE);
|
|
|
|
void *rt_mpr_start;
|
|
|
|
rt_weak int rt_hw_clz(unsigned long n)
|
|
{
|
|
return __builtin_clzl(n);
|
|
}
|
|
|
|
rt_weak int rt_hw_ctz(unsigned long n)
|
|
{
|
|
return __builtin_ctzl(n);
|
|
}
|
|
|
|
rt_size_t rt_page_bits(rt_size_t size)
|
|
{
|
|
int bit = sizeof(rt_size_t) * 8 - rt_hw_clz(size) - 1;
|
|
|
|
if ((size ^ (1UL << bit)) != 0)
|
|
{
|
|
bit++;
|
|
}
|
|
bit -= ARCH_PAGE_SHIFT;
|
|
if (bit < 0)
|
|
{
|
|
bit = 0;
|
|
}
|
|
return bit;
|
|
}
|
|
|
|
struct rt_page *rt_page_addr2page(void *addr)
|
|
{
|
|
return addr_to_page(page_start, addr);
|
|
}
|
|
|
|
void *rt_page_page2addr(struct rt_page *p)
|
|
{
|
|
return page_to_addr(p);
|
|
}
|
|
|
|
static inline struct rt_page *_buddy_get(struct rt_page *p,
|
|
rt_uint32_t size_bits)
|
|
{
|
|
rt_size_t addr;
|
|
|
|
addr = (rt_size_t)rt_page_page2addr(p);
|
|
addr ^= (1UL << (size_bits + ARCH_PAGE_SHIFT));
|
|
return rt_page_addr2page((void *)addr);
|
|
}
|
|
|
|
static void _page_remove(rt_page_t page_list[], struct rt_page *p, rt_uint32_t size_bits)
|
|
{
|
|
if (p->pre)
|
|
{
|
|
p->pre->next = p->next;
|
|
}
|
|
else
|
|
{
|
|
page_list[size_bits] = p->next;
|
|
}
|
|
|
|
if (p->next)
|
|
{
|
|
p->next->pre = p->pre;
|
|
}
|
|
|
|
p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
}
|
|
|
|
static void _page_insert(rt_page_t page_list[], struct rt_page *p, rt_uint32_t size_bits)
|
|
{
|
|
p->next = page_list[size_bits];
|
|
if (p->next)
|
|
{
|
|
p->next->pre = p;
|
|
}
|
|
p->pre = 0;
|
|
page_list[size_bits] = p;
|
|
p->size_bits = size_bits;
|
|
}
|
|
|
|
static void _pages_ref_inc(struct rt_page *p, rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *page_head;
|
|
int idx;
|
|
|
|
/* find page group head */
|
|
idx = p - page_start;
|
|
idx = idx & ~((1UL << size_bits) - 1);
|
|
|
|
page_head = page_start + idx;
|
|
page_head = (void *)((char *)page_head + early_offset);
|
|
page_head->ref_cnt++;
|
|
}
|
|
|
|
static int _pages_ref_get(struct rt_page *p, rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *page_head;
|
|
int idx;
|
|
|
|
/* find page group head */
|
|
idx = p - page_start;
|
|
idx = idx & ~((1UL << size_bits) - 1);
|
|
|
|
page_head = page_start + idx;
|
|
return page_head->ref_cnt;
|
|
}
|
|
|
|
static int _pages_free(rt_page_t page_list[], struct rt_page *p, rt_uint32_t size_bits)
|
|
{
|
|
rt_uint32_t level = size_bits;
|
|
struct rt_page *buddy;
|
|
|
|
RT_ASSERT(p >= page_start);
|
|
RT_ASSERT((char *)p < (char *)rt_mpr_start + rt_mpr_size);
|
|
RT_ASSERT(rt_kmem_v2p(p));
|
|
RT_ASSERT(p->ref_cnt > 0);
|
|
RT_ASSERT(p->size_bits == ARCH_ADDRESS_WIDTH_BITS);
|
|
RT_ASSERT(size_bits < RT_PAGE_MAX_ORDER);
|
|
|
|
p->ref_cnt--;
|
|
if (p->ref_cnt != 0)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
while (level < RT_PAGE_MAX_ORDER - 1)
|
|
{
|
|
buddy = _buddy_get(p, level);
|
|
if (buddy && buddy->size_bits == level)
|
|
{
|
|
_page_remove(page_list, buddy, level);
|
|
p = (p < buddy) ? p : buddy;
|
|
level++;
|
|
}
|
|
else
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
_page_insert(page_list, p, level);
|
|
return 1;
|
|
}
|
|
|
|
static struct rt_page *_pages_alloc(rt_page_t page_list[], rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *p;
|
|
|
|
if (page_list[size_bits])
|
|
{
|
|
p = page_list[size_bits];
|
|
_page_remove(page_list, p, size_bits);
|
|
}
|
|
else
|
|
{
|
|
rt_uint32_t level;
|
|
|
|
for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
|
|
{
|
|
if (page_list[level])
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
if (level == RT_PAGE_MAX_ORDER)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
p = page_list[level];
|
|
_page_remove(page_list, p, level);
|
|
while (level > size_bits)
|
|
{
|
|
_page_insert(page_list, p, level - 1);
|
|
p = _buddy_get(p, level - 1);
|
|
level--;
|
|
}
|
|
}
|
|
p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
p->ref_cnt = 1;
|
|
return p;
|
|
}
|
|
|
|
static void _early_page_remove(rt_page_t page_list[], rt_page_t page, rt_uint32_t size_bits)
|
|
{
|
|
rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
|
|
if (page_cont->pre)
|
|
{
|
|
rt_page_t pre_cont = (rt_page_t)((char *)page_cont->pre + early_offset);
|
|
pre_cont->next = page_cont->next;
|
|
}
|
|
else
|
|
{
|
|
page_list[size_bits] = page_cont->next;
|
|
}
|
|
|
|
if (page_cont->next)
|
|
{
|
|
rt_page_t next_cont = (rt_page_t)((char *)page_cont->next + early_offset);
|
|
next_cont->pre = page_cont->pre;
|
|
}
|
|
|
|
page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
}
|
|
|
|
static void _early_page_insert(rt_page_t page_list[], rt_page_t page, int size_bits)
|
|
{
|
|
RT_ASSERT((void *)page >= rt_mpr_start &&
|
|
((char *)page - (char *)rt_mpr_start) < rt_mpr_size);
|
|
rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
|
|
|
|
page_cont->next = page_list[size_bits];
|
|
if (page_cont->next)
|
|
{
|
|
rt_page_t next_cont = (rt_page_t)((char *)page_cont->next + early_offset);
|
|
next_cont->pre = page;
|
|
}
|
|
page_cont->pre = 0;
|
|
page_list[size_bits] = page;
|
|
page_cont->size_bits = size_bits;
|
|
}
|
|
|
|
static struct rt_page *_early_pages_alloc(rt_page_t page_list[], rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *p;
|
|
|
|
if (page_list[size_bits])
|
|
{
|
|
p = page_list[size_bits];
|
|
_early_page_remove(page_list, p, size_bits);
|
|
}
|
|
else
|
|
{
|
|
rt_uint32_t level;
|
|
|
|
for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
|
|
{
|
|
if (page_list[level])
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
if (level == RT_PAGE_MAX_ORDER)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
p = page_list[level];
|
|
_early_page_remove(page_list, p, level);
|
|
while (level > size_bits)
|
|
{
|
|
_early_page_insert(page_list, p, level - 1);
|
|
p = _buddy_get(p, level - 1);
|
|
level--;
|
|
}
|
|
}
|
|
rt_page_t page_cont = (rt_page_t)((char *)p + early_offset);
|
|
page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
page_cont->ref_cnt = 1;
|
|
return p;
|
|
}
|
|
|
|
static rt_page_t *_get_page_list(void *vaddr)
|
|
{
|
|
rt_ubase_t pa_int = (rt_ubase_t)vaddr + PV_OFFSET;
|
|
rt_page_t *list;
|
|
if (pa_int > UINT32_MAX)
|
|
{
|
|
list = page_list_high;
|
|
}
|
|
else
|
|
{
|
|
list = page_list_low;
|
|
}
|
|
return list;
|
|
}
|
|
|
|
int rt_page_ref_get(void *addr, rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *p;
|
|
rt_base_t level;
|
|
int ref;
|
|
|
|
p = rt_page_addr2page(addr);
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
ref = _pages_ref_get(p, size_bits);
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
return ref;
|
|
}
|
|
|
|
void rt_page_ref_inc(void *addr, rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *p;
|
|
rt_base_t level;
|
|
|
|
p = rt_page_addr2page(addr);
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
_pages_ref_inc(p, size_bits);
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
}
|
|
|
|
static rt_page_t (*pages_alloc_handler)(rt_page_t page_list[], rt_uint32_t size_bits);
|
|
|
|
/* if not, we skip the finding on page_list_high */
|
|
static size_t _high_page_configured = 0;
|
|
|
|
static rt_page_t *_flag_to_page_list(size_t flags)
|
|
{
|
|
rt_page_t *page_list;
|
|
if (_high_page_configured && (flags & PAGE_ANY_AVAILABLE))
|
|
{
|
|
page_list = page_list_high;
|
|
}
|
|
else
|
|
{
|
|
page_list = page_list_low;
|
|
}
|
|
return page_list;
|
|
}
|
|
|
|
rt_inline void *_do_pages_alloc(rt_uint32_t size_bits, size_t flags)
|
|
{
|
|
void *alloc_buf = RT_NULL;
|
|
struct rt_page *p;
|
|
rt_base_t level;
|
|
rt_page_t *page_list = _flag_to_page_list(flags);
|
|
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
p = pages_alloc_handler(page_list, size_bits);
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
|
|
if (!p && page_list != page_list_low)
|
|
{
|
|
/* fall back */
|
|
page_list = page_list_low;
|
|
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
p = pages_alloc_handler(page_list, size_bits);
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
}
|
|
|
|
if (p)
|
|
{
|
|
alloc_buf = page_to_addr(p);
|
|
|
|
#ifdef RT_DEBUGING_PAGE_LEAK
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
TRACE_ALLOC(p, size_bits);
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
#endif
|
|
}
|
|
return alloc_buf;
|
|
}
|
|
|
|
void *rt_pages_alloc(rt_uint32_t size_bits)
|
|
{
|
|
return _do_pages_alloc(size_bits, 0);
|
|
}
|
|
|
|
void *rt_pages_alloc_ext(rt_uint32_t size_bits, size_t flags)
|
|
{
|
|
return _do_pages_alloc(size_bits, flags);
|
|
}
|
|
|
|
int rt_pages_free(void *addr, rt_uint32_t size_bits)
|
|
{
|
|
struct rt_page *p;
|
|
rt_page_t *page_list = _get_page_list(addr);
|
|
int real_free = 0;
|
|
|
|
p = rt_page_addr2page(addr);
|
|
if (p)
|
|
{
|
|
rt_base_t level;
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
real_free = _pages_free(page_list, p, size_bits);
|
|
if (real_free)
|
|
TRACE_FREE(p, size_bits);
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
}
|
|
|
|
return real_free;
|
|
}
|
|
|
|
void rt_page_list(void) __attribute__((alias("list_page")));
|
|
|
|
#define PGNR2SIZE(nr) ((nr) * ARCH_PAGE_SIZE / 1024)
|
|
|
|
void list_page(void)
|
|
{
|
|
int i;
|
|
rt_size_t free = 0;
|
|
rt_size_t installed = page_nr;
|
|
|
|
rt_base_t level;
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
|
|
for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
|
|
{
|
|
struct rt_page *lp = page_list_low[i];
|
|
struct rt_page *hp = page_list_high[i];
|
|
|
|
rt_kprintf("level %d ", i);
|
|
|
|
while (lp)
|
|
{
|
|
free += (1UL << i);
|
|
rt_kprintf("[0x%08p]", rt_page_page2addr(lp));
|
|
lp = lp->next;
|
|
}
|
|
while (hp)
|
|
{
|
|
free += (1UL << i);
|
|
rt_kprintf("[0x%08p]", rt_page_page2addr(hp));
|
|
hp = hp->next;
|
|
}
|
|
rt_kprintf("\n");
|
|
}
|
|
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
rt_kprintf("-------------------------------\n");
|
|
rt_kprintf("Page Summary:\n => free/installed: 0x%lx/0x%lx (%ld/%ld KB)\n", free, installed, PGNR2SIZE(free), PGNR2SIZE(installed));
|
|
rt_kprintf("-------------------------------\n");
|
|
}
|
|
MSH_CMD_EXPORT(list_page, show page info);
|
|
|
|
void rt_page_get_info(rt_size_t *total_nr, rt_size_t *free_nr)
|
|
{
|
|
int i;
|
|
rt_size_t total_free = 0;
|
|
rt_base_t level;
|
|
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
|
|
{
|
|
struct rt_page *p = page_list_low[i];
|
|
|
|
while (p)
|
|
{
|
|
total_free += (1UL << i);
|
|
p = p->next;
|
|
}
|
|
}
|
|
for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
|
|
{
|
|
struct rt_page *p = page_list_high[i];
|
|
|
|
while (p)
|
|
{
|
|
total_free += (1UL << i);
|
|
p = p->next;
|
|
}
|
|
}
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
*total_nr = page_nr;
|
|
*free_nr = total_free;
|
|
}
|
|
|
|
void rt_page_high_get_info(rt_size_t *total_nr, rt_size_t *free_nr)
|
|
{
|
|
int i;
|
|
rt_size_t total_free = 0;
|
|
rt_base_t level;
|
|
|
|
level = rt_spin_lock_irqsave(&_spinlock);
|
|
for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
|
|
{
|
|
struct rt_page *p = page_list_high[i];
|
|
|
|
while (p)
|
|
{
|
|
total_free += (1UL << i);
|
|
p = p->next;
|
|
}
|
|
}
|
|
rt_spin_unlock_irqrestore(&_spinlock, level);
|
|
*total_nr = _high_pages_nr;
|
|
*free_nr = total_free;
|
|
}
|
|
|
|
static void _install_page(rt_page_t mpr_head, rt_region_t region, void *insert_handler)
|
|
{
|
|
void (*insert)(rt_page_t *page_list, rt_page_t page, int size_bits) = insert_handler;
|
|
rt_region_t shadow;
|
|
shadow.start = region.start & ~shadow_mask;
|
|
shadow.end = FLOOR(region.end, shadow_mask + 1);
|
|
|
|
if (shadow.end + PV_OFFSET > UINT32_MAX)
|
|
_high_page_configured = 1;
|
|
|
|
rt_page_t shad_head = addr_to_page(mpr_head, (void *)shadow.start);
|
|
rt_page_t shad_tail = addr_to_page(mpr_head, (void *)shadow.end);
|
|
rt_page_t head = addr_to_page(mpr_head, (void *)region.start);
|
|
rt_page_t tail = addr_to_page(mpr_head, (void *)region.end);
|
|
|
|
/* mark shadow pages as illegal */
|
|
for (rt_page_t iter = shad_head; iter < head; iter++)
|
|
{
|
|
iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
}
|
|
for (rt_page_t iter = tail; iter < shad_tail; iter++)
|
|
{
|
|
iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
}
|
|
|
|
/* insert reserved pages to list */
|
|
const int max_order = RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1;
|
|
while (region.start != region.end)
|
|
{
|
|
struct rt_page *p;
|
|
int align_bits;
|
|
int size_bits;
|
|
|
|
size_bits =
|
|
ARCH_ADDRESS_WIDTH_BITS - 1 - rt_hw_clz(region.end - region.start);
|
|
align_bits = rt_hw_ctz(region.start);
|
|
if (align_bits < size_bits)
|
|
{
|
|
size_bits = align_bits;
|
|
}
|
|
if (size_bits > max_order)
|
|
{
|
|
size_bits = max_order;
|
|
}
|
|
|
|
p = addr_to_page(mpr_head, (void *)region.start);
|
|
p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
p->ref_cnt = 0;
|
|
|
|
/* insert to list */
|
|
rt_page_t *page_list = _get_page_list((void *)region.start);
|
|
if (page_list == page_list_high)
|
|
{
|
|
_high_pages_nr += 1 << (size_bits - ARCH_PAGE_SHIFT);
|
|
}
|
|
insert(page_list, (rt_page_t)((char *)p - early_offset), size_bits - ARCH_PAGE_SHIFT);
|
|
region.start += (1UL << size_bits);
|
|
}
|
|
}
|
|
|
|
void rt_page_init(rt_region_t reg)
|
|
{
|
|
int i;
|
|
rt_region_t shadow;
|
|
|
|
/* inclusive start, exclusive end */
|
|
reg.start += ARCH_PAGE_MASK;
|
|
reg.start &= ~ARCH_PAGE_MASK;
|
|
reg.end &= ~ARCH_PAGE_MASK;
|
|
if (reg.end <= reg.start)
|
|
{
|
|
LOG_E("region end(%p) must greater than start(%p)", reg.start, reg.end);
|
|
RT_ASSERT(0);
|
|
}
|
|
page_nr = ((reg.end - reg.start) >> ARCH_PAGE_SHIFT);
|
|
shadow.start = reg.start & ~shadow_mask;
|
|
shadow.end = FLOOR(reg.end, shadow_mask + 1);
|
|
LOG_D("[Init page] start: 0x%lx, end: 0x%lx, total: 0x%lx", reg.start,
|
|
reg.end, page_nr);
|
|
|
|
int err;
|
|
|
|
/* init free list */
|
|
for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
|
|
{
|
|
page_list_low[i] = 0;
|
|
page_list_high[i] = 0;
|
|
}
|
|
|
|
/* map MPR area */
|
|
err = rt_aspace_map_static(&rt_kernel_space, &mpr_varea, &rt_mpr_start,
|
|
rt_mpr_size, MMU_MAP_K_RWCB, MMF_MAP_FIXED,
|
|
&mm_page_mapper, 0);
|
|
|
|
if (err != RT_EOK)
|
|
{
|
|
LOG_E("MPR map failed with size %lx at %p", rt_mpr_size, rt_mpr_start);
|
|
RT_ASSERT(0);
|
|
}
|
|
|
|
/* calculate footprint */
|
|
init_mpr_align_start =
|
|
(rt_size_t)addr_to_page(page_start, (void *)shadow.start) &
|
|
~ARCH_PAGE_MASK;
|
|
init_mpr_align_end =
|
|
FLOOR(addr_to_page(page_start, (void *)shadow.end), ARCH_PAGE_SIZE);
|
|
rt_size_t init_mpr_size = init_mpr_align_end - init_mpr_align_start;
|
|
rt_size_t init_mpr_npage = init_mpr_size >> ARCH_PAGE_SHIFT;
|
|
|
|
init_mpr_cont_start = (void *)reg.start;
|
|
rt_size_t init_mpr_cont_end = (rt_size_t)init_mpr_cont_start + init_mpr_size;
|
|
early_offset = (rt_size_t)init_mpr_cont_start - init_mpr_align_start;
|
|
rt_page_t mpr_cont = (void *)((char *)rt_mpr_start + early_offset);
|
|
|
|
/* mark init mpr pages as illegal */
|
|
rt_page_t head_cont = addr_to_page(mpr_cont, (void *)reg.start);
|
|
rt_page_t tail_cont = addr_to_page(mpr_cont, (void *)reg.end);
|
|
for (rt_page_t iter = head_cont; iter < tail_cont; iter++)
|
|
{
|
|
iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
|
|
}
|
|
|
|
reg.start = init_mpr_cont_end;
|
|
_install_page(mpr_cont, reg, _early_page_insert);
|
|
|
|
pages_alloc_handler = _early_pages_alloc;
|
|
/* doing the page table bushiness */
|
|
if (rt_aspace_load_page(&rt_kernel_space, (void *)init_mpr_align_start, init_mpr_npage))
|
|
{
|
|
LOG_E("%s: failed to load pages", __func__);
|
|
RT_ASSERT(0);
|
|
}
|
|
|
|
if (rt_hw_mmu_tbl_get() == rt_kernel_space.page_table)
|
|
rt_page_cleanup();
|
|
}
|
|
|
|
static int _load_mpr_area(void *head, void *tail)
|
|
{
|
|
int err = 0;
|
|
char *iter = (char *)((rt_ubase_t)head & ~ARCH_PAGE_MASK);
|
|
tail = (void *)FLOOR(tail, ARCH_PAGE_SIZE);
|
|
|
|
while (iter != tail)
|
|
{
|
|
void *paddr = rt_kmem_v2p(iter);
|
|
if (paddr == ARCH_MAP_FAILED)
|
|
{
|
|
err = rt_aspace_load_page(&rt_kernel_space, iter, 1);
|
|
if (err != RT_EOK)
|
|
{
|
|
LOG_E("%s: failed to load page", __func__);
|
|
break;
|
|
}
|
|
}
|
|
iter += ARCH_PAGE_SIZE;
|
|
}
|
|
return err;
|
|
}
|
|
|
|
int rt_page_install(rt_region_t region)
|
|
{
|
|
int err = -RT_EINVAL;
|
|
rt_region_t shadow;
|
|
void *head, *tail;
|
|
|
|
if (region.end != region.start && !(region.start & ARCH_PAGE_MASK) &&
|
|
!(region.end & ARCH_PAGE_MASK))
|
|
{
|
|
shadow.start = region.start & ~shadow_mask;
|
|
shadow.end = FLOOR(region.end, shadow_mask + 1);
|
|
head = addr_to_page(page_start, (void *)shadow.start);
|
|
tail = addr_to_page(page_start, (void *)shadow.end);
|
|
|
|
page_nr += ((region.end - region.start) >> ARCH_PAGE_SHIFT);
|
|
|
|
err = _load_mpr_area(head, tail);
|
|
|
|
if (err == RT_EOK)
|
|
{
|
|
_install_page(rt_mpr_start, region, _page_insert);
|
|
}
|
|
}
|
|
return err;
|
|
}
|
|
|
|
void rt_page_cleanup(void)
|
|
{
|
|
early_offset = 0;
|
|
pages_alloc_handler = _pages_alloc;
|
|
}
|