Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2015 Facebook. All rights reserved.
4 */
5
6#include <linux/types.h>
7#include "btrfs-tests.h"
8#include "../ctree.h"
9#include "../disk-io.h"
10#include "../free-space-tree.h"
11#include "../transaction.h"
12#include "../block-group.h"
13
14struct free_space_extent {
15 u64 start;
16 u64 length;
17};
18
19static int __check_free_space_extents(struct btrfs_trans_handle *trans,
20 struct btrfs_fs_info *fs_info,
21 struct btrfs_block_group_cache *cache,
22 struct btrfs_path *path,
23 const struct free_space_extent * const extents,
24 unsigned int num_extents)
25{
26 struct btrfs_free_space_info *info;
27 struct btrfs_key key;
28 int prev_bit = 0, bit;
29 u64 extent_start = 0, offset, end;
30 u32 flags, extent_count;
31 unsigned int i;
32 int ret;
33
34 info = search_free_space_info(trans, cache, path, 0);
35 if (IS_ERR(info)) {
36 test_err("could not find free space info");
37 ret = PTR_ERR(info);
38 goto out;
39 }
40 flags = btrfs_free_space_flags(path->nodes[0], info);
41 extent_count = btrfs_free_space_extent_count(path->nodes[0], info);
42
43 if (extent_count != num_extents) {
44 test_err("extent count is wrong");
45 ret = -EINVAL;
46 goto out;
47 }
48 if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) {
49 if (path->slots[0] != 0)
50 goto invalid;
51 end = cache->key.objectid + cache->key.offset;
52 i = 0;
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)
56 goto invalid;
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) {
63 if (i >= num_extents)
64 goto invalid;
65 if (i >= num_extents ||
66 extent_start != extents[i].start ||
67 offset - extent_start != extents[i].length)
68 goto invalid;
69 i++;
70 }
71 prev_bit = bit;
72 offset += fs_info->sectorsize;
73 }
74 }
75 if (prev_bit == 1) {
76 if (i >= num_extents ||
77 extent_start != extents[i].start ||
78 end - extent_start != extents[i].length)
79 goto invalid;
80 i++;
81 }
82 if (i != num_extents)
83 goto invalid;
84 } else {
85 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 ||
86 path->slots[0] != 0)
87 goto invalid;
88 for (i = 0; i < num_extents; i++) {
89 path->slots[0]++;
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)
94 goto invalid;
95 }
96 }
97
98 ret = 0;
99out:
100 btrfs_release_path(path);
101 return ret;
102invalid:
103 test_err("free space tree is invalid");
104 ret = -EINVAL;
105 goto out;
106}
107
108static int check_free_space_extents(struct btrfs_trans_handle *trans,
109 struct btrfs_fs_info *fs_info,
110 struct btrfs_block_group_cache *cache,
111 struct btrfs_path *path,
112 const struct free_space_extent * const extents,
113 unsigned int num_extents)
114{
115 struct btrfs_free_space_info *info;
116 u32 flags;
117 int ret;
118
119 info = search_free_space_info(trans, cache, path, 0);
120 if (IS_ERR(info)) {
121 test_err("could not find free space info");
122 btrfs_release_path(path);
123 return PTR_ERR(info);
124 }
125 flags = btrfs_free_space_flags(path->nodes[0], info);
126 btrfs_release_path(path);
127
128 ret = __check_free_space_extents(trans, fs_info, cache, path, extents,
129 num_extents);
130 if (ret)
131 return ret;
132
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);
136 if (ret) {
137 test_err("could not convert to extents");
138 return ret;
139 }
140 } else {
141 ret = convert_free_space_to_bitmaps(trans, cache, path);
142 if (ret) {
143 test_err("could not convert to bitmaps");
144 return ret;
145 }
146 }
147 return __check_free_space_extents(trans, fs_info, cache, path, extents,
148 num_extents);
149}
150
151static int test_empty_block_group(struct btrfs_trans_handle *trans,
152 struct btrfs_fs_info *fs_info,
153 struct btrfs_block_group_cache *cache,
154 struct btrfs_path *path,
155 u32 alignment)
156{
157 const struct free_space_extent extents[] = {
158 {cache->key.objectid, cache->key.offset},
159 };
160
161 return check_free_space_extents(trans, fs_info, cache, path,
162 extents, ARRAY_SIZE(extents));
163}
164
165static int test_remove_all(struct btrfs_trans_handle *trans,
166 struct btrfs_fs_info *fs_info,
167 struct btrfs_block_group_cache *cache,
168 struct btrfs_path *path,
169 u32 alignment)
170{
171 const struct free_space_extent extents[] = {};
172 int ret;
173
174 ret = __remove_from_free_space_tree(trans, cache, path,
175 cache->key.objectid,
176 cache->key.offset);
177 if (ret) {
178 test_err("could not remove free space");
179 return ret;
180 }
181
182 return check_free_space_extents(trans, fs_info, cache, path,
183 extents, ARRAY_SIZE(extents));
184}
185
186static int test_remove_beginning(struct btrfs_trans_handle *trans,
187 struct btrfs_fs_info *fs_info,
188 struct btrfs_block_group_cache *cache,
189 struct btrfs_path *path,
190 u32 alignment)
191{
192 const struct free_space_extent extents[] = {
193 {cache->key.objectid + alignment,
194 cache->key.offset - alignment},
195 };
196 int ret;
197
198 ret = __remove_from_free_space_tree(trans, cache, path,
199 cache->key.objectid, alignment);
200 if (ret) {
201 test_err("could not remove free space");
202 return ret;
203 }
204
205 return check_free_space_extents(trans, fs_info, cache, path,
206 extents, ARRAY_SIZE(extents));
207
208}
209
210static int test_remove_end(struct btrfs_trans_handle *trans,
211 struct btrfs_fs_info *fs_info,
212 struct btrfs_block_group_cache *cache,
213 struct btrfs_path *path,
214 u32 alignment)
215{
216 const struct free_space_extent extents[] = {
217 {cache->key.objectid, cache->key.offset - alignment},
218 };
219 int ret;
220
221 ret = __remove_from_free_space_tree(trans, cache, path,
222 cache->key.objectid +
223 cache->key.offset - alignment,
224 alignment);
225 if (ret) {
226 test_err("could not remove free space");
227 return ret;
228 }
229
230 return check_free_space_extents(trans, fs_info, cache, path,
231 extents, ARRAY_SIZE(extents));
232}
233
234static int test_remove_middle(struct btrfs_trans_handle *trans,
235 struct btrfs_fs_info *fs_info,
236 struct btrfs_block_group_cache *cache,
237 struct btrfs_path *path,
238 u32 alignment)
239{
240 const struct free_space_extent extents[] = {
241 {cache->key.objectid, alignment},
242 {cache->key.objectid + 2 * alignment,
243 cache->key.offset - 2 * alignment},
244 };
245 int ret;
246
247 ret = __remove_from_free_space_tree(trans, cache, path,
248 cache->key.objectid + alignment,
249 alignment);
250 if (ret) {
251 test_err("could not remove free space");
252 return ret;
253 }
254
255 return check_free_space_extents(trans, fs_info, cache, path,
256 extents, ARRAY_SIZE(extents));
257}
258
259static int test_merge_left(struct btrfs_trans_handle *trans,
260 struct btrfs_fs_info *fs_info,
261 struct btrfs_block_group_cache *cache,
262 struct btrfs_path *path,
263 u32 alignment)
264{
265 const struct free_space_extent extents[] = {
266 {cache->key.objectid, 2 * alignment},
267 };
268 int ret;
269
270 ret = __remove_from_free_space_tree(trans, cache, path,
271 cache->key.objectid,
272 cache->key.offset);
273 if (ret) {
274 test_err("could not remove free space");
275 return ret;
276 }
277
278 ret = __add_to_free_space_tree(trans, cache, path, cache->key.objectid,
279 alignment);
280 if (ret) {
281 test_err("could not add free space");
282 return ret;
283 }
284
285 ret = __add_to_free_space_tree(trans, cache, path,
286 cache->key.objectid + alignment,
287 alignment);
288 if (ret) {
289 test_err("could not add free space");
290 return ret;
291 }
292
293 return check_free_space_extents(trans, fs_info, cache, path,
294 extents, ARRAY_SIZE(extents));
295}
296
297static int test_merge_right(struct btrfs_trans_handle *trans,
298 struct btrfs_fs_info *fs_info,
299 struct btrfs_block_group_cache *cache,
300 struct btrfs_path *path,
301 u32 alignment)
302{
303 const struct free_space_extent extents[] = {
304 {cache->key.objectid + alignment, 2 * alignment},
305 };
306 int ret;
307
308 ret = __remove_from_free_space_tree(trans, cache, path,
309 cache->key.objectid,
310 cache->key.offset);
311 if (ret) {
312 test_err("could not remove free space");
313 return ret;
314 }
315
316 ret = __add_to_free_space_tree(trans, cache, path,
317 cache->key.objectid + 2 * alignment,
318 alignment);
319 if (ret) {
320 test_err("could not add free space");
321 return ret;
322 }
323
324 ret = __add_to_free_space_tree(trans, cache, path,
325 cache->key.objectid + alignment,
326 alignment);
327 if (ret) {
328 test_err("could not add free space");
329 return ret;
330 }
331
332 return check_free_space_extents(trans, fs_info, cache, path,
333 extents, ARRAY_SIZE(extents));
334}
335
336static int test_merge_both(struct btrfs_trans_handle *trans,
337 struct btrfs_fs_info *fs_info,
338 struct btrfs_block_group_cache *cache,
339 struct btrfs_path *path,
340 u32 alignment)
341{
342 const struct free_space_extent extents[] = {
343 {cache->key.objectid, 3 * alignment},
344 };
345 int ret;
346
347 ret = __remove_from_free_space_tree(trans, cache, path,
348 cache->key.objectid,
349 cache->key.offset);
350 if (ret) {
351 test_err("could not remove free space");
352 return ret;
353 }
354
355 ret = __add_to_free_space_tree(trans, cache, path, cache->key.objectid,
356 alignment);
357 if (ret) {
358 test_err("could not add free space");
359 return ret;
360 }
361
362 ret = __add_to_free_space_tree(trans, cache, path,
363 cache->key.objectid + 2 * alignment,
364 alignment);
365 if (ret) {
366 test_err("could not add free space");
367 return ret;
368 }
369
370 ret = __add_to_free_space_tree(trans, cache, path,
371 cache->key.objectid + alignment,
372 alignment);
373 if (ret) {
374 test_err("could not add free space");
375 return ret;
376 }
377
378 return check_free_space_extents(trans, fs_info, cache, path,
379 extents, ARRAY_SIZE(extents));
380}
381
382static int test_merge_none(struct btrfs_trans_handle *trans,
383 struct btrfs_fs_info *fs_info,
384 struct btrfs_block_group_cache *cache,
385 struct btrfs_path *path,
386 u32 alignment)
387{
388 const struct free_space_extent extents[] = {
389 {cache->key.objectid, alignment},
390 {cache->key.objectid + 2 * alignment, alignment},
391 {cache->key.objectid + 4 * alignment, alignment},
392 };
393 int ret;
394
395 ret = __remove_from_free_space_tree(trans, cache, path,
396 cache->key.objectid,
397 cache->key.offset);
398 if (ret) {
399 test_err("could not remove free space");
400 return ret;
401 }
402
403 ret = __add_to_free_space_tree(trans, cache, path, cache->key.objectid,
404 alignment);
405 if (ret) {
406 test_err("could not add free space");
407 return ret;
408 }
409
410 ret = __add_to_free_space_tree(trans, cache, path,
411 cache->key.objectid + 4 * alignment,
412 alignment);
413 if (ret) {
414 test_err("could not add free space");
415 return ret;
416 }
417
418 ret = __add_to_free_space_tree(trans, cache, path,
419 cache->key.objectid + 2 * alignment,
420 alignment);
421 if (ret) {
422 test_err("could not add free space");
423 return ret;
424 }
425
426 return check_free_space_extents(trans, fs_info, cache, path,
427 extents, ARRAY_SIZE(extents));
428}
429
430typedef int (*test_func_t)(struct btrfs_trans_handle *,
431 struct btrfs_fs_info *,
432 struct btrfs_block_group_cache *,
433 struct btrfs_path *,
434 u32 alignment);
435
436static int run_test(test_func_t test_func, int bitmaps, u32 sectorsize,
437 u32 nodesize, u32 alignment)
438{
439 struct btrfs_fs_info *fs_info;
440 struct btrfs_root *root = NULL;
441 struct btrfs_block_group_cache *cache = NULL;
442 struct btrfs_trans_handle trans;
443 struct btrfs_path *path = NULL;
444 int ret;
445
446 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
447 if (!fs_info) {
448 test_std_err(TEST_ALLOC_FS_INFO);
449 ret = -ENOMEM;
450 goto out;
451 }
452
453 root = btrfs_alloc_dummy_root(fs_info);
454 if (IS_ERR(root)) {
455 test_std_err(TEST_ALLOC_ROOT);
456 ret = PTR_ERR(root);
457 goto out;
458 }
459
460 btrfs_set_super_compat_ro_flags(root->fs_info->super_copy,
461 BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE);
462 root->fs_info->free_space_root = root;
463 root->fs_info->tree_root = root;
464
465 root->node = alloc_test_extent_buffer(root->fs_info, nodesize);
466 if (!root->node) {
467 test_std_err(TEST_ALLOC_EXTENT_BUFFER);
468 ret = -ENOMEM;
469 goto out;
470 }
471 btrfs_set_header_level(root->node, 0);
472 btrfs_set_header_nritems(root->node, 0);
473 root->alloc_bytenr += 2 * nodesize;
474
475 cache = btrfs_alloc_dummy_block_group(fs_info, 8 * alignment);
476 if (!cache) {
477 test_std_err(TEST_ALLOC_BLOCK_GROUP);
478 ret = -ENOMEM;
479 goto out;
480 }
481 cache->bitmap_low_thresh = 0;
482 cache->bitmap_high_thresh = (u32)-1;
483 cache->needs_free_space = 1;
484 cache->fs_info = root->fs_info;
485
486 btrfs_init_dummy_trans(&trans, root->fs_info);
487
488 path = btrfs_alloc_path();
489 if (!path) {
490 test_std_err(TEST_ALLOC_ROOT);
491 ret = -ENOMEM;
492 goto out;
493 }
494
495 ret = add_block_group_free_space(&trans, cache);
496 if (ret) {
497 test_err("could not add block group free space");
498 goto out;
499 }
500
501 if (bitmaps) {
502 ret = convert_free_space_to_bitmaps(&trans, cache, path);
503 if (ret) {
504 test_err("could not convert block group to bitmaps");
505 goto out;
506 }
507 }
508
509 ret = test_func(&trans, root->fs_info, cache, path, alignment);
510 if (ret)
511 goto out;
512
513 ret = remove_block_group_free_space(&trans, cache);
514 if (ret) {
515 test_err("could not remove block group free space");
516 goto out;
517 }
518
519 if (btrfs_header_nritems(root->node) != 0) {
520 test_err("free space tree has leftover items");
521 ret = -EINVAL;
522 goto out;
523 }
524
525 ret = 0;
526out:
527 btrfs_free_path(path);
528 btrfs_free_dummy_block_group(cache);
529 btrfs_free_dummy_root(root);
530 btrfs_free_dummy_fs_info(fs_info);
531 return ret;
532}
533
534static int run_test_both_formats(test_func_t test_func, u32 sectorsize,
535 u32 nodesize, u32 alignment)
536{
537 int test_ret = 0;
538 int ret;
539
540 ret = run_test(test_func, 0, sectorsize, nodesize, alignment);
541 if (ret) {
542 test_err(
543 "%ps failed with extents, sectorsize=%u, nodesize=%u, alignment=%u",
544 test_func, sectorsize, nodesize, alignment);
545 test_ret = ret;
546 }
547
548 ret = run_test(test_func, 1, sectorsize, nodesize, alignment);
549 if (ret) {
550 test_err(
551 "%ps failed with bitmaps, sectorsize=%u, nodesize=%u, alignment=%u",
552 test_func, sectorsize, nodesize, alignment);
553 test_ret = ret;
554 }
555
556 return test_ret;
557}
558
559int btrfs_test_free_space_tree(u32 sectorsize, u32 nodesize)
560{
561 test_func_t tests[] = {
562 test_empty_block_group,
563 test_remove_all,
564 test_remove_beginning,
565 test_remove_end,
566 test_remove_middle,
567 test_merge_left,
568 test_merge_right,
569 test_merge_both,
570 test_merge_none,
571 };
572 u32 bitmap_alignment;
573 int test_ret = 0;
574 int i;
575
576 /*
577 * Align some operations to a page to flush out bugs in the extent
578 * buffer bitmap handling of highmem.
579 */
580 bitmap_alignment = BTRFS_FREE_SPACE_BITMAP_BITS * PAGE_SIZE;
581
582 test_msg("running free space tree tests");
583 for (i = 0; i < ARRAY_SIZE(tests); i++) {
584 int ret;
585
586 ret = run_test_both_formats(tests[i], sectorsize, nodesize,
587 sectorsize);
588 if (ret)
589 test_ret = ret;
590
591 ret = run_test_both_formats(tests[i], sectorsize, nodesize,
592 bitmap_alignment);
593 if (ret)
594 test_ret = ret;
595 }
596
597 return test_ret;
598}
1/*
2 * Copyright (C) 2015 Facebook. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
18
19#include <linux/types.h>
20#include "btrfs-tests.h"
21#include "../ctree.h"
22#include "../disk-io.h"
23#include "../free-space-tree.h"
24#include "../transaction.h"
25
26struct free_space_extent {
27 u64 start;
28 u64 length;
29};
30
31static int __check_free_space_extents(struct btrfs_trans_handle *trans,
32 struct btrfs_fs_info *fs_info,
33 struct btrfs_block_group_cache *cache,
34 struct btrfs_path *path,
35 const struct free_space_extent * const extents,
36 unsigned int num_extents)
37{
38 struct btrfs_free_space_info *info;
39 struct btrfs_key key;
40 int prev_bit = 0, bit;
41 u64 extent_start = 0, offset, end;
42 u32 flags, extent_count;
43 unsigned int i;
44 int ret;
45
46 info = search_free_space_info(trans, fs_info, cache, path, 0);
47 if (IS_ERR(info)) {
48 test_msg("Could not find free space info\n");
49 ret = PTR_ERR(info);
50 goto out;
51 }
52 flags = btrfs_free_space_flags(path->nodes[0], info);
53 extent_count = btrfs_free_space_extent_count(path->nodes[0], info);
54
55 if (extent_count != num_extents) {
56 test_msg("Extent count is wrong\n");
57 ret = -EINVAL;
58 goto out;
59 }
60 if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) {
61 if (path->slots[0] != 0)
62 goto invalid;
63 end = cache->key.objectid + cache->key.offset;
64 i = 0;
65 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) {
66 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
67 if (key.type != BTRFS_FREE_SPACE_BITMAP_KEY)
68 goto invalid;
69 offset = key.objectid;
70 while (offset < key.objectid + key.offset) {
71 bit = free_space_test_bit(cache, path, offset);
72 if (prev_bit == 0 && bit == 1) {
73 extent_start = offset;
74 } else if (prev_bit == 1 && bit == 0) {
75 if (i >= num_extents)
76 goto invalid;
77 if (i >= num_extents ||
78 extent_start != extents[i].start ||
79 offset - extent_start != extents[i].length)
80 goto invalid;
81 i++;
82 }
83 prev_bit = bit;
84 offset += cache->sectorsize;
85 }
86 }
87 if (prev_bit == 1) {
88 if (i >= num_extents ||
89 extent_start != extents[i].start ||
90 end - extent_start != extents[i].length)
91 goto invalid;
92 i++;
93 }
94 if (i != num_extents)
95 goto invalid;
96 } else {
97 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 ||
98 path->slots[0] != 0)
99 goto invalid;
100 for (i = 0; i < num_extents; i++) {
101 path->slots[0]++;
102 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
103 if (key.type != BTRFS_FREE_SPACE_EXTENT_KEY ||
104 key.objectid != extents[i].start ||
105 key.offset != extents[i].length)
106 goto invalid;
107 }
108 }
109
110 ret = 0;
111out:
112 btrfs_release_path(path);
113 return ret;
114invalid:
115 test_msg("Free space tree is invalid\n");
116 ret = -EINVAL;
117 goto out;
118}
119
120static int check_free_space_extents(struct btrfs_trans_handle *trans,
121 struct btrfs_fs_info *fs_info,
122 struct btrfs_block_group_cache *cache,
123 struct btrfs_path *path,
124 const struct free_space_extent * const extents,
125 unsigned int num_extents)
126{
127 struct btrfs_free_space_info *info;
128 u32 flags;
129 int ret;
130
131 info = search_free_space_info(trans, fs_info, cache, path, 0);
132 if (IS_ERR(info)) {
133 test_msg("Could not find free space info\n");
134 btrfs_release_path(path);
135 return PTR_ERR(info);
136 }
137 flags = btrfs_free_space_flags(path->nodes[0], info);
138 btrfs_release_path(path);
139
140 ret = __check_free_space_extents(trans, fs_info, cache, path, extents,
141 num_extents);
142 if (ret)
143 return ret;
144
145 /* Flip it to the other format and check that for good measure. */
146 if (flags & BTRFS_FREE_SPACE_USING_BITMAPS) {
147 ret = convert_free_space_to_extents(trans, fs_info, cache, path);
148 if (ret) {
149 test_msg("Could not convert to extents\n");
150 return ret;
151 }
152 } else {
153 ret = convert_free_space_to_bitmaps(trans, fs_info, cache, path);
154 if (ret) {
155 test_msg("Could not convert to bitmaps\n");
156 return ret;
157 }
158 }
159 return __check_free_space_extents(trans, fs_info, cache, path, extents,
160 num_extents);
161}
162
163static int test_empty_block_group(struct btrfs_trans_handle *trans,
164 struct btrfs_fs_info *fs_info,
165 struct btrfs_block_group_cache *cache,
166 struct btrfs_path *path,
167 u32 alignment)
168{
169 const struct free_space_extent extents[] = {
170 {cache->key.objectid, cache->key.offset},
171 };
172
173 return check_free_space_extents(trans, fs_info, cache, path,
174 extents, ARRAY_SIZE(extents));
175}
176
177static int test_remove_all(struct btrfs_trans_handle *trans,
178 struct btrfs_fs_info *fs_info,
179 struct btrfs_block_group_cache *cache,
180 struct btrfs_path *path,
181 u32 alignment)
182{
183 const struct free_space_extent extents[] = {};
184 int ret;
185
186 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
187 cache->key.objectid,
188 cache->key.offset);
189 if (ret) {
190 test_msg("Could not remove free space\n");
191 return ret;
192 }
193
194 return check_free_space_extents(trans, fs_info, cache, path,
195 extents, ARRAY_SIZE(extents));
196}
197
198static int test_remove_beginning(struct btrfs_trans_handle *trans,
199 struct btrfs_fs_info *fs_info,
200 struct btrfs_block_group_cache *cache,
201 struct btrfs_path *path,
202 u32 alignment)
203{
204 const struct free_space_extent extents[] = {
205 {cache->key.objectid + alignment,
206 cache->key.offset - alignment},
207 };
208 int ret;
209
210 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
211 cache->key.objectid, alignment);
212 if (ret) {
213 test_msg("Could not remove free space\n");
214 return ret;
215 }
216
217 return check_free_space_extents(trans, fs_info, cache, path,
218 extents, ARRAY_SIZE(extents));
219
220}
221
222static int test_remove_end(struct btrfs_trans_handle *trans,
223 struct btrfs_fs_info *fs_info,
224 struct btrfs_block_group_cache *cache,
225 struct btrfs_path *path,
226 u32 alignment)
227{
228 const struct free_space_extent extents[] = {
229 {cache->key.objectid, cache->key.offset - alignment},
230 };
231 int ret;
232
233 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
234 cache->key.objectid +
235 cache->key.offset - alignment,
236 alignment);
237 if (ret) {
238 test_msg("Could not remove free space\n");
239 return ret;
240 }
241
242 return check_free_space_extents(trans, fs_info, cache, path,
243 extents, ARRAY_SIZE(extents));
244}
245
246static int test_remove_middle(struct btrfs_trans_handle *trans,
247 struct btrfs_fs_info *fs_info,
248 struct btrfs_block_group_cache *cache,
249 struct btrfs_path *path,
250 u32 alignment)
251{
252 const struct free_space_extent extents[] = {
253 {cache->key.objectid, alignment},
254 {cache->key.objectid + 2 * alignment,
255 cache->key.offset - 2 * alignment},
256 };
257 int ret;
258
259 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
260 cache->key.objectid + alignment,
261 alignment);
262 if (ret) {
263 test_msg("Could not remove free space\n");
264 return ret;
265 }
266
267 return check_free_space_extents(trans, fs_info, cache, path,
268 extents, ARRAY_SIZE(extents));
269}
270
271static int test_merge_left(struct btrfs_trans_handle *trans,
272 struct btrfs_fs_info *fs_info,
273 struct btrfs_block_group_cache *cache,
274 struct btrfs_path *path,
275 u32 alignment)
276{
277 const struct free_space_extent extents[] = {
278 {cache->key.objectid, 2 * alignment},
279 };
280 int ret;
281
282 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
283 cache->key.objectid,
284 cache->key.offset);
285 if (ret) {
286 test_msg("Could not remove free space\n");
287 return ret;
288 }
289
290 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
291 cache->key.objectid, alignment);
292 if (ret) {
293 test_msg("Could not add free space\n");
294 return ret;
295 }
296
297 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
298 cache->key.objectid + alignment,
299 alignment);
300 if (ret) {
301 test_msg("Could not add free space\n");
302 return ret;
303 }
304
305 return check_free_space_extents(trans, fs_info, cache, path,
306 extents, ARRAY_SIZE(extents));
307}
308
309static int test_merge_right(struct btrfs_trans_handle *trans,
310 struct btrfs_fs_info *fs_info,
311 struct btrfs_block_group_cache *cache,
312 struct btrfs_path *path,
313 u32 alignment)
314{
315 const struct free_space_extent extents[] = {
316 {cache->key.objectid + alignment, 2 * alignment},
317 };
318 int ret;
319
320 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
321 cache->key.objectid,
322 cache->key.offset);
323 if (ret) {
324 test_msg("Could not remove free space\n");
325 return ret;
326 }
327
328 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
329 cache->key.objectid + 2 * alignment,
330 alignment);
331 if (ret) {
332 test_msg("Could not add free space\n");
333 return ret;
334 }
335
336 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
337 cache->key.objectid + alignment,
338 alignment);
339 if (ret) {
340 test_msg("Could not add free space\n");
341 return ret;
342 }
343
344 return check_free_space_extents(trans, fs_info, cache, path,
345 extents, ARRAY_SIZE(extents));
346}
347
348static int test_merge_both(struct btrfs_trans_handle *trans,
349 struct btrfs_fs_info *fs_info,
350 struct btrfs_block_group_cache *cache,
351 struct btrfs_path *path,
352 u32 alignment)
353{
354 const struct free_space_extent extents[] = {
355 {cache->key.objectid, 3 * alignment},
356 };
357 int ret;
358
359 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
360 cache->key.objectid,
361 cache->key.offset);
362 if (ret) {
363 test_msg("Could not remove free space\n");
364 return ret;
365 }
366
367 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
368 cache->key.objectid, alignment);
369 if (ret) {
370 test_msg("Could not add free space\n");
371 return ret;
372 }
373
374 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
375 cache->key.objectid + 2 * alignment,
376 alignment);
377 if (ret) {
378 test_msg("Could not add free space\n");
379 return ret;
380 }
381
382 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
383 cache->key.objectid + alignment,
384 alignment);
385 if (ret) {
386 test_msg("Could not add free space\n");
387 return ret;
388 }
389
390 return check_free_space_extents(trans, fs_info, cache, path,
391 extents, ARRAY_SIZE(extents));
392}
393
394static int test_merge_none(struct btrfs_trans_handle *trans,
395 struct btrfs_fs_info *fs_info,
396 struct btrfs_block_group_cache *cache,
397 struct btrfs_path *path,
398 u32 alignment)
399{
400 const struct free_space_extent extents[] = {
401 {cache->key.objectid, alignment},
402 {cache->key.objectid + 2 * alignment, alignment},
403 {cache->key.objectid + 4 * alignment, alignment},
404 };
405 int ret;
406
407 ret = __remove_from_free_space_tree(trans, fs_info, cache, path,
408 cache->key.objectid,
409 cache->key.offset);
410 if (ret) {
411 test_msg("Could not remove free space\n");
412 return ret;
413 }
414
415 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
416 cache->key.objectid, alignment);
417 if (ret) {
418 test_msg("Could not add free space\n");
419 return ret;
420 }
421
422 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
423 cache->key.objectid + 4 * alignment,
424 alignment);
425 if (ret) {
426 test_msg("Could not add free space\n");
427 return ret;
428 }
429
430 ret = __add_to_free_space_tree(trans, fs_info, cache, path,
431 cache->key.objectid + 2 * alignment,
432 alignment);
433 if (ret) {
434 test_msg("Could not add free space\n");
435 return ret;
436 }
437
438 return check_free_space_extents(trans, fs_info, cache, path,
439 extents, ARRAY_SIZE(extents));
440}
441
442typedef int (*test_func_t)(struct btrfs_trans_handle *,
443 struct btrfs_fs_info *,
444 struct btrfs_block_group_cache *,
445 struct btrfs_path *,
446 u32 alignment);
447
448static int run_test(test_func_t test_func, int bitmaps, u32 sectorsize,
449 u32 nodesize, u32 alignment)
450{
451 struct btrfs_fs_info *fs_info;
452 struct btrfs_root *root = NULL;
453 struct btrfs_block_group_cache *cache = NULL;
454 struct btrfs_trans_handle trans;
455 struct btrfs_path *path = NULL;
456 int ret;
457
458 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
459 if (!fs_info) {
460 test_msg("Couldn't allocate dummy fs info\n");
461 ret = -ENOMEM;
462 goto out;
463 }
464
465 root = btrfs_alloc_dummy_root(fs_info);
466 if (IS_ERR(root)) {
467 test_msg("Couldn't allocate dummy root\n");
468 ret = PTR_ERR(root);
469 goto out;
470 }
471
472 btrfs_set_super_compat_ro_flags(root->fs_info->super_copy,
473 BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE);
474 root->fs_info->free_space_root = root;
475 root->fs_info->tree_root = root;
476
477 root->node = alloc_test_extent_buffer(root->fs_info, nodesize);
478 if (!root->node) {
479 test_msg("Couldn't allocate dummy buffer\n");
480 ret = -ENOMEM;
481 goto out;
482 }
483 btrfs_set_header_level(root->node, 0);
484 btrfs_set_header_nritems(root->node, 0);
485 root->alloc_bytenr += 2 * nodesize;
486
487 cache = btrfs_alloc_dummy_block_group(fs_info, 8 * alignment);
488 if (!cache) {
489 test_msg("Couldn't allocate dummy block group cache\n");
490 ret = -ENOMEM;
491 goto out;
492 }
493 cache->bitmap_low_thresh = 0;
494 cache->bitmap_high_thresh = (u32)-1;
495 cache->needs_free_space = 1;
496 cache->fs_info = root->fs_info;
497
498 btrfs_init_dummy_trans(&trans);
499
500 path = btrfs_alloc_path();
501 if (!path) {
502 test_msg("Couldn't allocate path\n");
503 return -ENOMEM;
504 }
505
506 ret = add_block_group_free_space(&trans, root->fs_info, cache);
507 if (ret) {
508 test_msg("Could not add block group free space\n");
509 goto out;
510 }
511
512 if (bitmaps) {
513 ret = convert_free_space_to_bitmaps(&trans, root->fs_info,
514 cache, path);
515 if (ret) {
516 test_msg("Could not convert block group to bitmaps\n");
517 goto out;
518 }
519 }
520
521 ret = test_func(&trans, root->fs_info, cache, path, alignment);
522 if (ret)
523 goto out;
524
525 ret = remove_block_group_free_space(&trans, root->fs_info, cache);
526 if (ret) {
527 test_msg("Could not remove block group free space\n");
528 goto out;
529 }
530
531 if (btrfs_header_nritems(root->node) != 0) {
532 test_msg("Free space tree has leftover items\n");
533 ret = -EINVAL;
534 goto out;
535 }
536
537 ret = 0;
538out:
539 btrfs_free_path(path);
540 btrfs_free_dummy_block_group(cache);
541 btrfs_free_dummy_root(root);
542 btrfs_free_dummy_fs_info(fs_info);
543 return ret;
544}
545
546static int run_test_both_formats(test_func_t test_func, u32 sectorsize,
547 u32 nodesize, u32 alignment)
548{
549 int test_ret = 0;
550 int ret;
551
552 ret = run_test(test_func, 0, sectorsize, nodesize, alignment);
553 if (ret) {
554 test_msg("%pf failed with extents, sectorsize=%u, nodesize=%u, alignment=%u\n",
555 test_func, sectorsize, nodesize, alignment);
556 test_ret = ret;
557 }
558
559 ret = run_test(test_func, 1, sectorsize, nodesize, alignment);
560 if (ret) {
561 test_msg("%pf failed with bitmaps, sectorsize=%u, nodesize=%u, alignment=%u\n",
562 test_func, sectorsize, nodesize, alignment);
563 test_ret = ret;
564 }
565
566 return test_ret;
567}
568
569int btrfs_test_free_space_tree(u32 sectorsize, u32 nodesize)
570{
571 test_func_t tests[] = {
572 test_empty_block_group,
573 test_remove_all,
574 test_remove_beginning,
575 test_remove_end,
576 test_remove_middle,
577 test_merge_left,
578 test_merge_right,
579 test_merge_both,
580 test_merge_none,
581 };
582 u32 bitmap_alignment;
583 int test_ret = 0;
584 int i;
585
586 /*
587 * Align some operations to a page to flush out bugs in the extent
588 * buffer bitmap handling of highmem.
589 */
590 bitmap_alignment = BTRFS_FREE_SPACE_BITMAP_BITS * PAGE_SIZE;
591
592 test_msg("Running free space tree tests\n");
593 for (i = 0; i < ARRAY_SIZE(tests); i++) {
594 int ret;
595
596 ret = run_test_both_formats(tests[i], sectorsize, nodesize,
597 sectorsize);
598 if (ret)
599 test_ret = ret;
600
601 ret = run_test_both_formats(tests[i], sectorsize, nodesize,
602 bitmap_alignment);
603 if (ret)
604 test_ret = ret;
605 }
606
607 return test_ret;
608}