1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2017 Oracle. All rights reserved.
6 #include <linux/types.h>
7 #include "btrfs-tests.h"
9 #include "../btrfs_inode.h"
10 #include "../volumes.h"
11 #include "../disk-io.h"
12 #include "../block-group.h"
14 static void free_extent_map_tree(struct extent_map_tree *em_tree)
16 struct extent_map *em;
19 write_lock(&em_tree->lock);
20 while (!RB_EMPTY_ROOT(&em_tree->map.rb_root)) {
21 node = rb_first_cached(&em_tree->map);
22 em = rb_entry(node, struct extent_map, rb_node);
23 remove_extent_mapping(em_tree, em);
25 #ifdef CONFIG_BTRFS_DEBUG
26 if (refcount_read(&em->refs) != 1) {
28 "em leak: em (start %llu len %llu block_start %llu block_len %llu) refs %d",
29 em->start, em->len, em->block_start,
30 em->block_len, refcount_read(&em->refs));
32 refcount_set(&em->refs, 1);
37 write_unlock(&em_tree->lock);
43 * Suppose that no extent map has been loaded into memory yet, there is a file
44 * extent [0, 16K), followed by another file extent [16K, 20K), two dio reads
45 * are entering btrfs_get_extent() concurrently, t1 is reading [8K, 16K), t2 is
49 * btrfs_get_extent() btrfs_get_extent()
50 * -> lookup_extent_mapping() ->lookup_extent_mapping()
51 * -> add_extent_mapping(0, 16K)
53 * ->add_extent_mapping(0, 16K)
56 static int test_case_1(struct btrfs_fs_info *fs_info,
57 struct extent_map_tree *em_tree)
59 struct extent_map *em;
64 em = alloc_extent_map();
66 test_std_err(TEST_ALLOC_EXTENT_MAP);
74 em->block_len = SZ_16K;
75 write_lock(&em_tree->lock);
76 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
77 write_unlock(&em_tree->lock);
79 test_err("cannot add extent range [0, 16K)");
84 /* Add [16K, 20K) following [0, 16K) */
85 em = alloc_extent_map();
87 test_std_err(TEST_ALLOC_EXTENT_MAP);
94 em->block_start = SZ_32K; /* avoid merging */
95 em->block_len = SZ_4K;
96 write_lock(&em_tree->lock);
97 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
98 write_unlock(&em_tree->lock);
100 test_err("cannot add extent range [16K, 20K)");
105 em = alloc_extent_map();
107 test_std_err(TEST_ALLOC_EXTENT_MAP);
112 /* Add [0, 8K), should return [0, 16K) instead. */
115 em->block_start = start;
117 write_lock(&em_tree->lock);
118 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
119 write_unlock(&em_tree->lock);
121 test_err("case1 [%llu %llu]: ret %d", start, start + len, ret);
125 test_err("case1 [%llu %llu]: no extent map returned",
130 if (em->start != 0 || extent_map_end(em) != SZ_16K ||
131 em->block_start != 0 || em->block_len != SZ_16K) {
133 "case1 [%llu %llu]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
134 start, start + len, ret, em->start, em->len,
135 em->block_start, em->block_len);
140 free_extent_map_tree(em_tree);
148 * Reading the inline ending up with EEXIST, ie. read an inline
149 * extent and discard page cache and read it again.
151 static int test_case_2(struct btrfs_fs_info *fs_info,
152 struct extent_map_tree *em_tree)
154 struct extent_map *em;
157 em = alloc_extent_map();
159 test_std_err(TEST_ALLOC_EXTENT_MAP);
166 em->block_start = EXTENT_MAP_INLINE;
167 em->block_len = (u64)-1;
168 write_lock(&em_tree->lock);
169 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
170 write_unlock(&em_tree->lock);
172 test_err("cannot add extent range [0, 1K)");
177 /* Add [4K, 8K) following [0, 1K) */
178 em = alloc_extent_map();
180 test_std_err(TEST_ALLOC_EXTENT_MAP);
187 em->block_start = SZ_4K;
188 em->block_len = SZ_4K;
189 write_lock(&em_tree->lock);
190 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
191 write_unlock(&em_tree->lock);
193 test_err("cannot add extent range [4K, 8K)");
198 em = alloc_extent_map();
200 test_std_err(TEST_ALLOC_EXTENT_MAP);
208 em->block_start = EXTENT_MAP_INLINE;
209 em->block_len = (u64)-1;
210 write_lock(&em_tree->lock);
211 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
212 write_unlock(&em_tree->lock);
214 test_err("case2 [0 1K]: ret %d", ret);
218 test_err("case2 [0 1K]: no extent map returned");
222 if (em->start != 0 || extent_map_end(em) != SZ_1K ||
223 em->block_start != EXTENT_MAP_INLINE || em->block_len != (u64)-1) {
225 "case2 [0 1K]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
226 ret, em->start, em->len, em->block_start,
232 free_extent_map_tree(em_tree);
237 static int __test_case_3(struct btrfs_fs_info *fs_info,
238 struct extent_map_tree *em_tree, u64 start)
240 struct extent_map *em;
244 em = alloc_extent_map();
246 test_std_err(TEST_ALLOC_EXTENT_MAP);
253 em->block_start = SZ_4K;
254 em->block_len = SZ_4K;
255 write_lock(&em_tree->lock);
256 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
257 write_unlock(&em_tree->lock);
259 test_err("cannot add extent range [4K, 8K)");
264 em = alloc_extent_map();
266 test_std_err(TEST_ALLOC_EXTENT_MAP);
275 em->block_len = SZ_16K;
276 write_lock(&em_tree->lock);
277 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
278 write_unlock(&em_tree->lock);
280 test_err("case3 [%llu %llu): ret %d",
281 start, start + len, ret);
285 test_err("case3 [%llu %llu): no extent map returned",
291 * Since bytes within em are contiguous, em->block_start is identical to
294 if (start < em->start || start + len > extent_map_end(em) ||
295 em->start != em->block_start || em->len != em->block_len) {
297 "case3 [%llu %llu): ret %d em (start %llu len %llu block_start %llu block_len %llu)",
298 start, start + len, ret, em->start, em->len,
299 em->block_start, em->block_len);
304 free_extent_map_tree(em_tree);
312 * Suppose that no extent map has been loaded into memory yet.
313 * There is a file extent [0, 16K), two jobs are running concurrently
314 * against it, t1 is buffered writing to [4K, 8K) and t2 is doing dio
315 * read from [0, 4K) or [8K, 12K) or [12K, 16K).
317 * t1 goes ahead of t2 and adds em [4K, 8K) into tree.
320 * cow_file_range() btrfs_get_extent()
321 * -> lookup_extent_mapping()
322 * -> add_extent_mapping()
323 * -> add_extent_mapping()
325 static int test_case_3(struct btrfs_fs_info *fs_info,
326 struct extent_map_tree *em_tree)
330 ret = __test_case_3(fs_info, em_tree, 0);
333 ret = __test_case_3(fs_info, em_tree, SZ_8K);
336 ret = __test_case_3(fs_info, em_tree, (12 * SZ_1K));
341 static int __test_case_4(struct btrfs_fs_info *fs_info,
342 struct extent_map_tree *em_tree, u64 start)
344 struct extent_map *em;
348 em = alloc_extent_map();
350 test_std_err(TEST_ALLOC_EXTENT_MAP);
358 em->block_len = SZ_8K;
359 write_lock(&em_tree->lock);
360 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
361 write_unlock(&em_tree->lock);
363 test_err("cannot add extent range [0, 8K)");
368 em = alloc_extent_map();
370 test_std_err(TEST_ALLOC_EXTENT_MAP);
377 em->len = 24 * SZ_1K;
378 em->block_start = SZ_16K; /* avoid merging */
379 em->block_len = 24 * SZ_1K;
380 write_lock(&em_tree->lock);
381 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
382 write_unlock(&em_tree->lock);
384 test_err("cannot add extent range [8K, 32K)");
389 em = alloc_extent_map();
391 test_std_err(TEST_ALLOC_EXTENT_MAP);
399 em->block_len = SZ_32K;
400 write_lock(&em_tree->lock);
401 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
402 write_unlock(&em_tree->lock);
404 test_err("case4 [%llu %llu): ret %d",
405 start, start + len, ret);
409 test_err("case4 [%llu %llu): no extent map returned",
414 if (start < em->start || start + len > extent_map_end(em)) {
416 "case4 [%llu %llu): ret %d, added wrong em (start %llu len %llu block_start %llu block_len %llu)",
417 start, start + len, ret, em->start, em->len, em->block_start,
423 free_extent_map_tree(em_tree);
431 * Suppose that no extent map has been loaded into memory yet.
432 * There is a file extent [0, 32K), two jobs are running concurrently
433 * against it, t1 is doing dio write to [8K, 32K) and t2 is doing dio
434 * read from [0, 4K) or [4K, 8K).
436 * t1 goes ahead of t2 and splits em [0, 32K) to em [0K, 8K) and [8K 32K).
439 * btrfs_get_blocks_direct() btrfs_get_blocks_direct()
440 * -> btrfs_get_extent() -> btrfs_get_extent()
441 * -> lookup_extent_mapping()
442 * -> add_extent_mapping() -> lookup_extent_mapping()
444 * -> btrfs_new_extent_direct()
445 * -> btrfs_drop_extent_cache()
447 * -> add_extent_mapping()
449 * -> add_extent_mapping()
450 * # handle -EEXIST when adding
453 static int test_case_4(struct btrfs_fs_info *fs_info,
454 struct extent_map_tree *em_tree)
458 ret = __test_case_4(fs_info, em_tree, 0);
461 ret = __test_case_4(fs_info, em_tree, SZ_4K);
466 static int add_compressed_extent(struct btrfs_fs_info *fs_info,
467 struct extent_map_tree *em_tree,
468 u64 start, u64 len, u64 block_start)
470 struct extent_map *em;
473 em = alloc_extent_map();
475 test_std_err(TEST_ALLOC_EXTENT_MAP);
481 em->block_start = block_start;
482 em->block_len = SZ_4K;
483 em->flags |= EXTENT_FLAG_COMPRESS_ZLIB;
484 write_lock(&em_tree->lock);
485 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
486 write_unlock(&em_tree->lock);
489 test_err("cannot add extent map [%llu, %llu)", start, start + len);
496 struct extent_range {
501 /* The valid states of the tree after every drop, as described below. */
502 struct extent_range valid_ranges[][7] = {
504 { .start = 0, .len = SZ_8K }, /* [0, 8K) */
505 { .start = SZ_4K * 3, .len = SZ_4K * 3}, /* [12k, 24k) */
506 { .start = SZ_4K * 6, .len = SZ_4K * 3}, /* [24k, 36k) */
507 { .start = SZ_32K + SZ_4K, .len = SZ_4K}, /* [36k, 40k) */
508 { .start = SZ_4K * 10, .len = SZ_4K * 6}, /* [40k, 64k) */
511 { .start = 0, .len = SZ_8K }, /* [0, 8K) */
512 { .start = SZ_4K * 5, .len = SZ_4K}, /* [20k, 24k) */
513 { .start = SZ_4K * 6, .len = SZ_4K * 3}, /* [24k, 36k) */
514 { .start = SZ_32K + SZ_4K, .len = SZ_4K}, /* [36k, 40k) */
515 { .start = SZ_4K * 10, .len = SZ_4K * 6}, /* [40k, 64k) */
518 { .start = 0, .len = SZ_8K }, /* [0, 8K) */
519 { .start = SZ_4K * 5, .len = SZ_4K}, /* [20k, 24k) */
520 { .start = SZ_4K * 6, .len = SZ_4K}, /* [24k, 28k) */
521 { .start = SZ_32K, .len = SZ_4K}, /* [32k, 36k) */
522 { .start = SZ_32K + SZ_4K, .len = SZ_4K}, /* [36k, 40k) */
523 { .start = SZ_4K * 10, .len = SZ_4K * 6}, /* [40k, 64k) */
526 { .start = 0, .len = SZ_8K}, /* [0, 8K) */
527 { .start = SZ_4K * 5, .len = SZ_4K}, /* [20k, 24k) */
528 { .start = SZ_4K * 6, .len = SZ_4K}, /* [24k, 28k) */
532 static int validate_range(struct extent_map_tree *em_tree, int index)
537 for (i = 0, n = rb_first_cached(&em_tree->map);
538 valid_ranges[index][i].len && n;
539 i++, n = rb_next(n)) {
540 struct extent_map *entry = rb_entry(n, struct extent_map, rb_node);
542 if (entry->start != valid_ranges[index][i].start) {
543 test_err("mapping has start %llu expected %llu",
544 entry->start, valid_ranges[index][i].start);
548 if (entry->len != valid_ranges[index][i].len) {
549 test_err("mapping has len %llu expected %llu",
550 entry->len, valid_ranges[index][i].len);
556 * We exited because we don't have any more entries in the extent_map
557 * but we still expect more valid entries.
559 if (valid_ranges[index][i].len) {
560 test_err("missing an entry");
564 /* We exited the loop but still have entries in the extent map. */
566 test_err("we have a left over entry in the extent map we didn't expect");
576 * Test the various edge cases of btrfs_drop_extent_map_range, create the
579 * [0, 12k)[12k, 24k)[24k, 36k)[36k, 40k)[40k,64k)
581 * And then we'll drop:
583 * [8k, 12k) - test the single front split
584 * [12k, 20k) - test the single back split
585 * [28k, 32k) - test the double split
586 * [32k, 64k) - test whole em dropping
588 * They'll have the EXTENT_FLAG_COMPRESSED flag set to keep the em tree from
591 static int test_case_5(struct btrfs_fs_info *fs_info)
593 struct extent_map_tree *em_tree;
598 test_msg("Running btrfs_drop_extent_map_range tests");
600 inode = btrfs_new_test_inode();
602 test_std_err(TEST_ALLOC_INODE);
606 em_tree = &BTRFS_I(inode)->extent_tree;
609 ret = add_compressed_extent(fs_info, em_tree, 0, SZ_4K * 3, 0);
611 test_err("cannot add extent range [0, 12K)");
616 ret = add_compressed_extent(fs_info, em_tree, SZ_4K * 3, SZ_4K * 3, SZ_4K);
618 test_err("cannot add extent range [12k, 24k)");
623 ret = add_compressed_extent(fs_info, em_tree, SZ_4K * 6, SZ_4K * 3, SZ_8K);
625 test_err("cannot add extent range [12k, 24k)");
630 ret = add_compressed_extent(fs_info, em_tree, SZ_32K + SZ_4K, SZ_4K, SZ_4K * 3);
632 test_err("cannot add extent range [12k, 24k)");
637 ret = add_compressed_extent(fs_info, em_tree, SZ_4K * 10, SZ_4K * 6, SZ_16K);
639 test_err("cannot add extent range [12k, 24k)");
645 end = (3 * SZ_4K) - 1;
646 btrfs_drop_extent_map_range(BTRFS_I(inode), start, end, false);
647 ret = validate_range(&BTRFS_I(inode)->extent_tree, 0);
651 /* Drop [12k, 20k) */
653 end = SZ_16K + SZ_4K - 1;
654 btrfs_drop_extent_map_range(BTRFS_I(inode), start, end, false);
655 ret = validate_range(&BTRFS_I(inode)->extent_tree, 1);
659 /* Drop [28k, 32k) */
660 start = SZ_32K - SZ_4K;
662 btrfs_drop_extent_map_range(BTRFS_I(inode), start, end, false);
663 ret = validate_range(&BTRFS_I(inode)->extent_tree, 2);
667 /* Drop [32k, 64k) */
670 btrfs_drop_extent_map_range(BTRFS_I(inode), start, end, false);
671 ret = validate_range(&BTRFS_I(inode)->extent_tree, 3);
680 * Test the btrfs_add_extent_mapping helper which will attempt to create an em
681 * for areas between two existing ems. Validate it doesn't do this when there
682 * are two unmerged em's side by side.
684 static int test_case_6(struct btrfs_fs_info *fs_info, struct extent_map_tree *em_tree)
686 struct extent_map *em = NULL;
689 ret = add_compressed_extent(fs_info, em_tree, 0, SZ_4K, 0);
693 ret = add_compressed_extent(fs_info, em_tree, SZ_4K, SZ_4K, 0);
697 em = alloc_extent_map();
699 test_std_err(TEST_ALLOC_EXTENT_MAP);
705 em->block_start = SZ_16K;
706 em->block_len = SZ_16K;
707 write_lock(&em_tree->lock);
708 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, 0, SZ_8K);
709 write_unlock(&em_tree->lock);
712 test_err("got an error when adding our em: %d", ret);
717 if (em->start != 0) {
718 test_err("unexpected em->start at %llu, wanted 0", em->start);
721 if (em->len != SZ_4K) {
722 test_err("unexpected em->len %llu, expected 4K", em->len);
728 free_extent_map_tree(em_tree);
733 * Regression test for btrfs_drop_extent_map_range. Calling with skip_pinned ==
734 * true would mess up the start/end calculations and subsequent splits would be
737 static int test_case_7(struct btrfs_fs_info *fs_info)
739 struct extent_map_tree *em_tree;
740 struct extent_map *em;
744 test_msg("Running btrfs_drop_extent_cache with pinned");
746 inode = btrfs_new_test_inode();
748 test_std_err(TEST_ALLOC_INODE);
752 em_tree = &BTRFS_I(inode)->extent_tree;
754 em = alloc_extent_map();
756 test_std_err(TEST_ALLOC_EXTENT_MAP);
761 /* [0, 16K), pinned */
765 em->block_len = SZ_4K;
766 em->flags |= EXTENT_FLAG_PINNED;
767 write_lock(&em_tree->lock);
768 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
769 write_unlock(&em_tree->lock);
771 test_err("couldn't add extent map");
776 em = alloc_extent_map();
778 test_std_err(TEST_ALLOC_EXTENT_MAP);
783 /* [32K, 48K), not pinned */
786 em->block_start = SZ_32K;
787 em->block_len = SZ_16K;
788 write_lock(&em_tree->lock);
789 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
790 write_unlock(&em_tree->lock);
792 test_err("couldn't add extent map");
798 * Drop [0, 36K) This should skip the [0, 4K) extent and then split the
801 btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (36 * SZ_1K) - 1, true);
803 /* Make sure our extent maps look sane. */
806 em = lookup_extent_mapping(em_tree, 0, SZ_16K);
808 test_err("didn't find an em at 0 as expected");
812 if (em->start != 0) {
813 test_err("em->start is %llu, expected 0", em->start);
817 if (em->len != SZ_16K) {
818 test_err("em->len is %llu, expected 16K", em->len);
824 read_lock(&em_tree->lock);
825 em = lookup_extent_mapping(em_tree, SZ_16K, SZ_16K);
826 read_unlock(&em_tree->lock);
828 test_err("found an em when we weren't expecting one");
832 read_lock(&em_tree->lock);
833 em = lookup_extent_mapping(em_tree, SZ_32K, SZ_16K);
834 read_unlock(&em_tree->lock);
836 test_err("didn't find an em at 32K as expected");
840 if (em->start != (36 * SZ_1K)) {
841 test_err("em->start is %llu, expected 36K", em->start);
845 if (em->len != (12 * SZ_1K)) {
846 test_err("em->len is %llu, expected 12K", em->len);
852 read_lock(&em_tree->lock);
853 em = lookup_extent_mapping(em_tree, 48 * SZ_1K, (u64)-1);
854 read_unlock(&em_tree->lock);
856 test_err("found an unexpected em above 48K");
867 struct rmap_test_vector {
870 u64 data_stripe_size;
871 u64 num_data_stripes;
873 /* Assume we won't have more than 5 physical stripes */
874 u64 data_stripe_phys_start[5];
875 bool expected_mapped_addr;
876 /* Physical to logical addresses */
877 u64 mapped_logical[5];
880 static int test_rmap_block(struct btrfs_fs_info *fs_info,
881 struct rmap_test_vector *test)
883 struct btrfs_chunk_map *map;
885 int i, out_ndaddrs, out_stripe_len;
888 map = btrfs_alloc_chunk_map(test->num_stripes, GFP_KERNEL);
890 test_std_err(TEST_ALLOC_CHUNK_MAP);
894 /* Start at 4GiB logical address */
896 map->chunk_len = test->data_stripe_size * test->num_data_stripes;
897 map->stripe_size = test->data_stripe_size;
898 map->num_stripes = test->num_stripes;
899 map->type = test->raid_type;
901 for (i = 0; i < map->num_stripes; i++) {
902 struct btrfs_device *dev = btrfs_alloc_dummy_device(fs_info);
905 test_err("cannot allocate device");
909 map->stripes[i].dev = dev;
910 map->stripes[i].physical = test->data_stripe_phys_start[i];
913 ret = btrfs_add_chunk_map(fs_info, map);
915 test_err("error adding chunk map to mapping tree");
919 ret = btrfs_rmap_block(fs_info, map->start, btrfs_sb_offset(1),
920 &logical, &out_ndaddrs, &out_stripe_len);
921 if (ret || (out_ndaddrs == 0 && test->expected_mapped_addr)) {
922 test_err("didn't rmap anything but expected %d",
923 test->expected_mapped_addr);
927 if (out_stripe_len != BTRFS_STRIPE_LEN) {
928 test_err("calculated stripe length doesn't match");
932 if (out_ndaddrs != test->expected_mapped_addr) {
933 for (i = 0; i < out_ndaddrs; i++)
934 test_msg("mapped %llu", logical[i]);
935 test_err("unexpected number of mapped addresses: %d", out_ndaddrs);
939 for (i = 0; i < out_ndaddrs; i++) {
940 if (logical[i] != test->mapped_logical[i]) {
941 test_err("unexpected logical address mapped");
948 btrfs_remove_chunk_map(fs_info, map);
954 int btrfs_test_extent_map(void)
956 struct btrfs_fs_info *fs_info = NULL;
957 struct extent_map_tree *em_tree;
959 struct rmap_test_vector rmap_tests[] = {
962 * Test a chunk with 2 data stripes one of which
963 * intersects the physical address of the super block
964 * is correctly recognised.
966 .raid_type = BTRFS_BLOCK_GROUP_RAID1,
967 .physical_start = SZ_64M - SZ_4M,
968 .data_stripe_size = SZ_256M,
969 .num_data_stripes = 2,
971 .data_stripe_phys_start =
972 {SZ_64M - SZ_4M, SZ_64M - SZ_4M + SZ_256M},
973 .expected_mapped_addr = true,
974 .mapped_logical= {SZ_4G + SZ_4M}
978 * Test that out-of-range physical addresses are
982 /* SINGLE chunk type */
984 .physical_start = SZ_4G,
985 .data_stripe_size = SZ_256M,
986 .num_data_stripes = 1,
988 .data_stripe_phys_start = {SZ_256M},
989 .expected_mapped_addr = false,
990 .mapped_logical = {0}
994 test_msg("running extent_map tests");
997 * Note: the fs_info is not set up completely, we only need
998 * fs_info::fsid for the tracepoint.
1000 fs_info = btrfs_alloc_dummy_fs_info(PAGE_SIZE, PAGE_SIZE);
1002 test_std_err(TEST_ALLOC_FS_INFO);
1006 em_tree = kzalloc(sizeof(*em_tree), GFP_KERNEL);
1012 extent_map_tree_init(em_tree);
1014 ret = test_case_1(fs_info, em_tree);
1017 ret = test_case_2(fs_info, em_tree);
1020 ret = test_case_3(fs_info, em_tree);
1023 ret = test_case_4(fs_info, em_tree);
1026 ret = test_case_5(fs_info);
1029 ret = test_case_6(fs_info, em_tree);
1032 ret = test_case_7(fs_info);
1036 test_msg("running rmap tests");
1037 for (i = 0; i < ARRAY_SIZE(rmap_tests); i++) {
1038 ret = test_rmap_block(fs_info, &rmap_tests[i]);
1045 btrfs_free_dummy_fs_info(fs_info);