mm_aspace.c 25 KB

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