117 					    struct root_entry *re)  in insert_root_entry()  argument
126 		if (entry->root_objectid > re->root_objectid)  in insert_root_entry()
128 		else if (entry->root_objectid < re->root_objectid)  in insert_root_entry()
134 	rb_link_node(&re->node, parent_node, p);  in insert_root_entry()
135 	rb_insert_color(&re->node, root);  in insert_root_entry()
245 	struct root_entry *re;  in free_block_entry()  local
251 		re = rb_entry(n, struct root_entry, node);  in free_block_entry()
252 		rb_erase(&re->node, &be->roots);  in free_block_entry()
253 		kfree(re);  in free_block_entry()
276 	struct root_entry *re = NULL;  in add_block_entry()  local
278 	re = kzalloc(sizeof(struct root_entry), GFP_KERNEL);  in add_block_entry()
280 	if (!be || !re) {  in add_block_entry()
281 		kfree(re);  in add_block_entry()
288 	re->root_objectid = root_objectid;  in add_block_entry()
289 	re->num_refs = 0;  in add_block_entry()
297 			exist_re = insert_root_entry(&exist->roots, re);  in add_block_entry()
299 				kfree(re);  in add_block_entry()
312 		insert_root_entry(&be->roots, re);  in add_block_entry()
314 		kfree(re);  in add_block_entry()
322 	struct root_entry *re;  in add_tree_block()  local
349 		re = lookup_root_entry(&be->roots, ref_root);  in add_tree_block()
350 		ASSERT(re);  in add_tree_block()
351 		re->num_refs++;  in add_tree_block()
399 	struct root_entry *re;  in add_extent_data_ref()  local
427 	re = lookup_root_entry(&be->roots, ref_root);  in add_extent_data_ref()
428 	if (!re) {  in add_extent_data_ref()
433 	re->num_refs += num_refs;  in add_extent_data_ref()
644 	struct root_entry *re;  in dump_block_entry()  local
662 		re = rb_entry(n, struct root_entry, node);  in dump_block_entry()
664 			  re->root_objectid, re->num_refs);  in dump_block_entry()
696 	struct root_entry *re = NULL;  in btrfs_ref_tree_mod()  local
778 			re = kmalloc(sizeof(struct root_entry), GFP_NOFS);  in btrfs_ref_tree_mod()
779 			if (!re) {  in btrfs_ref_tree_mod()
791 			re->root_objectid = root->objectid;  in btrfs_ref_tree_mod()
792 			re->num_refs = 0;  in btrfs_ref_tree_mod()
809 			tmp = insert_root_entry(&be->roots, re);  in btrfs_ref_tree_mod()
811 				kfree(re);  in btrfs_ref_tree_mod()
812 				re = tmp;  in btrfs_ref_tree_mod()
855 	if (!parent && !re) {  in btrfs_ref_tree_mod()
856 		re = lookup_root_entry(&be->roots, ref_root);  in btrfs_ref_tree_mod()
857 		if (!re) {  in btrfs_ref_tree_mod()
873 		if (re)  in btrfs_ref_tree_mod()
874 			re->num_refs--;  in btrfs_ref_tree_mod()
878 		if (re)  in btrfs_ref_tree_mod()
879 			re->num_refs++;  in btrfs_ref_tree_mod()