mmu.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492
  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. * 2021-01-30 lizhirui first version
  9. * 2022-12-13 WangXiaoyao Port to new mm
  10. */
  11. #include <rtthread.h>
  12. #include <stddef.h>
  13. #include <stdint.h>
  14. #define DBG_TAG "hw.mmu"
  15. #define DBG_LVL DBG_INFO
  16. #include <rtdbg.h>
  17. #include <board.h>
  18. #include <cache.h>
  19. #include <mm_aspace.h>
  20. #include <mm_page.h>
  21. #include <mmu.h>
  22. #include <riscv_mmu.h>
  23. #include <tlb.h>
  24. #ifdef RT_USING_SMART
  25. #include <board.h>
  26. #include <ioremap.h>
  27. #include <lwp_user_mm.h>
  28. #endif
  29. #ifndef RT_USING_SMART
  30. #define USER_VADDR_START 0
  31. #endif
  32. static size_t _unmap_area(struct rt_aspace *aspace, void *v_addr, size_t size);
  33. static void *current_mmu_table = RT_NULL;
  34. volatile __attribute__((aligned(4 * 1024)))
  35. rt_ubase_t MMUTable[__SIZE(VPN2_BIT)];
  36. void rt_hw_aspace_switch(rt_aspace_t aspace)
  37. {
  38. uintptr_t page_table = (uintptr_t)rt_kmem_v2p(aspace->page_table);
  39. current_mmu_table = aspace->page_table;
  40. write_csr(satp, (((size_t)SATP_MODE) << SATP_MODE_OFFSET) |
  41. ((rt_ubase_t)page_table >> PAGE_OFFSET_BIT));
  42. rt_hw_tlb_invalidate_all_local();
  43. }
  44. void *rt_hw_mmu_tbl_get()
  45. {
  46. return current_mmu_table;
  47. }
  48. static int _map_one_page(struct rt_aspace *aspace, void *va, void *pa,
  49. size_t attr)
  50. {
  51. rt_size_t l1_off, l2_off, l3_off;
  52. rt_size_t *mmu_l1, *mmu_l2, *mmu_l3;
  53. l1_off = GET_L1((size_t)va);
  54. l2_off = GET_L2((size_t)va);
  55. l3_off = GET_L3((size_t)va);
  56. mmu_l1 = ((rt_size_t *)aspace->page_table) + l1_off;
  57. if (PTE_USED(*mmu_l1))
  58. {
  59. mmu_l2 = (rt_size_t *)PPN_TO_VPN(GET_PADDR(*mmu_l1), PV_OFFSET);
  60. }
  61. else
  62. {
  63. mmu_l2 = (rt_size_t *)rt_pages_alloc(0);
  64. if (mmu_l2)
  65. {
  66. rt_memset(mmu_l2, 0, PAGE_SIZE);
  67. rt_hw_cpu_dcache_clean(mmu_l2, PAGE_SIZE);
  68. *mmu_l1 = COMBINEPTE((rt_size_t)VPN_TO_PPN(mmu_l2, PV_OFFSET),
  69. PAGE_DEFAULT_ATTR_NEXT);
  70. rt_hw_cpu_dcache_clean(mmu_l1, sizeof(*mmu_l1));
  71. }
  72. else
  73. {
  74. return -1;
  75. }
  76. }
  77. if (PTE_USED(*(mmu_l2 + l2_off)))
  78. {
  79. RT_ASSERT(!PAGE_IS_LEAF(*(mmu_l2 + l2_off)));
  80. mmu_l3 =
  81. (rt_size_t *)PPN_TO_VPN(GET_PADDR(*(mmu_l2 + l2_off)), PV_OFFSET);
  82. }
  83. else
  84. {
  85. mmu_l3 = (rt_size_t *)rt_pages_alloc(0);
  86. if (mmu_l3)
  87. {
  88. rt_memset(mmu_l3, 0, PAGE_SIZE);
  89. rt_hw_cpu_dcache_clean(mmu_l3, PAGE_SIZE);
  90. *(mmu_l2 + l2_off) =
  91. COMBINEPTE((rt_size_t)VPN_TO_PPN(mmu_l3, PV_OFFSET),
  92. PAGE_DEFAULT_ATTR_NEXT);
  93. rt_hw_cpu_dcache_clean(mmu_l2, sizeof(*mmu_l2));
  94. // declares a reference to parent page table
  95. rt_page_ref_inc((void *)mmu_l2, 0);
  96. }
  97. else
  98. {
  99. return -1;
  100. }
  101. }
  102. RT_ASSERT(!PTE_USED(*(mmu_l3 + l3_off)));
  103. // declares a reference to parent page table
  104. rt_page_ref_inc((void *)mmu_l3, 0);
  105. *(mmu_l3 + l3_off) = COMBINEPTE((rt_size_t)pa, attr);
  106. rt_hw_cpu_dcache_clean(mmu_l3 + l3_off, sizeof(*(mmu_l3 + l3_off)));
  107. return 0;
  108. }
  109. /** rt_hw_mmu_map will never override existed page table entry */
  110. void *rt_hw_mmu_map(struct rt_aspace *aspace, void *v_addr, void *p_addr,
  111. size_t size, size_t attr)
  112. {
  113. int ret = -1;
  114. void *unmap_va = v_addr;
  115. size_t npages = size >> ARCH_PAGE_SHIFT;
  116. // TODO trying with HUGEPAGE here
  117. while (npages--)
  118. {
  119. MM_PGTBL_LOCK(aspace);
  120. ret = _map_one_page(aspace, v_addr, p_addr, attr);
  121. MM_PGTBL_UNLOCK(aspace);
  122. if (ret != 0)
  123. {
  124. /* error, undo map */
  125. while (unmap_va != v_addr)
  126. {
  127. MM_PGTBL_LOCK(aspace);
  128. _unmap_area(aspace, unmap_va, ARCH_PAGE_SIZE);
  129. MM_PGTBL_UNLOCK(aspace);
  130. unmap_va += ARCH_PAGE_SIZE;
  131. }
  132. break;
  133. }
  134. v_addr += ARCH_PAGE_SIZE;
  135. p_addr += ARCH_PAGE_SIZE;
  136. }
  137. if (ret == 0)
  138. {
  139. return unmap_va;
  140. }
  141. return NULL;
  142. }
  143. static void _unmap_pte(rt_size_t *pentry, rt_size_t *lvl_entry[], int level)
  144. {
  145. int loop_flag = 1;
  146. while (loop_flag)
  147. {
  148. loop_flag = 0;
  149. *pentry = 0;
  150. rt_hw_cpu_dcache_clean(pentry, sizeof(*pentry));
  151. // we don't handle level 0, which is maintained by caller
  152. if (level > 0)
  153. {
  154. void *page = (void *)((rt_ubase_t)pentry & ~ARCH_PAGE_MASK);
  155. // decrease reference from child page to parent
  156. rt_pages_free(page, 0);
  157. int free = rt_page_ref_get(page, 0);
  158. if (free == 1)
  159. {
  160. rt_pages_free(page, 0);
  161. pentry = lvl_entry[--level];
  162. loop_flag = 1;
  163. }
  164. }
  165. }
  166. }
  167. static size_t _unmap_area(struct rt_aspace *aspace, void *v_addr, size_t size)
  168. {
  169. rt_size_t loop_va = __UMASKVALUE((rt_size_t)v_addr, PAGE_OFFSET_MASK);
  170. size_t unmapped = 0;
  171. int i = 0;
  172. rt_size_t lvl_off[3];
  173. rt_size_t *lvl_entry[3];
  174. lvl_off[0] = (rt_size_t)GET_L1(loop_va);
  175. lvl_off[1] = (rt_size_t)GET_L2(loop_va);
  176. lvl_off[2] = (rt_size_t)GET_L3(loop_va);
  177. unmapped = 1 << (ARCH_PAGE_SHIFT + ARCH_INDEX_WIDTH * 2ul);
  178. rt_size_t *pentry;
  179. lvl_entry[i] = ((rt_size_t *)aspace->page_table + lvl_off[i]);
  180. pentry = lvl_entry[i];
  181. // find leaf page table entry
  182. while (PTE_USED(*pentry) && !PAGE_IS_LEAF(*pentry))
  183. {
  184. i += 1;
  185. lvl_entry[i] = ((rt_size_t *)PPN_TO_VPN(GET_PADDR(*pentry), PV_OFFSET) +
  186. lvl_off[i]);
  187. pentry = lvl_entry[i];
  188. unmapped >>= ARCH_INDEX_WIDTH;
  189. }
  190. // clear PTE & setup its
  191. if (PTE_USED(*pentry))
  192. {
  193. _unmap_pte(pentry, lvl_entry, i);
  194. }
  195. return unmapped;
  196. }
  197. /** unmap is different from map that it can handle multiple pages */
  198. void rt_hw_mmu_unmap(struct rt_aspace *aspace, void *v_addr, size_t size)
  199. {
  200. // caller guarantee that v_addr & size are page aligned
  201. if (!aspace->page_table)
  202. {
  203. return;
  204. }
  205. size_t unmapped = 0;
  206. while (size > 0)
  207. {
  208. MM_PGTBL_LOCK(aspace);
  209. unmapped = _unmap_area(aspace, v_addr, size);
  210. MM_PGTBL_UNLOCK(aspace);
  211. // when unmapped == 0, region not exist in pgtbl
  212. if (!unmapped || unmapped > size)
  213. break;
  214. size -= unmapped;
  215. v_addr += unmapped;
  216. }
  217. }
  218. #ifdef RT_USING_SMART
  219. static inline void _init_region(void *vaddr, size_t size)
  220. {
  221. rt_ioremap_start = vaddr;
  222. rt_ioremap_size = size;
  223. rt_mpr_start = rt_ioremap_start - rt_mpr_size;
  224. LOG_D("rt_ioremap_start: %p, rt_mpr_start: %p", rt_ioremap_start, rt_mpr_start);
  225. }
  226. #else
  227. static inline void _init_region(void *vaddr, size_t size)
  228. {
  229. rt_mpr_start = vaddr - rt_mpr_size;
  230. }
  231. #endif
  232. int rt_hw_mmu_map_init(rt_aspace_t aspace, void *v_address, rt_size_t size,
  233. rt_size_t *vtable, rt_size_t pv_off)
  234. {
  235. size_t l1_off, va_s, va_e;
  236. rt_base_t level;
  237. if ((!aspace) || (!vtable))
  238. {
  239. return -1;
  240. }
  241. va_s = (rt_size_t)v_address;
  242. va_e = ((rt_size_t)v_address) + size - 1;
  243. if (va_e < va_s)
  244. {
  245. return -1;
  246. }
  247. // convert address to PPN2 index
  248. va_s = GET_L1(va_s);
  249. va_e = GET_L1(va_e);
  250. if (va_s == 0)
  251. {
  252. return -1;
  253. }
  254. // vtable initialization check
  255. for (l1_off = va_s; l1_off <= va_e; l1_off++)
  256. {
  257. size_t v = vtable[l1_off];
  258. if (v)
  259. {
  260. return -1;
  261. }
  262. }
  263. rt_aspace_init(&rt_kernel_space, (void *)0x1000, USER_VADDR_START - 0x1000,
  264. vtable);
  265. _init_region(v_address, size);
  266. return 0;
  267. }
  268. const static int max_level =
  269. (ARCH_VADDR_WIDTH - ARCH_PAGE_SHIFT) / ARCH_INDEX_WIDTH;
  270. static inline uintptr_t _get_level_size(int level)
  271. {
  272. return 1ul << (ARCH_PAGE_SHIFT + (max_level - level) * ARCH_INDEX_WIDTH);
  273. }
  274. static rt_size_t *_query(struct rt_aspace *aspace, void *vaddr, int *level)
  275. {
  276. rt_size_t l1_off, l2_off, l3_off;
  277. rt_size_t *mmu_l1, *mmu_l2, *mmu_l3;
  278. rt_size_t pa;
  279. l1_off = GET_L1((rt_size_t)vaddr);
  280. l2_off = GET_L2((rt_size_t)vaddr);
  281. l3_off = GET_L3((rt_size_t)vaddr);
  282. if (!aspace)
  283. {
  284. LOG_W("%s: no aspace", __func__);
  285. return RT_NULL;
  286. }
  287. mmu_l1 = ((rt_size_t *)aspace->page_table) + l1_off;
  288. if (PTE_USED(*mmu_l1))
  289. {
  290. if (*mmu_l1 & PTE_XWR_MASK)
  291. {
  292. *level = 1;
  293. return mmu_l1;
  294. }
  295. mmu_l2 = (rt_size_t *)PPN_TO_VPN(GET_PADDR(*mmu_l1), PV_OFFSET);
  296. if (PTE_USED(*(mmu_l2 + l2_off)))
  297. {
  298. if (*(mmu_l2 + l2_off) & PTE_XWR_MASK)
  299. {
  300. *level = 2;
  301. return mmu_l2 + l2_off;
  302. }
  303. mmu_l3 = (rt_size_t *)PPN_TO_VPN(GET_PADDR(*(mmu_l2 + l2_off)),
  304. PV_OFFSET);
  305. if (PTE_USED(*(mmu_l3 + l3_off)))
  306. {
  307. *level = 3;
  308. return mmu_l3 + l3_off;
  309. }
  310. }
  311. }
  312. return RT_NULL;
  313. }
  314. void *rt_hw_mmu_v2p(struct rt_aspace *aspace, void *vaddr)
  315. {
  316. int level;
  317. uintptr_t *pte = _query(aspace, vaddr, &level);
  318. uintptr_t paddr;
  319. if (pte)
  320. {
  321. paddr = GET_PADDR(*pte);
  322. paddr |= ((intptr_t)vaddr & (_get_level_size(level) - 1));
  323. }
  324. else
  325. {
  326. paddr = (uintptr_t)ARCH_MAP_FAILED;
  327. }
  328. return (void *)paddr;
  329. }
  330. static int _noncache(uintptr_t *pte)
  331. {
  332. return 0;
  333. }
  334. static int _cache(uintptr_t *pte)
  335. {
  336. return 0;
  337. }
  338. static int (*control_handler[MMU_CNTL_DUMMY_END])(uintptr_t *pte) = {
  339. [MMU_CNTL_CACHE] = _cache,
  340. [MMU_CNTL_NONCACHE] = _noncache,
  341. };
  342. int rt_hw_mmu_control(struct rt_aspace *aspace, void *vaddr, size_t size,
  343. enum rt_mmu_cntl cmd)
  344. {
  345. int level;
  346. int err = -RT_EINVAL;
  347. void *vend = vaddr + size;
  348. int (*handler)(uintptr_t * pte);
  349. if (cmd >= 0 && cmd < MMU_CNTL_DUMMY_END)
  350. {
  351. handler = control_handler[cmd];
  352. while (vaddr < vend)
  353. {
  354. uintptr_t *pte = _query(aspace, vaddr, &level);
  355. void *range_end = vaddr + _get_level_size(level);
  356. RT_ASSERT(range_end <= vend);
  357. if (pte)
  358. {
  359. err = handler(pte);
  360. RT_ASSERT(err == RT_EOK);
  361. }
  362. vaddr = range_end;
  363. }
  364. }
  365. else
  366. {
  367. err = -RT_ENOSYS;
  368. }
  369. return err;
  370. }
  371. /**
  372. * @brief setup Page Table for kernel space. It's a fixed map
  373. * and all mappings cannot be changed after initialization.
  374. *
  375. * Memory region in struct mem_desc must be page aligned,
  376. * otherwise is a failure and no report will be
  377. * returned.
  378. *
  379. * @param aspace
  380. * @param mdesc
  381. * @param desc_nr
  382. */
  383. void rt_hw_mmu_setup(rt_aspace_t aspace, struct mem_desc *mdesc, int desc_nr)
  384. {
  385. void *err;
  386. for (size_t i = 0; i < desc_nr; i++)
  387. {
  388. size_t attr;
  389. switch (mdesc->attr)
  390. {
  391. case NORMAL_MEM:
  392. attr = MMU_MAP_K_RWCB;
  393. break;
  394. case NORMAL_NOCACHE_MEM:
  395. attr = MMU_MAP_K_RWCB;
  396. break;
  397. case DEVICE_MEM:
  398. attr = MMU_MAP_K_DEVICE;
  399. break;
  400. default:
  401. attr = MMU_MAP_K_DEVICE;
  402. }
  403. struct rt_mm_va_hint hint = {.flags = MMF_MAP_FIXED,
  404. .limit_start = aspace->start,
  405. .limit_range_size = aspace->size,
  406. .map_size = mdesc->vaddr_end -
  407. mdesc->vaddr_start + 1,
  408. .prefer = (void *)mdesc->vaddr_start};
  409. if (mdesc->paddr_start == (rt_size_t)ARCH_MAP_FAILED)
  410. mdesc->paddr_start = mdesc->vaddr_start + PV_OFFSET;
  411. rt_aspace_map_phy_static(aspace, &mdesc->varea, &hint, attr,
  412. mdesc->paddr_start >> MM_PAGE_SHIFT, &err);
  413. mdesc++;
  414. }
  415. rt_hw_aspace_switch(&rt_kernel_space);
  416. rt_page_cleanup();
  417. }