Home
last modified time | relevance | path

Searched refs:bg_list (Results 1 - 16 of 16) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dblock-group.c1497 bg_list); in btrfs_delete_unused_bgs()
1498 list_del_init(&block_group->bg_list); in btrfs_delete_unused_bgs()
1572 list_add_tail(&block_group->bg_list, &retry_list); in btrfs_delete_unused_bgs()
1695 list_move(&block_group->bg_list, in btrfs_delete_unused_bgs()
1726 if (list_empty(&bg->bg_list)) { in btrfs_mark_bg_unused()
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()
1747 bg1 = list_entry(a, struct btrfs_block_group, bg_list); in reclaim_bgs_cmp()
1748 bg2 = list_entry(b, struct btrfs_block_group, bg_list); in reclaim_bgs_cmp()
1820 * The block groups might still be in use and reachable via bg_list, in btrfs_reclaim_bgs_work()
[all...]
H A Ddiscard.c687 bg_list) { in btrfs_discard_punt_unused_bgs_list()
688 list_del_init(&block_group->bg_list); in btrfs_discard_punt_unused_bgs_list()
H A Dblock-group.h180 struct list_head bg_list; member
H A Dtransaction.c166 bg_list); in btrfs_put_transaction()
167 list_del_init(&cache->bg_list); in btrfs_put_transaction()
2084 list_for_each_entry_safe(block_group, tmp, &trans->new_bgs, bg_list) { in btrfs_cleanup_pending_block_groups()
2086 list_del_init(&block_group->bg_list); in btrfs_cleanup_pending_block_groups()
H A Dextent-tree.c2827 list_for_each_entry_safe(block_group, tmp, deleted_bgs, bg_list) { in btrfs_finish_extent_commit()
2837 list_del_init(&block_group->bg_list); in btrfs_finish_extent_commit()
/kernel/linux/linux-5.10/fs/ocfs2/
H A Docfs2_fs.h903 * stored in bg_list. It is a flat list.
906 * bg_list->l_next_free_rec. Only block groups
910 * codifies that limit so that we can fit bg_list.
915 /*140*/ struct ocfs2_extent_list bg_list; member
1324 offsetof(struct ocfs2_group_desc, bg_list.l_recs); in ocfs2_extent_recs_per_gd()
1492 offsetof(struct ocfs2_group_desc, bg_list.l_recs); in ocfs2_extent_recs_per_gd()
1600 offsetof(struct ocfs2_group_desc, bg_list)) in ocfs2_gd_is_discontig()
1604 * bg_bitmap + bg_size == bg_list. in ocfs2_gd_is_discontig()
1606 if (!gd->bg_list.l_next_free_rec) in ocfs2_gd_is_discontig()
H A Dsuballoc.c325 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_bg_discontig_add_extent()
498 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_block_group_grow_discontig()
559 el = &bg->bg_list; in ocfs2_bg_alloc_cleanup()
1658 !bg->bg_list.l_next_free_rec) in ocfs2_bg_discontig_fix_result()
1661 for (i = 0; i < le16_to_cpu(bg->bg_list.l_next_free_rec); i++) { in ocfs2_bg_discontig_fix_result()
1662 rec = &bg->bg_list.l_recs[i]; in ocfs2_bg_discontig_fix_result()
/kernel/linux/linux-6.6/fs/ocfs2/
H A Docfs2_fs.h901 * stored in bg_list. It is a flat list.
904 * bg_list->l_next_free_rec. Only block groups
908 * codifies that limit so that we can fit bg_list.
913 /*140*/ struct ocfs2_extent_list bg_list; member
1322 offsetof(struct ocfs2_group_desc, bg_list.l_recs); in ocfs2_extent_recs_per_gd()
1490 offsetof(struct ocfs2_group_desc, bg_list.l_recs); in ocfs2_extent_recs_per_gd()
1598 offsetof(struct ocfs2_group_desc, bg_list)) in ocfs2_gd_is_discontig()
1602 * bg_bitmap + bg_size == bg_list. in ocfs2_gd_is_discontig()
1604 if (!gd->bg_list.l_next_free_rec) in ocfs2_gd_is_discontig()
H A Dsuballoc.c323 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_bg_discontig_add_extent()
496 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_block_group_grow_discontig()
557 el = &bg->bg_list; in ocfs2_bg_alloc_cleanup()
1656 !bg->bg_list.l_next_free_rec) in ocfs2_bg_discontig_fix_result()
1659 for (i = 0; i < le16_to_cpu(bg->bg_list.l_next_free_rec); i++) { in ocfs2_bg_discontig_fix_result()
1660 rec = &bg->bg_list.l_recs[i]; in ocfs2_bg_discontig_fix_result()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dblock-group.c1362 bg_list); in btrfs_delete_unused_bgs()
1363 list_del_init(&block_group->bg_list); in btrfs_delete_unused_bgs()
1512 list_move(&block_group->bg_list, in btrfs_delete_unused_bgs()
1539 if (list_empty(&bg->bg_list)) { in btrfs_mark_bg_unused()
1542 list_add_tail(&bg->bg_list, &fs_info->unused_bgs); in btrfs_mark_bg_unused()
1821 INIT_LIST_HEAD(&cache->bg_list); in btrfs_create_block_group_cache()
1994 ASSERT(list_empty(&cache->bg_list)); in read_one_block_group()
2122 bg_list); in btrfs_create_pending_block_groups()
2149 list_del_init(&block_group->bg_list); in btrfs_create_pending_block_groups()
2220 list_add_tail(&cache->bg_list, in btrfs_make_block_group()
[all...]
H A Ddiscard.c626 bg_list) { in btrfs_discard_punt_unused_bgs_list()
627 list_del_init(&block_group->bg_list); in btrfs_discard_punt_unused_bgs_list()
H A Dblock-group.h126 struct list_head bg_list; member
H A Dtransaction.c143 bg_list); in btrfs_put_transaction()
144 list_del_init(&cache->bg_list); in btrfs_put_transaction()
2013 list_for_each_entry_safe(block_group, tmp, &trans->new_bgs, bg_list) { in btrfs_cleanup_pending_block_groups()
2015 list_del_init(&block_group->bg_list); in btrfs_cleanup_pending_block_groups()
H A Dextent-tree.c2869 list_for_each_entry_safe(block_group, tmp, deleted_bgs, bg_list) { in btrfs_finish_extent_commit()
2879 list_del_init(&block_group->bg_list); in btrfs_finish_extent_commit()
/kernel/linux/linux-5.10/fs/btrfs/tests/
H A Dbtrfs-tests.c226 INIT_LIST_HEAD(&cache->bg_list); in btrfs_alloc_dummy_block_group()
/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dbtrfs-tests.c236 INIT_LIST_HEAD(&cache->bg_list); in btrfs_alloc_dummy_block_group()

Completed in 41 milliseconds