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

/linux-master/fs/btrfs/
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,
705 * are completely free and ready for the unused_bgs path. As discarding will
708 * way to the unused_bgs lis
[all...]
H A Dblock-group.c1455 * Process the unused_bgs list and remove any that don't have any allocated
1481 while (!list_empty(&fs_info->unused_bgs)) {
1485 block_group = list_first_entry(&fs_info->unused_bgs,
1505 * to the unused_bgs code path. Therefore, if it's not fully
1567 * fs_info->unused_bgs list.
1690 * fs_info->unused_bgs, so use a list_move operation
1704 list_splice_tail(&retry_list, &fs_info->unused_bgs);
1712 list_splice_tail(&retry_list, &fs_info->unused_bgs);
1727 list_add_tail(&bg->bg_list, &fs_info->unused_bgs);
1731 list_move_tail(&bg->bg_list, &fs_info->unused_bgs);
[all...]
H A Dfs.h776 /* Protects the lists unused_bgs and reclaim_bgs. */
779 struct list_head unused_bgs; member in struct:btrfs_fs_info
H A Ddisk-io.c2747 INIT_LIST_HEAD(&fs_info->unused_bgs);

Completed in 161 milliseconds