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();
60 test_std_err(TEST_ALLOC_EXTENT_MAP);
68 em->block_len = SZ_16K;
69 write_lock(&em_tree->lock);
70 ret = add_extent_mapping(em_tree, em, 0);
71 write_unlock(&em_tree->lock);
73 test_err("cannot add extent range [0, 16K)");
78 /* Add [16K, 20K) following [0, 16K) */
79 em = alloc_extent_map();
81 test_std_err(TEST_ALLOC_EXTENT_MAP);
88 em->block_start = SZ_32K; /* avoid merging */
89 em->block_len = SZ_4K;
90 write_lock(&em_tree->lock);
91 ret = add_extent_mapping(em_tree, em, 0);
92 write_unlock(&em_tree->lock);
94 test_err("cannot add extent range [16K, 20K)");
99 em = alloc_extent_map();
101 test_std_err(TEST_ALLOC_EXTENT_MAP);
106 /* Add [0, 8K), should return [0, 16K) instead. */
109 em->block_start = start;
111 write_lock(&em_tree->lock);
112 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
113 write_unlock(&em_tree->lock);
115 test_err("case1 [%llu %llu]: ret %d", start, start + len, ret);
119 (em->start != 0 || extent_map_end(em) != SZ_16K ||
120 em->block_start != 0 || em->block_len != SZ_16K)) {
122 "case1 [%llu %llu]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
123 start, start + len, ret, em->start, em->len,
124 em->block_start, em->block_len);
129 free_extent_map_tree(em_tree);
137 * Reading the inline ending up with EEXIST, ie. read an inline
138 * extent and discard page cache and read it again.
140 static int test_case_2(struct btrfs_fs_info *fs_info,
141 struct extent_map_tree *em_tree)
143 struct extent_map *em;
146 em = alloc_extent_map();
148 test_std_err(TEST_ALLOC_EXTENT_MAP);
155 em->block_start = EXTENT_MAP_INLINE;
156 em->block_len = (u64)-1;
157 write_lock(&em_tree->lock);
158 ret = add_extent_mapping(em_tree, em, 0);
159 write_unlock(&em_tree->lock);
161 test_err("cannot add extent range [0, 1K)");
166 /* Add [4K, 8K) following [0, 1K) */
167 em = alloc_extent_map();
169 test_std_err(TEST_ALLOC_EXTENT_MAP);
176 em->block_start = SZ_4K;
177 em->block_len = SZ_4K;
178 write_lock(&em_tree->lock);
179 ret = add_extent_mapping(em_tree, em, 0);
180 write_unlock(&em_tree->lock);
182 test_err("cannot add extent range [4K, 8K)");
187 em = alloc_extent_map();
189 test_std_err(TEST_ALLOC_EXTENT_MAP);
197 em->block_start = EXTENT_MAP_INLINE;
198 em->block_len = (u64)-1;
199 write_lock(&em_tree->lock);
200 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
201 write_unlock(&em_tree->lock);
203 test_err("case2 [0 1K]: ret %d", ret);
207 (em->start != 0 || extent_map_end(em) != SZ_1K ||
208 em->block_start != EXTENT_MAP_INLINE || em->block_len != (u64)-1)) {
210 "case2 [0 1K]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
211 ret, em->start, em->len, em->block_start,
217 free_extent_map_tree(em_tree);
222 static int __test_case_3(struct btrfs_fs_info *fs_info,
223 struct extent_map_tree *em_tree, u64 start)
225 struct extent_map *em;
229 em = alloc_extent_map();
231 test_std_err(TEST_ALLOC_EXTENT_MAP);
238 em->block_start = SZ_4K;
239 em->block_len = SZ_4K;
240 write_lock(&em_tree->lock);
241 ret = add_extent_mapping(em_tree, em, 0);
242 write_unlock(&em_tree->lock);
244 test_err("cannot add extent range [4K, 8K)");
249 em = alloc_extent_map();
251 test_std_err(TEST_ALLOC_EXTENT_MAP);
260 em->block_len = SZ_16K;
261 write_lock(&em_tree->lock);
262 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
263 write_unlock(&em_tree->lock);
265 test_err("case3 [0x%llx 0x%llx): ret %d",
266 start, start + len, ret);
270 * Since bytes within em are contiguous, em->block_start is identical to
274 (start < em->start || start + len > extent_map_end(em) ||
275 em->start != em->block_start || em->len != em->block_len)) {
277 "case3 [0x%llx 0x%llx): ret %d em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx)",
278 start, start + len, ret, em->start, em->len,
279 em->block_start, em->block_len);
284 free_extent_map_tree(em_tree);
292 * Suppose that no extent map has been loaded into memory yet.
293 * There is a file extent [0, 16K), two jobs are running concurrently
294 * against it, t1 is buffered writing to [4K, 8K) and t2 is doing dio
295 * read from [0, 4K) or [8K, 12K) or [12K, 16K).
297 * t1 goes ahead of t2 and adds em [4K, 8K) into tree.
300 * cow_file_range() btrfs_get_extent()
301 * -> lookup_extent_mapping()
302 * -> add_extent_mapping()
303 * -> add_extent_mapping()
305 static int test_case_3(struct btrfs_fs_info *fs_info,
306 struct extent_map_tree *em_tree)
310 ret = __test_case_3(fs_info, em_tree, 0);
313 ret = __test_case_3(fs_info, em_tree, SZ_8K);
316 ret = __test_case_3(fs_info, em_tree, (12 * SZ_1K));
321 static int __test_case_4(struct btrfs_fs_info *fs_info,
322 struct extent_map_tree *em_tree, u64 start)
324 struct extent_map *em;
328 em = alloc_extent_map();
330 test_std_err(TEST_ALLOC_EXTENT_MAP);
338 em->block_len = SZ_8K;
339 write_lock(&em_tree->lock);
340 ret = add_extent_mapping(em_tree, em, 0);
341 write_unlock(&em_tree->lock);
343 test_err("cannot add extent range [0, 8K)");
348 em = alloc_extent_map();
350 test_std_err(TEST_ALLOC_EXTENT_MAP);
357 em->len = 24 * SZ_1K;
358 em->block_start = SZ_16K; /* avoid merging */
359 em->block_len = 24 * SZ_1K;
360 write_lock(&em_tree->lock);
361 ret = add_extent_mapping(em_tree, em, 0);
362 write_unlock(&em_tree->lock);
364 test_err("cannot add extent range [8K, 32K)");
369 em = alloc_extent_map();
371 test_std_err(TEST_ALLOC_EXTENT_MAP);
379 em->block_len = SZ_32K;
380 write_lock(&em_tree->lock);
381 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
382 write_unlock(&em_tree->lock);
384 test_err("case4 [0x%llx 0x%llx): ret %d",
388 if (em && (start < em->start || start + len > extent_map_end(em))) {
390 "case4 [0x%llx 0x%llx): ret %d, added wrong em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx)",
391 start, len, ret, em->start, em->len, em->block_start,
397 free_extent_map_tree(em_tree);
405 * Suppose that no extent map has been loaded into memory yet.
406 * There is a file extent [0, 32K), two jobs are running concurrently
407 * against it, t1 is doing dio write to [8K, 32K) and t2 is doing dio
408 * read from [0, 4K) or [4K, 8K).
410 * t1 goes ahead of t2 and splits em [0, 32K) to em [0K, 8K) and [8K 32K).
413 * btrfs_get_blocks_direct() btrfs_get_blocks_direct()
414 * -> btrfs_get_extent() -> btrfs_get_extent()
415 * -> lookup_extent_mapping()
416 * -> add_extent_mapping() -> lookup_extent_mapping()
418 * -> btrfs_new_extent_direct()
419 * -> btrfs_drop_extent_cache()
421 * -> add_extent_mapping()
423 * -> add_extent_mapping()
424 * # handle -EEXIST when adding
427 static int test_case_4(struct btrfs_fs_info *fs_info,
428 struct extent_map_tree *em_tree)
432 ret = __test_case_4(fs_info, em_tree, 0);
435 ret = __test_case_4(fs_info, em_tree, SZ_4K);
440 int btrfs_test_extent_map(void)
442 struct btrfs_fs_info *fs_info = NULL;
443 struct extent_map_tree *em_tree;
446 test_msg("running extent_map tests");
449 * Note: the fs_info is not set up completely, we only need
450 * fs_info::fsid for the tracepoint.
452 fs_info = btrfs_alloc_dummy_fs_info(PAGE_SIZE, PAGE_SIZE);
454 test_std_err(TEST_ALLOC_FS_INFO);
458 em_tree = kzalloc(sizeof(*em_tree), GFP_KERNEL);
464 extent_map_tree_init(em_tree);
466 ret = test_case_1(fs_info, em_tree);
469 ret = test_case_2(fs_info, em_tree);
472 ret = test_case_3(fs_info, em_tree);
475 ret = test_case_4(fs_info, em_tree);
479 btrfs_free_dummy_fs_info(fs_info);