30  * be used to verify the extent tree is consistent as these should all match
48  * were called with since it could be different from ref_root.  We also store
79 					      struct block_entry *be)  in insert_block_entry()  argument
88 		if (entry->bytenr > be->bytenr)  in insert_block_entry()
90 		else if (entry->bytenr < be->bytenr)  in insert_block_entry()
96 	rb_link_node(&be->node, parent_node, p);  in insert_block_entry()
97 	rb_insert_color(&be->node, root);  in insert_block_entry()
235 static void free_block_entry(struct block_entry *be)  in free_block_entry()  argument
242 	while ((n = rb_first(&be->roots))) {  in free_block_entry()
244 		rb_erase(&re->node, &be->roots);  in free_block_entry()
248 	while((n = rb_first(&be->refs))) {  in free_block_entry()
250 		rb_erase(&ref->node, &be->refs);  in free_block_entry()
254 	while (!list_empty(&be->actions)) {  in free_block_entry()
255 		ra = list_first_entry(&be->actions, struct ref_action,  in free_block_entry()
260 	kfree(be);  in free_block_entry()
267 	struct block_entry *be = NULL, *exist;  in add_block_entry()  local
271 	be = kzalloc(sizeof(struct block_entry), GFP_NOFS);  in add_block_entry()
272 	if (!be || !re) {  in add_block_entry()
274 		kfree(be);  in add_block_entry()
277 	be->bytenr = bytenr;  in add_block_entry()
278 	be->len = len;  in add_block_entry()
284 	exist = insert_block_entry(&fs_info->block_tree, be);  in add_block_entry()
295 		kfree(be);  in add_block_entry()
299 	be->num_refs = 0;  in add_block_entry()
300 	be->metadata = 0;  in add_block_entry()
301 	be->from_disk = 0;  in add_block_entry()
302 	be->roots = RB_ROOT;  in add_block_entry()
303 	be->refs = RB_ROOT;  in add_block_entry()
304 	INIT_LIST_HEAD(&be->actions);  in add_block_entry()
306 		insert_root_entry(&be->roots, re);  in add_block_entry()
309 	return be;  in add_block_entry()
315 	struct block_entry *be;  in add_tree_block()  local
332 	be = add_block_entry(fs_info, bytenr, fs_info->nodesize, ref_root);  in add_tree_block()
333 	if (IS_ERR(be)) {  in add_tree_block()
335 		return PTR_ERR(be);  in add_tree_block()
337 	be->num_refs++;  in add_tree_block()
338 	be->from_disk = 1;  in add_tree_block()
339 	be->metadata = 1;  in add_tree_block()
343 		re = lookup_root_entry(&be->roots, ref_root);  in add_tree_block()
347 	exist = insert_ref_entry(&be->refs, ref);  in add_tree_block()
361 	struct block_entry *be;  in add_shared_data_ref()  local
367 	be = add_block_entry(fs_info, bytenr, num_bytes, 0);  in add_shared_data_ref()
368 	if (IS_ERR(be)) {  in add_shared_data_ref()
370 		return PTR_ERR(be);  in add_shared_data_ref()
372 	be->num_refs += num_refs;  in add_shared_data_ref()
376 	if (insert_ref_entry(&be->refs, ref)) {  in add_shared_data_ref()
391 	struct block_entry *be;  in add_extent_data_ref()  local
402 	be = add_block_entry(fs_info, bytenr, num_bytes, ref_root);  in add_extent_data_ref()
403 	if (IS_ERR(be)) {  in add_extent_data_ref()
405 		return PTR_ERR(be);  in add_extent_data_ref()
407 	be->num_refs += num_refs;  in add_extent_data_ref()
414 	if (insert_ref_entry(&be->refs, ref)) {  in add_extent_data_ref()
421 	re = lookup_root_entry(&be->roots, ref_root);  in add_extent_data_ref()
586 /* Walk up to the next node that needs to be processed */
623  * Dumps all the information from the block entry to printk, it's going to be
627 			     struct block_entry *be)  in dump_block_entry()  argument
636 		  be->bytenr, be->len, be->num_refs, be->metadata,  in dump_block_entry()
637 		  be->from_disk);  in dump_block_entry()
639 	for (n = rb_first(&be->refs); n; n = rb_next(n)) {  in dump_block_entry()
647 	for (n = rb_first(&be->roots); n; n = rb_next(n)) {  in dump_block_entry()
653 	list_for_each_entry(ra, &be->actions, list)  in dump_block_entry()
670 	struct block_entry *be = NULL;  in btrfs_ref_tree_mod()  local
738 		be = add_block_entry(fs_info, bytenr, num_bytes, ref_root);  in btrfs_ref_tree_mod()
739 		if (IS_ERR(be)) {  in btrfs_ref_tree_mod()
742 			ret = PTR_ERR(be);  in btrfs_ref_tree_mod()
745 		be->num_refs++;  in btrfs_ref_tree_mod()
747 			be->metadata = 1;  in btrfs_ref_tree_mod()
749 		if (be->num_refs != 1) {  in btrfs_ref_tree_mod()
752 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
759 		while (!list_empty(&be->actions)) {  in btrfs_ref_tree_mod()
762 			tmp = list_first_entry(&be->actions, struct ref_action,  in btrfs_ref_tree_mod()
789 		be = lookup_block_entry(&fs_info->block_tree, bytenr);  in btrfs_ref_tree_mod()
790 		if (!be) {  in btrfs_ref_tree_mod()
799 		} else if (be->num_refs == 0) {  in btrfs_ref_tree_mod()
803 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
812 			tmp = insert_root_entry(&be->roots, re);  in btrfs_ref_tree_mod()
820 	exist = insert_ref_entry(&be->refs, ref);  in btrfs_ref_tree_mod()
826 				dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
834 				rb_erase(&exist->node, &be->refs);  in btrfs_ref_tree_mod()
837 		} else if (!be->metadata) {  in btrfs_ref_tree_mod()
842 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
853 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
862 		re = lookup_root_entry(&be->roots, ref_root);  in btrfs_ref_tree_mod()
866 			 * above when we lookup the be with !parent, but just in  in btrfs_ref_tree_mod()
871 				  generic_ref->real_root, be->bytenr);  in btrfs_ref_tree_mod()
872 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
881 		be->num_refs--;  in btrfs_ref_tree_mod()
883 		be->num_refs++;  in btrfs_ref_tree_mod()
887 	list_add_tail(&ra->list, &be->actions);  in btrfs_ref_tree_mod()
902 	struct block_entry *be;  in btrfs_free_ref_cache()  local
910 		be = rb_entry(n, struct block_entry, node);  in btrfs_free_ref_cache()
911 		rb_erase(&be->node, &fs_info->block_tree);  in btrfs_free_ref_cache()
912 		free_block_entry(be);  in btrfs_free_ref_cache()
921 	struct block_entry *be = NULL, *entry;  in btrfs_free_ref_tree_range()  local
936 			be = entry;  in btrfs_free_ref_tree_range()
940 		if (be == NULL ||  in btrfs_free_ref_tree_range()
941 		    (entry->bytenr < start && be->bytenr > start) ||  in btrfs_free_ref_tree_range()
942 		    (entry->bytenr < start && entry->bytenr > be->bytenr))  in btrfs_free_ref_tree_range()
943 			be = entry;  in btrfs_free_ref_tree_range()
950 	if (!be) {  in btrfs_free_ref_tree_range()
955 	n = &be->node;  in btrfs_free_ref_tree_range()
957 		be = rb_entry(n, struct block_entry, node);  in btrfs_free_ref_tree_range()
959 		if (be->bytenr < start && be->bytenr + be->len > start) {  in btrfs_free_ref_tree_range()
963 			dump_block_entry(fs_info, be);  in btrfs_free_ref_tree_range()
966 		if (be->bytenr < start)  in btrfs_free_ref_tree_range()
968 		if (be->bytenr >= start + len)  in btrfs_free_ref_tree_range()
970 		if (be->bytenr + be->len > start + len) {  in btrfs_free_ref_tree_range()
974 			dump_block_entry(fs_info, be);  in btrfs_free_ref_tree_range()
976 		rb_erase(&be->node, &fs_info->block_tree);  in btrfs_free_ref_tree_range()
977 		free_block_entry(be);  in btrfs_free_ref_tree_range()
982 /* Walk down all roots and build the ref tree, meant to be called at mount */