fs/btrfs/ref-verify.c

63  * free it until we unmount the file system in order to make sure re-allocations
120 					    struct root_entry *re)
129 		if (entry->root_objectid > re->root_objectid)
131 		else if (entry->root_objectid < re->root_objectid)
137 	rb_link_node(&re->node, parent_node, p);
138 	rb_insert_color(&re->node, root);
237 	struct root_entry *re;
243 		re = rb_entry(n, struct root_entry, node);
244 		rb_erase(&re->node, &be->roots);
245 		kfree(re);
268 	struct root_entry *re = NULL;
270 	re = kzalloc(sizeof(struct root_entry), GFP_NOFS);
272 	if (!be || !re) {
273 		kfree(re);
280 	re->root_objectid = root_objectid;
281 	re->num_refs = 0;
289 			exist_re = insert_root_entry(&exist->roots, re);
291 				kfree(re);
293 			kfree(re);
306 		insert_root_entry(&be->roots, re);
308 		kfree(re);
316 	struct root_entry *re;
343 		re = lookup_root_entry(&be->roots, ref_root);
344 		ASSERT(re);
345 		re->num_refs++;
393 	struct root_entry *re;
421 	re = lookup_root_entry(&be->roots, ref_root);
422 	if (!re) {
427 	re->num_refs += num_refs;
630 	struct root_entry *re;
648 		re = rb_entry(n, struct root_entry, node);
650 			  re->root_objectid, re->num_refs);
671 	struct root_entry *re = NULL;
751 			"re-allocated a block that still has references to it!");
771 			re = kmalloc(sizeof(struct root_entry), GFP_NOFS);
772 			if (!re) {
781 			 * re->num_refs.
784 			re->root_objectid = generic_ref->real_root;
785 			re->num_refs = 0;
797 			kfree(re);
807 			kfree(re);
812 			tmp = insert_root_entry(&be->roots, re);
814 				kfree(re);
815 				re = tmp;
861 	if (!parent && !re) {
862 		re = lookup_root_entry(&be->roots, ref_root);
863 		if (!re) {
865 			 * This shouldn't happen because we will add our re
879 		if (re)
880 			re->num_refs--;
884 		if (re)
885 			re->num_refs++;