140 						  struct rb_node *node)  in tree_insert()
142 	struct rb_node **p = &root->rb_node;  in tree_insert()
143 	struct rb_node *parent_node = NULL;  in tree_insert()
148 	ins = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);  in tree_insert()
152 				 rb_node);  in tree_insert()
170 						   struct rb_node *node)  in htree_insert()
172 	struct rb_node **p = &root->rb_node;  in htree_insert()
173 	struct rb_node *parent_node = NULL;  in htree_insert()
208 	struct rb_node *n;  in find_ref_head()
211 	n = root->rb_node;  in find_ref_head()
271 		rb_erase(&ref->rb_node, &head->ref_root);  in drop_delayed_ref()
285 	struct rb_node *node;  in merge_ref()
289 	node = rb_next(&ref->rb_node);  in merge_ref()
293 		next = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);  in merge_ref()
336 	struct rb_node *node;  in btrfs_merge_delayed_refs()
362 			       rb_node);  in btrfs_merge_delayed_refs()
369 			node = rb_next(&ref->rb_node);  in btrfs_merge_delayed_refs()
422 		struct rb_node *node;  in btrfs_select_ref_head()
697 	existing = tree_insert(&head_ref->ref_root, &ref->rb_node);  in add_delayed_tree_ref()
762 	existing = tree_insert(&head_ref->ref_root, &ref->rb_node);  in add_delayed_data_ref()