1
0

lwp_user_mm.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657
  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. */
  14. #include <rtthread.h>
  15. #include <rthw.h>
  16. #include <string.h>
  17. #ifdef ARCH_MM_MMU
  18. #include <lwp.h>
  19. #include <lwp_arch.h>
  20. #include <lwp_mm.h>
  21. #include <lwp_user_mm.h>
  22. #include <mm_aspace.h>
  23. #include <mm_fault.h>
  24. #include <mm_flag.h>
  25. #include <mm_page.h>
  26. #include <mmu.h>
  27. #include <page.h>
  28. #define DBG_TAG "LwP"
  29. #define DBG_LVL DBG_LOG
  30. #include <rtdbg.h>
  31. static void _init_lwp_objs(struct rt_lwp_objs *lwp_objs, rt_aspace_t aspace);
  32. int lwp_user_space_init(struct rt_lwp *lwp, rt_bool_t is_fork)
  33. {
  34. int err = -RT_ENOMEM;
  35. lwp->lwp_obj = rt_malloc(sizeof(struct rt_lwp_objs));
  36. _init_lwp_objs(lwp->lwp_obj, lwp->aspace);
  37. if (lwp->lwp_obj)
  38. {
  39. err = arch_user_space_init(lwp);
  40. if (!is_fork && err == RT_EOK)
  41. {
  42. void *addr = (void *)USER_STACK_VSTART;
  43. err = rt_aspace_map(lwp->aspace, &addr,
  44. USER_STACK_VEND - USER_STACK_VSTART,
  45. MMU_MAP_U_RWCB, 0, &lwp->lwp_obj->mem_obj, 0);
  46. }
  47. }
  48. return err;
  49. }
  50. void lwp_aspace_switch(struct rt_thread *thread)
  51. {
  52. struct rt_lwp *lwp = RT_NULL;
  53. rt_aspace_t aspace;
  54. void *from_tbl;
  55. if (thread->lwp)
  56. {
  57. lwp = (struct rt_lwp *)thread->lwp;
  58. aspace = lwp->aspace;
  59. }
  60. else
  61. aspace = &rt_kernel_space;
  62. from_tbl = rt_hw_mmu_tbl_get();
  63. if (aspace->page_table != from_tbl)
  64. {
  65. rt_hw_aspace_switch(aspace);
  66. }
  67. }
  68. void lwp_unmap_user_space(struct rt_lwp *lwp)
  69. {
  70. rt_free(lwp->lwp_obj);
  71. rt_aspace_delete(lwp->aspace);
  72. arch_user_space_vtable_free(lwp);
  73. }
  74. static const char *user_get_name(rt_varea_t varea)
  75. {
  76. char *name;
  77. if (varea->flag & MMF_TEXT)
  78. {
  79. name = "user.text";
  80. }
  81. else
  82. {
  83. if (varea->start == (void *)USER_STACK_VSTART)
  84. {
  85. name = "user.stack";
  86. }
  87. else if (varea->start >= (void *)USER_HEAP_VADDR &&
  88. varea->start < (void *)USER_HEAP_VEND)
  89. {
  90. name = "user.heap";
  91. }
  92. else
  93. {
  94. name = "user.data";
  95. }
  96. }
  97. return name;
  98. }
  99. static void _user_do_page_fault(struct rt_varea *varea,
  100. struct rt_mm_fault_msg *msg)
  101. {
  102. struct rt_lwp_objs *lwp_objs;
  103. lwp_objs = rt_container_of(varea->mem_obj, struct rt_lwp_objs, mem_obj);
  104. if (lwp_objs->source)
  105. {
  106. void *paddr = rt_hw_mmu_v2p(lwp_objs->source, msg->vaddr);
  107. if (paddr != ARCH_MAP_FAILED)
  108. {
  109. void *vaddr;
  110. vaddr = paddr - PV_OFFSET;
  111. if (!(varea->flag & MMF_TEXT))
  112. {
  113. void *cp = rt_pages_alloc(0);
  114. if (cp)
  115. {
  116. memcpy(cp, vaddr, ARCH_PAGE_SIZE);
  117. rt_varea_insert_page(varea, cp);
  118. msg->response.status = MM_FAULT_STATUS_OK;
  119. msg->response.vaddr = cp;
  120. msg->response.size = ARCH_PAGE_SIZE;
  121. }
  122. else
  123. {
  124. LOG_W("%s: page alloc failed at %p", __func__,
  125. varea->start);
  126. }
  127. }
  128. else
  129. {
  130. rt_page_t page = rt_page_addr2page(vaddr);
  131. page->ref_cnt += 1;
  132. rt_varea_insert_page(varea, vaddr);
  133. msg->response.status = MM_FAULT_STATUS_OK;
  134. msg->response.vaddr = vaddr;
  135. msg->response.size = ARCH_PAGE_SIZE;
  136. }
  137. }
  138. else if (!(varea->flag & MMF_TEXT))
  139. {
  140. /* if data segment not exist in source do a fallback */
  141. rt_mm_dummy_mapper.on_page_fault(varea, msg);
  142. }
  143. }
  144. else /* if (!lwp_objs->source), no aspace as source data */
  145. {
  146. rt_mm_dummy_mapper.on_page_fault(varea, msg);
  147. }
  148. }
  149. static void _init_lwp_objs(struct rt_lwp_objs *lwp_objs, rt_aspace_t aspace)
  150. {
  151. lwp_objs->source = NULL;
  152. lwp_objs->mem_obj.get_name = user_get_name;
  153. lwp_objs->mem_obj.hint_free = NULL;
  154. lwp_objs->mem_obj.on_page_fault = _user_do_page_fault;
  155. lwp_objs->mem_obj.on_page_offload = rt_mm_dummy_mapper.on_page_offload;
  156. lwp_objs->mem_obj.on_varea_open = rt_mm_dummy_mapper.on_varea_open;
  157. lwp_objs->mem_obj.on_varea_close = rt_mm_dummy_mapper.on_varea_close;
  158. }
  159. static void *_lwp_map_user(struct rt_lwp *lwp, void *map_va, size_t map_size,
  160. int text)
  161. {
  162. void *va = map_va;
  163. int ret = 0;
  164. size_t flags = MMF_PREFETCH;
  165. if (text)
  166. flags |= MMF_TEXT;
  167. rt_mem_obj_t mem_obj = &lwp->lwp_obj->mem_obj;
  168. ret = rt_aspace_map(lwp->aspace, &va, map_size, MMU_MAP_U_RWCB, flags,
  169. mem_obj, 0);
  170. if (ret != RT_EOK)
  171. {
  172. va = RT_NULL;
  173. LOG_I("lwp_map_user: failed to map %lx with size %lx with errno %d", map_va,
  174. map_size, ret);
  175. }
  176. return va;
  177. }
  178. int lwp_unmap_user(struct rt_lwp *lwp, void *va)
  179. {
  180. int err;
  181. err = rt_aspace_unmap(lwp->aspace, va, 1);
  182. return err;
  183. }
  184. static void _dup_varea(rt_varea_t varea, struct rt_lwp *src_lwp,
  185. rt_aspace_t dst)
  186. {
  187. void *vaddr = varea->start;
  188. void *vend = vaddr + varea->size;
  189. if (vaddr < (void *)USER_STACK_VSTART || vaddr >= (void *)USER_STACK_VEND)
  190. {
  191. while (vaddr != vend)
  192. {
  193. void *paddr;
  194. paddr = lwp_v2p(src_lwp, vaddr);
  195. if (paddr != ARCH_MAP_FAILED)
  196. {
  197. rt_aspace_load_page(dst, vaddr, 1);
  198. }
  199. vaddr += ARCH_PAGE_SIZE;
  200. }
  201. }
  202. else
  203. {
  204. while (vaddr != vend)
  205. {
  206. vend -= ARCH_PAGE_SIZE;
  207. void *paddr;
  208. paddr = lwp_v2p(src_lwp, vend);
  209. if (paddr != ARCH_MAP_FAILED)
  210. {
  211. rt_aspace_load_page(dst, vend, 1);
  212. }
  213. else
  214. {
  215. break;
  216. }
  217. }
  218. }
  219. }
  220. int lwp_dup_user(rt_varea_t varea, void *arg)
  221. {
  222. int err;
  223. struct rt_lwp *self_lwp = lwp_self();
  224. struct rt_lwp *new_lwp = (struct rt_lwp *)arg;
  225. void *pa = RT_NULL;
  226. void *va = RT_NULL;
  227. rt_mem_obj_t mem_obj = varea->mem_obj;
  228. if (!mem_obj)
  229. {
  230. /* duplicate a physical mapping */
  231. pa = lwp_v2p(self_lwp, (void *)varea->start);
  232. RT_ASSERT(pa != ARCH_MAP_FAILED);
  233. struct rt_mm_va_hint hint = {.flags = MMF_MAP_FIXED,
  234. .limit_range_size = new_lwp->aspace->size,
  235. .limit_start = new_lwp->aspace->start,
  236. .prefer = varea->start,
  237. .map_size = varea->size};
  238. err = rt_aspace_map_phy(new_lwp->aspace, &hint, varea->attr,
  239. MM_PA_TO_OFF(pa), &va);
  240. if (err != RT_EOK)
  241. {
  242. LOG_W("%s: aspace map failed at %p with size %p", __func__,
  243. varea->start, varea->size);
  244. }
  245. }
  246. else
  247. {
  248. /* duplicate a mem_obj backing mapping */
  249. va = varea->start;
  250. err = rt_aspace_map(new_lwp->aspace, &va, varea->size, varea->attr,
  251. varea->flag, &new_lwp->lwp_obj->mem_obj,
  252. varea->offset);
  253. if (err != RT_EOK)
  254. {
  255. LOG_W("%s: aspace map failed at %p with size %p", __func__,
  256. varea->start, varea->size);
  257. }
  258. else
  259. {
  260. /* loading page frames for !MMF_PREFETCH varea */
  261. if (!(varea->flag & MMF_PREFETCH))
  262. {
  263. _dup_varea(varea, self_lwp, new_lwp->aspace);
  264. }
  265. }
  266. }
  267. if (va != (void *)varea->start)
  268. {
  269. return -1;
  270. }
  271. return 0;
  272. }
  273. int lwp_unmap_user_phy(struct rt_lwp *lwp, void *va)
  274. {
  275. return lwp_unmap_user(lwp, va);
  276. }
  277. void *lwp_map_user(struct rt_lwp *lwp, void *map_va, size_t map_size, int text)
  278. {
  279. void *ret = RT_NULL;
  280. size_t offset = 0;
  281. if (!map_size)
  282. {
  283. return 0;
  284. }
  285. offset = (size_t)map_va & ARCH_PAGE_MASK;
  286. map_size += (offset + ARCH_PAGE_SIZE - 1);
  287. map_size &= ~ARCH_PAGE_MASK;
  288. map_va = (void *)((size_t)map_va & ~ARCH_PAGE_MASK);
  289. ret = _lwp_map_user(lwp, map_va, map_size, text);
  290. if (ret)
  291. {
  292. ret = (void *)((char *)ret + offset);
  293. }
  294. return ret;
  295. }
  296. void *lwp_map_user_phy(struct rt_lwp *lwp, void *map_va, void *map_pa,
  297. size_t map_size, int cached)
  298. {
  299. int err;
  300. void *va;
  301. size_t offset = 0;
  302. if (!map_size)
  303. {
  304. return 0;
  305. }
  306. if (map_va)
  307. {
  308. if (((size_t)map_va & ARCH_PAGE_MASK) !=
  309. ((size_t)map_pa & ARCH_PAGE_MASK))
  310. {
  311. return 0;
  312. }
  313. }
  314. offset = (size_t)map_pa & ARCH_PAGE_MASK;
  315. map_size += (offset + ARCH_PAGE_SIZE - 1);
  316. map_size &= ~ARCH_PAGE_MASK;
  317. map_pa = (void *)((size_t)map_pa & ~ARCH_PAGE_MASK);
  318. struct rt_mm_va_hint hint = {.flags = MMF_MAP_FIXED,
  319. .limit_range_size = lwp->aspace->size,
  320. .limit_start = lwp->aspace->start,
  321. .prefer = map_va,
  322. .map_size = map_size};
  323. rt_size_t attr = cached ? MMU_MAP_U_RWCB : MMU_MAP_U_RW;
  324. err =
  325. rt_aspace_map_phy(lwp->aspace, &hint, attr, MM_PA_TO_OFF(map_pa), &va);
  326. if (err != RT_EOK)
  327. {
  328. va = RT_NULL;
  329. LOG_W("%s", __func__);
  330. }
  331. return va + offset;
  332. }
  333. rt_base_t lwp_brk(void *addr)
  334. {
  335. rt_base_t ret = -1;
  336. struct rt_lwp *lwp = RT_NULL;
  337. rt_mm_lock();
  338. lwp = rt_thread_self()->lwp;
  339. if ((size_t)addr <= lwp->end_heap)
  340. {
  341. ret = (rt_base_t)lwp->end_heap;
  342. }
  343. else
  344. {
  345. size_t size = 0;
  346. void *va = RT_NULL;
  347. if ((size_t)addr <= USER_HEAP_VEND)
  348. {
  349. size = (((size_t)addr - lwp->end_heap) + ARCH_PAGE_SIZE - 1) &
  350. ~ARCH_PAGE_MASK;
  351. va = lwp_map_user(lwp, (void *)lwp->end_heap, size, 0);
  352. }
  353. if (va)
  354. {
  355. lwp->end_heap += size;
  356. ret = lwp->end_heap;
  357. }
  358. }
  359. rt_mm_unlock();
  360. return ret;
  361. }
  362. #define MAP_ANONYMOUS 0x20
  363. void *lwp_mmap2(void *addr, size_t length, int prot, int flags, int fd,
  364. off_t pgoffset)
  365. {
  366. void *ret = (void *)-1;
  367. if (fd == -1)
  368. {
  369. ret = lwp_map_user(lwp_self(), addr, length, 0);
  370. if (ret)
  371. {
  372. if ((flags & MAP_ANONYMOUS) != 0)
  373. {
  374. rt_memset(ret, 0, length);
  375. }
  376. }
  377. else
  378. {
  379. ret = (void *)-1;
  380. }
  381. }
  382. else
  383. {
  384. struct dfs_fd *d;
  385. d = fd_get(fd);
  386. if (d && d->vnode->type == FT_DEVICE)
  387. {
  388. struct dfs_mmap2_args mmap2;
  389. mmap2.addr = addr;
  390. mmap2.length = length;
  391. mmap2.prot = prot;
  392. mmap2.flags = flags;
  393. mmap2.pgoffset = pgoffset;
  394. mmap2.ret = (void *)-1;
  395. if (dfs_file_mmap2(d, &mmap2) == 0)
  396. {
  397. ret = mmap2.ret;
  398. }
  399. }
  400. }
  401. return ret;
  402. }
  403. int lwp_munmap(void *addr)
  404. {
  405. int ret = 0;
  406. rt_mm_lock();
  407. ret = lwp_unmap_user(lwp_self(), addr);
  408. rt_mm_unlock();
  409. return ret;
  410. }
  411. size_t lwp_get_from_user(void *dst, void *src, size_t size)
  412. {
  413. struct rt_lwp *lwp = RT_NULL;
  414. /* check src */
  415. if (src < (void *)USER_VADDR_START)
  416. {
  417. return 0;
  418. }
  419. if (src >= (void *)USER_VADDR_TOP)
  420. {
  421. return 0;
  422. }
  423. if ((void *)((char *)src + size) > (void *)USER_VADDR_TOP)
  424. {
  425. return 0;
  426. }
  427. lwp = lwp_self();
  428. if (!lwp)
  429. {
  430. return 0;
  431. }
  432. return lwp_data_get(lwp, dst, src, size);
  433. }
  434. size_t lwp_put_to_user(void *dst, void *src, size_t size)
  435. {
  436. struct rt_lwp *lwp = RT_NULL;
  437. /* check dst */
  438. if (dst < (void *)USER_VADDR_START)
  439. {
  440. return 0;
  441. }
  442. if (dst >= (void *)USER_VADDR_TOP)
  443. {
  444. return 0;
  445. }
  446. if ((void *)((char *)dst + size) > (void *)USER_VADDR_TOP)
  447. {
  448. return 0;
  449. }
  450. lwp = lwp_self();
  451. if (!lwp)
  452. {
  453. return 0;
  454. }
  455. return lwp_data_put(lwp, dst, src, size);
  456. }
  457. int lwp_user_accessable(void *addr, size_t size)
  458. {
  459. void *addr_start = RT_NULL, *addr_end = RT_NULL, *next_page = RT_NULL;
  460. void *tmp_addr = RT_NULL;
  461. struct rt_lwp *lwp = lwp_self();
  462. if (!lwp)
  463. {
  464. return 0;
  465. }
  466. if (!size || !addr)
  467. {
  468. return 0;
  469. }
  470. addr_start = addr;
  471. addr_end = (void *)((char *)addr + size);
  472. #ifdef ARCH_RISCV64
  473. if (addr_start < (void *)USER_VADDR_START)
  474. {
  475. return 0;
  476. }
  477. #else
  478. if (addr_start >= (void *)USER_VADDR_TOP)
  479. {
  480. return 0;
  481. }
  482. if (addr_end > (void *)USER_VADDR_TOP)
  483. {
  484. return 0;
  485. }
  486. #endif
  487. next_page =
  488. (void *)(((size_t)addr_start + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  489. do
  490. {
  491. size_t len = (char *)next_page - (char *)addr_start;
  492. if (size < len)
  493. {
  494. len = size;
  495. }
  496. tmp_addr = lwp_v2p(lwp, addr_start);
  497. if (tmp_addr == ARCH_MAP_FAILED)
  498. {
  499. if ((rt_ubase_t)addr_start >= USER_STACK_VSTART && (rt_ubase_t)addr_start < USER_STACK_VEND)
  500. tmp_addr = *(void **)addr_start;
  501. else
  502. return 0;
  503. }
  504. addr_start = (void *)((char *)addr_start + len);
  505. size -= len;
  506. next_page = (void *)((char *)next_page + ARCH_PAGE_SIZE);
  507. } while (addr_start < addr_end);
  508. return 1;
  509. }
  510. /* src is in mmu_info space, dst is in current thread space */
  511. size_t lwp_data_get(struct rt_lwp *lwp, void *dst, void *src, size_t size)
  512. {
  513. size_t copy_len = 0;
  514. void *addr_start = RT_NULL, *addr_end = RT_NULL, *next_page = RT_NULL;
  515. void *tmp_dst = RT_NULL, *tmp_src = RT_NULL;
  516. if (!size || !dst)
  517. {
  518. return 0;
  519. }
  520. tmp_dst = dst;
  521. addr_start = src;
  522. addr_end = (void *)((char *)src + size);
  523. next_page =
  524. (void *)(((size_t)addr_start + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  525. do
  526. {
  527. size_t len = (char *)next_page - (char *)addr_start;
  528. if (size < len)
  529. {
  530. len = size;
  531. }
  532. tmp_src = lwp_v2p(lwp, addr_start);
  533. if (tmp_src == ARCH_MAP_FAILED)
  534. {
  535. break;
  536. }
  537. tmp_src = (void *)((char *)tmp_src - PV_OFFSET);
  538. rt_memcpy(tmp_dst, tmp_src, len);
  539. tmp_dst = (void *)((char *)tmp_dst + len);
  540. addr_start = (void *)((char *)addr_start + len);
  541. size -= len;
  542. next_page = (void *)((char *)next_page + ARCH_PAGE_SIZE);
  543. copy_len += len;
  544. } while (addr_start < addr_end);
  545. return copy_len;
  546. }
  547. /* dst is in kernel space, src is in current thread space */
  548. size_t lwp_data_put(struct rt_lwp *lwp, void *dst, void *src, size_t size)
  549. {
  550. size_t copy_len = 0;
  551. void *addr_start = RT_NULL, *addr_end = RT_NULL, *next_page = RT_NULL;
  552. void *tmp_dst = RT_NULL, *tmp_src = RT_NULL;
  553. if (!size || !dst)
  554. {
  555. return 0;
  556. }
  557. tmp_src = src;
  558. addr_start = dst;
  559. addr_end = (void *)((char *)dst + size);
  560. next_page =
  561. (void *)(((size_t)addr_start + ARCH_PAGE_SIZE) & ~(ARCH_PAGE_SIZE - 1));
  562. do
  563. {
  564. size_t len = (char *)next_page - (char *)addr_start;
  565. if (size < len)
  566. {
  567. len = size;
  568. }
  569. tmp_dst = lwp_v2p(lwp, addr_start);
  570. if (tmp_dst == ARCH_MAP_FAILED)
  571. {
  572. break;
  573. }
  574. tmp_dst = (void *)((char *)tmp_dst - PV_OFFSET);
  575. rt_memcpy(tmp_dst, tmp_src, len);
  576. tmp_src = (void *)((char *)tmp_src + len);
  577. addr_start = (void *)((char *)addr_start + len);
  578. size -= len;
  579. next_page = (void *)((char *)next_page + ARCH_PAGE_SIZE);
  580. copy_len += len;
  581. } while (addr_start < addr_end);
  582. return copy_len;
  583. }
  584. #endif