333 	struct rb_node *node = &ins->ref_node;  in tree_insert()  local
336 	exist = rb_find_add_cached(node, root, cmp_refs_node);  in tree_insert()
394 	struct rb_node *node = rb_next(&ref->ref_node);  in merge_ref()  local
397 	while (!done && node) {  in merge_ref()
400 		next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);  in merge_ref()
401 		node = rb_next(node);  in merge_ref()
439 	struct rb_node *node;  in btrfs_merge_delayed_refs()  local
453 	for (node = rb_first_cached(&head->ref_tree); node;  in btrfs_merge_delayed_refs()
454 	     node = rb_next(node)) {  in btrfs_merge_delayed_refs()
455 		ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);  in btrfs_merge_delayed_refs()
995 	struct btrfs_delayed_ref_node *node;  in add_delayed_ref()  local
1007 	node = kmem_cache_alloc(btrfs_delayed_ref_node_cachep, GFP_NOFS);  in add_delayed_ref()
1008 	if (!node)  in add_delayed_ref()
1039 	init_delayed_ref_common(fs_info, node, generic_ref);  in add_delayed_ref()
1059 	merged = insert_delayed_ref(trans, head_ref, node);  in add_delayed_ref()
1069 		trace_add_delayed_data_ref(trans->fs_info, node);  in add_delayed_ref()
1071 		trace_add_delayed_tree_ref(trans->fs_info, node);  in add_delayed_ref()
1073 		kmem_cache_free(btrfs_delayed_ref_node_cachep, node);  in add_delayed_ref()
1084 	kmem_cache_free(btrfs_delayed_ref_node_cachep, node);  in add_delayed_ref()
1222 	struct rb_node *node;  in btrfs_find_delayed_tree_ref()  local
1228 	node = head->ref_tree.rb_root.rb_node;  in btrfs_find_delayed_tree_ref()
1229 	while (node) {  in btrfs_find_delayed_tree_ref()
1233 		entry = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);  in btrfs_find_delayed_tree_ref()
1236 			node = node->rb_left;  in btrfs_find_delayed_tree_ref()
1238 			node = node->rb_right;  in btrfs_find_delayed_tree_ref()