mm_page.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661
  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. */
  12. #include <rtthread.h>
  13. #include <stddef.h>
  14. #include <stdint.h>
  15. #include <string.h>
  16. #include "mm_fault.h"
  17. #include "mm_private.h"
  18. #include "mm_aspace.h"
  19. #include "mm_flag.h"
  20. #include "mm_page.h"
  21. #include <mmu.h>
  22. #define DBG_TAG "mm.page"
  23. #define DBG_LVL DBG_WARNING
  24. #include <rtdbg.h>
  25. #ifdef RT_USING_SMART
  26. #include "lwp_arch_comm.h"
  27. #define CT_ASSERT(name, x) \
  28. struct assert_##name \
  29. { \
  30. char ary[2 * (x)-1]; \
  31. }
  32. #ifdef ARCH_CPU_64BIT
  33. CT_ASSERT(order_huge_pg, RT_PAGE_MAX_ORDER > ARCH_PAGE_SHIFT - 2);
  34. #else
  35. CT_ASSERT(size_width, sizeof(rt_size_t) == sizeof(rt_size_t));
  36. #endif /* ARCH_CPU_64BIT */
  37. #else
  38. #define PV_OFFSET 0
  39. #endif /* RT_USING_SMART */
  40. static rt_size_t init_mpr_align_start;
  41. static rt_size_t init_mpr_align_end;
  42. static void *init_mpr_cont_start;
  43. static struct rt_varea mpr_varea;
  44. static struct rt_page *page_list[RT_PAGE_MAX_ORDER];
  45. #define page_start ((rt_page_t)rt_mpr_start)
  46. static rt_size_t page_nr;
  47. static rt_size_t early_offset;
  48. static const char *get_name(rt_varea_t varea)
  49. {
  50. return "master-page-record";
  51. }
  52. static void hint_free(rt_mm_va_hint_t hint)
  53. {
  54. hint->flags = MMF_MAP_FIXED;
  55. hint->limit_start = rt_kernel_space.start;
  56. hint->limit_range_size = rt_kernel_space.size;
  57. hint->prefer = rt_mpr_start;
  58. }
  59. static void on_page_fault(struct rt_varea *varea, struct rt_mm_fault_msg *msg)
  60. {
  61. void *init_start = (void *)init_mpr_align_start;
  62. void *init_end = (void *)init_mpr_align_end;
  63. if (msg->vaddr < init_end && msg->vaddr >= init_start)
  64. {
  65. rt_size_t offset = msg->vaddr - init_start;
  66. msg->response.status = MM_FAULT_STATUS_OK;
  67. msg->response.vaddr = init_mpr_cont_start + offset;
  68. msg->response.size = ARCH_PAGE_SIZE;
  69. }
  70. else
  71. {
  72. void *raw_page = rt_pages_alloc(0);
  73. msg->response.status = MM_FAULT_STATUS_OK;
  74. msg->response.vaddr = raw_page;
  75. msg->response.size = ARCH_PAGE_SIZE;
  76. }
  77. }
  78. static struct rt_mem_obj mm_page_mapper = {
  79. .get_name = get_name,
  80. .on_page_fault = on_page_fault,
  81. .hint_free = hint_free,
  82. };
  83. static inline void *page_to_addr(rt_page_t page)
  84. {
  85. return (void *)((page - page_start) << ARCH_PAGE_SHIFT) - PV_OFFSET;
  86. }
  87. static inline rt_page_t addr_to_page(rt_page_t pg_start, void *addr)
  88. {
  89. addr += PV_OFFSET;
  90. return &pg_start[((uintptr_t)addr >> ARCH_PAGE_SHIFT)];
  91. }
  92. #define FLOOR(val, align) (((rt_size_t)(val) + (align)-1) & ~((align)-1))
  93. const rt_size_t shadow_mask =
  94. ((1ul << (RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1)) - 1);
  95. const rt_size_t rt_mpr_size = FLOOR(
  96. ((1ul << (ARCH_VADDR_WIDTH - ARCH_PAGE_SHIFT))) * sizeof(struct rt_page),
  97. ARCH_PAGE_SIZE);
  98. void *rt_mpr_start;
  99. rt_weak int rt_hw_clz(unsigned long n)
  100. {
  101. return __builtin_clzl(n);
  102. }
  103. rt_weak int rt_hw_ctz(unsigned long n)
  104. {
  105. return __builtin_ctzl(n);
  106. }
  107. rt_size_t rt_page_bits(rt_size_t size)
  108. {
  109. int bit = sizeof(rt_size_t) * 8 - rt_hw_clz(size) - 1;
  110. if ((size ^ (1UL << bit)) != 0)
  111. {
  112. bit++;
  113. }
  114. bit -= ARCH_PAGE_SHIFT;
  115. if (bit < 0)
  116. {
  117. bit = 0;
  118. }
  119. return bit;
  120. }
  121. struct rt_page *rt_page_addr2page(void *addr)
  122. {
  123. return addr_to_page(page_start, addr);
  124. }
  125. void *rt_page_page2addr(struct rt_page *p)
  126. {
  127. return page_to_addr(p);
  128. }
  129. static inline struct rt_page *buddy_get(struct rt_page *p,
  130. rt_uint32_t size_bits)
  131. {
  132. rt_size_t addr;
  133. addr = (rt_size_t)rt_page_page2addr(p);
  134. addr ^= (1UL << (size_bits + ARCH_PAGE_SHIFT));
  135. return rt_page_addr2page((void *)addr);
  136. }
  137. static void page_remove(struct rt_page *p, rt_uint32_t size_bits)
  138. {
  139. if (p->pre)
  140. {
  141. p->pre->next = p->next;
  142. }
  143. else
  144. {
  145. page_list[size_bits] = p->next;
  146. }
  147. if (p->next)
  148. {
  149. p->next->pre = p->pre;
  150. }
  151. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  152. }
  153. static void page_insert(struct rt_page *p, rt_uint32_t size_bits)
  154. {
  155. p->next = page_list[size_bits];
  156. if (p->next)
  157. {
  158. p->next->pre = p;
  159. }
  160. p->pre = 0;
  161. page_list[size_bits] = p;
  162. p->size_bits = size_bits;
  163. }
  164. static void _pages_ref_inc(struct rt_page *p, rt_uint32_t size_bits)
  165. {
  166. struct rt_page *page_head;
  167. int idx;
  168. /* find page group head */
  169. idx = p - page_start;
  170. idx = idx & ~((1UL << size_bits) - 1);
  171. page_head = page_start + idx;
  172. page_head = (void *)page_head + early_offset;
  173. page_head->ref_cnt++;
  174. }
  175. static int _pages_ref_get(struct rt_page *p, rt_uint32_t size_bits)
  176. {
  177. struct rt_page *page_head;
  178. int idx;
  179. /* find page group head */
  180. idx = p - page_start;
  181. idx = idx & ~((1UL << size_bits) - 1);
  182. page_head = page_start + idx;
  183. return page_head->ref_cnt;
  184. }
  185. static int _pages_free(struct rt_page *p, rt_uint32_t size_bits)
  186. {
  187. rt_uint32_t level = size_bits;
  188. struct rt_page *buddy;
  189. RT_ASSERT(p >= page_start);
  190. RT_ASSERT((void *)p < rt_mpr_start + rt_mpr_size);
  191. RT_ASSERT(rt_kmem_v2p(p));
  192. RT_ASSERT(p->ref_cnt > 0);
  193. RT_ASSERT(p->size_bits == ARCH_ADDRESS_WIDTH_BITS);
  194. RT_ASSERT(size_bits < RT_PAGE_MAX_ORDER);
  195. p->ref_cnt--;
  196. if (p->ref_cnt != 0)
  197. {
  198. return 0;
  199. }
  200. while (level < RT_PAGE_MAX_ORDER - 1)
  201. {
  202. buddy = buddy_get(p, level);
  203. if (buddy && buddy->size_bits == level)
  204. {
  205. page_remove(buddy, level);
  206. p = (p < buddy) ? p : buddy;
  207. level++;
  208. }
  209. else
  210. {
  211. break;
  212. }
  213. }
  214. page_insert(p, level);
  215. return 1;
  216. }
  217. static struct rt_page *_pages_alloc(rt_uint32_t size_bits)
  218. {
  219. struct rt_page *p;
  220. if (page_list[size_bits])
  221. {
  222. p = page_list[size_bits];
  223. page_remove(p, size_bits);
  224. }
  225. else
  226. {
  227. rt_uint32_t level;
  228. for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
  229. {
  230. if (page_list[level])
  231. {
  232. break;
  233. }
  234. }
  235. if (level == RT_PAGE_MAX_ORDER)
  236. {
  237. return 0;
  238. }
  239. p = page_list[level];
  240. page_remove(p, level);
  241. while (level > size_bits)
  242. {
  243. page_insert(p, level - 1);
  244. p = buddy_get(p, level - 1);
  245. level--;
  246. }
  247. }
  248. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  249. p->ref_cnt = 1;
  250. return p;
  251. }
  252. static void _early_page_remove(rt_page_t page, rt_uint32_t size_bits)
  253. {
  254. rt_page_t page_cont = (void *)page + early_offset;
  255. if (page_cont->pre)
  256. {
  257. rt_page_t pre_cont = (void *)page_cont->pre + early_offset;
  258. pre_cont->next = page_cont->next;
  259. }
  260. else
  261. {
  262. page_list[size_bits] = page_cont->next;
  263. }
  264. if (page_cont->next)
  265. {
  266. rt_page_t next_cont = (void *)page_cont->next + early_offset;
  267. next_cont->pre = page_cont->pre;
  268. }
  269. page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  270. }
  271. static void _early_page_insert(rt_page_t page, int size_bits)
  272. {
  273. RT_ASSERT((void *)page >= rt_mpr_start &&
  274. (void *)page - rt_mpr_start < +rt_mpr_size);
  275. rt_page_t page_cont = (void *)page + early_offset;
  276. page_cont->next = page_list[size_bits];
  277. if (page_cont->next)
  278. {
  279. rt_page_t next_cont = (void *)page_cont->next + early_offset;
  280. next_cont->pre = page;
  281. }
  282. page_cont->pre = 0;
  283. page_list[size_bits] = page;
  284. page_cont->size_bits = size_bits;
  285. }
  286. static struct rt_page *_early_pages_alloc(rt_uint32_t size_bits)
  287. {
  288. struct rt_page *p;
  289. if (page_list[size_bits])
  290. {
  291. p = page_list[size_bits];
  292. _early_page_remove(p, size_bits);
  293. }
  294. else
  295. {
  296. rt_uint32_t level;
  297. for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
  298. {
  299. if (page_list[level])
  300. {
  301. break;
  302. }
  303. }
  304. if (level == RT_PAGE_MAX_ORDER)
  305. {
  306. return 0;
  307. }
  308. p = page_list[level];
  309. _early_page_remove(p, level);
  310. while (level > size_bits)
  311. {
  312. _early_page_insert(p, level - 1);
  313. p = buddy_get(p, level - 1);
  314. level--;
  315. }
  316. }
  317. rt_page_t page_cont = (void *)p + early_offset;
  318. page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  319. page_cont->ref_cnt = 1;
  320. return p;
  321. }
  322. int rt_page_ref_get(void *addr, rt_uint32_t size_bits)
  323. {
  324. struct rt_page *p;
  325. rt_base_t level;
  326. int ref;
  327. p = rt_page_addr2page(addr);
  328. level = rt_hw_interrupt_disable();
  329. ref = _pages_ref_get(p, size_bits);
  330. rt_hw_interrupt_enable(level);
  331. return ref;
  332. }
  333. void rt_page_ref_inc(void *addr, rt_uint32_t size_bits)
  334. {
  335. struct rt_page *p;
  336. rt_base_t level;
  337. p = rt_page_addr2page(addr);
  338. level = rt_hw_interrupt_disable();
  339. _pages_ref_inc(p, size_bits);
  340. rt_hw_interrupt_enable(level);
  341. }
  342. static rt_page_t (*pages_alloc_handler)(rt_uint32_t size_bits);
  343. void *rt_pages_alloc(rt_uint32_t size_bits)
  344. {
  345. struct rt_page *p;
  346. rt_base_t level;
  347. level = rt_hw_interrupt_disable();
  348. p = pages_alloc_handler(size_bits);
  349. rt_hw_interrupt_enable(level);
  350. return page_to_addr(p);
  351. }
  352. int rt_pages_free(void *addr, rt_uint32_t size_bits)
  353. {
  354. struct rt_page *p;
  355. int real_free = 0;
  356. p = rt_page_addr2page(addr);
  357. if (p)
  358. {
  359. rt_base_t level;
  360. level = rt_hw_interrupt_disable();
  361. real_free = _pages_free(p, size_bits);
  362. rt_hw_interrupt_enable(level);
  363. }
  364. return real_free;
  365. }
  366. void rt_page_list(void) __attribute__((alias("list_page")));
  367. void list_page(void)
  368. {
  369. int i;
  370. rt_size_t total = 0;
  371. rt_base_t level;
  372. level = rt_hw_interrupt_disable();
  373. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  374. {
  375. struct rt_page *p = page_list[i];
  376. rt_kprintf("level %d ", i);
  377. while (p)
  378. {
  379. total += (1UL << i);
  380. rt_kprintf("[0x%08p]", rt_page_page2addr(p));
  381. p = p->next;
  382. }
  383. rt_kprintf("\n");
  384. }
  385. rt_hw_interrupt_enable(level);
  386. rt_kprintf("free pages is 0x%08x\n", total);
  387. rt_kprintf("-------------------------------\n");
  388. }
  389. MSH_CMD_EXPORT(list_page, show page info);
  390. void rt_page_get_info(rt_size_t *total_nr, rt_size_t *free_nr)
  391. {
  392. int i;
  393. rt_size_t total_free = 0;
  394. rt_base_t level;
  395. level = rt_hw_interrupt_disable();
  396. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  397. {
  398. struct rt_page *p = page_list[i];
  399. while (p)
  400. {
  401. total_free += (1UL << i);
  402. p = p->next;
  403. }
  404. }
  405. rt_hw_interrupt_enable(level);
  406. *total_nr = page_nr;
  407. *free_nr = total_free;
  408. }
  409. void rt_page_init(rt_region_t reg)
  410. {
  411. int i;
  412. rt_region_t shadow;
  413. /* inclusive start, exclusive end */
  414. reg.start += ARCH_PAGE_MASK;
  415. reg.start &= ~ARCH_PAGE_MASK;
  416. reg.end &= ~ARCH_PAGE_MASK;
  417. if (reg.end <= reg.start)
  418. {
  419. LOG_E("region end(%p) must greater than start(%p)", reg.start, reg.end);
  420. RT_ASSERT(0);
  421. }
  422. page_nr = ((reg.end - reg.start) >> ARCH_PAGE_SHIFT);
  423. shadow.start = reg.start & ~shadow_mask;
  424. shadow.end = FLOOR(reg.end, shadow_mask + 1);
  425. LOG_D("[Init page] start: 0x%lx, end: 0x%lx, total: 0x%lx", reg.start,
  426. reg.end, page_nr);
  427. int err;
  428. /* init free list */
  429. for (i = 0; i < RT_PAGE_MAX_ORDER; i++)
  430. {
  431. page_list[i] = 0;
  432. }
  433. /* map MPR area */
  434. err = rt_aspace_map_static(&rt_kernel_space, &mpr_varea, &rt_mpr_start,
  435. rt_mpr_size, MMU_MAP_K_RWCB, MMF_MAP_FIXED,
  436. &mm_page_mapper, 0);
  437. if (err != RT_EOK)
  438. {
  439. LOG_E("MPR map failed with size %lx at %p", rt_mpr_size, rt_mpr_start);
  440. RT_ASSERT(0);
  441. }
  442. /* calculate footprint */
  443. init_mpr_align_start =
  444. (rt_size_t)addr_to_page(page_start, (void *)shadow.start) &
  445. ~ARCH_PAGE_MASK;
  446. init_mpr_align_end =
  447. FLOOR(addr_to_page(page_start, (void *)shadow.end), ARCH_PAGE_SIZE);
  448. rt_size_t init_mpr_size = init_mpr_align_end - init_mpr_align_start;
  449. rt_size_t init_mpr_npage = init_mpr_size >> ARCH_PAGE_SHIFT;
  450. init_mpr_cont_start = (void *)reg.start;
  451. void *init_mpr_cont_end = init_mpr_cont_start + init_mpr_size;
  452. early_offset = init_mpr_cont_start - (void *)init_mpr_align_start;
  453. rt_page_t mpr_cont = rt_mpr_start + early_offset;
  454. /* mark init mpr pages as illegal */
  455. rt_page_t head_cont = addr_to_page(mpr_cont, (void *)reg.start);
  456. rt_page_t tail_cont = addr_to_page(mpr_cont, (void *)reg.end);
  457. for (rt_page_t iter = head_cont; iter < tail_cont; iter++)
  458. {
  459. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  460. }
  461. /* mark shadow pages as illegal */
  462. rt_page_t shad_head_cont = addr_to_page(mpr_cont, (void *)shadow.start);
  463. for (rt_page_t iter = shad_head_cont; iter < head_cont; iter++)
  464. {
  465. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  466. }
  467. rt_page_t shad_tail_cont = addr_to_page(mpr_cont, (void *)shadow.end);
  468. for (rt_page_t iter = tail_cont; iter < shad_tail_cont; iter++)
  469. {
  470. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  471. }
  472. /* insert reserved pages to list */
  473. reg.start = (rt_size_t)init_mpr_cont_end;
  474. const int max_order = RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1;
  475. while (reg.start != reg.end)
  476. {
  477. struct rt_page *p;
  478. int align_bits;
  479. int size_bits;
  480. size_bits =
  481. ARCH_ADDRESS_WIDTH_BITS - 1 - rt_hw_clz(reg.end - reg.start);
  482. align_bits = rt_hw_ctz(reg.start);
  483. if (align_bits < size_bits)
  484. {
  485. size_bits = align_bits;
  486. }
  487. if (size_bits > max_order)
  488. {
  489. size_bits = max_order;
  490. }
  491. p = addr_to_page(mpr_cont, (void *)reg.start);
  492. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  493. p->ref_cnt = 0;
  494. /* insert to list */
  495. _early_page_insert((void *)p - early_offset,
  496. size_bits - ARCH_PAGE_SHIFT);
  497. reg.start += (1UL << size_bits);
  498. }
  499. pages_alloc_handler = _early_pages_alloc;
  500. /* doing the page table bushiness */
  501. if (rt_aspace_load_page(&rt_kernel_space, (void *)init_mpr_align_start, init_mpr_npage))
  502. {
  503. LOG_E("%s: failed to load pages", __func__);
  504. RT_ASSERT(0);
  505. }
  506. if (rt_hw_mmu_tbl_get() == rt_kernel_space.page_table)
  507. rt_page_cleanup();
  508. }
  509. static int _load_mpr_area(void *head, void *tail)
  510. {
  511. int err = 0;
  512. void *iter = (void *)((uintptr_t)head & ~ARCH_PAGE_MASK);
  513. tail = (void *)FLOOR(tail, ARCH_PAGE_SIZE);
  514. while (iter != tail)
  515. {
  516. void *paddr = rt_kmem_v2p(iter);
  517. if (paddr == ARCH_MAP_FAILED)
  518. {
  519. err = rt_aspace_load_page(&rt_kernel_space, iter, 1);
  520. if (err != RT_EOK)
  521. {
  522. LOG_E("%s: failed to load page", __func__);
  523. break;
  524. }
  525. }
  526. iter += ARCH_PAGE_SIZE;
  527. }
  528. return err;
  529. }
  530. int rt_page_install(rt_region_t region)
  531. {
  532. int err = -RT_EINVAL;
  533. if (region.end != region.start && !(region.start & ARCH_PAGE_MASK) &&
  534. !(region.end & ARCH_PAGE_MASK) &&
  535. !((region.end - region.start) & shadow_mask))
  536. {
  537. void *head = addr_to_page(page_start, (void *)region.start);
  538. void *tail = addr_to_page(page_start, (void *)region.end);
  539. page_nr += ((region.end - region.start) >> ARCH_PAGE_SHIFT);
  540. err = _load_mpr_area(head, tail);
  541. if (err == RT_EOK)
  542. {
  543. while (region.start != region.end)
  544. {
  545. struct rt_page *p;
  546. int size_bits;
  547. size_bits = RT_PAGE_MAX_ORDER - 1;
  548. p = addr_to_page(page_start, (void *)region.start);
  549. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  550. p->ref_cnt = 1;
  551. _pages_free(p, size_bits);
  552. region.start += (1UL << (size_bits + ARCH_PAGE_SHIFT));
  553. }
  554. }
  555. }
  556. return err;
  557. }
  558. void rt_page_cleanup(void)
  559. {
  560. early_offset = 0;
  561. pages_alloc_handler = _pages_alloc;
  562. }