1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2013 Fusion IO. All rights reserved.
6 #include <linux/pagemap.h>
7 #include <linux/sched.h>
8 #include <linux/slab.h>
9 #include <linux/sizes.h>
10 #include "btrfs-tests.h"
12 #include "../extent_io.h"
13 #include "../btrfs_inode.h"
15 #define PROCESS_UNLOCK (1 << 0)
16 #define PROCESS_RELEASE (1 << 1)
17 #define PROCESS_TEST_LOCKED (1 << 2)
19 static noinline int process_page_range(struct inode *inode, u64 start, u64 end,
23 struct page *pages[16];
24 unsigned long index = start >> PAGE_SHIFT;
25 unsigned long end_index = end >> PAGE_SHIFT;
26 unsigned long nr_pages = end_index - index + 1;
31 while (nr_pages > 0) {
32 ret = find_get_pages_contig(inode->i_mapping, index,
33 min_t(unsigned long, nr_pages,
34 ARRAY_SIZE(pages)), pages);
35 for (i = 0; i < ret; i++) {
36 if (flags & PROCESS_TEST_LOCKED &&
37 !PageLocked(pages[i]))
39 if (flags & PROCESS_UNLOCK && PageLocked(pages[i]))
40 unlock_page(pages[i]);
42 if (flags & PROCESS_RELEASE)
51 "stuck in a loop, start %llu, end %llu, nr_pages %lu, ret %d\n",
52 start, end, nr_pages, ret);
59 static int test_find_delalloc(u32 sectorsize)
62 struct extent_io_tree *tmp;
64 struct page *locked_page = NULL;
65 unsigned long index = 0;
66 /* In this test we need at least 2 file extents at its maximum size */
67 u64 max_bytes = BTRFS_MAX_EXTENT_SIZE;
68 u64 total_dirty = 2 * max_bytes;
69 u64 start, end, test_start;
73 test_msg("running find delalloc tests");
75 inode = btrfs_new_test_inode();
77 test_std_err(TEST_ALLOC_INODE);
80 tmp = &BTRFS_I(inode)->io_tree;
83 * Passing NULL as we don't have fs_info but tracepoints are not used
86 extent_io_tree_init(NULL, tmp, IO_TREE_SELFTEST, NULL);
89 * First go through and create and mark all of our pages dirty, we pin
90 * everything to make sure our pages don't get evicted and screw up our
93 for (index = 0; index < (total_dirty >> PAGE_SHIFT); index++) {
94 page = find_or_create_page(inode->i_mapping, index, GFP_KERNEL);
96 test_err("failed to allocate test page");
109 /* Test this scenario
113 set_extent_delalloc(tmp, 0, sectorsize - 1, 0, NULL);
116 found = find_lock_delalloc_range(inode, locked_page, &start,
119 test_err("should have found at least one delalloc");
122 if (start != 0 || end != (sectorsize - 1)) {
123 test_err("expected start 0 end %u, got start %llu end %llu",
124 sectorsize - 1, start, end);
127 unlock_extent(tmp, start, end);
128 unlock_page(locked_page);
129 put_page(locked_page);
138 locked_page = find_lock_page(inode->i_mapping,
139 test_start >> PAGE_SHIFT);
141 test_err("couldn't find the locked page");
144 set_extent_delalloc(tmp, sectorsize, max_bytes - 1, 0, NULL);
147 found = find_lock_delalloc_range(inode, locked_page, &start,
150 test_err("couldn't find delalloc in our range");
153 if (start != test_start || end != max_bytes - 1) {
154 test_err("expected start %llu end %llu, got start %llu, end %llu",
155 test_start, max_bytes - 1, start, end);
158 if (process_page_range(inode, start, end,
159 PROCESS_TEST_LOCKED | PROCESS_UNLOCK)) {
160 test_err("there were unlocked pages in the range");
163 unlock_extent(tmp, start, end);
164 /* locked_page was unlocked above */
165 put_page(locked_page);
172 test_start = max_bytes + sectorsize;
173 locked_page = find_lock_page(inode->i_mapping, test_start >>
176 test_err("couldn't find the locked page");
181 found = find_lock_delalloc_range(inode, locked_page, &start,
184 test_err("found range when we shouldn't have");
187 if (end != (u64)-1) {
188 test_err("did not return the proper end offset");
194 * [------- delalloc -------|
195 * [max_bytes]|-- search--|
197 * We are re-using our test_start from above since it works out well.
199 set_extent_delalloc(tmp, max_bytes, total_dirty - 1, 0, NULL);
202 found = find_lock_delalloc_range(inode, locked_page, &start,
205 test_err("didn't find our range");
208 if (start != test_start || end != total_dirty - 1) {
209 test_err("expected start %llu end %llu, got start %llu end %llu",
210 test_start, total_dirty - 1, start, end);
213 if (process_page_range(inode, start, end,
214 PROCESS_TEST_LOCKED | PROCESS_UNLOCK)) {
215 test_err("pages in range were not all locked");
218 unlock_extent(tmp, start, end);
221 * Now to test where we run into a page that is no longer dirty in the
222 * range we want to find.
224 page = find_get_page(inode->i_mapping,
225 (max_bytes + SZ_1M) >> PAGE_SHIFT);
227 test_err("couldn't find our page");
230 ClearPageDirty(page);
233 /* We unlocked it in the previous test */
234 lock_page(locked_page);
238 * Currently if we fail to find dirty pages in the delalloc range we
239 * will adjust max_bytes down to PAGE_SIZE and then re-search. If
240 * this changes at any point in the future we will need to fix this
241 * tests expected behavior.
243 found = find_lock_delalloc_range(inode, locked_page, &start,
246 test_err("didn't find our range");
249 if (start != test_start && end != test_start + PAGE_SIZE - 1) {
250 test_err("expected start %llu end %llu, got start %llu end %llu",
251 test_start, test_start + PAGE_SIZE - 1, start, end);
254 if (process_page_range(inode, start, end, PROCESS_TEST_LOCKED |
256 test_err("pages in range were not all locked");
261 clear_extent_bits(tmp, 0, total_dirty - 1, (unsigned)-1);
264 put_page(locked_page);
265 process_page_range(inode, 0, total_dirty - 1,
266 PROCESS_UNLOCK | PROCESS_RELEASE);
271 static int check_eb_bitmap(unsigned long *bitmap, struct extent_buffer *eb,
276 for (i = 0; i < len * BITS_PER_BYTE; i++) {
279 bit = !!test_bit(i, bitmap);
280 bit1 = !!extent_buffer_test_bit(eb, 0, i);
282 test_err("bits do not match");
286 bit1 = !!extent_buffer_test_bit(eb, i / BITS_PER_BYTE,
289 test_err("offset bits do not match");
296 static int __test_eb_bitmaps(unsigned long *bitmap, struct extent_buffer *eb,
303 memset(bitmap, 0, len);
304 memzero_extent_buffer(eb, 0, len);
305 if (memcmp_extent_buffer(eb, bitmap, 0, len) != 0) {
306 test_err("bitmap was not zeroed");
310 bitmap_set(bitmap, 0, len * BITS_PER_BYTE);
311 extent_buffer_bitmap_set(eb, 0, 0, len * BITS_PER_BYTE);
312 ret = check_eb_bitmap(bitmap, eb, len);
314 test_err("setting all bits failed");
318 bitmap_clear(bitmap, 0, len * BITS_PER_BYTE);
319 extent_buffer_bitmap_clear(eb, 0, 0, len * BITS_PER_BYTE);
320 ret = check_eb_bitmap(bitmap, eb, len);
322 test_err("clearing all bits failed");
326 /* Straddling pages test */
327 if (len > PAGE_SIZE) {
329 (PAGE_SIZE - sizeof(long) / 2) * BITS_PER_BYTE,
330 sizeof(long) * BITS_PER_BYTE);
331 extent_buffer_bitmap_set(eb, PAGE_SIZE - sizeof(long) / 2, 0,
332 sizeof(long) * BITS_PER_BYTE);
333 ret = check_eb_bitmap(bitmap, eb, len);
335 test_err("setting straddling pages failed");
339 bitmap_set(bitmap, 0, len * BITS_PER_BYTE);
341 (PAGE_SIZE - sizeof(long) / 2) * BITS_PER_BYTE,
342 sizeof(long) * BITS_PER_BYTE);
343 extent_buffer_bitmap_set(eb, 0, 0, len * BITS_PER_BYTE);
344 extent_buffer_bitmap_clear(eb, PAGE_SIZE - sizeof(long) / 2, 0,
345 sizeof(long) * BITS_PER_BYTE);
346 ret = check_eb_bitmap(bitmap, eb, len);
348 test_err("clearing straddling pages failed");
354 * Generate a wonky pseudo-random bit pattern for the sake of not using
355 * something repetitive that could miss some hypothetical off-by-n bug.
358 bitmap_clear(bitmap, 0, len * BITS_PER_BYTE);
359 extent_buffer_bitmap_clear(eb, 0, 0, len * BITS_PER_BYTE);
360 for (i = 0; i < len * BITS_PER_BYTE / 32; i++) {
361 x = (0x19660dULL * (u64)x + 0x3c6ef35fULL) & 0xffffffffU;
362 for (j = 0; j < 32; j++) {
364 bitmap_set(bitmap, i * 32 + j, 1);
365 extent_buffer_bitmap_set(eb, 0, i * 32 + j, 1);
370 ret = check_eb_bitmap(bitmap, eb, len);
372 test_err("random bit pattern failed");
379 static int test_eb_bitmaps(u32 sectorsize, u32 nodesize)
381 struct btrfs_fs_info *fs_info;
383 unsigned long *bitmap = NULL;
384 struct extent_buffer *eb = NULL;
387 test_msg("running extent buffer bitmap tests");
390 * In ppc64, sectorsize can be 64K, thus 4 * 64K will be larger than
391 * BTRFS_MAX_METADATA_BLOCKSIZE.
393 len = (sectorsize < BTRFS_MAX_METADATA_BLOCKSIZE)
394 ? sectorsize * 4 : sectorsize;
396 fs_info = btrfs_alloc_dummy_fs_info(len, len);
398 test_std_err(TEST_ALLOC_FS_INFO);
402 bitmap = kmalloc(len, GFP_KERNEL);
404 test_err("couldn't allocate test bitmap");
409 eb = __alloc_dummy_extent_buffer(fs_info, 0, len);
411 test_std_err(TEST_ALLOC_ROOT);
416 ret = __test_eb_bitmaps(bitmap, eb, len);
420 /* Do it over again with an extent buffer which isn't page-aligned. */
421 free_extent_buffer(eb);
422 eb = __alloc_dummy_extent_buffer(fs_info, nodesize / 2, len);
424 test_std_err(TEST_ALLOC_ROOT);
429 ret = __test_eb_bitmaps(bitmap, eb, len);
431 free_extent_buffer(eb);
433 btrfs_free_dummy_fs_info(fs_info);
437 static int test_find_first_clear_extent_bit(void)
439 struct extent_io_tree tree;
443 test_msg("running find_first_clear_extent_bit test");
445 extent_io_tree_init(NULL, &tree, IO_TREE_SELFTEST, NULL);
447 /* Test correct handling of empty tree */
448 find_first_clear_extent_bit(&tree, 0, &start, &end, CHUNK_TRIMMED);
449 if (start != 0 || end != -1) {
451 "error getting a range from completely empty tree: start %llu end %llu",
456 * Set 1M-4M alloc/discard and 32M-64M thus leaving a hole between
459 set_extent_bits(&tree, SZ_1M, SZ_4M - 1,
460 CHUNK_TRIMMED | CHUNK_ALLOCATED);
462 find_first_clear_extent_bit(&tree, SZ_512K, &start, &end,
463 CHUNK_TRIMMED | CHUNK_ALLOCATED);
465 if (start != 0 || end != SZ_1M - 1) {
466 test_err("error finding beginning range: start %llu end %llu",
471 /* Now add 32M-64M so that we have a hole between 4M-32M */
472 set_extent_bits(&tree, SZ_32M, SZ_64M - 1,
473 CHUNK_TRIMMED | CHUNK_ALLOCATED);
476 * Request first hole starting at 12M, we should get 4M-32M
478 find_first_clear_extent_bit(&tree, 12 * SZ_1M, &start, &end,
479 CHUNK_TRIMMED | CHUNK_ALLOCATED);
481 if (start != SZ_4M || end != SZ_32M - 1) {
482 test_err("error finding trimmed range: start %llu end %llu",
488 * Search in the middle of allocated range, should get the next one
489 * available, which happens to be unallocated -> 4M-32M
491 find_first_clear_extent_bit(&tree, SZ_2M, &start, &end,
492 CHUNK_TRIMMED | CHUNK_ALLOCATED);
494 if (start != SZ_4M || end != SZ_32M - 1) {
495 test_err("error finding next unalloc range: start %llu end %llu",
501 * Set 64M-72M with CHUNK_ALLOC flag, then search for CHUNK_TRIMMED flag
502 * being unset in this range, we should get the entry in range 64M-72M
504 set_extent_bits(&tree, SZ_64M, SZ_64M + SZ_8M - 1, CHUNK_ALLOCATED);
505 find_first_clear_extent_bit(&tree, SZ_64M + SZ_1M, &start, &end,
508 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) {
509 test_err("error finding exact range: start %llu end %llu",
514 find_first_clear_extent_bit(&tree, SZ_64M - SZ_8M, &start, &end,
518 * Search in the middle of set range whose immediate neighbour doesn't
519 * have the bits set so it must be returned
521 if (start != SZ_64M || end != SZ_64M + SZ_8M - 1) {
522 test_err("error finding next alloc range: start %llu end %llu",
528 * Search beyond any known range, shall return after last known range
529 * and end should be -1
531 find_first_clear_extent_bit(&tree, -1, &start, &end, CHUNK_TRIMMED);
532 if (start != SZ_64M + SZ_8M || end != -1) {
534 "error handling beyond end of range search: start %llu end %llu",
541 clear_extent_bits(&tree, 0, (u64)-1, CHUNK_TRIMMED | CHUNK_ALLOCATED);
546 int btrfs_test_extent_io(u32 sectorsize, u32 nodesize)
550 test_msg("running extent I/O tests");
552 ret = test_find_delalloc(sectorsize);
556 ret = test_find_first_clear_extent_bit();
560 ret = test_eb_bitmaps(sectorsize, nodesize);