1 // SPDX-License-Identifier: GPL-2.0-only
3 * Test cases for the drm_mm range manager
8 #include <kunit/test.h>
10 #include <linux/prime_numbers.h>
11 #include <linux/slab.h>
12 #include <linux/random.h>
13 #include <linux/vmalloc.h>
14 #include <linux/ktime.h>
16 #include <drm/drm_mm.h>
18 #include "../lib/drm_random.h"
27 static const struct insert_mode {
29 enum drm_mm_insert_mode mode;
31 [BEST] = { "best", DRM_MM_INSERT_BEST },
32 [BOTTOMUP] = { "bottom-up", DRM_MM_INSERT_LOW },
33 [TOPDOWN] = { "top-down", DRM_MM_INSERT_HIGH },
34 [EVICT] = { "evict", DRM_MM_INSERT_EVICT },
38 static bool assert_no_holes(struct kunit *test, const struct drm_mm *mm)
40 struct drm_mm_node *hole;
41 u64 hole_start, __always_unused hole_end;
45 drm_mm_for_each_hole(hole, mm, hole_start, hole_end)
49 "Expected to find no holes (after reserve), found %lu instead\n", count);
53 drm_mm_for_each_node(hole, mm) {
54 if (drm_mm_hole_follows(hole)) {
55 KUNIT_FAIL(test, "Hole follows node, expected none!\n");
63 static bool assert_one_hole(struct kunit *test, const struct drm_mm *mm, u64 start, u64 end)
65 struct drm_mm_node *hole;
66 u64 hole_start, hole_end;
74 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) {
75 if (start != hole_start || end != hole_end) {
78 "empty mm has incorrect hole, found (%llx, %llx), expect (%llx, %llx)\n",
79 hole_start, hole_end, start, end);
85 KUNIT_FAIL(test, "Expected to find one hole, found %lu instead\n", count);
92 static u64 misalignment(struct drm_mm_node *node, u64 alignment)
99 div64_u64_rem(node->start, alignment, &rem);
103 static bool assert_node(struct kunit *test, struct drm_mm_node *node, struct drm_mm *mm,
104 u64 size, u64 alignment, unsigned long color)
108 if (!drm_mm_node_allocated(node) || node->mm != mm) {
109 KUNIT_FAIL(test, "node not allocated\n");
113 if (node->size != size) {
114 KUNIT_FAIL(test, "node has wrong size, found %llu, expected %llu\n",
119 if (misalignment(node, alignment)) {
121 "node is misaligned, start %llx rem %llu, expected alignment %llu\n",
122 node->start, misalignment(node, alignment), alignment);
126 if (node->color != color) {
127 KUNIT_FAIL(test, "node has wrong color, found %lu, expected %lu\n",
135 static void drm_test_mm_init(struct kunit *test)
137 const unsigned int size = 4096;
139 struct drm_mm_node tmp;
141 /* Start with some simple checks on initialising the struct drm_mm */
142 memset(&mm, 0, sizeof(mm));
143 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_initialized(&mm),
144 "zeroed mm claims to be initialized\n");
146 memset(&mm, 0xff, sizeof(mm));
147 drm_mm_init(&mm, 0, size);
148 if (!drm_mm_initialized(&mm)) {
149 KUNIT_FAIL(test, "mm claims not to be initialized\n");
153 if (!drm_mm_clean(&mm)) {
154 KUNIT_FAIL(test, "mm not empty on creation\n");
158 /* After creation, it should all be one massive hole */
159 if (!assert_one_hole(test, &mm, 0, size)) {
160 KUNIT_FAIL(test, "");
164 memset(&tmp, 0, sizeof(tmp));
167 if (drm_mm_reserve_node(&mm, &tmp)) {
168 KUNIT_FAIL(test, "failed to reserve whole drm_mm\n");
172 /* After filling the range entirely, there should be no holes */
173 if (!assert_no_holes(test, &mm)) {
174 KUNIT_FAIL(test, "");
178 /* And then after emptying it again, the massive hole should be back */
179 drm_mm_remove_node(&tmp);
180 if (!assert_one_hole(test, &mm, 0, size)) {
181 KUNIT_FAIL(test, "");
186 drm_mm_takedown(&mm);
189 static void drm_test_mm_debug(struct kunit *test)
192 struct drm_mm_node nodes[2];
194 /* Create a small drm_mm with a couple of nodes and a few holes, and
195 * check that the debug iterator doesn't explode over a trivial drm_mm.
198 drm_mm_init(&mm, 0, 4096);
200 memset(nodes, 0, sizeof(nodes));
201 nodes[0].start = 512;
202 nodes[0].size = 1024;
203 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[0]),
204 "failed to reserve node[0] {start=%lld, size=%lld)\n",
205 nodes[0].start, nodes[0].size);
207 nodes[1].size = 1024;
208 nodes[1].start = 4096 - 512 - nodes[1].size;
209 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[1]),
210 "failed to reserve node[0] {start=%lld, size=%lld)\n",
211 nodes[0].start, nodes[0].size);
214 static bool expect_insert(struct kunit *test, struct drm_mm *mm,
215 struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color,
216 const struct insert_mode *mode)
220 err = drm_mm_insert_node_generic(mm, node,
221 size, alignment, color,
225 "insert (size=%llu, alignment=%llu, color=%lu, mode=%s) failed with err=%d\n",
226 size, alignment, color, mode->name, err);
230 if (!assert_node(test, node, mm, size, alignment, color)) {
231 drm_mm_remove_node(node);
238 static void drm_test_mm_align_pot(struct kunit *test, int max)
241 struct drm_mm_node *node, *next;
244 /* Check that we can align to the full u64 address space */
246 drm_mm_init(&mm, 1, U64_MAX - 2);
248 for (bit = max - 1; bit; bit--) {
251 node = kzalloc(sizeof(*node), GFP_KERNEL);
253 KUNIT_FAIL(test, "failed to allocate node");
257 align = BIT_ULL(bit);
258 size = BIT_ULL(bit - 1) + 1;
259 if (!expect_insert(test, &mm, node, size, align, bit, &insert_modes[0])) {
260 KUNIT_FAIL(test, "insert failed with alignment=%llx [%d]", align, bit);
268 drm_mm_for_each_node_safe(node, next, &mm) {
269 drm_mm_remove_node(node);
272 drm_mm_takedown(&mm);
275 static void drm_test_mm_align32(struct kunit *test)
277 drm_test_mm_align_pot(test, 32);
280 static void drm_test_mm_align64(struct kunit *test)
282 drm_test_mm_align_pot(test, 64);
285 static void drm_test_mm_once(struct kunit *test, unsigned int mode)
288 struct drm_mm_node rsvd_lo, rsvd_hi, node;
290 drm_mm_init(&mm, 0, 7);
292 memset(&rsvd_lo, 0, sizeof(rsvd_lo));
295 if (drm_mm_reserve_node(&mm, &rsvd_lo)) {
296 KUNIT_FAIL(test, "Could not reserve low node\n");
300 memset(&rsvd_hi, 0, sizeof(rsvd_hi));
303 if (drm_mm_reserve_node(&mm, &rsvd_hi)) {
304 KUNIT_FAIL(test, "Could not reserve low node\n");
308 if (!drm_mm_hole_follows(&rsvd_lo) || !drm_mm_hole_follows(&rsvd_hi)) {
309 KUNIT_FAIL(test, "Expected a hole after lo and high nodes!\n");
313 memset(&node, 0, sizeof(node));
314 if (drm_mm_insert_node_generic(&mm, &node, 2, 0, 0, mode)) {
315 KUNIT_FAIL(test, "Could not insert the node into the available hole!\n");
319 drm_mm_remove_node(&node);
321 drm_mm_remove_node(&rsvd_hi);
323 drm_mm_remove_node(&rsvd_lo);
325 drm_mm_takedown(&mm);
328 static void drm_test_mm_lowest(struct kunit *test)
330 drm_test_mm_once(test, DRM_MM_INSERT_LOW);
333 static void drm_test_mm_highest(struct kunit *test)
335 drm_test_mm_once(test, DRM_MM_INSERT_HIGH);
338 static struct kunit_case drm_mm_tests[] = {
339 KUNIT_CASE(drm_test_mm_init),
340 KUNIT_CASE(drm_test_mm_debug),
341 KUNIT_CASE(drm_test_mm_align32),
342 KUNIT_CASE(drm_test_mm_align64),
343 KUNIT_CASE(drm_test_mm_lowest),
344 KUNIT_CASE(drm_test_mm_highest),
348 static struct kunit_suite drm_mm_test_suite = {
350 .test_cases = drm_mm_tests,
353 kunit_test_suite(drm_mm_test_suite);
355 MODULE_AUTHOR("Intel Corporation");
356 MODULE_LICENSE("GPL");