drm_mm_test.c 8.2 KB

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