1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2015 Facebook. All rights reserved.
6 #include <linux/types.h>
7 #include "btrfs-tests.h"
9 #include "../disk-io.h"
10 #include "../free-space-tree.h"
11 #include "../transaction.h"
12 #include "../block-group.h"
14 struct free_space_extent {
19 static int __check_free_space_extents(struct btrfs_trans_handle *trans,
20 struct btrfs_fs_info *fs_info,
21 struct btrfs_block_group *cache,
22 struct btrfs_path *path,
23 const struct free_space_extent * const extents,
24 unsigned int num_extents)
26 struct btrfs_free_space_info *info;
28 int prev_bit = 0, bit;
29 u64 extent_start = 0, offset, end;
30 u32 flags, extent_count;
34 info = search_free_space_info(trans, cache, path, 0);
36 test_err("could not find free space info");
40 flags = btrfs_free_space_flags(path->nodes[0], info);
41 extent_count = btrfs_free_space_extent_count(path->nodes[0], info);
43 if (extent_count != num_extents) {
44 test_err("extent count is wrong");
48 if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) {
49 if (path->slots[0] != 0)
51 end = cache->start + cache->length;
53 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) {
54 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
55 if (key.type != BTRFS_FREE_SPACE_BITMAP_KEY)
57 offset = key.objectid;
58 while (offset < key.objectid + key.offset) {
59 bit = free_space_test_bit(cache, path, offset);
60 if (prev_bit == 0 && bit == 1) {
61 extent_start = offset;
62 } else if (prev_bit == 1 && bit == 0) {
65 if (i >= num_extents ||
66 extent_start != extents[i].start ||
67 offset - extent_start != extents[i].length)
72 offset += fs_info->sectorsize;
76 if (i >= num_extents ||
77 extent_start != extents[i].start ||
78 end - extent_start != extents[i].length)
85 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 ||
88 for (i = 0; i < num_extents; i++) {
90 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
91 if (key.type != BTRFS_FREE_SPACE_EXTENT_KEY ||
92 key.objectid != extents[i].start ||
93 key.offset != extents[i].length)
100 btrfs_release_path(path);
103 test_err("free space tree is invalid");
108 static int check_free_space_extents(struct btrfs_trans_handle *trans,
109 struct btrfs_fs_info *fs_info,
110 struct btrfs_block_group *cache,
111 struct btrfs_path *path,
112 const struct free_space_extent * const extents,
113 unsigned int num_extents)
115 struct btrfs_free_space_info *info;
119 info = search_free_space_info(trans, cache, path, 0);
121 test_err("could not find free space info");
122 btrfs_release_path(path);
123 return PTR_ERR(info);
125 flags = btrfs_free_space_flags(path->nodes[0], info);
126 btrfs_release_path(path);
128 ret = __check_free_space_extents(trans, fs_info, cache, path, extents,
133 /* Flip it to the other format and check that for good measure. */
134 if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) {
135 ret = convert_free_space_to_extents(trans, cache, path);
137 test_err("could not convert to extents");
141 ret = convert_free_space_to_bitmaps(trans, cache, path);
143 test_err("could not convert to bitmaps");
147 return __check_free_space_extents(trans, fs_info, cache, path, extents,
151 static int test_empty_block_group(struct btrfs_trans_handle *trans,
152 struct btrfs_fs_info *fs_info,
153 struct btrfs_block_group *cache,
154 struct btrfs_path *path,
157 const struct free_space_extent extents[] = {
158 {cache->start, cache->length},
161 return check_free_space_extents(trans, fs_info, cache, path,
162 extents, ARRAY_SIZE(extents));
165 static int test_remove_all(struct btrfs_trans_handle *trans,
166 struct btrfs_fs_info *fs_info,
167 struct btrfs_block_group *cache,
168 struct btrfs_path *path,
171 const struct free_space_extent extents[] = {};
174 ret = __remove_from_free_space_tree(trans, cache, path,
178 test_err("could not remove free space");
182 return check_free_space_extents(trans, fs_info, cache, path,
183 extents, ARRAY_SIZE(extents));
186 static int test_remove_beginning(struct btrfs_trans_handle *trans,
187 struct btrfs_fs_info *fs_info,
188 struct btrfs_block_group *cache,
189 struct btrfs_path *path,
192 const struct free_space_extent extents[] = {
193 {cache->start + alignment, cache->length - alignment},
197 ret = __remove_from_free_space_tree(trans, cache, path,
198 cache->start, alignment);
200 test_err("could not remove free space");
204 return check_free_space_extents(trans, fs_info, cache, path,
205 extents, ARRAY_SIZE(extents));
209 static int test_remove_end(struct btrfs_trans_handle *trans,
210 struct btrfs_fs_info *fs_info,
211 struct btrfs_block_group *cache,
212 struct btrfs_path *path,
215 const struct free_space_extent extents[] = {
216 {cache->start, cache->length - alignment},
220 ret = __remove_from_free_space_tree(trans, cache, path,
221 cache->start + cache->length - alignment,
224 test_err("could not remove free space");
228 return check_free_space_extents(trans, fs_info, cache, path,
229 extents, ARRAY_SIZE(extents));
232 static int test_remove_middle(struct btrfs_trans_handle *trans,
233 struct btrfs_fs_info *fs_info,
234 struct btrfs_block_group *cache,
235 struct btrfs_path *path,
238 const struct free_space_extent extents[] = {
239 {cache->start, alignment},
240 {cache->start + 2 * alignment, cache->length - 2 * alignment},
244 ret = __remove_from_free_space_tree(trans, cache, path,
245 cache->start + alignment,
248 test_err("could not remove free space");
252 return check_free_space_extents(trans, fs_info, cache, path,
253 extents, ARRAY_SIZE(extents));
256 static int test_merge_left(struct btrfs_trans_handle *trans,
257 struct btrfs_fs_info *fs_info,
258 struct btrfs_block_group *cache,
259 struct btrfs_path *path,
262 const struct free_space_extent extents[] = {
263 {cache->start, 2 * alignment},
267 ret = __remove_from_free_space_tree(trans, cache, path,
268 cache->start, cache->length);
270 test_err("could not remove free space");
274 ret = __add_to_free_space_tree(trans, cache, path, cache->start,
277 test_err("could not add free space");
281 ret = __add_to_free_space_tree(trans, cache, path,
282 cache->start + alignment,
285 test_err("could not add free space");
289 return check_free_space_extents(trans, fs_info, cache, path,
290 extents, ARRAY_SIZE(extents));
293 static int test_merge_right(struct btrfs_trans_handle *trans,
294 struct btrfs_fs_info *fs_info,
295 struct btrfs_block_group *cache,
296 struct btrfs_path *path,
299 const struct free_space_extent extents[] = {
300 {cache->start + alignment, 2 * alignment},
304 ret = __remove_from_free_space_tree(trans, cache, path,
305 cache->start, cache->length);
307 test_err("could not remove free space");
311 ret = __add_to_free_space_tree(trans, cache, path,
312 cache->start + 2 * alignment,
315 test_err("could not add free space");
319 ret = __add_to_free_space_tree(trans, cache, path,
320 cache->start + alignment,
323 test_err("could not add free space");
327 return check_free_space_extents(trans, fs_info, cache, path,
328 extents, ARRAY_SIZE(extents));
331 static int test_merge_both(struct btrfs_trans_handle *trans,
332 struct btrfs_fs_info *fs_info,
333 struct btrfs_block_group *cache,
334 struct btrfs_path *path,
337 const struct free_space_extent extents[] = {
338 {cache->start, 3 * alignment},
342 ret = __remove_from_free_space_tree(trans, cache, path,
343 cache->start, cache->length);
345 test_err("could not remove free space");
349 ret = __add_to_free_space_tree(trans, cache, path, cache->start,
352 test_err("could not add free space");
356 ret = __add_to_free_space_tree(trans, cache, path,
357 cache->start + 2 * alignment, alignment);
359 test_err("could not add free space");
363 ret = __add_to_free_space_tree(trans, cache, path,
364 cache->start + alignment, alignment);
366 test_err("could not add free space");
370 return check_free_space_extents(trans, fs_info, cache, path,
371 extents, ARRAY_SIZE(extents));
374 static int test_merge_none(struct btrfs_trans_handle *trans,
375 struct btrfs_fs_info *fs_info,
376 struct btrfs_block_group *cache,
377 struct btrfs_path *path,
380 const struct free_space_extent extents[] = {
381 {cache->start, alignment},
382 {cache->start + 2 * alignment, alignment},
383 {cache->start + 4 * alignment, alignment},
387 ret = __remove_from_free_space_tree(trans, cache, path,
388 cache->start, cache->length);
390 test_err("could not remove free space");
394 ret = __add_to_free_space_tree(trans, cache, path, cache->start,
397 test_err("could not add free space");
401 ret = __add_to_free_space_tree(trans, cache, path,
402 cache->start + 4 * alignment, alignment);
404 test_err("could not add free space");
408 ret = __add_to_free_space_tree(trans, cache, path,
409 cache->start + 2 * alignment, alignment);
411 test_err("could not add free space");
415 return check_free_space_extents(trans, fs_info, cache, path,
416 extents, ARRAY_SIZE(extents));
419 typedef int (*test_func_t)(struct btrfs_trans_handle *,
420 struct btrfs_fs_info *,
421 struct btrfs_block_group *,
425 static int run_test(test_func_t test_func, int bitmaps, u32 sectorsize,
426 u32 nodesize, u32 alignment)
428 struct btrfs_fs_info *fs_info;
429 struct btrfs_root *root = NULL;
430 struct btrfs_block_group *cache = NULL;
431 struct btrfs_trans_handle trans;
432 struct btrfs_path *path = NULL;
435 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
437 test_std_err(TEST_ALLOC_FS_INFO);
442 root = btrfs_alloc_dummy_root(fs_info);
444 test_std_err(TEST_ALLOC_ROOT);
449 btrfs_set_super_compat_ro_flags(root->fs_info->super_copy,
450 BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE);
451 root->fs_info->free_space_root = root;
452 root->fs_info->tree_root = root;
454 root->node = alloc_test_extent_buffer(root->fs_info, nodesize);
455 if (IS_ERR(root->node)) {
456 test_std_err(TEST_ALLOC_EXTENT_BUFFER);
457 ret = PTR_ERR(root->node);
460 btrfs_set_header_level(root->node, 0);
461 btrfs_set_header_nritems(root->node, 0);
462 root->alloc_bytenr += 2 * nodesize;
464 cache = btrfs_alloc_dummy_block_group(fs_info, 8 * alignment);
466 test_std_err(TEST_ALLOC_BLOCK_GROUP);
470 cache->bitmap_low_thresh = 0;
471 cache->bitmap_high_thresh = (u32)-1;
472 cache->needs_free_space = 1;
473 cache->fs_info = root->fs_info;
475 btrfs_init_dummy_trans(&trans, root->fs_info);
477 path = btrfs_alloc_path();
479 test_std_err(TEST_ALLOC_ROOT);
484 ret = add_block_group_free_space(&trans, cache);
486 test_err("could not add block group free space");
491 ret = convert_free_space_to_bitmaps(&trans, cache, path);
493 test_err("could not convert block group to bitmaps");
498 ret = test_func(&trans, root->fs_info, cache, path, alignment);
502 ret = remove_block_group_free_space(&trans, cache);
504 test_err("could not remove block group free space");
508 if (btrfs_header_nritems(root->node) != 0) {
509 test_err("free space tree has leftover items");
516 btrfs_free_path(path);
517 btrfs_free_dummy_block_group(cache);
518 btrfs_free_dummy_root(root);
519 btrfs_free_dummy_fs_info(fs_info);
523 static int run_test_both_formats(test_func_t test_func, u32 sectorsize,
524 u32 nodesize, u32 alignment)
529 ret = run_test(test_func, 0, sectorsize, nodesize, alignment);
532 "%ps failed with extents, sectorsize=%u, nodesize=%u, alignment=%u",
533 test_func, sectorsize, nodesize, alignment);
537 ret = run_test(test_func, 1, sectorsize, nodesize, alignment);
540 "%ps failed with bitmaps, sectorsize=%u, nodesize=%u, alignment=%u",
541 test_func, sectorsize, nodesize, alignment);
548 int btrfs_test_free_space_tree(u32 sectorsize, u32 nodesize)
550 test_func_t tests[] = {
551 test_empty_block_group,
553 test_remove_beginning,
561 u32 bitmap_alignment;
566 * Align some operations to a page to flush out bugs in the extent
567 * buffer bitmap handling of highmem.
569 bitmap_alignment = BTRFS_FREE_SPACE_BITMAP_BITS * PAGE_SIZE;
571 test_msg("running free space tree tests");
572 for (i = 0; i < ARRAY_SIZE(tests); i++) {
575 ret = run_test_both_formats(tests[i], sectorsize, nodesize,
580 ret = run_test_both_formats(tests[i], sectorsize, nodesize,