Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2013 Fusion IO. All rights reserved.
4 */
5
6#include <linux/pagemap.h>
7#include <linux/pagevec.h>
8#include <linux/sched.h>
9#include <linux/slab.h>
10#include <linux/sizes.h>
11#include "btrfs-tests.h"
12#include "../ctree.h"
13#include "../extent_io.h"
14#include "../btrfs_inode.h"
15
16#define PROCESS_UNLOCK (1 << 0)
17#define PROCESS_RELEASE (1 << 1)
18#define PROCESS_TEST_LOCKED (1 << 2)
19
20static noinline int process_page_range(struct inode *inode, u64 start, u64 end,
21 unsigned long flags)
22{
23 int ret;
24 struct folio_batch fbatch;
25 unsigned long index = start >> PAGE_SHIFT;
26 unsigned long end_index = end >> PAGE_SHIFT;
27 int i;
28 int count = 0;
29 int loops = 0;
30
31 folio_batch_init(&fbatch);
32
33 while (index <= end_index) {
34 ret = filemap_get_folios_contig(inode->i_mapping, &index,
35 end_index, &fbatch);
36 for (i = 0; i < ret; i++) {
37 struct folio *folio = fbatch.folios[i];
38
39 if (flags & PROCESS_TEST_LOCKED &&
40 !folio_test_locked(folio))
41 count++;
42 if (flags & PROCESS_UNLOCK && folio_test_locked(folio))
43 folio_unlock(folio);
44 if (flags & PROCESS_RELEASE)
45 folio_put(folio);
46 }
47 folio_batch_release(&fbatch);
48 cond_resched();
49 loops++;
50 if (loops > 100000) {
51 printk(KERN_ERR
52 "stuck in a loop, start %llu, end %llu, ret %d\n",
53 start, end, ret);
54 break;
55 }
56 }
57
58 return count;
59}
60
61#define STATE_FLAG_STR_LEN 256
62
63#define PRINT_ONE_FLAG(state, dest, cur, name) \
64({ \
65 if (state->state & EXTENT_##name) \
66 cur += scnprintf(dest + cur, STATE_FLAG_STR_LEN - cur, \
67 "%s" #name, cur == 0 ? "" : "|"); \
68})
69
70static void extent_flag_to_str(const struct extent_state *state, char *dest)
71{
72 int cur = 0;
73
74 dest[0] = 0;
75 PRINT_ONE_FLAG(state, dest, cur, DIRTY);
76 PRINT_ONE_FLAG(state, dest, cur, UPTODATE);
77 PRINT_ONE_FLAG(state, dest, cur, LOCKED);
78 PRINT_ONE_FLAG(state, dest, cur, NEW);
79 PRINT_ONE_FLAG(state, dest, cur, DELALLOC);
80 PRINT_ONE_FLAG(state, dest, cur, DEFRAG);
81 PRINT_ONE_FLAG(state, dest, cur, BOUNDARY);
82 PRINT_ONE_FLAG(state, dest, cur, NODATASUM);
83 PRINT_ONE_FLAG(state, dest, cur, CLEAR_META_RESV);
84 PRINT_ONE_FLAG(state, dest, cur, NEED_WAIT);
85 PRINT_ONE_FLAG(state, dest, cur, NORESERVE);
86 PRINT_ONE_FLAG(state, dest, cur, QGROUP_RESERVED);
87 PRINT_ONE_FLAG(state, dest, cur, CLEAR_DATA_RESV);
88}
89
90static void dump_extent_io_tree(const struct extent_io_tree *tree)
91{
92 struct rb_node *node;
93 char flags_str[STATE_FLAG_STR_LEN];
94
95 node = rb_first(&tree->state);
96 test_msg("io tree content:");
97 while (node) {
98 struct extent_state *state;
99
100 state = rb_entry(node, struct extent_state, rb_node);
101 extent_flag_to_str(state, flags_str);
102 test_msg(" start=%llu len=%llu flags=%s", state->start,
103 state->end + 1 - state->start, flags_str);
104 node = rb_next(node);
105 }
106}
107
108static int test_find_delalloc(u32 sectorsize)
109{
110 struct inode *inode;
111 struct extent_io_tree *tmp;
112 struct page *page;
113 struct page *locked_page = NULL;
114 unsigned long index = 0;
115 /* In this test we need at least 2 file extents at its maximum size */
116 u64 max_bytes = BTRFS_MAX_EXTENT_SIZE;
117 u64 total_dirty = 2 * max_bytes;
118 u64 start, end, test_start;
119 bool found;
120 int ret = -EINVAL;
121
122 test_msg("running find delalloc tests");
123
124 inode = btrfs_new_test_inode();
125 if (!inode) {
126 test_std_err(TEST_ALLOC_INODE);
127 return -ENOMEM;
128 }
129 tmp = &BTRFS_I(inode)->io_tree;
130
131 /*
132 * Passing NULL as we don't have fs_info but tracepoints are not used
133 * at this point
134 */
135 extent_io_tree_init(NULL, tmp, IO_TREE_SELFTEST);
136
137 /*
138 * First go through and create and mark all of our pages dirty, we pin
139 * everything to make sure our pages don't get evicted and screw up our
140 * test.
141 */
142 for (index = 0; index < (total_dirty >> PAGE_SHIFT); index++) {
143 page = find_or_create_page(inode->i_mapping, index, GFP_KERNEL);
144 if (!page) {
145 test_err("failed to allocate test page");
146 ret = -ENOMEM;
147 goto out;
148 }
149 SetPageDirty(page);
150 if (index) {
151 unlock_page(page);
152 } else {
153 get_page(page);
154 locked_page = page;
155 }
156 }
157
158 /* Test this scenario
159 * |--- delalloc ---|
160 * |--- search ---|
161 */
162 set_extent_bit(tmp, 0, sectorsize - 1, EXTENT_DELALLOC, NULL);
163 start = 0;
164 end = start + PAGE_SIZE - 1;
165 found = find_lock_delalloc_range(inode, locked_page, &start,
166 &end);
167 if (!found) {
168 test_err("should have found at least one delalloc");
169 goto out_bits;
170 }
171 if (start != 0 || end != (sectorsize - 1)) {
172 test_err("expected start 0 end %u, got start %llu end %llu",
173 sectorsize - 1, start, end);
174 goto out_bits;
175 }
176 unlock_extent(tmp, start, end, NULL);
177 unlock_page(locked_page);
178 put_page(locked_page);
179
180 /*
181 * Test this scenario
182 *
183 * |--- delalloc ---|
184 * |--- search ---|
185 */
186 test_start = SZ_64M;
187 locked_page = find_lock_page(inode->i_mapping,
188 test_start >> PAGE_SHIFT);
189 if (!locked_page) {
190 test_err("couldn't find the locked page");
191 goto out_bits;
192 }
193 set_extent_bit(tmp, sectorsize, max_bytes - 1, EXTENT_DELALLOC, NULL);
194 start = test_start;
195 end = start + PAGE_SIZE - 1;
196 found = find_lock_delalloc_range(inode, locked_page, &start,
197 &end);
198 if (!found) {
199 test_err("couldn't find delalloc in our range");
200 goto out_bits;
201 }
202 if (start != test_start || end != max_bytes - 1) {
203 test_err("expected start %llu end %llu, got start %llu, end %llu",
204 test_start, max_bytes - 1, start, end);
205 goto out_bits;
206 }
207 if (process_page_range(inode, start, end,
208 PROCESS_TEST_LOCKED | PROCESS_UNLOCK)) {
209 test_err("there were unlocked pages in the range");
210 goto out_bits;
211 }
212 unlock_extent(tmp, start, end, NULL);
213 /* locked_page was unlocked above */
214 put_page(locked_page);
215
216 /*
217 * Test this scenario
218 * |--- delalloc ---|
219 * |--- search ---|
220 */
221 test_start = max_bytes + sectorsize;
222 locked_page = find_lock_page(inode->i_mapping, test_start >>
223 PAGE_SHIFT);
224 if (!locked_page) {
225 test_err("couldn't find the locked page");
226 goto out_bits;
227 }
228 start = test_start;
229 end = start + PAGE_SIZE - 1;
230 found = find_lock_delalloc_range(inode, locked_page, &start,
231 &end);
232 if (found) {
233 test_err("found range when we shouldn't have");
234 goto out_bits;
235 }
236 if (end != test_start + PAGE_SIZE - 1) {
237 test_err("did not return the proper end offset");
238 goto out_bits;
239 }
240
241 /*
242 * Test this scenario
243 * [------- delalloc -------|
244 * [max_bytes]|-- search--|
245 *
246 * We are re-using our test_start from above since it works out well.
247 */
248 set_extent_bit(tmp, max_bytes, total_dirty - 1, EXTENT_DELALLOC, NULL);
249 start = test_start;
250 end = start + PAGE_SIZE - 1;
251 found = find_lock_delalloc_range(inode, locked_page, &start,
252 &end);
253 if (!found) {
254 test_err("didn't find our range");
255 goto out_bits;
256 }
257 if (start != test_start || end != total_dirty - 1) {
258 test_err("expected start %llu end %llu, got start %llu end %llu",
259 test_start, total_dirty - 1, start, end);
260 goto out_bits;
261 }
262 if (process_page_range(inode, start, end,
263 PROCESS_TEST_LOCKED | PROCESS_UNLOCK)) {
264 test_err("pages in range were not all locked");
265 goto out_bits;
266 }
267 unlock_extent(tmp, start, end, NULL);
268
269 /*
270 * Now to test where we run into a page that is no longer dirty in the
271 * range we want to find.
272 */
273 page = find_get_page(inode->i_mapping,
274 (max_bytes + SZ_1M) >> PAGE_SHIFT);
275 if (!page) {
276 test_err("couldn't find our page");
277 goto out_bits;
278 }
279 ClearPageDirty(page);
280 put_page(page);
281
282 /* We unlocked it in the previous test */
283 lock_page(locked_page);
284 start = test_start;
285 end = start + PAGE_SIZE - 1;
286 /*
287 * Currently if we fail to find dirty pages in the delalloc range we
288 * will adjust max_bytes down to PAGE_SIZE and then re-search. If
289 * this changes at any point in the future we will need to fix this
290 * tests expected behavior.
291 */
292 found = find_lock_delalloc_range(inode, locked_page, &start,
293 &end);
294 if (!found) {
295 test_err("didn't find our range");
296 goto out_bits;
297 }
298 if (start != test_start && end != test_start + PAGE_SIZE - 1) {
299 test_err("expected start %llu end %llu, got start %llu end %llu",
300 test_start, test_start + PAGE_SIZE - 1, start, end);
301 goto out_bits;
302 }
303 if (process_page_range(inode, start, end, PROCESS_TEST_LOCKED |
304 PROCESS_UNLOCK)) {
305 test_err("pages in range were not all locked");
306 goto out_bits;
307 }
308 ret = 0;
309out_bits:
310 if (ret)
311 dump_extent_io_tree(tmp);
312 clear_extent_bits(tmp, 0, total_dirty - 1, (unsigned)-1);
313out:
314 if (locked_page)
315 put_page(locked_page);
316 process_page_range(inode, 0, total_dirty - 1,
317 PROCESS_UNLOCK | PROCESS_RELEASE);
318 iput(inode);
319 return ret;
320}
321
322static int check_eb_bitmap(unsigned long *bitmap, struct extent_buffer *eb)
323{
324 unsigned long i;
325
326 for (i = 0; i < eb->len * BITS_PER_BYTE; i++) {
327 int bit, bit1;
328
329 bit = !!test_bit(i, bitmap);
330 bit1 = !!extent_buffer_test_bit(eb, 0, i);
331 if (bit1 != bit) {
332 u8 has;
333 u8 expect;
334
335 read_extent_buffer(eb, &has, i / BITS_PER_BYTE, 1);
336 expect = bitmap_get_value8(bitmap, ALIGN(i, BITS_PER_BYTE));
337
338 test_err(
339 "bits do not match, start byte 0 bit %lu, byte %lu has 0x%02x expect 0x%02x",
340 i, i / BITS_PER_BYTE, has, expect);
341 return -EINVAL;
342 }
343
344 bit1 = !!extent_buffer_test_bit(eb, i / BITS_PER_BYTE,
345 i % BITS_PER_BYTE);
346 if (bit1 != bit) {
347 u8 has;
348 u8 expect;
349
350 read_extent_buffer(eb, &has, i / BITS_PER_BYTE, 1);
351 expect = bitmap_get_value8(bitmap, ALIGN(i, BITS_PER_BYTE));
352
353 test_err(
354 "bits do not match, start byte %lu bit %lu, byte %lu has 0x%02x expect 0x%02x",
355 i / BITS_PER_BYTE, i % BITS_PER_BYTE,
356 i / BITS_PER_BYTE, has, expect);
357 return -EINVAL;
358 }
359 }
360 return 0;
361}
362
363static int test_bitmap_set(const char *name, unsigned long *bitmap,
364 struct extent_buffer *eb,
365 unsigned long byte_start, unsigned long bit_start,
366 unsigned long bit_len)
367{
368 int ret;
369
370 bitmap_set(bitmap, byte_start * BITS_PER_BYTE + bit_start, bit_len);
371 extent_buffer_bitmap_set(eb, byte_start, bit_start, bit_len);
372 ret = check_eb_bitmap(bitmap, eb);
373 if (ret < 0)
374 test_err("%s test failed", name);
375 return ret;
376}
377
378static int test_bitmap_clear(const char *name, unsigned long *bitmap,
379 struct extent_buffer *eb,
380 unsigned long byte_start, unsigned long bit_start,
381 unsigned long bit_len)
382{
383 int ret;
384
385 bitmap_clear(bitmap, byte_start * BITS_PER_BYTE + bit_start, bit_len);
386 extent_buffer_bitmap_clear(eb, byte_start, bit_start, bit_len);
387 ret = check_eb_bitmap(bitmap, eb);
388 if (ret < 0)
389 test_err("%s test failed", name);
390 return ret;
391}
392static int __test_eb_bitmaps(unsigned long *bitmap, struct extent_buffer *eb)
393{
394 unsigned long i, j;
395 unsigned long byte_len = eb->len;
396 u32 x;
397 int ret;
398
399 ret = test_bitmap_clear("clear all run 1", bitmap, eb, 0, 0,
400 byte_len * BITS_PER_BYTE);
401 if (ret < 0)
402 return ret;
403
404 ret = test_bitmap_set("set all", bitmap, eb, 0, 0, byte_len * BITS_PER_BYTE);
405 if (ret < 0)
406 return ret;
407
408 ret = test_bitmap_clear("clear all run 2", bitmap, eb, 0, 0,
409 byte_len * BITS_PER_BYTE);
410 if (ret < 0)
411 return ret;
412
413 ret = test_bitmap_set("same byte set", bitmap, eb, 0, 2, 4);
414 if (ret < 0)
415 return ret;
416
417 ret = test_bitmap_clear("same byte partial clear", bitmap, eb, 0, 4, 1);
418 if (ret < 0)
419 return ret;
420
421 ret = test_bitmap_set("cross byte set", bitmap, eb, 2, 4, 8);
422 if (ret < 0)
423 return ret;
424
425 ret = test_bitmap_set("cross multi byte set", bitmap, eb, 4, 4, 24);
426 if (ret < 0)
427 return ret;
428
429 ret = test_bitmap_clear("cross byte clear", bitmap, eb, 2, 6, 4);
430 if (ret < 0)
431 return ret;
432
433 ret = test_bitmap_clear("cross multi byte clear", bitmap, eb, 4, 6, 20);
434 if (ret < 0)
435 return ret;
436
437 /* Straddling pages test */
438 if (byte_len > PAGE_SIZE) {
439 ret = test_bitmap_set("cross page set", bitmap, eb,
440 PAGE_SIZE - sizeof(long) / 2, 0,
441 sizeof(long) * BITS_PER_BYTE);
442 if (ret < 0)
443 return ret;
444
445 ret = test_bitmap_set("cross page set all", bitmap, eb, 0, 0,
446 byte_len * BITS_PER_BYTE);
447 if (ret < 0)
448 return ret;
449
450 ret = test_bitmap_clear("cross page clear", bitmap, eb,
451 PAGE_SIZE - sizeof(long) / 2, 0,
452 sizeof(long) * BITS_PER_BYTE);
453 if (ret < 0)
454 return ret;
455 }
456
457 /*
458 * Generate a wonky pseudo-random bit pattern for the sake of not using
459 * something repetitive that could miss some hypothetical off-by-n bug.
460 */
461 x = 0;
462 ret = test_bitmap_clear("clear all run 3", bitmap, eb, 0, 0,
463 byte_len * BITS_PER_BYTE);
464 if (ret < 0)
465 return ret;
466
467 for (i = 0; i < byte_len * BITS_PER_BYTE / 32; i++) {
468 x = (0x19660dULL * (u64)x + 0x3c6ef35fULL) & 0xffffffffU;
469 for (j = 0; j < 32; j++) {
470 if (x & (1U << j)) {
471 bitmap_set(bitmap, i * 32 + j, 1);
472 extent_buffer_bitmap_set(eb, 0, i * 32 + j, 1);
473 }
474 }
475 }
476
477 ret = check_eb_bitmap(bitmap, eb);
478 if (ret) {
479 test_err("random bit pattern failed");
480 return ret;
481 }
482
483 return 0;
484}
485
486static int test_eb_bitmaps(u32 sectorsize, u32 nodesize)
487{
488 struct btrfs_fs_info *fs_info;
489 unsigned long *bitmap = NULL;
490 struct extent_buffer *eb = NULL;
491 int ret;
492
493 test_msg("running extent buffer bitmap tests");
494
495 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
496 if (!fs_info) {
497 test_std_err(TEST_ALLOC_FS_INFO);
498 return -ENOMEM;
499 }
500
501 bitmap = kmalloc(nodesize, GFP_KERNEL);
502 if (!bitmap) {
503 test_err("couldn't allocate test bitmap");
504 ret = -ENOMEM;
505 goto out;
506 }
507
508 eb = __alloc_dummy_extent_buffer(fs_info, 0, nodesize);
509 if (!eb) {
510 test_std_err(TEST_ALLOC_ROOT);
511 ret = -ENOMEM;
512 goto out;
513 }
514
515 ret = __test_eb_bitmaps(bitmap, eb);
516 if (ret)
517 goto out;
518
519 free_extent_buffer(eb);
520
521 /*
522 * Test again for case where the tree block is sectorsize aligned but
523 * not nodesize aligned.
524 */
525 eb = __alloc_dummy_extent_buffer(fs_info, sectorsize, nodesize);
526 if (!eb) {
527 test_std_err(TEST_ALLOC_ROOT);
528 ret = -ENOMEM;
529 goto out;
530 }
531
532 ret = __test_eb_bitmaps(bitmap, eb);
533out:
534 free_extent_buffer(eb);
535 kfree(bitmap);
536 btrfs_free_dummy_fs_info(fs_info);
537 return ret;
538}
539
540static int test_find_first_clear_extent_bit(void)
541{
542 struct extent_io_tree tree;
543 u64 start, end;
544 int ret = -EINVAL;
545
546 test_msg("running find_first_clear_extent_bit test");
547
548 extent_io_tree_init(NULL, &tree, IO_TREE_SELFTEST);
549
550 /* Test correct handling of empty tree */
551 find_first_clear_extent_bit(&tree, 0, &start, &end, CHUNK_TRIMMED);
552 if (start != 0 || end != -1) {
553 test_err(
554 "error getting a range from completely empty tree: start %llu end %llu",
555 start, end);
556 goto out;
557 }
558 /*
559 * Set 1M-4M alloc/discard and 32M-64M thus leaving a hole between
560 * 4M-32M
561 */
562 set_extent_bit(&tree, SZ_1M, SZ_4M - 1,
563 CHUNK_TRIMMED | CHUNK_ALLOCATED, NULL);
564
565 find_first_clear_extent_bit(&tree, SZ_512K, &start, &end,
566 CHUNK_TRIMMED | CHUNK_ALLOCATED);
567
568 if (start != 0 || end != SZ_1M - 1) {
569 test_err("error finding beginning range: start %llu end %llu",
570 start, end);
571 goto out;
572 }
573
574 /* Now add 32M-64M so that we have a hole between 4M-32M */
575 set_extent_bit(&tree, SZ_32M, SZ_64M - 1,
576 CHUNK_TRIMMED | CHUNK_ALLOCATED, NULL);
577
578 /*
579 * Request first hole starting at 12M, we should get 4M-32M
580 */
581 find_first_clear_extent_bit(&tree, 12 * SZ_1M, &start, &end,
582 CHUNK_TRIMMED | CHUNK_ALLOCATED);
583
584 if (start != SZ_4M || end != SZ_32M - 1) {
585 test_err("error finding trimmed range: start %llu end %llu",
586 start, end);
587 goto out;
588 }
589
590 /*
591 * Search in the middle of allocated range, should get the next one
592 * available, which happens to be unallocated -> 4M-32M
593 */
594 find_first_clear_extent_bit(&tree, SZ_2M, &start, &end,
595 CHUNK_TRIMMED | CHUNK_ALLOCATED);
596
597 if (start != SZ_4M || end != SZ_32M - 1) {
598 test_err("error finding next unalloc range: start %llu end %llu",
599 start, end);
600 goto out;
601 }
602
603 /*
604 * Set 64M-72M with CHUNK_ALLOC flag, then search for CHUNK_TRIMMED flag
605 * being unset in this range, we should get the entry in range 64M-72M
606 */
607 set_extent_bit(&tree, SZ_64M, SZ_64M + SZ_8M - 1, CHUNK_ALLOCATED, NULL);
608 find_first_clear_extent_bit(&tree, SZ_64M + SZ_1M, &start, &end,
609 CHUNK_TRIMMED);
610
611 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) {
612 test_err("error finding exact range: start %llu end %llu",
613 start, end);
614 goto out;
615 }
616
617 find_first_clear_extent_bit(&tree, SZ_64M - SZ_8M, &start, &end,
618 CHUNK_TRIMMED);
619
620 /*
621 * Search in the middle of set range whose immediate neighbour doesn't
622 * have the bits set so it must be returned
623 */
624 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) {
625 test_err("error finding next alloc range: start %llu end %llu",
626 start, end);
627 goto out;
628 }
629
630 /*
631 * Search beyond any known range, shall return after last known range
632 * and end should be -1
633 */
634 find_first_clear_extent_bit(&tree, -1, &start, &end, CHUNK_TRIMMED);
635 if (start != SZ_64M + SZ_8M || end != -1) {
636 test_err(
637 "error handling beyond end of range search: start %llu end %llu",
638 start, end);
639 goto out;
640 }
641
642 ret = 0;
643out:
644 if (ret)
645 dump_extent_io_tree(&tree);
646 clear_extent_bits(&tree, 0, (u64)-1, CHUNK_TRIMMED | CHUNK_ALLOCATED);
647
648 return ret;
649}
650
651static void dump_eb_and_memory_contents(struct extent_buffer *eb, void *memory,
652 const char *test_name)
653{
654 for (int i = 0; i < eb->len; i++) {
655 struct page *page = folio_page(eb->folios[i >> PAGE_SHIFT], 0);
656 void *addr = page_address(page) + offset_in_page(i);
657
658 if (memcmp(addr, memory + i, 1) != 0) {
659 test_err("%s failed", test_name);
660 test_err("eb and memory diffs at byte %u, eb has 0x%02x memory has 0x%02x",
661 i, *(u8 *)addr, *(u8 *)(memory + i));
662 return;
663 }
664 }
665}
666
667static int verify_eb_and_memory(struct extent_buffer *eb, void *memory,
668 const char *test_name)
669{
670 for (int i = 0; i < (eb->len >> PAGE_SHIFT); i++) {
671 void *eb_addr = folio_address(eb->folios[i]);
672
673 if (memcmp(memory + (i << PAGE_SHIFT), eb_addr, PAGE_SIZE) != 0) {
674 dump_eb_and_memory_contents(eb, memory, test_name);
675 return -EUCLEAN;
676 }
677 }
678 return 0;
679}
680
681/*
682 * Init both memory and extent buffer contents to the same randomly generated
683 * contents.
684 */
685static void init_eb_and_memory(struct extent_buffer *eb, void *memory)
686{
687 get_random_bytes(memory, eb->len);
688 write_extent_buffer(eb, memory, 0, eb->len);
689}
690
691static int test_eb_mem_ops(u32 sectorsize, u32 nodesize)
692{
693 struct btrfs_fs_info *fs_info;
694 struct extent_buffer *eb = NULL;
695 void *memory = NULL;
696 int ret;
697
698 test_msg("running extent buffer memory operation tests");
699
700 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
701 if (!fs_info) {
702 test_std_err(TEST_ALLOC_FS_INFO);
703 return -ENOMEM;
704 }
705
706 memory = kvzalloc(nodesize, GFP_KERNEL);
707 if (!memory) {
708 test_err("failed to allocate memory");
709 ret = -ENOMEM;
710 goto out;
711 }
712
713 eb = __alloc_dummy_extent_buffer(fs_info, SZ_1M, nodesize);
714 if (!eb) {
715 test_std_err(TEST_ALLOC_EXTENT_BUFFER);
716 ret = -ENOMEM;
717 goto out;
718 }
719
720 init_eb_and_memory(eb, memory);
721 ret = verify_eb_and_memory(eb, memory, "full eb write");
722 if (ret < 0)
723 goto out;
724
725 memcpy(memory, memory + 16, 16);
726 memcpy_extent_buffer(eb, 0, 16, 16);
727 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 1");
728 if (ret < 0)
729 goto out;
730
731 memcpy(memory, memory + 2048, 16);
732 memcpy_extent_buffer(eb, 0, 2048, 16);
733 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 2");
734 if (ret < 0)
735 goto out;
736 memcpy(memory, memory + 2048, 2048);
737 memcpy_extent_buffer(eb, 0, 2048, 2048);
738 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 3");
739 if (ret < 0)
740 goto out;
741
742 memmove(memory + 512, memory + 256, 512);
743 memmove_extent_buffer(eb, 512, 256, 512);
744 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 1");
745 if (ret < 0)
746 goto out;
747
748 memmove(memory + 2048, memory + 512, 2048);
749 memmove_extent_buffer(eb, 2048, 512, 2048);
750 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 2");
751 if (ret < 0)
752 goto out;
753 memmove(memory + 512, memory + 2048, 2048);
754 memmove_extent_buffer(eb, 512, 2048, 2048);
755 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 3");
756 if (ret < 0)
757 goto out;
758
759 if (nodesize > PAGE_SIZE) {
760 memcpy(memory, memory + 4096 - 128, 256);
761 memcpy_extent_buffer(eb, 0, 4096 - 128, 256);
762 ret = verify_eb_and_memory(eb, memory, "cross page non-overlapping memcpy 1");
763 if (ret < 0)
764 goto out;
765
766 memcpy(memory + 4096 - 128, memory + 4096 + 128, 256);
767 memcpy_extent_buffer(eb, 4096 - 128, 4096 + 128, 256);
768 ret = verify_eb_and_memory(eb, memory, "cross page non-overlapping memcpy 2");
769 if (ret < 0)
770 goto out;
771
772 memmove(memory + 4096 - 128, memory + 4096 - 64, 256);
773 memmove_extent_buffer(eb, 4096 - 128, 4096 - 64, 256);
774 ret = verify_eb_and_memory(eb, memory, "cross page overlapping memcpy 1");
775 if (ret < 0)
776 goto out;
777
778 memmove(memory + 4096 - 64, memory + 4096 - 128, 256);
779 memmove_extent_buffer(eb, 4096 - 64, 4096 - 128, 256);
780 ret = verify_eb_and_memory(eb, memory, "cross page overlapping memcpy 2");
781 if (ret < 0)
782 goto out;
783 }
784out:
785 free_extent_buffer(eb);
786 kvfree(memory);
787 btrfs_free_dummy_fs_info(fs_info);
788 return ret;
789}
790
791int btrfs_test_extent_io(u32 sectorsize, u32 nodesize)
792{
793 int ret;
794
795 test_msg("running extent I/O tests");
796
797 ret = test_find_delalloc(sectorsize);
798 if (ret)
799 goto out;
800
801 ret = test_find_first_clear_extent_bit();
802 if (ret)
803 goto out;
804
805 ret = test_eb_bitmaps(sectorsize, nodesize);
806 if (ret)
807 goto out;
808
809 ret = test_eb_mem_ops(sectorsize, nodesize);
810out:
811 return ret;
812}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2013 Fusion IO. All rights reserved.
4 */
5
6#include <linux/pagemap.h>
7#include <linux/pagevec.h>
8#include <linux/sched.h>
9#include <linux/slab.h>
10#include <linux/sizes.h>
11#include "btrfs-tests.h"
12#include "../ctree.h"
13#include "../extent_io.h"
14#include "../disk-io.h"
15#include "../btrfs_inode.h"
16
17#define PROCESS_UNLOCK (1 << 0)
18#define PROCESS_RELEASE (1 << 1)
19#define PROCESS_TEST_LOCKED (1 << 2)
20
21static noinline int process_page_range(struct inode *inode, u64 start, u64 end,
22 unsigned long flags)
23{
24 int ret;
25 struct folio_batch fbatch;
26 unsigned long index = start >> PAGE_SHIFT;
27 unsigned long end_index = end >> PAGE_SHIFT;
28 int i;
29 int count = 0;
30 int loops = 0;
31
32 folio_batch_init(&fbatch);
33
34 while (index <= end_index) {
35 ret = filemap_get_folios_contig(inode->i_mapping, &index,
36 end_index, &fbatch);
37 for (i = 0; i < ret; i++) {
38 struct folio *folio = fbatch.folios[i];
39
40 if (flags & PROCESS_TEST_LOCKED &&
41 !folio_test_locked(folio))
42 count++;
43 if (flags & PROCESS_UNLOCK && folio_test_locked(folio))
44 folio_unlock(folio);
45 if (flags & PROCESS_RELEASE)
46 folio_put(folio);
47 }
48 folio_batch_release(&fbatch);
49 cond_resched();
50 loops++;
51 if (loops > 100000) {
52 printk(KERN_ERR
53 "stuck in a loop, start %llu, end %llu, ret %d\n",
54 start, end, ret);
55 break;
56 }
57 }
58
59 return count;
60}
61
62#define STATE_FLAG_STR_LEN 256
63
64#define PRINT_ONE_FLAG(state, dest, cur, name) \
65({ \
66 if (state->state & EXTENT_##name) \
67 cur += scnprintf(dest + cur, STATE_FLAG_STR_LEN - cur, \
68 "%s" #name, cur == 0 ? "" : "|"); \
69})
70
71static void extent_flag_to_str(const struct extent_state *state, char *dest)
72{
73 int cur = 0;
74
75 dest[0] = 0;
76 PRINT_ONE_FLAG(state, dest, cur, DIRTY);
77 PRINT_ONE_FLAG(state, dest, cur, UPTODATE);
78 PRINT_ONE_FLAG(state, dest, cur, LOCKED);
79 PRINT_ONE_FLAG(state, dest, cur, NEW);
80 PRINT_ONE_FLAG(state, dest, cur, DELALLOC);
81 PRINT_ONE_FLAG(state, dest, cur, DEFRAG);
82 PRINT_ONE_FLAG(state, dest, cur, BOUNDARY);
83 PRINT_ONE_FLAG(state, dest, cur, NODATASUM);
84 PRINT_ONE_FLAG(state, dest, cur, CLEAR_META_RESV);
85 PRINT_ONE_FLAG(state, dest, cur, NEED_WAIT);
86 PRINT_ONE_FLAG(state, dest, cur, NORESERVE);
87 PRINT_ONE_FLAG(state, dest, cur, QGROUP_RESERVED);
88 PRINT_ONE_FLAG(state, dest, cur, CLEAR_DATA_RESV);
89}
90
91static void dump_extent_io_tree(const struct extent_io_tree *tree)
92{
93 struct rb_node *node;
94 char flags_str[STATE_FLAG_STR_LEN];
95
96 node = rb_first(&tree->state);
97 test_msg("io tree content:");
98 while (node) {
99 struct extent_state *state;
100
101 state = rb_entry(node, struct extent_state, rb_node);
102 extent_flag_to_str(state, flags_str);
103 test_msg(" start=%llu len=%llu flags=%s", state->start,
104 state->end + 1 - state->start, flags_str);
105 node = rb_next(node);
106 }
107}
108
109static int test_find_delalloc(u32 sectorsize, u32 nodesize)
110{
111 struct btrfs_fs_info *fs_info;
112 struct btrfs_root *root = NULL;
113 struct inode *inode = NULL;
114 struct extent_io_tree *tmp;
115 struct page *page;
116 struct page *locked_page = NULL;
117 unsigned long index = 0;
118 /* In this test we need at least 2 file extents at its maximum size */
119 u64 max_bytes = BTRFS_MAX_EXTENT_SIZE;
120 u64 total_dirty = 2 * max_bytes;
121 u64 start, end, test_start;
122 bool found;
123 int ret = -EINVAL;
124
125 test_msg("running find delalloc tests");
126
127 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
128 if (!fs_info) {
129 test_std_err(TEST_ALLOC_FS_INFO);
130 return -ENOMEM;
131 }
132
133 root = btrfs_alloc_dummy_root(fs_info);
134 if (IS_ERR(root)) {
135 test_std_err(TEST_ALLOC_ROOT);
136 ret = PTR_ERR(root);
137 goto out;
138 }
139
140 inode = btrfs_new_test_inode();
141 if (!inode) {
142 test_std_err(TEST_ALLOC_INODE);
143 ret = -ENOMEM;
144 goto out;
145 }
146 tmp = &BTRFS_I(inode)->io_tree;
147 BTRFS_I(inode)->root = root;
148
149 /*
150 * Passing NULL as we don't have fs_info but tracepoints are not used
151 * at this point
152 */
153 extent_io_tree_init(NULL, tmp, IO_TREE_SELFTEST);
154
155 /*
156 * First go through and create and mark all of our pages dirty, we pin
157 * everything to make sure our pages don't get evicted and screw up our
158 * test.
159 */
160 for (index = 0; index < (total_dirty >> PAGE_SHIFT); index++) {
161 page = find_or_create_page(inode->i_mapping, index, GFP_KERNEL);
162 if (!page) {
163 test_err("failed to allocate test page");
164 ret = -ENOMEM;
165 goto out;
166 }
167 SetPageDirty(page);
168 if (index) {
169 unlock_page(page);
170 } else {
171 get_page(page);
172 locked_page = page;
173 }
174 }
175
176 /* Test this scenario
177 * |--- delalloc ---|
178 * |--- search ---|
179 */
180 set_extent_bit(tmp, 0, sectorsize - 1, EXTENT_DELALLOC, NULL);
181 start = 0;
182 end = start + PAGE_SIZE - 1;
183 found = find_lock_delalloc_range(inode, locked_page, &start,
184 &end);
185 if (!found) {
186 test_err("should have found at least one delalloc");
187 goto out_bits;
188 }
189 if (start != 0 || end != (sectorsize - 1)) {
190 test_err("expected start 0 end %u, got start %llu end %llu",
191 sectorsize - 1, start, end);
192 goto out_bits;
193 }
194 unlock_extent(tmp, start, end, NULL);
195 unlock_page(locked_page);
196 put_page(locked_page);
197
198 /*
199 * Test this scenario
200 *
201 * |--- delalloc ---|
202 * |--- search ---|
203 */
204 test_start = SZ_64M;
205 locked_page = find_lock_page(inode->i_mapping,
206 test_start >> PAGE_SHIFT);
207 if (!locked_page) {
208 test_err("couldn't find the locked page");
209 goto out_bits;
210 }
211 set_extent_bit(tmp, sectorsize, max_bytes - 1, EXTENT_DELALLOC, NULL);
212 start = test_start;
213 end = start + PAGE_SIZE - 1;
214 found = find_lock_delalloc_range(inode, locked_page, &start,
215 &end);
216 if (!found) {
217 test_err("couldn't find delalloc in our range");
218 goto out_bits;
219 }
220 if (start != test_start || end != max_bytes - 1) {
221 test_err("expected start %llu end %llu, got start %llu, end %llu",
222 test_start, max_bytes - 1, start, end);
223 goto out_bits;
224 }
225 if (process_page_range(inode, start, end,
226 PROCESS_TEST_LOCKED | PROCESS_UNLOCK)) {
227 test_err("there were unlocked pages in the range");
228 goto out_bits;
229 }
230 unlock_extent(tmp, start, end, NULL);
231 /* locked_page was unlocked above */
232 put_page(locked_page);
233
234 /*
235 * Test this scenario
236 * |--- delalloc ---|
237 * |--- search ---|
238 */
239 test_start = max_bytes + sectorsize;
240 locked_page = find_lock_page(inode->i_mapping, test_start >>
241 PAGE_SHIFT);
242 if (!locked_page) {
243 test_err("couldn't find the locked page");
244 goto out_bits;
245 }
246 start = test_start;
247 end = start + PAGE_SIZE - 1;
248 found = find_lock_delalloc_range(inode, locked_page, &start,
249 &end);
250 if (found) {
251 test_err("found range when we shouldn't have");
252 goto out_bits;
253 }
254 if (end != test_start + PAGE_SIZE - 1) {
255 test_err("did not return the proper end offset");
256 goto out_bits;
257 }
258
259 /*
260 * Test this scenario
261 * [------- delalloc -------|
262 * [max_bytes]|-- search--|
263 *
264 * We are re-using our test_start from above since it works out well.
265 */
266 set_extent_bit(tmp, max_bytes, total_dirty - 1, EXTENT_DELALLOC, NULL);
267 start = test_start;
268 end = start + PAGE_SIZE - 1;
269 found = find_lock_delalloc_range(inode, locked_page, &start,
270 &end);
271 if (!found) {
272 test_err("didn't find our range");
273 goto out_bits;
274 }
275 if (start != test_start || end != total_dirty - 1) {
276 test_err("expected start %llu end %llu, got start %llu end %llu",
277 test_start, total_dirty - 1, start, end);
278 goto out_bits;
279 }
280 if (process_page_range(inode, start, end,
281 PROCESS_TEST_LOCKED | PROCESS_UNLOCK)) {
282 test_err("pages in range were not all locked");
283 goto out_bits;
284 }
285 unlock_extent(tmp, start, end, NULL);
286
287 /*
288 * Now to test where we run into a page that is no longer dirty in the
289 * range we want to find.
290 */
291 page = find_get_page(inode->i_mapping,
292 (max_bytes + SZ_1M) >> PAGE_SHIFT);
293 if (!page) {
294 test_err("couldn't find our page");
295 goto out_bits;
296 }
297 ClearPageDirty(page);
298 put_page(page);
299
300 /* We unlocked it in the previous test */
301 lock_page(locked_page);
302 start = test_start;
303 end = start + PAGE_SIZE - 1;
304 /*
305 * Currently if we fail to find dirty pages in the delalloc range we
306 * will adjust max_bytes down to PAGE_SIZE and then re-search. If
307 * this changes at any point in the future we will need to fix this
308 * tests expected behavior.
309 */
310 found = find_lock_delalloc_range(inode, locked_page, &start,
311 &end);
312 if (!found) {
313 test_err("didn't find our range");
314 goto out_bits;
315 }
316 if (start != test_start && end != test_start + PAGE_SIZE - 1) {
317 test_err("expected start %llu end %llu, got start %llu end %llu",
318 test_start, test_start + PAGE_SIZE - 1, start, end);
319 goto out_bits;
320 }
321 if (process_page_range(inode, start, end, PROCESS_TEST_LOCKED |
322 PROCESS_UNLOCK)) {
323 test_err("pages in range were not all locked");
324 goto out_bits;
325 }
326 ret = 0;
327out_bits:
328 if (ret)
329 dump_extent_io_tree(tmp);
330 clear_extent_bits(tmp, 0, total_dirty - 1, (unsigned)-1);
331out:
332 if (locked_page)
333 put_page(locked_page);
334 process_page_range(inode, 0, total_dirty - 1,
335 PROCESS_UNLOCK | PROCESS_RELEASE);
336 iput(inode);
337 btrfs_free_dummy_root(root);
338 btrfs_free_dummy_fs_info(fs_info);
339 return ret;
340}
341
342static int check_eb_bitmap(unsigned long *bitmap, struct extent_buffer *eb)
343{
344 unsigned long i;
345
346 for (i = 0; i < eb->len * BITS_PER_BYTE; i++) {
347 int bit, bit1;
348
349 bit = !!test_bit(i, bitmap);
350 bit1 = !!extent_buffer_test_bit(eb, 0, i);
351 if (bit1 != bit) {
352 u8 has;
353 u8 expect;
354
355 read_extent_buffer(eb, &has, i / BITS_PER_BYTE, 1);
356 expect = bitmap_get_value8(bitmap, ALIGN(i, BITS_PER_BYTE));
357
358 test_err(
359 "bits do not match, start byte 0 bit %lu, byte %lu has 0x%02x expect 0x%02x",
360 i, i / BITS_PER_BYTE, has, expect);
361 return -EINVAL;
362 }
363
364 bit1 = !!extent_buffer_test_bit(eb, i / BITS_PER_BYTE,
365 i % BITS_PER_BYTE);
366 if (bit1 != bit) {
367 u8 has;
368 u8 expect;
369
370 read_extent_buffer(eb, &has, i / BITS_PER_BYTE, 1);
371 expect = bitmap_get_value8(bitmap, ALIGN(i, BITS_PER_BYTE));
372
373 test_err(
374 "bits do not match, start byte %lu bit %lu, byte %lu has 0x%02x expect 0x%02x",
375 i / BITS_PER_BYTE, i % BITS_PER_BYTE,
376 i / BITS_PER_BYTE, has, expect);
377 return -EINVAL;
378 }
379 }
380 return 0;
381}
382
383static int test_bitmap_set(const char *name, unsigned long *bitmap,
384 struct extent_buffer *eb,
385 unsigned long byte_start, unsigned long bit_start,
386 unsigned long bit_len)
387{
388 int ret;
389
390 bitmap_set(bitmap, byte_start * BITS_PER_BYTE + bit_start, bit_len);
391 extent_buffer_bitmap_set(eb, byte_start, bit_start, bit_len);
392 ret = check_eb_bitmap(bitmap, eb);
393 if (ret < 0)
394 test_err("%s test failed", name);
395 return ret;
396}
397
398static int test_bitmap_clear(const char *name, unsigned long *bitmap,
399 struct extent_buffer *eb,
400 unsigned long byte_start, unsigned long bit_start,
401 unsigned long bit_len)
402{
403 int ret;
404
405 bitmap_clear(bitmap, byte_start * BITS_PER_BYTE + bit_start, bit_len);
406 extent_buffer_bitmap_clear(eb, byte_start, bit_start, bit_len);
407 ret = check_eb_bitmap(bitmap, eb);
408 if (ret < 0)
409 test_err("%s test failed", name);
410 return ret;
411}
412static int __test_eb_bitmaps(unsigned long *bitmap, struct extent_buffer *eb)
413{
414 unsigned long i, j;
415 unsigned long byte_len = eb->len;
416 u32 x;
417 int ret;
418
419 ret = test_bitmap_clear("clear all run 1", bitmap, eb, 0, 0,
420 byte_len * BITS_PER_BYTE);
421 if (ret < 0)
422 return ret;
423
424 ret = test_bitmap_set("set all", bitmap, eb, 0, 0, byte_len * BITS_PER_BYTE);
425 if (ret < 0)
426 return ret;
427
428 ret = test_bitmap_clear("clear all run 2", bitmap, eb, 0, 0,
429 byte_len * BITS_PER_BYTE);
430 if (ret < 0)
431 return ret;
432
433 ret = test_bitmap_set("same byte set", bitmap, eb, 0, 2, 4);
434 if (ret < 0)
435 return ret;
436
437 ret = test_bitmap_clear("same byte partial clear", bitmap, eb, 0, 4, 1);
438 if (ret < 0)
439 return ret;
440
441 ret = test_bitmap_set("cross byte set", bitmap, eb, 2, 4, 8);
442 if (ret < 0)
443 return ret;
444
445 ret = test_bitmap_set("cross multi byte set", bitmap, eb, 4, 4, 24);
446 if (ret < 0)
447 return ret;
448
449 ret = test_bitmap_clear("cross byte clear", bitmap, eb, 2, 6, 4);
450 if (ret < 0)
451 return ret;
452
453 ret = test_bitmap_clear("cross multi byte clear", bitmap, eb, 4, 6, 20);
454 if (ret < 0)
455 return ret;
456
457 /* Straddling pages test */
458 if (byte_len > PAGE_SIZE) {
459 ret = test_bitmap_set("cross page set", bitmap, eb,
460 PAGE_SIZE - sizeof(long) / 2, 0,
461 sizeof(long) * BITS_PER_BYTE);
462 if (ret < 0)
463 return ret;
464
465 ret = test_bitmap_set("cross page set all", bitmap, eb, 0, 0,
466 byte_len * BITS_PER_BYTE);
467 if (ret < 0)
468 return ret;
469
470 ret = test_bitmap_clear("cross page clear", bitmap, eb,
471 PAGE_SIZE - sizeof(long) / 2, 0,
472 sizeof(long) * BITS_PER_BYTE);
473 if (ret < 0)
474 return ret;
475 }
476
477 /*
478 * Generate a wonky pseudo-random bit pattern for the sake of not using
479 * something repetitive that could miss some hypothetical off-by-n bug.
480 */
481 x = 0;
482 ret = test_bitmap_clear("clear all run 3", bitmap, eb, 0, 0,
483 byte_len * BITS_PER_BYTE);
484 if (ret < 0)
485 return ret;
486
487 for (i = 0; i < byte_len * BITS_PER_BYTE / 32; i++) {
488 x = (0x19660dULL * (u64)x + 0x3c6ef35fULL) & 0xffffffffU;
489 for (j = 0; j < 32; j++) {
490 if (x & (1U << j)) {
491 bitmap_set(bitmap, i * 32 + j, 1);
492 extent_buffer_bitmap_set(eb, 0, i * 32 + j, 1);
493 }
494 }
495 }
496
497 ret = check_eb_bitmap(bitmap, eb);
498 if (ret) {
499 test_err("random bit pattern failed");
500 return ret;
501 }
502
503 return 0;
504}
505
506static int test_eb_bitmaps(u32 sectorsize, u32 nodesize)
507{
508 struct btrfs_fs_info *fs_info;
509 unsigned long *bitmap = NULL;
510 struct extent_buffer *eb = NULL;
511 int ret;
512
513 test_msg("running extent buffer bitmap tests");
514
515 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
516 if (!fs_info) {
517 test_std_err(TEST_ALLOC_FS_INFO);
518 return -ENOMEM;
519 }
520
521 bitmap = kmalloc(nodesize, GFP_KERNEL);
522 if (!bitmap) {
523 test_err("couldn't allocate test bitmap");
524 ret = -ENOMEM;
525 goto out;
526 }
527
528 eb = __alloc_dummy_extent_buffer(fs_info, 0, nodesize);
529 if (!eb) {
530 test_std_err(TEST_ALLOC_ROOT);
531 ret = -ENOMEM;
532 goto out;
533 }
534
535 ret = __test_eb_bitmaps(bitmap, eb);
536 if (ret)
537 goto out;
538
539 free_extent_buffer(eb);
540
541 /*
542 * Test again for case where the tree block is sectorsize aligned but
543 * not nodesize aligned.
544 */
545 eb = __alloc_dummy_extent_buffer(fs_info, sectorsize, nodesize);
546 if (!eb) {
547 test_std_err(TEST_ALLOC_ROOT);
548 ret = -ENOMEM;
549 goto out;
550 }
551
552 ret = __test_eb_bitmaps(bitmap, eb);
553out:
554 free_extent_buffer(eb);
555 kfree(bitmap);
556 btrfs_free_dummy_fs_info(fs_info);
557 return ret;
558}
559
560static int test_find_first_clear_extent_bit(void)
561{
562 struct extent_io_tree tree;
563 u64 start, end;
564 int ret = -EINVAL;
565
566 test_msg("running find_first_clear_extent_bit test");
567
568 extent_io_tree_init(NULL, &tree, IO_TREE_SELFTEST);
569
570 /* Test correct handling of empty tree */
571 find_first_clear_extent_bit(&tree, 0, &start, &end, CHUNK_TRIMMED);
572 if (start != 0 || end != -1) {
573 test_err(
574 "error getting a range from completely empty tree: start %llu end %llu",
575 start, end);
576 goto out;
577 }
578 /*
579 * Set 1M-4M alloc/discard and 32M-64M thus leaving a hole between
580 * 4M-32M
581 */
582 set_extent_bit(&tree, SZ_1M, SZ_4M - 1,
583 CHUNK_TRIMMED | CHUNK_ALLOCATED, NULL);
584
585 find_first_clear_extent_bit(&tree, SZ_512K, &start, &end,
586 CHUNK_TRIMMED | CHUNK_ALLOCATED);
587
588 if (start != 0 || end != SZ_1M - 1) {
589 test_err("error finding beginning range: start %llu end %llu",
590 start, end);
591 goto out;
592 }
593
594 /* Now add 32M-64M so that we have a hole between 4M-32M */
595 set_extent_bit(&tree, SZ_32M, SZ_64M - 1,
596 CHUNK_TRIMMED | CHUNK_ALLOCATED, NULL);
597
598 /*
599 * Request first hole starting at 12M, we should get 4M-32M
600 */
601 find_first_clear_extent_bit(&tree, 12 * SZ_1M, &start, &end,
602 CHUNK_TRIMMED | CHUNK_ALLOCATED);
603
604 if (start != SZ_4M || end != SZ_32M - 1) {
605 test_err("error finding trimmed range: start %llu end %llu",
606 start, end);
607 goto out;
608 }
609
610 /*
611 * Search in the middle of allocated range, should get the next one
612 * available, which happens to be unallocated -> 4M-32M
613 */
614 find_first_clear_extent_bit(&tree, SZ_2M, &start, &end,
615 CHUNK_TRIMMED | CHUNK_ALLOCATED);
616
617 if (start != SZ_4M || end != SZ_32M - 1) {
618 test_err("error finding next unalloc range: start %llu end %llu",
619 start, end);
620 goto out;
621 }
622
623 /*
624 * Set 64M-72M with CHUNK_ALLOC flag, then search for CHUNK_TRIMMED flag
625 * being unset in this range, we should get the entry in range 64M-72M
626 */
627 set_extent_bit(&tree, SZ_64M, SZ_64M + SZ_8M - 1, CHUNK_ALLOCATED, NULL);
628 find_first_clear_extent_bit(&tree, SZ_64M + SZ_1M, &start, &end,
629 CHUNK_TRIMMED);
630
631 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) {
632 test_err("error finding exact range: start %llu end %llu",
633 start, end);
634 goto out;
635 }
636
637 find_first_clear_extent_bit(&tree, SZ_64M - SZ_8M, &start, &end,
638 CHUNK_TRIMMED);
639
640 /*
641 * Search in the middle of set range whose immediate neighbour doesn't
642 * have the bits set so it must be returned
643 */
644 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) {
645 test_err("error finding next alloc range: start %llu end %llu",
646 start, end);
647 goto out;
648 }
649
650 /*
651 * Search beyond any known range, shall return after last known range
652 * and end should be -1
653 */
654 find_first_clear_extent_bit(&tree, -1, &start, &end, CHUNK_TRIMMED);
655 if (start != SZ_64M + SZ_8M || end != -1) {
656 test_err(
657 "error handling beyond end of range search: start %llu end %llu",
658 start, end);
659 goto out;
660 }
661
662 ret = 0;
663out:
664 if (ret)
665 dump_extent_io_tree(&tree);
666 clear_extent_bits(&tree, 0, (u64)-1, CHUNK_TRIMMED | CHUNK_ALLOCATED);
667
668 return ret;
669}
670
671static void dump_eb_and_memory_contents(struct extent_buffer *eb, void *memory,
672 const char *test_name)
673{
674 for (int i = 0; i < eb->len; i++) {
675 struct page *page = folio_page(eb->folios[i >> PAGE_SHIFT], 0);
676 void *addr = page_address(page) + offset_in_page(i);
677
678 if (memcmp(addr, memory + i, 1) != 0) {
679 test_err("%s failed", test_name);
680 test_err("eb and memory diffs at byte %u, eb has 0x%02x memory has 0x%02x",
681 i, *(u8 *)addr, *(u8 *)(memory + i));
682 return;
683 }
684 }
685}
686
687static int verify_eb_and_memory(struct extent_buffer *eb, void *memory,
688 const char *test_name)
689{
690 for (int i = 0; i < (eb->len >> PAGE_SHIFT); i++) {
691 void *eb_addr = folio_address(eb->folios[i]);
692
693 if (memcmp(memory + (i << PAGE_SHIFT), eb_addr, PAGE_SIZE) != 0) {
694 dump_eb_and_memory_contents(eb, memory, test_name);
695 return -EUCLEAN;
696 }
697 }
698 return 0;
699}
700
701/*
702 * Init both memory and extent buffer contents to the same randomly generated
703 * contents.
704 */
705static void init_eb_and_memory(struct extent_buffer *eb, void *memory)
706{
707 get_random_bytes(memory, eb->len);
708 write_extent_buffer(eb, memory, 0, eb->len);
709}
710
711static int test_eb_mem_ops(u32 sectorsize, u32 nodesize)
712{
713 struct btrfs_fs_info *fs_info;
714 struct extent_buffer *eb = NULL;
715 void *memory = NULL;
716 int ret;
717
718 test_msg("running extent buffer memory operation tests");
719
720 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
721 if (!fs_info) {
722 test_std_err(TEST_ALLOC_FS_INFO);
723 return -ENOMEM;
724 }
725
726 memory = kvzalloc(nodesize, GFP_KERNEL);
727 if (!memory) {
728 test_err("failed to allocate memory");
729 ret = -ENOMEM;
730 goto out;
731 }
732
733 eb = __alloc_dummy_extent_buffer(fs_info, SZ_1M, nodesize);
734 if (!eb) {
735 test_std_err(TEST_ALLOC_EXTENT_BUFFER);
736 ret = -ENOMEM;
737 goto out;
738 }
739
740 init_eb_and_memory(eb, memory);
741 ret = verify_eb_and_memory(eb, memory, "full eb write");
742 if (ret < 0)
743 goto out;
744
745 memcpy(memory, memory + 16, 16);
746 memcpy_extent_buffer(eb, 0, 16, 16);
747 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 1");
748 if (ret < 0)
749 goto out;
750
751 memcpy(memory, memory + 2048, 16);
752 memcpy_extent_buffer(eb, 0, 2048, 16);
753 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 2");
754 if (ret < 0)
755 goto out;
756 memcpy(memory, memory + 2048, 2048);
757 memcpy_extent_buffer(eb, 0, 2048, 2048);
758 ret = verify_eb_and_memory(eb, memory, "same page non-overlapping memcpy 3");
759 if (ret < 0)
760 goto out;
761
762 memmove(memory + 512, memory + 256, 512);
763 memmove_extent_buffer(eb, 512, 256, 512);
764 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 1");
765 if (ret < 0)
766 goto out;
767
768 memmove(memory + 2048, memory + 512, 2048);
769 memmove_extent_buffer(eb, 2048, 512, 2048);
770 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 2");
771 if (ret < 0)
772 goto out;
773 memmove(memory + 512, memory + 2048, 2048);
774 memmove_extent_buffer(eb, 512, 2048, 2048);
775 ret = verify_eb_and_memory(eb, memory, "same page overlapping memcpy 3");
776 if (ret < 0)
777 goto out;
778
779 if (nodesize > PAGE_SIZE) {
780 memcpy(memory, memory + 4096 - 128, 256);
781 memcpy_extent_buffer(eb, 0, 4096 - 128, 256);
782 ret = verify_eb_and_memory(eb, memory, "cross page non-overlapping memcpy 1");
783 if (ret < 0)
784 goto out;
785
786 memcpy(memory + 4096 - 128, memory + 4096 + 128, 256);
787 memcpy_extent_buffer(eb, 4096 - 128, 4096 + 128, 256);
788 ret = verify_eb_and_memory(eb, memory, "cross page non-overlapping memcpy 2");
789 if (ret < 0)
790 goto out;
791
792 memmove(memory + 4096 - 128, memory + 4096 - 64, 256);
793 memmove_extent_buffer(eb, 4096 - 128, 4096 - 64, 256);
794 ret = verify_eb_and_memory(eb, memory, "cross page overlapping memcpy 1");
795 if (ret < 0)
796 goto out;
797
798 memmove(memory + 4096 - 64, memory + 4096 - 128, 256);
799 memmove_extent_buffer(eb, 4096 - 64, 4096 - 128, 256);
800 ret = verify_eb_and_memory(eb, memory, "cross page overlapping memcpy 2");
801 if (ret < 0)
802 goto out;
803 }
804out:
805 free_extent_buffer(eb);
806 kvfree(memory);
807 btrfs_free_dummy_fs_info(fs_info);
808 return ret;
809}
810
811int btrfs_test_extent_io(u32 sectorsize, u32 nodesize)
812{
813 int ret;
814
815 test_msg("running extent I/O tests");
816
817 ret = test_find_delalloc(sectorsize, nodesize);
818 if (ret)
819 goto out;
820
821 ret = test_find_first_clear_extent_bit();
822 if (ret)
823 goto out;
824
825 ret = test_eb_bitmaps(sectorsize, nodesize);
826 if (ret)
827 goto out;
828
829 ret = test_eb_mem_ops(sectorsize, nodesize);
830out:
831 return ret;
832}