mm_aspace.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955
  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 *_find_free(rt_aspace_t aspace, void *prefer, rt_size_t req_size,
  29. void *limit_start, rt_size_t limit_size,
  30. mm_flag_t flags);
  31. static void _varea_uninstall(rt_varea_t varea);
  32. struct rt_aspace rt_kernel_space;
  33. static int _init_lock(rt_aspace_t aspace)
  34. {
  35. int err;
  36. MM_PGTBL_LOCK_INIT(aspace);
  37. err = rt_mutex_init(&aspace->bst_lock, "aspace", RT_IPC_FLAG_FIFO);
  38. return err;
  39. }
  40. rt_err_t rt_aspace_init(rt_aspace_t aspace, void *start, rt_size_t length, void *pgtbl)
  41. {
  42. int err = RT_EOK;
  43. if (pgtbl)
  44. {
  45. aspace->page_table = pgtbl;
  46. aspace->start = start;
  47. aspace->size = length;
  48. err = _aspace_bst_init(aspace);
  49. if (err == RT_EOK)
  50. {
  51. /**
  52. * It has the side effect that lock will be added to object
  53. * system management. So it must be paired with a detach once
  54. * the initialization return successfully.
  55. */
  56. err = _init_lock(aspace);
  57. }
  58. }
  59. else
  60. {
  61. err = -RT_EINVAL;
  62. }
  63. return err;
  64. }
  65. rt_aspace_t rt_aspace_create(void *start, rt_size_t length, void *pgtbl)
  66. {
  67. rt_aspace_t aspace = NULL;
  68. int err;
  69. RT_ASSERT(length <= 0 - (rt_size_t)start);
  70. aspace = (rt_aspace_t)rt_malloc(sizeof(*aspace));
  71. if (aspace)
  72. {
  73. rt_memset(aspace, 0, sizeof(*aspace));
  74. err = rt_aspace_init(aspace, start, length, pgtbl);
  75. if (err != RT_EOK)
  76. {
  77. LOG_W("%s(%p, %lx, %p): failed with code %d\n", __func__,
  78. start, length, pgtbl, err);
  79. rt_free(aspace);
  80. aspace = RT_NULL;
  81. }
  82. }
  83. return aspace;
  84. }
  85. void rt_aspace_detach(rt_aspace_t aspace)
  86. {
  87. WR_LOCK(aspace);
  88. rt_varea_t varea = ASPACE_VAREA_FIRST(aspace);
  89. while (varea)
  90. {
  91. rt_varea_t prev = varea;
  92. _varea_uninstall(varea);
  93. varea = ASPACE_VAREA_NEXT(varea);
  94. if (!(prev->flag & MMF_STATIC_ALLOC))
  95. {
  96. rt_free(prev);
  97. }
  98. }
  99. WR_UNLOCK(aspace);
  100. rt_mutex_detach(&aspace->bst_lock);
  101. }
  102. void rt_aspace_delete(rt_aspace_t aspace)
  103. {
  104. RT_ASSERT(aspace);
  105. rt_aspace_detach(aspace);
  106. rt_free(aspace);
  107. }
  108. static int _do_named_map(rt_aspace_t aspace, void *vaddr, rt_size_t length,
  109. rt_size_t offset, rt_size_t attr)
  110. {
  111. LOG_D("%s: va %p length %p", __func__, vaddr, length);
  112. int err = RT_EOK;
  113. /* it's ensured by caller that (void*)end will not overflow */
  114. void *end = vaddr + length;
  115. void *phyaddr = (void *)(offset << MM_PAGE_SHIFT);
  116. while (vaddr != end)
  117. {
  118. /* TODO try to map with huge TLB, when flag & HUGEPAGE */
  119. rt_size_t pgsz = ARCH_PAGE_SIZE;
  120. void *ret = rt_hw_mmu_map(aspace, vaddr, phyaddr, pgsz, attr);
  121. if (ret == RT_NULL)
  122. {
  123. err = -RT_ERROR;
  124. break;
  125. }
  126. vaddr += pgsz;
  127. phyaddr += pgsz;
  128. }
  129. if (err == RT_EOK)
  130. rt_hw_tlb_invalidate_range(aspace, end - length, length, ARCH_PAGE_SIZE);
  131. return err;
  132. }
  133. rt_inline void _do_page_fault(struct rt_aspace_fault_msg *msg, rt_size_t off,
  134. void *vaddr, rt_mem_obj_t mem_obj,
  135. rt_varea_t varea)
  136. {
  137. msg->off = off;
  138. msg->fault_vaddr = vaddr;
  139. msg->fault_op = MM_FAULT_OP_READ;
  140. msg->fault_type = MM_FAULT_TYPE_PAGE_FAULT;
  141. msg->response.status = -1;
  142. msg->response.vaddr = 0;
  143. msg->response.size = 0;
  144. mem_obj->on_page_fault(varea, msg);
  145. }
  146. int _varea_map_with_msg(rt_varea_t varea, struct rt_aspace_fault_msg *msg)
  147. {
  148. int err = -RT_ERROR;
  149. if (msg->response.status == MM_FAULT_STATUS_OK)
  150. {
  151. /**
  152. * the page returned by handler is not checked
  153. * cause no much assumption can make on it
  154. */
  155. void *store = msg->response.vaddr;
  156. rt_size_t store_sz = msg->response.size;
  157. if (msg->fault_vaddr + store_sz > varea->start + varea->size)
  158. {
  159. LOG_W("%s: too much (0x%lx) of buffer on vaddr %p is provided",
  160. __func__, store_sz, msg->fault_vaddr);
  161. }
  162. else
  163. {
  164. void *map;
  165. void *v_addr = msg->fault_vaddr;
  166. void *p_addr = store + PV_OFFSET;
  167. map = rt_hw_mmu_map(varea->aspace, v_addr, p_addr, store_sz, varea->attr);
  168. if (!map)
  169. {
  170. LOG_W("%s: MMU mapping failed for va %p to %p of %lx", __func__,
  171. msg->fault_vaddr, store + PV_OFFSET, store_sz);
  172. }
  173. else
  174. {
  175. rt_hw_tlb_invalidate_range(varea->aspace, v_addr, store_sz, ARCH_PAGE_SIZE);
  176. err = RT_EOK;
  177. }
  178. }
  179. }
  180. else if (msg->response.status == MM_FAULT_STATUS_OK_MAPPED)
  181. {
  182. if (rt_hw_mmu_v2p(varea->aspace, msg->fault_vaddr) == ARCH_MAP_FAILED)
  183. {
  184. LOG_W("%s: no page is mapped on %p", __func__, msg->fault_vaddr);
  185. }
  186. else
  187. {
  188. err = RT_EOK;
  189. }
  190. }
  191. else
  192. {
  193. LOG_W("%s: failed on va %p inside varea %p(%s)", __func__, msg->fault_vaddr, varea,
  194. varea->mem_obj->get_name ? varea->mem_obj->get_name(varea) : "unknow");
  195. }
  196. return err;
  197. }
  198. /* allocate memory page for mapping range */
  199. static int _do_prefetch(rt_aspace_t aspace, rt_varea_t varea, void *start,
  200. rt_size_t size)
  201. {
  202. int err = RT_EOK;
  203. /* it's ensured by caller that start & size ara page-aligned */
  204. void *end = start + size;
  205. void *vaddr = start;
  206. rt_size_t off = varea->offset + ((start - varea->start) >> ARCH_PAGE_SHIFT);
  207. while (vaddr != end)
  208. {
  209. /* TODO try to map with huge TLB, when flag & HUGEPAGE */
  210. struct rt_aspace_fault_msg msg;
  211. _do_page_fault(&msg, off, vaddr, varea->mem_obj, varea);
  212. if (_varea_map_with_msg(varea, &msg))
  213. break;
  214. /**
  215. * It's hard to identify the mapping pattern on a customized handler
  216. * So we terminate the prefetch process on that case
  217. */
  218. if (msg.response.status == MM_FAULT_STATUS_OK_MAPPED)
  219. break;
  220. vaddr += msg.response.size;
  221. off += msg.response.size >> ARCH_PAGE_SHIFT;
  222. }
  223. return err;
  224. }
  225. /* caller must hold the aspace lock */
  226. static int _varea_install(rt_aspace_t aspace, rt_varea_t varea, rt_mm_va_hint_t hint)
  227. {
  228. void *alloc_va;
  229. int err = RT_EOK;
  230. /**
  231. * find a suitable va range.
  232. * even though this is sleepable, it's still ok for startup routine
  233. */
  234. alloc_va =
  235. _find_free(aspace, hint->prefer, hint->map_size, hint->limit_start,
  236. hint->limit_range_size, hint->flags);
  237. /* TODO try merge surrounding regions to optimize memory footprint */
  238. if (alloc_va != RT_NULL)
  239. {
  240. varea->start = alloc_va;
  241. _aspace_bst_insert(aspace, varea);
  242. }
  243. else
  244. {
  245. err = -RT_ENOSPC;
  246. }
  247. return err;
  248. }
  249. static inline void _varea_post_install(rt_varea_t varea, rt_aspace_t aspace,
  250. rt_size_t attr, rt_size_t flags,
  251. rt_mem_obj_t mem_obj, rt_size_t offset)
  252. {
  253. varea->aspace = aspace;
  254. varea->attr = attr;
  255. varea->mem_obj = mem_obj;
  256. varea->flag = flags;
  257. varea->offset = offset;
  258. varea->frames = NULL;
  259. if (varea->mem_obj && varea->mem_obj->on_varea_open)
  260. varea->mem_obj->on_varea_open(varea);
  261. }
  262. /**
  263. * restore context modified by varea install
  264. * caller must NOT hold the aspace lock
  265. */
  266. static void _varea_uninstall(rt_varea_t varea)
  267. {
  268. rt_aspace_t aspace = varea->aspace;
  269. if (varea->mem_obj && varea->mem_obj->on_varea_close)
  270. varea->mem_obj->on_varea_close(varea);
  271. rt_hw_mmu_unmap(aspace, varea->start, varea->size);
  272. rt_hw_tlb_invalidate_range(aspace, varea->start, varea->size, ARCH_PAGE_SIZE);
  273. rt_varea_pgmgr_pop_all(varea);
  274. WR_LOCK(aspace);
  275. _aspace_bst_remove(aspace, varea);
  276. WR_UNLOCK(aspace);
  277. }
  278. static int _mm_aspace_map(rt_aspace_t aspace, rt_varea_t varea, rt_size_t attr,
  279. mm_flag_t flags, rt_mem_obj_t mem_obj,
  280. rt_size_t offset)
  281. {
  282. int err = RT_EOK;
  283. WR_LOCK(aspace);
  284. /**
  285. * @brief .prefer & .map_size are scratched from varea which setup by caller
  286. * .limit_start & .limit_range_size have default to be in range of aspace
  287. * .flags is from parameter, and will be fill in varea if install successfully
  288. */
  289. struct rt_mm_va_hint hint = {.prefer = varea->start,
  290. .map_size = varea->size,
  291. .limit_start = aspace->start,
  292. .limit_range_size = aspace->size,
  293. .flags = flags};
  294. if (mem_obj->hint_free)
  295. {
  296. /* mem object can control mapping range and so by modifing hint */
  297. mem_obj->hint_free(&hint);
  298. }
  299. /* try to allocate a virtual address region for varea */
  300. err = _varea_install(aspace, varea, &hint);
  301. WR_UNLOCK(aspace);
  302. if (err == RT_EOK)
  303. {
  304. /* fill in varea data */
  305. _varea_post_install(varea, aspace, attr, flags, mem_obj, offset);
  306. if (MMF_TEST_CNTL(flags, MMF_PREFETCH))
  307. {
  308. /* do the MMU & TLB business */
  309. err = _do_prefetch(aspace, varea, varea->start, varea->size);
  310. if (err)
  311. {
  312. /* restore data structure and MMU */
  313. _varea_uninstall(varea);
  314. }
  315. }
  316. }
  317. return err;
  318. }
  319. rt_varea_t _varea_create(void *start, rt_size_t size)
  320. {
  321. rt_varea_t varea;
  322. varea = (rt_varea_t)rt_malloc(sizeof(struct rt_varea));
  323. if (varea)
  324. {
  325. varea->start = start;
  326. varea->size = size;
  327. }
  328. return varea;
  329. }
  330. #define _IS_OVERFLOW(start, length) ((length) > (0ul - (uintptr_t)(start)))
  331. #define _IS_OVERSIZE(start, length, limit_s, limit_sz) (((length) + (rt_size_t)((start) - (limit_start))) > (limit_size))
  332. static inline int _not_in_range(void *start, rt_size_t length,
  333. void *limit_start, rt_size_t limit_size)
  334. {
  335. if (start != RT_NULL)
  336. LOG_D("%s: [%p : %p] [%p : %p]", __func__, start, length, limit_start, limit_size);
  337. /* assuming (base + length) will not overflow except (0) */
  338. return start != RT_NULL
  339. ? (_IS_OVERFLOW(start, length) || start < limit_start ||
  340. _IS_OVERSIZE(start, length, limit_start, limit_size))
  341. : length > limit_size;
  342. }
  343. static inline int _not_align(void *start, rt_size_t length, rt_size_t mask)
  344. {
  345. return (start != RT_NULL) &&
  346. (((uintptr_t)start & mask) || (length & mask));
  347. }
  348. static inline int _not_support(rt_size_t flags)
  349. {
  350. rt_size_t support_ops = (MMF_PREFETCH | MMF_MAP_FIXED | MMF_TEXT |
  351. MMF_STATIC_ALLOC | MMF_REQUEST_ALIGN);
  352. return flags & ~(support_ops | _MMF_ALIGN_MASK);
  353. }
  354. int rt_aspace_map(rt_aspace_t aspace, void **addr, rt_size_t length,
  355. rt_size_t attr, mm_flag_t flags, rt_mem_obj_t mem_obj,
  356. rt_size_t offset)
  357. {
  358. /* TODO check not in atomic context: irq, spinlock, local intr disable... */
  359. int err;
  360. rt_varea_t varea;
  361. if (!aspace || !addr || !mem_obj || length == 0)
  362. {
  363. err = -RT_EINVAL;
  364. LOG_I("%s(%p, %p, %lx, %lx, %lx, %p, %lx): Invalid input",
  365. __func__, aspace, addr, length, attr, flags, mem_obj, offset);
  366. }
  367. else if (_not_in_range(*addr, length, aspace->start, aspace->size))
  368. {
  369. err = -RT_EINVAL;
  370. LOG_I("%s(addr:%p, len:%lx): out of range", __func__, *addr, length);
  371. }
  372. else if (_not_support(flags))
  373. {
  374. LOG_I("%s: no support flags 0x%lx", __func__, flags);
  375. err = -RT_ENOSYS;
  376. }
  377. else
  378. {
  379. /* allocate the varea and fill in start and size */
  380. varea = _varea_create(*addr, length);
  381. if (varea)
  382. {
  383. err = _mm_aspace_map(aspace, varea, attr, flags, mem_obj, offset);
  384. if (err != RT_EOK)
  385. {
  386. rt_free(varea);
  387. }
  388. }
  389. else
  390. {
  391. LOG_W("%s: memory allocation failed", __func__);
  392. err = -RT_ENOMEM;
  393. }
  394. }
  395. if (err != RT_EOK)
  396. {
  397. *addr = NULL;
  398. }
  399. else
  400. {
  401. *addr = varea->start;
  402. }
  403. return err;
  404. }
  405. int rt_aspace_map_static(rt_aspace_t aspace, rt_varea_t varea, void **addr,
  406. rt_size_t length, rt_size_t attr, mm_flag_t flags,
  407. rt_mem_obj_t mem_obj, rt_size_t offset)
  408. {
  409. int err;
  410. if (!aspace || !varea || !addr || !mem_obj || length == 0 ||
  411. _not_in_range(*addr, length, aspace->start, aspace->size))
  412. {
  413. err = -RT_EINVAL;
  414. LOG_W("%s: Invalid input", __func__);
  415. }
  416. else if (_not_support(flags))
  417. {
  418. LOG_W("%s: no support flags", __func__);
  419. err = -RT_ENOSYS;
  420. }
  421. else
  422. {
  423. varea->size = length;
  424. varea->start = *addr;
  425. flags |= MMF_STATIC_ALLOC;
  426. err = _mm_aspace_map(aspace, varea, attr, flags, mem_obj, offset);
  427. }
  428. if (err != RT_EOK)
  429. {
  430. *addr = NULL;
  431. }
  432. else
  433. {
  434. *addr = varea->start;
  435. }
  436. return err;
  437. }
  438. int _mm_aspace_map_phy(rt_aspace_t aspace, rt_varea_t varea,
  439. rt_mm_va_hint_t hint, rt_size_t attr, rt_size_t pa_off,
  440. void **ret_va)
  441. {
  442. int err;
  443. void *vaddr;
  444. if (!aspace || !hint || !hint->limit_range_size || !hint->map_size)
  445. {
  446. LOG_W("%s: Invalid input", __func__);
  447. err = -RT_EINVAL;
  448. }
  449. else if (_not_align(hint->prefer, hint->map_size, ARCH_PAGE_MASK))
  450. {
  451. LOG_W("%s: not aligned", __func__);
  452. err = -RT_EINVAL;
  453. }
  454. else if (_not_in_range(hint->limit_start, hint->limit_range_size, aspace->start,
  455. aspace->size) ||
  456. _not_in_range(hint->prefer, hint->map_size, aspace->start,
  457. aspace->size))
  458. {
  459. LOG_W("%s: not in range", __func__);
  460. err = -RT_EINVAL;
  461. }
  462. else
  463. {
  464. WR_LOCK(aspace);
  465. err = _varea_install(aspace, varea, hint);
  466. WR_UNLOCK(aspace);
  467. if (err == RT_EOK)
  468. {
  469. _varea_post_install(varea, aspace, attr, hint->flags, NULL, pa_off);
  470. vaddr = varea->start;
  471. err = _do_named_map(aspace, varea->start, varea->size,
  472. (rt_size_t)pa_off, attr);
  473. if (err != RT_EOK)
  474. {
  475. _varea_uninstall(varea);
  476. }
  477. }
  478. }
  479. if (ret_va)
  480. {
  481. if (err == RT_EOK)
  482. *ret_va = vaddr;
  483. else
  484. *ret_va = RT_NULL;
  485. }
  486. return err;
  487. }
  488. int rt_aspace_map_phy(rt_aspace_t aspace, rt_mm_va_hint_t hint, rt_size_t attr,
  489. rt_size_t pa_off, void **ret_va)
  490. {
  491. int err;
  492. if (hint)
  493. {
  494. rt_varea_t varea = _varea_create(hint->prefer, hint->map_size);
  495. if (varea)
  496. {
  497. err = _mm_aspace_map_phy(aspace, varea, hint, attr, pa_off, ret_va);
  498. if (err != RT_EOK)
  499. {
  500. rt_free(varea);
  501. }
  502. }
  503. else
  504. {
  505. err = -RT_ENOMEM;
  506. }
  507. }
  508. else
  509. {
  510. err = -RT_EINVAL;
  511. }
  512. return err;
  513. }
  514. int rt_aspace_map_phy_static(rt_aspace_t aspace, rt_varea_t varea,
  515. rt_mm_va_hint_t hint, rt_size_t attr,
  516. rt_size_t pa_off, void **ret_va)
  517. {
  518. int err;
  519. if (varea && hint)
  520. {
  521. varea->start = hint->prefer;
  522. varea->size = hint->map_size;
  523. hint->flags |= (MMF_MAP_FIXED | MMF_STATIC_ALLOC);
  524. LOG_D("%s: start %p size %p phy at %p", __func__, varea->start, varea->size, pa_off << MM_PAGE_SHIFT);
  525. err = _mm_aspace_map_phy(aspace, varea, hint, attr, pa_off, ret_va);
  526. }
  527. else
  528. {
  529. err = -RT_EINVAL;
  530. }
  531. return err;
  532. }
  533. void _aspace_unmap(rt_aspace_t aspace, void *addr)
  534. {
  535. WR_LOCK(aspace);
  536. rt_varea_t varea = _aspace_bst_search(aspace, addr);
  537. WR_UNLOCK(aspace);
  538. if (varea == RT_NULL)
  539. {
  540. LOG_I("%s: No such entry found at %p\n", __func__, addr);
  541. }
  542. _varea_uninstall(varea);
  543. if (!(varea->flag & MMF_STATIC_ALLOC))
  544. {
  545. rt_free(varea);
  546. }
  547. }
  548. int rt_aspace_unmap(rt_aspace_t aspace, void *addr)
  549. {
  550. if (!aspace)
  551. {
  552. LOG_I("%s: Invalid input", __func__);
  553. return -RT_EINVAL;
  554. }
  555. if (_not_in_range(addr, 1, aspace->start, aspace->size))
  556. {
  557. LOG_I("%s: %lx not in range of aspace[%lx:%lx]", __func__, addr,
  558. aspace->start, aspace->start + aspace->size);
  559. return -RT_EINVAL;
  560. }
  561. _aspace_unmap(aspace, addr);
  562. return RT_EOK;
  563. }
  564. static inline void *_lower(void *a, void *b)
  565. {
  566. return a < b ? a : b;
  567. }
  568. static inline void *_align(void *va, rt_ubase_t align_mask)
  569. {
  570. return (void *)((rt_ubase_t)(va + ~align_mask) & align_mask);
  571. }
  572. static void *_ascending_search(rt_varea_t varea, rt_size_t req_size,
  573. rt_ubase_t align_mask, struct _mm_range limit)
  574. {
  575. void *ret = RT_NULL;
  576. while (varea && varea->start < limit.end)
  577. {
  578. void *candidate = varea->start + varea->size;
  579. candidate = _align(candidate, align_mask);
  580. if (candidate > limit.end || limit.end - candidate + 1 < req_size)
  581. break;
  582. rt_varea_t nx_va = ASPACE_VAREA_NEXT(varea);
  583. if (nx_va)
  584. {
  585. rt_size_t gap_size =
  586. _lower(limit.end, nx_va->start - 1) - candidate + 1;
  587. if (gap_size >= req_size)
  588. {
  589. ret = candidate;
  590. break;
  591. }
  592. }
  593. else
  594. {
  595. ret = candidate;
  596. }
  597. varea = nx_va;
  598. }
  599. return ret;
  600. }
  601. /** find suitable place in [limit_start, limit_end] */
  602. static void *_find_head_and_asc_search(rt_aspace_t aspace, rt_size_t req_size,
  603. rt_ubase_t align_mask,
  604. struct _mm_range limit)
  605. {
  606. void *va = RT_NULL;
  607. rt_varea_t varea = _aspace_bst_search_exceed(aspace, limit.start);
  608. if (varea)
  609. {
  610. void *candidate = _align(limit.start, align_mask);
  611. rt_size_t gap_size = varea->start - candidate;
  612. if (gap_size >= req_size)
  613. {
  614. rt_varea_t former = _aspace_bst_search(aspace, limit.start);
  615. if (former)
  616. {
  617. candidate = _align(former->start + former->size, align_mask);
  618. gap_size = varea->start - candidate;
  619. if (gap_size >= req_size)
  620. va = candidate;
  621. else
  622. va = _ascending_search(varea, req_size, align_mask, limit);
  623. }
  624. else
  625. {
  626. va = candidate;
  627. }
  628. }
  629. else
  630. {
  631. va = _ascending_search(varea, req_size, align_mask, limit);
  632. }
  633. }
  634. else
  635. {
  636. void *candidate;
  637. rt_size_t gap_size;
  638. candidate = limit.start;
  639. candidate = _align(candidate, align_mask);
  640. gap_size = limit.end - candidate + 1;
  641. if (gap_size >= req_size)
  642. va = candidate;
  643. }
  644. return va;
  645. }
  646. static void *_find_free(rt_aspace_t aspace, void *prefer, rt_size_t req_size,
  647. void *limit_start, rt_size_t limit_size,
  648. mm_flag_t flags)
  649. {
  650. rt_varea_t varea = NULL;
  651. void *va = RT_NULL;
  652. struct _mm_range limit = {limit_start, limit_start + limit_size - 1};
  653. rt_ubase_t align_mask = ~0ul;
  654. if (flags & MMF_REQUEST_ALIGN)
  655. {
  656. align_mask = ~((1 << MMF_GET_ALIGN(flags)) - 1);
  657. }
  658. if (prefer != RT_NULL)
  659. {
  660. /* if prefer and free, just return the prefer region */
  661. prefer = _align(prefer, align_mask);
  662. struct _mm_range range = {prefer, prefer + req_size - 1};
  663. varea = _aspace_bst_search_overlap(aspace, range);
  664. if (!varea)
  665. {
  666. va = prefer;
  667. }
  668. else if (flags & MMF_MAP_FIXED)
  669. {
  670. /* OVERLAP */
  671. }
  672. else
  673. {
  674. /* search from `varea` in ascending order */
  675. va = _ascending_search(varea, req_size, align_mask, limit);
  676. if (va == RT_NULL)
  677. {
  678. /* rewind to first range */
  679. limit.end = varea->start - 1;
  680. va = _find_head_and_asc_search(aspace, req_size, align_mask,
  681. limit);
  682. }
  683. }
  684. }
  685. else
  686. {
  687. va = _find_head_and_asc_search(aspace, req_size, align_mask, limit);
  688. }
  689. return va;
  690. }
  691. int rt_aspace_load_page(rt_aspace_t aspace, void *addr, rt_size_t npage)
  692. {
  693. int err = RT_EOK;
  694. rt_varea_t varea;
  695. void *end = addr + (npage << ARCH_PAGE_SHIFT);
  696. WR_LOCK(aspace);
  697. varea = _aspace_bst_search(aspace, addr);
  698. WR_UNLOCK(aspace);
  699. if (!varea)
  700. {
  701. LOG_W("%s: varea not exist", __func__);
  702. err = -RT_ENOENT;
  703. }
  704. else if (addr >= end || (rt_size_t)addr & ARCH_PAGE_MASK ||
  705. _not_in_range(addr, npage << ARCH_PAGE_SHIFT, varea->start,
  706. varea->size))
  707. {
  708. LOG_W("%s: Unaligned parameter or out of range", __func__);
  709. err = -RT_EINVAL;
  710. }
  711. else
  712. {
  713. err = _do_prefetch(aspace, varea, addr, npage << ARCH_PAGE_SHIFT);
  714. }
  715. return err;
  716. }
  717. int rt_varea_map_page(rt_varea_t varea, void *vaddr, void *page)
  718. {
  719. int err = RT_EOK;
  720. void *page_pa = rt_kmem_v2p(page);
  721. if (!varea || !vaddr || !page)
  722. {
  723. LOG_W("%s(%p,%p,%p): invalid input", __func__, varea, vaddr, page);
  724. err = -RT_EINVAL;
  725. }
  726. else if (page_pa == ARCH_MAP_FAILED)
  727. {
  728. LOG_W("%s: page is not in kernel space", __func__);
  729. err = -RT_ERROR;
  730. }
  731. else if (_not_in_range(vaddr, ARCH_PAGE_SIZE, varea->start, varea->size))
  732. {
  733. LOG_W("%s(%p,%lx): not in range of varea(%p,%lx)", __func__,
  734. vaddr, ARCH_PAGE_SIZE, varea->start, varea->size);
  735. err = -RT_EINVAL;
  736. }
  737. else
  738. {
  739. err = _do_named_map(
  740. varea->aspace,
  741. vaddr,
  742. ARCH_PAGE_SIZE,
  743. MM_PA_TO_OFF(page_pa),
  744. varea->attr
  745. );
  746. }
  747. return err;
  748. }
  749. #define ALIGNED(addr) (!((rt_size_t)(addr) & ARCH_PAGE_MASK))
  750. int rt_varea_map_range(rt_varea_t varea, void *vaddr, void *paddr, rt_size_t length)
  751. {
  752. int err;
  753. if (!varea || !vaddr || !paddr || !length ||
  754. !ALIGNED(vaddr) || !ALIGNED(paddr) || !(ALIGNED(length)))
  755. {
  756. LOG_W("%s(%p,%p,%p,%lx): invalid input", __func__, varea, vaddr, paddr, length);
  757. err = -RT_EINVAL;
  758. }
  759. else if (_not_in_range(vaddr, length, varea->start, varea->size))
  760. {
  761. LOG_W("%s(%p,%lx): not in range of varea(%p,%lx)", __func__,
  762. vaddr, length, varea->start, varea->size);
  763. err = -RT_EINVAL;
  764. }
  765. else
  766. {
  767. err = _do_named_map(
  768. varea->aspace,
  769. vaddr,
  770. length,
  771. MM_PA_TO_OFF(paddr),
  772. varea->attr
  773. );
  774. }
  775. return err;
  776. }
  777. int rt_aspace_offload_page(rt_aspace_t aspace, void *addr, rt_size_t npage)
  778. {
  779. return -RT_ENOSYS;
  780. }
  781. int rt_aspace_control(rt_aspace_t aspace, void *addr, enum rt_mmu_cntl cmd)
  782. {
  783. int err;
  784. rt_varea_t varea;
  785. WR_LOCK(aspace);
  786. varea = _aspace_bst_search(aspace, addr);
  787. WR_UNLOCK(aspace);
  788. if (varea)
  789. {
  790. err = rt_hw_mmu_control(aspace, varea->start, varea->size, cmd);
  791. if (err == RT_EOK)
  792. {
  793. rt_hw_tlb_invalidate_range(aspace, varea->start, varea->size, ARCH_PAGE_SIZE);
  794. }
  795. }
  796. else
  797. {
  798. err = -RT_ENOENT;
  799. }
  800. return err;
  801. }
  802. int rt_aspace_traversal(rt_aspace_t aspace,
  803. int (*fn)(rt_varea_t varea, void *arg), void *arg)
  804. {
  805. rt_varea_t varea;
  806. WR_LOCK(aspace);
  807. varea = ASPACE_VAREA_FIRST(aspace);
  808. while (varea)
  809. {
  810. fn(varea, arg);
  811. varea = ASPACE_VAREA_NEXT(varea);
  812. }
  813. WR_UNLOCK(aspace);
  814. return 0;
  815. }
  816. static int _dump(rt_varea_t varea, void *arg)
  817. {
  818. if (varea->mem_obj && varea->mem_obj->get_name)
  819. {
  820. rt_kprintf("[%p - %p] %s\n", varea->start, varea->start + varea->size,
  821. varea->mem_obj->get_name(varea));
  822. }
  823. else
  824. {
  825. rt_kprintf("[%p - %p] phy-map\n", varea->start, varea->start + varea->size);
  826. rt_kprintf("\t\\_ paddr = %p\n", varea->offset << MM_PAGE_SHIFT);
  827. }
  828. return 0;
  829. }
  830. void rt_aspace_print_all(rt_aspace_t aspace)
  831. {
  832. rt_aspace_traversal(aspace, _dump, NULL);
  833. }