resource_kunit.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Test cases for API provided by resource.c and ioport.h
  4. */
  5. #include <kunit/test.h>
  6. #include <linux/ioport.h>
  7. #include <linux/kernel.h>
  8. #include <linux/string.h>
  9. #include <linux/sizes.h>
  10. #include <linux/mm.h>
  11. #define R0_START 0x0000
  12. #define R0_END 0xffff
  13. #define R1_START 0x1234
  14. #define R1_END 0x2345
  15. #define R2_START 0x4567
  16. #define R2_END 0x5678
  17. #define R3_START 0x6789
  18. #define R3_END 0x789a
  19. #define R4_START 0x2000
  20. #define R4_END 0x7000
  21. static struct resource r0 = { .start = R0_START, .end = R0_END };
  22. static struct resource r1 = { .start = R1_START, .end = R1_END };
  23. static struct resource r2 = { .start = R2_START, .end = R2_END };
  24. static struct resource r3 = { .start = R3_START, .end = R3_END };
  25. static struct resource r4 = { .start = R4_START, .end = R4_END };
  26. struct result {
  27. struct resource *r1;
  28. struct resource *r2;
  29. struct resource r;
  30. bool ret;
  31. };
  32. static struct result results_for_union[] = {
  33. {
  34. .r1 = &r1, .r2 = &r0, .r.start = R0_START, .r.end = R0_END, .ret = true,
  35. }, {
  36. .r1 = &r2, .r2 = &r0, .r.start = R0_START, .r.end = R0_END, .ret = true,
  37. }, {
  38. .r1 = &r3, .r2 = &r0, .r.start = R0_START, .r.end = R0_END, .ret = true,
  39. }, {
  40. .r1 = &r4, .r2 = &r0, .r.start = R0_START, .r.end = R0_END, .ret = true,
  41. }, {
  42. .r1 = &r2, .r2 = &r1, .ret = false,
  43. }, {
  44. .r1 = &r3, .r2 = &r1, .ret = false,
  45. }, {
  46. .r1 = &r4, .r2 = &r1, .r.start = R1_START, .r.end = R4_END, .ret = true,
  47. }, {
  48. .r1 = &r2, .r2 = &r3, .ret = false,
  49. }, {
  50. .r1 = &r2, .r2 = &r4, .r.start = R4_START, .r.end = R4_END, .ret = true,
  51. }, {
  52. .r1 = &r3, .r2 = &r4, .r.start = R4_START, .r.end = R3_END, .ret = true,
  53. },
  54. };
  55. static struct result results_for_intersection[] = {
  56. {
  57. .r1 = &r1, .r2 = &r0, .r.start = R1_START, .r.end = R1_END, .ret = true,
  58. }, {
  59. .r1 = &r2, .r2 = &r0, .r.start = R2_START, .r.end = R2_END, .ret = true,
  60. }, {
  61. .r1 = &r3, .r2 = &r0, .r.start = R3_START, .r.end = R3_END, .ret = true,
  62. }, {
  63. .r1 = &r4, .r2 = &r0, .r.start = R4_START, .r.end = R4_END, .ret = true,
  64. }, {
  65. .r1 = &r2, .r2 = &r1, .ret = false,
  66. }, {
  67. .r1 = &r3, .r2 = &r1, .ret = false,
  68. }, {
  69. .r1 = &r4, .r2 = &r1, .r.start = R4_START, .r.end = R1_END, .ret = true,
  70. }, {
  71. .r1 = &r2, .r2 = &r3, .ret = false,
  72. }, {
  73. .r1 = &r2, .r2 = &r4, .r.start = R2_START, .r.end = R2_END, .ret = true,
  74. }, {
  75. .r1 = &r3, .r2 = &r4, .r.start = R3_START, .r.end = R4_END, .ret = true,
  76. },
  77. };
  78. static void resource_do_test(struct kunit *test, bool ret, struct resource *r,
  79. bool exp_ret, struct resource *exp_r,
  80. struct resource *r1, struct resource *r2)
  81. {
  82. KUNIT_EXPECT_EQ_MSG(test, ret, exp_ret, "Resources %pR %pR", r1, r2);
  83. KUNIT_EXPECT_EQ_MSG(test, r->start, exp_r->start, "Start elements are not equal");
  84. KUNIT_EXPECT_EQ_MSG(test, r->end, exp_r->end, "End elements are not equal");
  85. }
  86. static void resource_do_union_test(struct kunit *test, struct result *r)
  87. {
  88. struct resource result;
  89. bool ret;
  90. memset(&result, 0, sizeof(result));
  91. ret = resource_union(r->r1, r->r2, &result);
  92. resource_do_test(test, ret, &result, r->ret, &r->r, r->r1, r->r2);
  93. memset(&result, 0, sizeof(result));
  94. ret = resource_union(r->r2, r->r1, &result);
  95. resource_do_test(test, ret, &result, r->ret, &r->r, r->r2, r->r1);
  96. }
  97. static void resource_test_union(struct kunit *test)
  98. {
  99. struct result *r = results_for_union;
  100. unsigned int i = 0;
  101. do {
  102. resource_do_union_test(test, &r[i]);
  103. } while (++i < ARRAY_SIZE(results_for_union));
  104. }
  105. static void resource_do_intersection_test(struct kunit *test, struct result *r)
  106. {
  107. struct resource result;
  108. bool ret;
  109. memset(&result, 0, sizeof(result));
  110. ret = resource_intersection(r->r1, r->r2, &result);
  111. resource_do_test(test, ret, &result, r->ret, &r->r, r->r1, r->r2);
  112. memset(&result, 0, sizeof(result));
  113. ret = resource_intersection(r->r2, r->r1, &result);
  114. resource_do_test(test, ret, &result, r->ret, &r->r, r->r2, r->r1);
  115. }
  116. static void resource_test_intersection(struct kunit *test)
  117. {
  118. struct result *r = results_for_intersection;
  119. unsigned int i = 0;
  120. do {
  121. resource_do_intersection_test(test, &r[i]);
  122. } while (++i < ARRAY_SIZE(results_for_intersection));
  123. }
  124. /*
  125. * The test resource tree for region_intersects() test:
  126. *
  127. * BASE-BASE+1M-1 : Test System RAM 0
  128. * # hole 0 (BASE+1M-BASE+2M)
  129. * BASE+2M-BASE+3M-1 : Test CXL Window 0
  130. * BASE+3M-BASE+4M-1 : Test System RAM 1
  131. * BASE+4M-BASE+7M-1 : Test CXL Window 1
  132. * BASE+4M-BASE+5M-1 : Test System RAM 2
  133. * BASE+4M+128K-BASE+4M+256K-1: Test Code
  134. * BASE+5M-BASE+6M-1 : Test System RAM 3
  135. */
  136. #define RES_TEST_RAM0_OFFSET 0
  137. #define RES_TEST_RAM0_SIZE SZ_1M
  138. #define RES_TEST_HOLE0_OFFSET (RES_TEST_RAM0_OFFSET + RES_TEST_RAM0_SIZE)
  139. #define RES_TEST_HOLE0_SIZE SZ_1M
  140. #define RES_TEST_WIN0_OFFSET (RES_TEST_HOLE0_OFFSET + RES_TEST_HOLE0_SIZE)
  141. #define RES_TEST_WIN0_SIZE SZ_1M
  142. #define RES_TEST_RAM1_OFFSET (RES_TEST_WIN0_OFFSET + RES_TEST_WIN0_SIZE)
  143. #define RES_TEST_RAM1_SIZE SZ_1M
  144. #define RES_TEST_WIN1_OFFSET (RES_TEST_RAM1_OFFSET + RES_TEST_RAM1_SIZE)
  145. #define RES_TEST_WIN1_SIZE (SZ_1M * 3)
  146. #define RES_TEST_RAM2_OFFSET RES_TEST_WIN1_OFFSET
  147. #define RES_TEST_RAM2_SIZE SZ_1M
  148. #define RES_TEST_CODE_OFFSET (RES_TEST_RAM2_OFFSET + SZ_128K)
  149. #define RES_TEST_CODE_SIZE SZ_128K
  150. #define RES_TEST_RAM3_OFFSET (RES_TEST_RAM2_OFFSET + RES_TEST_RAM2_SIZE)
  151. #define RES_TEST_RAM3_SIZE SZ_1M
  152. #define RES_TEST_TOTAL_SIZE ((RES_TEST_WIN1_OFFSET + RES_TEST_WIN1_SIZE))
  153. KUNIT_DEFINE_ACTION_WRAPPER(kfree_wrapper, kfree, const void *);
  154. static void remove_free_resource(void *ctx)
  155. {
  156. struct resource *res = (struct resource *)ctx;
  157. remove_resource(res);
  158. kfree(res);
  159. }
  160. static void resource_test_add_action_or_abort(
  161. struct kunit *test, void (*action)(void *), void *ctx)
  162. {
  163. KUNIT_ASSERT_EQ_MSG(test, 0,
  164. kunit_add_action_or_reset(test, action, ctx),
  165. "Fail to add action");
  166. }
  167. static void resource_test_request_region(struct kunit *test, struct resource *parent,
  168. resource_size_t start, resource_size_t size,
  169. const char *name, unsigned long flags)
  170. {
  171. struct resource *res;
  172. res = __request_region(parent, start, size, name, flags);
  173. KUNIT_ASSERT_NOT_NULL(test, res);
  174. resource_test_add_action_or_abort(test, remove_free_resource, res);
  175. }
  176. static void resource_test_insert_resource(struct kunit *test, struct resource *parent,
  177. resource_size_t start, resource_size_t size,
  178. const char *name, unsigned long flags)
  179. {
  180. struct resource *res;
  181. res = kzalloc(sizeof(*res), GFP_KERNEL);
  182. KUNIT_ASSERT_NOT_NULL(test, res);
  183. res->name = name;
  184. res->start = start;
  185. res->end = start + size - 1;
  186. res->flags = flags;
  187. if (insert_resource(parent, res)) {
  188. resource_test_add_action_or_abort(test, kfree_wrapper, res);
  189. KUNIT_FAIL_AND_ABORT(test, "Fail to insert resource %pR\n", res);
  190. }
  191. resource_test_add_action_or_abort(test, remove_free_resource, res);
  192. }
  193. static void resource_test_region_intersects(struct kunit *test)
  194. {
  195. unsigned long flags = IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY;
  196. struct resource *parent;
  197. resource_size_t start;
  198. /* Find an iomem_resource hole to hold test resources */
  199. parent = alloc_free_mem_region(&iomem_resource, RES_TEST_TOTAL_SIZE, SZ_1M,
  200. "test resources");
  201. KUNIT_ASSERT_NOT_ERR_OR_NULL(test, parent);
  202. start = parent->start;
  203. resource_test_add_action_or_abort(test, remove_free_resource, parent);
  204. resource_test_request_region(test, parent, start + RES_TEST_RAM0_OFFSET,
  205. RES_TEST_RAM0_SIZE, "Test System RAM 0", flags);
  206. resource_test_insert_resource(test, parent, start + RES_TEST_WIN0_OFFSET,
  207. RES_TEST_WIN0_SIZE, "Test CXL Window 0",
  208. IORESOURCE_MEM);
  209. resource_test_request_region(test, parent, start + RES_TEST_RAM1_OFFSET,
  210. RES_TEST_RAM1_SIZE, "Test System RAM 1", flags);
  211. resource_test_insert_resource(test, parent, start + RES_TEST_WIN1_OFFSET,
  212. RES_TEST_WIN1_SIZE, "Test CXL Window 1",
  213. IORESOURCE_MEM);
  214. resource_test_request_region(test, parent, start + RES_TEST_RAM2_OFFSET,
  215. RES_TEST_RAM2_SIZE, "Test System RAM 2", flags);
  216. resource_test_insert_resource(test, parent, start + RES_TEST_CODE_OFFSET,
  217. RES_TEST_CODE_SIZE, "Test Code", flags);
  218. resource_test_request_region(test, parent, start + RES_TEST_RAM3_OFFSET,
  219. RES_TEST_RAM3_SIZE, "Test System RAM 3", flags);
  220. kunit_release_action(test, remove_free_resource, parent);
  221. KUNIT_EXPECT_EQ(test, REGION_INTERSECTS,
  222. region_intersects(start + RES_TEST_RAM0_OFFSET, PAGE_SIZE,
  223. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  224. KUNIT_EXPECT_EQ(test, REGION_INTERSECTS,
  225. region_intersects(start + RES_TEST_RAM0_OFFSET +
  226. RES_TEST_RAM0_SIZE - PAGE_SIZE, 2 * PAGE_SIZE,
  227. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  228. KUNIT_EXPECT_EQ(test, REGION_DISJOINT,
  229. region_intersects(start + RES_TEST_HOLE0_OFFSET, PAGE_SIZE,
  230. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  231. KUNIT_EXPECT_EQ(test, REGION_DISJOINT,
  232. region_intersects(start + RES_TEST_HOLE0_OFFSET +
  233. RES_TEST_HOLE0_SIZE - PAGE_SIZE, 2 * PAGE_SIZE,
  234. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  235. KUNIT_EXPECT_EQ(test, REGION_MIXED,
  236. region_intersects(start + RES_TEST_WIN0_OFFSET +
  237. RES_TEST_WIN0_SIZE - PAGE_SIZE, 2 * PAGE_SIZE,
  238. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  239. KUNIT_EXPECT_EQ(test, REGION_INTERSECTS,
  240. region_intersects(start + RES_TEST_RAM1_OFFSET +
  241. RES_TEST_RAM1_SIZE - PAGE_SIZE, 2 * PAGE_SIZE,
  242. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  243. KUNIT_EXPECT_EQ(test, REGION_INTERSECTS,
  244. region_intersects(start + RES_TEST_RAM2_OFFSET +
  245. RES_TEST_RAM2_SIZE - PAGE_SIZE, 2 * PAGE_SIZE,
  246. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  247. KUNIT_EXPECT_EQ(test, REGION_INTERSECTS,
  248. region_intersects(start + RES_TEST_CODE_OFFSET, PAGE_SIZE,
  249. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  250. KUNIT_EXPECT_EQ(test, REGION_INTERSECTS,
  251. region_intersects(start + RES_TEST_RAM2_OFFSET,
  252. RES_TEST_RAM2_SIZE + PAGE_SIZE,
  253. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  254. KUNIT_EXPECT_EQ(test, REGION_MIXED,
  255. region_intersects(start + RES_TEST_RAM3_OFFSET,
  256. RES_TEST_RAM3_SIZE + PAGE_SIZE,
  257. IORESOURCE_SYSTEM_RAM, IORES_DESC_NONE));
  258. }
  259. static struct kunit_case resource_test_cases[] = {
  260. KUNIT_CASE(resource_test_union),
  261. KUNIT_CASE(resource_test_intersection),
  262. KUNIT_CASE(resource_test_region_intersects),
  263. {}
  264. };
  265. static struct kunit_suite resource_test_suite = {
  266. .name = "resource",
  267. .test_cases = resource_test_cases,
  268. };
  269. kunit_test_suite(resource_test_suite);
  270. MODULE_DESCRIPTION("I/O Port & Memory Resource manager unit tests");
  271. MODULE_LICENSE("GPL");