lwp_user_mm.c 28 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108
  1. /*
  2. * Copyright (c) 2006-2021, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2019-10-28 Jesven first version
  9. * 2021-02-06 lizhirui fixed fixed vtable size problem
  10. * 2021-02-12 lizhirui add 64-bit support for lwp_brk
  11. * 2021-02-19 lizhirui add riscv64 support for lwp_user_accessable and lwp_get_from_user
  12. * 2021-06-07 lizhirui modify user space bound check
  13. * 2022-12-25 wangxiaoyao adapt to new mm
  14. * 2023-08-12 Shell Fix parameter passing of lwp_mmap()/lwp_munmap()
  15. * 2023-08-29 Shell Add API accessible()/data_get()/data_set()/data_put()
  16. * 2023-09-13 Shell Add lwp_memcpy and support run-time choice of memcpy base on memory attr
  17. * 2023-09-19 Shell add lwp_user_memory_remap_to_kernel
  18. */
  19. #include <rtthread.h>
  20. #include <rthw.h>
  21. #include <string.h>
  22. #ifdef ARCH_MM_MMU
  23. #include "lwp_internal.h"
  24. #include <mm_aspace.h>
  25. #include <mm_fault.h>
  26. #include <mm_flag.h>
  27. #include <mm_page.h>
  28. #include <mmu.h>
  29. #include <page.h>
  30. #ifdef RT_USING_MUSLLIBC
  31. #include "libc_musl.h"
  32. #endif
  33. #define DBG_TAG "LwP.mman"
  34. #define DBG_LVL DBG_INFO
  35. #include <rtdbg.h>
  36. #include <stdlib.h>
  37. #define STACK_OBJ _null_object
  38. static const char *_null_get_name(rt_varea_t varea)
  39. {
  40. return "null";
  41. }
  42. static void _null_page_fault(struct rt_varea *varea,
  43. struct rt_aspace_fault_msg *msg)
  44. {
  45. static void *null_page;
  46. if (!null_page)
  47. {
  48. null_page = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  49. if (null_page)
  50. memset(null_page, 0, ARCH_PAGE_SIZE);
  51. else
  52. return;
  53. }
  54. msg->response.status = MM_FAULT_STATUS_OK;
  55. msg->response.size = ARCH_PAGE_SIZE;
  56. msg->response.vaddr = null_page;
  57. }
  58. static rt_err_t _null_shrink(rt_varea_t varea, void *new_start, rt_size_t size)
  59. {
  60. char *varea_start = varea->start;
  61. void *rm_start;
  62. void *rm_end;
  63. if (varea_start == (char *)new_start)
  64. {
  65. rm_start = varea_start + size;
  66. rm_end = varea_start + varea->size;
  67. }
  68. else /* if (varea_start < (char *)new_start) */
  69. {
  70. RT_ASSERT(varea_start < (char *)new_start);
  71. rm_start = varea_start;
  72. rm_end = new_start;
  73. }
  74. rt_varea_unmap_range(varea, rm_start, rm_end - rm_start);
  75. return RT_EOK;
  76. }
  77. static rt_err_t _null_split(struct rt_varea *existed, void *unmap_start, rt_size_t unmap_len, struct rt_varea *subset)
  78. {
  79. rt_varea_unmap_range(existed, unmap_start, unmap_len);
  80. return RT_EOK;
  81. }
  82. static rt_err_t _null_expand(struct rt_varea *varea, void *new_vaddr, rt_size_t size)
  83. {
  84. return RT_EOK;
  85. }
  86. static void _null_page_read(struct rt_varea *varea, struct rt_aspace_io_msg *msg)
  87. {
  88. void *dest = msg->buffer_vaddr;
  89. memset(dest, 0, ARCH_PAGE_SIZE);
  90. msg->response.status = MM_FAULT_STATUS_OK;
  91. return ;
  92. }
  93. static void _null_page_write(struct rt_varea *varea, struct rt_aspace_io_msg *msg)
  94. {
  95. /* write operation is not allowed */
  96. msg->response.status = MM_FAULT_STATUS_UNRECOVERABLE;
  97. return ;
  98. }
  99. static struct rt_mem_obj _null_object = {
  100. .get_name = _null_get_name,
  101. .hint_free = RT_NULL,
  102. .on_page_fault = _null_page_fault,
  103. .page_read = _null_page_read,
  104. .page_write = _null_page_write,
  105. .on_varea_expand = _null_expand,
  106. .on_varea_shrink = _null_shrink,
  107. .on_varea_split = _null_split,
  108. };
  109. int lwp_user_space_init(struct rt_lwp *lwp, rt_bool_t is_fork)
  110. {
  111. void *stk_addr;
  112. int err = -RT_ENOMEM;
  113. const size_t flags = MMF_MAP_PRIVATE;
  114. err = arch_user_space_init(lwp);
  115. if (err == RT_EOK)
  116. {
  117. if (!is_fork)
  118. {
  119. stk_addr = (void *)USER_STACK_VSTART;
  120. err = rt_aspace_map(lwp->aspace, &stk_addr,
  121. USER_STACK_VEND - USER_STACK_VSTART,
  122. MMU_MAP_U_RWCB, flags, &STACK_OBJ, 0);
  123. }
  124. }
  125. return err;
  126. }
  127. void lwp_aspace_switch(struct rt_thread *thread)
  128. {
  129. struct rt_lwp *lwp = RT_NULL;
  130. rt_aspace_t to_aspace;
  131. void *from_tbl, *to_table;
  132. if (thread->lwp)
  133. {
  134. lwp = (struct rt_lwp *)thread->lwp;
  135. to_aspace = lwp->aspace;
  136. to_table = to_aspace->page_table;
  137. }
  138. else
  139. {
  140. to_aspace = &rt_kernel_space;
  141. /* the page table is arch dependent but not aspace->page_table */
  142. to_table = arch_kernel_mmu_table_get();
  143. }
  144. /* must fetch the effected page table to avoid hot update */
  145. from_tbl = rt_hw_mmu_tbl_get();
  146. if (to_table != from_tbl)
  147. {
  148. rt_hw_aspace_switch(to_aspace);
  149. }
  150. }
  151. void lwp_unmap_user_space(struct rt_lwp *lwp)
  152. {
  153. if (lwp->aspace)
  154. arch_user_space_free(lwp);
  155. }
  156. static void *_lwp_map_user(struct rt_lwp *lwp, void *map_va, size_t map_size,
  157. int text)
  158. {
  159. void *va = map_va;
  160. int ret = 0;
  161. rt_size_t flags = MMF_PREFETCH;
  162. if (text)
  163. flags |= MMF_TEXT;
  164. if (va != RT_NULL)
  165. flags |= MMF_MAP_FIXED;
  166. ret = rt_aspace_map_private(lwp->aspace, &va, map_size, MMU_MAP_U_RWCB, flags);
  167. if (ret != RT_EOK)
  168. {
  169. va = RT_NULL;
  170. LOG_I("lwp_map_user: failed to map %lx with size %lx with errno %d", map_va,
  171. map_size, ret);
  172. }
  173. return va;
  174. }
  175. int lwp_unmap_user(struct rt_lwp *lwp, void *va)
  176. {
  177. int err = rt_aspace_unmap(lwp->aspace, va);
  178. return err;
  179. }
  180. /** fork the src_lwp->aspace in current */
  181. int lwp_fork_aspace(struct rt_lwp *dest_lwp, struct rt_lwp *src_lwp)
  182. {
  183. int err;
  184. err = rt_aspace_fork(&src_lwp->aspace, &dest_lwp->aspace);
  185. if (!err)
  186. {
  187. /* do a explicit aspace switch if the page table is changed */
  188. lwp_aspace_switch(rt_thread_self());
  189. }
  190. return err;
  191. }
  192. int lwp_unmap_user_phy(struct rt_lwp *lwp, void *va)
  193. {
  194. return lwp_unmap_user(lwp, va);
  195. }
  196. void *lwp_map_user(struct rt_lwp *lwp, void *map_va, size_t map_size, int text)
  197. {
  198. void *ret = RT_NULL;
  199. size_t offset = 0;
  200. if (!map_size)
  201. {
  202. return 0;
  203. }
  204. offset = (size_t)map_va & ARCH_PAGE_MASK;
  205. map_size += (offset + ARCH_PAGE_SIZE - 1);
  206. map_size &= ~ARCH_PAGE_MASK;
  207. map_va = (void *)((size_t)map_va & ~ARCH_PAGE_MASK);
  208. ret = _lwp_map_user(lwp, map_va, map_size, text);
  209. if (ret)
  210. {
  211. ret = (void *)((char *)ret + offset);
  212. }
  213. return ret;
  214. }
  215. static inline size_t _flags_to_attr(size_t flags)
  216. {
  217. size_t attr;
  218. if (flags & LWP_MAP_FLAG_NOCACHE)
  219. {
  220. attr = MMU_MAP_U_RW;
  221. }
  222. else
  223. {
  224. attr = MMU_MAP_U_RWCB;
  225. }
  226. return attr;
  227. }
  228. static inline mm_flag_t _flags_to_aspace_flag(size_t flags)
  229. {
  230. mm_flag_t mm_flag = 0;
  231. if (flags & LWP_MAP_FLAG_MAP_FIXED)
  232. mm_flag |= MMF_MAP_FIXED;
  233. if (flags & LWP_MAP_FLAG_PREFETCH)
  234. mm_flag |= MMF_PREFETCH;
  235. return mm_flag;
  236. }
  237. static rt_varea_t _lwp_map_user_varea(struct rt_lwp *lwp, void *map_va, size_t map_size, size_t flags)
  238. {
  239. void *va = map_va;
  240. int ret = 0;
  241. rt_varea_t varea = RT_NULL;
  242. mm_flag_t mm_flags;
  243. size_t attr;
  244. attr = _flags_to_attr(flags);
  245. mm_flags = _flags_to_aspace_flag(flags);
  246. ret = rt_aspace_map_private(lwp->aspace, &va, map_size,
  247. attr, mm_flags);
  248. if (ret == RT_EOK)
  249. {
  250. varea = rt_aspace_query(lwp->aspace, va);
  251. }
  252. if (ret != RT_EOK)
  253. {
  254. LOG_I("lwp_map_user: failed to map %lx with size %lx with errno %d", map_va,
  255. map_size, ret);
  256. }
  257. return varea;
  258. }
  259. static rt_varea_t _map_user_varea_ext(struct rt_lwp *lwp, void *map_va, size_t map_size, size_t flags)
  260. {
  261. size_t offset = 0;
  262. if (!map_size)
  263. {
  264. return 0;
  265. }
  266. offset = (size_t)map_va & ARCH_PAGE_MASK;
  267. map_size += (offset + ARCH_PAGE_SIZE - 1);
  268. map_size &= ~ARCH_PAGE_MASK;
  269. map_va = (void *)((size_t)map_va & ~ARCH_PAGE_MASK);
  270. return _lwp_map_user_varea(lwp, map_va, map_size, flags);
  271. }
  272. rt_varea_t lwp_map_user_varea_ext(struct rt_lwp *lwp, void *map_va, size_t map_size, size_t flags)
  273. {
  274. return _map_user_varea_ext(lwp, map_va, map_size, flags);
  275. }
  276. rt_varea_t lwp_map_user_varea(struct rt_lwp *lwp, void *map_va, size_t map_size)
  277. {
  278. return _map_user_varea_ext(lwp, map_va, map_size, LWP_MAP_FLAG_NONE);
  279. }
  280. void *lwp_map_user_phy(struct rt_lwp *lwp, void *map_va, void *map_pa,
  281. size_t map_size, int cached)
  282. {
  283. int err;
  284. char *va;
  285. size_t offset = 0;
  286. if (!map_size)
  287. {
  288. return 0;
  289. }
  290. if (map_va)
  291. {
  292. if (((size_t)map_va & ARCH_PAGE_MASK) !=
  293. ((size_t)map_pa & ARCH_PAGE_MASK))
  294. {
  295. return 0;
  296. }
  297. }
  298. offset = (size_t)map_pa & ARCH_PAGE_MASK;
  299. map_size += (offset + ARCH_PAGE_SIZE - 1);
  300. map_size &= ~ARCH_PAGE_MASK;
  301. map_pa = (void *)((size_t)map_pa & ~ARCH_PAGE_MASK);
  302. struct rt_mm_va_hint hint = {.flags = 0,
  303. .limit_range_size = lwp->aspace->size,
  304. .limit_start = lwp->aspace->start,
  305. .prefer = map_va,
  306. .map_size = map_size};
  307. if (map_va != RT_NULL)
  308. hint.flags |= MMF_MAP_FIXED;
  309. rt_size_t attr = cached ? MMU_MAP_U_RWCB : MMU_MAP_U_RW;
  310. err =
  311. rt_aspace_map_phy(lwp->aspace, &hint, attr, MM_PA_TO_OFF(map_pa), (void **)&va);
  312. if (err != RT_EOK)
  313. {
  314. va = RT_NULL;
  315. LOG_W("%s", __func__);
  316. }
  317. else
  318. {
  319. va += offset;
  320. }
  321. return va;
  322. }
  323. rt_base_t lwp_brk(void *addr)
  324. {
  325. rt_base_t ret = -1;
  326. rt_varea_t varea = RT_NULL;
  327. struct rt_lwp *lwp = RT_NULL;
  328. size_t size = 0;
  329. lwp = lwp_self();
  330. if ((size_t)addr == RT_NULL)
  331. {
  332. addr = (char *)lwp->end_heap + 1;
  333. }
  334. if ((size_t)addr <= lwp->end_heap && (size_t)addr > USER_HEAP_VADDR)
  335. {
  336. ret = (size_t)addr;
  337. }
  338. else if ((size_t)addr <= USER_HEAP_VEND)
  339. {
  340. size = RT_ALIGN((size_t)addr - lwp->end_heap, ARCH_PAGE_SIZE);
  341. varea = lwp_map_user_varea_ext(lwp, (void *)lwp->end_heap, size, LWP_MAP_FLAG_PREFETCH);
  342. if (varea)
  343. {
  344. lwp->end_heap = (long)(varea->start + varea->size);
  345. ret = lwp->end_heap;
  346. }
  347. }
  348. return ret;
  349. }
  350. rt_inline rt_mem_obj_t _get_mmap_obj(struct rt_lwp *lwp)
  351. {
  352. return &_null_object;
  353. }
  354. rt_inline rt_bool_t _memory_threshold_ok(void)
  355. {
  356. #define GUARDIAN_BITS (10)
  357. size_t total, free;
  358. rt_page_get_info(&total, &free);
  359. if (free * (0x1000) < 0x100000)
  360. {
  361. LOG_I("%s: low of system memory", __func__);
  362. return RT_FALSE;
  363. }
  364. return RT_TRUE;
  365. }
  366. rt_inline long _uflag_to_kernel(long flag)
  367. {
  368. flag &= ~MMF_MAP_FIXED;
  369. flag &= ~MMF_MAP_PRIVATE;
  370. flag &= ~MMF_MAP_PRIVATE_DONT_SYNC;
  371. return flag;
  372. }
  373. rt_inline long _uattr_to_kernel(long attr)
  374. {
  375. /* Warning: be careful with the case if user attribution is unwritable */
  376. return attr;
  377. }
  378. static void _prefetch_mmap(rt_aspace_t aspace, void *addr, long size)
  379. {
  380. struct rt_aspace_fault_msg msg;
  381. msg.fault_op = MM_FAULT_OP_WRITE;
  382. msg.fault_type = MM_FAULT_TYPE_PAGE_FAULT;
  383. for (char *base = addr; size > 0; base += ARCH_PAGE_SIZE, size -= ARCH_PAGE_SIZE)
  384. {
  385. msg.fault_vaddr = base;
  386. msg.off = (long)base >> MM_PAGE_SHIFT;
  387. rt_aspace_fault_try_fix(aspace, &msg);
  388. }
  389. return ;
  390. }
  391. void *lwp_user_memory_remap_to_kernel(rt_lwp_t lwp, void *uaddr, size_t length)
  392. {
  393. long kattr;
  394. long kflag;
  395. long offset_in_mobj;
  396. long offset_in_page;
  397. rt_err_t error;
  398. rt_varea_t uarea;
  399. rt_mem_obj_t mobj;
  400. void *kaddr = 0;
  401. uarea = rt_aspace_query(lwp->aspace, uaddr);
  402. if (uarea)
  403. {
  404. /* setup the identical mapping, and align up for address & length */
  405. kattr = _uattr_to_kernel(uarea->attr);
  406. kflag = _uflag_to_kernel(uarea->flag);
  407. offset_in_mobj = uarea->offset + ((long)uaddr - (long)uarea->start) / ARCH_PAGE_SIZE;
  408. mobj = uarea->mem_obj;
  409. offset_in_page = (long)uaddr & ARCH_PAGE_MASK;
  410. length = RT_ALIGN(length + offset_in_page, ARCH_PAGE_SIZE);
  411. error = rt_aspace_map(&rt_kernel_space, &kaddr, length, kattr, kflag, mobj, offset_in_mobj);
  412. if (error)
  413. {
  414. LOG_I("%s(length=0x%lx,attr=0x%lx,flags=0x%lx): do map failed", __func__, length, kattr, kflag);
  415. kaddr = 0;
  416. }
  417. else
  418. {
  419. /* TODO: {make a memory lock?} */
  420. LOG_D("%s(length=0x%lx,attr=0x%lx,flags=0x%lx,offset=0x%lx) => %p", __func__, length, kattr, kflag, offset_in_mobj, kaddr);
  421. _prefetch_mmap(&rt_kernel_space, kaddr, length);
  422. kaddr += offset_in_page;
  423. }
  424. }
  425. return kaddr;
  426. }
  427. #include <dfs_dentry.h>
  428. #define _AFFBLK_PGOFFSET (RT_PAGE_AFFINITY_BLOCK_SIZE >> MM_PAGE_SHIFT)
  429. static rt_base_t _aligned_for_weak_mapping(off_t *ppgoff, rt_size_t *plen, rt_size_t *palign)
  430. {
  431. off_t aligned_pgoffset, pgoffset = *ppgoff;
  432. rt_size_t length = *plen;
  433. rt_size_t min_align_size = *palign;
  434. rt_base_t aligned_size = 0;
  435. if (pgoffset >= 0)
  436. {
  437. /* force an alignment */
  438. aligned_pgoffset =
  439. RT_ALIGN_DOWN(pgoffset, RT_PAGE_AFFINITY_BLOCK_SIZE >> MM_PAGE_SHIFT);
  440. aligned_size = (pgoffset - aligned_pgoffset) << MM_PAGE_SHIFT;
  441. if (aligned_pgoffset != pgoffset)
  442. {
  443. /**
  444. * If requested pgoffset is not sitting on an aligned page offset,
  445. * expand the request mapping to force an alignment.
  446. */
  447. length += aligned_size;
  448. pgoffset = aligned_pgoffset;
  449. }
  450. /**
  451. * As this is a weak mapping, we can pick any reasonable address for our
  452. * requirement.
  453. */
  454. min_align_size = RT_PAGE_AFFINITY_BLOCK_SIZE;
  455. }
  456. else
  457. {
  458. RT_ASSERT(0 && "Unexpected input");
  459. }
  460. *ppgoff = pgoffset;
  461. *plen = length;
  462. *palign = min_align_size;
  463. return aligned_size;
  464. }
  465. void *lwp_mmap2(struct rt_lwp *lwp, void *addr, size_t length, int prot,
  466. int flags, int fd, off_t pgoffset)
  467. {
  468. rt_err_t rc;
  469. rt_size_t k_attr, k_flags, k_offset, aligned_size = 0;
  470. rt_size_t min_align_size = 1 << MM_PAGE_SHIFT;
  471. rt_aspace_t uspace;
  472. rt_mem_obj_t mem_obj;
  473. void *ret = 0;
  474. LOG_D("%s(addr=0x%lx,length=0x%lx,fd=%d,pgoff=0x%lx)", __func__, addr, length, fd, pgoffset);
  475. /* alignment for affinity page block */
  476. if (flags & MAP_FIXED)
  477. {
  478. if (fd != -1)
  479. {
  480. /* requested mapping address */
  481. rt_base_t va_affid = RT_PAGE_PICK_AFFID(addr);
  482. rt_base_t pgoff_affid = RT_PAGE_PICK_AFFID(pgoffset << MM_PAGE_SHIFT);
  483. /* filter illegal align address */
  484. if (va_affid != pgoff_affid)
  485. {
  486. LOG_W("Unaligned mapping address %p(pgoff=0x%lx) from fd=%d",
  487. addr, pgoffset, fd);
  488. }
  489. }
  490. else
  491. {
  492. /* anonymous mapping can always aligned */
  493. }
  494. }
  495. else
  496. {
  497. /* weak address selection */
  498. aligned_size = _aligned_for_weak_mapping(&pgoffset, &length, &min_align_size);
  499. }
  500. if (fd == -1)
  501. {
  502. #ifdef RT_DEBUGGING_PAGE_THRESHOLD
  503. if (!_memory_threshold_ok())
  504. return (void *)-ENOMEM;
  505. #endif /* RT_DEBUGGING_PAGE_THRESHOLD */
  506. k_offset = MM_PA_TO_OFF(addr);
  507. k_flags = MMF_CREATE(lwp_user_mm_flag_to_kernel(flags) | MMF_MAP_PRIVATE,
  508. min_align_size);
  509. k_attr = lwp_user_mm_attr_to_kernel(prot);
  510. uspace = lwp->aspace;
  511. length = RT_ALIGN(length, ARCH_PAGE_SIZE);
  512. mem_obj = _get_mmap_obj(lwp);
  513. rc = rt_aspace_map(uspace, &addr, length, k_attr, k_flags, mem_obj, k_offset);
  514. if (rc == RT_EOK)
  515. {
  516. ret = addr;
  517. }
  518. else
  519. {
  520. ret = (void *)lwp_errno_to_posix(rc);
  521. }
  522. }
  523. else
  524. {
  525. struct dfs_file *d;
  526. d = fd_get(fd);
  527. if (d)
  528. {
  529. struct dfs_mmap2_args mmap2;
  530. mmap2.addr = addr;
  531. mmap2.length = length;
  532. mmap2.min_align_size = min_align_size;
  533. mmap2.prot = prot;
  534. mmap2.flags = flags;
  535. mmap2.pgoffset = pgoffset;
  536. mmap2.ret = (void *)-1;
  537. mmap2.lwp = lwp;
  538. rc = dfs_file_mmap2(d, &mmap2);
  539. if (rc == RT_EOK)
  540. {
  541. ret = mmap2.ret;
  542. }
  543. else
  544. {
  545. ret = (void *)lwp_errno_to_posix(rc);
  546. }
  547. }
  548. }
  549. if ((long)ret <= 0)
  550. {
  551. LOG_D("%s() => %ld", __func__, ret);
  552. }
  553. else
  554. {
  555. ret = (char *)ret + aligned_size;
  556. LOG_D("%s() => 0x%lx", __func__, ret);
  557. }
  558. return ret;
  559. }
  560. int lwp_munmap(struct rt_lwp *lwp, void *addr, size_t length)
  561. {
  562. int ret;
  563. RT_ASSERT(lwp);
  564. ret = rt_aspace_unmap_range(lwp->aspace, addr, length);
  565. return lwp_errno_to_posix(ret);
  566. }
  567. void *lwp_mremap(struct rt_lwp *lwp, void *old_address, size_t old_size,
  568. size_t new_size, int flags, void *new_address)
  569. {
  570. RT_ASSERT(lwp);
  571. return rt_aspace_mremap_range(lwp->aspace, old_address, old_size, new_size, flags, new_address);
  572. }
  573. static rt_bool_t _lwp_user_range_is_valid(const void *addr, size_t size)
  574. {
  575. uintptr_t start;
  576. uintptr_t end;
  577. if (addr == RT_NULL)
  578. {
  579. return RT_FALSE;
  580. }
  581. start = (uintptr_t)addr;
  582. if (start < (uintptr_t)USER_VADDR_START)
  583. {
  584. return RT_FALSE;
  585. }
  586. if (start >= (uintptr_t)USER_VADDR_TOP)
  587. {
  588. return RT_FALSE;
  589. }
  590. end = start + size;
  591. if (end < start)
  592. {
  593. return RT_FALSE;
  594. }
  595. if (end > (uintptr_t)USER_VADDR_TOP)
  596. {
  597. return RT_FALSE;
  598. }
  599. return RT_TRUE;
  600. }
  601. size_t lwp_get_from_user(void *dst, void *src, size_t size)
  602. {
  603. struct rt_lwp *lwp = RT_NULL;
  604. /* check src */
  605. if (!_lwp_user_range_is_valid(src, size))
  606. {
  607. return 0;
  608. }
  609. lwp = lwp_self();
  610. if (!lwp)
  611. {
  612. return 0;
  613. }
  614. return lwp_data_get(lwp, dst, src, size);
  615. }
  616. size_t lwp_put_to_user(void *dst, void *src, size_t size)
  617. {
  618. struct rt_lwp *lwp = RT_NULL;
  619. /* check dst */
  620. if (!_lwp_user_range_is_valid(dst, size))
  621. {
  622. return 0;
  623. }
  624. lwp = lwp_self();
  625. if (!lwp)
  626. {
  627. return 0;
  628. }
  629. return lwp_data_put(lwp, dst, src, size);
  630. }
  631. rt_inline rt_bool_t _can_unaligned_access(const char *addr)
  632. {
  633. return rt_kmem_v2p((char *)addr) - PV_OFFSET == addr;
  634. }
  635. void *lwp_memcpy(void * __restrict dst, const void * __restrict src, size_t size)
  636. {
  637. void *rc = dst;
  638. long len;
  639. if (lwp_in_user_space(dst))
  640. {
  641. if (!lwp_in_user_space(src))
  642. {
  643. len = lwp_put_to_user(dst, (void *)src, size);
  644. if (!len)
  645. {
  646. LOG_E("lwp_put_to_user(lwp=%p, dst=%p,src=%p,size=0x%lx) failed", lwp_self(), dst, src, size);
  647. }
  648. }
  649. else
  650. {
  651. /* not support yet */
  652. LOG_W("%s(dst=%p,src=%p,size=0x%lx): operation not support", dst, src, size, __func__);
  653. }
  654. }
  655. else
  656. {
  657. if (lwp_in_user_space(src))
  658. {
  659. len = lwp_get_from_user(dst, (void *)src, size);
  660. if (!len)
  661. {
  662. LOG_E("lwp_get_from_user(lwp=%p, dst=%p,src=%p,size=0x%lx) failed", lwp_self(), dst, src, size);
  663. }
  664. }
  665. else
  666. {
  667. if (_can_unaligned_access(dst) && _can_unaligned_access(src))
  668. {
  669. rc = memcpy(dst, src, size);
  670. }
  671. else
  672. {
  673. rt_memcpy(dst, src, size);
  674. }
  675. }
  676. }
  677. return rc;
  678. }
  679. int lwp_user_accessible_ext(struct rt_lwp *lwp, void *addr, size_t size)
  680. {
  681. void *addr_start = RT_NULL, *addr_end = RT_NULL, *next_page = RT_NULL;
  682. void *tmp_addr = RT_NULL;
  683. if (!lwp)
  684. {
  685. return RT_FALSE;
  686. }
  687. if (!size || !addr)
  688. {
  689. return RT_FALSE;
  690. }
  691. addr_start = addr;
  692. addr_end = (void *)((char *)addr + size);
  693. #ifdef ARCH_RISCV64
  694. if (addr_start < (void *)USER_VADDR_START)
  695. {
  696. return RT_FALSE;
  697. }
  698. #else
  699. if (addr_start >= (void *)USER_VADDR_TOP)
  700. {
  701. return RT_FALSE;
  702. }
  703. if (addr_end > (void *)USER_VADDR_TOP)
  704. {
  705. return RT_FALSE;
  706. }
  707. #endif
  708. next_page =
  709. (void *)(((size_t)addr_start + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  710. do
  711. {
  712. size_t len = (char *)next_page - (char *)addr_start;
  713. if (size < len)
  714. {
  715. len = size;
  716. }
  717. tmp_addr = lwp_v2p(lwp, addr_start);
  718. if (tmp_addr == ARCH_MAP_FAILED &&
  719. !rt_aspace_query(lwp->aspace, addr_start))
  720. {
  721. return RT_FALSE;
  722. }
  723. addr_start = (void *)((char *)addr_start + len);
  724. size -= len;
  725. next_page = (void *)((char *)next_page + ARCH_PAGE_SIZE);
  726. } while (addr_start < addr_end);
  727. return RT_TRUE;
  728. }
  729. int lwp_user_accessable(void *addr, size_t size)
  730. {
  731. return lwp_user_accessible_ext(lwp_self(), addr, size);
  732. }
  733. #define ALIGNED(addr) (!((rt_size_t)(addr) & ARCH_PAGE_MASK))
  734. /* src is in lwp address space, dst is in current thread space */
  735. size_t lwp_data_get(struct rt_lwp *lwp, void *dst, void *src, size_t size)
  736. {
  737. size_t copy_len = 0;
  738. char *temp_page = 0;
  739. char *dst_iter, *dst_next_page;
  740. char *src_copy_end, *src_iter, *src_iter_aligned;
  741. if (!size || !dst)
  742. {
  743. return 0;
  744. }
  745. dst_iter = dst;
  746. src_iter = src;
  747. src_copy_end = src + size;
  748. dst_next_page =
  749. (char *)(((size_t)src_iter + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  750. do
  751. {
  752. size_t bytes_to_copy = (char *)dst_next_page - (char *)src_iter;
  753. if (bytes_to_copy > size)
  754. {
  755. bytes_to_copy = size;
  756. }
  757. if (ALIGNED(src_iter) && bytes_to_copy == ARCH_PAGE_SIZE)
  758. {
  759. /* get page to kernel buffer */
  760. if (rt_aspace_page_get(lwp->aspace, src_iter, dst_iter))
  761. break;
  762. }
  763. else
  764. {
  765. if (!temp_page)
  766. temp_page = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  767. if (!temp_page)
  768. break;
  769. src_iter_aligned = (char *)((long)src_iter & ~ARCH_PAGE_MASK);
  770. if (rt_aspace_page_get(lwp->aspace, src_iter_aligned, temp_page))
  771. break;
  772. memcpy(dst_iter, temp_page + (src_iter - src_iter_aligned), bytes_to_copy);
  773. }
  774. dst_iter = dst_iter + bytes_to_copy;
  775. src_iter = src_iter + bytes_to_copy;
  776. size -= bytes_to_copy;
  777. dst_next_page = (void *)((char *)dst_next_page + ARCH_PAGE_SIZE);
  778. copy_len += bytes_to_copy;
  779. } while (src_iter < src_copy_end);
  780. if (temp_page)
  781. rt_pages_free(temp_page, 0);
  782. return copy_len;
  783. }
  784. /* dst is in lwp address space, src is in current thread space */
  785. size_t lwp_data_put(struct rt_lwp *lwp, void *dst, void *src, size_t size)
  786. {
  787. size_t copy_len = 0;
  788. char *temp_page = 0;
  789. char *dst_iter, *dst_iter_aligned, *dst_next_page;
  790. char *src_put_end, *src_iter;
  791. if (!size || !dst)
  792. {
  793. return 0;
  794. }
  795. src_iter = src;
  796. dst_iter = dst;
  797. src_put_end = dst + size;
  798. dst_next_page =
  799. (char *)(((size_t)dst_iter + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  800. do
  801. {
  802. size_t bytes_to_put = (char *)dst_next_page - (char *)dst_iter;
  803. if (bytes_to_put > size)
  804. {
  805. bytes_to_put = size;
  806. }
  807. if (ALIGNED(dst_iter) && bytes_to_put == ARCH_PAGE_SIZE)
  808. {
  809. /* write to page in kernel */
  810. if (rt_aspace_page_put(lwp->aspace, dst_iter, src_iter))
  811. break;
  812. }
  813. else
  814. {
  815. if (!temp_page)
  816. temp_page = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  817. if (!temp_page)
  818. break;
  819. dst_iter_aligned = (void *)((long)dst_iter & ~ARCH_PAGE_MASK);
  820. if (rt_aspace_page_get(lwp->aspace, dst_iter_aligned, temp_page))
  821. break;
  822. memcpy(temp_page + (dst_iter - dst_iter_aligned), src_iter, bytes_to_put);
  823. if (rt_aspace_page_put(lwp->aspace, dst_iter_aligned, temp_page))
  824. break;
  825. }
  826. src_iter = src_iter + bytes_to_put;
  827. dst_iter = dst_iter + bytes_to_put;
  828. size -= bytes_to_put;
  829. dst_next_page = dst_next_page + ARCH_PAGE_SIZE;
  830. copy_len += bytes_to_put;
  831. } while (dst_iter < src_put_end);
  832. if (temp_page)
  833. rt_pages_free(temp_page, 0);
  834. return copy_len;
  835. }
  836. /* Set N bytes of S to C */
  837. size_t lwp_data_set(struct rt_lwp *lwp, void *dst, int byte, size_t size)
  838. {
  839. size_t copy_len = 0;
  840. char *temp_page = 0;
  841. char *dst_iter, *dst_iter_aligned, *dst_next_page;
  842. char *dst_put_end;
  843. if (!size || !dst)
  844. {
  845. return 0;
  846. }
  847. dst_iter = dst;
  848. dst_put_end = dst + size;
  849. dst_next_page =
  850. (char *)(((size_t)dst_iter + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  851. temp_page = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  852. if (temp_page)
  853. {
  854. do
  855. {
  856. size_t bytes_to_put = (char *)dst_next_page - (char *)dst_iter;
  857. if (bytes_to_put > size)
  858. {
  859. bytes_to_put = size;
  860. }
  861. dst_iter_aligned = (void *)((long)dst_iter & ~ARCH_PAGE_MASK);
  862. if (!ALIGNED(dst_iter) || bytes_to_put != ARCH_PAGE_SIZE)
  863. if (rt_aspace_page_get(lwp->aspace, dst_iter_aligned, temp_page))
  864. break;
  865. memset(temp_page + (dst_iter - dst_iter_aligned), byte, bytes_to_put);
  866. if (rt_aspace_page_put(lwp->aspace, dst_iter_aligned, temp_page))
  867. break;
  868. dst_iter = dst_iter + bytes_to_put;
  869. size -= bytes_to_put;
  870. dst_next_page = dst_next_page + ARCH_PAGE_SIZE;
  871. copy_len += bytes_to_put;
  872. } while (dst_iter < dst_put_end);
  873. rt_pages_free(temp_page, 0);
  874. }
  875. return copy_len;
  876. }
  877. size_t lwp_user_strlen_ext(struct rt_lwp *lwp, const char *s)
  878. {
  879. int len = 0;
  880. char *temp_buf = RT_NULL;
  881. void *addr_start = RT_NULL;
  882. int get_bytes = 0;
  883. int index = 0;
  884. if (s == RT_NULL)
  885. return 0;
  886. if (lwp == RT_NULL)
  887. {
  888. LOG_W("%s: lwp is NULL", __func__);
  889. return -1;
  890. }
  891. addr_start = (void *)s;
  892. temp_buf = rt_pages_alloc_ext(0, PAGE_ANY_AVAILABLE);
  893. if (!temp_buf)
  894. {
  895. LOG_W("%s: No memory", __func__);
  896. return -1;
  897. }
  898. get_bytes = lwp_data_get(lwp, temp_buf, addr_start, ARCH_PAGE_SIZE);
  899. if (get_bytes == 0)
  900. {
  901. LOG_I("lwp_data_get(lwp=%p,dst=0x%lx,src=0x%lx,size=0x1000) failed", lwp, temp_buf, addr_start);
  902. rt_pages_free(temp_buf, 0);
  903. return -1;
  904. }
  905. while (temp_buf[index] != '\0')
  906. {
  907. len++;
  908. index++;
  909. if (index == get_bytes)
  910. {
  911. if (get_bytes == ARCH_PAGE_SIZE)
  912. {
  913. get_bytes = lwp_data_get(lwp, temp_buf, addr_start + len, ARCH_PAGE_SIZE);
  914. if (get_bytes == 0)
  915. {
  916. LOG_I("lwp_data_get(lwp=%p,dst=0x%lx,src=0x%lx,size=0x1000): user data unaccessible",
  917. lwp, temp_buf, addr_start);
  918. len = -1;
  919. break;
  920. }
  921. index = 0;
  922. }
  923. else
  924. {
  925. LOG_I("lwp_data_get(lwp=%p,dst=0x%lx,src=0x%lx,size=0x1000): user data unaccessible",
  926. lwp, temp_buf, addr_start);
  927. len = -1;
  928. break;
  929. }
  930. }
  931. }
  932. rt_pages_free(temp_buf, 0);
  933. return len;
  934. }
  935. size_t lwp_user_strlen(const char *s)
  936. {
  937. struct rt_lwp *lwp = RT_NULL;
  938. lwp = lwp_self();
  939. RT_ASSERT(lwp != RT_NULL);
  940. return lwp_user_strlen_ext(lwp, s);
  941. }
  942. size_t lwp_strlen(struct rt_lwp *lwp, const char *s)
  943. {
  944. if (lwp_in_user_space(s))
  945. return lwp_user_strlen_ext(lwp, s);
  946. else
  947. return strlen(s);
  948. }
  949. #endif