mm_aspace.c 51 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850
  1. /*
  2. * Copyright (c) 2006-2023, 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. * 2023-08-17 Shell Add unmap_range for MAP_PRIVATE
  10. * Support MAP_FIXED in aspace_map(), and
  11. * Add better support of permission in mmap
  12. */
  13. /**
  14. * @brief Virtual Address Space
  15. */
  16. #include <rtthread.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_private.h"
  22. #include <mmu.h>
  23. #include <tlb.h>
  24. #include <stddef.h>
  25. #include <stdint.h>
  26. #define ALIGNED(addr) (!((rt_size_t)(addr) & ARCH_PAGE_MASK))
  27. static void *_find_free(rt_aspace_t aspace, void *prefer, rt_size_t req_size,
  28. void *limit_start, rt_size_t limit_size,
  29. mm_flag_t flags);
  30. static int _unmap_range_locked(rt_aspace_t aspace, void *addr, size_t length);
  31. struct rt_aspace rt_kernel_space;
  32. static int _init_lock(rt_aspace_t aspace)
  33. {
  34. int err;
  35. MM_PGTBL_LOCK_INIT(aspace);
  36. err = rt_mutex_init(&aspace->bst_lock, "aspace", RT_IPC_FLAG_FIFO);
  37. return err;
  38. }
  39. rt_err_t rt_aspace_init(rt_aspace_t aspace, void *start, rt_size_t length, void *pgtbl)
  40. {
  41. int err = RT_EOK;
  42. if (pgtbl)
  43. {
  44. aspace->page_table = pgtbl;
  45. aspace->start = start;
  46. aspace->size = length;
  47. aspace->private_object = RT_NULL;
  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. rt_varea_t varea;
  88. WR_LOCK(aspace);
  89. varea = ASPACE_VAREA_FIRST(aspace);
  90. while (varea)
  91. {
  92. rt_varea_t prev = varea;
  93. varea = ASPACE_VAREA_NEXT(varea);
  94. _varea_uninstall_locked(prev);
  95. if (VAREA_NOT_STATIC(prev))
  96. {
  97. rt_free(prev);
  98. }
  99. }
  100. WR_UNLOCK(aspace);
  101. rt_aspace_anon_ref_dec(aspace->private_object);
  102. rt_mutex_detach(&aspace->bst_lock);
  103. }
  104. void rt_aspace_delete(rt_aspace_t aspace)
  105. {
  106. RT_ASSERT(aspace);
  107. rt_aspace_detach(aspace);
  108. rt_free(aspace);
  109. }
  110. rt_inline rt_size_t _get_effect_attr(rt_aspace_t aspace, rt_varea_t varea)
  111. {
  112. rt_size_t attr = varea->attr;
  113. /* not write permission for user on private mapping */
  114. if (rt_varea_is_private_locked(varea))
  115. attr = rt_hw_mmu_attr_rm_perm(attr, RT_HW_MMU_PROT_USER | RT_HW_MMU_PROT_WRITE);
  116. return attr;
  117. }
  118. static int _do_named_map(rt_aspace_t aspace, rt_varea_t varea, void *vaddr,
  119. rt_size_t length, rt_size_t offset, rt_size_t attr)
  120. {
  121. LOG_D("%s: va %p length %p", __func__, vaddr, length);
  122. int err = RT_EOK;
  123. /* it's ensured by caller that (void*)end will not overflow */
  124. void *phyaddr = (void *)(offset << MM_PAGE_SHIFT);
  125. void *ret;
  126. attr = _get_effect_attr(aspace, varea);
  127. ret = rt_hw_mmu_map(aspace, vaddr, phyaddr, length, attr);
  128. if (ret == RT_NULL)
  129. {
  130. err = -RT_ERROR;
  131. }
  132. if (err == RT_EOK)
  133. rt_hw_tlb_invalidate_range(aspace, vaddr, length, ARCH_PAGE_SIZE);
  134. return err;
  135. }
  136. rt_inline void _do_page_fault(struct rt_aspace_fault_msg *msg, rt_size_t off,
  137. void *vaddr, rt_mem_obj_t mem_obj,
  138. rt_varea_t varea)
  139. {
  140. msg->off = off;
  141. msg->fault_vaddr = vaddr;
  142. msg->fault_op = MM_FAULT_OP_READ;
  143. msg->fault_type = MM_FAULT_TYPE_PAGE_FAULT;
  144. msg->response.status = MM_FAULT_STATUS_UNRECOVERABLE;
  145. msg->response.vaddr = 0;
  146. msg->response.size = 0;
  147. RT_ASSERT(mem_obj->on_page_fault);
  148. mem_obj->on_page_fault(varea, msg);
  149. }
  150. int rt_varea_map_with_msg(rt_varea_t varea, struct rt_aspace_fault_msg *msg)
  151. {
  152. rt_aspace_t aspace;
  153. int err = -RT_ERROR;
  154. if (msg->response.status == MM_FAULT_STATUS_OK)
  155. {
  156. /**
  157. * the page returned by handler is not checked
  158. * cause no much assumption can make on it
  159. */
  160. char *store = msg->response.vaddr;
  161. rt_size_t store_sz = msg->response.size;
  162. if ((char *)msg->fault_vaddr + store_sz > (char *)varea->start + varea->size)
  163. {
  164. LOG_W("%s: too much (0x%lx) of buffer on vaddr %p is provided",
  165. __func__, store_sz, msg->fault_vaddr);
  166. }
  167. else
  168. {
  169. void *map;
  170. rt_size_t attr;
  171. void *v_addr = msg->fault_vaddr;
  172. void *p_addr = store + PV_OFFSET;
  173. aspace = varea->aspace;
  174. RT_ASSERT(aspace);
  175. attr = _get_effect_attr(aspace, varea);
  176. map = rt_hw_mmu_map(aspace, v_addr, p_addr, store_sz, attr);
  177. if (!map)
  178. {
  179. LOG_W("%s: MMU mapping failed for va %p to %p of %lx", __func__,
  180. msg->fault_vaddr, store + PV_OFFSET, store_sz);
  181. }
  182. else
  183. {
  184. rt_hw_tlb_invalidate_range(varea->aspace, v_addr, store_sz, ARCH_PAGE_SIZE);
  185. err = RT_EOK;
  186. }
  187. }
  188. }
  189. else if (msg->response.status == MM_FAULT_STATUS_OK_MAPPED)
  190. {
  191. if (rt_hw_mmu_v2p(varea->aspace, msg->fault_vaddr) == ARCH_MAP_FAILED)
  192. {
  193. LOG_D("%s: no page is mapped on %p", __func__, msg->fault_vaddr);
  194. }
  195. err = RT_EOK;
  196. }
  197. else
  198. {
  199. LOG_W("%s: failed on va %p inside varea %p(%s)", __func__, msg->fault_vaddr, varea,
  200. varea->mem_obj->get_name ? varea->mem_obj->get_name(varea) : "unknow");
  201. }
  202. return err;
  203. }
  204. /* allocate memory page for mapping range */
  205. static int _do_prefetch(rt_aspace_t aspace, rt_varea_t varea, void *start,
  206. rt_size_t size)
  207. {
  208. int err = RT_EOK;
  209. /* it's ensured by caller that start & size ara page-aligned */
  210. char *end = (char *)start + size;
  211. char *vaddr = start;
  212. rt_size_t off = varea->offset + ((vaddr - (char *)varea->start) >> ARCH_PAGE_SHIFT);
  213. while (vaddr != end)
  214. {
  215. /* TODO try to map with huge TLB, when flag & HUGEPAGE */
  216. struct rt_aspace_fault_msg msg;
  217. _do_page_fault(&msg, off, vaddr, varea->mem_obj, varea);
  218. if (rt_varea_map_with_msg(varea, &msg))
  219. {
  220. err = -RT_ENOMEM;
  221. break;
  222. }
  223. /**
  224. * It's hard to identify the mapping pattern on a customized handler
  225. * So we terminate the prefetch process on that case
  226. */
  227. if (msg.response.status == MM_FAULT_STATUS_OK_MAPPED)
  228. break;
  229. vaddr += msg.response.size;
  230. off += msg.response.size >> ARCH_PAGE_SHIFT;
  231. }
  232. return err;
  233. }
  234. static rt_err_t _expand_varea(rt_varea_t varea, void *new_va, rt_size_t size)
  235. {
  236. rt_err_t error;
  237. rt_aspace_t aspace;
  238. void *old_va;
  239. if (varea->mem_obj && varea->mem_obj->on_varea_expand)
  240. error = varea->mem_obj->on_varea_expand(varea, new_va, size);
  241. else
  242. error = -RT_EPERM;
  243. if (error == RT_EOK)
  244. {
  245. aspace = varea->aspace;
  246. old_va = varea->start;
  247. varea->size = size;
  248. if (old_va != new_va)
  249. {
  250. varea->start = new_va;
  251. varea->offset += ((long)new_va - (long)old_va) >> MM_PAGE_SHIFT;
  252. _aspace_bst_remove(aspace, varea);
  253. _aspace_bst_insert(aspace, varea);
  254. }
  255. }
  256. return error;
  257. }
  258. struct _mapping_property {
  259. rt_size_t attr;
  260. rt_size_t flags;
  261. rt_size_t offset;
  262. struct rt_mem_obj *mem_obj;
  263. };
  264. #define INIT_PROP(obj,off,fl,attr) \
  265. {.mem_obj = (obj), \
  266. .offset = (off), \
  267. .flags = (fl), \
  268. .attr = (attr),}
  269. static rt_bool_t _contiguous_offset(rt_varea_t neighbour, rt_size_t map_size,
  270. struct _mapping_property *prop)
  271. {
  272. rt_size_t n_off = neighbour->offset;
  273. rt_size_t map_off = prop->offset;
  274. return n_off < map_off ?
  275. n_off + (neighbour->size >> MM_PAGE_SHIFT) == map_off :
  276. map_off + (map_size >> MM_PAGE_SHIFT) == n_off;
  277. }
  278. static rt_bool_t _compatible(rt_varea_t neighbour, rt_size_t map_size,
  279. struct _mapping_property *prop)
  280. {
  281. return (prop->attr == neighbour->attr && prop->flags == neighbour->flag &&
  282. prop->mem_obj == neighbour->mem_obj &&
  283. _contiguous_offset(neighbour, map_size, prop));
  284. }
  285. rt_inline rt_err_t _migrate_and_release_varea(rt_aspace_t aspace, rt_varea_t to, rt_varea_t from,
  286. rt_err_t (*on_varea_merge)(struct rt_varea *to, struct rt_varea *from))
  287. {
  288. rt_err_t error;
  289. error = on_varea_merge(to, from);
  290. if (error == RT_EOK)
  291. {
  292. /* uninstall operand & release the varea */
  293. _aspace_bst_remove(aspace, from);
  294. to->size += from->size;
  295. if (VAREA_NOT_STATIC(from))
  296. rt_free(from);
  297. }
  298. return error;
  299. }
  300. static rt_varea_t _merge_surrounding(rt_aspace_t aspace, rt_varea_t operand,
  301. struct _mapping_property *prop)
  302. {
  303. int again;
  304. rt_err_t error;
  305. int can_merge_fw;
  306. int can_merge_bw;
  307. rt_varea_t neighbour;
  308. char *operand_start;
  309. size_t operand_size;
  310. rt_err_t (*on_varea_merge)(struct rt_varea *to, struct rt_varea *from);
  311. if (operand->mem_obj && operand->mem_obj->on_varea_merge)
  312. {
  313. on_varea_merge = operand->mem_obj->on_varea_merge;
  314. do {
  315. operand_start = operand->start;
  316. operand_size = operand->size;
  317. LOG_D("search op_start=%p,op_size=0x%lx", operand_start, operand_size);
  318. /* find a compatible neighbour if any and setup direction */
  319. can_merge_fw = can_merge_bw = 0;
  320. neighbour = _aspace_bst_search(aspace, operand_start - 1);
  321. if (!neighbour || !_compatible(neighbour, operand_size, prop))
  322. {
  323. neighbour = _aspace_bst_search(aspace, operand_start + operand_size);
  324. if (neighbour && _compatible(neighbour, operand_size, prop))
  325. can_merge_bw = 1;
  326. }
  327. else
  328. can_merge_fw = 1;
  329. if (can_merge_fw || can_merge_bw)
  330. {
  331. /* merge operand with its predecessor or successor */
  332. if (can_merge_fw)
  333. {
  334. error = _migrate_and_release_varea(aspace, neighbour, operand, on_varea_merge);
  335. operand = neighbour;
  336. }
  337. else
  338. error = _migrate_and_release_varea(aspace, operand, neighbour, on_varea_merge);
  339. if (error == RT_EOK)
  340. again = 1;
  341. }
  342. else
  343. again = 0;
  344. } while (again);
  345. }
  346. return operand;
  347. }
  348. /**
  349. * Brief: expand and merge surrounding until not possible and
  350. * setup the pvarea if new virt address region is installed
  351. */
  352. static rt_bool_t _try_expand_and_merge_okay(rt_aspace_t aspace, rt_varea_t *pvarea,
  353. void *alloc_va, rt_mm_va_hint_t hint,
  354. struct _mapping_property *prop)
  355. {
  356. int can_expand_fw;
  357. int can_expand_bw;
  358. rt_varea_t neighbour;
  359. rt_varea_t new_region_at = RT_NULL;
  360. rt_bool_t install_ok = RT_FALSE;
  361. char *operand_start = alloc_va;
  362. size_t operand_size = hint->map_size;
  363. /* find a compatible neighbour if any and setup direction */
  364. LOG_D("search op_start=%p,op_size=0x%lx", operand_start, operand_size);
  365. can_expand_fw = can_expand_bw = 0;
  366. neighbour = _aspace_bst_search(aspace, operand_start - 1);
  367. if (!neighbour || !_compatible(neighbour, operand_size, prop))
  368. {
  369. neighbour = _aspace_bst_search(aspace, operand_start + operand_size);
  370. if (neighbour && _compatible(neighbour, operand_size, prop))
  371. can_expand_bw = 1;
  372. }
  373. else
  374. can_expand_fw = 1;
  375. if (can_expand_fw || can_expand_bw)
  376. {
  377. /* expand varea at head or tailing */
  378. if (can_expand_fw)
  379. operand_start = neighbour->start;
  380. operand_size += neighbour->size;
  381. LOG_D("expand op_start=%p,op_size=0x%lx", operand_start, operand_size);
  382. if (_expand_varea(neighbour, operand_start, operand_size) == RT_EOK)
  383. {
  384. new_region_at = _merge_surrounding(aspace, neighbour, prop);
  385. *pvarea = new_region_at;
  386. install_ok = RT_TRUE;
  387. }
  388. }
  389. return install_ok;
  390. }
  391. static rt_varea_t _varea_create(void *start, rt_size_t size);
  392. static int _insert_new_varea(rt_aspace_t aspace, rt_varea_t *pvarea,
  393. void *alloc_va, rt_mm_va_hint_t hint)
  394. {
  395. int err;
  396. rt_varea_t varea = *pvarea;
  397. if (varea == RT_NULL)
  398. {
  399. /* no preallocate buffer is provided, then create one */
  400. varea = _varea_create(hint->prefer, hint->map_size);
  401. hint->flags &= ~MMF_STATIC_ALLOC;
  402. *pvarea = varea;
  403. }
  404. if (varea)
  405. {
  406. varea->start = alloc_va;
  407. _aspace_bst_insert(aspace, varea);
  408. err = RT_EOK;
  409. }
  410. else
  411. {
  412. LOG_W("%s: Out of memory", __func__);
  413. err = -RT_ENOMEM;
  414. }
  415. return err;
  416. }
  417. static inline void _varea_post_install(rt_varea_t varea, rt_aspace_t aspace,
  418. rt_size_t attr, rt_size_t flags,
  419. rt_mem_obj_t mem_obj, rt_size_t offset)
  420. {
  421. varea->aspace = aspace;
  422. varea->attr = attr;
  423. varea->mem_obj = mem_obj;
  424. varea->flag = flags;
  425. varea->offset = offset;
  426. if (varea->mem_obj && varea->mem_obj->on_varea_open)
  427. varea->mem_obj->on_varea_open(varea);
  428. }
  429. /**
  430. * Install new virtual address region into address space
  431. * The pvarea will be set to the varea where new virt memory installed which can
  432. * be a newly created or existed one.
  433. *
  434. * Note: caller must hold the aspace lock
  435. */
  436. static int _varea_install(rt_aspace_t aspace, rt_varea_t *pvarea,
  437. rt_mm_va_hint_t hint, struct _mapping_property *prop,
  438. void **pva)
  439. {
  440. void *alloc_va;
  441. int err = RT_EOK;
  442. if (hint->flags & MMF_MAP_FIXED)
  443. {
  444. alloc_va = hint->prefer;
  445. err = _unmap_range_locked(aspace, alloc_va, hint->map_size);
  446. if (err != RT_EOK)
  447. {
  448. /* Note: MAP_FIXED must failed if unable to unmap existing mapping */
  449. LOG_I("%s: unmap range failed in %p with size 0x%lx, error=%d", __func__, alloc_va, hint->map_size, err);
  450. }
  451. }
  452. else
  453. {
  454. alloc_va =
  455. _find_free(aspace, hint->prefer, hint->map_size, hint->limit_start,
  456. hint->limit_range_size, hint->flags);
  457. if (alloc_va == RT_NULL)
  458. err = -RT_ENOSPC;
  459. }
  460. if (alloc_va != RT_NULL)
  461. {
  462. /* TODO: fix to private mapping directly */
  463. if (!_try_expand_and_merge_okay(aspace, pvarea, alloc_va, hint, prop))
  464. {
  465. err = _insert_new_varea(aspace, pvarea, alloc_va, hint);
  466. if (err == RT_EOK)
  467. _varea_post_install(*pvarea, aspace, prop->attr, prop->flags,
  468. prop->mem_obj, prop->offset);
  469. }
  470. if (err == RT_EOK)
  471. {
  472. RT_ASSERT(*pvarea);
  473. *pva = alloc_va;
  474. }
  475. }
  476. return err;
  477. }
  478. /**
  479. * restore context modified by varea install
  480. */
  481. void _varea_uninstall_locked(rt_varea_t varea)
  482. {
  483. rt_aspace_t aspace = varea->aspace;
  484. if (varea->mem_obj && varea->mem_obj->on_varea_close)
  485. varea->mem_obj->on_varea_close(varea);
  486. else
  487. {
  488. rt_hw_mmu_unmap(aspace, varea->start, varea->size);
  489. rt_hw_tlb_invalidate_range(aspace, varea->start, varea->size, ARCH_PAGE_SIZE);
  490. }
  491. _aspace_bst_remove(aspace, varea);
  492. }
  493. int _mm_aspace_map(rt_aspace_t aspace, rt_varea_t *pvarea, void **addr,
  494. rt_size_t length, rt_size_t attr, mm_flag_t flags,
  495. rt_mem_obj_t mem_obj, rt_size_t offset)
  496. {
  497. int err = RT_EOK;
  498. rt_varea_t varea;
  499. struct _mapping_property prop = INIT_PROP(mem_obj, offset, flags, attr);
  500. WR_LOCK(aspace);
  501. /**
  502. * @brief .prefer & .map_size are scratched from varea which setup by caller
  503. * .limit_start & .limit_range_size have default to be in range of aspace
  504. * .flags is from parameter, and will be fill in varea if install successfully
  505. */
  506. struct rt_mm_va_hint hint = {.prefer = *addr,
  507. .map_size = length,
  508. .limit_start = aspace->start,
  509. .limit_range_size = aspace->size,
  510. .flags = flags};
  511. if (mem_obj->hint_free)
  512. {
  513. /* mem object can control mapping range and so by modifing hint */
  514. mem_obj->hint_free(&hint);
  515. }
  516. /* try to allocate a virtual address region for varea */
  517. err = _varea_install(aspace, pvarea, &hint, &prop, addr);
  518. if (err == RT_EOK)
  519. {
  520. varea = *pvarea;
  521. if (MMF_TEST_CNTL(flags, MMF_PREFETCH))
  522. {
  523. /* do the MMU & TLB business */
  524. err = _do_prefetch(aspace, varea, varea->start, varea->size);
  525. if (err)
  526. {
  527. LOG_I("%s: failed to prefetch page into varea(%s)",
  528. __func__, VAREA_NAME(varea));
  529. /* restore data structure and MMU */
  530. _varea_uninstall_locked(varea);
  531. if (!(varea->flag & MMF_STATIC_ALLOC))
  532. rt_free(varea);
  533. }
  534. }
  535. }
  536. WR_UNLOCK(aspace);
  537. return err;
  538. }
  539. static rt_varea_t _varea_create(void *start, rt_size_t size)
  540. {
  541. rt_varea_t varea;
  542. varea = (rt_varea_t)rt_malloc(sizeof(struct rt_varea));
  543. if (varea)
  544. {
  545. varea->start = start;
  546. varea->size = size;
  547. }
  548. return varea;
  549. }
  550. #define _IS_OVERFLOW(start, length) ((length) > (0ul - (uintptr_t)(start)))
  551. #define _IS_OVERSIZE(start, length, limit_s, limit_sz) (((length) + (rt_size_t)((char *)(start) - (char *)(limit_start))) > (limit_size))
  552. static inline int _not_in_range(rt_size_t flags, void *start, rt_size_t length,
  553. void *limit_start, rt_size_t limit_size)
  554. {
  555. /* assuming (base + length) will not overflow except (0) */
  556. int rc = (flags & MMF_MAP_FIXED || start != RT_NULL)
  557. ? (_IS_OVERFLOW(start, length) || start < limit_start ||
  558. _IS_OVERSIZE(start, length, limit_start, limit_size))
  559. : length > limit_size;
  560. if (rc)
  561. LOG_D("%s: [%p : %p] [%p : %p]", __func__, start, length, limit_start, limit_size);
  562. return rc;
  563. }
  564. static inline int _not_align(void *start, rt_size_t length, rt_size_t mask)
  565. {
  566. return (start != RT_NULL) &&
  567. (((uintptr_t)start & mask) || (length & mask));
  568. }
  569. /** if the flag is currently supported */
  570. static inline int _not_support(rt_size_t flags)
  571. {
  572. rt_size_t support_ops = MMF_CREATE(((__MMF_INVALID - 1) << 1) - 1, 1);
  573. return flags & ~(support_ops);
  574. }
  575. int rt_aspace_map(rt_aspace_t aspace, void **addr, rt_size_t length,
  576. rt_size_t attr, mm_flag_t flags, rt_mem_obj_t mem_obj,
  577. rt_size_t offset)
  578. {
  579. int err;
  580. rt_varea_t varea = RT_NULL;
  581. RT_DEBUG_SCHEDULER_AVAILABLE(1);
  582. if (!aspace || !addr || !mem_obj || length == 0)
  583. {
  584. err = -RT_EINVAL;
  585. LOG_I("%s(%p, %p, %lx, %lx, %lx, %p, %lx): Invalid input",
  586. __func__, aspace, addr, length, attr, flags, mem_obj, offset);
  587. }
  588. else if (_not_in_range(flags, *addr, length, aspace->start, aspace->size))
  589. {
  590. err = -RT_EINVAL;
  591. LOG_I("%s(addr:%p, len:%lx): out of range", __func__, *addr, length);
  592. }
  593. else if (_not_support(flags))
  594. {
  595. LOG_I("%s: no support flags 0x%lx", __func__, flags);
  596. err = -RT_ENOSYS;
  597. }
  598. else
  599. {
  600. RT_ASSERT((length & ARCH_PAGE_MASK) == 0);
  601. RT_ASSERT(((long)*addr & ARCH_PAGE_MASK) == 0);
  602. err = _mm_aspace_map(aspace, &varea, addr, length, attr, flags, mem_obj, offset);
  603. }
  604. if (err != RT_EOK)
  605. {
  606. *addr = NULL;
  607. }
  608. return err;
  609. }
  610. int rt_aspace_map_static(rt_aspace_t aspace, rt_varea_t varea, void **addr,
  611. rt_size_t length, rt_size_t attr, mm_flag_t flags,
  612. rt_mem_obj_t mem_obj, rt_size_t offset)
  613. {
  614. int err;
  615. if (!aspace || !varea || !addr || !mem_obj || length == 0 ||
  616. _not_in_range(flags, *addr, length, aspace->start, aspace->size))
  617. {
  618. err = -RT_EINVAL;
  619. LOG_W("%s: Invalid input", __func__);
  620. }
  621. else if (_not_support(flags))
  622. {
  623. LOG_W("%s: no support flags", __func__);
  624. err = -RT_ENOSYS;
  625. }
  626. else
  627. {
  628. varea->size = length;
  629. varea->start = *addr;
  630. flags |= MMF_STATIC_ALLOC;
  631. /**
  632. * todo: fix if mapping expand, the static varea is not used at all
  633. */
  634. err = _mm_aspace_map(aspace, &varea, addr, length, attr, flags, mem_obj, offset);
  635. }
  636. if (err != RT_EOK)
  637. {
  638. *addr = NULL;
  639. }
  640. else
  641. {
  642. *addr = varea->start;
  643. }
  644. return err;
  645. }
  646. int _mm_aspace_map_phy(rt_aspace_t aspace, rt_varea_t varea,
  647. rt_mm_va_hint_t hint, rt_size_t attr, rt_size_t pa_off,
  648. void **ret_va)
  649. {
  650. int err;
  651. void *vaddr;
  652. if (!aspace || !hint || !hint->limit_range_size || !hint->map_size)
  653. {
  654. LOG_W("%s: Invalid input", __func__);
  655. err = -RT_EINVAL;
  656. }
  657. else if (_not_align(hint->prefer, hint->map_size, ARCH_PAGE_MASK))
  658. {
  659. LOG_W("%s: not aligned", __func__);
  660. err = -RT_EINVAL;
  661. }
  662. else if (_not_in_range(hint->flags, hint->limit_start, hint->limit_range_size, aspace->start,
  663. aspace->size) ||
  664. _not_in_range(hint->flags, hint->prefer, hint->map_size, aspace->start,
  665. aspace->size))
  666. {
  667. LOG_W("%s: not in range", __func__);
  668. err = -RT_EINVAL;
  669. }
  670. else
  671. {
  672. struct _mapping_property prop = INIT_PROP(0, pa_off, hint->flags, attr);
  673. WR_LOCK(aspace);
  674. err = _varea_install(aspace, &varea, hint, &prop, &vaddr);
  675. if (err == RT_EOK)
  676. {
  677. err = _do_named_map(aspace, varea, varea->start, varea->size,
  678. (rt_size_t)pa_off, attr);
  679. if (err != RT_EOK)
  680. {
  681. _varea_uninstall_locked(varea);
  682. }
  683. }
  684. WR_UNLOCK(aspace);
  685. }
  686. if (ret_va)
  687. {
  688. if (err == RT_EOK)
  689. *ret_va = vaddr;
  690. else
  691. *ret_va = RT_NULL;
  692. }
  693. return err;
  694. }
  695. int rt_aspace_map_phy(rt_aspace_t aspace, rt_mm_va_hint_t hint, rt_size_t attr,
  696. rt_size_t pa_off, void **ret_va)
  697. {
  698. int err;
  699. if (hint)
  700. {
  701. rt_varea_t varea = _varea_create(hint->prefer, hint->map_size);
  702. if (varea)
  703. {
  704. hint->flags &= ~MMF_STATIC_ALLOC;
  705. err = _mm_aspace_map_phy(aspace, varea, hint, attr, pa_off, ret_va);
  706. if (err != RT_EOK)
  707. {
  708. rt_free(varea);
  709. }
  710. }
  711. else
  712. {
  713. err = -RT_ENOMEM;
  714. }
  715. }
  716. else
  717. {
  718. err = -RT_EINVAL;
  719. }
  720. return err;
  721. }
  722. int rt_aspace_map_phy_static(rt_aspace_t aspace, rt_varea_t varea,
  723. rt_mm_va_hint_t hint, rt_size_t attr,
  724. rt_size_t pa_off, void **ret_va)
  725. {
  726. int err;
  727. if (varea && hint)
  728. {
  729. varea->start = hint->prefer;
  730. varea->size = hint->map_size;
  731. hint->flags |= (MMF_STATIC_ALLOC);
  732. LOG_D("%s: start %p size %p phy at %p", __func__, varea->start, varea->size, pa_off << MM_PAGE_SHIFT);
  733. err = _mm_aspace_map_phy(aspace, varea, hint, attr, pa_off, ret_va);
  734. }
  735. else
  736. {
  737. err = -RT_EINVAL;
  738. }
  739. return err;
  740. }
  741. int _aspace_unmap(rt_aspace_t aspace, void *addr)
  742. {
  743. int error;
  744. rt_varea_t varea;
  745. WR_LOCK(aspace);
  746. varea = _aspace_bst_search(aspace, addr);
  747. if (varea == RT_NULL)
  748. {
  749. LOG_D("%s: No such entry found at %p\n", __func__, addr);
  750. error = -RT_ENOENT;
  751. }
  752. else
  753. {
  754. _varea_uninstall_locked(varea);
  755. if (!(varea->flag & MMF_STATIC_ALLOC))
  756. {
  757. rt_free(varea);
  758. }
  759. error = RT_EOK;
  760. }
  761. WR_UNLOCK(aspace);
  762. return error;
  763. }
  764. int rt_aspace_unmap(rt_aspace_t aspace, void *addr)
  765. {
  766. int error;
  767. if (!aspace)
  768. {
  769. LOG_I("%s: Invalid input", __func__);
  770. error = -RT_EINVAL;
  771. }
  772. else if (_not_in_range(MMF_MAP_FIXED, addr, 1, aspace->start, aspace->size))
  773. {
  774. LOG_I("%s: %lx not in range of aspace[%lx:%lx]", __func__, addr,
  775. aspace->start, (char *)aspace->start + aspace->size);
  776. error = -RT_EINVAL;
  777. }
  778. else
  779. {
  780. error = _aspace_unmap(aspace, addr);
  781. }
  782. return error;
  783. }
  784. /**
  785. * modify the property of existed varea by shrink its size. Mem_obj is
  786. * notified to released the resource.
  787. */
  788. static rt_err_t _shrink_varea(rt_varea_t varea, void *new_va, rt_size_t size)
  789. {
  790. rt_err_t error;
  791. rt_aspace_t aspace;
  792. void *old_va;
  793. if (varea->mem_obj && varea->mem_obj->on_varea_shrink)
  794. error = varea->mem_obj->on_varea_shrink(varea, new_va, size);
  795. else
  796. error = -RT_EPERM;
  797. if (error == RT_EOK)
  798. {
  799. aspace = varea->aspace;
  800. old_va = varea->start;
  801. varea->size = size;
  802. if (old_va != new_va)
  803. {
  804. varea->start = new_va;
  805. varea->offset += ((long)new_va - (long)old_va) >> MM_PAGE_SHIFT;
  806. _aspace_bst_remove(aspace, varea);
  807. _aspace_bst_insert(aspace, varea);
  808. }
  809. }
  810. return error;
  811. }
  812. static rt_err_t _split_varea(rt_varea_t existed, char *ex_end, char *unmap_start, char *unmap_end, rt_size_t unmap_len)
  813. {
  814. int error;
  815. size_t rela_offset;
  816. rt_varea_t subset;
  817. char *subset_start;
  818. size_t subset_size;
  819. if (existed->mem_obj && existed->mem_obj->on_varea_split)
  820. {
  821. subset_start = unmap_end;
  822. subset_size = ex_end - subset_start;
  823. subset = _varea_create(subset_start, subset_size);
  824. if (subset)
  825. {
  826. rela_offset = MM_PA_TO_OFF(subset_start - (char *)existed->start);
  827. subset->aspace = existed->aspace;
  828. subset->attr = existed->attr;
  829. subset->mem_obj = existed->mem_obj;
  830. subset->flag = existed->flag & ~MMF_STATIC_ALLOC;
  831. subset->offset = existed->offset + rela_offset;
  832. error = existed->mem_obj->on_varea_split(existed, unmap_start, unmap_len, subset);
  833. if (error == RT_EOK)
  834. {
  835. existed->size = unmap_start - (char *)existed->start;
  836. _aspace_bst_insert(existed->aspace, subset);
  837. }
  838. if (error != RT_EOK)
  839. rt_free(subset);
  840. }
  841. else
  842. error = -RT_ENOMEM;
  843. }
  844. else
  845. error = -RT_EPERM;
  846. return error;
  847. }
  848. /* remove overlapped pages from varea */
  849. static int _remove_overlapped_varea(rt_varea_t existed, char *unmap_start, rt_size_t unmap_len)
  850. {
  851. int error;
  852. char *ex_start = existed->start;
  853. char *ex_end = ex_start + existed->size;
  854. char *unmap_end = unmap_start + unmap_len;
  855. if (ex_start < unmap_start)
  856. {
  857. if (ex_end > unmap_end)
  858. error = _split_varea(existed, ex_end, unmap_start, unmap_end, unmap_len);
  859. else
  860. error = _shrink_varea(existed, ex_start, unmap_start - ex_start);
  861. }
  862. else if (ex_end > unmap_end)
  863. error = _shrink_varea(existed, unmap_end, ex_end - unmap_end);
  864. else
  865. {
  866. _varea_uninstall_locked(existed);
  867. if (VAREA_NOT_STATIC(existed))
  868. {
  869. rt_free(existed);
  870. }
  871. error = RT_EOK;
  872. }
  873. return error;
  874. }
  875. static int _unmap_range_locked(rt_aspace_t aspace, void *addr, size_t length)
  876. {
  877. int error = RT_EOK;
  878. rt_varea_t existed;
  879. struct _mm_range unmap_range;
  880. unmap_range.start = addr;
  881. unmap_range.end = addr + length - 1;
  882. existed = _aspace_bst_search_overlap(aspace, unmap_range);
  883. while (existed)
  884. {
  885. error = _remove_overlapped_varea(existed, addr, length);
  886. if (error == RT_EOK)
  887. existed = _aspace_bst_search_overlap(aspace, unmap_range);
  888. else
  889. break;
  890. }
  891. return error;
  892. }
  893. int rt_aspace_unmap_range(rt_aspace_t aspace, void *addr, size_t length)
  894. {
  895. int error;
  896. if (!aspace)
  897. {
  898. LOG_I("%s: Invalid input", __func__);
  899. error = -RT_EINVAL;
  900. }
  901. else if (_not_in_range(MMF_MAP_FIXED, addr, length, aspace->start, aspace->size))
  902. {
  903. LOG_I("%s: %lx not in range of aspace[%lx:%lx]", __func__, addr,
  904. aspace->start, (char *)aspace->start + aspace->size);
  905. error = -RT_EINVAL;
  906. }
  907. else if (!ALIGNED(addr))
  908. {
  909. LOG_I("%s(addr=%p): Unaligned address", __func__, addr);
  910. error = -RT_EINVAL;
  911. }
  912. else
  913. {
  914. /**
  915. * Brief: re-arrange the address space to remove existing pages mapping
  916. * in [unmap_start, unmap_start + unmap_len)
  917. */
  918. length = RT_ALIGN(length, ARCH_PAGE_SIZE);
  919. WR_LOCK(aspace);
  920. error = _unmap_range_locked(aspace, addr, length);
  921. WR_UNLOCK(aspace);
  922. }
  923. return error;
  924. }
  925. void *rt_aspace_mremap_range(rt_aspace_t aspace, void *old_address, size_t old_size,
  926. size_t new_size, int flags, void *new_address)
  927. {
  928. void *ret = RT_NULL;
  929. if (!aspace)
  930. {
  931. LOG_I("%s: Invalid input", __func__);
  932. }
  933. else if (_not_in_range(MMF_MAP_FIXED, old_address, old_size,
  934. aspace->start, aspace->size))
  935. {
  936. LOG_I("%s: %lx not in range of aspace[%lx:%lx]", __func__, old_address,
  937. aspace->start, (char *)aspace->start + aspace->size);
  938. }
  939. else if (!ALIGNED(old_address))
  940. {
  941. LOG_I("%s(old_address=%p): Unaligned address", __func__, old_address);
  942. }
  943. else
  944. {
  945. /**
  946. * Brief: re-arrange the address space to remove existing pages mapping
  947. * in [unmap_start, unmap_start + unmap_len)
  948. */
  949. old_size = RT_ALIGN(old_size, ARCH_PAGE_SIZE);
  950. WR_LOCK(aspace);
  951. {
  952. rt_varea_t existed;
  953. struct _mm_range unmap_range;
  954. unmap_range.start = old_address;
  955. unmap_range.end = old_address + old_size - 1;
  956. existed = _aspace_bst_search_overlap(aspace, unmap_range);
  957. if (existed && existed->mem_obj && existed->mem_obj->on_varea_mremap)
  958. {
  959. ret = existed->mem_obj->on_varea_mremap(existed, new_size, flags, new_address);
  960. }
  961. }
  962. WR_UNLOCK(aspace);
  963. if (ret)
  964. {
  965. int error = rt_aspace_unmap_range(aspace, old_address, old_size);
  966. if (error != RT_EOK)
  967. {
  968. LOG_I("%s: unmap old failed, addr %p size %p", __func__, old_address, old_size);
  969. }
  970. }
  971. }
  972. return ret;
  973. }
  974. static inline void *_lower(void *a, void *b)
  975. {
  976. return a < b ? a : b;
  977. }
  978. static inline void *_align(void *va, rt_ubase_t align_mask)
  979. {
  980. return (void *)((rt_ubase_t)((char *)va + ~align_mask) & align_mask);
  981. }
  982. static void *_ascending_search(rt_varea_t varea, rt_size_t req_size,
  983. rt_ubase_t align_mask, struct _mm_range limit)
  984. {
  985. void *ret = RT_NULL;
  986. while (varea && varea->start < limit.end)
  987. {
  988. char *candidate = (char *)varea->start + varea->size;
  989. candidate = _align(candidate, align_mask);
  990. if (candidate > (char *)limit.end || (char *)limit.end - candidate + 1 < req_size)
  991. break;
  992. rt_varea_t nx_va = ASPACE_VAREA_NEXT(varea);
  993. if (nx_va)
  994. {
  995. if (candidate < (char *)nx_va->start)
  996. {
  997. rt_size_t gap_size =
  998. (char *)_lower(limit.end, (char *)nx_va->start - 1) -
  999. candidate + 1;
  1000. if (gap_size >= req_size)
  1001. {
  1002. ret = candidate;
  1003. break;
  1004. }
  1005. }
  1006. }
  1007. else
  1008. {
  1009. ret = candidate;
  1010. }
  1011. varea = nx_va;
  1012. }
  1013. return ret;
  1014. }
  1015. /** find suitable place in [limit_start, limit_end] */
  1016. static void *_find_head_and_asc_search(rt_aspace_t aspace, rt_size_t req_size,
  1017. rt_ubase_t align_mask,
  1018. struct _mm_range limit)
  1019. {
  1020. void *va = RT_NULL;
  1021. char *candidate = _align(limit.start, align_mask);
  1022. rt_varea_t varea = _aspace_bst_search_exceed(aspace, candidate);
  1023. if (varea)
  1024. {
  1025. rt_size_t gap_size = (char *)varea->start - candidate;
  1026. if (gap_size >= req_size)
  1027. {
  1028. /* try previous memory region of varea if possible */
  1029. rt_varea_t former = ASPACE_VAREA_PREV(varea);
  1030. if (former)
  1031. {
  1032. candidate = _align((char *)former->start + former->size, align_mask);
  1033. gap_size = (char *)varea->start - candidate;
  1034. if (gap_size >= req_size)
  1035. va = candidate;
  1036. else
  1037. va = _ascending_search(varea, req_size, align_mask, limit);
  1038. }
  1039. else
  1040. {
  1041. va = candidate;
  1042. }
  1043. }
  1044. else
  1045. {
  1046. va = _ascending_search(varea, req_size, align_mask, limit);
  1047. }
  1048. }
  1049. else
  1050. {
  1051. rt_size_t gap_size = (char *)limit.end - candidate + 1;
  1052. if (gap_size >= req_size)
  1053. va = candidate;
  1054. }
  1055. return va;
  1056. }
  1057. /**
  1058. * Find a memory region that:
  1059. * - is free
  1060. * - sits inside the limit range
  1061. * - meets the alignment requirement
  1062. */
  1063. static void *_find_free(rt_aspace_t aspace, void *prefer, rt_size_t req_size,
  1064. void *limit_start, rt_size_t limit_size,
  1065. mm_flag_t flags)
  1066. {
  1067. rt_varea_t varea = NULL;
  1068. void *va = RT_NULL;
  1069. struct _mm_range limit = {limit_start, (char *)limit_start + limit_size - 1};
  1070. rt_ubase_t align_mask = ~0ul;
  1071. if (flags & MMF_REQUEST_ALIGN)
  1072. {
  1073. align_mask = ~((1 << MMF_GET_ALIGN(flags)) - 1);
  1074. }
  1075. if (flags & MMF_MAP_FIXED)
  1076. {
  1077. struct _mm_range range = {prefer, (char *)prefer + req_size - 1};
  1078. /* caller should guarantee that the request region is legal */
  1079. RT_ASSERT(!_not_in_range(flags, prefer, req_size, limit_start, limit_size));
  1080. varea = _aspace_bst_search_overlap(aspace, range);
  1081. if (!varea)
  1082. {
  1083. va = prefer;
  1084. }
  1085. else
  1086. {
  1087. /* region not freed */
  1088. }
  1089. }
  1090. else if (prefer != RT_NULL)
  1091. {
  1092. struct _mm_range range;
  1093. /* ceiling the prefer address */
  1094. prefer = _align(prefer, align_mask);
  1095. if (_not_in_range(flags, prefer, req_size, limit_start, limit_size))
  1096. {
  1097. prefer = limit_start;
  1098. }
  1099. range.start = prefer;
  1100. range.end = (char *)prefer + req_size - 1;
  1101. varea = _aspace_bst_search_overlap(aspace, range);
  1102. if (!varea)
  1103. {
  1104. /* if preferred and free, just return the prefer region */
  1105. va = prefer;
  1106. }
  1107. else
  1108. {
  1109. /* search from `varea` in ascending order */
  1110. va = _ascending_search(varea, req_size, align_mask, limit);
  1111. if (va == RT_NULL)
  1112. {
  1113. /* rewind to first range */
  1114. limit.end = (char *)varea->start - 1;
  1115. va = _find_head_and_asc_search(aspace, req_size, align_mask,
  1116. limit);
  1117. }
  1118. }
  1119. }
  1120. else
  1121. {
  1122. va = _find_head_and_asc_search(aspace, req_size, align_mask, limit);
  1123. }
  1124. return va;
  1125. }
  1126. int rt_aspace_load_page(rt_aspace_t aspace, void *addr, rt_size_t npage)
  1127. {
  1128. int err = RT_EOK;
  1129. rt_varea_t varea;
  1130. char *end = (char *)addr + (npage << ARCH_PAGE_SHIFT);
  1131. WR_LOCK(aspace);
  1132. varea = _aspace_bst_search(aspace, addr);
  1133. WR_UNLOCK(aspace);
  1134. if (!varea)
  1135. {
  1136. LOG_W("%s: varea not exist(addr=%p)", __func__, addr);
  1137. err = -RT_ENOENT;
  1138. }
  1139. else if ((char *)addr >= end || (rt_size_t)addr & ARCH_PAGE_MASK ||
  1140. _not_in_range(MMF_MAP_FIXED, addr, npage << ARCH_PAGE_SHIFT,
  1141. varea->start, varea->size))
  1142. {
  1143. LOG_W("%s: Unaligned parameter or out of range", __func__);
  1144. err = -RT_EINVAL;
  1145. }
  1146. else
  1147. {
  1148. err = _do_prefetch(aspace, varea, addr, npage << ARCH_PAGE_SHIFT);
  1149. }
  1150. return err;
  1151. }
  1152. int rt_varea_map_page(rt_varea_t varea, void *vaddr, void *page)
  1153. {
  1154. int err = RT_EOK;
  1155. void *page_pa = rt_kmem_v2p(page);
  1156. if (!varea || !vaddr || !page)
  1157. {
  1158. LOG_W("%s(%p,%p,%p): invalid input", __func__, varea, vaddr, page);
  1159. err = -RT_EINVAL;
  1160. }
  1161. else if (page_pa == ARCH_MAP_FAILED)
  1162. {
  1163. LOG_W("%s: page is not in kernel space", __func__);
  1164. err = -RT_ERROR;
  1165. }
  1166. else if (_not_in_range(MMF_MAP_FIXED, vaddr, ARCH_PAGE_SIZE,
  1167. varea->start, varea->size))
  1168. {
  1169. LOG_W("%s(%p,%lx): not in range of varea(%p,%lx)", __func__,
  1170. vaddr, ARCH_PAGE_SIZE, varea->start, varea->size);
  1171. err = -RT_EINVAL;
  1172. }
  1173. else
  1174. {
  1175. err = _do_named_map(
  1176. varea->aspace,
  1177. varea,
  1178. vaddr,
  1179. ARCH_PAGE_SIZE,
  1180. MM_PA_TO_OFF(page_pa),
  1181. varea->attr
  1182. );
  1183. }
  1184. return err;
  1185. }
  1186. int rt_varea_unmap_page(rt_varea_t varea, void *vaddr)
  1187. {
  1188. void *va_aligned = (void *)RT_ALIGN_DOWN((rt_base_t)vaddr, ARCH_PAGE_SIZE);
  1189. return rt_varea_unmap_range(varea, va_aligned, ARCH_PAGE_SIZE);
  1190. }
  1191. /**
  1192. * @note Caller should take care of synchronization of its varea among all the map/unmap operation
  1193. */
  1194. int rt_varea_map_range(rt_varea_t varea, void *vaddr, void *paddr, rt_size_t length)
  1195. {
  1196. int err;
  1197. if (!varea || !vaddr || !paddr || !length ||
  1198. !ALIGNED(vaddr) || !ALIGNED(paddr) || !(ALIGNED(length)))
  1199. {
  1200. LOG_W("%s(%p,%p,%p,%lx): invalid input", __func__, varea, vaddr, paddr, length);
  1201. err = -RT_EINVAL;
  1202. }
  1203. else if (_not_in_range(MMF_MAP_FIXED, vaddr, length,
  1204. varea->start, varea->size))
  1205. {
  1206. LOG_W("%s(%p,%lx): not in range of varea(%p,%lx)", __func__,
  1207. vaddr, length, varea->start, varea->size);
  1208. err = -RT_EINVAL;
  1209. }
  1210. else
  1211. {
  1212. err = _do_named_map(
  1213. varea->aspace,
  1214. varea,
  1215. vaddr,
  1216. length,
  1217. MM_PA_TO_OFF(paddr),
  1218. varea->attr
  1219. );
  1220. }
  1221. return err;
  1222. }
  1223. /**
  1224. * @note Caller should take care of synchronization of its varea among all the map/unmap operation
  1225. */
  1226. int rt_varea_unmap_range(rt_varea_t varea, void *vaddr, rt_size_t length)
  1227. {
  1228. int err;
  1229. rt_base_t va_align;
  1230. if (!varea || !vaddr || !length)
  1231. {
  1232. LOG_W("%s(%p,%p,%lx): invalid input", __func__, varea, vaddr, length);
  1233. err = -RT_EINVAL;
  1234. }
  1235. else if (_not_in_range(MMF_MAP_FIXED, vaddr, length,
  1236. varea->start, varea->size))
  1237. {
  1238. LOG_W("%s(%p,%lx): not in range of varea(%p,%lx)", __func__,
  1239. vaddr, length, varea->start, varea->size);
  1240. err = -RT_EINVAL;
  1241. }
  1242. else
  1243. {
  1244. va_align = RT_ALIGN_DOWN((rt_base_t)vaddr, ARCH_PAGE_SIZE);
  1245. rt_hw_mmu_unmap(varea->aspace, (void *)va_align, length);
  1246. rt_hw_tlb_invalidate_range(varea->aspace, (void *)va_align, length, ARCH_PAGE_SIZE);
  1247. err = RT_EOK;
  1248. }
  1249. return err;
  1250. }
  1251. int rt_aspace_offload_page(rt_aspace_t aspace, void *addr, rt_size_t npage)
  1252. {
  1253. return -RT_ENOSYS;
  1254. }
  1255. int rt_aspace_control(rt_aspace_t aspace, void *addr, enum rt_mmu_cntl cmd)
  1256. {
  1257. int err;
  1258. rt_varea_t varea;
  1259. WR_LOCK(aspace);
  1260. varea = _aspace_bst_search(aspace, addr);
  1261. WR_UNLOCK(aspace);
  1262. if (varea)
  1263. {
  1264. err = rt_hw_mmu_control(aspace, varea->start, varea->size, cmd);
  1265. if (err == RT_EOK)
  1266. {
  1267. rt_hw_tlb_invalidate_range(aspace, varea->start, varea->size, ARCH_PAGE_SIZE);
  1268. }
  1269. }
  1270. else
  1271. {
  1272. err = -RT_ENOENT;
  1273. }
  1274. return err;
  1275. }
  1276. int rt_aspace_traversal(rt_aspace_t aspace,
  1277. int (*fn)(rt_varea_t varea, void *arg), void *arg)
  1278. {
  1279. rt_varea_t varea;
  1280. rt_varea_t next;
  1281. WR_LOCK(aspace);
  1282. varea = ASPACE_VAREA_FIRST(aspace);
  1283. while (varea)
  1284. {
  1285. next = ASPACE_VAREA_NEXT(varea);
  1286. fn(varea, arg);
  1287. varea = next;
  1288. }
  1289. WR_UNLOCK(aspace);
  1290. return 0;
  1291. }
  1292. static int _dump(rt_varea_t varea, void *arg)
  1293. {
  1294. if (varea->mem_obj && varea->mem_obj->get_name)
  1295. {
  1296. rt_kprintf("[%p - %p] %s\n", varea->start, (char *)varea->start + varea->size,
  1297. varea->mem_obj->get_name(varea));
  1298. }
  1299. else
  1300. {
  1301. rt_kprintf("[%p - %p] phy-map\n", varea->start, (char *)varea->start + varea->size);
  1302. rt_kprintf("\t\\_ paddr = %p\n", varea->offset << MM_PAGE_SHIFT);
  1303. }
  1304. return 0;
  1305. }
  1306. void rt_aspace_print_all(rt_aspace_t aspace)
  1307. {
  1308. rt_aspace_traversal(aspace, _dump, NULL);
  1309. }
  1310. static int _count_vsz(rt_varea_t varea, void *arg)
  1311. {
  1312. rt_base_t *pvsz = arg;
  1313. RT_ASSERT(varea);
  1314. *pvsz = *pvsz + varea->size;
  1315. return 0;
  1316. }
  1317. rt_base_t rt_aspace_count_vsz(rt_aspace_t aspace)
  1318. {
  1319. rt_base_t vsz = 0;
  1320. rt_aspace_traversal(aspace, _count_vsz, &vsz);
  1321. return vsz;
  1322. }
  1323. static int _dup_varea(rt_varea_t src_varea, void *arg)
  1324. {
  1325. int err;
  1326. rt_aspace_t dst = arg;
  1327. rt_aspace_t src = src_varea->aspace;
  1328. void *pa = RT_NULL;
  1329. void *va = RT_NULL;
  1330. rt_mem_obj_t mem_obj = src_varea->mem_obj;
  1331. if (!mem_obj)
  1332. {
  1333. /* duplicate a physical mapping */
  1334. pa = rt_hw_mmu_v2p(src, (void *)src_varea->start);
  1335. RT_ASSERT(pa != ARCH_MAP_FAILED);
  1336. struct rt_mm_va_hint hint = {.flags = src_varea->flag,
  1337. .limit_range_size = dst->size,
  1338. .limit_start = dst->start,
  1339. .prefer = src_varea->start,
  1340. .map_size = src_varea->size};
  1341. err = rt_aspace_map_phy(dst, &hint, src_varea->attr,
  1342. MM_PA_TO_OFF(pa), &va);
  1343. if (err != RT_EOK)
  1344. {
  1345. LOG_W("%s: aspace map failed at %p with size %p", __func__,
  1346. src_varea->start, src_varea->size);
  1347. }
  1348. }
  1349. else
  1350. {
  1351. /* duplicate a mem_obj backing mapping */
  1352. rt_base_t flags = src_varea->flag | MMF_MAP_FIXED;
  1353. flags &= ~MMF_STATIC_ALLOC;
  1354. flags &= ~MMF_PREFETCH;
  1355. va = src_varea->start;
  1356. err = rt_aspace_map(dst, &va, src_varea->size, src_varea->attr,
  1357. flags, mem_obj, src_varea->offset);
  1358. if (err != RT_EOK)
  1359. {
  1360. LOG_W("%s: aspace map failed at %p with size %p", __func__,
  1361. src_varea->start, src_varea->size);
  1362. }
  1363. }
  1364. if (va != (void *)src_varea->start)
  1365. {
  1366. return -1;
  1367. }
  1368. return 0;
  1369. }
  1370. struct _compare_param {
  1371. rt_aspace_t dst;
  1372. int rc;
  1373. };
  1374. rt_err_t rt_aspace_duplicate_locked(rt_aspace_t src, rt_aspace_t dst)
  1375. {
  1376. return rt_aspace_traversal(src, _dup_varea, dst);
  1377. }
  1378. rt_inline int _varea_same(rt_varea_t a, rt_varea_t b)
  1379. {
  1380. return a->attr == b->attr && a->flag == b->flag && a->mem_obj == b->mem_obj;
  1381. }
  1382. rt_inline void _dump_varea(rt_varea_t varea)
  1383. {
  1384. LOG_W("%s(attr=0x%lx, flags=0x%lx, start=0x%lx, size=0x%lx, mem_obj=%p)", VAREA_NAME(varea), varea->attr, varea->flag, varea->start, varea->size, varea->mem_obj);
  1385. }
  1386. static int _compare_varea(rt_varea_t src_varea, void *arg)
  1387. {
  1388. struct _compare_param *param = arg;
  1389. rt_varea_t dst_varea;
  1390. rt_aspace_t dst = param->dst;
  1391. rt_aspace_t src = src_varea->aspace;
  1392. dst_varea = _aspace_bst_search(dst, src_varea->start);
  1393. if (dst_varea)
  1394. {
  1395. char *buf1 = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  1396. char *buf2 = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  1397. char *vend = src_varea->start + src_varea->size;
  1398. for (char *i = src_varea->start; i < vend; i += ARCH_PAGE_SIZE)
  1399. {
  1400. int rc;
  1401. rt_aspace_page_get(src, i, buf1);
  1402. rt_aspace_page_get(dst, i, buf2);
  1403. rc = memcmp(buf1, buf2, ARCH_PAGE_SIZE);
  1404. if (rc)
  1405. {
  1406. if (param->rc == 0)
  1407. param->rc = rc;
  1408. LOG_E("%s(a_varea=%s, b_varea=%s)", __func__, VAREA_NAME(src_varea), VAREA_NAME(dst_varea));
  1409. _dump_varea(src_varea);
  1410. _dump_varea(dst_varea);
  1411. RT_ASSERT(0);
  1412. }
  1413. }
  1414. rt_pages_free(buf1, 0);
  1415. rt_pages_free(buf2, 0);
  1416. }
  1417. else
  1418. {
  1419. param->rc = -RT_ENOENT;
  1420. }
  1421. return 0;
  1422. }
  1423. rt_err_t rt_aspace_compare(rt_aspace_t src, rt_aspace_t dst)
  1424. {
  1425. struct _compare_param param = {.rc = 0, .dst = dst};
  1426. rt_aspace_traversal(src, _compare_varea, &param);
  1427. return param.rc;
  1428. }
  1429. /* dst are page aligned */
  1430. rt_inline rt_err_t _page_put(rt_varea_t varea, void *page_va, void *buffer)
  1431. {
  1432. struct rt_aspace_io_msg iomsg;
  1433. rt_err_t rc;
  1434. rt_mm_io_msg_init(&iomsg, VAREA_VA_TO_OFFSET(varea, page_va), page_va, buffer);
  1435. varea->mem_obj->page_write(varea, &iomsg);
  1436. if (iomsg.response.status == MM_FAULT_STATUS_UNRECOVERABLE)
  1437. rc = -RT_ERROR;
  1438. else
  1439. rc = RT_EOK;
  1440. return rc;
  1441. }
  1442. /* dst are page aligned */
  1443. rt_inline rt_err_t _page_get(rt_varea_t varea, void *page_va, void *buffer)
  1444. {
  1445. struct rt_aspace_io_msg iomsg;
  1446. rt_err_t rc;
  1447. rt_mm_io_msg_init(&iomsg, VAREA_VA_TO_OFFSET(varea, page_va), page_va, buffer);
  1448. varea->mem_obj->page_read(varea, &iomsg);
  1449. if (iomsg.response.status == MM_FAULT_STATUS_UNRECOVERABLE)
  1450. rc = -RT_ERROR;
  1451. else
  1452. rc = RT_EOK;
  1453. return rc;
  1454. }
  1455. #ifdef RT_USING_SMART
  1456. #include "lwp.h"
  1457. rt_inline rt_aspace_t _current_uspace(void)
  1458. {
  1459. rt_lwp_t this_proc = lwp_self();
  1460. return this_proc ? this_proc->aspace : RT_NULL;
  1461. }
  1462. #else
  1463. rt_inline rt_aspace_t _current_uspace(void)
  1464. {
  1465. return RT_NULL;
  1466. }
  1467. #endif
  1468. rt_err_t rt_aspace_page_get_phy(rt_aspace_t aspace, void *page_va, void *buffer)
  1469. {
  1470. rt_err_t rc = -RT_ERROR;
  1471. char *frame_ka = rt_hw_mmu_v2p(aspace, page_va);
  1472. if (frame_ka != ARCH_MAP_FAILED)
  1473. {
  1474. frame_ka = rt_kmem_p2v(frame_ka);
  1475. if (frame_ka)
  1476. {
  1477. rt_memcpy(buffer, frame_ka, ARCH_PAGE_SIZE);
  1478. rc = RT_EOK;
  1479. }
  1480. else if (aspace == _current_uspace() || aspace == &rt_kernel_space)
  1481. {
  1482. /* direct IO */
  1483. rt_memcpy(buffer, page_va, ARCH_PAGE_SIZE);
  1484. rc = RT_EOK;
  1485. }
  1486. else
  1487. {
  1488. /* user memory region remap ? */
  1489. LOG_W("%s(aspace=0x%lx,va=%p): Operation not support",
  1490. __func__, aspace, page_va);
  1491. rc = -RT_ENOSYS;
  1492. }
  1493. }
  1494. else
  1495. {
  1496. LOG_W("%s(aspace=0x%lx,va=%p): PTE not existed",
  1497. __func__, aspace, page_va);
  1498. rc = -RT_ENOENT;
  1499. }
  1500. return rc;
  1501. }
  1502. rt_err_t rt_aspace_page_put_phy(rt_aspace_t aspace, void *page_va, void *buffer)
  1503. {
  1504. rt_err_t rc = -RT_ERROR;
  1505. char *frame_ka = rt_hw_mmu_v2p(aspace, page_va);
  1506. if (frame_ka != ARCH_MAP_FAILED)
  1507. {
  1508. frame_ka = rt_kmem_p2v(frame_ka);
  1509. if (frame_ka)
  1510. {
  1511. rt_memcpy(frame_ka, buffer, ARCH_PAGE_SIZE);
  1512. rc = RT_EOK;
  1513. }
  1514. else if (aspace == _current_uspace() || aspace == &rt_kernel_space)
  1515. {
  1516. /* direct IO */
  1517. rt_memcpy(page_va, buffer, ARCH_PAGE_SIZE);
  1518. rc = RT_EOK;
  1519. }
  1520. else
  1521. {
  1522. /* user memory region remap ? */
  1523. LOG_W("%s(aspace=0x%lx,va=%p): Operation not support",
  1524. __func__, aspace, page_va);
  1525. rc = -RT_ENOSYS;
  1526. }
  1527. }
  1528. else
  1529. {
  1530. LOG_W("%s(aspace=0x%lx,va=%p): PTE not existed",
  1531. __func__, aspace, page_va);
  1532. rc = -RT_ENOENT;
  1533. }
  1534. return rc;
  1535. }
  1536. rt_err_t rt_aspace_page_put(rt_aspace_t aspace, void *page_va, void *buffer)
  1537. {
  1538. rt_err_t rc = -RT_ERROR;
  1539. rt_varea_t varea;
  1540. RT_ASSERT(aspace);
  1541. RD_LOCK(aspace);
  1542. varea = _aspace_bst_search(aspace, page_va);
  1543. if (varea && ALIGNED(page_va))
  1544. {
  1545. if (varea->mem_obj)
  1546. {
  1547. if (varea->mem_obj->page_write)
  1548. {
  1549. if (rt_varea_is_private_locked(varea))
  1550. {
  1551. RDWR_LOCK(aspace);
  1552. struct rt_aspace_fault_msg msg;
  1553. msg.fault_op = MM_FAULT_OP_WRITE;
  1554. msg.fault_type = MM_FAULT_TYPE_GENERIC_MMU;
  1555. msg.fault_vaddr = page_va;
  1556. rc = rt_varea_fix_private_locked(varea, rt_hw_mmu_v2p(aspace, page_va),
  1557. &msg, RT_TRUE);
  1558. RDWR_UNLOCK(aspace);
  1559. if (rc == MM_FAULT_FIXABLE_TRUE)
  1560. {
  1561. varea = _aspace_bst_search(aspace, page_va);
  1562. rc = _page_put(varea, page_va, buffer);
  1563. }
  1564. else
  1565. rc = -RT_ERROR;
  1566. }
  1567. else
  1568. rc = _page_put(varea, page_va, buffer);
  1569. }
  1570. else
  1571. {
  1572. rc = -RT_EINVAL;
  1573. LOG_I("%s: Operation not allowed", __func__);
  1574. }
  1575. }
  1576. else
  1577. {
  1578. rc = rt_aspace_page_put_phy(aspace, page_va, buffer);
  1579. }
  1580. }
  1581. else
  1582. rc = -RT_EINVAL;
  1583. RD_UNLOCK(aspace);
  1584. return rc;
  1585. }
  1586. rt_err_t rt_aspace_page_get(rt_aspace_t aspace, void *page_va, void *buffer)
  1587. {
  1588. rt_err_t rc = -RT_ERROR;
  1589. rt_varea_t varea;
  1590. /* TODO: cache the last search item */
  1591. RT_ASSERT(aspace);
  1592. RD_LOCK(aspace);
  1593. varea = _aspace_bst_search(aspace, page_va);
  1594. if (varea && ALIGNED(page_va))
  1595. {
  1596. if (varea->mem_obj)
  1597. {
  1598. if (varea->mem_obj->page_read)
  1599. {
  1600. rc = _page_get(varea, page_va, buffer);
  1601. }
  1602. else
  1603. {
  1604. LOG_I("%s: Operation not allowed", __func__);
  1605. }
  1606. }
  1607. else
  1608. {
  1609. rc = rt_aspace_page_get_phy(aspace, page_va, buffer);
  1610. }
  1611. }
  1612. else
  1613. {
  1614. rc = -RT_EINVAL;
  1615. LOG_D("%s(va=%p,varea=0x%lx): Invalid address",
  1616. __func__, page_va, varea);
  1617. }
  1618. RD_UNLOCK(aspace);
  1619. return rc;
  1620. }
  1621. rt_varea_t rt_aspace_query(rt_aspace_t aspace, void *vaddr)
  1622. {
  1623. return _aspace_bst_search(aspace, vaddr);
  1624. }