Lines Matching refs:rb_node

253 static int prelim_ref_rb_add_cmp(const struct rb_node *new,  in prelim_ref_rb_add_cmp()
254 const struct rb_node *exist) in prelim_ref_rb_add_cmp()
296 struct rb_node *exist; in prelim_ref_insert()
444 struct rb_node **p = &preftrees->direct.root.rb_root.rb_node; in is_shared_data_backref()
445 struct rb_node *parent = NULL; in is_shared_data_backref()
740 struct rb_node *rnode; in resolve_indirect_refs()
842 struct rb_node *node; in add_missing_keys()
893 struct rb_node *n; in add_delayed_refs()
1389 struct rb_node *node; in find_parent_nodes()
3043 RB_CLEAR_NODE(&node->rb_node); in btrfs_backref_alloc_node()
3116 if (!RB_EMPTY_NODE(&node->rb_node)) in btrfs_backref_drop_node()
3117 rb_erase(&node->rb_node, &tree->rb_root); in btrfs_backref_drop_node()
3155 struct btrfs_backref_node, rb_node))) in btrfs_backref_release_cache()
3191 struct rb_node *rb_node; in handle_direct_tree_backref() local
3220 rb_node = rb_simple_search(&cache->rb_root, ref_key->offset); in handle_direct_tree_backref()
3221 if (!rb_node) { in handle_direct_tree_backref()
3237 upper = rb_entry(rb_node, struct btrfs_backref_node, rb_node); in handle_direct_tree_backref()
3271 struct rb_node *rb_node; in handle_indirect_tree_backref() local
3359 rb_node = rb_simple_search(&cache->rb_root, eb->start); in handle_indirect_tree_backref()
3360 if (!rb_node) { in handle_indirect_tree_backref()
3404 upper = rb_entry(rb_node, struct btrfs_backref_node, in handle_indirect_tree_backref()
3405 rb_node); in handle_indirect_tree_backref()
3413 if (rb_node) { in handle_indirect_tree_backref()
3564 struct rb_node *rb_node; in btrfs_backref_finish_upper_links() local
3569 rb_node = rb_simple_insert(&cache->rb_root, &start->simple_node); in btrfs_backref_finish_upper_links()
3570 if (rb_node) in btrfs_backref_finish_upper_links()
3609 if (!RB_EMPTY_NODE(&upper->rb_node)) { in btrfs_backref_finish_upper_links()
3620 rb_node = rb_simple_insert(&cache->rb_root, &upper->simple_node); in btrfs_backref_finish_upper_links()
3621 if (unlikely(rb_node)) { in btrfs_backref_finish_upper_links()
3664 RB_EMPTY_NODE(&lower->rb_node)) in btrfs_backref_error_cleanup()
3667 if (!RB_EMPTY_NODE(&upper->rb_node)) in btrfs_backref_error_cleanup()