Lines Matching refs:node
25 struct rb_node node; member
39 struct rb_node node; member
74 struct rb_node node; member
78 static int block_entry_bytenr_key_cmp(const void *key, const struct rb_node *node) in block_entry_bytenr_key_cmp() argument
81 const struct block_entry *entry = rb_entry(node, struct block_entry, node); in block_entry_bytenr_key_cmp()
93 const struct block_entry *new_entry = rb_entry(new, struct block_entry, node); in block_entry_bytenr_cmp()
101 struct rb_node *node; in insert_block_entry() local
103 node = rb_find_add(&be->node, root, block_entry_bytenr_cmp); in insert_block_entry()
104 return rb_entry_safe(node, struct block_entry, node); in insert_block_entry()
109 struct rb_node *node; in lookup_block_entry() local
111 node = rb_find(&bytenr, root, block_entry_bytenr_key_cmp); in lookup_block_entry()
112 return rb_entry_safe(node, struct block_entry, node); in lookup_block_entry()
115 static int root_entry_root_objectid_key_cmp(const void *key, const struct rb_node *node) in root_entry_root_objectid_key_cmp() argument
118 const struct root_entry *entry = rb_entry(node, struct root_entry, node); in root_entry_root_objectid_key_cmp()
130 const struct root_entry *new_entry = rb_entry(new, struct root_entry, node); in root_entry_root_objectid_cmp()
138 struct rb_node *node; in insert_root_entry() local
140 node = rb_find_add(&re->node, root, root_entry_root_objectid_cmp); in insert_root_entry()
141 return rb_entry_safe(node, struct root_entry, node); in insert_root_entry()
167 struct ref_entry *new_entry = rb_entry(new, struct ref_entry, node); in ref_entry_cmp()
168 struct ref_entry *existing_entry = rb_entry(existing, struct ref_entry, node); in ref_entry_cmp()
176 struct rb_node *node; in insert_ref_entry() local
178 node = rb_find_add(&ref->node, root, ref_entry_cmp); in insert_ref_entry()
179 return rb_entry_safe(node, struct ref_entry, node); in insert_ref_entry()
184 struct rb_node *node; in lookup_root_entry() local
186 node = rb_find(&objectid, root, root_entry_root_objectid_key_cmp); in lookup_root_entry()
187 return rb_entry_safe(node, struct root_entry, node); in lookup_root_entry()
225 re = rb_entry(n, struct root_entry, node); in free_block_entry()
226 rb_erase(&re->node, &be->roots); in free_block_entry()
231 ref = rb_entry(n, struct ref_entry, node); in free_block_entry()
232 rb_erase(&ref->node, &be->refs); in free_block_entry()
627 ref = rb_entry(n, struct ref_entry, node); in dump_block_entry()
635 re = rb_entry(n, struct root_entry, node); in dump_block_entry()
821 rb_erase(&exist->node, &be->refs); in btrfs_ref_tree_mod()
842 rb_erase(&ref->node, &be->refs); in btrfs_ref_tree_mod()
898 be = rb_entry(n, struct block_entry, node); in btrfs_free_ref_cache()
899 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_cache()
918 entry = rb_entry(n, struct block_entry, node); in btrfs_free_ref_tree_range()
943 n = &be->node; in btrfs_free_ref_tree_range()
945 be = rb_entry(n, struct block_entry, node); in btrfs_free_ref_tree_range()
964 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_tree_range()