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)) {
16 node = rb_first(&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 void 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 /* Skip the test on error. */
67 em->block_len = SZ_16K;
68 ret = add_extent_mapping(em_tree, em, 0);
72 /* Add [16K, 20K) following [0, 16K) */
73 em = alloc_extent_map();
79 em->block_start = SZ_32K; /* avoid merging */
80 em->block_len = SZ_4K;
81 ret = add_extent_mapping(em_tree, em, 0);
85 em = alloc_extent_map();
89 /* Add [0, 8K), should return [0, 16K) instead. */
92 em->block_start = start;
94 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
96 test_err("case1 [%llu %llu]: ret %d", start, start + len, ret);
98 (em->start != 0 || extent_map_end(em) != SZ_16K ||
99 em->block_start != 0 || em->block_len != SZ_16K))
101 "case1 [%llu %llu]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
102 start, start + len, ret, em->start, em->len,
103 em->block_start, em->block_len);
107 free_extent_map_tree(em_tree);
113 * Reading the inline ending up with EEXIST, ie. read an inline
114 * extent and discard page cache and read it again.
116 static void test_case_2(struct btrfs_fs_info *fs_info,
117 struct extent_map_tree *em_tree)
119 struct extent_map *em;
122 em = alloc_extent_map();
124 /* Skip the test on error. */
130 em->block_start = EXTENT_MAP_INLINE;
131 em->block_len = (u64)-1;
132 ret = add_extent_mapping(em_tree, em, 0);
136 /* Add [4K, 4K) following [0, 1K) */
137 em = alloc_extent_map();
143 em->block_start = SZ_4K;
144 em->block_len = SZ_4K;
145 ret = add_extent_mapping(em_tree, em, 0);
149 em = alloc_extent_map();
156 em->block_start = EXTENT_MAP_INLINE;
157 em->block_len = (u64)-1;
158 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, em->start, em->len);
160 test_err("case2 [0 1K]: ret %d", ret);
162 (em->start != 0 || extent_map_end(em) != SZ_1K ||
163 em->block_start != EXTENT_MAP_INLINE || em->block_len != (u64)-1))
165 "case2 [0 1K]: ret %d return a wrong em (start %llu len %llu block_start %llu block_len %llu",
166 ret, em->start, em->len, em->block_start,
171 free_extent_map_tree(em_tree);
174 static void __test_case_3(struct btrfs_fs_info *fs_info,
175 struct extent_map_tree *em_tree, u64 start)
177 struct extent_map *em;
181 em = alloc_extent_map();
183 /* Skip this test on error. */
189 em->block_start = SZ_4K;
190 em->block_len = SZ_4K;
191 ret = add_extent_mapping(em_tree, em, 0);
195 em = alloc_extent_map();
203 em->block_len = SZ_16K;
204 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
206 test_err("case3 [0x%llx 0x%llx): ret %d",
207 start, start + len, ret);
209 * Since bytes within em are contiguous, em->block_start is identical to
213 (start < em->start || start + len > extent_map_end(em) ||
214 em->start != em->block_start || em->len != em->block_len))
216 "case3 [0x%llx 0x%llx): ret %d em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx)",
217 start, start + len, ret, em->start, em->len,
218 em->block_start, em->block_len);
222 free_extent_map_tree(em_tree);
228 * Suppose that no extent map has been loaded into memory yet.
229 * There is a file extent [0, 16K), two jobs are running concurrently
230 * against it, t1 is buffered writing to [4K, 8K) and t2 is doing dio
231 * read from [0, 4K) or [8K, 12K) or [12K, 16K).
233 * t1 goes ahead of t2 and adds em [4K, 8K) into tree.
236 * cow_file_range() btrfs_get_extent()
237 * -> lookup_extent_mapping()
238 * -> add_extent_mapping()
239 * -> add_extent_mapping()
241 static void test_case_3(struct btrfs_fs_info *fs_info,
242 struct extent_map_tree *em_tree)
244 __test_case_3(fs_info, em_tree, 0);
245 __test_case_3(fs_info, em_tree, SZ_8K);
246 __test_case_3(fs_info, em_tree, (12 * 1024ULL));
249 static void __test_case_4(struct btrfs_fs_info *fs_info,
250 struct extent_map_tree *em_tree, u64 start)
252 struct extent_map *em;
256 em = alloc_extent_map();
258 /* Skip this test on error. */
265 em->block_len = SZ_8K;
266 ret = add_extent_mapping(em_tree, em, 0);
270 em = alloc_extent_map();
276 em->len = 24 * 1024ULL;
277 em->block_start = SZ_16K; /* avoid merging */
278 em->block_len = 24 * 1024ULL;
279 ret = add_extent_mapping(em_tree, em, 0);
283 em = alloc_extent_map();
290 em->block_len = SZ_32K;
291 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
293 test_err("case4 [0x%llx 0x%llx): ret %d",
296 (start < em->start || start + len > extent_map_end(em)))
298 "case4 [0x%llx 0x%llx): ret %d, added wrong em (start 0x%llx len 0x%llx block_start 0x%llx block_len 0x%llx)",
299 start, len, ret, em->start, em->len, em->block_start,
304 free_extent_map_tree(em_tree);
310 * Suppose that no extent map has been loaded into memory yet.
311 * There is a file extent [0, 32K), two jobs are running concurrently
312 * against it, t1 is doing dio write to [8K, 32K) and t2 is doing dio
313 * read from [0, 4K) or [4K, 8K).
315 * t1 goes ahead of t2 and splits em [0, 32K) to em [0K, 8K) and [8K 32K).
318 * btrfs_get_blocks_direct() btrfs_get_blocks_direct()
319 * -> btrfs_get_extent() -> btrfs_get_extent()
320 * -> lookup_extent_mapping()
321 * -> add_extent_mapping() -> lookup_extent_mapping()
323 * -> btrfs_new_extent_direct()
324 * -> btrfs_drop_extent_cache()
326 * -> add_extent_mapping()
328 * -> add_extent_mapping()
329 * # handle -EEXIST when adding
332 static void test_case_4(struct btrfs_fs_info *fs_info,
333 struct extent_map_tree *em_tree)
335 __test_case_4(fs_info, em_tree, 0);
336 __test_case_4(fs_info, em_tree, SZ_4K);
339 int btrfs_test_extent_map(void)
341 struct btrfs_fs_info *fs_info = NULL;
342 struct extent_map_tree *em_tree;
344 test_msg("running extent_map tests");
347 * Note: the fs_info is not set up completely, we only need
348 * fs_info::fsid for the tracepoint.
350 fs_info = btrfs_alloc_dummy_fs_info(PAGE_SIZE, PAGE_SIZE);
352 test_msg("Couldn't allocate dummy fs info");
356 em_tree = kzalloc(sizeof(*em_tree), GFP_KERNEL);
358 /* Skip the test on error. */
361 extent_map_tree_init(em_tree);
363 test_case_1(fs_info, em_tree);
364 test_case_2(fs_info, em_tree);
365 test_case_3(fs_info, em_tree);
366 test_case_4(fs_info, em_tree);
370 btrfs_free_dummy_fs_info(fs_info);