mm_page.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857
  1. /*
  2. * Copyright (c) 2006-2022, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2019-11-01 Jesven The first version
  9. * 2022-12-13 WangXiaoyao Hot-pluggable, extensible
  10. * page management algorithm
  11. * 2023-02-20 WangXiaoyao Multi-list page-management
  12. */
  13. #include <rtthread.h>
  14. #include <stddef.h>
  15. #include <stdint.h>
  16. #include <string.h>
  17. #include "mm_fault.h"
  18. #include "mm_private.h"
  19. #include "mm_aspace.h"
  20. #include "mm_flag.h"
  21. #include "mm_page.h"
  22. #include <mmu.h>
  23. #define DBG_TAG "mm.page"
  24. #define DBG_LVL DBG_WARNING
  25. #include <rtdbg.h>
  26. RT_CTASSERT(order_huge_pg, RT_PAGE_MAX_ORDER > ARCH_PAGE_SHIFT - 2);
  27. RT_CTASSERT(size_width, sizeof(rt_size_t) == sizeof(void *));
  28. #ifdef RT_USING_SMART
  29. #include "lwp_arch_comm.h"
  30. #endif /* RT_USING_SMART */
  31. static rt_size_t init_mpr_align_start;
  32. static rt_size_t init_mpr_align_end;
  33. static void *init_mpr_cont_start;
  34. static struct rt_varea mpr_varea;
  35. static struct rt_page *page_list_low[RT_PAGE_MAX_ORDER];
  36. static struct rt_page *page_list_high[RT_PAGE_MAX_ORDER];
  37. #define page_start ((rt_page_t)rt_mpr_start)
  38. static rt_size_t page_nr;
  39. static rt_size_t early_offset;
  40. static const char *get_name(rt_varea_t varea)
  41. {
  42. return "master-page-record";
  43. }
  44. static void hint_free(rt_mm_va_hint_t hint)
  45. {
  46. hint->flags = MMF_MAP_FIXED;
  47. hint->limit_start = rt_kernel_space.start;
  48. hint->limit_range_size = rt_kernel_space.size;
  49. hint->prefer = rt_mpr_start;
  50. }
  51. static void on_page_fault(struct rt_varea *varea, struct rt_aspace_fault_msg *msg)
  52. {
  53. char *init_start = (void *)init_mpr_align_start;
  54. char *init_end = (void *)init_mpr_align_end;
  55. if ((char *)msg->fault_vaddr < init_end && (char *)msg->fault_vaddr >= init_start)
  56. {
  57. rt_size_t offset = (char *)msg->fault_vaddr - init_start;
  58. msg->response.status = MM_FAULT_STATUS_OK;
  59. msg->response.vaddr = (char *)init_mpr_cont_start + offset;
  60. msg->response.size = ARCH_PAGE_SIZE;
  61. }
  62. else
  63. {
  64. rt_mm_dummy_mapper.on_page_fault(varea, msg);
  65. }
  66. }
  67. static struct rt_mem_obj mm_page_mapper = {
  68. .get_name = get_name,
  69. .on_page_fault = on_page_fault,
  70. .hint_free = hint_free,
  71. };
  72. #ifdef RT_DEBUG_PAGE_LEAK
  73. static volatile int enable;
  74. static rt_page_t _trace_head;
  75. #define TRACE_ALLOC(pg, size) _trace_alloc(pg, __builtin_return_address(0), size)
  76. #define TRACE_FREE(pgaddr, size) _trace_free(pgaddr, __builtin_return_address(0), size)
  77. void rt_page_leak_trace_start()
  78. {
  79. // TODO multicore safety
  80. _trace_head = NULL;
  81. enable = 1;
  82. }
  83. MSH_CMD_EXPORT(rt_page_leak_trace_start, start page leak tracer);
  84. static void _collect()
  85. {
  86. rt_page_t page = _trace_head;
  87. if (!page)
  88. {
  89. rt_kputs("ok!\n");
  90. }
  91. while (page)
  92. {
  93. rt_page_t next = page->next;
  94. void *pg_va = rt_page_page2addr(page);
  95. LOG_W("LEAK: %p, allocator: %p, size bits: %lx", pg_va, page->caller, page->trace_size);
  96. rt_pages_free(pg_va, page->trace_size);
  97. page = next;
  98. }
  99. }
  100. void rt_page_leak_trace_stop()
  101. {
  102. // TODO multicore safety
  103. enable = 0;
  104. _collect();
  105. }
  106. MSH_CMD_EXPORT(rt_page_leak_trace_stop, stop page leak tracer);
  107. static void _trace_alloc(rt_page_t page, void *caller, size_t size_bits)
  108. {
  109. if (enable)
  110. {
  111. page->caller = caller;
  112. page->trace_size = size_bits;
  113. page->tl_prev = NULL;
  114. page->tl_next = NULL;
  115. if (_trace_head == NULL)
  116. {
  117. _trace_head = page;
  118. }
  119. else
  120. {
  121. _trace_head->tl_prev = page;
  122. page->tl_next = _trace_head;
  123. _trace_head = page;
  124. }
  125. }
  126. }
  127. void _report(rt_page_t page, size_bits, char *msg)
  128. {
  129. void *pg_va = rt_page_page2addr(page);
  130. LOG_W("%s: %p, allocator: %p, size bits: %lx", msg, pg_va, page->caller, page->trace_size);
  131. rt_kputs("backtrace\n");
  132. rt_hw_backtrace(0, 0);
  133. }
  134. static void _trace_free(rt_page_t page, void *caller, size_t size_bits)
  135. {
  136. if (enable)
  137. {
  138. /* free after free */
  139. if (page->trace_size == 0xabadcafe)
  140. {
  141. _report("free after free")
  142. return ;
  143. }
  144. else if (page->trace_size != size_bits)
  145. {
  146. rt_kprintf("free with size bits %lx\n", size_bits);
  147. _report("incompatible size bits parameter");
  148. return ;
  149. }
  150. if (page->ref_cnt == 1)
  151. {
  152. if (page->tl_prev)
  153. page->tl_prev->tl_next = page->tl_next;
  154. if (page->tl_next)
  155. page->tl_next->tl_prev = page->tl_prev;
  156. if (page == _trace_head)
  157. _trace_head = page->next;
  158. page->tl_prev = NULL;
  159. page->tl_next = NULL;
  160. page->trace_size = 0xabadcafe;
  161. }
  162. }
  163. }
  164. #else
  165. #define TRACE_ALLOC(x, y)
  166. #define TRACE_FREE(x, y)
  167. #endif
  168. static inline void *page_to_addr(rt_page_t page)
  169. {
  170. return (void *)(((page - page_start) << ARCH_PAGE_SHIFT) - PV_OFFSET);
  171. }
  172. static inline rt_page_t addr_to_page(rt_page_t pg_start, void *addr)
  173. {
  174. addr = (char *)addr + PV_OFFSET;
  175. return &pg_start[((rt_ubase_t)addr >> ARCH_PAGE_SHIFT)];
  176. }
  177. #define FLOOR(val, align) (((rt_size_t)(val) + (align)-1) & ~((align)-1))
  178. const rt_size_t shadow_mask =
  179. ((1ul << (RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1)) - 1);
  180. const rt_size_t rt_mpr_size = FLOOR(
  181. ((1ul << (ARCH_VADDR_WIDTH - ARCH_PAGE_SHIFT))) * sizeof(struct rt_page),
  182. ARCH_PAGE_SIZE);
  183. void *rt_mpr_start;
  184. rt_weak int rt_hw_clz(unsigned long n)
  185. {
  186. return __builtin_clzl(n);
  187. }
  188. rt_weak int rt_hw_ctz(unsigned long n)
  189. {
  190. return __builtin_ctzl(n);
  191. }
  192. rt_size_t rt_page_bits(rt_size_t size)
  193. {
  194. int bit = sizeof(rt_size_t) * 8 - rt_hw_clz(size) - 1;
  195. if ((size ^ (1UL << bit)) != 0)
  196. {
  197. bit++;
  198. }
  199. bit -= ARCH_PAGE_SHIFT;
  200. if (bit < 0)
  201. {
  202. bit = 0;
  203. }
  204. return bit;
  205. }
  206. struct rt_page *rt_page_addr2page(void *addr)
  207. {
  208. return addr_to_page(page_start, addr);
  209. }
  210. void *rt_page_page2addr(struct rt_page *p)
  211. {
  212. return page_to_addr(p);
  213. }
  214. static inline struct rt_page *_buddy_get(struct rt_page *p,
  215. rt_uint32_t size_bits)
  216. {
  217. rt_size_t addr;
  218. addr = (rt_size_t)rt_page_page2addr(p);
  219. addr ^= (1UL << (size_bits + ARCH_PAGE_SHIFT));
  220. return rt_page_addr2page((void *)addr);
  221. }
  222. static void _page_remove(rt_page_t page_list[], struct rt_page *p, rt_uint32_t size_bits)
  223. {
  224. if (p->pre)
  225. {
  226. p->pre->next = p->next;
  227. }
  228. else
  229. {
  230. page_list[size_bits] = p->next;
  231. }
  232. if (p->next)
  233. {
  234. p->next->pre = p->pre;
  235. }
  236. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  237. }
  238. static void _page_insert(rt_page_t page_list[], struct rt_page *p, rt_uint32_t size_bits)
  239. {
  240. p->next = page_list[size_bits];
  241. if (p->next)
  242. {
  243. p->next->pre = p;
  244. }
  245. p->pre = 0;
  246. page_list[size_bits] = p;
  247. p->size_bits = size_bits;
  248. }
  249. static void _pages_ref_inc(struct rt_page *p, rt_uint32_t size_bits)
  250. {
  251. struct rt_page *page_head;
  252. int idx;
  253. /* find page group head */
  254. idx = p - page_start;
  255. idx = idx & ~((1UL << size_bits) - 1);
  256. page_head = page_start + idx;
  257. page_head = (void *)((char *)page_head + early_offset);
  258. page_head->ref_cnt++;
  259. }
  260. static int _pages_ref_get(struct rt_page *p, rt_uint32_t size_bits)
  261. {
  262. struct rt_page *page_head;
  263. int idx;
  264. /* find page group head */
  265. idx = p - page_start;
  266. idx = idx & ~((1UL << size_bits) - 1);
  267. page_head = page_start + idx;
  268. return page_head->ref_cnt;
  269. }
  270. static int _pages_free(rt_page_t page_list[], struct rt_page *p, rt_uint32_t size_bits)
  271. {
  272. rt_uint32_t level = size_bits;
  273. struct rt_page *buddy;
  274. RT_ASSERT(p >= page_start);
  275. RT_ASSERT((char *)p < (char *)rt_mpr_start + rt_mpr_size);
  276. RT_ASSERT(rt_kmem_v2p(p));
  277. RT_ASSERT(p->ref_cnt > 0);
  278. RT_ASSERT(p->size_bits == ARCH_ADDRESS_WIDTH_BITS);
  279. RT_ASSERT(size_bits < RT_PAGE_MAX_ORDER);
  280. p->ref_cnt--;
  281. if (p->ref_cnt != 0)
  282. {
  283. return 0;
  284. }
  285. while (level < RT_PAGE_MAX_ORDER - 1)
  286. {
  287. buddy = _buddy_get(p, level);
  288. if (buddy && buddy->size_bits == level)
  289. {
  290. _page_remove(page_list, buddy, level);
  291. p = (p < buddy) ? p : buddy;
  292. level++;
  293. }
  294. else
  295. {
  296. break;
  297. }
  298. }
  299. _page_insert(page_list, p, level);
  300. return 1;
  301. }
  302. static struct rt_page *_pages_alloc(rt_page_t page_list[], rt_uint32_t size_bits)
  303. {
  304. struct rt_page *p;
  305. if (page_list[size_bits])
  306. {
  307. p = page_list[size_bits];
  308. _page_remove(page_list, p, size_bits);
  309. }
  310. else
  311. {
  312. rt_uint32_t level;
  313. for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
  314. {
  315. if (page_list[level])
  316. {
  317. break;
  318. }
  319. }
  320. if (level == RT_PAGE_MAX_ORDER)
  321. {
  322. return 0;
  323. }
  324. p = page_list[level];
  325. _page_remove(page_list, p, level);
  326. while (level > size_bits)
  327. {
  328. _page_insert(page_list, p, level - 1);
  329. p = _buddy_get(p, level - 1);
  330. level--;
  331. }
  332. }
  333. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  334. p->ref_cnt = 1;
  335. return p;
  336. }
  337. static void _early_page_remove(rt_page_t page_list[], rt_page_t page, rt_uint32_t size_bits)
  338. {
  339. rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
  340. if (page_cont->pre)
  341. {
  342. rt_page_t pre_cont = (rt_page_t)((char *)page_cont->pre + early_offset);
  343. pre_cont->next = page_cont->next;
  344. }
  345. else
  346. {
  347. page_list[size_bits] = page_cont->next;
  348. }
  349. if (page_cont->next)
  350. {
  351. rt_page_t next_cont = (rt_page_t)((char *)page_cont->next + early_offset);
  352. next_cont->pre = page_cont->pre;
  353. }
  354. page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  355. }
  356. static void _early_page_insert(rt_page_t page_list[], rt_page_t page, int size_bits)
  357. {
  358. RT_ASSERT((void *)page >= rt_mpr_start &&
  359. ((char *)page - (char *)rt_mpr_start) < rt_mpr_size);
  360. rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
  361. page_cont->next = page_list[size_bits];
  362. if (page_cont->next)
  363. {
  364. rt_page_t next_cont = (rt_page_t)((char *)page_cont->next + early_offset);
  365. next_cont->pre = page;
  366. }
  367. page_cont->pre = 0;
  368. page_list[size_bits] = page;
  369. page_cont->size_bits = size_bits;
  370. }
  371. static struct rt_page *_early_pages_alloc(rt_page_t page_list[], rt_uint32_t size_bits)
  372. {
  373. struct rt_page *p;
  374. if (page_list[size_bits])
  375. {
  376. p = page_list[size_bits];
  377. _early_page_remove(page_list, p, size_bits);
  378. }
  379. else
  380. {
  381. rt_uint32_t level;
  382. for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
  383. {
  384. if (page_list[level])
  385. {
  386. break;
  387. }
  388. }
  389. if (level == RT_PAGE_MAX_ORDER)
  390. {
  391. return 0;
  392. }
  393. p = page_list[level];
  394. _early_page_remove(page_list, p, level);
  395. while (level > size_bits)
  396. {
  397. _early_page_insert(page_list, p, level - 1);
  398. p = _buddy_get(p, level - 1);
  399. level--;
  400. }
  401. }
  402. rt_page_t page_cont = (rt_page_t)((char *)p + early_offset);
  403. page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  404. page_cont->ref_cnt = 1;
  405. return p;
  406. }
  407. static rt_page_t *_get_page_list(void *vaddr)
  408. {
  409. rt_ubase_t pa_int = (rt_ubase_t)vaddr + PV_OFFSET;
  410. rt_page_t *list;
  411. if (pa_int > UINT32_MAX)
  412. {
  413. list = page_list_high;
  414. }
  415. else
  416. {
  417. list = page_list_low;
  418. }
  419. return list;
  420. }
  421. int rt_page_ref_get(void *addr, rt_uint32_t size_bits)
  422. {
  423. struct rt_page *p;
  424. rt_base_t level;
  425. int ref;
  426. p = rt_page_addr2page(addr);
  427. level = rt_hw_interrupt_disable();
  428. ref = _pages_ref_get(p, size_bits);
  429. rt_hw_interrupt_enable(level);
  430. return ref;
  431. }
  432. void rt_page_ref_inc(void *addr, rt_uint32_t size_bits)
  433. {
  434. struct rt_page *p;
  435. rt_base_t level;
  436. p = rt_page_addr2page(addr);
  437. level = rt_hw_interrupt_disable();
  438. _pages_ref_inc(p, size_bits);
  439. rt_hw_interrupt_enable(level);
  440. }
  441. static rt_page_t (*pages_alloc_handler)(rt_page_t page_list[], rt_uint32_t size_bits);
  442. /* if not, we skip the finding on page_list_high */
  443. static size_t _high_page_configured = 0;
  444. static rt_page_t *_flag_to_page_list(size_t flags)
  445. {
  446. rt_page_t *page_list;
  447. if (_high_page_configured && (flags & PAGE_ANY_AVAILABLE))
  448. {
  449. page_list = page_list_high;
  450. }
  451. else
  452. {
  453. page_list = page_list_low;
  454. }
  455. return page_list;
  456. }
  457. static void *_do_pages_alloc(rt_uint32_t size_bits, size_t flags)
  458. {
  459. void *alloc_buf = RT_NULL;
  460. struct rt_page *p;
  461. rt_base_t level;
  462. rt_page_t *page_list = _flag_to_page_list(flags);
  463. level = rt_hw_interrupt_disable();
  464. p = pages_alloc_handler(page_list, size_bits);
  465. rt_hw_interrupt_enable(level);
  466. if (!p && page_list != page_list_low)
  467. {
  468. /* fall back */
  469. page_list = page_list_low;
  470. level = rt_hw_interrupt_disable();
  471. p = pages_alloc_handler(page_list, size_bits);
  472. rt_hw_interrupt_enable(level);
  473. }
  474. if (p)
  475. {
  476. alloc_buf = page_to_addr(p);
  477. #ifdef RT_DEBUG_PAGE_LEAK
  478. level = rt_hw_interrupt_disable();
  479. TRACE_ALLOC(p, size_bits);
  480. rt_hw_interrupt_enable(level);
  481. #endif
  482. }
  483. return alloc_buf;
  484. }
  485. void *rt_pages_alloc(rt_uint32_t size_bits)
  486. {
  487. return _do_pages_alloc(size_bits, 0);
  488. }
  489. void *rt_pages_alloc_ext(rt_uint32_t size_bits, size_t flags)
  490. {
  491. return _do_pages_alloc(size_bits, flags);
  492. }
  493. int rt_pages_free(void *addr, rt_uint32_t size_bits)
  494. {
  495. struct rt_page *p;
  496. rt_page_t *page_list = _get_page_list(addr);
  497. int real_free = 0;
  498. p = rt_page_addr2page(addr);
  499. if (p)
  500. {
  501. rt_base_t level;
  502. level = rt_hw_interrupt_disable();
  503. real_free = _pages_free(page_list, p, size_bits);
  504. if (real_free)
  505. TRACE_FREE(p, size_bits);
  506. rt_hw_interrupt_enable(level);
  507. }
  508. return real_free;
  509. }
  510. void rt_page_list(void) __attribute__((alias("list_page")));
  511. #warning TODO: improve list page
  512. void list_page(void)
  513. {
  514. int i;
  515. rt_size_t total = 0;
  516. rt_base_t level;
  517. level = rt_hw_interrupt_disable();
  518. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  519. {
  520. struct rt_page *p = page_list_low[i];
  521. rt_kprintf("level %d ", i);
  522. while (p)
  523. {
  524. total += (1UL << i);
  525. rt_kprintf("[0x%08p]", rt_page_page2addr(p));
  526. p = p->next;
  527. }
  528. rt_kprintf("\n");
  529. }
  530. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  531. {
  532. struct rt_page *p = page_list_high[i];
  533. rt_kprintf("level %d ", i);
  534. while (p)
  535. {
  536. total += (1UL << i);
  537. rt_kprintf("[0x%08p]", rt_page_page2addr(p));
  538. p = p->next;
  539. }
  540. rt_kprintf("\n");
  541. }
  542. rt_hw_interrupt_enable(level);
  543. rt_kprintf("free pages is 0x%08lx (%ld KB)\n", total, total * ARCH_PAGE_SIZE / 1024);
  544. rt_kprintf("-------------------------------\n");
  545. }
  546. MSH_CMD_EXPORT(list_page, show page info);
  547. void rt_page_get_info(rt_size_t *total_nr, rt_size_t *free_nr)
  548. {
  549. int i;
  550. rt_size_t total_free = 0;
  551. rt_base_t level;
  552. level = rt_hw_interrupt_disable();
  553. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  554. {
  555. struct rt_page *p = page_list_low[i];
  556. while (p)
  557. {
  558. total_free += (1UL << i);
  559. p = p->next;
  560. }
  561. }
  562. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  563. {
  564. struct rt_page *p = page_list_high[i];
  565. while (p)
  566. {
  567. total_free += (1UL << i);
  568. p = p->next;
  569. }
  570. }
  571. rt_hw_interrupt_enable(level);
  572. *total_nr = page_nr;
  573. *free_nr = total_free;
  574. }
  575. static void _install_page(rt_page_t mpr_head, rt_region_t region, void *insert_handler)
  576. {
  577. void (*insert)(rt_page_t *page_list, rt_page_t page, int size_bits) = insert_handler;
  578. rt_region_t shadow;
  579. shadow.start = region.start & ~shadow_mask;
  580. shadow.end = FLOOR(region.end, shadow_mask + 1);
  581. if (shadow.end + PV_OFFSET > UINT32_MAX)
  582. _high_page_configured = 1;
  583. rt_page_t shad_head = addr_to_page(mpr_head, (void *)shadow.start);
  584. rt_page_t shad_tail = addr_to_page(mpr_head, (void *)shadow.end);
  585. rt_page_t head = addr_to_page(mpr_head, (void *)region.start);
  586. rt_page_t tail = addr_to_page(mpr_head, (void *)region.end);
  587. /* mark shadow pages as illegal */
  588. for (rt_page_t iter = shad_head; iter < head; iter++)
  589. {
  590. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  591. }
  592. for (rt_page_t iter = tail; iter < shad_tail; iter++)
  593. {
  594. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  595. }
  596. /* insert reserved pages to list */
  597. const int max_order = RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1;
  598. while (region.start != region.end)
  599. {
  600. struct rt_page *p;
  601. int align_bits;
  602. int size_bits;
  603. size_bits =
  604. ARCH_ADDRESS_WIDTH_BITS - 1 - rt_hw_clz(region.end - region.start);
  605. align_bits = rt_hw_ctz(region.start);
  606. if (align_bits < size_bits)
  607. {
  608. size_bits = align_bits;
  609. }
  610. if (size_bits > max_order)
  611. {
  612. size_bits = max_order;
  613. }
  614. p = addr_to_page(mpr_head, (void *)region.start);
  615. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  616. p->ref_cnt = 0;
  617. /* insert to list */
  618. rt_page_t *page_list = _get_page_list((void *)region.start);
  619. insert(page_list, (rt_page_t)((char *)p - early_offset), size_bits - ARCH_PAGE_SHIFT);
  620. region.start += (1UL << size_bits);
  621. }
  622. }
  623. void rt_page_init(rt_region_t reg)
  624. {
  625. int i;
  626. rt_region_t shadow;
  627. /* inclusive start, exclusive end */
  628. reg.start += ARCH_PAGE_MASK;
  629. reg.start &= ~ARCH_PAGE_MASK;
  630. reg.end &= ~ARCH_PAGE_MASK;
  631. if (reg.end <= reg.start)
  632. {
  633. LOG_E("region end(%p) must greater than start(%p)", reg.start, reg.end);
  634. RT_ASSERT(0);
  635. }
  636. page_nr = ((reg.end - reg.start) >> ARCH_PAGE_SHIFT);
  637. shadow.start = reg.start & ~shadow_mask;
  638. shadow.end = FLOOR(reg.end, shadow_mask + 1);
  639. LOG_D("[Init page] start: 0x%lx, end: 0x%lx, total: 0x%lx", reg.start,
  640. reg.end, page_nr);
  641. int err;
  642. /* init free list */
  643. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  644. {
  645. page_list_low[i] = 0;
  646. page_list_high[i] = 0;
  647. }
  648. /* map MPR area */
  649. err = rt_aspace_map_static(&rt_kernel_space, &mpr_varea, &rt_mpr_start,
  650. rt_mpr_size, MMU_MAP_K_RWCB, MMF_MAP_FIXED,
  651. &mm_page_mapper, 0);
  652. if (err != RT_EOK)
  653. {
  654. LOG_E("MPR map failed with size %lx at %p", rt_mpr_size, rt_mpr_start);
  655. RT_ASSERT(0);
  656. }
  657. /* calculate footprint */
  658. init_mpr_align_start =
  659. (rt_size_t)addr_to_page(page_start, (void *)shadow.start) &
  660. ~ARCH_PAGE_MASK;
  661. init_mpr_align_end =
  662. FLOOR(addr_to_page(page_start, (void *)shadow.end), ARCH_PAGE_SIZE);
  663. rt_size_t init_mpr_size = init_mpr_align_end - init_mpr_align_start;
  664. rt_size_t init_mpr_npage = init_mpr_size >> ARCH_PAGE_SHIFT;
  665. init_mpr_cont_start = (void *)reg.start;
  666. rt_size_t init_mpr_cont_end = (rt_size_t)init_mpr_cont_start + init_mpr_size;
  667. early_offset = (rt_size_t)init_mpr_cont_start - init_mpr_align_start;
  668. rt_page_t mpr_cont = (void *)((char *)rt_mpr_start + early_offset);
  669. /* mark init mpr pages as illegal */
  670. rt_page_t head_cont = addr_to_page(mpr_cont, (void *)reg.start);
  671. rt_page_t tail_cont = addr_to_page(mpr_cont, (void *)reg.end);
  672. for (rt_page_t iter = head_cont; iter < tail_cont; iter++)
  673. {
  674. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  675. }
  676. reg.start = init_mpr_cont_end;
  677. _install_page(mpr_cont, reg, _early_page_insert);
  678. pages_alloc_handler = _early_pages_alloc;
  679. /* doing the page table bushiness */
  680. if (rt_aspace_load_page(&rt_kernel_space, (void *)init_mpr_align_start, init_mpr_npage))
  681. {
  682. LOG_E("%s: failed to load pages", __func__);
  683. RT_ASSERT(0);
  684. }
  685. if (rt_hw_mmu_tbl_get() == rt_kernel_space.page_table)
  686. rt_page_cleanup();
  687. }
  688. static int _load_mpr_area(void *head, void *tail)
  689. {
  690. int err = 0;
  691. char *iter = (char *)((rt_ubase_t)head & ~ARCH_PAGE_MASK);
  692. tail = (void *)FLOOR(tail, ARCH_PAGE_SIZE);
  693. while (iter != tail)
  694. {
  695. void *paddr = rt_kmem_v2p(iter);
  696. if (paddr == ARCH_MAP_FAILED)
  697. {
  698. err = rt_aspace_load_page(&rt_kernel_space, iter, 1);
  699. if (err != RT_EOK)
  700. {
  701. LOG_E("%s: failed to load page", __func__);
  702. break;
  703. }
  704. }
  705. iter += ARCH_PAGE_SIZE;
  706. }
  707. return err;
  708. }
  709. int rt_page_install(rt_region_t region)
  710. {
  711. int err = -RT_EINVAL;
  712. if (region.end != region.start && !(region.start & ARCH_PAGE_MASK) &&
  713. !(region.end & ARCH_PAGE_MASK) &&
  714. !((region.end - region.start) & shadow_mask))
  715. {
  716. void *head = addr_to_page(page_start, (void *)region.start);
  717. void *tail = addr_to_page(page_start, (void *)region.end);
  718. page_nr += ((region.end - region.start) >> ARCH_PAGE_SHIFT);
  719. err = _load_mpr_area(head, tail);
  720. if (err == RT_EOK)
  721. {
  722. _install_page(rt_mpr_start, region, _page_insert);
  723. }
  724. }
  725. return err;
  726. }
  727. void rt_page_cleanup(void)
  728. {
  729. early_offset = 0;
  730. pages_alloc_handler = _pages_alloc;
  731. }