1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
|
// SPDX-License-Identifier: MIT
/*
* Copyright © 2019 Intel Corporation
*/
#include <linux/prime_numbers.h>
#include "../i915_selftest.h"
#include "i915_random.h"
#define SZ_8G (1ULL << 33)
static void __igt_dump_block(struct i915_buddy_mm *mm,
struct i915_buddy_block *block,
bool buddy)
{
pr_err("block info: header=%llx, state=%u, order=%d, offset=%llx size=%llx root=%s buddy=%s\n",
block->header,
i915_buddy_block_state(block),
i915_buddy_block_order(block),
i915_buddy_block_offset(block),
i915_buddy_block_size(mm, block),
yesno(!block->parent),
yesno(buddy));
}
static void igt_dump_block(struct i915_buddy_mm *mm,
struct i915_buddy_block *block)
{
struct i915_buddy_block *buddy;
__igt_dump_block(mm, block, false);
buddy = get_buddy(block);
if (buddy)
__igt_dump_block(mm, buddy, true);
}
static int igt_check_block(struct i915_buddy_mm *mm,
struct i915_buddy_block *block)
{
struct i915_buddy_block *buddy;
unsigned int block_state;
u64 block_size;
u64 offset;
int err = 0;
block_state = i915_buddy_block_state(block);
if (block_state != I915_BUDDY_ALLOCATED &&
block_state != I915_BUDDY_FREE &&
block_state != I915_BUDDY_SPLIT) {
pr_err("block state mismatch\n");
err = -EINVAL;
}
block_size = i915_buddy_block_size(mm, block);
offset = i915_buddy_block_offset(block);
if (block_size < mm->chunk_size) {
pr_err("block size smaller than min size\n");
err = -EINVAL;
}
if (!is_power_of_2(block_size)) {
pr_err("block size not power of two\n");
err = -EINVAL;
}
if (!IS_ALIGNED(block_size, mm->chunk_size)) {
pr_err("block size not aligned to min size\n");
err = -EINVAL;
}
if (!IS_ALIGNED(offset, mm->chunk_size)) {
pr_err("block offset not aligned to min size\n");
err = -EINVAL;
}
if (!IS_ALIGNED(offset, block_size)) {
pr_err("block offset not aligned to block size\n");
err = -EINVAL;
}
buddy = get_buddy(block);
if (!buddy && block->parent) {
pr_err("buddy has gone fishing\n");
err = -EINVAL;
}
if (buddy) {
if (i915_buddy_block_offset(buddy) != (offset ^ block_size)) {
pr_err("buddy has wrong offset\n");
err = -EINVAL;
}
if (i915_buddy_block_size(mm, buddy) != block_size) {
pr_err("buddy size mismatch\n");
err = -EINVAL;
}
if (i915_buddy_block_state(buddy) == block_state &&
block_state == I915_BUDDY_FREE) {
pr_err("block and its buddy are free\n");
err = -EINVAL;
}
}
return err;
}
static int igt_check_blocks(struct i915_buddy_mm *mm,
struct list_head *blocks,
u64 expected_size,
bool is_contiguous)
{
struct i915_buddy_block *block;
struct i915_buddy_block *prev;
u64 total;
int err = 0;
block = NULL;
prev = NULL;
total = 0;
list_for_each_entry(block, blocks, link) {
err = igt_check_block(mm, block);
if (!i915_buddy_block_is_allocated(block)) {
pr_err("block not allocated\n"),
err = -EINVAL;
}
if (is_contiguous && prev) {
u64 prev_block_size;
u64 prev_offset;
u64 offset;
prev_offset = i915_buddy_block_offset(prev);
prev_block_size = i915_buddy_block_size(mm, prev);
offset = i915_buddy_block_offset(block);
if (offset != (prev_offset + prev_block_size)) {
pr_err("block offset mismatch\n");
err = -EINVAL;
}
}
if (err)
break;
total += i915_buddy_block_size(mm, block);
prev = block;
}
if (!err) {
if (total != expected_size) {
pr_err("size mismatch, expected=%llx, found=%llx\n",
expected_size, total);
err = -EINVAL;
}
return err;
}
if (prev) {
pr_err("prev block, dump:\n");
igt_dump_block(mm, prev);
}
if (block) {
pr_err("bad block, dump:\n");
igt_dump_block(mm, block);
}
return err;
}
static int igt_check_mm(struct i915_buddy_mm *mm)
{
struct i915_buddy_block *root;
struct i915_buddy_block *prev;
unsigned int i;
u64 total;
int err = 0;
if (!mm->n_roots) {
pr_err("n_roots is zero\n");
return -EINVAL;
}
if (mm->n_roots != hweight64(mm->size)) {
pr_err("n_roots mismatch, n_roots=%u, expected=%lu\n",
mm->n_roots, hweight64(mm->size));
return -EINVAL;
}
root = NULL;
prev = NULL;
total = 0;
for (i = 0; i < mm->n_roots; ++i) {
struct i915_buddy_block *block;
unsigned int order;
root = mm->roots[i];
if (!root) {
pr_err("root(%u) is NULL\n", i);
err = -EINVAL;
break;
}
err = igt_check_block(mm, root);
if (!i915_buddy_block_is_free(root)) {
pr_err("root not free\n");
err = -EINVAL;
}
order = i915_buddy_block_order(root);
if (!i) {
if (order != mm->max_order) {
pr_err("max order root missing\n");
err = -EINVAL;
}
}
if (prev) {
u64 prev_block_size;
u64 prev_offset;
u64 offset;
prev_offset = i915_buddy_block_offset(prev);
prev_block_size = i915_buddy_block_size(mm, prev);
offset = i915_buddy_block_offset(root);
if (offset != (prev_offset + prev_block_size)) {
pr_err("root offset mismatch\n");
err = -EINVAL;
}
}
block = list_first_entry_or_null(&mm->free_list[order],
struct i915_buddy_block,
link);
if (block != root) {
pr_err("root mismatch at order=%u\n", order);
err = -EINVAL;
}
if (err)
break;
prev = root;
total += i915_buddy_block_size(mm, root);
}
if (!err) {
if (total != mm->size) {
pr_err("expected mm size=%llx, found=%llx\n", mm->size,
total);
err = -EINVAL;
}
return err;
}
if (prev) {
pr_err("prev root(%u), dump:\n", i - 1);
igt_dump_block(mm, prev);
}
if (root) {
pr_err("bad root(%u), dump:\n", i);
igt_dump_block(mm, root);
}
return err;
}
static void igt_mm_config(u64 *size, u64 *chunk_size)
{
I915_RND_STATE(prng);
u64 s, ms;
/* Nothing fancy, just try to get an interesting bit pattern */
prandom_seed_state(&prng, i915_selftest.random_seed);
s = i915_prandom_u64_state(&prng) & (SZ_8G - 1);
ms = BIT_ULL(12 + (prandom_u32_state(&prng) % ilog2(s >> 12)));
s = max(s & -ms, ms);
*chunk_size = ms;
*size = s;
}
static int igt_buddy_alloc_smoke(void *arg)
{
struct i915_buddy_mm mm;
int max_order;
u64 chunk_size;
u64 mm_size;
int err;
igt_mm_config(&mm_size, &chunk_size);
pr_info("buddy_init with size=%llx, chunk_size=%llx\n", mm_size, chunk_size);
err = i915_buddy_init(&mm, mm_size, chunk_size);
if (err) {
pr_err("buddy_init failed(%d)\n", err);
return err;
}
for (max_order = mm.max_order; max_order >= 0; max_order--) {
struct i915_buddy_block *block;
int order;
LIST_HEAD(blocks);
u64 total;
err = igt_check_mm(&mm);
if (err) {
pr_err("pre-mm check failed, abort\n");
break;
}
pr_info("filling from max_order=%u\n", max_order);
order = max_order;
total = 0;
do {
retry:
block = i915_buddy_alloc(&mm, order);
if (IS_ERR(block)) {
err = PTR_ERR(block);
if (err == -ENOMEM) {
pr_info("buddy_alloc hit -ENOMEM with order=%d\n",
order);
} else {
if (order--) {
err = 0;
goto retry;
}
pr_err("buddy_alloc with order=%d failed(%d)\n",
order, err);
}
break;
}
list_add_tail(&block->link, &blocks);
if (i915_buddy_block_order(block) != order) {
pr_err("buddy_alloc order mismatch\n");
err = -EINVAL;
break;
}
total += i915_buddy_block_size(&mm, block);
} while (total < mm.size);
if (!err)
err = igt_check_blocks(&mm, &blocks, total, false);
i915_buddy_free_list(&mm, &blocks);
if (!err) {
err = igt_check_mm(&mm);
if (err)
pr_err("post-mm check failed\n");
}
if (err)
break;
cond_resched();
}
if (err == -ENOMEM)
err = 0;
i915_buddy_fini(&mm);
return err;
}
static int igt_buddy_alloc_pessimistic(void *arg)
{
const unsigned int max_order = 16;
struct i915_buddy_block *block, *bn;
struct i915_buddy_mm mm;
unsigned int order;
LIST_HEAD(blocks);
int err;
/*
* Create a pot-sized mm, then allocate one of each possible
* order within. This should leave the mm with exactly one
* page left.
*/
err = i915_buddy_init(&mm, PAGE_SIZE << max_order, PAGE_SIZE);
if (err) {
pr_err("buddy_init failed(%d)\n", err);
return err;
}
GEM_BUG_ON(mm.max_order != max_order);
for (order = 0; order < max_order; order++) {
block = i915_buddy_alloc(&mm, order);
if (IS_ERR(block)) {
pr_info("buddy_alloc hit -ENOMEM with order=%d\n",
order);
err = PTR_ERR(block);
goto err;
}
list_add_tail(&block->link, &blocks);
}
/* And now the last remaining block available */
block = i915_buddy_alloc(&mm, 0);
if (IS_ERR(block)) {
pr_info("buddy_alloc hit -ENOMEM on final alloc\n");
err = PTR_ERR(block);
goto err;
}
list_add_tail(&block->link, &blocks);
/* Should be completely full! */
for (order = max_order; order--; ) {
block = i915_buddy_alloc(&mm, order);
if (!IS_ERR(block)) {
pr_info("buddy_alloc unexpectedly succeeded at order %d, it should be full!",
order);
list_add_tail(&block->link, &blocks);
err = -EINVAL;
goto err;
}
}
block = list_last_entry(&blocks, typeof(*block), link);
list_del(&block->link);
i915_buddy_free(&mm, block);
/* As we free in increasing size, we make available larger blocks */
order = 1;
list_for_each_entry_safe(block, bn, &blocks, link) {
list_del(&block->link);
i915_buddy_free(&mm, block);
block = i915_buddy_alloc(&mm, order);
if (IS_ERR(block)) {
pr_info("buddy_alloc (realloc) hit -ENOMEM with order=%d\n",
order);
err = PTR_ERR(block);
goto err;
}
i915_buddy_free(&mm, block);
order++;
}
/* To confirm, now the whole mm should be available */
block = i915_buddy_alloc(&mm, max_order);
if (IS_ERR(block)) {
pr_info("buddy_alloc (realloc) hit -ENOMEM with order=%d\n",
max_order);
err = PTR_ERR(block);
goto err;
}
i915_buddy_free(&mm, block);
err:
i915_buddy_free_list(&mm, &blocks);
i915_buddy_fini(&mm);
return err;
}
static int igt_buddy_alloc_optimistic(void *arg)
{
const int max_order = 16;
struct i915_buddy_block *block;
struct i915_buddy_mm mm;
LIST_HEAD(blocks);
int order;
int err;
/*
* Create a mm with one block of each order available, and
* try to allocate them all.
*/
err = i915_buddy_init(&mm,
PAGE_SIZE * ((1 << (max_order + 1)) - 1),
PAGE_SIZE);
if (err) {
pr_err("buddy_init failed(%d)\n", err);
return err;
}
GEM_BUG_ON(mm.max_order != max_order);
for (order = 0; order <= max_order; order++) {
block = i915_buddy_alloc(&mm, order);
if (IS_ERR(block)) {
pr_info("buddy_alloc hit -ENOMEM with order=%d\n",
order);
err = PTR_ERR(block);
goto err;
}
list_add_tail(&block->link, &blocks);
}
/* Should be completely full! */
block = i915_buddy_alloc(&mm, 0);
if (!IS_ERR(block)) {
pr_info("buddy_alloc unexpectedly succeeded, it should be full!");
list_add_tail(&block->link, &blocks);
err = -EINVAL;
goto err;
}
err:
i915_buddy_free_list(&mm, &blocks);
i915_buddy_fini(&mm);
return err;
}
static int igt_buddy_alloc_pathological(void *arg)
{
const int max_order = 16;
struct i915_buddy_block *block;
struct i915_buddy_mm mm;
LIST_HEAD(blocks);
LIST_HEAD(holes);
int order, top;
int err;
/*
* Create a pot-sized mm, then allocate one of each possible
* order within. This should leave the mm with exactly one
* page left. Free the largest block, then whittle down again.
* Eventually we will have a fully 50% fragmented mm.
*/
err = i915_buddy_init(&mm, PAGE_SIZE << max_order, PAGE_SIZE);
if (err) {
pr_err("buddy_init failed(%d)\n", err);
return err;
}
GEM_BUG_ON(mm.max_order != max_order);
for (top = max_order; top; top--) {
/* Make room by freeing the largest allocated block */
block = list_first_entry_or_null(&blocks, typeof(*block), link);
if (block) {
list_del(&block->link);
i915_buddy_free(&mm, block);
}
for (order = top; order--; ) {
block = i915_buddy_alloc(&mm, order);
if (IS_ERR(block)) {
pr_info("buddy_alloc hit -ENOMEM with order=%d, top=%d\n",
order, top);
err = PTR_ERR(block);
goto err;
}
list_add_tail(&block->link, &blocks);
}
/* There should be one final page for this sub-allocation */
block = i915_buddy_alloc(&mm, 0);
if (IS_ERR(block)) {
pr_info("buddy_alloc hit -ENOMEM for hole\n");
err = PTR_ERR(block);
goto err;
}
list_add_tail(&block->link, &holes);
block = i915_buddy_alloc(&mm, top);
if (!IS_ERR(block)) {
pr_info("buddy_alloc unexpectedly succeeded at top-order %d/%d, it should be full!",
top, max_order);
list_add_tail(&block->link, &blocks);
err = -EINVAL;
goto err;
}
}
i915_buddy_free_list(&mm, &holes);
/* Nothing larger than blocks of chunk_size now available */
for (order = 1; order <= max_order; order++) {
block = i915_buddy_alloc(&mm, order);
if (!IS_ERR(block)) {
pr_info("buddy_alloc unexpectedly succeeded at order %d, it should be full!",
order);
list_add_tail(&block->link, &blocks);
err = -EINVAL;
goto err;
}
}
err:
list_splice_tail(&holes, &blocks);
i915_buddy_free_list(&mm, &blocks);
i915_buddy_fini(&mm);
return err;
}
static int igt_buddy_alloc_range(void *arg)
{
struct i915_buddy_mm mm;
unsigned long page_num;
LIST_HEAD(blocks);
u64 chunk_size;
u64 offset;
u64 size;
u64 rem;
int err;
igt_mm_config(&size, &chunk_size);
pr_info("buddy_init with size=%llx, chunk_size=%llx\n", size, chunk_size);
err = i915_buddy_init(&mm, size, chunk_size);
if (err) {
pr_err("buddy_init failed(%d)\n", err);
return err;
}
err = igt_check_mm(&mm);
if (err) {
pr_err("pre-mm check failed, abort, abort, abort!\n");
goto err_fini;
}
rem = mm.size;
offset = 0;
for_each_prime_number_from(page_num, 1, ULONG_MAX - 1) {
struct i915_buddy_block *block;
LIST_HEAD(tmp);
size = min(page_num * mm.chunk_size, rem);
err = i915_buddy_alloc_range(&mm, &tmp, offset, size);
if (err) {
if (err == -ENOMEM) {
pr_info("alloc_range hit -ENOMEM with size=%llx\n",
size);
} else {
pr_err("alloc_range with offset=%llx, size=%llx failed(%d)\n",
offset, size, err);
}
break;
}
block = list_first_entry_or_null(&tmp,
struct i915_buddy_block,
link);
if (!block) {
pr_err("alloc_range has no blocks\n");
err = -EINVAL;
break;
}
if (i915_buddy_block_offset(block) != offset) {
pr_err("alloc_range start offset mismatch, found=%llx, expected=%llx\n",
i915_buddy_block_offset(block), offset);
err = -EINVAL;
}
if (!err)
err = igt_check_blocks(&mm, &tmp, size, true);
list_splice_tail(&tmp, &blocks);
if (err)
break;
offset += size;
rem -= size;
if (!rem)
break;
cond_resched();
}
if (err == -ENOMEM)
err = 0;
i915_buddy_free_list(&mm, &blocks);
if (!err) {
err = igt_check_mm(&mm);
if (err)
pr_err("post-mm check failed\n");
}
err_fini:
i915_buddy_fini(&mm);
return err;
}
int i915_buddy_mock_selftests(void)
{
static const struct i915_subtest tests[] = {
SUBTEST(igt_buddy_alloc_pessimistic),
SUBTEST(igt_buddy_alloc_optimistic),
SUBTEST(igt_buddy_alloc_pathological),
SUBTEST(igt_buddy_alloc_smoke),
SUBTEST(igt_buddy_alloc_range),
};
return i915_subtests(tests, NULL);
}
|