Home
last modified time | relevance | path

Searched refs:block_tree (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/fs/btrfs/
H A Dref-verify.h20 fs_info->block_tree = RB_ROOT; in btrfs_init_ref_verify()
H A Dref-verify.c281 exist = insert_block_entry(&fs_info->block_tree, be); in add_block_entry()
798 be = lookup_block_entry(&fs_info->block_tree, bytenr); in btrfs_ref_tree_mod()
919 while ((n = rb_first(&fs_info->block_tree))) { in btrfs_free_ref_cache()
921 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_cache()
938 n = fs_info->block_tree.rb_node; in btrfs_free_ref_tree_range()
986 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_tree_range()
H A Dctree.h962 struct rb_root block_tree; member
/kernel/linux/linux-6.6/fs/btrfs/
H A Dref-verify.h20 fs_info->block_tree = RB_ROOT; in btrfs_init_ref_verify()
H A Dref-verify.c284 exist = insert_block_entry(&fs_info->block_tree, be); in add_block_entry()
786 be = lookup_block_entry(&fs_info->block_tree, bytenr); in btrfs_ref_tree_mod()
906 while ((n = rb_first(&fs_info->block_tree))) { in btrfs_free_ref_cache()
908 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_cache()
925 n = fs_info->block_tree.rb_node; in btrfs_free_ref_tree_range()
973 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_tree_range()
H A Dfs.h803 struct rb_root block_tree; member

Completed in 11 milliseconds