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"
10 static void free_extent_map_tree(struct extent_map_tree *em_tree)
12 struct extent_map *em;
15 while (!RB_EMPTY_ROOT(&em_tree->map.rb_root)) {
16 node = rb_first_cached(&em_tree->map);
17 em = rb_entry(node, struct extent_map, rb_node);
18 remove_extent_mapping(em_tree, em);
20 #ifdef CONFIG_BTRFS_DEBUG
21 if (refcount_read(&em->refs) != 1) {
23 "em leak: em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx) refs %d",
24 em->start, em->len, em->block_start,
25 em->block_len, refcount_read(&em->refs));
27 refcount_set(&em->refs, 1);
37 * Suppose that no extent map has been loaded into memory yet, there is a file
38 * extent [0, 16K), followed by another file extent [16K, 20K), two dio reads
39 * are entering btrfs_get_extent() concurrently, t1 is reading [8K, 16K), t2 is
43 * btrfs_get_extent() btrfs_get_extent()
44 * -> lookup_extent_mapping() ->lookup_extent_mapping()
45 * -> add_extent_mapping(0, 16K)
47 * ->add_extent_mapping(0, 16K)
50 static int test_case_1(struct btrfs_fs_info *fs_info,
51 struct extent_map_tree *em_tree)
53 struct extent_map *em;
58 em = alloc_extent_map();
66 em->block_len = SZ_16K;
67 ret = add_extent_mapping(em_tree, em, 0);
69 test_err("cannot add extent range [0, 16K)");
74 /* Add [16K, 20K) following [0, 16K) */
75 em = alloc_extent_map();
83 em->block_start = SZ_32K; /* avoid merging */
84 em->block_len = SZ_4K;
85 ret = add_extent_mapping(em_tree, em, 0);
87 test_err("cannot add extent range [16K, 20K)");
92 em = alloc_extent_map();
98 /* Add [0, 8K), should return [0, 16K) instead. */
101 em->block_start = start;
103 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
105 test_err("case1 [%llu %llu]: ret %d", start, start + len, ret);
109 (em->start != 0 || extent_map_end(em) != SZ_16K ||
110 em->block_start != 0 || em->block_len != SZ_16K)) {
112 "case1 [%llu %llu]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
113 start, start + len, ret, em->start, em->len,
114 em->block_start, em->block_len);
119 free_extent_map_tree(em_tree);
127 * Reading the inline ending up with EEXIST, ie. read an inline
128 * extent and discard page cache and read it again.
130 static int test_case_2(struct btrfs_fs_info *fs_info,
131 struct extent_map_tree *em_tree)
133 struct extent_map *em;
136 em = alloc_extent_map();
143 em->block_start = EXTENT_MAP_INLINE;
144 em->block_len = (u64)-1;
145 ret = add_extent_mapping(em_tree, em, 0);
147 test_err("cannot add extent range [0, 1K)");
152 /* Add [4K, 4K) following [0, 1K) */
153 em = alloc_extent_map();
161 em->block_start = SZ_4K;
162 em->block_len = SZ_4K;
163 ret = add_extent_mapping(em_tree, em, 0);
165 test_err("cannot add extent range [4K, 8K)");
170 em = alloc_extent_map();
179 em->block_start = EXTENT_MAP_INLINE;
180 em->block_len = (u64)-1;
181 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
183 test_err("case2 [0 1K]: ret %d", ret);
187 (em->start != 0 || extent_map_end(em) != SZ_1K ||
188 em->block_start != EXTENT_MAP_INLINE || em->block_len != (u64)-1)) {
190 "case2 [0 1K]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
191 ret, em->start, em->len, em->block_start,
197 free_extent_map_tree(em_tree);
202 static int __test_case_3(struct btrfs_fs_info *fs_info,
203 struct extent_map_tree *em_tree, u64 start)
205 struct extent_map *em;
209 em = alloc_extent_map();
216 em->block_start = SZ_4K;
217 em->block_len = SZ_4K;
218 ret = add_extent_mapping(em_tree, em, 0);
222 em = alloc_extent_map();
232 em->block_len = SZ_16K;
233 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
235 test_err("case3 [0x%llx 0x%llx): ret %d",
236 start, start + len, ret);
238 * Since bytes within em are contiguous, em->block_start is identical to
242 (start < em->start || start + len > extent_map_end(em) ||
243 em->start != em->block_start || em->len != em->block_len))
245 "case3 [0x%llx 0x%llx): ret %d em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx)",
246 start, start + len, ret, em->start, em->len,
247 em->block_start, em->block_len);
252 free_extent_map_tree(em_tree);
260 * Suppose that no extent map has been loaded into memory yet.
261 * There is a file extent [0, 16K), two jobs are running concurrently
262 * against it, t1 is buffered writing to [4K, 8K) and t2 is doing dio
263 * read from [0, 4K) or [8K, 12K) or [12K, 16K).
265 * t1 goes ahead of t2 and adds em [4K, 8K) into tree.
268 * cow_file_range() btrfs_get_extent()
269 * -> lookup_extent_mapping()
270 * -> add_extent_mapping()
271 * -> add_extent_mapping()
273 static void test_case_3(struct btrfs_fs_info *fs_info,
274 struct extent_map_tree *em_tree)
276 __test_case_3(fs_info, em_tree, 0);
277 __test_case_3(fs_info, em_tree, SZ_8K);
278 __test_case_3(fs_info, em_tree, (12 * 1024ULL));
281 static int __test_case_4(struct btrfs_fs_info *fs_info,
282 struct extent_map_tree *em_tree, u64 start)
284 struct extent_map *em;
288 em = alloc_extent_map();
296 em->block_len = SZ_8K;
297 ret = add_extent_mapping(em_tree, em, 0);
301 em = alloc_extent_map();
309 em->len = 24 * 1024ULL;
310 em->block_start = SZ_16K; /* avoid merging */
311 em->block_len = 24 * 1024ULL;
312 ret = add_extent_mapping(em_tree, em, 0);
316 em = alloc_extent_map();
325 em->block_len = SZ_32K;
326 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
328 test_err("case4 [0x%llx 0x%llx): ret %d",
331 (start < em->start || start + len > extent_map_end(em)))
333 "case4 [0x%llx 0x%llx): ret %d, added wrong em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx)",
334 start, len, ret, em->start, em->len, em->block_start,
340 free_extent_map_tree(em_tree);
348 * Suppose that no extent map has been loaded into memory yet.
349 * There is a file extent [0, 32K), two jobs are running concurrently
350 * against it, t1 is doing dio write to [8K, 32K) and t2 is doing dio
351 * read from [0, 4K) or [4K, 8K).
353 * t1 goes ahead of t2 and splits em [0, 32K) to em [0K, 8K) and [8K 32K).
356 * btrfs_get_blocks_direct() btrfs_get_blocks_direct()
357 * -> btrfs_get_extent() -> btrfs_get_extent()
358 * -> lookup_extent_mapping()
359 * -> add_extent_mapping() -> lookup_extent_mapping()
361 * -> btrfs_new_extent_direct()
362 * -> btrfs_drop_extent_cache()
364 * -> add_extent_mapping()
366 * -> add_extent_mapping()
367 * # handle -EEXIST when adding
370 static void test_case_4(struct btrfs_fs_info *fs_info,
371 struct extent_map_tree *em_tree)
373 __test_case_4(fs_info, em_tree, 0);
374 __test_case_4(fs_info, em_tree, SZ_4K);
377 int btrfs_test_extent_map(void)
379 struct btrfs_fs_info *fs_info = NULL;
380 struct extent_map_tree *em_tree;
383 test_msg("running extent_map tests");
386 * Note: the fs_info is not set up completely, we only need
387 * fs_info::fsid for the tracepoint.
389 fs_info = btrfs_alloc_dummy_fs_info(PAGE_SIZE, PAGE_SIZE);
391 test_std_err(TEST_ALLOC_FS_INFO);
395 em_tree = kzalloc(sizeof(*em_tree), GFP_KERNEL);
401 extent_map_tree_init(em_tree);
403 test_case_1(fs_info, em_tree);
404 test_case_2(fs_info, em_tree);
405 test_case_3(fs_info, em_tree);
406 test_case_4(fs_info, em_tree);
410 btrfs_free_dummy_fs_info(fs_info);