Home
last modified time | relevance | path

Searched refs:unused_bgs (Results 1 - 8 of 8) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dblock-group.c1465 * Process the unused_bgs list and remove any that don't have any allocated
1491 while (!list_empty(&fs_info->unused_bgs)) { in btrfs_delete_unused_bgs()
1495 block_group = list_first_entry(&fs_info->unused_bgs, in btrfs_delete_unused_bgs()
1515 * to the unused_bgs code path. Therefore, if it's not fully in btrfs_delete_unused_bgs()
1569 * fs_info->unused_bgs list. in btrfs_delete_unused_bgs()
1692 * fs_info->unused_bgs, so use a list_move operation in btrfs_delete_unused_bgs()
1706 list_splice_tail(&retry_list, &fs_info->unused_bgs); in btrfs_delete_unused_bgs()
1714 list_splice_tail(&retry_list, &fs_info->unused_bgs); in btrfs_delete_unused_bgs()
1729 list_add_tail(&bg->bg_list, &fs_info->unused_bgs); in btrfs_mark_bg_unused()
1733 list_move_tail(&bg->bg_list, &fs_info->unused_bgs); in btrfs_mark_bg_unused()
[all...]
H A Dfs.h722 struct list_head unused_bgs; member
H A Ddiscard.c35 * being added to the unused_bgs list, we add it to this first list. Then
36 * from there, if it becomes fully discarded, we place it onto the unused_bgs
455 * unused and send it to the unused_bgs path. Otherwise, pass it onto the
480 * bitmaps. Completely discarded block groups are sent to the unused_bgs path.
670 * Punt unused_bgs list to discard lists.
674 * The unused_bgs list needs to be punted to the discard lists because the
678 * it must be done before going down the unused_bgs path.
686 list_for_each_entry_safe(block_group, next, &fs_info->unused_bgs, in btrfs_discard_punt_unused_bgs_list()
705 * are completely free and ready for the unused_bgs path. As discarding will
708 * way to the unused_bgs lis
[all...]
H A Ddisk-io.c2708 INIT_LIST_HEAD(&fs_info->unused_bgs); in btrfs_init_fs_info()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dblock-group.c1342 * Process the unused_bgs list and remove any that don't have any allocated
1357 while (!list_empty(&fs_info->unused_bgs)) { in btrfs_delete_unused_bgs()
1360 block_group = list_first_entry(&fs_info->unused_bgs, in btrfs_delete_unused_bgs()
1382 * to the unused_bgs code path. Therefore, if it's not fully in btrfs_delete_unused_bgs()
1509 * fs_info->unused_bgs, so use a list_move operation in btrfs_delete_unused_bgs()
1542 list_add_tail(&bg->bg_list, &fs_info->unused_bgs); in btrfs_mark_bg_unused()
3351 while (!list_empty(&info->unused_bgs)) { in btrfs_free_block_groups()
3352 block_group = list_first_entry(&info->unused_bgs, in btrfs_free_block_groups()
H A Ddiscard.c34 * being added to the unused_bgs list, we add it to this first list. Then
35 * from there, if it becomes fully discarded, we place it onto the unused_bgs
400 * mark it unused and send it to the unused_bgs path. Otherwise, pass it onto
424 * bitmaps. Completely discarded block groups are sent to the unused_bgs path.
610 * btrfs_discard_punt_unused_bgs_list - punt unused_bgs list to discard lists
613 * The unused_bgs list needs to be punted to the discard lists because the
617 * it must be done before going down the unused_bgs path.
625 list_for_each_entry_safe(block_group, next, &fs_info->unused_bgs, in btrfs_discard_punt_unused_bgs_list()
639 * are completely free and ready for the unused_bgs path. As discarding will
642 * way to the unused_bgs lis
[all...]
H A Dctree.h936 struct list_head unused_bgs; member
H A Ddisk-io.c2765 INIT_LIST_HEAD(&fs_info->unused_bgs); in btrfs_init_fs_info()

Completed in 27 milliseconds