mm_aspace.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762
  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. * 2022-11-14 WangXiaoyao the first version
  9. */
  10. /**
  11. * @brief Virtual Address Space
  12. */
  13. #include <rtdef.h>
  14. #include <rtthread.h>
  15. #include <stddef.h>
  16. #include <stdint.h>
  17. #define DBG_TAG "mm.aspace"
  18. #define DBG_LVL DBG_INFO
  19. #include <rtdbg.h>
  20. #include "avl_adpt.h"
  21. #include "mm_aspace.h"
  22. #include "mm_fault.h"
  23. #include "mm_flag.h"
  24. #include "mm_page.h"
  25. #include "mm_private.h"
  26. #include <mmu.h>
  27. #include <tlb.h>
  28. static void _aspace_unmap(rt_aspace_t aspace, void *addr, rt_size_t length);
  29. static void *_find_free(rt_aspace_t aspace, void *prefer, rt_size_t req_size,
  30. void *limit_start, rt_size_t limit_size,
  31. mm_flag_t flags);
  32. struct rt_aspace rt_kernel_space;
  33. rt_varea_t _varea_create(void *start, rt_size_t size)
  34. {
  35. rt_varea_t varea;
  36. varea = (rt_varea_t)rt_malloc(sizeof(struct rt_varea));
  37. if (varea)
  38. {
  39. varea->start = start;
  40. varea->size = size;
  41. }
  42. return varea;
  43. }
  44. static inline void _varea_post_install(rt_varea_t varea, rt_aspace_t aspace,
  45. rt_size_t attr, rt_size_t flags,
  46. rt_mem_obj_t mem_obj, rt_size_t offset)
  47. {
  48. varea->aspace = aspace;
  49. varea->attr = attr;
  50. varea->mem_obj = mem_obj;
  51. varea->flag = flags;
  52. varea->offset = offset;
  53. varea->frames = NULL;
  54. if (varea->mem_obj && varea->mem_obj->on_varea_open)
  55. varea->mem_obj->on_varea_open(varea);
  56. }
  57. int _init_lock(rt_aspace_t aspace)
  58. {
  59. MM_PGTBL_LOCK_INIT(aspace);
  60. rt_mutex_init(&aspace->bst_lock, "", RT_IPC_FLAG_FIFO);
  61. return RT_EOK;
  62. }
  63. rt_aspace_t rt_aspace_create(void *start, rt_size_t length, void *pgtbl)
  64. {
  65. rt_aspace_t aspace = NULL;
  66. void *page_table = pgtbl;
  67. if (page_table)
  68. {
  69. aspace = (rt_aspace_t)rt_malloc(sizeof(*aspace));
  70. if (aspace)
  71. {
  72. aspace->page_table = page_table;
  73. aspace->start = start;
  74. aspace->size = length;
  75. if (_init_lock(aspace) != RT_EOK ||
  76. _aspace_bst_init(aspace) != RT_EOK)
  77. {
  78. rt_free(aspace);
  79. aspace = NULL;
  80. }
  81. }
  82. }
  83. return aspace;
  84. }
  85. rt_aspace_t rt_aspace_init(rt_aspace_t aspace, void *start, rt_size_t length,
  86. void *pgtbl)
  87. {
  88. void *page_table = pgtbl;
  89. LOG_D("%s", __func__);
  90. if (page_table)
  91. {
  92. aspace->page_table = page_table;
  93. aspace->start = start;
  94. aspace->size = length;
  95. if (_init_lock(aspace) != RT_EOK || _aspace_bst_init(aspace) != RT_EOK)
  96. {
  97. aspace = NULL;
  98. }
  99. }
  100. return aspace;
  101. }
  102. void rt_aspace_detach(rt_aspace_t aspace)
  103. {
  104. _aspace_unmap(aspace, aspace->start, aspace->size);
  105. rt_mutex_detach(&aspace->bst_lock);
  106. }
  107. void rt_aspace_delete(rt_aspace_t aspace)
  108. {
  109. if (aspace)
  110. {
  111. rt_aspace_detach(aspace);
  112. rt_free(aspace);
  113. }
  114. }
  115. static int _do_named_map(rt_aspace_t aspace, void *vaddr, rt_size_t length,
  116. rt_size_t offset, rt_size_t attr)
  117. {
  118. LOG_D("%s: va %p length %p", __func__, vaddr, length);
  119. int err = RT_EOK;
  120. /* it's ensured by caller that (void*)end will not overflow */
  121. void *end = vaddr + length;
  122. void *phyaddr = (void *)(offset << MM_PAGE_SHIFT);
  123. while (vaddr != end)
  124. {
  125. /* TODO try to map with huge TLB, when flag & HUGEPAGE */
  126. rt_size_t pgsz = ARCH_PAGE_SIZE;
  127. rt_hw_mmu_map(aspace, vaddr, phyaddr, pgsz, attr);
  128. vaddr += pgsz;
  129. phyaddr += pgsz;
  130. }
  131. rt_hw_tlb_invalidate_range(aspace, vaddr, length, ARCH_PAGE_SIZE);
  132. return err;
  133. }
  134. rt_inline void _do_page_fault(struct rt_mm_fault_msg *msg, rt_size_t off,
  135. void *vaddr, rt_mem_obj_t mem_obj,
  136. rt_varea_t varea)
  137. {
  138. msg->off = off;
  139. msg->vaddr = vaddr;
  140. msg->fault_op = MM_FAULT_OP_READ;
  141. msg->fault_type = MM_FAULT_TYPE_PAGE_FAULT;
  142. msg->response.status = -1;
  143. mem_obj->on_page_fault(varea, msg);
  144. }
  145. /* allocate memory page for mapping range */
  146. static int _do_prefetch(rt_aspace_t aspace, rt_varea_t varea, void *start,
  147. rt_size_t size)
  148. {
  149. int err = RT_EOK;
  150. /* it's ensured by caller that start & size ara page-aligned */
  151. void *end = start + size;
  152. void *vaddr = start;
  153. rt_size_t off = varea->offset + ((start - varea->start) >> ARCH_PAGE_SHIFT);
  154. while (vaddr != end)
  155. {
  156. /* TODO try to map with huge TLB, when flag & HUGEPAGE */
  157. struct rt_mm_fault_msg msg;
  158. _do_page_fault(&msg, off, vaddr, varea->mem_obj, varea);
  159. if (msg.response.status == MM_FAULT_STATUS_OK)
  160. {
  161. void *store = msg.response.vaddr;
  162. rt_size_t store_sz = msg.response.size;
  163. if (store_sz + vaddr > end)
  164. {
  165. LOG_W("%s: too much (0x%lx) of buffer at vaddr %p is provided",
  166. __func__, store_sz, vaddr);
  167. break;
  168. }
  169. void *map = rt_hw_mmu_map(aspace, vaddr, store + PV_OFFSET,
  170. store_sz, varea->attr);
  171. if (!map)
  172. {
  173. LOG_W("%s: MMU mapping failed for va %p to %p of %lx", __func__,
  174. vaddr, store + PV_OFFSET, store_sz);
  175. }
  176. else
  177. {
  178. rt_hw_tlb_invalidate_range(aspace, vaddr, store_sz, ARCH_PAGE_SIZE);
  179. }
  180. vaddr += store_sz;
  181. off += store_sz >> ARCH_PAGE_SHIFT;
  182. }
  183. else
  184. {
  185. err = -RT_ENOMEM;
  186. LOG_W("%s failed because no memory is provided", __func__);
  187. break;
  188. }
  189. }
  190. return err;
  191. }
  192. int _varea_install(rt_aspace_t aspace, rt_varea_t varea, rt_mm_va_hint_t hint)
  193. {
  194. void *alloc_va;
  195. int err = RT_EOK;
  196. /**
  197. * find a suitable va range.
  198. * even though this is sleepable, it's still ok for startup routine
  199. */
  200. alloc_va =
  201. _find_free(aspace, hint->prefer, hint->map_size, hint->limit_start,
  202. hint->limit_range_size, hint->flags);
  203. /* TODO try merge surrounding regions to optimize memory footprint */
  204. if (alloc_va != RT_NULL)
  205. {
  206. varea->start = alloc_va;
  207. _aspace_bst_insert(aspace, varea);
  208. }
  209. else
  210. {
  211. err = -RT_ENOSPC;
  212. }
  213. return err;
  214. }
  215. static int _mm_aspace_map(rt_aspace_t aspace, rt_varea_t varea, rt_size_t attr,
  216. mm_flag_t flags, rt_mem_obj_t mem_obj,
  217. rt_size_t offset)
  218. {
  219. int err = RT_EOK;
  220. WR_LOCK(aspace);
  221. struct rt_mm_va_hint hint = {.prefer = varea->start,
  222. .map_size = varea->size,
  223. .limit_start = aspace->start,
  224. .limit_range_size = aspace->size,
  225. .flags = flags};
  226. if (mem_obj->hint_free)
  227. {
  228. mem_obj->hint_free(&hint);
  229. }
  230. err = _varea_install(aspace, varea, &hint);
  231. WR_UNLOCK(aspace);
  232. if (err == RT_EOK)
  233. {
  234. _varea_post_install(varea, aspace, attr, flags, mem_obj, offset);
  235. if (MMF_TEST_CNTL(flags, MMF_PREFETCH))
  236. {
  237. err = _do_prefetch(aspace, varea, varea->start, varea->size);
  238. }
  239. }
  240. return err;
  241. }
  242. static inline int _not_in_range(void *start, rt_size_t length,
  243. void *limit_start, rt_size_t limit_size)
  244. {
  245. if (start != RT_NULL)
  246. LOG_D("%s: [%p : %p] [%p : %p]", __func__, start, length, limit_start, limit_size);
  247. /* assuming (base + length) will not overflow except (0) */
  248. return start != RT_NULL
  249. ? ((length > (0ul - (uintptr_t)start)) || start < limit_start ||
  250. (length + (rt_size_t)(start - limit_start)) > limit_size)
  251. : length > limit_size;
  252. }
  253. static inline int _not_align(void *start, rt_size_t length, rt_size_t mask)
  254. {
  255. return (start != RT_NULL) &&
  256. (((uintptr_t)start & mask) || (length & mask));
  257. }
  258. static inline int _not_support(rt_size_t flags)
  259. {
  260. rt_size_t support_ops = (MMF_PREFETCH | MMF_MAP_FIXED | MMF_TEXT);
  261. return flags & ~(support_ops | _MMF_ALIGN_MASK);
  262. }
  263. int rt_aspace_map(rt_aspace_t aspace, void **addr, rt_size_t length,
  264. rt_size_t attr, mm_flag_t flags, rt_mem_obj_t mem_obj,
  265. rt_size_t offset)
  266. {
  267. /* TODO check not in atomic context: irq, spinlock, local intr disable... */
  268. int err;
  269. rt_varea_t varea;
  270. if (!aspace || !addr || !mem_obj || length == 0 ||
  271. _not_in_range(*addr, length, aspace->start, aspace->size))
  272. {
  273. err = -RT_EINVAL;
  274. LOG_I("%s: Invalid input", __func__);
  275. }
  276. else if (_not_support(flags))
  277. {
  278. LOG_I("%s: no support flags 0x%p", __func__, flags);
  279. err = -RT_ENOSYS;
  280. }
  281. else
  282. {
  283. varea = _varea_create(*addr, length);
  284. if (varea)
  285. {
  286. err = _mm_aspace_map(aspace, varea, attr, flags, mem_obj, offset);
  287. }
  288. else
  289. {
  290. LOG_W("%s: mm aspace map failed", __func__);
  291. err = -RT_ENOMEM;
  292. }
  293. }
  294. if (err != RT_EOK)
  295. {
  296. *addr = NULL;
  297. }
  298. else
  299. {
  300. *addr = varea->start;
  301. }
  302. return err;
  303. }
  304. int rt_aspace_map_static(rt_aspace_t aspace, rt_varea_t varea, void **addr,
  305. rt_size_t length, rt_size_t attr, mm_flag_t flags,
  306. rt_mem_obj_t mem_obj, rt_size_t offset)
  307. {
  308. int err;
  309. if (!aspace || !varea || !addr || !mem_obj || length == 0 ||
  310. _not_in_range(*addr, length, aspace->start, aspace->size))
  311. {
  312. err = -RT_EINVAL;
  313. LOG_W("%s: Invalid input", __func__);
  314. }
  315. else if (_not_support(flags))
  316. {
  317. LOG_W("%s: no support flags", __func__);
  318. err = -RT_ENOSYS;
  319. }
  320. else
  321. {
  322. varea->size = length;
  323. varea->start = *addr;
  324. err = _mm_aspace_map(aspace, varea, attr, flags, mem_obj, offset);
  325. }
  326. if (err != RT_EOK)
  327. {
  328. *addr = NULL;
  329. }
  330. else
  331. {
  332. *addr = varea->start;
  333. }
  334. return err;
  335. }
  336. int _mm_aspace_map_phy(rt_aspace_t aspace, rt_varea_t varea,
  337. rt_mm_va_hint_t hint, rt_size_t attr, rt_size_t pa_off,
  338. void **ret_va)
  339. {
  340. int err;
  341. void *vaddr;
  342. if (!aspace || !hint || !hint->limit_range_size || !hint->map_size)
  343. {
  344. LOG_W("%s: Invalid input", __func__);
  345. err = -RT_EINVAL;
  346. }
  347. else if (_not_align(hint->prefer, hint->map_size, ARCH_PAGE_MASK))
  348. {
  349. LOG_W("%s: not aligned", __func__);
  350. err = -RT_EINVAL;
  351. }
  352. else if (_not_in_range(hint->limit_start, hint->limit_range_size, aspace->start,
  353. aspace->size) ||
  354. _not_in_range(hint->prefer, hint->map_size, aspace->start,
  355. aspace->size))
  356. {
  357. LOG_W("%s: not in range", __func__);
  358. err = -RT_EINVAL;
  359. }
  360. else
  361. {
  362. WR_LOCK(aspace);
  363. err = _varea_install(aspace, varea, hint);
  364. WR_UNLOCK(aspace);
  365. if (err == RT_EOK)
  366. {
  367. _varea_post_install(varea, aspace, attr, 0, NULL, pa_off);
  368. vaddr = varea->start;
  369. err = _do_named_map(aspace, varea->start, varea->size,
  370. (rt_size_t)pa_off, attr);
  371. if (err != RT_EOK)
  372. {
  373. _aspace_unmap(aspace, varea->start, varea->size);
  374. rt_free(varea);
  375. }
  376. }
  377. }
  378. if (ret_va)
  379. {
  380. if (err == RT_EOK)
  381. *ret_va = vaddr;
  382. else
  383. *ret_va = RT_NULL;
  384. }
  385. return err;
  386. }
  387. int rt_aspace_map_phy(rt_aspace_t aspace, rt_mm_va_hint_t hint, rt_size_t attr,
  388. rt_size_t pa_off, void **ret_va)
  389. {
  390. int err;
  391. if (hint)
  392. {
  393. rt_varea_t varea = _varea_create(hint->prefer, hint->map_size);
  394. if (varea)
  395. {
  396. err = _mm_aspace_map_phy(aspace, varea, hint, attr, pa_off, ret_va);
  397. if (err != RT_EOK)
  398. {
  399. rt_free(varea);
  400. }
  401. }
  402. else
  403. {
  404. err = -RT_ENOMEM;
  405. }
  406. }
  407. else
  408. {
  409. err = -RT_EINVAL;
  410. }
  411. return err;
  412. }
  413. int rt_aspace_map_phy_static(rt_aspace_t aspace, rt_varea_t varea,
  414. rt_mm_va_hint_t hint, rt_size_t attr,
  415. rt_size_t pa_off, void **ret_va)
  416. {
  417. int err;
  418. if (varea && hint)
  419. {
  420. varea->start = hint->prefer;
  421. varea->size = hint->map_size;
  422. hint->flags |= MMF_MAP_FIXED;
  423. LOG_D("%s: start %p size %p phy at %p", __func__, varea->start, varea->size, pa_off << MM_PAGE_SHIFT);
  424. err = _mm_aspace_map_phy(aspace, varea, hint, attr, pa_off, ret_va);
  425. }
  426. else
  427. {
  428. err = -RT_EINVAL;
  429. }
  430. return err;
  431. }
  432. void _aspace_unmap(rt_aspace_t aspace, void *addr, rt_size_t length)
  433. {
  434. struct _mm_range range = {addr, addr + length - 1};
  435. rt_varea_t varea = _aspace_bst_search_overlap(aspace, range);
  436. while (varea)
  437. {
  438. if (varea->mem_obj && varea->mem_obj->on_varea_close)
  439. varea->mem_obj->on_varea_close(varea);
  440. rt_varea_free_pages(varea);
  441. WR_LOCK(aspace);
  442. _aspace_bst_remove(aspace, varea);
  443. WR_UNLOCK(aspace);
  444. rt_hw_mmu_unmap(aspace, varea->start, varea->size);
  445. rt_hw_tlb_invalidate_range(aspace, varea->start, varea->size, ARCH_PAGE_SIZE);
  446. rt_free(varea);
  447. varea = _aspace_bst_search_overlap(aspace, range);
  448. }
  449. }
  450. int rt_aspace_unmap(rt_aspace_t aspace, void *addr, rt_size_t length)
  451. {
  452. if (!aspace)
  453. {
  454. LOG_I("%s: Invalid input", __func__);
  455. return -RT_EINVAL;
  456. }
  457. if (_not_in_range(addr, length, aspace->start, aspace->size))
  458. {
  459. LOG_I("%s: %lx not in range of aspace[%lx:%lx]", __func__, addr,
  460. aspace->start, aspace->start + aspace->size);
  461. return -RT_EINVAL;
  462. }
  463. _aspace_unmap(aspace, addr, length);
  464. return RT_EOK;
  465. }
  466. static inline void *_lower(void *a, void *b)
  467. {
  468. return a < b ? a : b;
  469. }
  470. static inline void *_align(void *va, rt_ubase_t align_mask)
  471. {
  472. return (void *)((rt_ubase_t)(va + ~align_mask) & align_mask);
  473. }
  474. static void *_ascending_search(rt_varea_t varea, rt_size_t req_size,
  475. rt_ubase_t align_mask, struct _mm_range limit)
  476. {
  477. void *ret = RT_NULL;
  478. while (varea && varea->start < limit.end)
  479. {
  480. void *candidate = varea->start + varea->size;
  481. candidate = _align(candidate, align_mask);
  482. if (candidate > limit.end || limit.end - candidate + 1 < req_size)
  483. break;
  484. rt_varea_t nx_va = ASPACE_VAREA_NEXT(varea);
  485. if (nx_va)
  486. {
  487. rt_size_t gap_size =
  488. _lower(limit.end, nx_va->start - 1) - candidate + 1;
  489. if (gap_size >= req_size)
  490. {
  491. ret = candidate;
  492. break;
  493. }
  494. }
  495. else
  496. {
  497. ret = candidate;
  498. }
  499. varea = nx_va;
  500. }
  501. return ret;
  502. }
  503. /** find suitable place in [limit_start, limit_end] */
  504. static void *_find_head_and_asc_search(rt_aspace_t aspace, rt_size_t req_size,
  505. rt_ubase_t align_mask,
  506. struct _mm_range limit)
  507. {
  508. void *va = RT_NULL;
  509. rt_varea_t varea = _aspace_bst_search_exceed(aspace, limit.start);
  510. if (varea)
  511. {
  512. void *candidate = _align(limit.start, align_mask);
  513. rt_size_t gap_size = varea->start - candidate;
  514. if (gap_size >= req_size)
  515. {
  516. rt_varea_t former = _aspace_bst_search(aspace, limit.start);
  517. if (former)
  518. {
  519. candidate = _align(former->start + former->size, align_mask);
  520. gap_size = varea->start - candidate;
  521. if (gap_size >= req_size)
  522. va = candidate;
  523. else
  524. va = _ascending_search(varea, req_size, align_mask, limit);
  525. }
  526. else
  527. {
  528. va = candidate;
  529. }
  530. }
  531. else
  532. {
  533. va = _ascending_search(varea, req_size, align_mask, limit);
  534. }
  535. }
  536. else
  537. {
  538. void *candidate;
  539. rt_size_t gap_size;
  540. rt_varea_t former = _aspace_bst_search(aspace, limit.start);
  541. candidate = former ? former->start + former->size : limit.start;
  542. candidate = _align(candidate, align_mask);
  543. gap_size = limit.end - candidate + 1;
  544. if (gap_size >= req_size)
  545. va = candidate;
  546. }
  547. return va;
  548. }
  549. static void *_find_free(rt_aspace_t aspace, void *prefer, rt_size_t req_size,
  550. void *limit_start, rt_size_t limit_size,
  551. mm_flag_t flags)
  552. {
  553. rt_varea_t varea = NULL;
  554. void *va = RT_NULL;
  555. struct _mm_range limit = {limit_start, limit_start + limit_size - 1};
  556. rt_ubase_t align_mask = ~0ul;
  557. if (flags & MMF_REQUEST_ALIGN)
  558. {
  559. align_mask = ~((1 << MMF_GET_ALIGN(flags)) - 1);
  560. }
  561. if (prefer != RT_NULL)
  562. {
  563. prefer = _align(prefer, align_mask);
  564. struct _mm_range range = {prefer, prefer + req_size - 1};
  565. varea = _aspace_bst_search_overlap(aspace, range);
  566. if (!varea)
  567. {
  568. va = prefer;
  569. }
  570. else if (flags & MMF_MAP_FIXED)
  571. {
  572. /* OVERLAP */
  573. }
  574. else
  575. {
  576. va = _ascending_search(varea, req_size, align_mask, limit);
  577. if (va == RT_NULL)
  578. {
  579. limit.end = varea->start - 1;
  580. va = _find_head_and_asc_search(aspace, req_size, align_mask,
  581. limit);
  582. }
  583. }
  584. }
  585. else
  586. {
  587. va = _find_head_and_asc_search(aspace, req_size, align_mask, limit);
  588. }
  589. return va;
  590. }
  591. int rt_aspace_load_page(rt_aspace_t aspace, void *addr, rt_size_t npage)
  592. {
  593. int err = RT_EOK;
  594. rt_varea_t varea = _aspace_bst_search(aspace, addr);
  595. void *end = addr + (npage << ARCH_PAGE_SHIFT);
  596. if (!varea)
  597. {
  598. LOG_W("%s: varea not exist", __func__);
  599. err = -RT_ENOENT;
  600. }
  601. else if (addr >= end || (rt_size_t)addr & ARCH_PAGE_MASK ||
  602. _not_in_range(addr, npage << ARCH_PAGE_SHIFT, varea->start,
  603. varea->size))
  604. {
  605. LOG_W("%s: Unaligned parameter or out of range", __func__);
  606. err = -RT_EINVAL;
  607. }
  608. else
  609. {
  610. err = _do_prefetch(aspace, varea, addr, npage << ARCH_PAGE_SHIFT);
  611. }
  612. return err;
  613. }
  614. int rt_aspace_offload_page(rt_aspace_t aspace, void *addr, rt_size_t npage)
  615. {
  616. return -RT_ENOSYS;
  617. }
  618. int mm_aspace_control(rt_aspace_t aspace, void *addr, enum rt_mmu_cntl cmd)
  619. {
  620. int err;
  621. rt_varea_t varea = _aspace_bst_search(aspace, addr);
  622. if (varea)
  623. {
  624. err = rt_hw_mmu_control(aspace, varea->start, varea->size, cmd);
  625. }
  626. else
  627. {
  628. err = -RT_ENOENT;
  629. }
  630. return err;
  631. }
  632. int rt_aspace_traversal(rt_aspace_t aspace,
  633. int (*fn)(rt_varea_t varea, void *arg), void *arg)
  634. {
  635. rt_varea_t varea = ASPACE_VAREA_FIRST(aspace);
  636. while (varea)
  637. {
  638. fn(varea, arg);
  639. varea = ASPACE_VAREA_NEXT(varea);
  640. }
  641. return 0;
  642. }
  643. static int _dump(rt_varea_t varea, void *arg)
  644. {
  645. if (varea->mem_obj && varea->mem_obj->get_name)
  646. {
  647. rt_kprintf("[%p - %p] %s\n", varea->start, varea->start + varea->size,
  648. varea->mem_obj->get_name(varea));
  649. }
  650. else
  651. {
  652. rt_kprintf("[%p - %p] phy-map\n", varea->start, varea->start + varea->size);
  653. rt_kprintf("\t\\_ paddr = %p\n", varea->offset << MM_PAGE_SHIFT);
  654. }
  655. return 0;
  656. }
  657. void rt_aspace_print_all(rt_aspace_t aspace)
  658. {
  659. rt_aspace_traversal(aspace, _dump, NULL);
  660. }