76 					      struct block_entry *be)  in insert_block_entry()  argument
85 		if (entry->bytenr > be->bytenr)  in insert_block_entry()
87 		else if (entry->bytenr < be->bytenr)  in insert_block_entry()
93 	rb_link_node(&be->node, parent_node, p);  in insert_block_entry()
94 	rb_insert_color(&be->node, root);  in insert_block_entry()
232 static void free_block_entry(struct block_entry *be)  in free_block_entry()  argument
239 	while ((n = rb_first(&be->roots))) {  in free_block_entry()
241 		rb_erase(&re->node, &be->roots);  in free_block_entry()
245 	while((n = rb_first(&be->refs))) {  in free_block_entry()
247 		rb_erase(&ref->node, &be->refs);  in free_block_entry()
251 	while (!list_empty(&be->actions)) {  in free_block_entry()
252 		ra = list_first_entry(&be->actions, struct ref_action,  in free_block_entry()
257 	kfree(be);  in free_block_entry()
264 	struct block_entry *be = NULL, *exist;  in add_block_entry()  local
268 	be = kzalloc(sizeof(struct block_entry), GFP_KERNEL);  in add_block_entry()
269 	if (!be || !re) {  in add_block_entry()
271 		kfree(be);  in add_block_entry()
274 	be->bytenr = bytenr;  in add_block_entry()
275 	be->len = len;  in add_block_entry()
281 	exist = insert_block_entry(&fs_info->block_tree, be);  in add_block_entry()
290 		kfree(be);  in add_block_entry()
294 	be->num_refs = 0;  in add_block_entry()
295 	be->metadata = 0;  in add_block_entry()
296 	be->from_disk = 0;  in add_block_entry()
297 	be->roots = RB_ROOT;  in add_block_entry()
298 	be->refs = RB_ROOT;  in add_block_entry()
299 	INIT_LIST_HEAD(&be->actions);  in add_block_entry()
301 		insert_root_entry(&be->roots, re);  in add_block_entry()
304 	return be;  in add_block_entry()
310 	struct block_entry *be;  in add_tree_block()  local
327 	be = add_block_entry(fs_info, bytenr, fs_info->nodesize, ref_root);  in add_tree_block()
328 	if (IS_ERR(be)) {  in add_tree_block()
330 		return PTR_ERR(be);  in add_tree_block()
332 	be->num_refs++;  in add_tree_block()
333 	be->from_disk = 1;  in add_tree_block()
334 	be->metadata = 1;  in add_tree_block()
338 		re = lookup_root_entry(&be->roots, ref_root);  in add_tree_block()
342 	exist = insert_ref_entry(&be->refs, ref);  in add_tree_block()
356 	struct block_entry *be;  in add_shared_data_ref()  local
362 	be = add_block_entry(fs_info, bytenr, num_bytes, 0);  in add_shared_data_ref()
363 	if (IS_ERR(be)) {  in add_shared_data_ref()
365 		return PTR_ERR(be);  in add_shared_data_ref()
367 	be->num_refs += num_refs;  in add_shared_data_ref()
371 	if (insert_ref_entry(&be->refs, ref)) {  in add_shared_data_ref()
386 	struct block_entry *be;  in add_extent_data_ref()  local
397 	be = add_block_entry(fs_info, bytenr, num_bytes, ref_root);  in add_extent_data_ref()
398 	if (IS_ERR(be)) {  in add_extent_data_ref()
400 		return PTR_ERR(be);  in add_extent_data_ref()
402 	be->num_refs += num_refs;  in add_extent_data_ref()
409 	if (insert_ref_entry(&be->refs, ref)) {  in add_extent_data_ref()
416 	re = lookup_root_entry(&be->roots, ref_root);  in add_extent_data_ref()
631 			     struct block_entry *be)  in dump_block_entry()  argument
640 		  be->bytenr, be->len, be->num_refs, be->metadata,  in dump_block_entry()
641 		  be->from_disk);  in dump_block_entry()
643 	for (n = rb_first(&be->refs); n; n = rb_next(n)) {  in dump_block_entry()
651 	for (n = rb_first(&be->roots); n; n = rb_next(n)) {  in dump_block_entry()
657 	list_for_each_entry(ra, &be->actions, list)  in dump_block_entry()
674 	struct block_entry *be = NULL;  in btrfs_ref_tree_mod()  local
745 		be = add_block_entry(fs_info, bytenr, num_bytes, ref_root);  in btrfs_ref_tree_mod()
746 		if (IS_ERR(be)) {  in btrfs_ref_tree_mod()
748 			ret = PTR_ERR(be);  in btrfs_ref_tree_mod()
751 		be->num_refs++;  in btrfs_ref_tree_mod()
753 			be->metadata = 1;  in btrfs_ref_tree_mod()
755 		if (be->num_refs != 1) {  in btrfs_ref_tree_mod()
758 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
763 		while (!list_empty(&be->actions)) {  in btrfs_ref_tree_mod()
766 			tmp = list_first_entry(&be->actions, struct ref_action,  in btrfs_ref_tree_mod()
793 		be = lookup_block_entry(&fs_info->block_tree, bytenr);  in btrfs_ref_tree_mod()
794 		if (!be) {  in btrfs_ref_tree_mod()
806 			tmp = insert_root_entry(&be->roots, re);  in btrfs_ref_tree_mod()
814 	exist = insert_ref_entry(&be->refs, ref);  in btrfs_ref_tree_mod()
820 				dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
827 				rb_erase(&exist->node, &be->refs);  in btrfs_ref_tree_mod()
830 		} else if (!be->metadata) {  in btrfs_ref_tree_mod()
835 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
845 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
853 		re = lookup_root_entry(&be->roots, ref_root);  in btrfs_ref_tree_mod()
862 				  generic_ref->real_root, be->bytenr);  in btrfs_ref_tree_mod()
863 			dump_block_entry(fs_info, be);  in btrfs_ref_tree_mod()
872 		be->num_refs--;  in btrfs_ref_tree_mod()
874 		be->num_refs++;  in btrfs_ref_tree_mod()
878 	list_add_tail(&ra->list, &be->actions);  in btrfs_ref_tree_mod()
891 	struct block_entry *be;  in btrfs_free_ref_cache()  local
899 		be = rb_entry(n, struct block_entry, node);  in btrfs_free_ref_cache()
900 		rb_erase(&be->node, &fs_info->block_tree);  in btrfs_free_ref_cache()
901 		free_block_entry(be);  in btrfs_free_ref_cache()
910 	struct block_entry *be = NULL, *entry;  in btrfs_free_ref_tree_range()  local
925 			be = entry;  in btrfs_free_ref_tree_range()
929 		if (be == NULL ||  in btrfs_free_ref_tree_range()
930 		    (entry->bytenr < start && be->bytenr > start) ||  in btrfs_free_ref_tree_range()
931 		    (entry->bytenr < start && entry->bytenr > be->bytenr))  in btrfs_free_ref_tree_range()
932 			be = entry;  in btrfs_free_ref_tree_range()
939 	if (!be) {  in btrfs_free_ref_tree_range()
944 	n = &be->node;  in btrfs_free_ref_tree_range()
946 		be = rb_entry(n, struct block_entry, node);  in btrfs_free_ref_tree_range()
948 		if (be->bytenr < start && be->bytenr + be->len > start) {  in btrfs_free_ref_tree_range()
952 			dump_block_entry(fs_info, be);  in btrfs_free_ref_tree_range()
955 		if (be->bytenr < start)  in btrfs_free_ref_tree_range()
957 		if (be->bytenr >= start + len)  in btrfs_free_ref_tree_range()
959 		if (be->bytenr + be->len > start + len) {  in btrfs_free_ref_tree_range()
963 			dump_block_entry(fs_info, be);  in btrfs_free_ref_tree_range()
965 		rb_erase(&be->node, &fs_info->block_tree);  in btrfs_free_ref_tree_range()
966 		free_block_entry(be);  in btrfs_free_ref_tree_range()