60  * free it until we unmount the file system in order to make sure re-allocations
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()
301 			kfree(re);  in add_block_entry()
314 		insert_root_entry(&be->roots, re);  in add_block_entry()
316 		kfree(re);  in add_block_entry()
324 	struct root_entry *re;  in add_tree_block()  local
351 		re = lookup_root_entry(&be->roots, ref_root);  in add_tree_block()
352 		ASSERT(re);  in add_tree_block()
353 		re->num_refs++;  in add_tree_block()
401 	struct root_entry *re;  in add_extent_data_ref()  local
429 	re = lookup_root_entry(&be->roots, ref_root);  in add_extent_data_ref()
430 	if (!re) {  in add_extent_data_ref()
435 	re->num_refs += num_refs;  in add_extent_data_ref()
646 	struct root_entry *re;  in dump_block_entry()  local
664 		re = rb_entry(n, struct root_entry, node);  in dump_block_entry()
666 			  re->root_objectid, re->num_refs);  in dump_block_entry()
698 	struct root_entry *re = NULL;  in btrfs_ref_tree_mod()  local
763 			"re-allocated a block that still has references to it!");  in btrfs_ref_tree_mod()
783 			re = kmalloc(sizeof(struct root_entry), GFP_NOFS);  in btrfs_ref_tree_mod()
784 			if (!re) {  in btrfs_ref_tree_mod()
793 			 * re->num_refs.  in btrfs_ref_tree_mod()
796 			re->root_objectid = root->objectid;  in btrfs_ref_tree_mod()
797 			re->num_refs = 0;  in btrfs_ref_tree_mod()
814 			tmp = insert_root_entry(&be->roots, re);  in btrfs_ref_tree_mod()
816 				kfree(re);  in btrfs_ref_tree_mod()
817 				re = tmp;  in btrfs_ref_tree_mod()
862 	if (!parent && !re) {  in btrfs_ref_tree_mod()
863 		re = lookup_root_entry(&be->roots, ref_root);  in btrfs_ref_tree_mod()
864 		if (!re) {  in btrfs_ref_tree_mod()
866 			 * This shouldn't happen because we will add our re  in btrfs_ref_tree_mod()
880 		if (re)  in btrfs_ref_tree_mod()
881 			re->num_refs--;  in btrfs_ref_tree_mod()
885 		if (re)  in btrfs_ref_tree_mod()
886 			re->num_refs++;  in btrfs_ref_tree_mod()