drm_mm_test.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Test cases for the drm_mm range manager
  4. *
  5. * Copyright (c) 2022 Arthur Grillo <arthur.grillo@usp.br>
  6. */
  7. #include <kunit/test.h>
  8. #include <linux/prime_numbers.h>
  9. #include <linux/slab.h>
  10. #include <linux/random.h>
  11. #include <linux/vmalloc.h>
  12. #include <linux/ktime.h>
  13. #include <drm/drm_mm.h>
  14. #include <drm/drm_print.h>
  15. #include "../lib/drm_random.h"
  16. enum {
  17. BEST,
  18. BOTTOMUP,
  19. TOPDOWN,
  20. EVICT,
  21. };
  22. static const struct insert_mode {
  23. const char *name;
  24. enum drm_mm_insert_mode mode;
  25. } insert_modes[] = {
  26. [BEST] = { "best", DRM_MM_INSERT_BEST },
  27. [BOTTOMUP] = { "bottom-up", DRM_MM_INSERT_LOW },
  28. [TOPDOWN] = { "top-down", DRM_MM_INSERT_HIGH },
  29. [EVICT] = { "evict", DRM_MM_INSERT_EVICT },
  30. {}
  31. };
  32. static bool assert_no_holes(struct kunit *test, const struct drm_mm *mm)
  33. {
  34. struct drm_mm_node *hole;
  35. u64 hole_start, __always_unused hole_end;
  36. unsigned long count;
  37. count = 0;
  38. drm_mm_for_each_hole(hole, mm, hole_start, hole_end)
  39. count++;
  40. if (count) {
  41. KUNIT_FAIL(test,
  42. "Expected to find no holes (after reserve), found %lu instead\n", count);
  43. return false;
  44. }
  45. drm_mm_for_each_node(hole, mm) {
  46. if (drm_mm_hole_follows(hole)) {
  47. KUNIT_FAIL(test, "Hole follows node, expected none!\n");
  48. return false;
  49. }
  50. }
  51. return true;
  52. }
  53. static bool assert_one_hole(struct kunit *test, const struct drm_mm *mm, u64 start, u64 end)
  54. {
  55. struct drm_mm_node *hole;
  56. u64 hole_start, hole_end;
  57. unsigned long count;
  58. bool ok = true;
  59. if (end <= start)
  60. return true;
  61. count = 0;
  62. drm_mm_for_each_hole(hole, mm, hole_start, hole_end) {
  63. if (start != hole_start || end != hole_end) {
  64. if (ok)
  65. KUNIT_FAIL(test,
  66. "empty mm has incorrect hole, found (%llx, %llx), expect (%llx, %llx)\n",
  67. hole_start, hole_end, start, end);
  68. ok = false;
  69. }
  70. count++;
  71. }
  72. if (count != 1) {
  73. KUNIT_FAIL(test, "Expected to find one hole, found %lu instead\n", count);
  74. ok = false;
  75. }
  76. return ok;
  77. }
  78. static u64 misalignment(struct drm_mm_node *node, u64 alignment)
  79. {
  80. u64 rem;
  81. if (!alignment)
  82. return 0;
  83. div64_u64_rem(node->start, alignment, &rem);
  84. return rem;
  85. }
  86. static bool assert_node(struct kunit *test, struct drm_mm_node *node, struct drm_mm *mm,
  87. u64 size, u64 alignment, unsigned long color)
  88. {
  89. bool ok = true;
  90. if (!drm_mm_node_allocated(node) || node->mm != mm) {
  91. KUNIT_FAIL(test, "node not allocated\n");
  92. ok = false;
  93. }
  94. if (node->size != size) {
  95. KUNIT_FAIL(test, "node has wrong size, found %llu, expected %llu\n",
  96. node->size, size);
  97. ok = false;
  98. }
  99. if (misalignment(node, alignment)) {
  100. KUNIT_FAIL(test,
  101. "node is misaligned, start %llx rem %llu, expected alignment %llu\n",
  102. node->start, misalignment(node, alignment), alignment);
  103. ok = false;
  104. }
  105. if (node->color != color) {
  106. KUNIT_FAIL(test, "node has wrong color, found %lu, expected %lu\n",
  107. node->color, color);
  108. ok = false;
  109. }
  110. return ok;
  111. }
  112. static void drm_test_mm_init(struct kunit *test)
  113. {
  114. const unsigned int size = 4096;
  115. struct drm_mm mm;
  116. struct drm_mm_node tmp;
  117. /* Start with some simple checks on initialising the struct drm_mm */
  118. memset(&mm, 0, sizeof(mm));
  119. KUNIT_ASSERT_FALSE_MSG(test, drm_mm_initialized(&mm),
  120. "zeroed mm claims to be initialized\n");
  121. memset(&mm, 0xff, sizeof(mm));
  122. drm_mm_init(&mm, 0, size);
  123. if (!drm_mm_initialized(&mm)) {
  124. KUNIT_FAIL(test, "mm claims not to be initialized\n");
  125. goto out;
  126. }
  127. if (!drm_mm_clean(&mm)) {
  128. KUNIT_FAIL(test, "mm not empty on creation\n");
  129. goto out;
  130. }
  131. /* After creation, it should all be one massive hole */
  132. if (!assert_one_hole(test, &mm, 0, size)) {
  133. KUNIT_FAIL(test, "mm not one hole on creation");
  134. goto out;
  135. }
  136. memset(&tmp, 0, sizeof(tmp));
  137. tmp.start = 0;
  138. tmp.size = size;
  139. if (drm_mm_reserve_node(&mm, &tmp)) {
  140. KUNIT_FAIL(test, "failed to reserve whole drm_mm\n");
  141. goto out;
  142. }
  143. /* After filling the range entirely, there should be no holes */
  144. if (!assert_no_holes(test, &mm)) {
  145. KUNIT_FAIL(test, "mm has holes when filled");
  146. goto out;
  147. }
  148. /* And then after emptying it again, the massive hole should be back */
  149. drm_mm_remove_node(&tmp);
  150. if (!assert_one_hole(test, &mm, 0, size)) {
  151. KUNIT_FAIL(test, "mm does not have single hole after emptying");
  152. goto out;
  153. }
  154. out:
  155. drm_mm_takedown(&mm);
  156. }
  157. static void drm_test_mm_debug(struct kunit *test)
  158. {
  159. struct drm_printer p = drm_dbg_printer(NULL, DRM_UT_CORE, test->name);
  160. struct drm_mm mm;
  161. struct drm_mm_node nodes[2];
  162. /* Create a small drm_mm with a couple of nodes and a few holes, and
  163. * check that the debug iterator doesn't explode over a trivial drm_mm.
  164. */
  165. drm_mm_init(&mm, 0, 4096);
  166. memset(nodes, 0, sizeof(nodes));
  167. nodes[0].start = 512;
  168. nodes[0].size = 1024;
  169. KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[0]),
  170. "failed to reserve node[0] {start=%lld, size=%lld)\n",
  171. nodes[0].start, nodes[0].size);
  172. nodes[1].size = 1024;
  173. nodes[1].start = 4096 - 512 - nodes[1].size;
  174. KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[1]),
  175. "failed to reserve node[0] {start=%lld, size=%lld)\n",
  176. nodes[0].start, nodes[0].size);
  177. drm_mm_print(&mm, &p);
  178. KUNIT_SUCCEED(test);
  179. }
  180. static bool expect_insert(struct kunit *test, struct drm_mm *mm,
  181. struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color,
  182. const struct insert_mode *mode)
  183. {
  184. int err;
  185. err = drm_mm_insert_node_generic(mm, node,
  186. size, alignment, color,
  187. mode->mode);
  188. if (err) {
  189. KUNIT_FAIL(test,
  190. "insert (size=%llu, alignment=%llu, color=%lu, mode=%s) failed with err=%d\n",
  191. size, alignment, color, mode->name, err);
  192. return false;
  193. }
  194. if (!assert_node(test, node, mm, size, alignment, color)) {
  195. drm_mm_remove_node(node);
  196. return false;
  197. }
  198. return true;
  199. }
  200. static void drm_test_mm_align_pot(struct kunit *test, int max)
  201. {
  202. struct drm_mm mm;
  203. struct drm_mm_node *node, *next;
  204. int bit;
  205. /* Check that we can align to the full u64 address space */
  206. drm_mm_init(&mm, 1, U64_MAX - 2);
  207. for (bit = max - 1; bit; bit--) {
  208. u64 align, size;
  209. node = kzalloc_obj(*node);
  210. if (!node) {
  211. KUNIT_FAIL(test, "failed to allocate node");
  212. goto out;
  213. }
  214. align = BIT_ULL(bit);
  215. size = BIT_ULL(bit - 1) + 1;
  216. if (!expect_insert(test, &mm, node, size, align, bit, &insert_modes[0])) {
  217. KUNIT_FAIL(test, "insert failed with alignment=%llx [%d]", align, bit);
  218. goto out;
  219. }
  220. cond_resched();
  221. }
  222. out:
  223. drm_mm_for_each_node_safe(node, next, &mm) {
  224. drm_mm_remove_node(node);
  225. kfree(node);
  226. }
  227. drm_mm_takedown(&mm);
  228. }
  229. static void drm_test_mm_align32(struct kunit *test)
  230. {
  231. drm_test_mm_align_pot(test, 32);
  232. }
  233. static void drm_test_mm_align64(struct kunit *test)
  234. {
  235. drm_test_mm_align_pot(test, 64);
  236. }
  237. static void drm_test_mm_once(struct kunit *test, unsigned int mode)
  238. {
  239. struct drm_mm mm;
  240. struct drm_mm_node rsvd_lo, rsvd_hi, node;
  241. drm_mm_init(&mm, 0, 7);
  242. memset(&rsvd_lo, 0, sizeof(rsvd_lo));
  243. rsvd_lo.start = 1;
  244. rsvd_lo.size = 1;
  245. if (drm_mm_reserve_node(&mm, &rsvd_lo)) {
  246. KUNIT_FAIL(test, "Could not reserve low node\n");
  247. goto err;
  248. }
  249. memset(&rsvd_hi, 0, sizeof(rsvd_hi));
  250. rsvd_hi.start = 5;
  251. rsvd_hi.size = 1;
  252. if (drm_mm_reserve_node(&mm, &rsvd_hi)) {
  253. KUNIT_FAIL(test, "Could not reserve low node\n");
  254. goto err_lo;
  255. }
  256. if (!drm_mm_hole_follows(&rsvd_lo) || !drm_mm_hole_follows(&rsvd_hi)) {
  257. KUNIT_FAIL(test, "Expected a hole after lo and high nodes!\n");
  258. goto err_hi;
  259. }
  260. memset(&node, 0, sizeof(node));
  261. if (drm_mm_insert_node_generic(&mm, &node, 2, 0, 0, mode)) {
  262. KUNIT_FAIL(test, "Could not insert the node into the available hole!\n");
  263. goto err_hi;
  264. }
  265. drm_mm_remove_node(&node);
  266. err_hi:
  267. drm_mm_remove_node(&rsvd_hi);
  268. err_lo:
  269. drm_mm_remove_node(&rsvd_lo);
  270. err:
  271. drm_mm_takedown(&mm);
  272. }
  273. static void drm_test_mm_lowest(struct kunit *test)
  274. {
  275. drm_test_mm_once(test, DRM_MM_INSERT_LOW);
  276. }
  277. static void drm_test_mm_highest(struct kunit *test)
  278. {
  279. drm_test_mm_once(test, DRM_MM_INSERT_HIGH);
  280. }
  281. static struct kunit_case drm_mm_tests[] = {
  282. KUNIT_CASE(drm_test_mm_init),
  283. KUNIT_CASE(drm_test_mm_debug),
  284. KUNIT_CASE(drm_test_mm_align32),
  285. KUNIT_CASE(drm_test_mm_align64),
  286. KUNIT_CASE(drm_test_mm_lowest),
  287. KUNIT_CASE(drm_test_mm_highest),
  288. {}
  289. };
  290. static struct kunit_suite drm_mm_test_suite = {
  291. .name = "drm_mm",
  292. .test_cases = drm_mm_tests,
  293. };
  294. kunit_test_suite(drm_mm_test_suite);
  295. MODULE_AUTHOR("Intel Corporation");
  296. MODULE_DESCRIPTION("Test cases for the drm_mm range manager");
  297. MODULE_LICENSE("GPL");