mm_page.c 22 KB

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