drm/tests/drm_buddy_test.c

19 static inline u64 get_size(int order, u64 chunk_size)
21 	return (1 << order) * chunk_size;
28 	unsigned int i, count, *order;
45 	order = drm_random_order(count, &prng);
46 	KUNIT_EXPECT_TRUE(test, order);
50 	 * in some random order allocate within each bias, using various
59 		bias_start = order[i] * bias_size;
164 	kfree(order);
270 	unsigned int order;
344 	 * repeat the whole thing, increment the order until we hit the max_order.
366 	order = 1;
368 		size = SZ_4K << order;
383 	} while (++order <= max_order);
495 	int order, top;
503 	 * order within. This should leave the mm with exactly one
522 		for (order = top; order--;) {
523 			size = get_size(order, PAGE_SIZE);
527 					"buddy_alloc hit -ENOMEM with order=%d, top=%d\n",
528 					order, top);
550 							  "buddy_alloc unexpectedly succeeded at top-order %d/%d, it should be full!",
557 	for (order = 1; order <= max_order; order++) {
558 		size = get_size(order, PAGE_SIZE);
561 							  "buddy_alloc unexpectedly succeeded at order %d, it should be full!",
562 							  order);
577 	unsigned int order;
583 	 * order within. This should leave the mm with exactly one
593 	for (order = 0; order < max_order; order++) {
594 		size = get_size(order, PAGE_SIZE);
597 							   "buddy_alloc hit -ENOMEM with order=%d\n",
598 							   order);
618 	for (order = max_order; order--;) {
619 		size = get_size(order, PAGE_SIZE);
630 	order = 1;
635 		size = get_size(order, PAGE_SIZE);
638 							   "buddy_alloc hit -ENOMEM with order=%d\n",
639 							   order);
646 		order++;
653 						   "buddy_alloc (realloc) hit -ENOMEM with order=%d\n",
674 	int order;
677 	 * Create a mm with one block of each order available, and
688 	for (order = 0; order <= max_order; order++) {
689 		size = get_size(order, PAGE_SIZE);
692 							   "buddy_alloc hit -ENOMEM with order=%d\n",
693 							   order);
733 			    "block order(%d) != %d\n",