Line data Source code
1 : // SPDX-License-Identifier: GPL-2.0
2 :
3 : #include <linux/sizes.h>
4 : #include <linux/list_sort.h>
5 : #include "misc.h"
6 : #include "ctree.h"
7 : #include "block-group.h"
8 : #include "space-info.h"
9 : #include "disk-io.h"
10 : #include "free-space-cache.h"
11 : #include "free-space-tree.h"
12 : #include "volumes.h"
13 : #include "transaction.h"
14 : #include "ref-verify.h"
15 : #include "sysfs.h"
16 : #include "tree-log.h"
17 : #include "delalloc-space.h"
18 : #include "discard.h"
19 : #include "raid56.h"
20 : #include "zoned.h"
21 : #include "fs.h"
22 : #include "accessors.h"
23 : #include "extent-tree.h"
24 :
25 : #ifdef CONFIG_BTRFS_DEBUG
26 : int btrfs_should_fragment_free_space(struct btrfs_block_group *block_group)
27 : {
28 : struct btrfs_fs_info *fs_info = block_group->fs_info;
29 :
30 : return (btrfs_test_opt(fs_info, FRAGMENT_METADATA) &&
31 : block_group->flags & BTRFS_BLOCK_GROUP_METADATA) ||
32 : (btrfs_test_opt(fs_info, FRAGMENT_DATA) &&
33 : block_group->flags & BTRFS_BLOCK_GROUP_DATA);
34 : }
35 : #endif
36 :
37 : /*
38 : * Return target flags in extended format or 0 if restripe for this chunk_type
39 : * is not in progress
40 : *
41 : * Should be called with balance_lock held
42 : */
43 89775793 : static u64 get_restripe_target(struct btrfs_fs_info *fs_info, u64 flags)
44 : {
45 89775793 : struct btrfs_balance_control *bctl = fs_info->balance_ctl;
46 89775793 : u64 target = 0;
47 :
48 89775793 : if (!bctl)
49 : return 0;
50 :
51 8365558 : if (flags & BTRFS_BLOCK_GROUP_DATA &&
52 127591 : bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) {
53 0 : target = BTRFS_BLOCK_GROUP_DATA | bctl->data.target;
54 8365558 : } else if (flags & BTRFS_BLOCK_GROUP_SYSTEM &&
55 1282 : bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) {
56 0 : target = BTRFS_BLOCK_GROUP_SYSTEM | bctl->sys.target;
57 8365558 : } else if (flags & BTRFS_BLOCK_GROUP_METADATA &&
58 8236685 : bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) {
59 0 : target = BTRFS_BLOCK_GROUP_METADATA | bctl->meta.target;
60 : }
61 :
62 : return target;
63 : }
64 :
65 : /*
66 : * @flags: available profiles in extended format (see ctree.h)
67 : *
68 : * Return reduced profile in chunk format. If profile changing is in progress
69 : * (either running or paused) picks the target profile (if it's already
70 : * available), otherwise falls back to plain reducing.
71 : */
72 89767181 : static u64 btrfs_reduce_alloc_profile(struct btrfs_fs_info *fs_info, u64 flags)
73 : {
74 89767181 : u64 num_devices = fs_info->fs_devices->rw_devices;
75 89767181 : u64 target;
76 89767181 : u64 raid_type;
77 89767181 : u64 allowed = 0;
78 :
79 : /*
80 : * See if restripe for this chunk_type is in progress, if so try to
81 : * reduce to the target profile
82 : */
83 89767181 : spin_lock(&fs_info->balance_lock);
84 89775750 : target = get_restripe_target(fs_info, flags);
85 89775750 : if (target) {
86 0 : spin_unlock(&fs_info->balance_lock);
87 0 : return extended_to_chunk(target);
88 : }
89 89775750 : spin_unlock(&fs_info->balance_lock);
90 :
91 : /* First, mask out the RAID levels which aren't possible */
92 987499322 : for (raid_type = 0; raid_type < BTRFS_NR_RAID_TYPES; raid_type++) {
93 807948763 : if (num_devices >= btrfs_raid_array[raid_type].devs_min)
94 269322435 : allowed |= btrfs_raid_array[raid_type].bg_flag;
95 : }
96 89774809 : allowed &= flags;
97 :
98 : /* Select the highest-redundancy RAID level. */
99 89774809 : if (allowed & BTRFS_BLOCK_GROUP_RAID1C4)
100 : allowed = BTRFS_BLOCK_GROUP_RAID1C4;
101 89774794 : else if (allowed & BTRFS_BLOCK_GROUP_RAID6)
102 : allowed = BTRFS_BLOCK_GROUP_RAID6;
103 89774300 : else if (allowed & BTRFS_BLOCK_GROUP_RAID1C3)
104 : allowed = BTRFS_BLOCK_GROUP_RAID1C3;
105 89774292 : else if (allowed & BTRFS_BLOCK_GROUP_RAID5)
106 : allowed = BTRFS_BLOCK_GROUP_RAID5;
107 89774262 : else if (allowed & BTRFS_BLOCK_GROUP_RAID10)
108 : allowed = BTRFS_BLOCK_GROUP_RAID10;
109 89774235 : else if (allowed & BTRFS_BLOCK_GROUP_RAID1)
110 : allowed = BTRFS_BLOCK_GROUP_RAID1;
111 89774190 : else if (allowed & BTRFS_BLOCK_GROUP_DUP)
112 : allowed = BTRFS_BLOCK_GROUP_DUP;
113 7046998 : else if (allowed & BTRFS_BLOCK_GROUP_RAID0)
114 0 : allowed = BTRFS_BLOCK_GROUP_RAID0;
115 :
116 89774809 : flags &= ~BTRFS_BLOCK_GROUP_PROFILE_MASK;
117 :
118 89774809 : return extended_to_chunk(flags | allowed);
119 : }
120 :
121 89770376 : u64 btrfs_get_alloc_profile(struct btrfs_fs_info *fs_info, u64 orig_flags)
122 : {
123 89770376 : unsigned seq;
124 89770376 : u64 flags;
125 :
126 89770376 : do {
127 89770376 : flags = orig_flags;
128 89770376 : seq = read_seqbegin(&fs_info->profiles_lock);
129 :
130 89767852 : if (flags & BTRFS_BLOCK_GROUP_DATA)
131 6259804 : flags |= fs_info->avail_data_alloc_bits;
132 83508048 : else if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
133 4991 : flags |= fs_info->avail_system_alloc_bits;
134 83503057 : else if (flags & BTRFS_BLOCK_GROUP_METADATA)
135 83503048 : flags |= fs_info->avail_metadata_alloc_bits;
136 89767852 : } while (read_seqretry(&fs_info->profiles_lock, seq));
137 :
138 89766964 : return btrfs_reduce_alloc_profile(fs_info, flags);
139 : }
140 :
141 13080826 : void btrfs_get_block_group(struct btrfs_block_group *cache)
142 : {
143 13080826 : refcount_inc(&cache->refs);
144 68737045 : }
145 :
146 81859683 : void btrfs_put_block_group(struct btrfs_block_group *cache)
147 : {
148 81859683 : if (refcount_dec_and_test(&cache->refs)) {
149 22201 : WARN_ON(cache->pinned > 0);
150 : /*
151 : * If there was a failure to cleanup a log tree, very likely due
152 : * to an IO failure on a writeback attempt of one or more of its
153 : * extent buffers, we could not do proper (and cheap) unaccounting
154 : * of their reserved space, so don't warn on reserved > 0 in that
155 : * case.
156 : */
157 22201 : if (!(cache->flags & BTRFS_BLOCK_GROUP_METADATA) ||
158 3714 : !BTRFS_FS_LOG_CLEANUP_ERROR(cache->fs_info))
159 22200 : WARN_ON(cache->reserved > 0);
160 :
161 : /*
162 : * A block_group shouldn't be on the discard_list anymore.
163 : * Remove the block_group from the discard_list to prevent us
164 : * from causing a panic due to NULL pointer dereference.
165 : */
166 22201 : if (WARN_ON(!list_empty(&cache->discard_list)))
167 0 : btrfs_discard_cancel_work(&cache->fs_info->discard_ctl,
168 : cache);
169 :
170 22201 : kfree(cache->free_space_ctl);
171 22201 : kfree(cache->physical_map);
172 22201 : kfree(cache);
173 : }
174 81860545 : }
175 :
176 : /*
177 : * This adds the block group to the fs_info rb tree for the block group cache
178 : */
179 22198 : static int btrfs_add_block_group_cache(struct btrfs_fs_info *info,
180 : struct btrfs_block_group *block_group)
181 : {
182 22198 : struct rb_node **p;
183 22198 : struct rb_node *parent = NULL;
184 22198 : struct btrfs_block_group *cache;
185 22198 : bool leftmost = true;
186 :
187 22198 : ASSERT(block_group->length != 0);
188 :
189 22198 : write_lock(&info->block_group_cache_lock);
190 22198 : p = &info->block_group_cache_tree.rb_root.rb_node;
191 :
192 89645 : while (*p) {
193 67447 : parent = *p;
194 67447 : cache = rb_entry(parent, struct btrfs_block_group, cache_node);
195 67447 : if (block_group->start < cache->start) {
196 0 : p = &(*p)->rb_left;
197 67447 : } else if (block_group->start > cache->start) {
198 67447 : p = &(*p)->rb_right;
199 67447 : leftmost = false;
200 : } else {
201 0 : write_unlock(&info->block_group_cache_lock);
202 0 : return -EEXIST;
203 : }
204 : }
205 :
206 22198 : rb_link_node(&block_group->cache_node, parent, p);
207 22198 : rb_insert_color_cached(&block_group->cache_node,
208 : &info->block_group_cache_tree, leftmost);
209 :
210 22198 : write_unlock(&info->block_group_cache_lock);
211 :
212 22198 : return 0;
213 : }
214 :
215 : /*
216 : * This will return the block group at or after bytenr if contains is 0, else
217 : * it will return the block group that contains the bytenr
218 : */
219 68187130 : static struct btrfs_block_group *block_group_cache_tree_search(
220 : struct btrfs_fs_info *info, u64 bytenr, int contains)
221 : {
222 68187130 : struct btrfs_block_group *cache, *ret = NULL;
223 68187130 : struct rb_node *n;
224 68187130 : u64 end, start;
225 :
226 68187130 : read_lock(&info->block_group_cache_lock);
227 68187070 : n = info->block_group_cache_tree.rb_root.rb_node;
228 :
229 210404334 : while (n) {
230 210400688 : cache = rb_entry(n, struct btrfs_block_group, cache_node);
231 210400688 : end = cache->start + cache->length - 1;
232 210400688 : start = cache->start;
233 :
234 210400688 : if (bytenr < start) {
235 38017927 : if (!contains && (!ret || start < ret->start))
236 8083 : ret = cache;
237 38017927 : n = n->rb_left;
238 172382761 : } else if (bytenr > start) {
239 168301956 : if (contains && bytenr <= end) {
240 : ret = cache;
241 : break;
242 : }
243 104199337 : n = n->rb_right;
244 : } else {
245 : ret = cache;
246 : break;
247 : }
248 : }
249 68187070 : if (ret)
250 68186435 : btrfs_get_block_group(ret);
251 68185946 : read_unlock(&info->block_group_cache_lock);
252 :
253 68185583 : return ret;
254 : }
255 :
256 : /*
257 : * Return the block group that starts at or after bytenr
258 : */
259 589 : struct btrfs_block_group *btrfs_lookup_first_block_group(
260 : struct btrfs_fs_info *info, u64 bytenr)
261 : {
262 589 : return block_group_cache_tree_search(info, bytenr, 0);
263 : }
264 :
265 : /*
266 : * Return the block group that contains the given bytenr
267 : */
268 38147699 : struct btrfs_block_group *btrfs_lookup_block_group(
269 : struct btrfs_fs_info *info, u64 bytenr)
270 : {
271 38147699 : return block_group_cache_tree_search(info, bytenr, 1);
272 : }
273 :
274 23847 : struct btrfs_block_group *btrfs_next_block_group(
275 : struct btrfs_block_group *cache)
276 : {
277 23847 : struct btrfs_fs_info *fs_info = cache->fs_info;
278 23847 : struct rb_node *node;
279 :
280 23847 : read_lock(&fs_info->block_group_cache_lock);
281 :
282 : /* If our block group was removed, we need a full search. */
283 23847 : if (RB_EMPTY_NODE(&cache->cache_node)) {
284 0 : const u64 next_bytenr = cache->start + cache->length;
285 :
286 0 : read_unlock(&fs_info->block_group_cache_lock);
287 0 : btrfs_put_block_group(cache);
288 0 : return btrfs_lookup_first_block_group(fs_info, next_bytenr);
289 : }
290 23847 : node = rb_next(&cache->cache_node);
291 23847 : btrfs_put_block_group(cache);
292 23847 : if (node) {
293 20296 : cache = rb_entry(node, struct btrfs_block_group, cache_node);
294 20296 : btrfs_get_block_group(cache);
295 : } else
296 : cache = NULL;
297 23847 : read_unlock(&fs_info->block_group_cache_lock);
298 23847 : return cache;
299 : }
300 :
301 : /*
302 : * Check if we can do a NOCOW write for a given extent.
303 : *
304 : * @fs_info: The filesystem information object.
305 : * @bytenr: Logical start address of the extent.
306 : *
307 : * Check if we can do a NOCOW write for the given extent, and increments the
308 : * number of NOCOW writers in the block group that contains the extent, as long
309 : * as the block group exists and it's currently not in read-only mode.
310 : *
311 : * Returns: A non-NULL block group pointer if we can do a NOCOW write, the caller
312 : * is responsible for calling btrfs_dec_nocow_writers() later.
313 : *
314 : * Or NULL if we can not do a NOCOW write
315 : */
316 285753 : struct btrfs_block_group *btrfs_inc_nocow_writers(struct btrfs_fs_info *fs_info,
317 : u64 bytenr)
318 : {
319 285753 : struct btrfs_block_group *bg;
320 285753 : bool can_nocow = true;
321 :
322 285753 : bg = btrfs_lookup_block_group(fs_info, bytenr);
323 285753 : if (!bg)
324 : return NULL;
325 :
326 285753 : spin_lock(&bg->lock);
327 285752 : if (bg->ro)
328 : can_nocow = false;
329 : else
330 285752 : atomic_inc(&bg->nocow_writers);
331 285753 : spin_unlock(&bg->lock);
332 :
333 285753 : if (!can_nocow) {
334 0 : btrfs_put_block_group(bg);
335 0 : return NULL;
336 : }
337 :
338 : /* No put on block group, done by btrfs_dec_nocow_writers(). */
339 : return bg;
340 : }
341 :
342 : /*
343 : * Decrement the number of NOCOW writers in a block group.
344 : *
345 : * This is meant to be called after a previous call to btrfs_inc_nocow_writers(),
346 : * and on the block group returned by that call. Typically this is called after
347 : * creating an ordered extent for a NOCOW write, to prevent races with scrub and
348 : * relocation.
349 : *
350 : * After this call, the caller should not use the block group anymore. It it wants
351 : * to use it, then it should get a reference on it before calling this function.
352 : */
353 285753 : void btrfs_dec_nocow_writers(struct btrfs_block_group *bg)
354 : {
355 285753 : if (atomic_dec_and_test(&bg->nocow_writers))
356 285706 : wake_up_var(&bg->nocow_writers);
357 :
358 : /* For the lookup done by a previous call to btrfs_inc_nocow_writers(). */
359 285751 : btrfs_put_block_group(bg);
360 285752 : }
361 :
362 499 : void btrfs_wait_nocow_writers(struct btrfs_block_group *bg)
363 : {
364 499 : wait_var_event(&bg->nocow_writers, !atomic_read(&bg->nocow_writers));
365 499 : }
366 :
367 12355095 : void btrfs_dec_block_group_reservations(struct btrfs_fs_info *fs_info,
368 : const u64 start)
369 : {
370 12355095 : struct btrfs_block_group *bg;
371 :
372 12355095 : bg = btrfs_lookup_block_group(fs_info, start);
373 12354967 : ASSERT(bg);
374 12354967 : if (atomic_dec_and_test(&bg->reservations))
375 12336779 : wake_up_var(&bg->reservations);
376 12355230 : btrfs_put_block_group(bg);
377 12355281 : }
378 :
379 499 : void btrfs_wait_block_group_reservations(struct btrfs_block_group *bg)
380 : {
381 499 : struct btrfs_space_info *space_info = bg->space_info;
382 :
383 499 : ASSERT(bg->ro);
384 :
385 499 : if (!(bg->flags & BTRFS_BLOCK_GROUP_DATA))
386 : return;
387 :
388 : /*
389 : * Our block group is read only but before we set it to read only,
390 : * some task might have had allocated an extent from it already, but it
391 : * has not yet created a respective ordered extent (and added it to a
392 : * root's list of ordered extents).
393 : * Therefore wait for any task currently allocating extents, since the
394 : * block group's reservations counter is incremented while a read lock
395 : * on the groups' semaphore is held and decremented after releasing
396 : * the read access on that semaphore and creating the ordered extent.
397 : */
398 219 : down_write(&space_info->groups_sem);
399 219 : up_write(&space_info->groups_sem);
400 :
401 219 : wait_var_event(&bg->reservations, !atomic_read(&bg->reservations));
402 : }
403 :
404 25196 : struct btrfs_caching_control *btrfs_get_caching_control(
405 : struct btrfs_block_group *cache)
406 : {
407 25196 : struct btrfs_caching_control *ctl;
408 :
409 25196 : spin_lock(&cache->lock);
410 25196 : if (!cache->caching_ctl) {
411 22202 : spin_unlock(&cache->lock);
412 22202 : return NULL;
413 : }
414 :
415 2994 : ctl = cache->caching_ctl;
416 2994 : refcount_inc(&ctl->count);
417 2994 : spin_unlock(&cache->lock);
418 2994 : return ctl;
419 : }
420 :
421 1530483 : void btrfs_put_caching_control(struct btrfs_caching_control *ctl)
422 : {
423 1530483 : if (refcount_dec_and_test(&ctl->count))
424 5628 : kfree(ctl);
425 1530489 : }
426 :
427 : /*
428 : * When we wait for progress in the block group caching, its because our
429 : * allocation attempt failed at least once. So, we must sleep and let some
430 : * progress happen before we try again.
431 : *
432 : * This function will sleep at least once waiting for new free space to show
433 : * up, and then it will check the block group free space numbers for our min
434 : * num_bytes. Another option is to have it go ahead and look in the rbtree for
435 : * a free extent of a given size, but this is a good start.
436 : *
437 : * Callers of this must check if cache->cached == BTRFS_CACHE_ERROR before using
438 : * any of the information in this block group.
439 : */
440 2995 : void btrfs_wait_block_group_cache_progress(struct btrfs_block_group *cache,
441 : u64 num_bytes)
442 : {
443 2995 : struct btrfs_caching_control *caching_ctl;
444 :
445 2995 : caching_ctl = btrfs_get_caching_control(cache);
446 2995 : if (!caching_ctl)
447 : return;
448 :
449 5960 : wait_event(caching_ctl->wait, btrfs_block_group_done(cache) ||
450 : (cache->free_space_ctl->free_space >= num_bytes));
451 :
452 2994 : btrfs_put_caching_control(caching_ctl);
453 : }
454 :
455 654 : static int btrfs_caching_ctl_wait_done(struct btrfs_block_group *cache,
456 : struct btrfs_caching_control *caching_ctl)
457 : {
458 2029 : wait_event(caching_ctl->wait, btrfs_block_group_done(cache));
459 654 : return cache->cached == BTRFS_CACHE_ERROR ? -EIO : 0;
460 : }
461 :
462 21690 : static int btrfs_wait_block_group_cache_done(struct btrfs_block_group *cache)
463 : {
464 21690 : struct btrfs_caching_control *caching_ctl;
465 21690 : int ret;
466 :
467 21690 : caching_ctl = btrfs_get_caching_control(cache);
468 21690 : if (!caching_ctl)
469 21690 : return (cache->cached == BTRFS_CACHE_ERROR) ? -EIO : 0;
470 0 : ret = btrfs_caching_ctl_wait_done(cache, caching_ctl);
471 0 : btrfs_put_caching_control(caching_ctl);
472 0 : return ret;
473 : }
474 :
475 : #ifdef CONFIG_BTRFS_DEBUG
476 : static void fragment_free_space(struct btrfs_block_group *block_group)
477 : {
478 : struct btrfs_fs_info *fs_info = block_group->fs_info;
479 : u64 start = block_group->start;
480 : u64 len = block_group->length;
481 : u64 chunk = block_group->flags & BTRFS_BLOCK_GROUP_METADATA ?
482 : fs_info->nodesize : fs_info->sectorsize;
483 : u64 step = chunk << 1;
484 :
485 : while (len > chunk) {
486 : btrfs_remove_free_space(block_group, start, chunk);
487 : start += step;
488 : if (len < step)
489 : len = 0;
490 : else
491 : len -= step;
492 : }
493 : }
494 : #endif
495 :
496 : /*
497 : * This is only called by btrfs_cache_block_group, since we could have freed
498 : * extents we need to check the pinned_extents for any extents that can't be
499 : * used yet since their free space will be released as soon as the transaction
500 : * commits.
501 : */
502 119980 : u64 add_new_free_space(struct btrfs_block_group *block_group, u64 start, u64 end)
503 : {
504 119980 : struct btrfs_fs_info *info = block_group->fs_info;
505 119980 : u64 extent_start, extent_end, size, total_added = 0;
506 119980 : int ret;
507 :
508 123180 : while (start < end) {
509 122812 : ret = find_first_extent_bit(&info->excluded_extents, start,
510 : &extent_start, &extent_end,
511 : EXTENT_DIRTY | EXTENT_UPTODATE,
512 : NULL);
513 122812 : if (ret)
514 : break;
515 :
516 44670 : if (extent_start <= start) {
517 18 : start = extent_end + 1;
518 44652 : } else if (extent_start > start && extent_start < end) {
519 3182 : size = extent_start - start;
520 3182 : total_added += size;
521 3182 : ret = btrfs_add_free_space_async_trimmed(block_group,
522 : start, size);
523 3182 : BUG_ON(ret); /* -ENOMEM or logic error */
524 3182 : start = extent_end + 1;
525 : } else {
526 : break;
527 : }
528 : }
529 :
530 119980 : if (start < end) {
531 119612 : size = end - start;
532 119612 : total_added += size;
533 119612 : ret = btrfs_add_free_space_async_trimmed(block_group, start,
534 : size);
535 119612 : BUG_ON(ret); /* -ENOMEM or logic error */
536 : }
537 :
538 119980 : return total_added;
539 : }
540 :
541 : /*
542 : * Get an arbitrary extent item index / max_index through the block group
543 : *
544 : * @block_group the block group to sample from
545 : * @index: the integral step through the block group to grab from
546 : * @max_index: the granularity of the sampling
547 : * @key: return value parameter for the item we find
548 : *
549 : * Pre-conditions on indices:
550 : * 0 <= index <= max_index
551 : * 0 < max_index
552 : *
553 : * Returns: 0 on success, 1 if the search didn't yield a useful item, negative
554 : * error code on error.
555 : */
556 9795 : static int sample_block_group_extent_item(struct btrfs_caching_control *caching_ctl,
557 : struct btrfs_block_group *block_group,
558 : int index, int max_index,
559 : struct btrfs_key *found_key)
560 : {
561 9795 : struct btrfs_fs_info *fs_info = block_group->fs_info;
562 9795 : struct btrfs_root *extent_root;
563 9795 : u64 search_offset;
564 9795 : u64 search_end = block_group->start + block_group->length;
565 9795 : struct btrfs_path *path;
566 9795 : struct btrfs_key search_key;
567 9795 : int ret = 0;
568 :
569 9795 : ASSERT(index >= 0);
570 9795 : ASSERT(index <= max_index);
571 9795 : ASSERT(max_index > 0);
572 9795 : lockdep_assert_held(&caching_ctl->mutex);
573 9795 : lockdep_assert_held_read(&fs_info->commit_root_sem);
574 :
575 9795 : path = btrfs_alloc_path();
576 9795 : if (!path)
577 : return -ENOMEM;
578 :
579 9795 : extent_root = btrfs_extent_root(fs_info, max_t(u64, block_group->start,
580 : BTRFS_SUPER_INFO_OFFSET));
581 :
582 9795 : path->skip_locking = 1;
583 9795 : path->search_commit_root = 1;
584 9795 : path->reada = READA_FORWARD;
585 :
586 9795 : search_offset = index * div_u64(block_group->length, max_index);
587 9795 : search_key.objectid = block_group->start + search_offset;
588 9795 : search_key.type = BTRFS_EXTENT_ITEM_KEY;
589 9795 : search_key.offset = 0;
590 :
591 10564 : btrfs_for_each_slot(extent_root, &search_key, found_key, path, ret) {
592 : /* Success; sampled an extent item in the block group */
593 9710 : if (found_key->type == BTRFS_EXTENT_ITEM_KEY &&
594 6101 : found_key->objectid >= block_group->start &&
595 6101 : found_key->objectid + found_key->offset <= search_end)
596 : break;
597 :
598 : /* We can't possibly find a valid extent item anymore */
599 3991 : if (found_key->objectid >= search_end) {
600 : ret = 1;
601 : break;
602 : }
603 : }
604 :
605 9795 : lockdep_assert_held(&caching_ctl->mutex);
606 9795 : lockdep_assert_held_read(&fs_info->commit_root_sem);
607 9795 : btrfs_free_path(path);
608 9795 : return ret;
609 : }
610 :
611 : /*
612 : * Best effort attempt to compute a block group's size class while caching it.
613 : *
614 : * @block_group: the block group we are caching
615 : *
616 : * We cannot infer the size class while adding free space extents, because that
617 : * logic doesn't care about contiguous file extents (it doesn't differentiate
618 : * between a 100M extent and 100 contiguous 1M extents). So we need to read the
619 : * file extent items. Reading all of them is quite wasteful, because usually
620 : * only a handful are enough to give a good answer. Therefore, we just grab 5 of
621 : * them at even steps through the block group and pick the smallest size class
622 : * we see. Since size class is best effort, and not guaranteed in general,
623 : * inaccuracy is acceptable.
624 : *
625 : * To be more explicit about why this algorithm makes sense:
626 : *
627 : * If we are caching in a block group from disk, then there are three major cases
628 : * to consider:
629 : * 1. the block group is well behaved and all extents in it are the same size
630 : * class.
631 : * 2. the block group is mostly one size class with rare exceptions for last
632 : * ditch allocations
633 : * 3. the block group was populated before size classes and can have a totally
634 : * arbitrary mix of size classes.
635 : *
636 : * In case 1, looking at any extent in the block group will yield the correct
637 : * result. For the mixed cases, taking the minimum size class seems like a good
638 : * approximation, since gaps from frees will be usable to the size class. For
639 : * 2., a small handful of file extents is likely to yield the right answer. For
640 : * 3, we can either read every file extent, or admit that this is best effort
641 : * anyway and try to stay fast.
642 : *
643 : * Returns: 0 on success, negative error code on error.
644 : */
645 5628 : static int load_block_group_size_class(struct btrfs_caching_control *caching_ctl,
646 : struct btrfs_block_group *block_group)
647 : {
648 5628 : struct btrfs_fs_info *fs_info = block_group->fs_info;
649 5628 : struct btrfs_key key;
650 5628 : int i;
651 5628 : u64 min_size = block_group->length;
652 5628 : enum btrfs_block_group_size_class size_class = BTRFS_BG_SZ_NONE;
653 5628 : int ret;
654 :
655 5628 : if (!btrfs_block_group_should_use_size_class(block_group))
656 : return 0;
657 :
658 : lockdep_assert_held(&caching_ctl->mutex);
659 : lockdep_assert_held_read(&fs_info->commit_root_sem);
660 11754 : for (i = 0; i < 5; ++i) {
661 9795 : ret = sample_block_group_extent_item(caching_ctl, block_group, i, 5, &key);
662 9795 : if (ret < 0)
663 0 : goto out;
664 9795 : if (ret > 0)
665 4076 : continue;
666 5719 : min_size = min_t(u64, min_size, key.offset);
667 5719 : size_class = btrfs_calc_block_group_size_class(min_size);
668 : }
669 1959 : if (size_class != BTRFS_BG_SZ_NONE) {
670 1959 : spin_lock(&block_group->lock);
671 1959 : block_group->size_class = size_class;
672 1959 : spin_unlock(&block_group->lock);
673 : }
674 0 : out:
675 : return ret;
676 : }
677 :
678 29 : static int load_extent_tree_free(struct btrfs_caching_control *caching_ctl)
679 : {
680 29 : struct btrfs_block_group *block_group = caching_ctl->block_group;
681 29 : struct btrfs_fs_info *fs_info = block_group->fs_info;
682 29 : struct btrfs_root *extent_root;
683 29 : struct btrfs_path *path;
684 29 : struct extent_buffer *leaf;
685 29 : struct btrfs_key key;
686 29 : u64 total_found = 0;
687 29 : u64 last = 0;
688 29 : u32 nritems;
689 29 : int ret;
690 29 : bool wakeup = true;
691 :
692 29 : path = btrfs_alloc_path();
693 29 : if (!path)
694 : return -ENOMEM;
695 :
696 29 : last = max_t(u64, block_group->start, BTRFS_SUPER_INFO_OFFSET);
697 29 : extent_root = btrfs_extent_root(fs_info, last);
698 :
699 : #ifdef CONFIG_BTRFS_DEBUG
700 : /*
701 : * If we're fragmenting we don't want to make anybody think we can
702 : * allocate from this block group until we've had a chance to fragment
703 : * the free space.
704 : */
705 : if (btrfs_should_fragment_free_space(block_group))
706 : wakeup = false;
707 : #endif
708 : /*
709 : * We don't want to deadlock with somebody trying to allocate a new
710 : * extent for the extent root while also trying to search the extent
711 : * root to add free space. So we skip locking and search the commit
712 : * root, since its read-only
713 : */
714 29 : path->skip_locking = 1;
715 29 : path->search_commit_root = 1;
716 29 : path->reada = READA_FORWARD;
717 :
718 29 : key.objectid = last;
719 29 : key.offset = 0;
720 29 : key.type = BTRFS_EXTENT_ITEM_KEY;
721 :
722 : next:
723 49 : ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
724 49 : if (ret < 0)
725 0 : goto out;
726 :
727 49 : leaf = path->nodes[0];
728 49 : nritems = btrfs_header_nritems(leaf);
729 :
730 457 : while (1) {
731 457 : if (btrfs_fs_closing(fs_info) > 1) {
732 : last = (u64)-1;
733 : break;
734 : }
735 :
736 457 : if (path->slots[0] < nritems) {
737 446 : btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
738 : } else {
739 11 : ret = btrfs_find_next_key(extent_root, path, &key, 0, 0);
740 11 : if (ret)
741 : break;
742 :
743 0 : if (need_resched() ||
744 : rwsem_is_contended(&fs_info->commit_root_sem)) {
745 0 : btrfs_release_path(path);
746 0 : up_read(&fs_info->commit_root_sem);
747 0 : mutex_unlock(&caching_ctl->mutex);
748 0 : cond_resched();
749 0 : mutex_lock(&caching_ctl->mutex);
750 0 : down_read(&fs_info->commit_root_sem);
751 0 : goto next;
752 : }
753 :
754 0 : ret = btrfs_next_leaf(extent_root, path);
755 0 : if (ret < 0)
756 0 : goto out;
757 0 : if (ret)
758 : break;
759 0 : leaf = path->nodes[0];
760 0 : nritems = btrfs_header_nritems(leaf);
761 0 : continue;
762 : }
763 :
764 446 : if (key.objectid < last) {
765 20 : key.objectid = last;
766 20 : key.offset = 0;
767 20 : key.type = BTRFS_EXTENT_ITEM_KEY;
768 20 : btrfs_release_path(path);
769 20 : goto next;
770 : }
771 :
772 426 : if (key.objectid < block_group->start) {
773 0 : path->slots[0]++;
774 0 : continue;
775 : }
776 :
777 426 : if (key.objectid >= block_group->start + block_group->length)
778 : break;
779 :
780 408 : if (key.type == BTRFS_EXTENT_ITEM_KEY ||
781 : key.type == BTRFS_METADATA_ITEM_KEY) {
782 399 : total_found += add_new_free_space(block_group, last,
783 : key.objectid);
784 399 : if (key.type == BTRFS_METADATA_ITEM_KEY)
785 382 : last = key.objectid +
786 382 : fs_info->nodesize;
787 : else
788 17 : last = key.objectid + key.offset;
789 :
790 399 : if (total_found > CACHING_CTL_WAKE_UP) {
791 0 : total_found = 0;
792 0 : if (wakeup)
793 0 : wake_up(&caching_ctl->wait);
794 : }
795 : }
796 408 : path->slots[0]++;
797 : }
798 29 : ret = 0;
799 :
800 29 : total_found += add_new_free_space(block_group, last,
801 29 : block_group->start + block_group->length);
802 :
803 29 : out:
804 29 : btrfs_free_path(path);
805 29 : return ret;
806 : }
807 :
808 5628 : static noinline void caching_thread(struct btrfs_work *work)
809 : {
810 5628 : struct btrfs_block_group *block_group;
811 5628 : struct btrfs_fs_info *fs_info;
812 5628 : struct btrfs_caching_control *caching_ctl;
813 5628 : int ret;
814 :
815 5628 : caching_ctl = container_of(work, struct btrfs_caching_control, work);
816 5628 : block_group = caching_ctl->block_group;
817 5628 : fs_info = block_group->fs_info;
818 :
819 5628 : mutex_lock(&caching_ctl->mutex);
820 5628 : down_read(&fs_info->commit_root_sem);
821 :
822 5628 : load_block_group_size_class(caching_ctl, block_group);
823 5628 : if (btrfs_test_opt(fs_info, SPACE_CACHE)) {
824 23 : ret = load_free_space_cache(block_group);
825 23 : if (ret == 1) {
826 1 : ret = 0;
827 1 : goto done;
828 : }
829 :
830 : /*
831 : * We failed to load the space cache, set ourselves to
832 : * CACHE_STARTED and carry on.
833 : */
834 22 : spin_lock(&block_group->lock);
835 22 : block_group->cached = BTRFS_CACHE_STARTED;
836 22 : spin_unlock(&block_group->lock);
837 22 : wake_up(&caching_ctl->wait);
838 : }
839 :
840 : /*
841 : * If we are in the transaction that populated the free space tree we
842 : * can't actually cache from the free space tree as our commit root and
843 : * real root are the same, so we could change the contents of the blocks
844 : * while caching. Instead do the slow caching in this case, and after
845 : * the transaction has committed we will be safe.
846 : */
847 11234 : if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE) &&
848 5607 : !(test_bit(BTRFS_FS_FREE_SPACE_TREE_UNTRUSTED, &fs_info->flags)))
849 5598 : ret = load_free_space_tree(caching_ctl);
850 : else
851 29 : ret = load_extent_tree_free(caching_ctl);
852 5628 : done:
853 5628 : spin_lock(&block_group->lock);
854 5628 : block_group->caching_ctl = NULL;
855 5628 : block_group->cached = ret ? BTRFS_CACHE_ERROR : BTRFS_CACHE_FINISHED;
856 5628 : spin_unlock(&block_group->lock);
857 :
858 : #ifdef CONFIG_BTRFS_DEBUG
859 : if (btrfs_should_fragment_free_space(block_group)) {
860 : u64 bytes_used;
861 :
862 : spin_lock(&block_group->space_info->lock);
863 : spin_lock(&block_group->lock);
864 : bytes_used = block_group->length - block_group->used;
865 : block_group->space_info->bytes_used += bytes_used >> 1;
866 : spin_unlock(&block_group->lock);
867 : spin_unlock(&block_group->space_info->lock);
868 : fragment_free_space(block_group);
869 : }
870 : #endif
871 :
872 5628 : up_read(&fs_info->commit_root_sem);
873 5628 : btrfs_free_excluded_extents(block_group);
874 5628 : mutex_unlock(&caching_ctl->mutex);
875 :
876 5628 : wake_up(&caching_ctl->wait);
877 :
878 5628 : btrfs_put_caching_control(caching_ctl);
879 5628 : btrfs_put_block_group(block_group);
880 5628 : }
881 :
882 1597466 : int btrfs_cache_block_group(struct btrfs_block_group *cache, bool wait)
883 : {
884 1597466 : struct btrfs_fs_info *fs_info = cache->fs_info;
885 1597466 : struct btrfs_caching_control *caching_ctl = NULL;
886 1597466 : int ret = 0;
887 :
888 : /* Allocator for zoned filesystems does not use the cache at all */
889 1597466 : if (btrfs_is_zoned(fs_info))
890 : return 0;
891 :
892 1597466 : caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS);
893 1597465 : if (!caching_ctl)
894 : return -ENOMEM;
895 :
896 1597465 : INIT_LIST_HEAD(&caching_ctl->list);
897 1597465 : mutex_init(&caching_ctl->mutex);
898 1597461 : init_waitqueue_head(&caching_ctl->wait);
899 1597470 : caching_ctl->block_group = cache;
900 1597470 : refcount_set(&caching_ctl->count, 2);
901 1597470 : btrfs_init_work(&caching_ctl->work, caching_thread, NULL, NULL);
902 :
903 1597462 : spin_lock(&cache->lock);
904 1597471 : if (cache->cached != BTRFS_CACHE_NO) {
905 1591843 : kfree(caching_ctl);
906 :
907 1591845 : caching_ctl = cache->caching_ctl;
908 1591845 : if (caching_ctl)
909 1510598 : refcount_inc(&caching_ctl->count);
910 1591839 : spin_unlock(&cache->lock);
911 1591842 : goto out;
912 : }
913 5628 : WARN_ON(cache->caching_ctl);
914 5628 : cache->caching_ctl = caching_ctl;
915 5628 : cache->cached = BTRFS_CACHE_STARTED;
916 5628 : spin_unlock(&cache->lock);
917 :
918 5628 : write_lock(&fs_info->block_group_cache_lock);
919 5628 : refcount_inc(&caching_ctl->count);
920 5628 : list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups);
921 5628 : write_unlock(&fs_info->block_group_cache_lock);
922 :
923 5628 : btrfs_get_block_group(cache);
924 :
925 5628 : btrfs_queue_work(fs_info->caching_workers, &caching_ctl->work);
926 1597469 : out:
927 1597469 : if (wait && caching_ctl)
928 654 : ret = btrfs_caching_ctl_wait_done(cache, caching_ctl);
929 1597469 : if (caching_ctl)
930 1516222 : btrfs_put_caching_control(caching_ctl);
931 :
932 : return ret;
933 : }
934 :
935 0 : static void clear_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
936 : {
937 0 : u64 extra_flags = chunk_to_extended(flags) &
938 : BTRFS_EXTENDED_PROFILE_MASK;
939 :
940 0 : write_seqlock(&fs_info->profiles_lock);
941 0 : if (flags & BTRFS_BLOCK_GROUP_DATA)
942 0 : fs_info->avail_data_alloc_bits &= ~extra_flags;
943 0 : if (flags & BTRFS_BLOCK_GROUP_METADATA)
944 0 : fs_info->avail_metadata_alloc_bits &= ~extra_flags;
945 0 : if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
946 0 : fs_info->avail_system_alloc_bits &= ~extra_flags;
947 0 : write_sequnlock(&fs_info->profiles_lock);
948 0 : }
949 :
950 : /*
951 : * Clear incompat bits for the following feature(s):
952 : *
953 : * - RAID56 - in case there's neither RAID5 nor RAID6 profile block group
954 : * in the whole filesystem
955 : *
956 : * - RAID1C34 - same as above for RAID1C3 and RAID1C4 block groups
957 : */
958 511 : static void clear_incompat_bg_bits(struct btrfs_fs_info *fs_info, u64 flags)
959 : {
960 511 : bool found_raid56 = false;
961 511 : bool found_raid1c34 = false;
962 :
963 511 : if ((flags & BTRFS_BLOCK_GROUP_RAID56_MASK) ||
964 511 : (flags & BTRFS_BLOCK_GROUP_RAID1C3) ||
965 : (flags & BTRFS_BLOCK_GROUP_RAID1C4)) {
966 0 : struct list_head *head = &fs_info->space_info;
967 0 : struct btrfs_space_info *sinfo;
968 :
969 0 : list_for_each_entry_rcu(sinfo, head, list) {
970 0 : down_read(&sinfo->groups_sem);
971 0 : if (!list_empty(&sinfo->block_groups[BTRFS_RAID_RAID5]))
972 0 : found_raid56 = true;
973 0 : if (!list_empty(&sinfo->block_groups[BTRFS_RAID_RAID6]))
974 0 : found_raid56 = true;
975 0 : if (!list_empty(&sinfo->block_groups[BTRFS_RAID_RAID1C3]))
976 0 : found_raid1c34 = true;
977 0 : if (!list_empty(&sinfo->block_groups[BTRFS_RAID_RAID1C4]))
978 0 : found_raid1c34 = true;
979 0 : up_read(&sinfo->groups_sem);
980 : }
981 0 : if (!found_raid56)
982 0 : btrfs_clear_fs_incompat(fs_info, RAID56);
983 0 : if (!found_raid1c34)
984 0 : btrfs_clear_fs_incompat(fs_info, RAID1C34);
985 : }
986 511 : }
987 :
988 511 : static int remove_block_group_item(struct btrfs_trans_handle *trans,
989 : struct btrfs_path *path,
990 : struct btrfs_block_group *block_group)
991 : {
992 511 : struct btrfs_fs_info *fs_info = trans->fs_info;
993 511 : struct btrfs_root *root;
994 511 : struct btrfs_key key;
995 511 : int ret;
996 :
997 511 : root = btrfs_block_group_root(fs_info);
998 511 : key.objectid = block_group->start;
999 511 : key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
1000 511 : key.offset = block_group->length;
1001 :
1002 511 : ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1003 511 : if (ret > 0)
1004 : ret = -ENOENT;
1005 511 : if (ret < 0)
1006 0 : return ret;
1007 :
1008 511 : ret = btrfs_del_item(trans, root, path);
1009 511 : return ret;
1010 : }
1011 :
1012 511 : int btrfs_remove_block_group(struct btrfs_trans_handle *trans,
1013 : u64 group_start, struct extent_map *em)
1014 : {
1015 511 : struct btrfs_fs_info *fs_info = trans->fs_info;
1016 511 : struct btrfs_path *path;
1017 511 : struct btrfs_block_group *block_group;
1018 511 : struct btrfs_free_cluster *cluster;
1019 511 : struct inode *inode;
1020 511 : struct kobject *kobj = NULL;
1021 511 : int ret;
1022 511 : int index;
1023 511 : int factor;
1024 511 : struct btrfs_caching_control *caching_ctl = NULL;
1025 511 : bool remove_em;
1026 511 : bool remove_rsv = false;
1027 :
1028 511 : block_group = btrfs_lookup_block_group(fs_info, group_start);
1029 511 : BUG_ON(!block_group);
1030 511 : BUG_ON(!block_group->ro);
1031 :
1032 511 : trace_btrfs_remove_block_group(block_group);
1033 : /*
1034 : * Free the reserved super bytes from this block group before
1035 : * remove it.
1036 : */
1037 511 : btrfs_free_excluded_extents(block_group);
1038 511 : btrfs_free_ref_tree_range(fs_info, block_group->start,
1039 : block_group->length);
1040 :
1041 511 : index = btrfs_bg_flags_to_raid_index(block_group->flags);
1042 511 : factor = btrfs_bg_type_to_factor(block_group->flags);
1043 :
1044 : /* make sure this block group isn't part of an allocation cluster */
1045 511 : cluster = &fs_info->data_alloc_cluster;
1046 511 : spin_lock(&cluster->refill_lock);
1047 511 : btrfs_return_cluster_to_free_space(block_group, cluster);
1048 511 : spin_unlock(&cluster->refill_lock);
1049 :
1050 : /*
1051 : * make sure this block group isn't part of a metadata
1052 : * allocation cluster
1053 : */
1054 511 : cluster = &fs_info->meta_alloc_cluster;
1055 511 : spin_lock(&cluster->refill_lock);
1056 511 : btrfs_return_cluster_to_free_space(block_group, cluster);
1057 511 : spin_unlock(&cluster->refill_lock);
1058 :
1059 511 : btrfs_clear_treelog_bg(block_group);
1060 511 : btrfs_clear_data_reloc_bg(block_group);
1061 :
1062 511 : path = btrfs_alloc_path();
1063 511 : if (!path) {
1064 0 : ret = -ENOMEM;
1065 0 : goto out;
1066 : }
1067 :
1068 : /*
1069 : * get the inode first so any iput calls done for the io_list
1070 : * aren't the final iput (no unlinks allowed now)
1071 : */
1072 511 : inode = lookup_free_space_inode(block_group, path);
1073 :
1074 511 : mutex_lock(&trans->transaction->cache_write_mutex);
1075 : /*
1076 : * Make sure our free space cache IO is done before removing the
1077 : * free space inode
1078 : */
1079 511 : spin_lock(&trans->transaction->dirty_bgs_lock);
1080 511 : if (!list_empty(&block_group->io_list)) {
1081 0 : list_del_init(&block_group->io_list);
1082 :
1083 0 : WARN_ON(!IS_ERR(inode) && inode != block_group->io_ctl.inode);
1084 :
1085 0 : spin_unlock(&trans->transaction->dirty_bgs_lock);
1086 0 : btrfs_wait_cache_io(trans, block_group, path);
1087 0 : btrfs_put_block_group(block_group);
1088 0 : spin_lock(&trans->transaction->dirty_bgs_lock);
1089 : }
1090 :
1091 511 : if (!list_empty(&block_group->dirty_list)) {
1092 0 : list_del_init(&block_group->dirty_list);
1093 0 : remove_rsv = true;
1094 0 : btrfs_put_block_group(block_group);
1095 : }
1096 511 : spin_unlock(&trans->transaction->dirty_bgs_lock);
1097 511 : mutex_unlock(&trans->transaction->cache_write_mutex);
1098 :
1099 511 : ret = btrfs_remove_free_space_inode(trans, inode, block_group);
1100 511 : if (ret)
1101 0 : goto out;
1102 :
1103 511 : write_lock(&fs_info->block_group_cache_lock);
1104 511 : rb_erase_cached(&block_group->cache_node,
1105 : &fs_info->block_group_cache_tree);
1106 511 : RB_CLEAR_NODE(&block_group->cache_node);
1107 :
1108 : /* Once for the block groups rbtree */
1109 511 : btrfs_put_block_group(block_group);
1110 :
1111 511 : write_unlock(&fs_info->block_group_cache_lock);
1112 :
1113 511 : down_write(&block_group->space_info->groups_sem);
1114 : /*
1115 : * we must use list_del_init so people can check to see if they
1116 : * are still on the list after taking the semaphore
1117 : */
1118 511 : list_del_init(&block_group->list);
1119 511 : if (list_empty(&block_group->space_info->block_groups[index])) {
1120 0 : kobj = block_group->space_info->block_group_kobjs[index];
1121 0 : block_group->space_info->block_group_kobjs[index] = NULL;
1122 0 : clear_avail_alloc_bits(fs_info, block_group->flags);
1123 : }
1124 511 : up_write(&block_group->space_info->groups_sem);
1125 511 : clear_incompat_bg_bits(fs_info, block_group->flags);
1126 511 : if (kobj) {
1127 0 : kobject_del(kobj);
1128 0 : kobject_put(kobj);
1129 : }
1130 :
1131 511 : if (block_group->cached == BTRFS_CACHE_STARTED)
1132 0 : btrfs_wait_block_group_cache_done(block_group);
1133 :
1134 511 : write_lock(&fs_info->block_group_cache_lock);
1135 511 : caching_ctl = btrfs_get_caching_control(block_group);
1136 511 : if (!caching_ctl) {
1137 511 : struct btrfs_caching_control *ctl;
1138 :
1139 899 : list_for_each_entry(ctl, &fs_info->caching_block_groups, list) {
1140 411 : if (ctl->block_group == block_group) {
1141 23 : caching_ctl = ctl;
1142 23 : refcount_inc(&caching_ctl->count);
1143 : break;
1144 : }
1145 : }
1146 : }
1147 511 : if (caching_ctl)
1148 23 : list_del_init(&caching_ctl->list);
1149 511 : write_unlock(&fs_info->block_group_cache_lock);
1150 :
1151 511 : if (caching_ctl) {
1152 : /* Once for the caching bgs list and once for us. */
1153 23 : btrfs_put_caching_control(caching_ctl);
1154 23 : btrfs_put_caching_control(caching_ctl);
1155 : }
1156 :
1157 511 : spin_lock(&trans->transaction->dirty_bgs_lock);
1158 511 : WARN_ON(!list_empty(&block_group->dirty_list));
1159 511 : WARN_ON(!list_empty(&block_group->io_list));
1160 511 : spin_unlock(&trans->transaction->dirty_bgs_lock);
1161 :
1162 511 : btrfs_remove_free_space_cache(block_group);
1163 :
1164 511 : spin_lock(&block_group->space_info->lock);
1165 511 : list_del_init(&block_group->ro_list);
1166 :
1167 511 : if (btrfs_test_opt(fs_info, ENOSPC_DEBUG)) {
1168 0 : WARN_ON(block_group->space_info->total_bytes
1169 : < block_group->length);
1170 0 : WARN_ON(block_group->space_info->bytes_readonly
1171 : < block_group->length - block_group->zone_unusable);
1172 0 : WARN_ON(block_group->space_info->bytes_zone_unusable
1173 : < block_group->zone_unusable);
1174 0 : WARN_ON(block_group->space_info->disk_total
1175 : < block_group->length * factor);
1176 : }
1177 511 : block_group->space_info->total_bytes -= block_group->length;
1178 511 : block_group->space_info->bytes_readonly -=
1179 511 : (block_group->length - block_group->zone_unusable);
1180 511 : block_group->space_info->bytes_zone_unusable -=
1181 511 : block_group->zone_unusable;
1182 511 : block_group->space_info->disk_total -= block_group->length * factor;
1183 :
1184 511 : spin_unlock(&block_group->space_info->lock);
1185 :
1186 : /*
1187 : * Remove the free space for the block group from the free space tree
1188 : * and the block group's item from the extent tree before marking the
1189 : * block group as removed. This is to prevent races with tasks that
1190 : * freeze and unfreeze a block group, this task and another task
1191 : * allocating a new block group - the unfreeze task ends up removing
1192 : * the block group's extent map before the task calling this function
1193 : * deletes the block group item from the extent tree, allowing for
1194 : * another task to attempt to create another block group with the same
1195 : * item key (and failing with -EEXIST and a transaction abort).
1196 : */
1197 511 : ret = remove_block_group_free_space(trans, block_group);
1198 511 : if (ret)
1199 0 : goto out;
1200 :
1201 511 : ret = remove_block_group_item(trans, path, block_group);
1202 511 : if (ret < 0)
1203 0 : goto out;
1204 :
1205 511 : spin_lock(&block_group->lock);
1206 511 : set_bit(BLOCK_GROUP_FLAG_REMOVED, &block_group->runtime_flags);
1207 :
1208 : /*
1209 : * At this point trimming or scrub can't start on this block group,
1210 : * because we removed the block group from the rbtree
1211 : * fs_info->block_group_cache_tree so no one can't find it anymore and
1212 : * even if someone already got this block group before we removed it
1213 : * from the rbtree, they have already incremented block_group->frozen -
1214 : * if they didn't, for the trimming case they won't find any free space
1215 : * entries because we already removed them all when we called
1216 : * btrfs_remove_free_space_cache().
1217 : *
1218 : * And we must not remove the extent map from the fs_info->mapping_tree
1219 : * to prevent the same logical address range and physical device space
1220 : * ranges from being reused for a new block group. This is needed to
1221 : * avoid races with trimming and scrub.
1222 : *
1223 : * An fs trim operation (btrfs_trim_fs() / btrfs_ioctl_fitrim()) is
1224 : * completely transactionless, so while it is trimming a range the
1225 : * currently running transaction might finish and a new one start,
1226 : * allowing for new block groups to be created that can reuse the same
1227 : * physical device locations unless we take this special care.
1228 : *
1229 : * There may also be an implicit trim operation if the file system
1230 : * is mounted with -odiscard. The same protections must remain
1231 : * in place until the extents have been discarded completely when
1232 : * the transaction commit has completed.
1233 : */
1234 511 : remove_em = (atomic_read(&block_group->frozen) == 0);
1235 511 : spin_unlock(&block_group->lock);
1236 :
1237 511 : if (remove_em) {
1238 511 : struct extent_map_tree *em_tree;
1239 :
1240 511 : em_tree = &fs_info->mapping_tree;
1241 511 : write_lock(&em_tree->lock);
1242 511 : remove_extent_mapping(em_tree, em);
1243 511 : write_unlock(&em_tree->lock);
1244 : /* once for the tree */
1245 511 : free_extent_map(em);
1246 : }
1247 :
1248 0 : out:
1249 : /* Once for the lookup reference */
1250 511 : btrfs_put_block_group(block_group);
1251 511 : if (remove_rsv)
1252 0 : btrfs_delayed_refs_rsv_release(fs_info, 1);
1253 511 : btrfs_free_path(path);
1254 511 : return ret;
1255 : }
1256 :
1257 511 : struct btrfs_trans_handle *btrfs_start_trans_remove_block_group(
1258 : struct btrfs_fs_info *fs_info, const u64 chunk_offset)
1259 : {
1260 511 : struct btrfs_root *root = btrfs_block_group_root(fs_info);
1261 511 : struct extent_map_tree *em_tree = &fs_info->mapping_tree;
1262 511 : struct extent_map *em;
1263 511 : struct map_lookup *map;
1264 511 : unsigned int num_items;
1265 :
1266 511 : read_lock(&em_tree->lock);
1267 511 : em = lookup_extent_mapping(em_tree, chunk_offset, 1);
1268 511 : read_unlock(&em_tree->lock);
1269 511 : ASSERT(em && em->start == chunk_offset);
1270 :
1271 : /*
1272 : * We need to reserve 3 + N units from the metadata space info in order
1273 : * to remove a block group (done at btrfs_remove_chunk() and at
1274 : * btrfs_remove_block_group()), which are used for:
1275 : *
1276 : * 1 unit for adding the free space inode's orphan (located in the tree
1277 : * of tree roots).
1278 : * 1 unit for deleting the block group item (located in the extent
1279 : * tree).
1280 : * 1 unit for deleting the free space item (located in tree of tree
1281 : * roots).
1282 : * N units for deleting N device extent items corresponding to each
1283 : * stripe (located in the device tree).
1284 : *
1285 : * In order to remove a block group we also need to reserve units in the
1286 : * system space info in order to update the chunk tree (update one or
1287 : * more device items and remove one chunk item), but this is done at
1288 : * btrfs_remove_chunk() through a call to check_system_chunk().
1289 : */
1290 511 : map = em->map_lookup;
1291 511 : num_items = 3 + map->num_stripes;
1292 511 : free_extent_map(em);
1293 :
1294 511 : return btrfs_start_transaction_fallback_global_rsv(root, num_items);
1295 : }
1296 :
1297 : /*
1298 : * Mark block group @cache read-only, so later write won't happen to block
1299 : * group @cache.
1300 : *
1301 : * If @force is not set, this function will only mark the block group readonly
1302 : * if we have enough free space (1M) in other metadata/system block groups.
1303 : * If @force is not set, this function will mark the block group readonly
1304 : * without checking free space.
1305 : *
1306 : * NOTE: This function doesn't care if other block groups can contain all the
1307 : * data in this block group. That check should be done by relocation routine,
1308 : * not this function.
1309 : */
1310 566 : static int inc_block_group_ro(struct btrfs_block_group *cache, int force)
1311 : {
1312 566 : struct btrfs_space_info *sinfo = cache->space_info;
1313 566 : u64 num_bytes;
1314 566 : int ret = -ENOSPC;
1315 :
1316 566 : spin_lock(&sinfo->lock);
1317 566 : spin_lock(&cache->lock);
1318 :
1319 566 : if (cache->swap_extents) {
1320 0 : ret = -ETXTBSY;
1321 0 : goto out;
1322 : }
1323 :
1324 566 : if (cache->ro) {
1325 0 : cache->ro++;
1326 0 : ret = 0;
1327 0 : goto out;
1328 : }
1329 :
1330 566 : num_bytes = cache->length - cache->reserved - cache->pinned -
1331 566 : cache->bytes_super - cache->zone_unusable - cache->used;
1332 :
1333 : /*
1334 : * Data never overcommits, even in mixed mode, so do just the straight
1335 : * check of left over space in how much we have allocated.
1336 : */
1337 566 : if (force) {
1338 : ret = 0;
1339 566 : } else if (sinfo->flags & BTRFS_BLOCK_GROUP_DATA) {
1340 268 : u64 sinfo_used = btrfs_space_info_used(sinfo, true);
1341 :
1342 : /*
1343 : * Here we make sure if we mark this bg RO, we still have enough
1344 : * free space as buffer.
1345 : */
1346 268 : if (sinfo_used + num_bytes <= sinfo->total_bytes)
1347 : ret = 0;
1348 : } else {
1349 : /*
1350 : * We overcommit metadata, so we need to do the
1351 : * btrfs_can_overcommit check here, and we need to pass in
1352 : * BTRFS_RESERVE_NO_FLUSH to give ourselves the most amount of
1353 : * leeway to allow us to mark this block group as read only.
1354 : */
1355 298 : if (btrfs_can_overcommit(cache->fs_info, sinfo, num_bytes,
1356 : BTRFS_RESERVE_NO_FLUSH))
1357 : ret = 0;
1358 : }
1359 :
1360 : if (!ret) {
1361 536 : sinfo->bytes_readonly += num_bytes;
1362 536 : if (btrfs_is_zoned(cache->fs_info)) {
1363 : /* Migrate zone_unusable bytes to readonly */
1364 : sinfo->bytes_readonly += cache->zone_unusable;
1365 : sinfo->bytes_zone_unusable -= cache->zone_unusable;
1366 : cache->zone_unusable = 0;
1367 : }
1368 536 : cache->ro++;
1369 536 : list_add_tail(&cache->ro_list, &sinfo->ro_bgs);
1370 : }
1371 566 : out:
1372 566 : spin_unlock(&cache->lock);
1373 566 : spin_unlock(&sinfo->lock);
1374 566 : if (ret == -ENOSPC && btrfs_test_opt(cache->fs_info, ENOSPC_DEBUG)) {
1375 0 : btrfs_info(cache->fs_info,
1376 : "unable to make block group %llu ro", cache->start);
1377 0 : btrfs_dump_space_info(cache->fs_info, cache->space_info, 0, 0);
1378 : }
1379 566 : return ret;
1380 : }
1381 :
1382 14 : static bool clean_pinned_extents(struct btrfs_trans_handle *trans,
1383 : struct btrfs_block_group *bg)
1384 : {
1385 14 : struct btrfs_fs_info *fs_info = bg->fs_info;
1386 14 : struct btrfs_transaction *prev_trans = NULL;
1387 14 : const u64 start = bg->start;
1388 14 : const u64 end = start + bg->length - 1;
1389 14 : int ret;
1390 :
1391 14 : spin_lock(&fs_info->trans_lock);
1392 14 : if (trans->transaction->list.prev != &fs_info->trans_list) {
1393 0 : prev_trans = list_last_entry(&trans->transaction->list,
1394 : struct btrfs_transaction, list);
1395 0 : refcount_inc(&prev_trans->use_count);
1396 : }
1397 14 : spin_unlock(&fs_info->trans_lock);
1398 :
1399 : /*
1400 : * Hold the unused_bg_unpin_mutex lock to avoid racing with
1401 : * btrfs_finish_extent_commit(). If we are at transaction N, another
1402 : * task might be running finish_extent_commit() for the previous
1403 : * transaction N - 1, and have seen a range belonging to the block
1404 : * group in pinned_extents before we were able to clear the whole block
1405 : * group range from pinned_extents. This means that task can lookup for
1406 : * the block group after we unpinned it from pinned_extents and removed
1407 : * it, leading to a BUG_ON() at unpin_extent_range().
1408 : */
1409 14 : mutex_lock(&fs_info->unused_bg_unpin_mutex);
1410 14 : if (prev_trans) {
1411 0 : ret = clear_extent_bits(&prev_trans->pinned_extents, start, end,
1412 : EXTENT_DIRTY);
1413 0 : if (ret)
1414 0 : goto out;
1415 : }
1416 :
1417 14 : ret = clear_extent_bits(&trans->transaction->pinned_extents, start, end,
1418 : EXTENT_DIRTY);
1419 14 : out:
1420 14 : mutex_unlock(&fs_info->unused_bg_unpin_mutex);
1421 14 : if (prev_trans)
1422 0 : btrfs_put_transaction(prev_trans);
1423 :
1424 14 : return ret == 0;
1425 : }
1426 :
1427 : /*
1428 : * Process the unused_bgs list and remove any that don't have any allocated
1429 : * space inside of them.
1430 : */
1431 44665 : void btrfs_delete_unused_bgs(struct btrfs_fs_info *fs_info)
1432 : {
1433 44665 : struct btrfs_block_group *block_group;
1434 44665 : struct btrfs_space_info *space_info;
1435 44665 : struct btrfs_trans_handle *trans;
1436 44665 : const bool async_trim_enabled = btrfs_test_opt(fs_info, DISCARD_ASYNC);
1437 44665 : int ret = 0;
1438 :
1439 44665 : if (!test_bit(BTRFS_FS_OPEN, &fs_info->flags))
1440 : return;
1441 :
1442 44664 : if (btrfs_fs_closing(fs_info))
1443 : return;
1444 :
1445 : /*
1446 : * Long running balances can keep us blocked here for eternity, so
1447 : * simply skip deletion if we're unable to get the mutex.
1448 : */
1449 41504 : if (!mutex_trylock(&fs_info->reclaim_bgs_lock))
1450 : return;
1451 :
1452 41502 : spin_lock(&fs_info->unused_bgs_lock);
1453 41636 : while (!list_empty(&fs_info->unused_bgs)) {
1454 133 : int trimming;
1455 :
1456 133 : block_group = list_first_entry(&fs_info->unused_bgs,
1457 : struct btrfs_block_group,
1458 : bg_list);
1459 133 : list_del_init(&block_group->bg_list);
1460 :
1461 133 : space_info = block_group->space_info;
1462 :
1463 133 : if (ret || btrfs_mixed_space_info(space_info)) {
1464 0 : btrfs_put_block_group(block_group);
1465 0 : continue;
1466 : }
1467 133 : spin_unlock(&fs_info->unused_bgs_lock);
1468 :
1469 133 : btrfs_discard_cancel_work(&fs_info->discard_ctl, block_group);
1470 :
1471 : /* Don't want to race with allocators so take the groups_sem */
1472 133 : down_write(&space_info->groups_sem);
1473 :
1474 : /*
1475 : * Async discard moves the final block group discard to be prior
1476 : * to the unused_bgs code path. Therefore, if it's not fully
1477 : * trimmed, punt it back to the async discard lists.
1478 : */
1479 257 : if (btrfs_test_opt(fs_info, DISCARD_ASYNC) &&
1480 124 : !btrfs_is_free_space_trimmed(block_group)) {
1481 58 : trace_btrfs_skip_unused_block_group(block_group);
1482 58 : up_write(&space_info->groups_sem);
1483 : /* Requeue if we failed because of async discard */
1484 58 : btrfs_discard_queue_work(&fs_info->discard_ctl,
1485 : block_group);
1486 58 : goto next;
1487 : }
1488 :
1489 75 : spin_lock(&block_group->lock);
1490 75 : if (block_group->reserved || block_group->pinned ||
1491 22 : block_group->used || block_group->ro ||
1492 20 : list_is_singular(&block_group->list)) {
1493 : /*
1494 : * We want to bail if we made new allocations or have
1495 : * outstanding allocations in this block group. We do
1496 : * the ro check in case balance is currently acting on
1497 : * this block group.
1498 : */
1499 61 : trace_btrfs_skip_unused_block_group(block_group);
1500 61 : spin_unlock(&block_group->lock);
1501 61 : up_write(&space_info->groups_sem);
1502 61 : goto next;
1503 : }
1504 14 : spin_unlock(&block_group->lock);
1505 :
1506 : /* We don't want to force the issue, only flip if it's ok. */
1507 14 : ret = inc_block_group_ro(block_group, 0);
1508 14 : up_write(&space_info->groups_sem);
1509 14 : if (ret < 0) {
1510 0 : ret = 0;
1511 0 : goto next;
1512 : }
1513 :
1514 14 : ret = btrfs_zone_finish(block_group);
1515 14 : if (ret < 0) {
1516 : btrfs_dec_block_group_ro(block_group);
1517 : if (ret == -EAGAIN)
1518 : ret = 0;
1519 : goto next;
1520 : }
1521 :
1522 : /*
1523 : * Want to do this before we do anything else so we can recover
1524 : * properly if we fail to join the transaction.
1525 : */
1526 14 : trans = btrfs_start_trans_remove_block_group(fs_info,
1527 : block_group->start);
1528 14 : if (IS_ERR(trans)) {
1529 0 : btrfs_dec_block_group_ro(block_group);
1530 0 : ret = PTR_ERR(trans);
1531 0 : goto next;
1532 : }
1533 :
1534 : /*
1535 : * We could have pending pinned extents for this block group,
1536 : * just delete them, we don't care about them anymore.
1537 : */
1538 14 : if (!clean_pinned_extents(trans, block_group)) {
1539 0 : btrfs_dec_block_group_ro(block_group);
1540 0 : goto end_trans;
1541 : }
1542 :
1543 : /*
1544 : * At this point, the block_group is read only and should fail
1545 : * new allocations. However, btrfs_finish_extent_commit() can
1546 : * cause this block_group to be placed back on the discard
1547 : * lists because now the block_group isn't fully discarded.
1548 : * Bail here and try again later after discarding everything.
1549 : */
1550 14 : spin_lock(&fs_info->discard_ctl.lock);
1551 14 : if (!list_empty(&block_group->discard_list)) {
1552 0 : spin_unlock(&fs_info->discard_ctl.lock);
1553 0 : btrfs_dec_block_group_ro(block_group);
1554 0 : btrfs_discard_queue_work(&fs_info->discard_ctl,
1555 : block_group);
1556 0 : goto end_trans;
1557 : }
1558 14 : spin_unlock(&fs_info->discard_ctl.lock);
1559 :
1560 : /* Reset pinned so btrfs_put_block_group doesn't complain */
1561 14 : spin_lock(&space_info->lock);
1562 14 : spin_lock(&block_group->lock);
1563 :
1564 14 : btrfs_space_info_update_bytes_pinned(fs_info, space_info,
1565 14 : -block_group->pinned);
1566 14 : space_info->bytes_readonly += block_group->pinned;
1567 14 : block_group->pinned = 0;
1568 :
1569 14 : spin_unlock(&block_group->lock);
1570 14 : spin_unlock(&space_info->lock);
1571 :
1572 : /*
1573 : * The normal path here is an unused block group is passed here,
1574 : * then trimming is handled in the transaction commit path.
1575 : * Async discard interposes before this to do the trimming
1576 : * before coming down the unused block group path as trimming
1577 : * will no longer be done later in the transaction commit path.
1578 : */
1579 14 : if (!async_trim_enabled && btrfs_test_opt(fs_info, DISCARD_ASYNC))
1580 0 : goto flip_async;
1581 :
1582 : /*
1583 : * DISCARD can flip during remount. On zoned filesystems, we
1584 : * need to reset sequential-required zones.
1585 : */
1586 14 : trimming = btrfs_test_opt(fs_info, DISCARD_SYNC) ||
1587 : btrfs_is_zoned(fs_info);
1588 :
1589 : /* Implicit trim during transaction commit. */
1590 0 : if (trimming)
1591 0 : btrfs_freeze_block_group(block_group);
1592 :
1593 : /*
1594 : * Btrfs_remove_chunk will abort the transaction if things go
1595 : * horribly wrong.
1596 : */
1597 14 : ret = btrfs_remove_chunk(trans, block_group->start);
1598 :
1599 14 : if (ret) {
1600 0 : if (trimming)
1601 0 : btrfs_unfreeze_block_group(block_group);
1602 0 : goto end_trans;
1603 : }
1604 :
1605 : /*
1606 : * If we're not mounted with -odiscard, we can just forget
1607 : * about this block group. Otherwise we'll need to wait
1608 : * until transaction commit to do the actual discard.
1609 : */
1610 14 : if (trimming) {
1611 0 : spin_lock(&fs_info->unused_bgs_lock);
1612 : /*
1613 : * A concurrent scrub might have added us to the list
1614 : * fs_info->unused_bgs, so use a list_move operation
1615 : * to add the block group to the deleted_bgs list.
1616 : */
1617 0 : list_move(&block_group->bg_list,
1618 0 : &trans->transaction->deleted_bgs);
1619 0 : spin_unlock(&fs_info->unused_bgs_lock);
1620 0 : btrfs_get_block_group(block_group);
1621 : }
1622 14 : end_trans:
1623 14 : btrfs_end_transaction(trans);
1624 133 : next:
1625 133 : btrfs_put_block_group(block_group);
1626 133 : spin_lock(&fs_info->unused_bgs_lock);
1627 : }
1628 41503 : spin_unlock(&fs_info->unused_bgs_lock);
1629 41503 : mutex_unlock(&fs_info->reclaim_bgs_lock);
1630 41503 : return;
1631 :
1632 : flip_async:
1633 0 : btrfs_end_transaction(trans);
1634 0 : mutex_unlock(&fs_info->reclaim_bgs_lock);
1635 0 : btrfs_put_block_group(block_group);
1636 0 : btrfs_discard_punt_unused_bgs_list(fs_info);
1637 : }
1638 :
1639 9687 : void btrfs_mark_bg_unused(struct btrfs_block_group *bg)
1640 : {
1641 9687 : struct btrfs_fs_info *fs_info = bg->fs_info;
1642 :
1643 9687 : spin_lock(&fs_info->unused_bgs_lock);
1644 9687 : if (list_empty(&bg->bg_list)) {
1645 9681 : btrfs_get_block_group(bg);
1646 9681 : trace_btrfs_add_unused_block_group(bg);
1647 9681 : list_add_tail(&bg->bg_list, &fs_info->unused_bgs);
1648 6 : } else if (!test_bit(BLOCK_GROUP_FLAG_NEW, &bg->runtime_flags)) {
1649 : /* Pull out the block group from the reclaim_bgs list. */
1650 6 : trace_btrfs_add_unused_block_group(bg);
1651 6 : list_move_tail(&bg->bg_list, &fs_info->unused_bgs);
1652 : }
1653 9687 : spin_unlock(&fs_info->unused_bgs_lock);
1654 9687 : }
1655 :
1656 : /*
1657 : * We want block groups with a low number of used bytes to be in the beginning
1658 : * of the list, so they will get reclaimed first.
1659 : */
1660 0 : static int reclaim_bgs_cmp(void *unused, const struct list_head *a,
1661 : const struct list_head *b)
1662 : {
1663 0 : const struct btrfs_block_group *bg1, *bg2;
1664 :
1665 0 : bg1 = list_entry(a, struct btrfs_block_group, bg_list);
1666 0 : bg2 = list_entry(b, struct btrfs_block_group, bg_list);
1667 :
1668 0 : return bg1->used > bg2->used;
1669 : }
1670 :
1671 : static inline bool btrfs_should_reclaim(struct btrfs_fs_info *fs_info)
1672 : {
1673 : if (btrfs_is_zoned(fs_info))
1674 : return btrfs_zoned_should_reclaim(fs_info);
1675 : return true;
1676 : }
1677 :
1678 8073269 : static bool should_reclaim_block_group(struct btrfs_block_group *bg, u64 bytes_freed)
1679 : {
1680 8073269 : const struct btrfs_space_info *space_info = bg->space_info;
1681 8073269 : const int reclaim_thresh = READ_ONCE(space_info->bg_reclaim_threshold);
1682 8073269 : const u64 new_val = bg->used;
1683 8073269 : const u64 old_val = new_val + bytes_freed;
1684 8073269 : u64 thresh;
1685 :
1686 8073269 : if (reclaim_thresh == 0)
1687 : return false;
1688 :
1689 0 : thresh = mult_perc(bg->length, reclaim_thresh);
1690 :
1691 : /*
1692 : * If we were below the threshold before don't reclaim, we are likely a
1693 : * brand new block group and we don't want to relocate new block groups.
1694 : */
1695 0 : if (old_val < thresh)
1696 : return false;
1697 0 : if (new_val >= thresh)
1698 0 : return false;
1699 : return true;
1700 : }
1701 :
1702 0 : void btrfs_reclaim_bgs_work(struct work_struct *work)
1703 : {
1704 0 : struct btrfs_fs_info *fs_info =
1705 0 : container_of(work, struct btrfs_fs_info, reclaim_bgs_work);
1706 0 : struct btrfs_block_group *bg;
1707 0 : struct btrfs_space_info *space_info;
1708 :
1709 0 : if (!test_bit(BTRFS_FS_OPEN, &fs_info->flags))
1710 : return;
1711 :
1712 0 : if (btrfs_fs_closing(fs_info))
1713 : return;
1714 :
1715 0 : if (!btrfs_should_reclaim(fs_info))
1716 : return;
1717 :
1718 0 : sb_start_write(fs_info->sb);
1719 :
1720 0 : if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_BALANCE)) {
1721 0 : sb_end_write(fs_info->sb);
1722 0 : return;
1723 : }
1724 :
1725 : /*
1726 : * Long running balances can keep us blocked here for eternity, so
1727 : * simply skip reclaim if we're unable to get the mutex.
1728 : */
1729 0 : if (!mutex_trylock(&fs_info->reclaim_bgs_lock)) {
1730 0 : btrfs_exclop_finish(fs_info);
1731 0 : sb_end_write(fs_info->sb);
1732 0 : return;
1733 : }
1734 :
1735 0 : spin_lock(&fs_info->unused_bgs_lock);
1736 : /*
1737 : * Sort happens under lock because we can't simply splice it and sort.
1738 : * The block groups might still be in use and reachable via bg_list,
1739 : * and their presence in the reclaim_bgs list must be preserved.
1740 : */
1741 0 : list_sort(NULL, &fs_info->reclaim_bgs, reclaim_bgs_cmp);
1742 0 : while (!list_empty(&fs_info->reclaim_bgs)) {
1743 0 : u64 zone_unusable;
1744 0 : int ret = 0;
1745 :
1746 0 : bg = list_first_entry(&fs_info->reclaim_bgs,
1747 : struct btrfs_block_group,
1748 : bg_list);
1749 0 : list_del_init(&bg->bg_list);
1750 :
1751 0 : space_info = bg->space_info;
1752 0 : spin_unlock(&fs_info->unused_bgs_lock);
1753 :
1754 : /* Don't race with allocators so take the groups_sem */
1755 0 : down_write(&space_info->groups_sem);
1756 :
1757 0 : spin_lock(&bg->lock);
1758 0 : if (bg->reserved || bg->pinned || bg->ro) {
1759 : /*
1760 : * We want to bail if we made new allocations or have
1761 : * outstanding allocations in this block group. We do
1762 : * the ro check in case balance is currently acting on
1763 : * this block group.
1764 : */
1765 0 : spin_unlock(&bg->lock);
1766 0 : up_write(&space_info->groups_sem);
1767 0 : goto next;
1768 : }
1769 0 : if (bg->used == 0) {
1770 : /*
1771 : * It is possible that we trigger relocation on a block
1772 : * group as its extents are deleted and it first goes
1773 : * below the threshold, then shortly after goes empty.
1774 : *
1775 : * In this case, relocating it does delete it, but has
1776 : * some overhead in relocation specific metadata, looking
1777 : * for the non-existent extents and running some extra
1778 : * transactions, which we can avoid by using one of the
1779 : * other mechanisms for dealing with empty block groups.
1780 : */
1781 0 : if (!btrfs_test_opt(fs_info, DISCARD_ASYNC))
1782 0 : btrfs_mark_bg_unused(bg);
1783 0 : spin_unlock(&bg->lock);
1784 0 : up_write(&space_info->groups_sem);
1785 0 : goto next;
1786 :
1787 : }
1788 : /*
1789 : * The block group might no longer meet the reclaim condition by
1790 : * the time we get around to reclaiming it, so to avoid
1791 : * reclaiming overly full block_groups, skip reclaiming them.
1792 : *
1793 : * Since the decision making process also depends on the amount
1794 : * being freed, pass in a fake giant value to skip that extra
1795 : * check, which is more meaningful when adding to the list in
1796 : * the first place.
1797 : */
1798 0 : if (!should_reclaim_block_group(bg, bg->length)) {
1799 0 : spin_unlock(&bg->lock);
1800 0 : up_write(&space_info->groups_sem);
1801 0 : goto next;
1802 : }
1803 0 : spin_unlock(&bg->lock);
1804 :
1805 : /*
1806 : * Get out fast, in case we're read-only or unmounting the
1807 : * filesystem. It is OK to drop block groups from the list even
1808 : * for the read-only case. As we did sb_start_write(),
1809 : * "mount -o remount,ro" won't happen and read-only filesystem
1810 : * means it is forced read-only due to a fatal error. So, it
1811 : * never gets back to read-write to let us reclaim again.
1812 : */
1813 0 : if (btrfs_need_cleaner_sleep(fs_info)) {
1814 0 : up_write(&space_info->groups_sem);
1815 0 : goto next;
1816 : }
1817 :
1818 : /*
1819 : * Cache the zone_unusable value before turning the block group
1820 : * to read only. As soon as the blog group is read only it's
1821 : * zone_unusable value gets moved to the block group's read-only
1822 : * bytes and isn't available for calculations anymore.
1823 : */
1824 0 : zone_unusable = bg->zone_unusable;
1825 0 : ret = inc_block_group_ro(bg, 0);
1826 0 : up_write(&space_info->groups_sem);
1827 0 : if (ret < 0)
1828 0 : goto next;
1829 :
1830 0 : btrfs_info(fs_info,
1831 : "reclaiming chunk %llu with %llu%% used %llu%% unusable",
1832 : bg->start,
1833 : div64_u64(bg->used * 100, bg->length),
1834 : div64_u64(zone_unusable * 100, bg->length));
1835 0 : trace_btrfs_reclaim_block_group(bg);
1836 0 : ret = btrfs_relocate_chunk(fs_info, bg->start);
1837 0 : if (ret) {
1838 0 : btrfs_dec_block_group_ro(bg);
1839 0 : btrfs_err(fs_info, "error relocating chunk %llu",
1840 : bg->start);
1841 : }
1842 :
1843 0 : next:
1844 0 : if (ret)
1845 0 : btrfs_mark_bg_to_reclaim(bg);
1846 0 : btrfs_put_block_group(bg);
1847 :
1848 0 : mutex_unlock(&fs_info->reclaim_bgs_lock);
1849 : /*
1850 : * Reclaiming all the block groups in the list can take really
1851 : * long. Prioritize cleaning up unused block groups.
1852 : */
1853 0 : btrfs_delete_unused_bgs(fs_info);
1854 : /*
1855 : * If we are interrupted by a balance, we can just bail out. The
1856 : * cleaner thread restart again if necessary.
1857 : */
1858 0 : if (!mutex_trylock(&fs_info->reclaim_bgs_lock))
1859 0 : goto end;
1860 0 : spin_lock(&fs_info->unused_bgs_lock);
1861 : }
1862 0 : spin_unlock(&fs_info->unused_bgs_lock);
1863 0 : mutex_unlock(&fs_info->reclaim_bgs_lock);
1864 0 : end:
1865 0 : btrfs_exclop_finish(fs_info);
1866 0 : sb_end_write(fs_info->sb);
1867 : }
1868 :
1869 41504 : void btrfs_reclaim_bgs(struct btrfs_fs_info *fs_info)
1870 : {
1871 41504 : spin_lock(&fs_info->unused_bgs_lock);
1872 41504 : if (!list_empty(&fs_info->reclaim_bgs))
1873 0 : queue_work(system_unbound_wq, &fs_info->reclaim_bgs_work);
1874 41504 : spin_unlock(&fs_info->unused_bgs_lock);
1875 41504 : }
1876 :
1877 0 : void btrfs_mark_bg_to_reclaim(struct btrfs_block_group *bg)
1878 : {
1879 0 : struct btrfs_fs_info *fs_info = bg->fs_info;
1880 :
1881 0 : spin_lock(&fs_info->unused_bgs_lock);
1882 0 : if (list_empty(&bg->bg_list)) {
1883 0 : btrfs_get_block_group(bg);
1884 0 : trace_btrfs_add_reclaim_block_group(bg);
1885 0 : list_add_tail(&bg->bg_list, &fs_info->reclaim_bgs);
1886 : }
1887 0 : spin_unlock(&fs_info->unused_bgs_lock);
1888 0 : }
1889 :
1890 20770 : static int read_bg_from_eb(struct btrfs_fs_info *fs_info, struct btrfs_key *key,
1891 : struct btrfs_path *path)
1892 : {
1893 20770 : struct extent_map_tree *em_tree;
1894 20770 : struct extent_map *em;
1895 20770 : struct btrfs_block_group_item bg;
1896 20770 : struct extent_buffer *leaf;
1897 20770 : int slot;
1898 20770 : u64 flags;
1899 20770 : int ret = 0;
1900 :
1901 20770 : slot = path->slots[0];
1902 20770 : leaf = path->nodes[0];
1903 :
1904 20770 : em_tree = &fs_info->mapping_tree;
1905 20770 : read_lock(&em_tree->lock);
1906 20770 : em = lookup_extent_mapping(em_tree, key->objectid, key->offset);
1907 20770 : read_unlock(&em_tree->lock);
1908 20770 : if (!em) {
1909 0 : btrfs_err(fs_info,
1910 : "logical %llu len %llu found bg but no related chunk",
1911 : key->objectid, key->offset);
1912 0 : return -ENOENT;
1913 : }
1914 :
1915 20770 : if (em->start != key->objectid || em->len != key->offset) {
1916 0 : btrfs_err(fs_info,
1917 : "block group %llu len %llu mismatch with chunk %llu len %llu",
1918 : key->objectid, key->offset, em->start, em->len);
1919 0 : ret = -EUCLEAN;
1920 0 : goto out_free_em;
1921 : }
1922 :
1923 20770 : read_extent_buffer(leaf, &bg, btrfs_item_ptr_offset(leaf, slot),
1924 : sizeof(bg));
1925 20770 : flags = btrfs_stack_block_group_flags(&bg) &
1926 : BTRFS_BLOCK_GROUP_TYPE_MASK;
1927 :
1928 20770 : if (flags != (em->map_lookup->type & BTRFS_BLOCK_GROUP_TYPE_MASK)) {
1929 0 : btrfs_err(fs_info,
1930 : "block group %llu len %llu type flags 0x%llx mismatch with chunk type flags 0x%llx",
1931 : key->objectid, key->offset, flags,
1932 : (BTRFS_BLOCK_GROUP_TYPE_MASK & em->map_lookup->type));
1933 0 : ret = -EUCLEAN;
1934 : }
1935 :
1936 20770 : out_free_em:
1937 20770 : free_extent_map(em);
1938 20770 : return ret;
1939 : }
1940 :
1941 23981 : static int find_first_block_group(struct btrfs_fs_info *fs_info,
1942 : struct btrfs_path *path,
1943 : struct btrfs_key *key)
1944 : {
1945 23981 : struct btrfs_root *root = btrfs_block_group_root(fs_info);
1946 23981 : int ret;
1947 23981 : struct btrfs_key found_key;
1948 :
1949 7796365 : btrfs_for_each_slot(root, key, &found_key, path, ret) {
1950 7793154 : if (found_key.objectid >= key->objectid &&
1951 7793154 : found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
1952 20770 : return read_bg_from_eb(fs_info, &found_key, path);
1953 : }
1954 : }
1955 : return ret;
1956 : }
1957 :
1958 22198 : static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
1959 : {
1960 22198 : u64 extra_flags = chunk_to_extended(flags) &
1961 : BTRFS_EXTENDED_PROFILE_MASK;
1962 :
1963 22198 : write_seqlock(&fs_info->profiles_lock);
1964 22198 : if (flags & BTRFS_BLOCK_GROUP_DATA)
1965 15368 : fs_info->avail_data_alloc_bits |= extra_flags;
1966 22198 : if (flags & BTRFS_BLOCK_GROUP_METADATA)
1967 3713 : fs_info->avail_metadata_alloc_bits |= extra_flags;
1968 22198 : if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
1969 3305 : fs_info->avail_system_alloc_bits |= extra_flags;
1970 22198 : write_sequnlock(&fs_info->profiles_lock);
1971 22198 : }
1972 :
1973 : /*
1974 : * Map a physical disk address to a list of logical addresses.
1975 : *
1976 : * @fs_info: the filesystem
1977 : * @chunk_start: logical address of block group
1978 : * @physical: physical address to map to logical addresses
1979 : * @logical: return array of logical addresses which map to @physical
1980 : * @naddrs: length of @logical
1981 : * @stripe_len: size of IO stripe for the given block group
1982 : *
1983 : * Maps a particular @physical disk address to a list of @logical addresses.
1984 : * Used primarily to exclude those portions of a block group that contain super
1985 : * block copies.
1986 : */
1987 66594 : int btrfs_rmap_block(struct btrfs_fs_info *fs_info, u64 chunk_start,
1988 : u64 physical, u64 **logical, int *naddrs, int *stripe_len)
1989 : {
1990 66594 : struct extent_map *em;
1991 66594 : struct map_lookup *map;
1992 66594 : u64 *buf;
1993 66594 : u64 bytenr;
1994 66594 : u64 data_stripe_length;
1995 66594 : u64 io_stripe_size;
1996 66594 : int i, nr = 0;
1997 66594 : int ret = 0;
1998 :
1999 66594 : em = btrfs_get_chunk_map(fs_info, chunk_start, 1);
2000 66594 : if (IS_ERR(em))
2001 : return -EIO;
2002 :
2003 66594 : map = em->map_lookup;
2004 66594 : data_stripe_length = em->orig_block_len;
2005 66594 : io_stripe_size = BTRFS_STRIPE_LEN;
2006 66594 : chunk_start = em->start;
2007 :
2008 : /* For RAID5/6 adjust to a full IO stripe length */
2009 66594 : if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
2010 0 : io_stripe_size = btrfs_stripe_nr_to_offset(nr_data_stripes(map));
2011 :
2012 66594 : buf = kcalloc(map->num_stripes, sizeof(u64), GFP_NOFS);
2013 66594 : if (!buf) {
2014 0 : ret = -ENOMEM;
2015 0 : goto out;
2016 : }
2017 :
2018 153531 : for (i = 0; i < map->num_stripes; i++) {
2019 86937 : bool already_inserted = false;
2020 86937 : u32 stripe_nr;
2021 86937 : u32 offset;
2022 86937 : int j;
2023 :
2024 86937 : if (!in_range(physical, map->stripes[i].physical,
2025 : data_stripe_length))
2026 83697 : continue;
2027 :
2028 3240 : stripe_nr = (physical - map->stripes[i].physical) >>
2029 : BTRFS_STRIPE_LEN_SHIFT;
2030 3240 : offset = (physical - map->stripes[i].physical) &
2031 : BTRFS_STRIPE_LEN_MASK;
2032 :
2033 3240 : if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
2034 : BTRFS_BLOCK_GROUP_RAID10))
2035 0 : stripe_nr = div_u64(stripe_nr * map->num_stripes + i,
2036 0 : map->sub_stripes);
2037 : /*
2038 : * The remaining case would be for RAID56, multiply by
2039 : * nr_data_stripes(). Alternatively, just use rmap_len below
2040 : * instead of map->stripe_len
2041 : */
2042 3240 : bytenr = chunk_start + stripe_nr * io_stripe_size + offset;
2043 :
2044 : /* Ensure we don't add duplicate addresses */
2045 3241 : for (j = 0; j < nr; j++) {
2046 1 : if (buf[j] == bytenr) {
2047 : already_inserted = true;
2048 : break;
2049 : }
2050 : }
2051 :
2052 3240 : if (!already_inserted)
2053 3240 : buf[nr++] = bytenr;
2054 : }
2055 :
2056 66594 : *logical = buf;
2057 66594 : *naddrs = nr;
2058 66594 : *stripe_len = io_stripe_size;
2059 66594 : out:
2060 66594 : free_extent_map(em);
2061 66594 : return ret;
2062 : }
2063 :
2064 22198 : static int exclude_super_stripes(struct btrfs_block_group *cache)
2065 : {
2066 22198 : struct btrfs_fs_info *fs_info = cache->fs_info;
2067 22198 : const bool zoned = btrfs_is_zoned(fs_info);
2068 22198 : u64 bytenr;
2069 22198 : u64 *logical;
2070 22198 : int stripe_len;
2071 22198 : int i, nr, ret;
2072 :
2073 22198 : if (cache->start < BTRFS_SUPER_INFO_OFFSET) {
2074 0 : stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->start;
2075 0 : cache->bytes_super += stripe_len;
2076 0 : ret = btrfs_add_excluded_extent(fs_info, cache->start,
2077 : stripe_len);
2078 0 : if (ret)
2079 : return ret;
2080 : }
2081 :
2082 88792 : for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
2083 66594 : bytenr = btrfs_sb_offset(i);
2084 66594 : ret = btrfs_rmap_block(fs_info, cache->start,
2085 : bytenr, &logical, &nr, &stripe_len);
2086 66594 : if (ret)
2087 0 : return ret;
2088 :
2089 : /* Shouldn't have super stripes in sequential zones */
2090 : if (zoned && nr) {
2091 : kfree(logical);
2092 : btrfs_err(fs_info,
2093 : "zoned: block group %llu must not contain super block",
2094 : cache->start);
2095 : return -EUCLEAN;
2096 : }
2097 :
2098 69834 : while (nr--) {
2099 3240 : u64 len = min_t(u64, stripe_len,
2100 : cache->start + cache->length - logical[nr]);
2101 :
2102 3240 : cache->bytes_super += len;
2103 3240 : ret = btrfs_add_excluded_extent(fs_info, logical[nr],
2104 : len);
2105 3240 : if (ret) {
2106 0 : kfree(logical);
2107 0 : return ret;
2108 : }
2109 : }
2110 :
2111 66594 : kfree(logical);
2112 : }
2113 : return 0;
2114 : }
2115 :
2116 22198 : static struct btrfs_block_group *btrfs_create_block_group_cache(
2117 : struct btrfs_fs_info *fs_info, u64 start)
2118 : {
2119 22198 : struct btrfs_block_group *cache;
2120 :
2121 22198 : cache = kzalloc(sizeof(*cache), GFP_NOFS);
2122 22198 : if (!cache)
2123 : return NULL;
2124 :
2125 22198 : cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl),
2126 : GFP_NOFS);
2127 22198 : if (!cache->free_space_ctl) {
2128 0 : kfree(cache);
2129 0 : return NULL;
2130 : }
2131 :
2132 22198 : cache->start = start;
2133 :
2134 22198 : cache->fs_info = fs_info;
2135 22198 : cache->full_stripe_len = btrfs_full_stripe_len(fs_info, start);
2136 :
2137 22198 : cache->discard_index = BTRFS_DISCARD_INDEX_UNUSED;
2138 :
2139 22198 : refcount_set(&cache->refs, 1);
2140 22198 : spin_lock_init(&cache->lock);
2141 22198 : init_rwsem(&cache->data_rwsem);
2142 22198 : INIT_LIST_HEAD(&cache->list);
2143 22198 : INIT_LIST_HEAD(&cache->cluster_list);
2144 22198 : INIT_LIST_HEAD(&cache->bg_list);
2145 22198 : INIT_LIST_HEAD(&cache->ro_list);
2146 22198 : INIT_LIST_HEAD(&cache->discard_list);
2147 22198 : INIT_LIST_HEAD(&cache->dirty_list);
2148 22198 : INIT_LIST_HEAD(&cache->io_list);
2149 22198 : INIT_LIST_HEAD(&cache->active_bg_list);
2150 22198 : btrfs_init_free_space_ctl(cache, cache->free_space_ctl);
2151 22198 : atomic_set(&cache->frozen, 0);
2152 22198 : mutex_init(&cache->free_space_lock);
2153 :
2154 22198 : return cache;
2155 : }
2156 :
2157 : /*
2158 : * Iterate all chunks and verify that each of them has the corresponding block
2159 : * group
2160 : */
2161 3211 : static int check_chunk_block_group_mappings(struct btrfs_fs_info *fs_info)
2162 : {
2163 3211 : struct extent_map_tree *map_tree = &fs_info->mapping_tree;
2164 3211 : struct extent_map *em;
2165 3211 : struct btrfs_block_group *bg;
2166 3211 : u64 start = 0;
2167 3211 : int ret = 0;
2168 :
2169 3211 : while (1) {
2170 3211 : read_lock(&map_tree->lock);
2171 : /*
2172 : * lookup_extent_mapping will return the first extent map
2173 : * intersecting the range, so setting @len to 1 is enough to
2174 : * get the first chunk.
2175 : */
2176 3211 : em = lookup_extent_mapping(map_tree, start, 1);
2177 3211 : read_unlock(&map_tree->lock);
2178 3211 : if (!em)
2179 : break;
2180 :
2181 0 : bg = btrfs_lookup_block_group(fs_info, em->start);
2182 0 : if (!bg) {
2183 0 : btrfs_err(fs_info,
2184 : "chunk start=%llu len=%llu doesn't have corresponding block group",
2185 : em->start, em->len);
2186 0 : ret = -EUCLEAN;
2187 0 : free_extent_map(em);
2188 0 : break;
2189 : }
2190 0 : if (bg->start != em->start || bg->length != em->len ||
2191 0 : (bg->flags & BTRFS_BLOCK_GROUP_TYPE_MASK) !=
2192 0 : (em->map_lookup->type & BTRFS_BLOCK_GROUP_TYPE_MASK)) {
2193 0 : btrfs_err(fs_info,
2194 : "chunk start=%llu len=%llu flags=0x%llx doesn't match block group start=%llu len=%llu flags=0x%llx",
2195 : em->start, em->len,
2196 : em->map_lookup->type & BTRFS_BLOCK_GROUP_TYPE_MASK,
2197 : bg->start, bg->length,
2198 : bg->flags & BTRFS_BLOCK_GROUP_TYPE_MASK);
2199 0 : ret = -EUCLEAN;
2200 0 : free_extent_map(em);
2201 0 : btrfs_put_block_group(bg);
2202 0 : break;
2203 : }
2204 0 : start = em->start + em->len;
2205 0 : free_extent_map(em);
2206 0 : btrfs_put_block_group(bg);
2207 : }
2208 3211 : return ret;
2209 : }
2210 :
2211 20770 : static int read_one_block_group(struct btrfs_fs_info *info,
2212 : struct btrfs_block_group_item *bgi,
2213 : const struct btrfs_key *key,
2214 : int need_clear)
2215 : {
2216 20770 : struct btrfs_block_group *cache;
2217 20770 : const bool mixed = btrfs_fs_incompat(info, MIXED_GROUPS);
2218 20770 : int ret;
2219 :
2220 20770 : ASSERT(key->type == BTRFS_BLOCK_GROUP_ITEM_KEY);
2221 :
2222 20770 : cache = btrfs_create_block_group_cache(info, key->objectid);
2223 20770 : if (!cache)
2224 : return -ENOMEM;
2225 :
2226 20770 : cache->length = key->offset;
2227 20770 : cache->used = btrfs_stack_block_group_used(bgi);
2228 20770 : cache->commit_used = cache->used;
2229 20770 : cache->flags = btrfs_stack_block_group_flags(bgi);
2230 20770 : cache->global_root_id = btrfs_stack_block_group_chunk_objectid(bgi);
2231 :
2232 20770 : set_free_space_tree_thresholds(cache);
2233 :
2234 20770 : if (need_clear) {
2235 : /*
2236 : * When we mount with old space cache, we need to
2237 : * set BTRFS_DC_CLEAR and set dirty flag.
2238 : *
2239 : * a) Setting 'BTRFS_DC_CLEAR' makes sure that we
2240 : * truncate the old free space cache inode and
2241 : * setup a new one.
2242 : * b) Setting 'dirty flag' makes sure that we flush
2243 : * the new space cache info onto disk.
2244 : */
2245 360 : if (btrfs_test_opt(info, SPACE_CACHE))
2246 342 : cache->disk_cache_state = BTRFS_DC_CLEAR;
2247 : }
2248 20770 : if (!mixed && ((cache->flags & BTRFS_BLOCK_GROUP_METADATA) &&
2249 : (cache->flags & BTRFS_BLOCK_GROUP_DATA))) {
2250 0 : btrfs_err(info,
2251 : "bg %llu is a mixed block group but filesystem hasn't enabled mixed block groups",
2252 : cache->start);
2253 0 : ret = -EINVAL;
2254 0 : goto error;
2255 : }
2256 :
2257 20770 : ret = btrfs_load_block_group_zone_info(cache, false);
2258 20770 : if (ret) {
2259 : btrfs_err(info, "zoned: failed to load zone info of bg %llu",
2260 : cache->start);
2261 : goto error;
2262 : }
2263 :
2264 : /*
2265 : * We need to exclude the super stripes now so that the space info has
2266 : * super bytes accounted for, otherwise we'll think we have more space
2267 : * than we actually do.
2268 : */
2269 20770 : ret = exclude_super_stripes(cache);
2270 20770 : if (ret) {
2271 : /* We may have excluded something, so call this just in case. */
2272 0 : btrfs_free_excluded_extents(cache);
2273 0 : goto error;
2274 : }
2275 :
2276 : /*
2277 : * For zoned filesystem, space after the allocation offset is the only
2278 : * free space for a block group. So, we don't need any caching work.
2279 : * btrfs_calc_zone_unusable() will set the amount of free space and
2280 : * zone_unusable space.
2281 : *
2282 : * For regular filesystem, check for two cases, either we are full, and
2283 : * therefore don't need to bother with the caching work since we won't
2284 : * find any space, or we are empty, and we can just add all the space
2285 : * in and be done with it. This saves us _a_lot_ of time, particularly
2286 : * in the full case.
2287 : */
2288 20770 : if (btrfs_is_zoned(info)) {
2289 : btrfs_calc_zone_unusable(cache);
2290 : /* Should not have any excluded extents. Just in case, though. */
2291 : btrfs_free_excluded_extents(cache);
2292 20770 : } else if (cache->length == cache->used) {
2293 414 : cache->cached = BTRFS_CACHE_FINISHED;
2294 414 : btrfs_free_excluded_extents(cache);
2295 20356 : } else if (cache->used == 0) {
2296 9295 : cache->cached = BTRFS_CACHE_FINISHED;
2297 9295 : add_new_free_space(cache, cache->start,
2298 9295 : cache->start + cache->length);
2299 9295 : btrfs_free_excluded_extents(cache);
2300 : }
2301 :
2302 20770 : ret = btrfs_add_block_group_cache(info, cache);
2303 20770 : if (ret) {
2304 0 : btrfs_remove_free_space_cache(cache);
2305 0 : goto error;
2306 : }
2307 20770 : trace_btrfs_add_block_group(info, cache, 0);
2308 20770 : btrfs_add_bg_to_space_info(info, cache);
2309 :
2310 20770 : set_avail_alloc_bits(info, cache->flags);
2311 20770 : if (btrfs_chunk_writeable(info, cache->start)) {
2312 20770 : if (cache->used == 0) {
2313 9295 : ASSERT(list_empty(&cache->bg_list));
2314 9295 : if (btrfs_test_opt(info, DISCARD_ASYNC))
2315 1 : btrfs_discard_queue_work(&info->discard_ctl, cache);
2316 : else
2317 9294 : btrfs_mark_bg_unused(cache);
2318 : }
2319 : } else {
2320 0 : inc_block_group_ro(cache, 1);
2321 : }
2322 :
2323 : return 0;
2324 0 : error:
2325 0 : btrfs_put_block_group(cache);
2326 0 : return ret;
2327 : }
2328 :
2329 0 : static int fill_dummy_bgs(struct btrfs_fs_info *fs_info)
2330 : {
2331 0 : struct extent_map_tree *em_tree = &fs_info->mapping_tree;
2332 0 : struct rb_node *node;
2333 0 : int ret = 0;
2334 :
2335 0 : for (node = rb_first_cached(&em_tree->map); node; node = rb_next(node)) {
2336 0 : struct extent_map *em;
2337 0 : struct map_lookup *map;
2338 0 : struct btrfs_block_group *bg;
2339 :
2340 0 : em = rb_entry(node, struct extent_map, rb_node);
2341 0 : map = em->map_lookup;
2342 0 : bg = btrfs_create_block_group_cache(fs_info, em->start);
2343 0 : if (!bg) {
2344 : ret = -ENOMEM;
2345 : break;
2346 : }
2347 :
2348 : /* Fill dummy cache as FULL */
2349 0 : bg->length = em->len;
2350 0 : bg->flags = map->type;
2351 0 : bg->cached = BTRFS_CACHE_FINISHED;
2352 0 : bg->used = em->len;
2353 0 : bg->flags = map->type;
2354 0 : ret = btrfs_add_block_group_cache(fs_info, bg);
2355 : /*
2356 : * We may have some valid block group cache added already, in
2357 : * that case we skip to the next one.
2358 : */
2359 0 : if (ret == -EEXIST) {
2360 0 : ret = 0;
2361 0 : btrfs_put_block_group(bg);
2362 0 : continue;
2363 : }
2364 :
2365 0 : if (ret) {
2366 0 : btrfs_remove_free_space_cache(bg);
2367 0 : btrfs_put_block_group(bg);
2368 0 : break;
2369 : }
2370 :
2371 0 : btrfs_add_bg_to_space_info(fs_info, bg);
2372 :
2373 0 : set_avail_alloc_bits(fs_info, bg->flags);
2374 : }
2375 0 : if (!ret)
2376 0 : btrfs_init_global_block_rsv(fs_info);
2377 0 : return ret;
2378 : }
2379 :
2380 3211 : int btrfs_read_block_groups(struct btrfs_fs_info *info)
2381 : {
2382 3211 : struct btrfs_root *root = btrfs_block_group_root(info);
2383 3211 : struct btrfs_path *path;
2384 3211 : int ret;
2385 3211 : struct btrfs_block_group *cache;
2386 3211 : struct btrfs_space_info *space_info;
2387 3211 : struct btrfs_key key;
2388 3211 : int need_clear = 0;
2389 3211 : u64 cache_gen;
2390 :
2391 : /*
2392 : * Either no extent root (with ibadroots rescue option) or we have
2393 : * unsupported RO options. The fs can never be mounted read-write, so no
2394 : * need to waste time searching block group items.
2395 : *
2396 : * This also allows new extent tree related changes to be RO compat,
2397 : * no need for a full incompat flag.
2398 : */
2399 3211 : if (!root || (btrfs_super_compat_ro_flags(info->super_copy) &
2400 : ~BTRFS_FEATURE_COMPAT_RO_SUPP))
2401 0 : return fill_dummy_bgs(info);
2402 :
2403 3211 : key.objectid = 0;
2404 3211 : key.offset = 0;
2405 3211 : key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
2406 3211 : path = btrfs_alloc_path();
2407 3211 : if (!path)
2408 : return -ENOMEM;
2409 :
2410 3211 : cache_gen = btrfs_super_cache_generation(info->super_copy);
2411 3211 : if (btrfs_test_opt(info, SPACE_CACHE) &&
2412 : btrfs_super_generation(info->super_copy) != cache_gen)
2413 7 : need_clear = 1;
2414 3211 : if (btrfs_test_opt(info, CLEAR_CACHE))
2415 10 : need_clear = 1;
2416 :
2417 44751 : while (1) {
2418 23981 : struct btrfs_block_group_item bgi;
2419 23981 : struct extent_buffer *leaf;
2420 23981 : int slot;
2421 :
2422 23981 : ret = find_first_block_group(info, path, &key);
2423 23981 : if (ret > 0)
2424 : break;
2425 20770 : if (ret != 0)
2426 0 : goto error;
2427 :
2428 20770 : leaf = path->nodes[0];
2429 20770 : slot = path->slots[0];
2430 :
2431 20770 : read_extent_buffer(leaf, &bgi, btrfs_item_ptr_offset(leaf, slot),
2432 : sizeof(bgi));
2433 :
2434 20770 : btrfs_item_key_to_cpu(leaf, &key, slot);
2435 20770 : btrfs_release_path(path);
2436 20770 : ret = read_one_block_group(info, &bgi, &key, need_clear);
2437 20770 : if (ret < 0)
2438 0 : goto error;
2439 20770 : key.objectid += key.offset;
2440 20770 : key.offset = 0;
2441 : }
2442 3211 : btrfs_release_path(path);
2443 :
2444 12814 : list_for_each_entry(space_info, &info->space_info, list) {
2445 : int i;
2446 :
2447 96030 : for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) {
2448 86427 : if (list_empty(&space_info->block_groups[i]))
2449 76824 : continue;
2450 9603 : cache = list_first_entry(&space_info->block_groups[i],
2451 : struct btrfs_block_group,
2452 : list);
2453 9603 : btrfs_sysfs_add_block_group_type(cache);
2454 : }
2455 :
2456 9603 : if (!(btrfs_get_alloc_profile(info, space_info->flags) &
2457 : (BTRFS_BLOCK_GROUP_RAID10 |
2458 : BTRFS_BLOCK_GROUP_RAID1_MASK |
2459 : BTRFS_BLOCK_GROUP_RAID56_MASK |
2460 : BTRFS_BLOCK_GROUP_DUP)))
2461 3253 : continue;
2462 : /*
2463 : * Avoid allocating from un-mirrored block group if there are
2464 : * mirrored block groups.
2465 : */
2466 6350 : list_for_each_entry(cache,
2467 : &space_info->block_groups[BTRFS_RAID_RAID0],
2468 : list)
2469 0 : inc_block_group_ro(cache, 1);
2470 6350 : list_for_each_entry(cache,
2471 : &space_info->block_groups[BTRFS_RAID_SINGLE],
2472 : list)
2473 0 : inc_block_group_ro(cache, 1);
2474 : }
2475 :
2476 3211 : btrfs_init_global_block_rsv(info);
2477 3211 : ret = check_chunk_block_group_mappings(info);
2478 3211 : error:
2479 3211 : btrfs_free_path(path);
2480 : /*
2481 : * We've hit some error while reading the extent tree, and have
2482 : * rescue=ibadroots mount option.
2483 : * Try to fill the tree using dummy block groups so that the user can
2484 : * continue to mount and grab their data.
2485 : */
2486 3211 : if (ret && btrfs_test_opt(info, IGNOREBADROOTS))
2487 0 : ret = fill_dummy_bgs(info);
2488 : return ret;
2489 : }
2490 :
2491 : /*
2492 : * This function, insert_block_group_item(), belongs to the phase 2 of chunk
2493 : * allocation.
2494 : *
2495 : * See the comment at btrfs_chunk_alloc() for details about the chunk allocation
2496 : * phases.
2497 : */
2498 1428 : static int insert_block_group_item(struct btrfs_trans_handle *trans,
2499 : struct btrfs_block_group *block_group)
2500 : {
2501 1428 : struct btrfs_fs_info *fs_info = trans->fs_info;
2502 1428 : struct btrfs_block_group_item bgi;
2503 1428 : struct btrfs_root *root = btrfs_block_group_root(fs_info);
2504 1428 : struct btrfs_key key;
2505 1428 : u64 old_commit_used;
2506 1428 : int ret;
2507 :
2508 1428 : spin_lock(&block_group->lock);
2509 1428 : btrfs_set_stack_block_group_used(&bgi, block_group->used);
2510 1428 : btrfs_set_stack_block_group_chunk_objectid(&bgi,
2511 : block_group->global_root_id);
2512 1428 : btrfs_set_stack_block_group_flags(&bgi, block_group->flags);
2513 1428 : old_commit_used = block_group->commit_used;
2514 1428 : block_group->commit_used = block_group->used;
2515 1428 : key.objectid = block_group->start;
2516 1428 : key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
2517 1428 : key.offset = block_group->length;
2518 1428 : spin_unlock(&block_group->lock);
2519 :
2520 1428 : ret = btrfs_insert_item(trans, root, &key, &bgi, sizeof(bgi));
2521 1428 : if (ret < 0) {
2522 0 : spin_lock(&block_group->lock);
2523 0 : block_group->commit_used = old_commit_used;
2524 0 : spin_unlock(&block_group->lock);
2525 : }
2526 :
2527 1428 : return ret;
2528 : }
2529 :
2530 1731 : static int insert_dev_extent(struct btrfs_trans_handle *trans,
2531 : struct btrfs_device *device, u64 chunk_offset,
2532 : u64 start, u64 num_bytes)
2533 : {
2534 1731 : struct btrfs_fs_info *fs_info = device->fs_info;
2535 1731 : struct btrfs_root *root = fs_info->dev_root;
2536 1731 : struct btrfs_path *path;
2537 1731 : struct btrfs_dev_extent *extent;
2538 1731 : struct extent_buffer *leaf;
2539 1731 : struct btrfs_key key;
2540 1731 : int ret;
2541 :
2542 1731 : WARN_ON(!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state));
2543 1731 : WARN_ON(test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state));
2544 1731 : path = btrfs_alloc_path();
2545 1731 : if (!path)
2546 : return -ENOMEM;
2547 :
2548 1731 : key.objectid = device->devid;
2549 1731 : key.type = BTRFS_DEV_EXTENT_KEY;
2550 1731 : key.offset = start;
2551 1731 : ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*extent));
2552 1731 : if (ret)
2553 0 : goto out;
2554 :
2555 1731 : leaf = path->nodes[0];
2556 1731 : extent = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_extent);
2557 1731 : btrfs_set_dev_extent_chunk_tree(leaf, extent, BTRFS_CHUNK_TREE_OBJECTID);
2558 1731 : btrfs_set_dev_extent_chunk_objectid(leaf, extent,
2559 : BTRFS_FIRST_CHUNK_TREE_OBJECTID);
2560 1731 : btrfs_set_dev_extent_chunk_offset(leaf, extent, chunk_offset);
2561 :
2562 1731 : btrfs_set_dev_extent_length(leaf, extent, num_bytes);
2563 1731 : btrfs_mark_buffer_dirty(leaf);
2564 1731 : out:
2565 1731 : btrfs_free_path(path);
2566 1731 : return ret;
2567 : }
2568 :
2569 : /*
2570 : * This function belongs to phase 2.
2571 : *
2572 : * See the comment at btrfs_chunk_alloc() for details about the chunk allocation
2573 : * phases.
2574 : */
2575 1428 : static int insert_dev_extents(struct btrfs_trans_handle *trans,
2576 : u64 chunk_offset, u64 chunk_size)
2577 : {
2578 1428 : struct btrfs_fs_info *fs_info = trans->fs_info;
2579 1428 : struct btrfs_device *device;
2580 1428 : struct extent_map *em;
2581 1428 : struct map_lookup *map;
2582 1428 : u64 dev_offset;
2583 1428 : u64 stripe_size;
2584 1428 : int i;
2585 1428 : int ret = 0;
2586 :
2587 1428 : em = btrfs_get_chunk_map(fs_info, chunk_offset, chunk_size);
2588 1428 : if (IS_ERR(em))
2589 0 : return PTR_ERR(em);
2590 :
2591 1428 : map = em->map_lookup;
2592 1428 : stripe_size = em->orig_block_len;
2593 :
2594 : /*
2595 : * Take the device list mutex to prevent races with the final phase of
2596 : * a device replace operation that replaces the device object associated
2597 : * with the map's stripes, because the device object's id can change
2598 : * at any time during that final phase of the device replace operation
2599 : * (dev-replace.c:btrfs_dev_replace_finishing()), so we could grab the
2600 : * replaced device and then see it with an ID of BTRFS_DEV_REPLACE_DEVID,
2601 : * resulting in persisting a device extent item with such ID.
2602 : */
2603 1428 : mutex_lock(&fs_info->fs_devices->device_list_mutex);
2604 4587 : for (i = 0; i < map->num_stripes; i++) {
2605 1731 : device = map->stripes[i].dev;
2606 1731 : dev_offset = map->stripes[i].physical;
2607 :
2608 1731 : ret = insert_dev_extent(trans, device, chunk_offset, dev_offset,
2609 : stripe_size);
2610 1731 : if (ret)
2611 : break;
2612 : }
2613 1428 : mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2614 :
2615 1428 : free_extent_map(em);
2616 1428 : return ret;
2617 : }
2618 :
2619 : /*
2620 : * This function, btrfs_create_pending_block_groups(), belongs to the phase 2 of
2621 : * chunk allocation.
2622 : *
2623 : * See the comment at btrfs_chunk_alloc() for details about the chunk allocation
2624 : * phases.
2625 : */
2626 57315761 : void btrfs_create_pending_block_groups(struct btrfs_trans_handle *trans)
2627 : {
2628 57315761 : struct btrfs_fs_info *fs_info = trans->fs_info;
2629 57315761 : struct btrfs_block_group *block_group;
2630 57315761 : int ret = 0;
2631 :
2632 57315240 : while (!list_empty(&trans->new_bgs)) {
2633 1428 : int index;
2634 :
2635 1428 : block_group = list_first_entry(&trans->new_bgs,
2636 : struct btrfs_block_group,
2637 : bg_list);
2638 1428 : if (ret)
2639 0 : goto next;
2640 :
2641 1428 : index = btrfs_bg_flags_to_raid_index(block_group->flags);
2642 :
2643 1428 : ret = insert_block_group_item(trans, block_group);
2644 1428 : if (ret)
2645 0 : btrfs_abort_transaction(trans, ret);
2646 1428 : if (!test_bit(BLOCK_GROUP_FLAG_CHUNK_ITEM_INSERTED,
2647 : &block_group->runtime_flags)) {
2648 0 : mutex_lock(&fs_info->chunk_mutex);
2649 0 : ret = btrfs_chunk_alloc_add_chunk_item(trans, block_group);
2650 0 : mutex_unlock(&fs_info->chunk_mutex);
2651 0 : if (ret)
2652 0 : btrfs_abort_transaction(trans, ret);
2653 : }
2654 1428 : ret = insert_dev_extents(trans, block_group->start,
2655 : block_group->length);
2656 1428 : if (ret)
2657 0 : btrfs_abort_transaction(trans, ret);
2658 1428 : add_block_group_free_space(trans, block_group);
2659 :
2660 : /*
2661 : * If we restriped during balance, we may have added a new raid
2662 : * type, so now add the sysfs entries when it is safe to do so.
2663 : * We don't have to worry about locking here as it's handled in
2664 : * btrfs_sysfs_add_block_group_type.
2665 : */
2666 1428 : if (block_group->space_info->block_group_kobjs[index] == NULL)
2667 0 : btrfs_sysfs_add_block_group_type(block_group);
2668 :
2669 : /* Already aborted the transaction if it failed. */
2670 1428 : next:
2671 1428 : btrfs_delayed_refs_rsv_release(fs_info, 1);
2672 1428 : list_del_init(&block_group->bg_list);
2673 1428 : clear_bit(BLOCK_GROUP_FLAG_NEW, &block_group->runtime_flags);
2674 : }
2675 57313812 : btrfs_trans_release_chunk_metadata(trans);
2676 57309413 : }
2677 :
2678 : /*
2679 : * For extent tree v2 we use the block_group_item->chunk_offset to point at our
2680 : * global root id. For v1 it's always set to BTRFS_FIRST_CHUNK_TREE_OBJECTID.
2681 : */
2682 : static u64 calculate_global_root_id(struct btrfs_fs_info *fs_info, u64 offset)
2683 : {
2684 1428 : u64 div = SZ_1G;
2685 1428 : u64 index;
2686 :
2687 1428 : if (!btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))
2688 : return BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2689 :
2690 : /* If we have a smaller fs index based on 128MiB. */
2691 0 : if (btrfs_super_total_bytes(fs_info->super_copy) <= (SZ_1G * 10ULL))
2692 0 : div = SZ_128M;
2693 :
2694 0 : offset = div64_u64(offset, div);
2695 0 : div64_u64_rem(offset, fs_info->nr_global_roots, &index);
2696 0 : return index;
2697 : }
2698 :
2699 1428 : struct btrfs_block_group *btrfs_make_block_group(struct btrfs_trans_handle *trans,
2700 : u64 type,
2701 : u64 chunk_offset, u64 size)
2702 : {
2703 1428 : struct btrfs_fs_info *fs_info = trans->fs_info;
2704 1428 : struct btrfs_block_group *cache;
2705 1428 : int ret;
2706 :
2707 1428 : btrfs_set_log_full_commit(trans);
2708 :
2709 1428 : cache = btrfs_create_block_group_cache(fs_info, chunk_offset);
2710 1428 : if (!cache)
2711 : return ERR_PTR(-ENOMEM);
2712 :
2713 : /*
2714 : * Mark it as new before adding it to the rbtree of block groups or any
2715 : * list, so that no other task finds it and calls btrfs_mark_bg_unused()
2716 : * before the new flag is set.
2717 : */
2718 1428 : set_bit(BLOCK_GROUP_FLAG_NEW, &cache->runtime_flags);
2719 :
2720 1428 : cache->length = size;
2721 1428 : set_free_space_tree_thresholds(cache);
2722 1428 : cache->flags = type;
2723 1428 : cache->cached = BTRFS_CACHE_FINISHED;
2724 1428 : cache->global_root_id = calculate_global_root_id(fs_info, cache->start);
2725 :
2726 1428 : if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE))
2727 1427 : set_bit(BLOCK_GROUP_FLAG_NEEDS_FREE_SPACE, &cache->runtime_flags);
2728 :
2729 1428 : ret = btrfs_load_block_group_zone_info(cache, true);
2730 1428 : if (ret) {
2731 : btrfs_put_block_group(cache);
2732 : return ERR_PTR(ret);
2733 : }
2734 :
2735 1428 : ret = exclude_super_stripes(cache);
2736 1428 : if (ret) {
2737 : /* We may have excluded something, so call this just in case */
2738 0 : btrfs_free_excluded_extents(cache);
2739 0 : btrfs_put_block_group(cache);
2740 0 : return ERR_PTR(ret);
2741 : }
2742 :
2743 1428 : add_new_free_space(cache, chunk_offset, chunk_offset + size);
2744 :
2745 1428 : btrfs_free_excluded_extents(cache);
2746 :
2747 : /*
2748 : * Ensure the corresponding space_info object is created and
2749 : * assigned to our block group. We want our bg to be added to the rbtree
2750 : * with its ->space_info set.
2751 : */
2752 1428 : cache->space_info = btrfs_find_space_info(fs_info, cache->flags);
2753 1428 : ASSERT(cache->space_info);
2754 :
2755 1428 : ret = btrfs_add_block_group_cache(fs_info, cache);
2756 1428 : if (ret) {
2757 0 : btrfs_remove_free_space_cache(cache);
2758 0 : btrfs_put_block_group(cache);
2759 0 : return ERR_PTR(ret);
2760 : }
2761 :
2762 : /*
2763 : * Now that our block group has its ->space_info set and is inserted in
2764 : * the rbtree, update the space info's counters.
2765 : */
2766 1428 : trace_btrfs_add_block_group(fs_info, cache, 1);
2767 1428 : btrfs_add_bg_to_space_info(fs_info, cache);
2768 1428 : btrfs_update_global_block_rsv(fs_info);
2769 :
2770 : #ifdef CONFIG_BTRFS_DEBUG
2771 : if (btrfs_should_fragment_free_space(cache)) {
2772 : cache->space_info->bytes_used += size >> 1;
2773 : fragment_free_space(cache);
2774 : }
2775 : #endif
2776 :
2777 1428 : list_add_tail(&cache->bg_list, &trans->new_bgs);
2778 1428 : trans->delayed_ref_updates++;
2779 1428 : btrfs_update_delayed_refs_rsv(trans);
2780 :
2781 1428 : set_avail_alloc_bits(fs_info, type);
2782 1428 : return cache;
2783 : }
2784 :
2785 : /*
2786 : * Mark one block group RO, can be called several times for the same block
2787 : * group.
2788 : *
2789 : * @cache: the destination block group
2790 : * @do_chunk_alloc: whether need to do chunk pre-allocation, this is to
2791 : * ensure we still have some free space after marking this
2792 : * block group RO.
2793 : */
2794 522 : int btrfs_inc_block_group_ro(struct btrfs_block_group *cache,
2795 : bool do_chunk_alloc)
2796 : {
2797 522 : struct btrfs_fs_info *fs_info = cache->fs_info;
2798 522 : struct btrfs_trans_handle *trans;
2799 522 : struct btrfs_root *root = btrfs_block_group_root(fs_info);
2800 522 : u64 alloc_flags;
2801 522 : int ret;
2802 522 : bool dirty_bg_running;
2803 :
2804 : /*
2805 : * This can only happen when we are doing read-only scrub on read-only
2806 : * mount.
2807 : * In that case we should not start a new transaction on read-only fs.
2808 : * Thus here we skip all chunk allocations.
2809 : */
2810 522 : if (sb_rdonly(fs_info->sb)) {
2811 0 : mutex_lock(&fs_info->ro_block_group_mutex);
2812 0 : ret = inc_block_group_ro(cache, 0);
2813 0 : mutex_unlock(&fs_info->ro_block_group_mutex);
2814 0 : return ret;
2815 : }
2816 :
2817 523 : do {
2818 523 : trans = btrfs_join_transaction(root);
2819 523 : if (IS_ERR(trans))
2820 0 : return PTR_ERR(trans);
2821 :
2822 523 : dirty_bg_running = false;
2823 :
2824 : /*
2825 : * We're not allowed to set block groups readonly after the dirty
2826 : * block group cache has started writing. If it already started,
2827 : * back off and let this transaction commit.
2828 : */
2829 523 : mutex_lock(&fs_info->ro_block_group_mutex);
2830 1046 : if (test_bit(BTRFS_TRANS_DIRTY_BG_RUN, &trans->transaction->flags)) {
2831 1 : u64 transid = trans->transid;
2832 :
2833 1 : mutex_unlock(&fs_info->ro_block_group_mutex);
2834 1 : btrfs_end_transaction(trans);
2835 :
2836 1 : ret = btrfs_wait_for_commit(fs_info, transid);
2837 1 : if (ret)
2838 0 : return ret;
2839 : dirty_bg_running = true;
2840 : }
2841 522 : } while (dirty_bg_running);
2842 :
2843 522 : if (do_chunk_alloc) {
2844 : /*
2845 : * If we are changing raid levels, try to allocate a
2846 : * corresponding block group with the new raid level.
2847 : */
2848 499 : alloc_flags = btrfs_get_alloc_profile(fs_info, cache->flags);
2849 499 : if (alloc_flags != cache->flags) {
2850 0 : ret = btrfs_chunk_alloc(trans, alloc_flags,
2851 : CHUNK_ALLOC_FORCE);
2852 : /*
2853 : * ENOSPC is allowed here, we may have enough space
2854 : * already allocated at the new raid level to carry on
2855 : */
2856 0 : if (ret == -ENOSPC)
2857 : ret = 0;
2858 0 : if (ret < 0)
2859 0 : goto out;
2860 : }
2861 : }
2862 :
2863 522 : ret = inc_block_group_ro(cache, 0);
2864 522 : if (!ret)
2865 492 : goto out;
2866 30 : if (ret == -ETXTBSY)
2867 0 : goto unlock_out;
2868 :
2869 : /*
2870 : * Skip chunk alloction if the bg is SYSTEM, this is to avoid system
2871 : * chunk allocation storm to exhaust the system chunk array. Otherwise
2872 : * we still want to try our best to mark the block group read-only.
2873 : */
2874 30 : if (!do_chunk_alloc && ret == -ENOSPC &&
2875 0 : (cache->flags & BTRFS_BLOCK_GROUP_SYSTEM))
2876 0 : goto unlock_out;
2877 :
2878 30 : alloc_flags = btrfs_get_alloc_profile(fs_info, cache->space_info->flags);
2879 30 : ret = btrfs_chunk_alloc(trans, alloc_flags, CHUNK_ALLOC_FORCE);
2880 30 : if (ret < 0)
2881 0 : goto out;
2882 : /*
2883 : * We have allocated a new chunk. We also need to activate that chunk to
2884 : * grant metadata tickets for zoned filesystem.
2885 : */
2886 30 : ret = btrfs_zoned_activate_one_bg(fs_info, cache->space_info, true);
2887 30 : if (ret < 0)
2888 : goto out;
2889 :
2890 30 : ret = inc_block_group_ro(cache, 0);
2891 30 : if (ret == -ETXTBSY)
2892 0 : goto unlock_out;
2893 30 : out:
2894 522 : if (cache->flags & BTRFS_BLOCK_GROUP_SYSTEM) {
2895 96 : alloc_flags = btrfs_get_alloc_profile(fs_info, cache->flags);
2896 96 : mutex_lock(&fs_info->chunk_mutex);
2897 96 : check_system_chunk(trans, alloc_flags);
2898 96 : mutex_unlock(&fs_info->chunk_mutex);
2899 : }
2900 426 : unlock_out:
2901 522 : mutex_unlock(&fs_info->ro_block_group_mutex);
2902 :
2903 522 : btrfs_end_transaction(trans);
2904 522 : return ret;
2905 : }
2906 :
2907 25 : void btrfs_dec_block_group_ro(struct btrfs_block_group *cache)
2908 : {
2909 25 : struct btrfs_space_info *sinfo = cache->space_info;
2910 25 : u64 num_bytes;
2911 :
2912 25 : BUG_ON(!cache->ro);
2913 :
2914 25 : spin_lock(&sinfo->lock);
2915 25 : spin_lock(&cache->lock);
2916 25 : if (!--cache->ro) {
2917 25 : if (btrfs_is_zoned(cache->fs_info)) {
2918 : /* Migrate zone_unusable bytes back */
2919 : cache->zone_unusable =
2920 : (cache->alloc_offset - cache->used) +
2921 : (cache->length - cache->zone_capacity);
2922 : sinfo->bytes_zone_unusable += cache->zone_unusable;
2923 : sinfo->bytes_readonly -= cache->zone_unusable;
2924 : }
2925 25 : num_bytes = cache->length - cache->reserved -
2926 25 : cache->pinned - cache->bytes_super -
2927 25 : cache->zone_unusable - cache->used;
2928 25 : sinfo->bytes_readonly -= num_bytes;
2929 25 : list_del_init(&cache->ro_list);
2930 : }
2931 25 : spin_unlock(&cache->lock);
2932 25 : spin_unlock(&sinfo->lock);
2933 25 : }
2934 :
2935 531434 : static int update_block_group_item(struct btrfs_trans_handle *trans,
2936 : struct btrfs_path *path,
2937 : struct btrfs_block_group *cache)
2938 : {
2939 531434 : struct btrfs_fs_info *fs_info = trans->fs_info;
2940 531434 : int ret;
2941 531434 : struct btrfs_root *root = btrfs_block_group_root(fs_info);
2942 531434 : unsigned long bi;
2943 531434 : struct extent_buffer *leaf;
2944 531434 : struct btrfs_block_group_item bgi;
2945 531434 : struct btrfs_key key;
2946 531434 : u64 old_commit_used;
2947 531434 : u64 used;
2948 :
2949 : /*
2950 : * Block group items update can be triggered out of commit transaction
2951 : * critical section, thus we need a consistent view of used bytes.
2952 : * We cannot use cache->used directly outside of the spin lock, as it
2953 : * may be changed.
2954 : */
2955 531434 : spin_lock(&cache->lock);
2956 531434 : old_commit_used = cache->commit_used;
2957 531434 : used = cache->used;
2958 : /* No change in used bytes, can safely skip it. */
2959 531434 : if (cache->commit_used == used) {
2960 243119 : spin_unlock(&cache->lock);
2961 243119 : return 0;
2962 : }
2963 288315 : cache->commit_used = used;
2964 288315 : spin_unlock(&cache->lock);
2965 :
2966 288315 : key.objectid = cache->start;
2967 288315 : key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
2968 288315 : key.offset = cache->length;
2969 :
2970 288315 : ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2971 288315 : if (ret) {
2972 4 : if (ret > 0)
2973 4 : ret = -ENOENT;
2974 4 : goto fail;
2975 : }
2976 :
2977 288311 : leaf = path->nodes[0];
2978 288311 : bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
2979 288311 : btrfs_set_stack_block_group_used(&bgi, used);
2980 288311 : btrfs_set_stack_block_group_chunk_objectid(&bgi,
2981 : cache->global_root_id);
2982 288311 : btrfs_set_stack_block_group_flags(&bgi, cache->flags);
2983 288311 : write_extent_buffer(leaf, &bgi, bi, sizeof(bgi));
2984 288311 : btrfs_mark_buffer_dirty(leaf);
2985 288315 : fail:
2986 288315 : btrfs_release_path(path);
2987 : /* We didn't update the block group item, need to revert @commit_used. */
2988 288315 : if (ret < 0) {
2989 4 : spin_lock(&cache->lock);
2990 4 : cache->commit_used = old_commit_used;
2991 4 : spin_unlock(&cache->lock);
2992 : }
2993 : return ret;
2994 :
2995 : }
2996 :
2997 531437 : static int cache_save_setup(struct btrfs_block_group *block_group,
2998 : struct btrfs_trans_handle *trans,
2999 : struct btrfs_path *path)
3000 : {
3001 531437 : struct btrfs_fs_info *fs_info = block_group->fs_info;
3002 531437 : struct btrfs_root *root = fs_info->tree_root;
3003 531437 : struct inode *inode = NULL;
3004 531437 : struct extent_changeset *data_reserved = NULL;
3005 531437 : u64 alloc_hint = 0;
3006 531437 : int dcs = BTRFS_DC_ERROR;
3007 531437 : u64 cache_size = 0;
3008 531437 : int retries = 0;
3009 531437 : int ret = 0;
3010 :
3011 531437 : if (!btrfs_test_opt(fs_info, SPACE_CACHE))
3012 : return 0;
3013 :
3014 : /*
3015 : * If this block group is smaller than 100 megs don't bother caching the
3016 : * block group.
3017 : */
3018 84 : if (block_group->length < (100 * SZ_1M)) {
3019 43 : spin_lock(&block_group->lock);
3020 43 : block_group->disk_cache_state = BTRFS_DC_WRITTEN;
3021 43 : spin_unlock(&block_group->lock);
3022 43 : return 0;
3023 : }
3024 :
3025 41 : if (TRANS_ABORTED(trans))
3026 : return 0;
3027 41 : again:
3028 46 : inode = lookup_free_space_inode(block_group, path);
3029 46 : if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
3030 0 : ret = PTR_ERR(inode);
3031 0 : btrfs_release_path(path);
3032 0 : goto out;
3033 : }
3034 :
3035 46 : if (IS_ERR(inode)) {
3036 5 : BUG_ON(retries);
3037 5 : retries++;
3038 :
3039 5 : if (block_group->ro)
3040 0 : goto out_free;
3041 :
3042 5 : ret = create_free_space_inode(trans, block_group, path);
3043 5 : if (ret)
3044 0 : goto out_free;
3045 5 : goto again;
3046 : }
3047 :
3048 : /*
3049 : * We want to set the generation to 0, that way if anything goes wrong
3050 : * from here on out we know not to trust this cache when we load up next
3051 : * time.
3052 : */
3053 41 : BTRFS_I(inode)->generation = 0;
3054 41 : ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
3055 41 : if (ret) {
3056 : /*
3057 : * So theoretically we could recover from this, simply set the
3058 : * super cache generation to 0 so we know to invalidate the
3059 : * cache, but then we'd have to keep track of the block groups
3060 : * that fail this way so we know we _have_ to reset this cache
3061 : * before the next commit or risk reading stale cache. So to
3062 : * limit our exposure to horrible edge cases lets just abort the
3063 : * transaction, this only happens in really bad situations
3064 : * anyway.
3065 : */
3066 0 : btrfs_abort_transaction(trans, ret);
3067 0 : goto out_put;
3068 : }
3069 41 : WARN_ON(ret);
3070 :
3071 : /* We've already setup this transaction, go ahead and exit */
3072 41 : if (block_group->cache_generation == trans->transid &&
3073 : i_size_read(inode)) {
3074 24 : dcs = BTRFS_DC_SETUP;
3075 24 : goto out_put;
3076 : }
3077 :
3078 17 : if (i_size_read(inode) > 0) {
3079 12 : ret = btrfs_check_trunc_cache_free_space(fs_info,
3080 : &fs_info->global_block_rsv);
3081 12 : if (ret)
3082 0 : goto out_put;
3083 :
3084 12 : ret = btrfs_truncate_free_space_cache(trans, NULL, inode);
3085 12 : if (ret)
3086 0 : goto out_put;
3087 : }
3088 :
3089 17 : spin_lock(&block_group->lock);
3090 17 : if (block_group->cached != BTRFS_CACHE_FINISHED ||
3091 17 : !btrfs_test_opt(fs_info, SPACE_CACHE)) {
3092 : /*
3093 : * don't bother trying to write stuff out _if_
3094 : * a) we're not cached,
3095 : * b) we're with nospace_cache mount option,
3096 : * c) we're with v2 space_cache (FREE_SPACE_TREE).
3097 : */
3098 0 : dcs = BTRFS_DC_WRITTEN;
3099 0 : spin_unlock(&block_group->lock);
3100 0 : goto out_put;
3101 : }
3102 17 : spin_unlock(&block_group->lock);
3103 :
3104 : /*
3105 : * We hit an ENOSPC when setting up the cache in this transaction, just
3106 : * skip doing the setup, we've already cleared the cache so we're safe.
3107 : */
3108 34 : if (test_bit(BTRFS_TRANS_CACHE_ENOSPC, &trans->transaction->flags)) {
3109 0 : ret = -ENOSPC;
3110 0 : goto out_put;
3111 : }
3112 :
3113 : /*
3114 : * Try to preallocate enough space based on how big the block group is.
3115 : * Keep in mind this has to include any pinned space which could end up
3116 : * taking up quite a bit since it's not folded into the other space
3117 : * cache.
3118 : */
3119 17 : cache_size = div_u64(block_group->length, SZ_256M);
3120 17 : if (!cache_size)
3121 0 : cache_size = 1;
3122 :
3123 17 : cache_size *= 16;
3124 17 : cache_size *= fs_info->sectorsize;
3125 :
3126 17 : ret = btrfs_check_data_free_space(BTRFS_I(inode), &data_reserved, 0,
3127 : cache_size, false);
3128 17 : if (ret)
3129 0 : goto out_put;
3130 :
3131 17 : ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, cache_size,
3132 : cache_size, cache_size,
3133 : &alloc_hint);
3134 : /*
3135 : * Our cache requires contiguous chunks so that we don't modify a bunch
3136 : * of metadata or split extents when writing the cache out, which means
3137 : * we can enospc if we are heavily fragmented in addition to just normal
3138 : * out of space conditions. So if we hit this just skip setting up any
3139 : * other block groups for this transaction, maybe we'll unpin enough
3140 : * space the next time around.
3141 : */
3142 17 : if (!ret)
3143 : dcs = BTRFS_DC_SETUP;
3144 0 : else if (ret == -ENOSPC)
3145 0 : set_bit(BTRFS_TRANS_CACHE_ENOSPC, &trans->transaction->flags);
3146 :
3147 0 : out_put:
3148 41 : iput(inode);
3149 41 : out_free:
3150 41 : btrfs_release_path(path);
3151 41 : out:
3152 41 : spin_lock(&block_group->lock);
3153 41 : if (!ret && dcs == BTRFS_DC_SETUP)
3154 41 : block_group->cache_generation = trans->transid;
3155 41 : block_group->disk_cache_state = dcs;
3156 41 : spin_unlock(&block_group->lock);
3157 :
3158 41 : extent_changeset_free(data_reserved);
3159 41 : return ret;
3160 : }
3161 :
3162 203435 : int btrfs_setup_space_cache(struct btrfs_trans_handle *trans)
3163 : {
3164 203435 : struct btrfs_fs_info *fs_info = trans->fs_info;
3165 203435 : struct btrfs_block_group *cache, *tmp;
3166 203435 : struct btrfs_transaction *cur_trans = trans->transaction;
3167 203435 : struct btrfs_path *path;
3168 :
3169 203435 : if (list_empty(&cur_trans->dirty_bgs) ||
3170 53130 : !btrfs_test_opt(fs_info, SPACE_CACHE))
3171 : return 0;
3172 :
3173 6 : path = btrfs_alloc_path();
3174 6 : if (!path)
3175 : return -ENOMEM;
3176 :
3177 : /* Could add new block groups, use _safe just in case */
3178 13 : list_for_each_entry_safe(cache, tmp, &cur_trans->dirty_bgs,
3179 : dirty_list) {
3180 7 : if (cache->disk_cache_state == BTRFS_DC_CLEAR)
3181 3 : cache_save_setup(cache, trans, path);
3182 : }
3183 :
3184 6 : btrfs_free_path(path);
3185 6 : return 0;
3186 : }
3187 :
3188 : /*
3189 : * Transaction commit does final block group cache writeback during a critical
3190 : * section where nothing is allowed to change the FS. This is required in
3191 : * order for the cache to actually match the block group, but can introduce a
3192 : * lot of latency into the commit.
3193 : *
3194 : * So, btrfs_start_dirty_block_groups is here to kick off block group cache IO.
3195 : * There's a chance we'll have to redo some of it if the block group changes
3196 : * again during the commit, but it greatly reduces the commit latency by
3197 : * getting rid of the easy block groups while we're still allowing others to
3198 : * join the commit.
3199 : */
3200 203272 : int btrfs_start_dirty_block_groups(struct btrfs_trans_handle *trans)
3201 : {
3202 203272 : struct btrfs_fs_info *fs_info = trans->fs_info;
3203 203272 : struct btrfs_block_group *cache;
3204 203272 : struct btrfs_transaction *cur_trans = trans->transaction;
3205 203272 : int ret = 0;
3206 203272 : int should_put;
3207 203272 : struct btrfs_path *path = NULL;
3208 203272 : LIST_HEAD(dirty);
3209 203272 : struct list_head *io = &cur_trans->io_bgs;
3210 203272 : int loops = 0;
3211 :
3212 203272 : spin_lock(&cur_trans->dirty_bgs_lock);
3213 203272 : if (list_empty(&cur_trans->dirty_bgs)) {
3214 65361 : spin_unlock(&cur_trans->dirty_bgs_lock);
3215 65361 : return 0;
3216 : }
3217 137911 : list_splice_init(&cur_trans->dirty_bgs, &dirty);
3218 137911 : spin_unlock(&cur_trans->dirty_bgs_lock);
3219 :
3220 249084 : again:
3221 : /* Make sure all the block groups on our dirty list actually exist */
3222 249084 : btrfs_create_pending_block_groups(trans);
3223 :
3224 249084 : if (!path) {
3225 137911 : path = btrfs_alloc_path();
3226 137911 : if (!path) {
3227 0 : ret = -ENOMEM;
3228 0 : goto out;
3229 : }
3230 : }
3231 :
3232 : /*
3233 : * cache_write_mutex is here only to save us from balance or automatic
3234 : * removal of empty block groups deleting this block group while we are
3235 : * writing out the cache
3236 : */
3237 249084 : mutex_lock(&trans->transaction->cache_write_mutex);
3238 559097 : while (!list_empty(&dirty)) {
3239 310013 : bool drop_reserve = true;
3240 :
3241 310013 : cache = list_first_entry(&dirty, struct btrfs_block_group,
3242 : dirty_list);
3243 : /*
3244 : * This can happen if something re-dirties a block group that
3245 : * is already under IO. Just wait for it to finish and then do
3246 : * it all again
3247 : */
3248 310013 : if (!list_empty(&cache->io_list)) {
3249 8 : list_del_init(&cache->io_list);
3250 8 : btrfs_wait_cache_io(trans, cache, path);
3251 8 : btrfs_put_block_group(cache);
3252 : }
3253 :
3254 :
3255 : /*
3256 : * btrfs_wait_cache_io uses the cache->dirty_list to decide if
3257 : * it should update the cache_state. Don't delete until after
3258 : * we wait.
3259 : *
3260 : * Since we're not running in the commit critical section
3261 : * we need the dirty_bgs_lock to protect from update_block_group
3262 : */
3263 310013 : spin_lock(&cur_trans->dirty_bgs_lock);
3264 310013 : list_del_init(&cache->dirty_list);
3265 310013 : spin_unlock(&cur_trans->dirty_bgs_lock);
3266 :
3267 310013 : should_put = 1;
3268 :
3269 310013 : cache_save_setup(cache, trans, path);
3270 :
3271 310013 : if (cache->disk_cache_state == BTRFS_DC_SETUP) {
3272 17 : cache->io_ctl.inode = NULL;
3273 17 : ret = btrfs_write_out_cache(trans, cache, path);
3274 17 : if (ret == 0 && cache->io_ctl.inode) {
3275 17 : should_put = 0;
3276 :
3277 : /*
3278 : * The cache_write_mutex is protecting the
3279 : * io_list, also refer to the definition of
3280 : * btrfs_transaction::io_bgs for more details
3281 : */
3282 17 : list_add_tail(&cache->io_list, io);
3283 : } else {
3284 : /*
3285 : * If we failed to write the cache, the
3286 : * generation will be bad and life goes on
3287 : */
3288 : ret = 0;
3289 : }
3290 : }
3291 : if (!ret) {
3292 310013 : ret = update_block_group_item(trans, path, cache);
3293 : /*
3294 : * Our block group might still be attached to the list
3295 : * of new block groups in the transaction handle of some
3296 : * other task (struct btrfs_trans_handle->new_bgs). This
3297 : * means its block group item isn't yet in the extent
3298 : * tree. If this happens ignore the error, as we will
3299 : * try again later in the critical section of the
3300 : * transaction commit.
3301 : */
3302 310013 : if (ret == -ENOENT) {
3303 4 : ret = 0;
3304 4 : spin_lock(&cur_trans->dirty_bgs_lock);
3305 4 : if (list_empty(&cache->dirty_list)) {
3306 4 : list_add_tail(&cache->dirty_list,
3307 : &cur_trans->dirty_bgs);
3308 4 : btrfs_get_block_group(cache);
3309 4 : drop_reserve = false;
3310 : }
3311 4 : spin_unlock(&cur_trans->dirty_bgs_lock);
3312 310009 : } else if (ret) {
3313 0 : btrfs_abort_transaction(trans, ret);
3314 : }
3315 : }
3316 :
3317 : /* If it's not on the io list, we need to put the block group */
3318 310013 : if (should_put)
3319 309996 : btrfs_put_block_group(cache);
3320 310013 : if (drop_reserve)
3321 310009 : btrfs_delayed_refs_rsv_release(fs_info, 1);
3322 : /*
3323 : * Avoid blocking other tasks for too long. It might even save
3324 : * us from writing caches for block groups that are going to be
3325 : * removed.
3326 : */
3327 310013 : mutex_unlock(&trans->transaction->cache_write_mutex);
3328 310013 : if (ret)
3329 0 : goto out;
3330 310013 : mutex_lock(&trans->transaction->cache_write_mutex);
3331 : }
3332 249084 : mutex_unlock(&trans->transaction->cache_write_mutex);
3333 :
3334 : /*
3335 : * Go through delayed refs for all the stuff we've just kicked off
3336 : * and then loop back (just once)
3337 : */
3338 249084 : if (!ret)
3339 249084 : ret = btrfs_run_delayed_refs(trans, 0);
3340 249084 : if (!ret && loops == 0) {
3341 137911 : loops++;
3342 137911 : spin_lock(&cur_trans->dirty_bgs_lock);
3343 137911 : list_splice_init(&cur_trans->dirty_bgs, &dirty);
3344 : /*
3345 : * dirty_bgs_lock protects us from concurrent block group
3346 : * deletes too (not just cache_write_mutex).
3347 : */
3348 137911 : if (!list_empty(&dirty)) {
3349 111173 : spin_unlock(&cur_trans->dirty_bgs_lock);
3350 111173 : goto again;
3351 : }
3352 26738 : spin_unlock(&cur_trans->dirty_bgs_lock);
3353 : }
3354 111173 : out:
3355 137911 : if (ret < 0) {
3356 0 : spin_lock(&cur_trans->dirty_bgs_lock);
3357 0 : list_splice_init(&dirty, &cur_trans->dirty_bgs);
3358 0 : spin_unlock(&cur_trans->dirty_bgs_lock);
3359 0 : btrfs_cleanup_dirty_bgs(cur_trans, fs_info);
3360 : }
3361 :
3362 137911 : btrfs_free_path(path);
3363 137911 : return ret;
3364 : }
3365 :
3366 203573 : int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans)
3367 : {
3368 203573 : struct btrfs_fs_info *fs_info = trans->fs_info;
3369 203573 : struct btrfs_block_group *cache;
3370 203573 : struct btrfs_transaction *cur_trans = trans->transaction;
3371 203573 : int ret = 0;
3372 203573 : int should_put;
3373 203573 : struct btrfs_path *path;
3374 203573 : struct list_head *io = &cur_trans->io_bgs;
3375 :
3376 203573 : path = btrfs_alloc_path();
3377 203573 : if (!path)
3378 : return -ENOMEM;
3379 :
3380 : /*
3381 : * Even though we are in the critical section of the transaction commit,
3382 : * we can still have concurrent tasks adding elements to this
3383 : * transaction's list of dirty block groups. These tasks correspond to
3384 : * endio free space workers started when writeback finishes for a
3385 : * space cache, which run inode.c:btrfs_finish_ordered_io(), and can
3386 : * allocate new block groups as a result of COWing nodes of the root
3387 : * tree when updating the free space inode. The writeback for the space
3388 : * caches is triggered by an earlier call to
3389 : * btrfs_start_dirty_block_groups() and iterations of the following
3390 : * loop.
3391 : * Also we want to do the cache_save_setup first and then run the
3392 : * delayed refs to make sure we have the best chance at doing this all
3393 : * in one shot.
3394 : */
3395 203573 : spin_lock(&cur_trans->dirty_bgs_lock);
3396 424994 : while (!list_empty(&cur_trans->dirty_bgs)) {
3397 221421 : cache = list_first_entry(&cur_trans->dirty_bgs,
3398 : struct btrfs_block_group,
3399 : dirty_list);
3400 :
3401 : /*
3402 : * This can happen if cache_save_setup re-dirties a block group
3403 : * that is already under IO. Just wait for it to finish and
3404 : * then do it all again
3405 : */
3406 221421 : if (!list_empty(&cache->io_list)) {
3407 16 : spin_unlock(&cur_trans->dirty_bgs_lock);
3408 16 : list_del_init(&cache->io_list);
3409 16 : btrfs_wait_cache_io(trans, cache, path);
3410 16 : btrfs_put_block_group(cache);
3411 16 : spin_lock(&cur_trans->dirty_bgs_lock);
3412 : }
3413 :
3414 : /*
3415 : * Don't remove from the dirty list until after we've waited on
3416 : * any pending IO
3417 : */
3418 221421 : list_del_init(&cache->dirty_list);
3419 221421 : spin_unlock(&cur_trans->dirty_bgs_lock);
3420 221421 : should_put = 1;
3421 :
3422 221421 : cache_save_setup(cache, trans, path);
3423 :
3424 221421 : if (!ret)
3425 221421 : ret = btrfs_run_delayed_refs(trans,
3426 : (unsigned long) -1);
3427 :
3428 221421 : if (!ret && cache->disk_cache_state == BTRFS_DC_SETUP) {
3429 24 : cache->io_ctl.inode = NULL;
3430 24 : ret = btrfs_write_out_cache(trans, cache, path);
3431 24 : if (ret == 0 && cache->io_ctl.inode) {
3432 24 : should_put = 0;
3433 24 : list_add_tail(&cache->io_list, io);
3434 : } else {
3435 : /*
3436 : * If we failed to write the cache, the
3437 : * generation will be bad and life goes on
3438 : */
3439 : ret = 0;
3440 : }
3441 : }
3442 221421 : if (!ret) {
3443 221421 : ret = update_block_group_item(trans, path, cache);
3444 : /*
3445 : * One of the free space endio workers might have
3446 : * created a new block group while updating a free space
3447 : * cache's inode (at inode.c:btrfs_finish_ordered_io())
3448 : * and hasn't released its transaction handle yet, in
3449 : * which case the new block group is still attached to
3450 : * its transaction handle and its creation has not
3451 : * finished yet (no block group item in the extent tree
3452 : * yet, etc). If this is the case, wait for all free
3453 : * space endio workers to finish and retry. This is a
3454 : * very rare case so no need for a more efficient and
3455 : * complex approach.
3456 : */
3457 221421 : if (ret == -ENOENT) {
3458 0 : wait_event(cur_trans->writer_wait,
3459 : atomic_read(&cur_trans->num_writers) == 1);
3460 0 : ret = update_block_group_item(trans, path, cache);
3461 : }
3462 221421 : if (ret)
3463 0 : btrfs_abort_transaction(trans, ret);
3464 : }
3465 :
3466 : /* If its not on the io list, we need to put the block group */
3467 221421 : if (should_put)
3468 221397 : btrfs_put_block_group(cache);
3469 221421 : btrfs_delayed_refs_rsv_release(fs_info, 1);
3470 221421 : spin_lock(&cur_trans->dirty_bgs_lock);
3471 : }
3472 203573 : spin_unlock(&cur_trans->dirty_bgs_lock);
3473 :
3474 : /*
3475 : * Refer to the definition of io_bgs member for details why it's safe
3476 : * to use it without any locking
3477 : */
3478 203590 : while (!list_empty(io)) {
3479 17 : cache = list_first_entry(io, struct btrfs_block_group,
3480 : io_list);
3481 17 : list_del_init(&cache->io_list);
3482 17 : btrfs_wait_cache_io(trans, cache, path);
3483 17 : btrfs_put_block_group(cache);
3484 : }
3485 :
3486 203573 : btrfs_free_path(path);
3487 203573 : return ret;
3488 : }
3489 :
3490 17400355 : int btrfs_update_block_group(struct btrfs_trans_handle *trans,
3491 : u64 bytenr, u64 num_bytes, bool alloc)
3492 : {
3493 17400355 : struct btrfs_fs_info *info = trans->fs_info;
3494 17400355 : struct btrfs_block_group *cache = NULL;
3495 17400355 : u64 total = num_bytes;
3496 17400355 : u64 old_val;
3497 17400355 : u64 byte_in_group;
3498 17400355 : int factor;
3499 17400355 : int ret = 0;
3500 :
3501 : /* Block accounting for super block */
3502 17400355 : spin_lock(&info->delalloc_root_lock);
3503 17400356 : old_val = btrfs_super_bytes_used(info->super_copy);
3504 17400356 : if (alloc)
3505 9327087 : old_val += num_bytes;
3506 : else
3507 8073269 : old_val -= num_bytes;
3508 17400356 : btrfs_set_super_bytes_used(info->super_copy, old_val);
3509 17400356 : spin_unlock(&info->delalloc_root_lock);
3510 :
3511 34800710 : while (total) {
3512 17400356 : struct btrfs_space_info *space_info;
3513 17400356 : bool reclaim = false;
3514 :
3515 17400356 : cache = btrfs_lookup_block_group(info, bytenr);
3516 17400355 : if (!cache) {
3517 : ret = -ENOENT;
3518 : break;
3519 : }
3520 17400355 : space_info = cache->space_info;
3521 17400355 : factor = btrfs_bg_type_to_factor(cache->flags);
3522 :
3523 : /*
3524 : * If this block group has free space cache written out, we
3525 : * need to make sure to load it if we are removing space. This
3526 : * is because we need the unpinning stage to actually add the
3527 : * space back to the block group, otherwise we will leak space.
3528 : */
3529 25473624 : if (!alloc && !btrfs_block_group_done(cache))
3530 159 : btrfs_cache_block_group(cache, true);
3531 :
3532 17400355 : byte_in_group = bytenr - cache->start;
3533 17400355 : WARN_ON(byte_in_group > cache->length);
3534 :
3535 17400355 : spin_lock(&space_info->lock);
3536 17400356 : spin_lock(&cache->lock);
3537 :
3538 17400356 : if (btrfs_test_opt(info, SPACE_CACHE) &&
3539 491 : cache->disk_cache_state < BTRFS_DC_CLEAR)
3540 43 : cache->disk_cache_state = BTRFS_DC_CLEAR;
3541 :
3542 17400356 : old_val = cache->used;
3543 17400356 : num_bytes = min(total, cache->length - byte_in_group);
3544 17400356 : if (alloc) {
3545 9327087 : old_val += num_bytes;
3546 9327087 : cache->used = old_val;
3547 9327087 : cache->reserved -= num_bytes;
3548 9327087 : space_info->bytes_reserved -= num_bytes;
3549 9327087 : space_info->bytes_used += num_bytes;
3550 9327087 : space_info->disk_used += num_bytes * factor;
3551 9327087 : spin_unlock(&cache->lock);
3552 9327087 : spin_unlock(&space_info->lock);
3553 : } else {
3554 8073269 : old_val -= num_bytes;
3555 8073269 : cache->used = old_val;
3556 8073269 : cache->pinned += num_bytes;
3557 8073269 : btrfs_space_info_update_bytes_pinned(info, space_info,
3558 : num_bytes);
3559 8073269 : space_info->bytes_used -= num_bytes;
3560 8073269 : space_info->disk_used -= num_bytes * factor;
3561 :
3562 8073269 : reclaim = should_reclaim_block_group(cache, num_bytes);
3563 :
3564 8073268 : spin_unlock(&cache->lock);
3565 8073269 : spin_unlock(&space_info->lock);
3566 :
3567 8073269 : set_extent_bit(&trans->transaction->pinned_extents,
3568 8073269 : bytenr, bytenr + num_bytes - 1,
3569 : EXTENT_DIRTY, NULL);
3570 : }
3571 :
3572 17400356 : spin_lock(&trans->transaction->dirty_bgs_lock);
3573 17400356 : if (list_empty(&cache->dirty_list)) {
3574 531438 : list_add_tail(&cache->dirty_list,
3575 531438 : &trans->transaction->dirty_bgs);
3576 531438 : trans->delayed_ref_updates++;
3577 531438 : btrfs_get_block_group(cache);
3578 : }
3579 17400356 : spin_unlock(&trans->transaction->dirty_bgs_lock);
3580 :
3581 : /*
3582 : * No longer have used bytes in this block group, queue it for
3583 : * deletion. We do this after adding the block group to the
3584 : * dirty list to avoid races between cleaner kthread and space
3585 : * cache writeout.
3586 : */
3587 17400356 : if (!alloc && old_val == 0) {
3588 122125 : if (!btrfs_test_opt(info, DISCARD_ASYNC))
3589 10 : btrfs_mark_bg_unused(cache);
3590 17278231 : } else if (!alloc && reclaim) {
3591 0 : btrfs_mark_bg_to_reclaim(cache);
3592 : }
3593 :
3594 17400356 : btrfs_put_block_group(cache);
3595 17400354 : total -= num_bytes;
3596 17400354 : bytenr += num_bytes;
3597 : }
3598 :
3599 : /* Modified block groups are accounted for in the delayed_refs_rsv. */
3600 17400354 : btrfs_update_delayed_refs_rsv(trans);
3601 17400353 : return ret;
3602 : }
3603 :
3604 : /*
3605 : * Update the block_group and space info counters.
3606 : *
3607 : * @cache: The cache we are manipulating
3608 : * @ram_bytes: The number of bytes of file content, and will be same to
3609 : * @num_bytes except for the compress path.
3610 : * @num_bytes: The number of bytes in question
3611 : * @delalloc: The blocks are allocated for the delalloc write
3612 : *
3613 : * This is called by the allocator when it reserves space. If this is a
3614 : * reservation and the block group has become read only we cannot make the
3615 : * reservation and return -EAGAIN, otherwise this function always succeeds.
3616 : */
3617 12355356 : int btrfs_add_reserved_bytes(struct btrfs_block_group *cache,
3618 : u64 ram_bytes, u64 num_bytes, int delalloc,
3619 : bool force_wrong_size_class)
3620 : {
3621 12355356 : struct btrfs_space_info *space_info = cache->space_info;
3622 12355356 : enum btrfs_block_group_size_class size_class;
3623 12355356 : int ret = 0;
3624 :
3625 12355356 : spin_lock(&space_info->lock);
3626 12355452 : spin_lock(&cache->lock);
3627 12355466 : if (cache->ro) {
3628 0 : ret = -EAGAIN;
3629 0 : goto out;
3630 : }
3631 :
3632 12355466 : if (btrfs_block_group_should_use_size_class(cache)) {
3633 3475425 : size_class = btrfs_calc_block_group_size_class(num_bytes);
3634 3475425 : ret = btrfs_use_block_group_size_class(cache, size_class, force_wrong_size_class);
3635 1580 : if (ret)
3636 0 : goto out;
3637 : }
3638 12355466 : cache->reserved += num_bytes;
3639 12355466 : space_info->bytes_reserved += num_bytes;
3640 12355466 : trace_btrfs_space_reservation(cache->fs_info, "space_info",
3641 : space_info->flags, num_bytes, 1);
3642 12355389 : btrfs_space_info_update_bytes_may_use(cache->fs_info,
3643 12355389 : space_info, -ram_bytes);
3644 12355337 : if (delalloc)
3645 3124791 : cache->delalloc_bytes += num_bytes;
3646 :
3647 : /*
3648 : * Compression can use less space than we reserved, so wake tickets if
3649 : * that happens.
3650 : */
3651 12355337 : if (num_bytes < ram_bytes)
3652 158292 : btrfs_try_granting_tickets(cache->fs_info, space_info);
3653 12197045 : out:
3654 12355337 : spin_unlock(&cache->lock);
3655 12355428 : spin_unlock(&space_info->lock);
3656 12355439 : return ret;
3657 : }
3658 :
3659 : /*
3660 : * Update the block_group and space info counters.
3661 : *
3662 : * @cache: The cache we are manipulating
3663 : * @num_bytes: The number of bytes in question
3664 : * @delalloc: The blocks are allocated for the delalloc write
3665 : *
3666 : * This is called by somebody who is freeing space that was never actually used
3667 : * on disk. For example if you reserve some space for a new leaf in transaction
3668 : * A and before transaction A commits you free that leaf, you call this with
3669 : * reserve set to 0 in order to clear the reservation.
3670 : */
3671 41004 : void btrfs_free_reserved_bytes(struct btrfs_block_group *cache,
3672 : u64 num_bytes, int delalloc)
3673 : {
3674 41004 : struct btrfs_space_info *space_info = cache->space_info;
3675 :
3676 41004 : spin_lock(&space_info->lock);
3677 41004 : spin_lock(&cache->lock);
3678 41004 : if (cache->ro)
3679 1 : space_info->bytes_readonly += num_bytes;
3680 41004 : cache->reserved -= num_bytes;
3681 41004 : space_info->bytes_reserved -= num_bytes;
3682 41004 : space_info->max_extent_size = 0;
3683 :
3684 41004 : if (delalloc)
3685 168 : cache->delalloc_bytes -= num_bytes;
3686 41004 : spin_unlock(&cache->lock);
3687 :
3688 41004 : btrfs_try_granting_tickets(cache->fs_info, space_info);
3689 41004 : spin_unlock(&space_info->lock);
3690 41004 : }
3691 :
3692 0 : static void force_metadata_allocation(struct btrfs_fs_info *info)
3693 : {
3694 0 : struct list_head *head = &info->space_info;
3695 0 : struct btrfs_space_info *found;
3696 :
3697 0 : list_for_each_entry(found, head, list) {
3698 0 : if (found->flags & BTRFS_BLOCK_GROUP_METADATA)
3699 0 : found->force_alloc = CHUNK_ALLOC_FORCE;
3700 : }
3701 0 : }
3702 :
3703 264287 : static int should_alloc_chunk(struct btrfs_fs_info *fs_info,
3704 : struct btrfs_space_info *sinfo, int force)
3705 : {
3706 264287 : u64 bytes_used = btrfs_space_info_used(sinfo, false);
3707 264287 : u64 thresh;
3708 :
3709 264287 : if (force == CHUNK_ALLOC_FORCE)
3710 : return 1;
3711 :
3712 : /*
3713 : * in limited mode, we want to have some free space up to
3714 : * about 1% of the FS size.
3715 : */
3716 102371 : if (force == CHUNK_ALLOC_LIMITED) {
3717 0 : thresh = btrfs_super_total_bytes(fs_info->super_copy);
3718 0 : thresh = max_t(u64, SZ_64M, mult_perc(thresh, 1));
3719 :
3720 0 : if (sinfo->total_bytes - bytes_used < thresh)
3721 : return 1;
3722 : }
3723 :
3724 102371 : if (bytes_used + SZ_2M < mult_perc(sinfo->total_bytes, 80))
3725 27201 : return 0;
3726 : return 1;
3727 : }
3728 :
3729 22 : int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans, u64 type)
3730 : {
3731 22 : u64 alloc_flags = btrfs_get_alloc_profile(trans->fs_info, type);
3732 :
3733 22 : return btrfs_chunk_alloc(trans, alloc_flags, CHUNK_ALLOC_FORCE);
3734 : }
3735 :
3736 1385 : static struct btrfs_block_group *do_chunk_alloc(struct btrfs_trans_handle *trans, u64 flags)
3737 : {
3738 1385 : struct btrfs_block_group *bg;
3739 1385 : int ret;
3740 :
3741 : /*
3742 : * Check if we have enough space in the system space info because we
3743 : * will need to update device items in the chunk btree and insert a new
3744 : * chunk item in the chunk btree as well. This will allocate a new
3745 : * system block group if needed.
3746 : */
3747 1385 : check_system_chunk(trans, flags);
3748 :
3749 1385 : bg = btrfs_create_chunk(trans, flags);
3750 1385 : if (IS_ERR(bg)) {
3751 47 : ret = PTR_ERR(bg);
3752 47 : goto out;
3753 : }
3754 :
3755 1338 : ret = btrfs_chunk_alloc_add_chunk_item(trans, bg);
3756 : /*
3757 : * Normally we are not expected to fail with -ENOSPC here, since we have
3758 : * previously reserved space in the system space_info and allocated one
3759 : * new system chunk if necessary. However there are three exceptions:
3760 : *
3761 : * 1) We may have enough free space in the system space_info but all the
3762 : * existing system block groups have a profile which can not be used
3763 : * for extent allocation.
3764 : *
3765 : * This happens when mounting in degraded mode. For example we have a
3766 : * RAID1 filesystem with 2 devices, lose one device and mount the fs
3767 : * using the other device in degraded mode. If we then allocate a chunk,
3768 : * we may have enough free space in the existing system space_info, but
3769 : * none of the block groups can be used for extent allocation since they
3770 : * have a RAID1 profile, and because we are in degraded mode with a
3771 : * single device, we are forced to allocate a new system chunk with a
3772 : * SINGLE profile. Making check_system_chunk() iterate over all system
3773 : * block groups and check if they have a usable profile and enough space
3774 : * can be slow on very large filesystems, so we tolerate the -ENOSPC and
3775 : * try again after forcing allocation of a new system chunk. Like this
3776 : * we avoid paying the cost of that search in normal circumstances, when
3777 : * we were not mounted in degraded mode;
3778 : *
3779 : * 2) We had enough free space info the system space_info, and one suitable
3780 : * block group to allocate from when we called check_system_chunk()
3781 : * above. However right after we called it, the only system block group
3782 : * with enough free space got turned into RO mode by a running scrub,
3783 : * and in this case we have to allocate a new one and retry. We only
3784 : * need do this allocate and retry once, since we have a transaction
3785 : * handle and scrub uses the commit root to search for block groups;
3786 : *
3787 : * 3) We had one system block group with enough free space when we called
3788 : * check_system_chunk(), but after that, right before we tried to
3789 : * allocate the last extent buffer we needed, a discard operation came
3790 : * in and it temporarily removed the last free space entry from the
3791 : * block group (discard removes a free space entry, discards it, and
3792 : * then adds back the entry to the block group cache).
3793 : */
3794 1338 : if (ret == -ENOSPC) {
3795 0 : const u64 sys_flags = btrfs_system_alloc_profile(trans->fs_info);
3796 0 : struct btrfs_block_group *sys_bg;
3797 :
3798 0 : sys_bg = btrfs_create_chunk(trans, sys_flags);
3799 0 : if (IS_ERR(sys_bg)) {
3800 0 : ret = PTR_ERR(sys_bg);
3801 0 : btrfs_abort_transaction(trans, ret);
3802 0 : goto out;
3803 : }
3804 :
3805 0 : ret = btrfs_chunk_alloc_add_chunk_item(trans, sys_bg);
3806 0 : if (ret) {
3807 0 : btrfs_abort_transaction(trans, ret);
3808 0 : goto out;
3809 : }
3810 :
3811 0 : ret = btrfs_chunk_alloc_add_chunk_item(trans, bg);
3812 0 : if (ret) {
3813 0 : btrfs_abort_transaction(trans, ret);
3814 0 : goto out;
3815 : }
3816 1338 : } else if (ret) {
3817 0 : btrfs_abort_transaction(trans, ret);
3818 0 : goto out;
3819 : }
3820 1338 : out:
3821 1385 : btrfs_trans_release_chunk_metadata(trans);
3822 :
3823 1385 : if (ret)
3824 47 : return ERR_PTR(ret);
3825 :
3826 1338 : btrfs_get_block_group(bg);
3827 1338 : return bg;
3828 : }
3829 :
3830 : /*
3831 : * Chunk allocation is done in 2 phases:
3832 : *
3833 : * 1) Phase 1 - through btrfs_chunk_alloc() we allocate device extents for
3834 : * the chunk, the chunk mapping, create its block group and add the items
3835 : * that belong in the chunk btree to it - more specifically, we need to
3836 : * update device items in the chunk btree and add a new chunk item to it.
3837 : *
3838 : * 2) Phase 2 - through btrfs_create_pending_block_groups(), we add the block
3839 : * group item to the extent btree and the device extent items to the devices
3840 : * btree.
3841 : *
3842 : * This is done to prevent deadlocks. For example when COWing a node from the
3843 : * extent btree we are holding a write lock on the node's parent and if we
3844 : * trigger chunk allocation and attempted to insert the new block group item
3845 : * in the extent btree right way, we could deadlock because the path for the
3846 : * insertion can include that parent node. At first glance it seems impossible
3847 : * to trigger chunk allocation after starting a transaction since tasks should
3848 : * reserve enough transaction units (metadata space), however while that is true
3849 : * most of the time, chunk allocation may still be triggered for several reasons:
3850 : *
3851 : * 1) When reserving metadata, we check if there is enough free space in the
3852 : * metadata space_info and therefore don't trigger allocation of a new chunk.
3853 : * However later when the task actually tries to COW an extent buffer from
3854 : * the extent btree or from the device btree for example, it is forced to
3855 : * allocate a new block group (chunk) because the only one that had enough
3856 : * free space was just turned to RO mode by a running scrub for example (or
3857 : * device replace, block group reclaim thread, etc), so we can not use it
3858 : * for allocating an extent and end up being forced to allocate a new one;
3859 : *
3860 : * 2) Because we only check that the metadata space_info has enough free bytes,
3861 : * we end up not allocating a new metadata chunk in that case. However if
3862 : * the filesystem was mounted in degraded mode, none of the existing block
3863 : * groups might be suitable for extent allocation due to their incompatible
3864 : * profile (for e.g. mounting a 2 devices filesystem, where all block groups
3865 : * use a RAID1 profile, in degraded mode using a single device). In this case
3866 : * when the task attempts to COW some extent buffer of the extent btree for
3867 : * example, it will trigger allocation of a new metadata block group with a
3868 : * suitable profile (SINGLE profile in the example of the degraded mount of
3869 : * the RAID1 filesystem);
3870 : *
3871 : * 3) The task has reserved enough transaction units / metadata space, but when
3872 : * it attempts to COW an extent buffer from the extent or device btree for
3873 : * example, it does not find any free extent in any metadata block group,
3874 : * therefore forced to try to allocate a new metadata block group.
3875 : * This is because some other task allocated all available extents in the
3876 : * meanwhile - this typically happens with tasks that don't reserve space
3877 : * properly, either intentionally or as a bug. One example where this is
3878 : * done intentionally is fsync, as it does not reserve any transaction units
3879 : * and ends up allocating a variable number of metadata extents for log
3880 : * tree extent buffers;
3881 : *
3882 : * 4) The task has reserved enough transaction units / metadata space, but right
3883 : * before it tries to allocate the last extent buffer it needs, a discard
3884 : * operation comes in and, temporarily, removes the last free space entry from
3885 : * the only metadata block group that had free space (discard starts by
3886 : * removing a free space entry from a block group, then does the discard
3887 : * operation and, once it's done, it adds back the free space entry to the
3888 : * block group).
3889 : *
3890 : * We also need this 2 phases setup when adding a device to a filesystem with
3891 : * a seed device - we must create new metadata and system chunks without adding
3892 : * any of the block group items to the chunk, extent and device btrees. If we
3893 : * did not do it this way, we would get ENOSPC when attempting to update those
3894 : * btrees, since all the chunks from the seed device are read-only.
3895 : *
3896 : * Phase 1 does the updates and insertions to the chunk btree because if we had
3897 : * it done in phase 2 and have a thundering herd of tasks allocating chunks in
3898 : * parallel, we risk having too many system chunks allocated by many tasks if
3899 : * many tasks reach phase 1 without the previous ones completing phase 2. In the
3900 : * extreme case this leads to exhaustion of the system chunk array in the
3901 : * superblock. This is easier to trigger if using a btree node/leaf size of 64K
3902 : * and with RAID filesystems (so we have more device items in the chunk btree).
3903 : * This has happened before and commit eafa4fd0ad0607 ("btrfs: fix exhaustion of
3904 : * the system chunk array due to concurrent allocations") provides more details.
3905 : *
3906 : * Allocation of system chunks does not happen through this function. A task that
3907 : * needs to update the chunk btree (the only btree that uses system chunks), must
3908 : * preallocate chunk space by calling either check_system_chunk() or
3909 : * btrfs_reserve_chunk_metadata() - the former is used when allocating a data or
3910 : * metadata chunk or when removing a chunk, while the later is used before doing
3911 : * a modification to the chunk btree - use cases for the later are adding,
3912 : * removing and resizing a device as well as relocation of a system chunk.
3913 : * See the comment below for more details.
3914 : *
3915 : * The reservation of system space, done through check_system_chunk(), as well
3916 : * as all the updates and insertions into the chunk btree must be done while
3917 : * holding fs_info->chunk_mutex. This is important to guarantee that while COWing
3918 : * an extent buffer from the chunks btree we never trigger allocation of a new
3919 : * system chunk, which would result in a deadlock (trying to lock twice an
3920 : * extent buffer of the chunk btree, first time before triggering the chunk
3921 : * allocation and the second time during chunk allocation while attempting to
3922 : * update the chunks btree). The system chunk array is also updated while holding
3923 : * that mutex. The same logic applies to removing chunks - we must reserve system
3924 : * space, update the chunk btree and the system chunk array in the superblock
3925 : * while holding fs_info->chunk_mutex.
3926 : *
3927 : * This function, btrfs_chunk_alloc(), belongs to phase 1.
3928 : *
3929 : * If @force is CHUNK_ALLOC_FORCE:
3930 : * - return 1 if it successfully allocates a chunk,
3931 : * - return errors including -ENOSPC otherwise.
3932 : * If @force is NOT CHUNK_ALLOC_FORCE:
3933 : * - return 0 if it doesn't need to allocate a new chunk,
3934 : * - return 1 if it successfully allocates a chunk,
3935 : * - return errors including -ENOSPC otherwise.
3936 : */
3937 264286 : int btrfs_chunk_alloc(struct btrfs_trans_handle *trans, u64 flags,
3938 : enum btrfs_chunk_alloc_enum force)
3939 : {
3940 264286 : struct btrfs_fs_info *fs_info = trans->fs_info;
3941 264286 : struct btrfs_space_info *space_info;
3942 264286 : struct btrfs_block_group *ret_bg;
3943 264286 : bool wait_for_alloc = false;
3944 264286 : bool should_alloc = false;
3945 264286 : bool from_extent_allocation = false;
3946 264286 : int ret = 0;
3947 :
3948 264286 : if (force == CHUNK_ALLOC_FORCE_FOR_EXTENT) {
3949 42389 : from_extent_allocation = true;
3950 42389 : force = CHUNK_ALLOC_FORCE;
3951 : }
3952 :
3953 : /* Don't re-enter if we're already allocating a chunk */
3954 264286 : if (trans->allocating_chunk)
3955 : return -ENOSPC;
3956 : /*
3957 : * Allocation of system chunks can not happen through this path, as we
3958 : * could end up in a deadlock if we are allocating a data or metadata
3959 : * chunk and there is another task modifying the chunk btree.
3960 : *
3961 : * This is because while we are holding the chunk mutex, we will attempt
3962 : * to add the new chunk item to the chunk btree or update an existing
3963 : * device item in the chunk btree, while the other task that is modifying
3964 : * the chunk btree is attempting to COW an extent buffer while holding a
3965 : * lock on it and on its parent - if the COW operation triggers a system
3966 : * chunk allocation, then we can deadlock because we are holding the
3967 : * chunk mutex and we may need to access that extent buffer or its parent
3968 : * in order to add the chunk item or update a device item.
3969 : *
3970 : * Tasks that want to modify the chunk tree should reserve system space
3971 : * before updating the chunk btree, by calling either
3972 : * btrfs_reserve_chunk_metadata() or check_system_chunk().
3973 : * It's possible that after a task reserves the space, it still ends up
3974 : * here - this happens in the cases described above at do_chunk_alloc().
3975 : * The task will have to either retry or fail.
3976 : */
3977 264286 : if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3978 : return -ENOSPC;
3979 :
3980 264286 : space_info = btrfs_find_space_info(fs_info, flags);
3981 264286 : ASSERT(space_info);
3982 :
3983 264286 : do {
3984 264286 : spin_lock(&space_info->lock);
3985 264287 : if (force < space_info->force_alloc)
3986 : force = space_info->force_alloc;
3987 264287 : should_alloc = should_alloc_chunk(fs_info, space_info, force);
3988 264287 : if (space_info->full) {
3989 : /* No more free physical space */
3990 244302 : if (should_alloc)
3991 : ret = -ENOSPC;
3992 : else
3993 8601 : ret = 0;
3994 244302 : spin_unlock(&space_info->lock);
3995 244302 : return ret;
3996 19985 : } else if (!should_alloc) {
3997 18600 : spin_unlock(&space_info->lock);
3998 18600 : return 0;
3999 1385 : } else if (space_info->chunk_alloc) {
4000 : /*
4001 : * Someone is already allocating, so we need to block
4002 : * until this someone is finished and then loop to
4003 : * recheck if we should continue with our allocation
4004 : * attempt.
4005 : */
4006 0 : wait_for_alloc = true;
4007 0 : force = CHUNK_ALLOC_NO_FORCE;
4008 0 : spin_unlock(&space_info->lock);
4009 0 : mutex_lock(&fs_info->chunk_mutex);
4010 0 : mutex_unlock(&fs_info->chunk_mutex);
4011 : } else {
4012 : /* Proceed with allocation */
4013 1385 : space_info->chunk_alloc = 1;
4014 1385 : wait_for_alloc = false;
4015 1385 : spin_unlock(&space_info->lock);
4016 : }
4017 :
4018 1385 : cond_resched();
4019 1385 : } while (wait_for_alloc);
4020 :
4021 1385 : mutex_lock(&fs_info->chunk_mutex);
4022 1385 : trans->allocating_chunk = true;
4023 :
4024 : /*
4025 : * If we have mixed data/metadata chunks we want to make sure we keep
4026 : * allocating mixed chunks instead of individual chunks.
4027 : */
4028 1385 : if (btrfs_mixed_space_info(space_info))
4029 141 : flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA);
4030 :
4031 : /*
4032 : * if we're doing a data chunk, go ahead and make sure that
4033 : * we keep a reasonable number of metadata chunks allocated in the
4034 : * FS as well.
4035 : */
4036 1385 : if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) {
4037 0 : fs_info->data_chunk_allocations++;
4038 0 : if (!(fs_info->data_chunk_allocations %
4039 : fs_info->metadata_ratio))
4040 0 : force_metadata_allocation(fs_info);
4041 : }
4042 :
4043 1385 : ret_bg = do_chunk_alloc(trans, flags);
4044 1385 : trans->allocating_chunk = false;
4045 :
4046 1385 : if (IS_ERR(ret_bg)) {
4047 47 : ret = PTR_ERR(ret_bg);
4048 : } else if (from_extent_allocation) {
4049 : /*
4050 : * New block group is likely to be used soon. Try to activate
4051 : * it now. Failure is OK for now.
4052 : */
4053 : btrfs_zone_activate(ret_bg);
4054 : }
4055 :
4056 47 : if (!ret)
4057 1338 : btrfs_put_block_group(ret_bg);
4058 :
4059 1385 : spin_lock(&space_info->lock);
4060 1385 : if (ret < 0) {
4061 47 : if (ret == -ENOSPC)
4062 47 : space_info->full = 1;
4063 : else
4064 0 : goto out;
4065 : } else {
4066 1338 : ret = 1;
4067 1338 : space_info->max_extent_size = 0;
4068 : }
4069 :
4070 1385 : space_info->force_alloc = CHUNK_ALLOC_NO_FORCE;
4071 1385 : out:
4072 1385 : space_info->chunk_alloc = 0;
4073 1385 : spin_unlock(&space_info->lock);
4074 1385 : mutex_unlock(&fs_info->chunk_mutex);
4075 :
4076 1385 : return ret;
4077 : }
4078 :
4079 1992 : static u64 get_profile_num_devs(struct btrfs_fs_info *fs_info, u64 type)
4080 : {
4081 1992 : u64 num_dev;
4082 :
4083 1992 : num_dev = btrfs_raid_array[btrfs_bg_flags_to_raid_index(type)].devs_max;
4084 1992 : if (!num_dev)
4085 0 : num_dev = fs_info->fs_devices->rw_devices;
4086 :
4087 1992 : return num_dev;
4088 : }
4089 :
4090 2052 : static void reserve_chunk_space(struct btrfs_trans_handle *trans,
4091 : u64 bytes,
4092 : u64 type)
4093 : {
4094 2052 : struct btrfs_fs_info *fs_info = trans->fs_info;
4095 2052 : struct btrfs_space_info *info;
4096 2052 : u64 left;
4097 2052 : int ret = 0;
4098 :
4099 : /*
4100 : * Needed because we can end up allocating a system chunk and for an
4101 : * atomic and race free space reservation in the chunk block reserve.
4102 : */
4103 2052 : lockdep_assert_held(&fs_info->chunk_mutex);
4104 :
4105 2052 : info = btrfs_find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM);
4106 2052 : spin_lock(&info->lock);
4107 2052 : left = info->total_bytes - btrfs_space_info_used(info, true);
4108 2052 : spin_unlock(&info->lock);
4109 :
4110 2052 : if (left < bytes && btrfs_test_opt(fs_info, ENOSPC_DEBUG)) {
4111 0 : btrfs_info(fs_info, "left=%llu, need=%llu, flags=%llu",
4112 : left, bytes, type);
4113 0 : btrfs_dump_space_info(fs_info, info, 0, 0);
4114 : }
4115 :
4116 2052 : if (left < bytes) {
4117 90 : u64 flags = btrfs_system_alloc_profile(fs_info);
4118 90 : struct btrfs_block_group *bg;
4119 :
4120 : /*
4121 : * Ignore failure to create system chunk. We might end up not
4122 : * needing it, as we might not need to COW all nodes/leafs from
4123 : * the paths we visit in the chunk tree (they were already COWed
4124 : * or created in the current transaction for example).
4125 : */
4126 90 : bg = btrfs_create_chunk(trans, flags);
4127 90 : if (IS_ERR(bg)) {
4128 0 : ret = PTR_ERR(bg);
4129 : } else {
4130 : /*
4131 : * We have a new chunk. We also need to activate it for
4132 : * zoned filesystem.
4133 : */
4134 90 : ret = btrfs_zoned_activate_one_bg(fs_info, info, true);
4135 90 : if (ret < 0)
4136 : return;
4137 :
4138 : /*
4139 : * If we fail to add the chunk item here, we end up
4140 : * trying again at phase 2 of chunk allocation, at
4141 : * btrfs_create_pending_block_groups(). So ignore
4142 : * any error here. An ENOSPC here could happen, due to
4143 : * the cases described at do_chunk_alloc() - the system
4144 : * block group we just created was just turned into RO
4145 : * mode by a scrub for example, or a running discard
4146 : * temporarily removed its free space entries, etc.
4147 : */
4148 90 : btrfs_chunk_alloc_add_chunk_item(trans, bg);
4149 : }
4150 : }
4151 :
4152 90 : if (!ret) {
4153 2052 : ret = btrfs_block_rsv_add(fs_info,
4154 : &fs_info->chunk_block_rsv,
4155 : bytes, BTRFS_RESERVE_NO_FLUSH);
4156 2052 : if (!ret)
4157 2052 : trans->chunk_bytes_reserved += bytes;
4158 : }
4159 : }
4160 :
4161 : /*
4162 : * Reserve space in the system space for allocating or removing a chunk.
4163 : * The caller must be holding fs_info->chunk_mutex.
4164 : */
4165 1992 : void check_system_chunk(struct btrfs_trans_handle *trans, u64 type)
4166 : {
4167 1992 : struct btrfs_fs_info *fs_info = trans->fs_info;
4168 1992 : const u64 num_devs = get_profile_num_devs(fs_info, type);
4169 1992 : u64 bytes;
4170 :
4171 : /* num_devs device items to update and 1 chunk item to add or remove. */
4172 1992 : bytes = btrfs_calc_metadata_size(fs_info, num_devs) +
4173 : btrfs_calc_insert_metadata_size(fs_info, 1);
4174 :
4175 1992 : reserve_chunk_space(trans, bytes, type);
4176 1992 : }
4177 :
4178 : /*
4179 : * Reserve space in the system space, if needed, for doing a modification to the
4180 : * chunk btree.
4181 : *
4182 : * @trans: A transaction handle.
4183 : * @is_item_insertion: Indicate if the modification is for inserting a new item
4184 : * in the chunk btree or if it's for the deletion or update
4185 : * of an existing item.
4186 : *
4187 : * This is used in a context where we need to update the chunk btree outside
4188 : * block group allocation and removal, to avoid a deadlock with a concurrent
4189 : * task that is allocating a metadata or data block group and therefore needs to
4190 : * update the chunk btree while holding the chunk mutex. After the update to the
4191 : * chunk btree is done, btrfs_trans_release_chunk_metadata() should be called.
4192 : *
4193 : */
4194 60 : void btrfs_reserve_chunk_metadata(struct btrfs_trans_handle *trans,
4195 : bool is_item_insertion)
4196 : {
4197 60 : struct btrfs_fs_info *fs_info = trans->fs_info;
4198 60 : u64 bytes;
4199 :
4200 60 : if (is_item_insertion)
4201 0 : bytes = btrfs_calc_insert_metadata_size(fs_info, 1);
4202 : else
4203 60 : bytes = btrfs_calc_metadata_size(fs_info, 1);
4204 :
4205 60 : mutex_lock(&fs_info->chunk_mutex);
4206 60 : reserve_chunk_space(trans, bytes, BTRFS_BLOCK_GROUP_SYSTEM);
4207 60 : mutex_unlock(&fs_info->chunk_mutex);
4208 60 : }
4209 :
4210 3212 : void btrfs_put_block_group_cache(struct btrfs_fs_info *info)
4211 : {
4212 3212 : struct btrfs_block_group *block_group;
4213 :
4214 3212 : block_group = btrfs_lookup_first_block_group(info, 0);
4215 24902 : while (block_group) {
4216 21690 : btrfs_wait_block_group_cache_done(block_group);
4217 21690 : spin_lock(&block_group->lock);
4218 21690 : if (test_and_clear_bit(BLOCK_GROUP_FLAG_IREF,
4219 21690 : &block_group->runtime_flags)) {
4220 6 : struct inode *inode = block_group->inode;
4221 :
4222 6 : block_group->inode = NULL;
4223 6 : spin_unlock(&block_group->lock);
4224 :
4225 6 : ASSERT(block_group->io_ctl.inode == NULL);
4226 6 : iput(inode);
4227 : } else {
4228 21684 : spin_unlock(&block_group->lock);
4229 : }
4230 21690 : block_group = btrfs_next_block_group(block_group);
4231 : }
4232 3212 : }
4233 :
4234 : /*
4235 : * Must be called only after stopping all workers, since we could have block
4236 : * group caching kthreads running, and therefore they could race with us if we
4237 : * freed the block groups before stopping them.
4238 : */
4239 3213 : int btrfs_free_block_groups(struct btrfs_fs_info *info)
4240 : {
4241 3213 : struct btrfs_block_group *block_group;
4242 3213 : struct btrfs_space_info *space_info;
4243 3213 : struct btrfs_caching_control *caching_ctl;
4244 3213 : struct rb_node *n;
4245 :
4246 3213 : write_lock(&info->block_group_cache_lock);
4247 8818 : while (!list_empty(&info->caching_block_groups)) {
4248 5605 : caching_ctl = list_entry(info->caching_block_groups.next,
4249 : struct btrfs_caching_control, list);
4250 5605 : list_del(&caching_ctl->list);
4251 5605 : btrfs_put_caching_control(caching_ctl);
4252 : }
4253 3213 : write_unlock(&info->block_group_cache_lock);
4254 :
4255 3213 : spin_lock(&info->unused_bgs_lock);
4256 3488 : while (!list_empty(&info->unused_bgs)) {
4257 275 : block_group = list_first_entry(&info->unused_bgs,
4258 : struct btrfs_block_group,
4259 : bg_list);
4260 275 : list_del_init(&block_group->bg_list);
4261 275 : btrfs_put_block_group(block_group);
4262 : }
4263 :
4264 3213 : while (!list_empty(&info->reclaim_bgs)) {
4265 0 : block_group = list_first_entry(&info->reclaim_bgs,
4266 : struct btrfs_block_group,
4267 : bg_list);
4268 0 : list_del_init(&block_group->bg_list);
4269 0 : btrfs_put_block_group(block_group);
4270 : }
4271 3213 : spin_unlock(&info->unused_bgs_lock);
4272 :
4273 3213 : spin_lock(&info->zone_active_bgs_lock);
4274 3213 : while (!list_empty(&info->zone_active_bgs)) {
4275 0 : block_group = list_first_entry(&info->zone_active_bgs,
4276 : struct btrfs_block_group,
4277 : active_bg_list);
4278 0 : list_del_init(&block_group->active_bg_list);
4279 0 : btrfs_put_block_group(block_group);
4280 : }
4281 3213 : spin_unlock(&info->zone_active_bgs_lock);
4282 :
4283 3213 : write_lock(&info->block_group_cache_lock);
4284 24903 : while ((n = rb_last(&info->block_group_cache_tree.rb_root)) != NULL) {
4285 21690 : block_group = rb_entry(n, struct btrfs_block_group,
4286 : cache_node);
4287 21690 : rb_erase_cached(&block_group->cache_node,
4288 : &info->block_group_cache_tree);
4289 21690 : RB_CLEAR_NODE(&block_group->cache_node);
4290 21690 : write_unlock(&info->block_group_cache_lock);
4291 :
4292 21690 : down_write(&block_group->space_info->groups_sem);
4293 21690 : list_del(&block_group->list);
4294 21690 : up_write(&block_group->space_info->groups_sem);
4295 :
4296 : /*
4297 : * We haven't cached this block group, which means we could
4298 : * possibly have excluded extents on this block group.
4299 : */
4300 21690 : if (block_group->cached == BTRFS_CACHE_NO ||
4301 : block_group->cached == BTRFS_CACHE_ERROR)
4302 5435 : btrfs_free_excluded_extents(block_group);
4303 :
4304 21690 : btrfs_remove_free_space_cache(block_group);
4305 21690 : ASSERT(block_group->cached != BTRFS_CACHE_STARTED);
4306 21690 : ASSERT(list_empty(&block_group->dirty_list));
4307 21690 : ASSERT(list_empty(&block_group->io_list));
4308 21690 : ASSERT(list_empty(&block_group->bg_list));
4309 21690 : ASSERT(refcount_read(&block_group->refs) == 1);
4310 21690 : ASSERT(block_group->swap_extents == 0);
4311 21690 : btrfs_put_block_group(block_group);
4312 :
4313 21690 : write_lock(&info->block_group_cache_lock);
4314 : }
4315 3213 : write_unlock(&info->block_group_cache_lock);
4316 :
4317 3213 : btrfs_release_global_block_rsv(info);
4318 :
4319 12819 : while (!list_empty(&info->space_info)) {
4320 9606 : space_info = list_entry(info->space_info.next,
4321 : struct btrfs_space_info,
4322 : list);
4323 :
4324 : /*
4325 : * Do not hide this behind enospc_debug, this is actually
4326 : * important and indicates a real bug if this happens.
4327 : */
4328 19212 : if (WARN_ON(space_info->bytes_pinned > 0 ||
4329 : space_info->bytes_may_use > 0))
4330 0 : btrfs_dump_space_info(info, space_info, 0, 0);
4331 :
4332 : /*
4333 : * If there was a failure to cleanup a log tree, very likely due
4334 : * to an IO failure on a writeback attempt of one or more of its
4335 : * extent buffers, we could not do proper (and cheap) unaccounting
4336 : * of their reserved space, so don't warn on bytes_reserved > 0 in
4337 : * that case.
4338 : */
4339 9606 : if (!(space_info->flags & BTRFS_BLOCK_GROUP_METADATA) ||
4340 3212 : !BTRFS_FS_LOG_CLEANUP_ERROR(info)) {
4341 9605 : if (WARN_ON(space_info->bytes_reserved > 0))
4342 0 : btrfs_dump_space_info(info, space_info, 0, 0);
4343 : }
4344 :
4345 9606 : WARN_ON(space_info->reclaim_size > 0);
4346 9606 : list_del(&space_info->list);
4347 9606 : btrfs_sysfs_remove_space_info(space_info);
4348 : }
4349 3213 : return 0;
4350 : }
4351 :
4352 6426 : void btrfs_freeze_block_group(struct btrfs_block_group *cache)
4353 : {
4354 6426 : atomic_inc(&cache->frozen);
4355 0 : }
4356 :
4357 6426 : void btrfs_unfreeze_block_group(struct btrfs_block_group *block_group)
4358 : {
4359 6426 : struct btrfs_fs_info *fs_info = block_group->fs_info;
4360 6426 : struct extent_map_tree *em_tree;
4361 6426 : struct extent_map *em;
4362 6426 : bool cleanup;
4363 :
4364 6426 : spin_lock(&block_group->lock);
4365 12597 : cleanup = (atomic_dec_and_test(&block_group->frozen) &&
4366 6171 : test_bit(BLOCK_GROUP_FLAG_REMOVED, &block_group->runtime_flags));
4367 6426 : spin_unlock(&block_group->lock);
4368 :
4369 6426 : if (cleanup) {
4370 0 : em_tree = &fs_info->mapping_tree;
4371 0 : write_lock(&em_tree->lock);
4372 0 : em = lookup_extent_mapping(em_tree, block_group->start,
4373 : 1);
4374 0 : BUG_ON(!em); /* logic error, can't happen */
4375 0 : remove_extent_mapping(em_tree, em);
4376 0 : write_unlock(&em_tree->lock);
4377 :
4378 : /* once for us and once for the tree */
4379 0 : free_extent_map(em);
4380 0 : free_extent_map(em);
4381 :
4382 : /*
4383 : * We may have left one free space entry and other possible
4384 : * tasks trimming this block group have left 1 entry each one.
4385 : * Free them if any.
4386 : */
4387 0 : btrfs_remove_free_space_cache(block_group);
4388 : }
4389 6426 : }
4390 :
4391 553 : bool btrfs_inc_block_group_swap_extents(struct btrfs_block_group *bg)
4392 : {
4393 553 : bool ret = true;
4394 :
4395 553 : spin_lock(&bg->lock);
4396 553 : if (bg->ro)
4397 : ret = false;
4398 : else
4399 553 : bg->swap_extents++;
4400 553 : spin_unlock(&bg->lock);
4401 :
4402 553 : return ret;
4403 : }
4404 :
4405 40 : void btrfs_dec_block_group_swap_extents(struct btrfs_block_group *bg, int amount)
4406 : {
4407 40 : spin_lock(&bg->lock);
4408 40 : ASSERT(!bg->ro);
4409 40 : ASSERT(bg->swap_extents >= amount);
4410 40 : bg->swap_extents -= amount;
4411 40 : spin_unlock(&bg->lock);
4412 40 : }
4413 :
4414 12364796 : enum btrfs_block_group_size_class btrfs_calc_block_group_size_class(u64 size)
4415 : {
4416 15845940 : if (size <= SZ_128K)
4417 : return BTRFS_BG_SZ_SMALL;
4418 144990 : if (size <= SZ_8M)
4419 133242 : return BTRFS_BG_SZ_MEDIUM;
4420 : return BTRFS_BG_SZ_LARGE;
4421 : }
4422 :
4423 : /*
4424 : * Handle a block group allocating an extent in a size class
4425 : *
4426 : * @bg: The block group we allocated in.
4427 : * @size_class: The size class of the allocation.
4428 : * @force_wrong_size_class: Whether we are desperate enough to allow
4429 : * mismatched size classes.
4430 : *
4431 : * Returns: 0 if the size class was valid for this block_group, -EAGAIN in the
4432 : * case of a race that leads to the wrong size class without
4433 : * force_wrong_size_class set.
4434 : *
4435 : * find_free_extent will skip block groups with a mismatched size class until
4436 : * it really needs to avoid ENOSPC. In that case it will set
4437 : * force_wrong_size_class. However, if a block group is newly allocated and
4438 : * doesn't yet have a size class, then it is possible for two allocations of
4439 : * different sizes to race and both try to use it. The loser is caught here and
4440 : * has to retry.
4441 : */
4442 0 : int btrfs_use_block_group_size_class(struct btrfs_block_group *bg,
4443 : enum btrfs_block_group_size_class size_class,
4444 : bool force_wrong_size_class)
4445 : {
4446 3475425 : ASSERT(size_class != BTRFS_BG_SZ_NONE);
4447 :
4448 : /* The new allocation is in the right size class, do nothing */
4449 3475425 : if (bg->size_class == size_class)
4450 : return 0;
4451 : /*
4452 : * The new allocation is in a mismatched size class.
4453 : * This means one of two things:
4454 : *
4455 : * 1. Two tasks in find_free_extent for different size_classes raced
4456 : * and hit the same empty block_group. Make the loser try again.
4457 : * 2. A call to find_free_extent got desperate enough to set
4458 : * 'force_wrong_slab'. Don't change the size_class, but allow the
4459 : * allocation.
4460 : */
4461 39463 : if (bg->size_class != BTRFS_BG_SZ_NONE) {
4462 37883 : if (force_wrong_size_class)
4463 : return 0;
4464 0 : return -EAGAIN;
4465 : }
4466 : /*
4467 : * The happy new block group case: the new allocation is the first
4468 : * one in the block_group so we set size_class.
4469 : */
4470 1580 : bg->size_class = size_class;
4471 :
4472 1580 : return 0;
4473 : }
4474 :
4475 23687959 : bool btrfs_block_group_should_use_size_class(struct btrfs_block_group *bg)
4476 : {
4477 36049053 : if (btrfs_is_zoned(bg->fs_info))
4478 : return false;
4479 36049053 : if (!btrfs_is_block_group_data_only(bg))
4480 10184103 : return false;
4481 : return true;
4482 : }
|
