Lines Matching refs:be
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_NOFS); 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()
292 kfree(be); in add_block_entry()
296 be->num_refs = 0; in add_block_entry()
297 be->metadata = 0; in add_block_entry()
298 be->from_disk = 0; in add_block_entry()
299 be->roots = RB_ROOT; in add_block_entry()
300 be->refs = RB_ROOT; in add_block_entry()
301 INIT_LIST_HEAD(&be->actions); in add_block_entry()
303 insert_root_entry(&be->roots, re); in add_block_entry()
306 return be; in add_block_entry()
312 struct block_entry *be; in add_tree_block() local
329 be = add_block_entry(fs_info, bytenr, fs_info->nodesize, ref_root); in add_tree_block()
330 if (IS_ERR(be)) { in add_tree_block()
332 return PTR_ERR(be); in add_tree_block()
334 be->num_refs++; in add_tree_block()
335 be->from_disk = 1; in add_tree_block()
336 be->metadata = 1; in add_tree_block()
340 re = lookup_root_entry(&be->roots, ref_root); in add_tree_block()
344 exist = insert_ref_entry(&be->refs, ref); in add_tree_block()
358 struct block_entry *be; in add_shared_data_ref() local
364 be = add_block_entry(fs_info, bytenr, num_bytes, 0); in add_shared_data_ref()
365 if (IS_ERR(be)) { in add_shared_data_ref()
367 return PTR_ERR(be); in add_shared_data_ref()
369 be->num_refs += num_refs; in add_shared_data_ref()
373 if (insert_ref_entry(&be->refs, ref)) { in add_shared_data_ref()
388 struct block_entry *be; in add_extent_data_ref() local
399 be = add_block_entry(fs_info, bytenr, num_bytes, ref_root); in add_extent_data_ref()
400 if (IS_ERR(be)) { in add_extent_data_ref()
402 return PTR_ERR(be); in add_extent_data_ref()
404 be->num_refs += num_refs; in add_extent_data_ref()
411 if (insert_ref_entry(&be->refs, ref)) { in add_extent_data_ref()
418 re = lookup_root_entry(&be->roots, ref_root); in add_extent_data_ref()
621 struct block_entry *be) in dump_block_entry() argument
630 be->bytenr, be->len, be->num_refs, be->metadata, in dump_block_entry()
631 be->from_disk); in dump_block_entry()
633 for (n = rb_first(&be->refs); n; n = rb_next(n)) { in dump_block_entry()
641 for (n = rb_first(&be->roots); n; n = rb_next(n)) { in dump_block_entry()
647 list_for_each_entry(ra, &be->actions, list) in dump_block_entry()
664 struct block_entry *be = NULL; in btrfs_ref_tree_mod() local
732 be = add_block_entry(fs_info, bytenr, num_bytes, ref_root); in btrfs_ref_tree_mod()
733 if (IS_ERR(be)) { in btrfs_ref_tree_mod()
736 ret = PTR_ERR(be); in btrfs_ref_tree_mod()
739 be->num_refs++; in btrfs_ref_tree_mod()
741 be->metadata = 1; in btrfs_ref_tree_mod()
743 if (be->num_refs != 1) { in btrfs_ref_tree_mod()
746 dump_block_entry(fs_info, be); in btrfs_ref_tree_mod()
753 while (!list_empty(&be->actions)) { in btrfs_ref_tree_mod()
756 tmp = list_first_entry(&be->actions, struct ref_action, in btrfs_ref_tree_mod()
783 be = lookup_block_entry(&fs_info->block_tree, bytenr); in btrfs_ref_tree_mod()
784 if (!be) { in btrfs_ref_tree_mod()
792 } else if (be->num_refs == 0) { in btrfs_ref_tree_mod()
796 dump_block_entry(fs_info, be); in btrfs_ref_tree_mod()
804 tmp = insert_root_entry(&be->roots, re); in btrfs_ref_tree_mod()
812 exist = insert_ref_entry(&be->refs, ref); in btrfs_ref_tree_mod()
818 dump_block_entry(fs_info, be); in btrfs_ref_tree_mod()
826 rb_erase(&exist->node, &be->refs); in btrfs_ref_tree_mod()
829 } else if (!be->metadata) { in btrfs_ref_tree_mod()
834 dump_block_entry(fs_info, be); in btrfs_ref_tree_mod()
845 dump_block_entry(fs_info, be); in btrfs_ref_tree_mod()
854 re = lookup_root_entry(&be->roots, ref_root); in btrfs_ref_tree_mod()
863 generic_ref->real_root, be->bytenr); in btrfs_ref_tree_mod()
864 dump_block_entry(fs_info, be); in btrfs_ref_tree_mod()
873 be->num_refs--; in btrfs_ref_tree_mod()
875 be->num_refs++; in btrfs_ref_tree_mod()
879 list_add_tail(&ra->list, &be->actions); in btrfs_ref_tree_mod()
892 struct block_entry *be; in btrfs_free_ref_cache() local
900 be = rb_entry(n, struct block_entry, node); in btrfs_free_ref_cache()
901 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_cache()
902 free_block_entry(be); in btrfs_free_ref_cache()
911 struct block_entry *be = NULL, *entry; in btrfs_free_ref_tree_range() local
926 be = entry; in btrfs_free_ref_tree_range()
930 if (be == NULL || in btrfs_free_ref_tree_range()
931 (entry->bytenr < start && be->bytenr > start) || in btrfs_free_ref_tree_range()
932 (entry->bytenr < start && entry->bytenr > be->bytenr)) in btrfs_free_ref_tree_range()
933 be = entry; in btrfs_free_ref_tree_range()
940 if (!be) { in btrfs_free_ref_tree_range()
945 n = &be->node; in btrfs_free_ref_tree_range()
947 be = rb_entry(n, struct block_entry, node); in btrfs_free_ref_tree_range()
949 if (be->bytenr < start && be->bytenr + be->len > start) { in btrfs_free_ref_tree_range()
953 dump_block_entry(fs_info, be); in btrfs_free_ref_tree_range()
956 if (be->bytenr < start) in btrfs_free_ref_tree_range()
958 if (be->bytenr >= start + len) in btrfs_free_ref_tree_range()
960 if (be->bytenr + be->len > start + len) { in btrfs_free_ref_tree_range()
964 dump_block_entry(fs_info, be); in btrfs_free_ref_tree_range()
966 rb_erase(&be->node, &fs_info->block_tree); in btrfs_free_ref_tree_range()
967 free_block_entry(be); in btrfs_free_ref_tree_range()