Home
last modified time | relevance | path

Searched refs:cache_node (Results 1 – 5 of 5) sorted by relevance

/fs/btrfs/
A Dblock-group.c193 rb_entry(new, struct btrfs_block_group, cache_node); in btrfs_bg_start_cmp()
195 rb_entry(exist, struct btrfs_block_group, cache_node); in btrfs_bg_start_cmp()
217 exist = rb_find_add_cached(&block_group->cache_node, in btrfs_add_block_group_cache()
241 cache = rb_entry(n, struct btrfs_block_group, cache_node); in block_group_cache_tree_search()
294 if (RB_EMPTY_NODE(&cache->cache_node)) { in btrfs_next_block_group()
301 node = rb_next(&cache->cache_node); in btrfs_next_block_group()
1158 rb_erase_cached(&block_group->cache_node, in btrfs_remove_block_group()
1160 RB_CLEAR_NODE(&block_group->cache_node); in btrfs_remove_block_group()
4536 cache_node); in btrfs_free_block_groups()
4537 rb_erase_cached(&block_group->cache_node, in btrfs_free_block_groups()
[all …]
A Dblock-group.h176 struct rb_node cache_node; member
A Dfree-space-tree.c1198 cache_node); in btrfs_create_free_space_tree()
1264 bg = rb_entry(node, struct btrfs_block_group, cache_node); in clear_free_space_tree()
1358 cache_node); in btrfs_rebuild_free_space_tree()
A Dfree-space-cache.c4115 block_group = rb_entry(node, struct btrfs_block_group, cache_node); in cleanup_free_space_cache_v1()
A Dextent-tree.c2585 bg = rb_entry(leftmost, struct btrfs_block_group, cache_node); in first_logical_byte()

Completed in 60 milliseconds