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