mm_page.c 36 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364
  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. * 2023-11-28 Shell Bugs fix for page_install on shadow region
  13. * 2024-06-18 Shell Added affinity page management for page coloring.
  14. */
  15. #include <rtthread.h>
  16. #include <stddef.h>
  17. #include <stdint.h>
  18. #include <string.h>
  19. #include "mm_fault.h"
  20. #include "mm_private.h"
  21. #include "mm_aspace.h"
  22. #include "mm_flag.h"
  23. #include "mm_page.h"
  24. #include <mmu.h>
  25. #define DBG_TAG "mm.page"
  26. #define DBG_LVL DBG_WARNING
  27. #include <rtdbg.h>
  28. RT_STATIC_ASSERT(order_huge_pg, RT_PAGE_MAX_ORDER > ARCH_PAGE_SHIFT - 2);
  29. RT_STATIC_ASSERT(size_width, sizeof(rt_size_t) == sizeof(void *));
  30. #ifdef RT_USING_SMART
  31. #include "lwp_arch_comm.h"
  32. #endif /* RT_USING_SMART */
  33. static rt_size_t init_mpr_align_start;
  34. static rt_size_t init_mpr_align_end;
  35. static void *init_mpr_cont_start;
  36. static struct rt_varea mpr_varea;
  37. typedef union
  38. {
  39. struct rt_page *page_list;
  40. rt_ubase_t aff_page_map;
  41. } pgls_agr_t;
  42. #define PGLS_IS_AFF_MAP(pgls) (!!((pgls).aff_page_map & 0x1))
  43. #define PGLS_FROM_AFF_MAP(pgls, aff_map) \
  44. ((pgls).aff_page_map = (-(rt_ubase_t)(aff_map)) | 0x1)
  45. #define PGLS_GET_AFF_MAP(pgls) \
  46. ((struct rt_page **)-((pgls).aff_page_map & ~0x1))
  47. #define PGLS_GET(pgls) \
  48. (PGLS_IS_AFF_MAP(pgls) ? PGLS_GET_AFF_MAP(pgls) : (pgls).page_list)
  49. #define PAGE_TO_AFFID(page) (RT_PAGE_PICK_AFFID(page_to_paddr(page)))
  50. /* affinity id */
  51. #define AFFID_BLK_BITS \
  52. ((sizeof(int) * 8 - 1) - __builtin_clz(RT_PAGE_AFFINITY_BLOCK_SIZE) - ARCH_PAGE_SHIFT)
  53. #define AFFID_NUMOF_ID_IN_SET(order) \
  54. ((RT_PAGE_AFFINITY_BLOCK_SIZE / ARCH_PAGE_SIZE) / (1ul << (order)))
  55. #define AFFID_BITS_MASK(order) \
  56. (((1 << AFFID_BLK_BITS) - 1) - ((1 << (order)) - 1))
  57. static pgls_agr_t page_list_low[RT_PAGE_MAX_ORDER];
  58. static rt_page_t
  59. aff_pglist_low[AFFID_NUMOF_ID_IN_SET(0) * 2 - 2];
  60. static pgls_agr_t page_list_high[RT_PAGE_MAX_ORDER];
  61. static rt_page_t
  62. aff_pglist_high[AFFID_NUMOF_ID_IN_SET(0) * 2 - 2];
  63. /* protect buddy list and page records */
  64. static RT_DEFINE_SPINLOCK(_pgmgr_lock);
  65. #define page_start ((rt_page_t)rt_mpr_start)
  66. static rt_size_t _page_nr, _page_nr_hi;
  67. static rt_size_t _freed_nr, _freed_nr_hi;
  68. static rt_size_t early_offset;
  69. static const char *get_name(rt_varea_t varea)
  70. {
  71. return "master-page-record";
  72. }
  73. static void hint_free(rt_mm_va_hint_t hint)
  74. {
  75. hint->flags = MMF_MAP_FIXED;
  76. hint->limit_start = rt_kernel_space.start;
  77. hint->limit_range_size = rt_kernel_space.size;
  78. hint->prefer = rt_mpr_start;
  79. }
  80. static void on_page_fault(struct rt_varea *varea,
  81. struct rt_aspace_fault_msg *msg)
  82. {
  83. char *init_start = (void *)init_mpr_align_start;
  84. char *init_end = (void *)init_mpr_align_end;
  85. if ((char *)msg->fault_vaddr < init_end &&
  86. (char *)msg->fault_vaddr >= init_start)
  87. {
  88. rt_size_t offset = (char *)msg->fault_vaddr - init_start;
  89. msg->response.status = MM_FAULT_STATUS_OK;
  90. msg->response.vaddr = (char *)init_mpr_cont_start + offset;
  91. msg->response.size = ARCH_PAGE_SIZE;
  92. }
  93. else
  94. {
  95. rt_mm_dummy_mapper.on_page_fault(varea, msg);
  96. }
  97. }
  98. static struct rt_mem_obj mm_page_mapper = {
  99. .get_name = get_name,
  100. .on_page_fault = on_page_fault,
  101. .hint_free = hint_free,
  102. };
  103. #ifdef RT_DEBUGGING_PAGE_LEAK
  104. static volatile int enable;
  105. static rt_page_t _trace_head;
  106. #define TRACE_ALLOC(pg, size) _trace_alloc(pg, __builtin_return_address(0), size)
  107. #define TRACE_FREE(pgaddr, size) _trace_free(pgaddr, __builtin_return_address(0), size)
  108. static long _alloc_cnt;
  109. void rt_page_leak_trace_start()
  110. {
  111. // TODO multicore safety
  112. _trace_head = NULL;
  113. _alloc_cnt = 0;
  114. enable = 1;
  115. }
  116. MSH_CMD_EXPORT(rt_page_leak_trace_start, start page leak tracer);
  117. static void _collect()
  118. {
  119. rt_page_t page = _trace_head;
  120. if (!page)
  121. {
  122. rt_kprintf("ok! ALLOC CNT %ld\n", _alloc_cnt);
  123. }
  124. else
  125. {
  126. while (page)
  127. {
  128. rt_page_t next = page->tl_next;
  129. void *pg_va = rt_page_page2addr(page);
  130. LOG_W("LEAK: %p, allocator: %p, size bits: %lx", pg_va, page->caller, page->trace_size);
  131. rt_pages_free(pg_va, page->trace_size);
  132. page = next;
  133. }
  134. }
  135. }
  136. void rt_page_leak_trace_stop()
  137. {
  138. // TODO multicore safety
  139. enable = 0;
  140. _collect();
  141. }
  142. MSH_CMD_EXPORT(rt_page_leak_trace_stop, stop page leak tracer);
  143. static void _trace_alloc(rt_page_t page, void *caller, size_t size_bits)
  144. {
  145. if (enable)
  146. {
  147. page->caller = caller;
  148. page->trace_size = size_bits;
  149. page->tl_prev = NULL;
  150. page->tl_next = NULL;
  151. _alloc_cnt++;
  152. if (_trace_head == NULL)
  153. {
  154. _trace_head = page;
  155. }
  156. else
  157. {
  158. _trace_head->tl_prev = page;
  159. page->tl_next = _trace_head;
  160. _trace_head = page;
  161. }
  162. }
  163. }
  164. void _report(rt_page_t page, size_t size_bits, char *msg)
  165. {
  166. void *pg_va = rt_page_page2addr(page);
  167. LOG_W("%s: %p, allocator: %p, size bits: %lx", msg, pg_va, page->caller, page->trace_size);
  168. rt_kprintf("backtrace\n");
  169. rt_backtrace();
  170. }
  171. static void _trace_free(rt_page_t page, void *caller, size_t size_bits)
  172. {
  173. if (enable)
  174. {
  175. /* free after free */
  176. if (page->trace_size == 0xabadcafe)
  177. {
  178. _report(page, size_bits, "free after free");
  179. return ;
  180. }
  181. else if (page->trace_size != size_bits)
  182. {
  183. rt_kprintf("free with size bits %lx\n", size_bits);
  184. _report(page, size_bits, "incompatible size bits parameter");
  185. return ;
  186. }
  187. if (page->ref_cnt == 0)
  188. {
  189. _alloc_cnt--;
  190. if (page->tl_prev)
  191. page->tl_prev->tl_next = page->tl_next;
  192. if (page->tl_next)
  193. page->tl_next->tl_prev = page->tl_prev;
  194. if (page == _trace_head)
  195. _trace_head = page->tl_next;
  196. page->tl_prev = NULL;
  197. page->tl_next = NULL;
  198. page->trace_size = 0xabadcafe;
  199. }
  200. }
  201. }
  202. #else
  203. #define TRACE_ALLOC(x, y)
  204. #define TRACE_FREE(x, y)
  205. #endif
  206. /* page management */
  207. #ifdef RT_DEBUGGING_PAGE_POISON
  208. #include <bitmap.h>
  209. RT_BITMAP_DECLARE(_init_region_usage_trace, (1 << (1 + ARCH_SECTION_SHIFT - ARCH_PAGE_SHIFT)));
  210. #else
  211. typedef char rt_bitmap_t[0];
  212. #define RT_BITMAP_LEN(__name) (__name)
  213. #endif /* RT_DEBUGGING_PAGE_POISON */
  214. static struct installed_page_reg
  215. {
  216. rt_region_t region_area;
  217. struct installed_page_reg *next;
  218. struct rt_spinlock lock;
  219. #ifdef RT_DEBUGGING_PAGE_POISON
  220. rt_bitmap_t *usage_trace;
  221. #endif /* RT_DEBUGGING_PAGE_POISON */
  222. } _init_region;
  223. static RT_DEFINE_SPINLOCK(_inst_page_reg_lock);
  224. static struct installed_page_reg *_inst_page_reg_head;
  225. static void _print_region_list(void)
  226. {
  227. struct installed_page_reg *iter;
  228. int counts = 0;
  229. rt_spin_lock(&_inst_page_reg_lock);
  230. iter = _inst_page_reg_head;
  231. while (iter != RT_NULL)
  232. {
  233. rt_kprintf(" %d: [%p, %p]\n", counts++, iter->region_area.start + PV_OFFSET,
  234. iter->region_area.end + PV_OFFSET);
  235. iter = iter->next;
  236. }
  237. rt_spin_unlock(&_inst_page_reg_lock);
  238. }
  239. static struct installed_page_reg *_find_page_region(rt_ubase_t page_va)
  240. {
  241. struct installed_page_reg *iter;
  242. struct installed_page_reg *rc = RT_NULL;
  243. rt_bool_t found = RT_FALSE;
  244. rt_spin_lock(&_inst_page_reg_lock);
  245. for (iter = _inst_page_reg_head; iter; iter = iter->next)
  246. {
  247. if (page_va >= iter->region_area.start &&
  248. page_va < iter->region_area.end)
  249. {
  250. found = RT_TRUE;
  251. break;
  252. }
  253. }
  254. rt_spin_unlock(&_inst_page_reg_lock);
  255. if (found)
  256. {
  257. rc = iter;
  258. }
  259. return rc;
  260. }
  261. rt_bool_t rt_page_is_member(rt_base_t page_pa)
  262. {
  263. return _find_page_region(page_pa - PV_OFFSET) != RT_NULL;
  264. }
  265. static rt_bool_t _pages_are_member(rt_ubase_t page_va, size_t size_bits)
  266. {
  267. rt_bool_t rc = RT_TRUE;
  268. rt_ubase_t iter_frame = page_va;
  269. size_t frame_end = page_va + (1 << size_bits);
  270. while (iter_frame < frame_end)
  271. {
  272. size_t overlap_size;
  273. struct installed_page_reg *page_reg = _find_page_region(iter_frame);
  274. if (!page_reg)
  275. {
  276. rc = RT_FALSE;
  277. LOG_E("Allocated invalid page %p", iter_frame);
  278. break;
  279. }
  280. overlap_size = page_reg->region_area.end - iter_frame;
  281. iter_frame += overlap_size;
  282. }
  283. return rc;
  284. }
  285. #ifdef RT_DEBUGGING_PAGE_POISON
  286. static rt_err_t _unpoisoned_pages(char *head, rt_uint32_t size_bits)
  287. {
  288. rt_err_t error = RT_EOK;
  289. struct installed_page_reg *page_reg = _find_page_region((rt_ubase_t)head);
  290. if (page_reg)
  291. {
  292. int pages_count = 1 << size_bits;
  293. long bit_number = ((rt_ubase_t)head - page_reg->region_area.start) / ARCH_PAGE_SIZE;
  294. /* mark the pages as allocated */
  295. for (size_t i = 0; i < pages_count; i++, bit_number++)
  296. {
  297. rt_spin_lock(&_inst_page_reg_lock);
  298. if (rt_bitmap_test_bit(page_reg->usage_trace, bit_number))
  299. {
  300. error = RT_ERROR;
  301. rt_kprintf("%s: Pages[%p, %d] is already in used by others!\n", __func__, head, size_bits);
  302. }
  303. rt_bitmap_set_bit(page_reg->usage_trace, bit_number);
  304. rt_spin_unlock(&_inst_page_reg_lock);
  305. }
  306. }
  307. else
  308. {
  309. error = RT_EINVAL;
  310. }
  311. return -error;
  312. }
  313. static rt_err_t _poisoned_pages(char *head, rt_uint32_t size_bits)
  314. {
  315. rt_err_t error = RT_EOK;
  316. struct installed_page_reg *page_reg = _find_page_region((rt_ubase_t)head);
  317. if (page_reg)
  318. {
  319. int pages_count = 1 << size_bits;
  320. long bit_number = ((rt_ubase_t)head - page_reg->region_area.start) / ARCH_PAGE_SIZE;
  321. /* mark the pages as free */
  322. for (size_t i = 0; i < pages_count; i++, bit_number++)
  323. {
  324. rt_spin_lock(&_inst_page_reg_lock);
  325. if (!rt_bitmap_test_bit(page_reg->usage_trace, bit_number))
  326. {
  327. error = RT_ERROR;
  328. rt_kprintf("%s: Pages[%p, %d] is freed before!\n", __func__, head, size_bits);
  329. }
  330. rt_bitmap_clear_bit(page_reg->usage_trace, bit_number);
  331. rt_spin_unlock(&_inst_page_reg_lock);
  332. }
  333. }
  334. else
  335. {
  336. error = RT_EINVAL;
  337. }
  338. return -error;
  339. }
  340. #endif /* RT_DEBUGGING_PAGE_POISON */
  341. static inline void *page_to_addr(rt_page_t page)
  342. {
  343. return (void *)(((page - page_start) << ARCH_PAGE_SHIFT) - PV_OFFSET);
  344. }
  345. static inline rt_ubase_t page_to_paddr(rt_page_t page)
  346. {
  347. return (rt_ubase_t)((page - page_start) << ARCH_PAGE_SHIFT);
  348. }
  349. static inline rt_page_t addr_to_page(rt_page_t pg_start, void *addr)
  350. {
  351. addr = (char *)addr + PV_OFFSET;
  352. return &pg_start[((rt_ubase_t)addr >> ARCH_PAGE_SHIFT)];
  353. }
  354. #define CEIL(val, align) (((rt_size_t)(val) + (align)-1) & ~((align)-1))
  355. /**
  356. * shadow is the accessible region by buddy but not usable for page manager.
  357. * shadow mask is used for calculate the region head from an address.
  358. */
  359. const rt_size_t shadow_mask =
  360. ((1ul << (RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1)) - 1);
  361. const rt_size_t rt_mpr_size = CEIL(
  362. ((1ul << (ARCH_VADDR_WIDTH - ARCH_PAGE_SHIFT))) * sizeof(struct rt_page),
  363. ARCH_PAGE_SIZE);
  364. void *rt_mpr_start;
  365. rt_weak int rt_hw_clz(unsigned long n)
  366. {
  367. return __builtin_clzl(n);
  368. }
  369. rt_weak int rt_hw_ctz(unsigned long n)
  370. {
  371. return __builtin_ctzl(n);
  372. }
  373. rt_size_t rt_page_bits(rt_size_t size)
  374. {
  375. int bit = sizeof(rt_size_t) * 8 - rt_hw_clz(size) - 1;
  376. if ((size ^ (1UL << bit)) != 0)
  377. {
  378. bit++;
  379. }
  380. bit -= ARCH_PAGE_SHIFT;
  381. if (bit < 0)
  382. {
  383. bit = 0;
  384. }
  385. return bit;
  386. }
  387. struct rt_page *rt_page_addr2page(void *addr)
  388. {
  389. return addr_to_page(page_start, addr);
  390. }
  391. void *rt_page_page2addr(struct rt_page *p)
  392. {
  393. return page_to_addr(p);
  394. }
  395. static inline struct rt_page *_buddy_get(struct rt_page *p,
  396. rt_uint32_t size_bits)
  397. {
  398. rt_size_t addr;
  399. RT_ASSERT(size_bits < RT_PAGE_MAX_ORDER - 1);
  400. addr = (rt_size_t)rt_page_page2addr(p);
  401. addr ^= (1UL << (size_bits + ARCH_PAGE_SHIFT));
  402. return rt_page_addr2page((void *)addr);
  403. }
  404. static rt_page_t *_get_pgls_head_by_page(pgls_agr_t *agr_pgls, rt_page_t page,
  405. rt_uint32_t size_bits)
  406. {
  407. rt_page_t *pgls_head;
  408. int index;
  409. if (size_bits < AFFID_BLK_BITS)
  410. {
  411. index = PAGE_TO_AFFID(page) >> size_bits;
  412. RT_ASSERT(index < AFFID_NUMOF_ID_IN_SET(size_bits));
  413. RT_ASSERT(PGLS_IS_AFF_MAP(agr_pgls[size_bits]));
  414. pgls_head = &PGLS_GET_AFF_MAP(agr_pgls[size_bits])[index];
  415. }
  416. else
  417. {
  418. RT_ASSERT(!PGLS_IS_AFF_MAP(agr_pgls[size_bits]));
  419. pgls_head = &agr_pgls[size_bits].page_list;
  420. }
  421. return pgls_head;
  422. }
  423. static rt_page_t *_get_pgls_head(pgls_agr_t *agr_pgls, int affid,
  424. rt_uint32_t size_bits)
  425. {
  426. rt_page_t *pgls_head;
  427. int index;
  428. if (size_bits < AFFID_BLK_BITS)
  429. {
  430. index = affid >> size_bits;
  431. RT_ASSERT(index < AFFID_NUMOF_ID_IN_SET(size_bits));
  432. RT_ASSERT(PGLS_IS_AFF_MAP(agr_pgls[size_bits]));
  433. pgls_head = &PGLS_GET_AFF_MAP(agr_pgls[size_bits])[index];
  434. }
  435. else
  436. {
  437. RT_ASSERT(!PGLS_IS_AFF_MAP(agr_pgls[size_bits]));
  438. pgls_head = &agr_pgls[size_bits].page_list;
  439. }
  440. return pgls_head;
  441. }
  442. static void _page_alloc(struct rt_page *p)
  443. {
  444. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  445. p->ref_cnt = 1;
  446. }
  447. static void _page_remove(rt_page_t *page_head, struct rt_page *p,
  448. rt_uint32_t size_bits)
  449. {
  450. if (p->pre)
  451. {
  452. p->pre->next = p->next;
  453. }
  454. else
  455. {
  456. *page_head = p->next;
  457. }
  458. if (p->next)
  459. {
  460. p->next->pre = p->pre;
  461. }
  462. RT_ASSERT(p->size_bits == size_bits);
  463. _page_alloc(p);
  464. }
  465. static void _page_insert(rt_page_t *page_head, struct rt_page *p,
  466. rt_uint32_t size_bits)
  467. {
  468. p->next = *page_head;
  469. if (p->next)
  470. {
  471. p->next->pre = p;
  472. }
  473. p->pre = 0;
  474. *page_head = p;
  475. p->size_bits = size_bits;
  476. }
  477. static void _pages_ref_inc(struct rt_page *p, rt_uint32_t size_bits)
  478. {
  479. struct rt_page *page_head;
  480. int idx;
  481. /* find page group head */
  482. idx = p - page_start;
  483. idx = idx & ~((1UL << size_bits) - 1);
  484. page_head = page_start + idx;
  485. page_head = (void *)((char *)page_head + early_offset);
  486. page_head->ref_cnt++;
  487. }
  488. static int _pages_ref_get(struct rt_page *p, rt_uint32_t size_bits)
  489. {
  490. struct rt_page *page_head;
  491. int idx;
  492. /* find page group head */
  493. idx = p - page_start;
  494. idx = idx & ~((1UL << size_bits) - 1);
  495. page_head = page_start + idx;
  496. return page_head->ref_cnt;
  497. }
  498. static int _pages_free(pgls_agr_t page_list[], struct rt_page *p,
  499. char *frame_va, rt_uint32_t size_bits)
  500. {
  501. rt_uint32_t level = size_bits;
  502. struct rt_page *buddy;
  503. RT_ASSERT(p >= page_start);
  504. RT_ASSERT((char *)p < (char *)rt_mpr_start + rt_mpr_size);
  505. RT_ASSERT(rt_kmem_v2p(p));
  506. RT_ASSERT(p->ref_cnt > 0);
  507. RT_ASSERT(p->size_bits == ARCH_ADDRESS_WIDTH_BITS);
  508. RT_ASSERT(size_bits < RT_PAGE_MAX_ORDER);
  509. RT_UNUSED(_pages_are_member);
  510. RT_ASSERT(_pages_are_member((rt_ubase_t)frame_va, size_bits));
  511. p->ref_cnt--;
  512. if (p->ref_cnt != 0)
  513. {
  514. return 0;
  515. }
  516. #ifdef RT_DEBUGGING_PAGE_POISON
  517. _poisoned_pages(frame_va, size_bits);
  518. #endif /* RT_DEBUGGING_PAGE_POISON */
  519. while (level < RT_PAGE_MAX_ORDER - 1)
  520. {
  521. buddy = _buddy_get(p, level);
  522. if (buddy && buddy->size_bits == level)
  523. {
  524. _page_remove(_get_pgls_head_by_page(page_list, buddy, level),
  525. buddy, level);
  526. p = (p < buddy) ? p : buddy;
  527. level++;
  528. }
  529. else
  530. {
  531. break;
  532. }
  533. }
  534. _page_insert(_get_pgls_head_by_page(page_list, p, level),
  535. p, level);
  536. return 1;
  537. }
  538. static struct rt_page *__pages_alloc(
  539. pgls_agr_t agr_pgls[], rt_uint32_t size_bits, int affid,
  540. void (*page_remove)(rt_page_t *page_head, struct rt_page *p,
  541. rt_uint32_t size_bits),
  542. void (*page_insert)(rt_page_t *page_head, struct rt_page *p,
  543. rt_uint32_t size_bits),
  544. void (*page_alloc)(rt_page_t page))
  545. {
  546. rt_page_t *pgls_head = _get_pgls_head(agr_pgls, affid, size_bits);
  547. rt_page_t p = *pgls_head;
  548. if (p)
  549. {
  550. page_remove(pgls_head, p, size_bits);
  551. }
  552. else
  553. {
  554. rt_uint32_t level;
  555. rt_page_t head;
  556. /* fallback for allocation */
  557. for (level = size_bits + 1; level < RT_PAGE_MAX_ORDER; level++)
  558. {
  559. pgls_head = _get_pgls_head(agr_pgls, affid, level);
  560. p = *pgls_head;
  561. if (p)
  562. {
  563. break;
  564. }
  565. }
  566. if (level == RT_PAGE_MAX_ORDER)
  567. {
  568. return 0;
  569. }
  570. page_remove(pgls_head, p, level);
  571. /* pick the page satisfied the affinity tag */
  572. head = p;
  573. p = head + (affid - (affid & AFFID_BITS_MASK(level)));
  574. page_alloc(p);
  575. /* release the pages caller don't need */
  576. while (level > size_bits)
  577. {
  578. long lower_bits = level - 1;
  579. rt_page_t middle = _buddy_get(head, lower_bits);
  580. if (p >= middle)
  581. {
  582. page_insert(
  583. _get_pgls_head_by_page(agr_pgls, head, lower_bits),
  584. head, lower_bits);
  585. head = middle;
  586. }
  587. else
  588. {
  589. page_insert(
  590. _get_pgls_head_by_page(agr_pgls, middle, lower_bits),
  591. middle, lower_bits);
  592. }
  593. level = lower_bits;
  594. }
  595. }
  596. return p;
  597. }
  598. static struct rt_page *_pages_alloc(pgls_agr_t page_list[],
  599. rt_uint32_t size_bits, int affid)
  600. {
  601. return __pages_alloc(page_list, size_bits, affid, _page_remove,
  602. _page_insert, _page_alloc);
  603. }
  604. static void _early_page_remove(rt_page_t *pgls_head, rt_page_t page,
  605. rt_uint32_t size_bits)
  606. {
  607. rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
  608. if (page_cont->pre)
  609. {
  610. rt_page_t pre_cont = (rt_page_t)((char *)page_cont->pre + early_offset);
  611. pre_cont->next = page_cont->next;
  612. }
  613. else
  614. {
  615. *pgls_head = page_cont->next;
  616. }
  617. if (page_cont->next)
  618. {
  619. rt_page_t next_cont = (rt_page_t)((char *)page_cont->next + early_offset);
  620. next_cont->pre = page_cont->pre;
  621. }
  622. RT_ASSERT(page_cont->size_bits == size_bits);
  623. page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  624. page_cont->ref_cnt = 1;
  625. }
  626. static void _early_page_alloc(rt_page_t page)
  627. {
  628. rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
  629. page_cont->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  630. page_cont->ref_cnt = 1;
  631. }
  632. static void _early_page_insert(rt_page_t *pgls_head, rt_page_t page,
  633. rt_uint32_t size_bits)
  634. {
  635. RT_ASSERT((void *)page >= rt_mpr_start &&
  636. ((char *)page - (char *)rt_mpr_start) < rt_mpr_size);
  637. rt_page_t page_cont = (rt_page_t)((char *)page + early_offset);
  638. page_cont->next = *pgls_head;
  639. if (page_cont->next)
  640. {
  641. rt_page_t next_cont = (rt_page_t)((char *)page_cont->next + early_offset);
  642. next_cont->pre = page;
  643. }
  644. page_cont->pre = 0;
  645. *pgls_head = page;
  646. page_cont->size_bits = size_bits;
  647. }
  648. static struct rt_page *_early_pages_alloc(pgls_agr_t page_list[],
  649. rt_uint32_t size_bits, int affid)
  650. {
  651. return __pages_alloc(page_list, size_bits, affid, _early_page_remove,
  652. _early_page_insert, _early_page_alloc);
  653. }
  654. static pgls_agr_t *_get_page_list(void *vaddr)
  655. {
  656. rt_ubase_t pa_int = (rt_ubase_t)vaddr + PV_OFFSET;
  657. pgls_agr_t *list;
  658. if (pa_int > UINT32_MAX)
  659. {
  660. list = page_list_high;
  661. }
  662. else
  663. {
  664. list = page_list_low;
  665. }
  666. return list;
  667. }
  668. int rt_page_ref_get(void *addr, rt_uint32_t size_bits)
  669. {
  670. struct rt_page *p;
  671. rt_base_t level;
  672. int ref;
  673. p = rt_page_addr2page(addr);
  674. level = rt_spin_lock_irqsave(&_pgmgr_lock);
  675. ref = _pages_ref_get(p, size_bits);
  676. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  677. return ref;
  678. }
  679. void rt_page_ref_inc(void *addr, rt_uint32_t size_bits)
  680. {
  681. struct rt_page *p;
  682. rt_base_t level;
  683. p = rt_page_addr2page(addr);
  684. level = rt_spin_lock_irqsave(&_pgmgr_lock);
  685. _pages_ref_inc(p, size_bits);
  686. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  687. }
  688. static rt_page_t (*pages_alloc_handler)(pgls_agr_t page_list[],
  689. rt_uint32_t size_bits, int affid);
  690. /* if not, we skip the finding on page_list_high */
  691. static size_t _high_page_configured = 0;
  692. static pgls_agr_t *_flag_to_page_list(size_t flags)
  693. {
  694. pgls_agr_t *page_list;
  695. if (_high_page_configured && (flags & PAGE_ANY_AVAILABLE))
  696. {
  697. page_list = page_list_high;
  698. }
  699. else
  700. {
  701. page_list = page_list_low;
  702. }
  703. return page_list;
  704. }
  705. volatile static rt_ubase_t _last_alloc;
  706. rt_inline void *_do_pages_alloc(rt_uint32_t size_bits, size_t flags, int affid)
  707. {
  708. void *alloc_buf = RT_NULL;
  709. struct rt_page *p;
  710. rt_base_t level;
  711. pgls_agr_t *page_list = _flag_to_page_list(flags);
  712. level = rt_spin_lock_irqsave(&_pgmgr_lock);
  713. p = pages_alloc_handler(page_list, size_bits, affid);
  714. if (p)
  715. {
  716. _freed_nr -= 1 << size_bits;
  717. }
  718. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  719. if (!p && page_list != page_list_low)
  720. {
  721. /* fall back */
  722. page_list = page_list_low;
  723. level = rt_spin_lock_irqsave(&_pgmgr_lock);
  724. p = pages_alloc_handler(page_list, size_bits, affid);
  725. if (p)
  726. {
  727. _freed_nr -= 1 << size_bits;
  728. _freed_nr_hi -= 1 << size_bits;
  729. }
  730. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  731. }
  732. if (p)
  733. {
  734. alloc_buf = page_to_addr(p);
  735. _last_alloc = (rt_ubase_t)alloc_buf;
  736. #ifdef RT_DEBUGGING_PAGE_LEAK
  737. level = rt_spin_lock_irqsave(&_spinlock);
  738. TRACE_ALLOC(p, size_bits);
  739. rt_spin_unlock_irqrestore(&_spinlock, level);
  740. #endif
  741. #ifdef RT_DEBUGGING_PAGE_POISON
  742. _unpoisoned_pages(alloc_buf, size_bits);
  743. #endif /* RT_DEBUGGING_PAGE_POISON */
  744. }
  745. return alloc_buf;
  746. }
  747. rt_inline int _get_balanced_id(rt_uint32_t size_bits)
  748. {
  749. rt_ubase_t last_alloc = (_last_alloc / RT_PAGE_AFFINITY_BLOCK_SIZE);
  750. return (last_alloc + (1u << size_bits)) & AFFID_BITS_MASK(size_bits);
  751. }
  752. static void *_do_pages_alloc_noaff(rt_uint32_t size_bits, size_t flags)
  753. {
  754. void *rc = RT_NULL;
  755. if (size_bits < AFFID_BLK_BITS)
  756. {
  757. int try_affid = _get_balanced_id(size_bits);
  758. size_t numof_id = AFFID_NUMOF_ID_IN_SET(size_bits);
  759. size_t valid_affid_mask = numof_id - 1;
  760. for (size_t i = 0; i < numof_id; i++, try_affid += 1 << size_bits)
  761. {
  762. rc = _do_pages_alloc(size_bits, flags, try_affid & valid_affid_mask);
  763. if (rc)
  764. {
  765. break;
  766. }
  767. }
  768. }
  769. else
  770. {
  771. rc = _do_pages_alloc(size_bits, flags, 0);
  772. }
  773. if (!rc)
  774. {
  775. RT_ASSERT(0);
  776. }
  777. return rc;
  778. }
  779. void *rt_pages_alloc(rt_uint32_t size_bits)
  780. {
  781. return _do_pages_alloc_noaff(size_bits, 0);
  782. }
  783. void *rt_pages_alloc_ext(rt_uint32_t size_bits, size_t flags)
  784. {
  785. return _do_pages_alloc_noaff(size_bits, flags);
  786. }
  787. void *rt_pages_alloc_tagged(rt_uint32_t size_bits, long affid, size_t flags)
  788. {
  789. rt_page_t current;
  790. current = _do_pages_alloc(size_bits, flags, affid);
  791. if (current && RT_PAGE_PICK_AFFID(current) != affid)
  792. {
  793. RT_ASSERT(0);
  794. }
  795. return current;
  796. }
  797. int rt_pages_free(void *addr, rt_uint32_t size_bits)
  798. {
  799. struct rt_page *p;
  800. pgls_agr_t *page_list = _get_page_list(addr);
  801. int real_free = 0;
  802. p = rt_page_addr2page(addr);
  803. if (p)
  804. {
  805. rt_base_t level;
  806. level = rt_spin_lock_irqsave(&_pgmgr_lock);
  807. real_free = _pages_free(page_list, p, addr, size_bits);
  808. if (real_free)
  809. {
  810. _freed_nr += 1 << size_bits;
  811. if (page_list == page_list_high)
  812. {
  813. _freed_nr_hi += 1 << size_bits;
  814. }
  815. TRACE_FREE(p, size_bits);
  816. }
  817. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  818. }
  819. return real_free;
  820. }
  821. /* debug command */
  822. int rt_page_list(void) __attribute__((alias("list_page")));
  823. #define PGNR2SIZE(nr) ((nr)*ARCH_PAGE_SIZE / 1024)
  824. static void _dump_page_list(int order, rt_page_t lp, rt_page_t hp,
  825. rt_size_t *pfree)
  826. {
  827. rt_size_t free = 0;
  828. rt_kprintf("level %d ", order);
  829. while (lp)
  830. {
  831. free += (1UL << order);
  832. rt_kprintf("[L:0x%08p]", rt_page_page2addr(lp));
  833. lp = lp->next;
  834. }
  835. while (hp)
  836. {
  837. free += (1UL << order);
  838. rt_kprintf("[H:0x%08p]", rt_page_page2addr(hp));
  839. hp = hp->next;
  840. }
  841. rt_kprintf("\n");
  842. *pfree += free;
  843. }
  844. int list_page(void)
  845. {
  846. int i;
  847. rt_size_t free = 0;
  848. rt_size_t installed = _page_nr;
  849. rt_base_t level;
  850. level = rt_spin_lock_irqsave(&_pgmgr_lock);
  851. /* dump affinity map area */
  852. for (i = 0; i < AFFID_BLK_BITS; i++)
  853. {
  854. rt_page_t *iter_lo = PGLS_GET_AFF_MAP(page_list_low[i]);
  855. rt_page_t *iter_hi = PGLS_GET_AFF_MAP(page_list_high[i]);
  856. rt_size_t list_len = AFFID_NUMOF_ID_IN_SET(i);
  857. for (size_t j = 0; j < list_len; j++)
  858. {
  859. _dump_page_list(i, iter_lo[j], iter_hi[j], &free);
  860. }
  861. }
  862. /* dump normal page list */
  863. for (; i < RT_PAGE_MAX_ORDER; i++)
  864. {
  865. rt_page_t lp = page_list_low[i].page_list;
  866. rt_page_t hp = page_list_high[i].page_list;
  867. _dump_page_list(i, lp, hp, &free);
  868. }
  869. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  870. rt_kprintf("-------------------------------\n");
  871. rt_kprintf("Page Summary:\n => free/installed:\n 0x%lx/0x%lx (%ld/%ld KB)\n",
  872. free, installed, PGNR2SIZE(free), PGNR2SIZE(installed));
  873. rt_kprintf(" => Installed Pages Region:\n");
  874. _print_region_list();
  875. rt_kprintf("-------------------------------\n");
  876. return 0;
  877. }
  878. MSH_CMD_EXPORT(list_page, show page info);
  879. void rt_page_get_info(rt_size_t *total_nr, rt_size_t *free_nr)
  880. {
  881. *total_nr = _page_nr;
  882. *free_nr = _freed_nr;
  883. }
  884. void rt_page_high_get_info(rt_size_t *total_nr, rt_size_t *free_nr)
  885. {
  886. *total_nr = _page_nr_hi;
  887. *free_nr = _freed_nr_hi;
  888. }
  889. static void _invalid_uninstalled_shadow(rt_page_t start, rt_page_t end)
  890. {
  891. for (rt_page_t iter = start; iter < end; iter++)
  892. {
  893. rt_base_t frame = (rt_base_t)rt_page_page2addr(iter);
  894. struct installed_page_reg *page_reg = _find_page_region(frame);
  895. if (page_reg)
  896. {
  897. continue;
  898. }
  899. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  900. }
  901. }
  902. static void _install_page(rt_page_t mpr_head, rt_region_t region,
  903. void (*insert)(rt_page_t *ppg, rt_page_t page, rt_uint32_t size_bits))
  904. {
  905. pgls_agr_t *page_list;
  906. rt_page_t *page_head;
  907. rt_region_t shadow;
  908. const rt_base_t pvoffset = PV_OFFSET;
  909. _page_nr += ((region.end - region.start) >> ARCH_PAGE_SHIFT);
  910. _freed_nr += ((region.end - region.start) >> ARCH_PAGE_SHIFT);
  911. shadow.start = region.start & ~shadow_mask;
  912. shadow.end = CEIL(region.end, shadow_mask + 1);
  913. if (shadow.end + pvoffset > UINT32_MAX)
  914. _high_page_configured = 1;
  915. rt_page_t shad_head = addr_to_page(mpr_head, (void *)shadow.start);
  916. rt_page_t shad_tail = addr_to_page(mpr_head, (void *)shadow.end);
  917. rt_page_t head = addr_to_page(mpr_head, (void *)region.start);
  918. rt_page_t tail = addr_to_page(mpr_head, (void *)region.end);
  919. /* mark shadow page records not belongs to other region as illegal */
  920. _invalid_uninstalled_shadow(shad_head, head);
  921. _invalid_uninstalled_shadow(tail, shad_tail);
  922. /* insert reserved pages to list */
  923. const int max_order = RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1;
  924. while (region.start != region.end)
  925. {
  926. struct rt_page *p;
  927. int align_bits;
  928. int size_bits;
  929. int page_order;
  930. size_bits =
  931. ARCH_ADDRESS_WIDTH_BITS - 1 - rt_hw_clz(region.end - region.start);
  932. align_bits = rt_hw_ctz(region.start);
  933. if (align_bits < size_bits)
  934. {
  935. size_bits = align_bits;
  936. }
  937. if (size_bits > max_order)
  938. {
  939. size_bits = max_order;
  940. }
  941. p = addr_to_page(mpr_head, (void *)region.start);
  942. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  943. p->ref_cnt = 0;
  944. /* insert to list */
  945. page_list = _get_page_list((void *)region.start);
  946. if (page_list == page_list_high)
  947. {
  948. _page_nr_hi += 1 << (size_bits - ARCH_PAGE_SHIFT);
  949. _freed_nr_hi += 1 << (size_bits - ARCH_PAGE_SHIFT);
  950. }
  951. page_order = size_bits - ARCH_PAGE_SHIFT;
  952. page_head = _get_pgls_head_by_page(page_list, p, page_order);
  953. insert(page_head, (rt_page_t)((char *)p - early_offset), page_order);
  954. region.start += (1UL << size_bits);
  955. }
  956. }
  957. static void *_aligned_to_affinity(rt_ubase_t head_page_pa, void *mapped_to)
  958. {
  959. #define AFFBLK_MASK (RT_PAGE_AFFINITY_BLOCK_SIZE - 1)
  960. rt_ubase_t head_page_pg_aligned;
  961. rt_ubase_t aligned_affblk_tag = (long)mapped_to & AFFBLK_MASK;
  962. head_page_pg_aligned =
  963. ((long)head_page_pa & ~AFFBLK_MASK) | aligned_affblk_tag;
  964. if (head_page_pg_aligned < head_page_pa)
  965. {
  966. /* find the page forward */
  967. head_page_pg_aligned += RT_PAGE_AFFINITY_BLOCK_SIZE;
  968. }
  969. return (void *)head_page_pg_aligned;
  970. }
  971. void rt_page_init(rt_region_t reg)
  972. {
  973. int i;
  974. rt_region_t shadow;
  975. /* setup install page status */
  976. rt_spin_lock_init(&_init_region.lock);
  977. _init_region.region_area = reg;
  978. _init_region.next = RT_NULL;
  979. #ifdef RT_DEBUGGING_PAGE_POISON
  980. _init_region.usage_trace = _init_region_usage_trace;
  981. #endif /* RT_DEBUGGING_PAGE_POISON */
  982. _inst_page_reg_head = &_init_region;
  983. /* adjust install region. inclusive start, exclusive end */
  984. reg.start += ARCH_PAGE_MASK;
  985. reg.start &= ~ARCH_PAGE_MASK;
  986. reg.end &= ~ARCH_PAGE_MASK;
  987. if (reg.end <= reg.start)
  988. {
  989. LOG_E("region end(%p) must greater than start(%p)", reg.start, reg.end);
  990. RT_ASSERT(0);
  991. }
  992. shadow.start = reg.start & ~shadow_mask;
  993. shadow.end = CEIL(reg.end, shadow_mask + 1);
  994. LOG_D("[Init page] start: 0x%lx, end: 0x%lx, total: 0x%lx", reg.start,
  995. reg.end, page_nr);
  996. int err;
  997. /* init free list */
  998. rt_page_t *aff_pgls_iter_lo = aff_pglist_low;
  999. rt_page_t *aff_pgls_iter_hi = aff_pglist_high;
  1000. for (i = 0; i < AFFID_BLK_BITS; i++)
  1001. {
  1002. long stride = AFFID_NUMOF_ID_IN_SET(i);
  1003. PGLS_FROM_AFF_MAP(page_list_low[i], aff_pgls_iter_lo);
  1004. PGLS_FROM_AFF_MAP(page_list_high[i], aff_pgls_iter_hi);
  1005. aff_pgls_iter_lo += stride;
  1006. aff_pgls_iter_hi += stride;
  1007. }
  1008. for (; i < RT_PAGE_MAX_ORDER; i++)
  1009. {
  1010. page_list_low[i].page_list = 0;
  1011. page_list_high[i].page_list = 0;
  1012. }
  1013. /* map MPR area */
  1014. err = rt_aspace_map_static(&rt_kernel_space, &mpr_varea, &rt_mpr_start,
  1015. rt_mpr_size, MMU_MAP_K_RWCB, MMF_MAP_FIXED,
  1016. &mm_page_mapper, 0);
  1017. if (err != RT_EOK)
  1018. {
  1019. LOG_E("MPR map failed with size %lx at %p", rt_mpr_size, rt_mpr_start);
  1020. RT_ASSERT(0);
  1021. }
  1022. /* calculate footprint */
  1023. init_mpr_align_start =
  1024. (rt_size_t)addr_to_page(page_start, (void *)shadow.start) &
  1025. ~ARCH_PAGE_MASK;
  1026. init_mpr_align_end =
  1027. CEIL(addr_to_page(page_start, (void *)shadow.end), ARCH_PAGE_SIZE);
  1028. rt_size_t init_mpr_size = init_mpr_align_end - init_mpr_align_start;
  1029. rt_size_t init_mpr_npage = init_mpr_size >> ARCH_PAGE_SHIFT;
  1030. /* find available aligned page */
  1031. init_mpr_cont_start = _aligned_to_affinity(reg.start,
  1032. (void *)init_mpr_align_start);
  1033. rt_size_t init_mpr_cont_end = (rt_size_t)init_mpr_cont_start + init_mpr_size;
  1034. early_offset = (rt_size_t)init_mpr_cont_start - init_mpr_align_start;
  1035. rt_page_t mpr_cont = (void *)((char *)rt_mpr_start + early_offset);
  1036. /* mark init mpr pages as illegal */
  1037. rt_page_t head_cont = addr_to_page(mpr_cont, (void *)reg.start);
  1038. rt_page_t tail_cont = addr_to_page(mpr_cont, (void *)reg.end);
  1039. for (rt_page_t iter = head_cont; iter < tail_cont; iter++)
  1040. {
  1041. iter->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  1042. }
  1043. reg.start = init_mpr_cont_end;
  1044. _install_page(mpr_cont, reg, _early_page_insert);
  1045. pages_alloc_handler = _early_pages_alloc;
  1046. /* doing the page table bushiness */
  1047. if (rt_aspace_load_page(&rt_kernel_space, (void *)init_mpr_align_start, init_mpr_npage))
  1048. {
  1049. LOG_E("%s: failed to load pages", __func__);
  1050. RT_ASSERT(0);
  1051. }
  1052. if (rt_hw_mmu_tbl_get() == rt_kernel_space.page_table)
  1053. rt_page_cleanup();
  1054. }
  1055. static int _load_mpr_area(void *head, void *tail)
  1056. {
  1057. int err = 0;
  1058. char *iter = (char *)((rt_ubase_t)head & ~ARCH_PAGE_MASK);
  1059. tail = (void *)CEIL(tail, ARCH_PAGE_SIZE);
  1060. while (iter != tail)
  1061. {
  1062. void *paddr = rt_kmem_v2p(iter);
  1063. if (paddr == ARCH_MAP_FAILED)
  1064. {
  1065. err = rt_aspace_load_page(&rt_kernel_space, iter, 1);
  1066. if (err != RT_EOK)
  1067. {
  1068. LOG_E("%s: failed to load page", __func__);
  1069. break;
  1070. }
  1071. }
  1072. iter += ARCH_PAGE_SIZE;
  1073. }
  1074. return err;
  1075. }
  1076. static int _get_mpr_ready_n_install(rt_ubase_t inst_head, rt_ubase_t inst_end)
  1077. {
  1078. int err;
  1079. rt_region_t shadow;
  1080. rt_region_t region =
  1081. {
  1082. .start = inst_head,
  1083. .end = inst_end,
  1084. };
  1085. void *head, *tail;
  1086. shadow.start = region.start & ~shadow_mask;
  1087. shadow.end = CEIL(region.end, shadow_mask + 1);
  1088. head = addr_to_page(page_start, (void *)shadow.start);
  1089. tail = addr_to_page(page_start, (void *)shadow.end);
  1090. err = _load_mpr_area(head, tail);
  1091. if (err == RT_EOK)
  1092. {
  1093. rt_ubase_t level = rt_spin_lock_irqsave(&_pgmgr_lock);
  1094. _install_page(rt_mpr_start, region, _page_insert);
  1095. rt_spin_unlock_irqrestore(&_pgmgr_lock, level);
  1096. }
  1097. return err;
  1098. }
  1099. static void _update_region_list(struct installed_page_reg *member,
  1100. rt_ubase_t inst_head, rt_ubase_t inst_end,
  1101. rt_bitmap_t *ut_bitmap)
  1102. {
  1103. rt_spin_lock_init(&member->lock);
  1104. rt_spin_lock(&_inst_page_reg_lock);
  1105. member->region_area.start = inst_head;
  1106. member->region_area.end = inst_end;
  1107. #ifdef RT_DEBUGGING_PAGE_POISON
  1108. member->usage_trace = ut_bitmap;
  1109. #else
  1110. RT_UNUSED(ut_bitmap);
  1111. #endif /* RT_DEBUGGING_PAGE_POISON */
  1112. member->next = _inst_page_reg_head;
  1113. _inst_page_reg_head = member;
  1114. rt_spin_unlock(&_inst_page_reg_lock);
  1115. }
  1116. #define _PAGE_STRIPE (1 << (RT_PAGE_MAX_ORDER + ARCH_PAGE_SHIFT - 1))
  1117. int rt_page_install(rt_region_t region)
  1118. {
  1119. int err = -RT_EINVAL;
  1120. if (region.end != region.start && !(region.start & ARCH_PAGE_MASK) &&
  1121. !(region.end & ARCH_PAGE_MASK))
  1122. {
  1123. rt_ubase_t inst_head = region.start;
  1124. rt_ubase_t inst_end = region.end;
  1125. rt_ubase_t iter = inst_head;
  1126. int pages_count = (inst_end - inst_head) / ARCH_PAGE_SIZE;
  1127. struct installed_page_reg *installed_pgreg =
  1128. rt_calloc(1, sizeof(struct installed_page_reg) +
  1129. RT_BITMAP_LEN(pages_count) * sizeof(rt_bitmap_t));
  1130. if (installed_pgreg)
  1131. {
  1132. _update_region_list(installed_pgreg, inst_head, inst_end,
  1133. (rt_bitmap_t *)(installed_pgreg + 1));
  1134. if ((rt_ubase_t)iter & shadow_mask)
  1135. {
  1136. iter = RT_ALIGN((rt_ubase_t)inst_head, _PAGE_STRIPE);
  1137. _get_mpr_ready_n_install(inst_head, iter < inst_end ? iter : inst_end);
  1138. }
  1139. for (rt_ubase_t next = iter + _PAGE_STRIPE; next < inst_end;
  1140. iter = next, next += _PAGE_STRIPE)
  1141. {
  1142. _get_mpr_ready_n_install(iter, next);
  1143. }
  1144. if (iter < inst_end)
  1145. {
  1146. _get_mpr_ready_n_install(iter, inst_end);
  1147. }
  1148. }
  1149. }
  1150. return err;
  1151. }
  1152. void rt_page_cleanup(void)
  1153. {
  1154. early_offset = 0;
  1155. pages_alloc_handler = _pages_alloc;
  1156. }