test_aspace_api.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346
  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. * 2023-03-20 WangXiaoyao Complete testcase for mm_aspace.c
  9. */
  10. #ifndef __TEST_ASPACE_API_H__
  11. #define __TEST_ASPACE_API_H__
  12. #include "common.h"
  13. #include "test_aspace_api_internal.h"
  14. #include "test_synchronization.h"
  15. /**
  16. * @brief API for aspace create/destroy
  17. *
  18. * rt_aspace_t rt_aspace_create(void *start, rt_size_t length, void *pgtbl);
  19. * rt_aspace_t rt_aspace_init(rt_aspace_t aspace, void *start, rt_size_t length, void *pgtbl);
  20. * void rt_aspace_delete(rt_aspace_t aspace);
  21. * void rt_aspace_detach(rt_aspace_t aspace);
  22. *
  23. * the init & detach is covered by create & detach
  24. */
  25. static void aspace_create_tc(void)
  26. {
  27. /* test robustness, detect failure and recover status of overall system */
  28. rt_aspace_t aspace;
  29. CONSIST_HEAP(aspace = rt_aspace_create((void *)(0 - 0x1000), 0x1000, NULL));
  30. uassert_true(!aspace);
  31. }
  32. #if 1 /* make it clear to identify the block :) */
  33. /* for testing on _aspace_traverse */
  34. static void *_prev_end;
  35. static size_t _count;
  36. static int _test_increase(rt_varea_t varea, void *param)
  37. {
  38. uassert_true(varea->start >= _prev_end);
  39. _prev_end = varea->start + varea->size;
  40. _count += 1;
  41. return 0;
  42. }
  43. #endif
  44. static void aspace_delete_tc(void)
  45. {
  46. /**
  47. * @brief Requirements: delete should recycle all types of vareas properly inside
  48. * and release the resource allocated for it
  49. */
  50. rt_aspace_t aspace;
  51. struct rt_mm_va_hint hint = {.flags = 0,
  52. .map_size = 0x1000,
  53. .prefer = 0};
  54. struct rt_varea varea_phy;
  55. struct rt_varea varea_mobj;
  56. void *pgtbl;
  57. void *vaddr;
  58. /* compatible to armv7a */
  59. pgtbl = rt_pages_alloc(2);
  60. uassert_true(!!pgtbl); /* page must be usable */
  61. rt_memset(pgtbl, 0, ARCH_PAGE_SIZE);
  62. CONSIST_HEAP({
  63. aspace = rt_aspace_create((void *)USER_VADDR_START, USER_VADDR_TOP - USER_VADDR_START, pgtbl);
  64. uassert_true(!!aspace);
  65. /* insert 4 types of vareas into this aspace */
  66. hint.limit_start = aspace->start;
  67. hint.limit_range_size = aspace->size;
  68. uassert_true(!rt_aspace_map_phy(aspace, &hint, MMU_MAP_K_RWCB, 0, &vaddr));
  69. uassert_true(!rt_aspace_map_phy_static(aspace, &varea_phy, &hint, MMU_MAP_K_RWCB, 0, &vaddr));
  70. uassert_true(!rt_aspace_map(aspace, &vaddr, 0x1000, MMU_MAP_K_RWCB, 0, &rt_mm_dummy_mapper, 0));
  71. uassert_true(!rt_aspace_map_static(aspace, &varea_mobj, &vaddr, 0x1000, MMU_MAP_K_RWCB, 0, &rt_mm_dummy_mapper, 0));
  72. /* for testing on _aspace_traverse */
  73. _count = 0;
  74. _prev_end = 0;
  75. uassert_true(!rt_aspace_traversal(aspace, _test_increase, 0));
  76. /* ensure the mapping is done */
  77. uassert_true(_count == 4);
  78. rt_aspace_delete(aspace);
  79. uassert_true(rt_pages_free(pgtbl, 2) == 1); /* page free must success */
  80. });
  81. }
  82. /**
  83. * @brief Memory Map on Virtual Address Space to Mappable Object
  84. * int rt_aspace_map(rt_aspace_t aspace, void **addr, rt_size_t length, rt_size_t attr,
  85. * mm_flag_t flags, rt_mem_obj_t mem_obj, rt_size_t offset);
  86. * int rt_aspace_map_static(rt_aspace_t aspace, rt_varea_t varea, void **addr,
  87. * rt_size_t length, rt_size_t attr, mm_flag_t flags,
  88. * rt_mem_obj_t mem_obj, rt_size_t offset);
  89. */
  90. static void aspace_map_tc(void)
  91. {
  92. /**
  93. * @brief Requirement:
  94. * Robustness, filter out invalid input
  95. */
  96. void *vaddr = RT_NULL;
  97. uassert_true(rt_aspace_map(0, &vaddr, 0x1000, MMU_MAP_K_RWCB, 0, &rt_mm_dummy_mapper, 0));
  98. uassert_true(vaddr == RT_NULL);
  99. vaddr = (void *)USER_VADDR_START;
  100. uassert_true(rt_aspace_map(&rt_kernel_space, &vaddr, 0x1000, MMU_MAP_K_RWCB, 0, &rt_mm_dummy_mapper, 0));
  101. uassert_true(vaddr == RT_NULL);
  102. uassert_true(rt_aspace_map(&rt_kernel_space, &vaddr, 0x1000, MMU_MAP_K_RWCB, -1, &rt_mm_dummy_mapper, 0));
  103. uassert_true(vaddr == RT_NULL);
  104. /**
  105. * @brief Requirement:
  106. * in _rt_aspace_map:_varea_install
  107. * not covering an existed varea if a named mapping is mandatory
  108. */
  109. vaddr = (void *)((rt_ubase_t)aspace_map_tc & ~ARCH_PAGE_MASK);
  110. CONSIST_HEAP(
  111. uassert_true(
  112. rt_aspace_map(&rt_kernel_space, &vaddr, 0x1000, MMU_MAP_K_RWCB, MMF_MAP_FIXED, &rt_mm_dummy_mapper, 0)));
  113. uassert_true(vaddr == RT_NULL);
  114. /**
  115. * @brief Requirement:
  116. * in _rt_aspace_map:_varea_install:_find_free
  117. * verify that this routine can choose a free region with specified size
  118. * and specified alignment requirement
  119. */
  120. #define ALIGN_REQ (0x04000000)
  121. CONSIST_HEAP({
  122. uassert_true(!rt_aspace_map(&rt_kernel_space, &vaddr, 0x1000, MMU_MAP_K_RWCB, MMF_CREATE(0, ALIGN_REQ), &rt_mm_dummy_mapper, 0));
  123. uassert_true(!((rt_ubase_t)vaddr & (ALIGN_REQ - 1)));
  124. rt_aspace_unmap(&rt_kernel_space, vaddr);
  125. });
  126. /* test internal APIs */
  127. test_find_free();
  128. }
  129. /**
  130. * @brief Page frames mapping to varea
  131. * complete the page table on specified varea, and handle tlb maintenance
  132. * There are 2 variants of this API
  133. *
  134. * int rt_varea_map_page(rt_varea_t varea, void *vaddr, void *page);
  135. * int rt_varea_map_range(rt_varea_t varea, void *vaddr, void *paddr, rt_size_t length);
  136. */
  137. static rt_varea_t _create_varea(const size_t size)
  138. {
  139. rt_varea_t varea;
  140. void *vaddr = rt_ioremap_start;
  141. varea = rt_malloc(sizeof(*varea));
  142. uassert_true(!!varea);
  143. uassert_true(!rt_aspace_map_static(&rt_kernel_space, varea, &vaddr, size, MMU_MAP_K_RWCB, 0, &rt_mm_dummy_mapper, 0));
  144. varea->flag &= ~MMF_STATIC_ALLOC;
  145. uassert_true(!!vaddr);
  146. return varea;
  147. }
  148. static void test_varea_map_page(void)
  149. {
  150. /**
  151. * @brief rt_varea_map_page
  152. * Requirements: complete the page table entry
  153. */
  154. const size_t buf_sz = 4 * ARCH_PAGE_SIZE;
  155. rt_varea_t varea = _create_varea(buf_sz);
  156. for (size_t i = 0; i < buf_sz; i += ARCH_PAGE_SIZE)
  157. {
  158. void *page = rt_pages_alloc(0);
  159. uassert_true(!!page);
  160. uassert_true(!rt_varea_map_page(varea, varea->start + i, page));
  161. uassert_true(rt_kmem_v2p(varea->start + i) == (page + PV_OFFSET));
  162. /* let page manager handle the free of page */
  163. rt_varea_pgmgr_insert(varea, page);
  164. uassert_true(rt_kmem_v2p(varea->start + i) == (page + PV_OFFSET));
  165. }
  166. uassert_true(!rt_aspace_unmap(&rt_kernel_space, varea->start));
  167. }
  168. static void test_varea_map_range(void)
  169. {
  170. /**
  171. * @brief rt_varea_map_range
  172. * Requirements: complete the page table entry
  173. */
  174. const size_t buf_sz = 4 * ARCH_PAGE_SIZE;
  175. rt_varea_t varea = _create_varea(buf_sz);
  176. void *page = rt_pages_alloc(rt_page_bits(buf_sz));
  177. uassert_true(!!page);
  178. uassert_true(!rt_varea_map_range(varea, varea->start, page + PV_OFFSET, buf_sz));
  179. for (size_t i = 0; i < buf_sz; i += ARCH_PAGE_SIZE)
  180. {
  181. uassert_true(rt_kmem_v2p(varea->start + i) == (page + i + PV_OFFSET));
  182. }
  183. uassert_true(rt_pages_free(page, rt_page_bits(buf_sz)));
  184. uassert_true(!rt_aspace_unmap(&rt_kernel_space, varea->start));
  185. }
  186. /**
  187. * @brief rt_varea_unmap_page
  188. * Requirements: cancel the page table entry
  189. */
  190. static void test_varea_unmap_page(void)
  191. {
  192. /* Prepare environment */
  193. const size_t buf_sz = 4 * ARCH_PAGE_SIZE;
  194. rt_varea_t varea = _create_varea(buf_sz);
  195. for (size_t i = 0; i < buf_sz; i += ARCH_PAGE_SIZE)
  196. {
  197. void *page = rt_pages_alloc(0);
  198. uassert_true(!!page);
  199. uassert_true(!rt_varea_map_page(varea, varea->start + i, page));
  200. /* let page manager handle the free of page */
  201. rt_varea_pgmgr_insert(varea, page);
  202. uassert_true(rt_kmem_v2p(varea->start + i) == (page + PV_OFFSET));
  203. }
  204. /* test if unmap is success */
  205. for (size_t i = 0; i < buf_sz; i += ARCH_PAGE_SIZE)
  206. {
  207. uassert_true(rt_varea_unmap_page(varea, varea->start + i) == RT_EOK);
  208. uassert_true(rt_kmem_v2p(varea->start + i) == ARCH_MAP_FAILED);
  209. }
  210. uassert_true(!rt_aspace_unmap(&rt_kernel_space, varea->start));
  211. }
  212. /**
  213. * @brief rt_varea_map_range
  214. * Requirements: complete the page table entry
  215. */
  216. static void test_varea_unmap_range(void)
  217. {
  218. const size_t buf_sz = 4 * ARCH_PAGE_SIZE;
  219. rt_varea_t varea = _create_varea(buf_sz);
  220. void *page = rt_pages_alloc(rt_page_bits(buf_sz));
  221. uassert_true(!!page);
  222. uassert_true(!rt_varea_map_range(varea, varea->start, page + PV_OFFSET, buf_sz));
  223. for (size_t i = 0; i < buf_sz; i += ARCH_PAGE_SIZE)
  224. {
  225. uassert_true(rt_kmem_v2p(varea->start + i) == (page + i + PV_OFFSET));
  226. }
  227. /* test if unmap is success */
  228. uassert_true(rt_varea_unmap_range(varea, varea->start, buf_sz) == RT_EOK);
  229. for (size_t i = 0; i < buf_sz; i += ARCH_PAGE_SIZE)
  230. {
  231. uassert_true(rt_kmem_v2p(varea->start + i) == ARCH_MAP_FAILED);
  232. }
  233. uassert_true(rt_pages_free(page, rt_page_bits(buf_sz)));
  234. uassert_true(!rt_aspace_unmap(&rt_kernel_space, varea->start));
  235. }
  236. static void varea_map_tc(void)
  237. {
  238. CONSIST_HEAP(test_varea_map_page());
  239. CONSIST_HEAP(test_varea_map_range());
  240. CONSIST_HEAP(test_varea_unmap_page());
  241. CONSIST_HEAP(test_varea_unmap_range());
  242. }
  243. static void aspace_traversal_tc(void)
  244. {
  245. /**
  246. * @brief Requirement
  247. * Iterate over each varea in the kernel space
  248. */
  249. CONSIST_HEAP(aspace_delete_tc());
  250. uassert_true(4 == _count);
  251. }
  252. #ifdef ARCH_ARMV8
  253. static void aspace_control_tc(void)
  254. {
  255. /* this case is designed only for one page size */
  256. const size_t buf_sz = ARCH_PAGE_SIZE;
  257. void *vaddr = RT_NULL;
  258. volatile char *remap_nocache;
  259. int platform_cache_probe;
  260. uassert_true(!rt_aspace_map(&rt_kernel_space, &vaddr, 0x1000, MMU_MAP_K_RWCB, MMF_PREFETCH, &rt_mm_dummy_mapper, 0));
  261. uassert_true(!!vaddr);
  262. /* map non-cacheable region to verify cache */
  263. remap_nocache = rt_ioremap(rt_kmem_v2p(vaddr), buf_sz);
  264. uassert_true(!!remap_nocache);
  265. /* pre probing */
  266. rt_memset(vaddr, 0xba, buf_sz);
  267. /* no need to sync transaction on same core */
  268. platform_cache_probe = memtest(remap_nocache, 0xab, buf_sz);
  269. if (!platform_cache_probe)
  270. {
  271. LOG_I("Cannot distinguish cache attribution on current platform");
  272. }
  273. else
  274. {
  275. LOG_I("Ready to verify attribution of cached & non-cacheable");
  276. }
  277. /* verify cache */
  278. uassert_true(!rt_aspace_control(&rt_kernel_space, vaddr, MMU_CNTL_NONCACHE));
  279. rt_memset(vaddr, 0, buf_sz);
  280. uassert_true(!memtest(remap_nocache, 0, buf_sz));
  281. /* another option as MMU_CNTL_CACHE */
  282. uassert_true(!rt_aspace_control(&rt_kernel_space, vaddr, MMU_CNTL_CACHE));
  283. rt_iounmap(remap_nocache);
  284. uassert_true(!rt_aspace_unmap(&rt_kernel_space, vaddr));
  285. }
  286. #endif
  287. static void aspace_tc(void)
  288. {
  289. UTEST_UNIT_RUN(aspace_create_tc);
  290. UTEST_UNIT_RUN(aspace_delete_tc);
  291. UTEST_UNIT_RUN(aspace_map_tc);
  292. UTEST_UNIT_RUN(aspace_traversal_tc);
  293. #ifdef ARCH_ARMV8
  294. UTEST_UNIT_RUN(aspace_control_tc);
  295. #endif
  296. UTEST_UNIT_RUN(varea_map_tc);
  297. /* functionality */
  298. UTEST_UNIT_RUN(synchronization_tc);
  299. return ;
  300. }
  301. #endif /* __TEST_ASPACE_API_H__ */