Lines Matching refs:eb
29 const struct extent_buffer *eb, in check_extent_in_eb() argument
39 !btrfs_file_extent_compression(eb, fi) && in check_extent_in_eb()
40 !btrfs_file_extent_encryption(eb, fi) && in check_extent_in_eb()
41 !btrfs_file_extent_other_encoding(eb, fi)) { in check_extent_in_eb()
45 data_offset = btrfs_file_extent_offset(eb, fi); in check_extent_in_eb()
46 data_len = btrfs_file_extent_num_bytes(eb, fi); in check_extent_in_eb()
76 static int find_extent_in_eb(const struct extent_buffer *eb, in find_extent_in_eb() argument
94 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
96 btrfs_item_key_to_cpu(eb, &key, slot); in find_extent_in_eb()
99 fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item); in find_extent_in_eb()
100 extent_type = btrfs_file_extent_type(eb, fi); in find_extent_in_eb()
104 disk_byte = btrfs_file_extent_disk_bytenr(eb, fi); in find_extent_in_eb()
108 ret = check_extent_in_eb(&key, eb, fi, extent_item_pos, eie, ignore_offset); in find_extent_in_eb()
427 struct extent_buffer *eb; in add_all_parents() local
439 eb = path->nodes[level]; in add_all_parents()
440 ret = ulist_add(parents, eb->start, 0, GFP_NOFS); in add_all_parents()
456 eb = path->nodes[0]; in add_all_parents()
457 if (path->slots[0] >= btrfs_header_nritems(eb) || in add_all_parents()
458 is_shared_data_backref(preftrees, eb->start) || in add_all_parents()
459 ref->root_id != btrfs_header_owner(eb)) { in add_all_parents()
467 eb = path->nodes[0]; in add_all_parents()
470 btrfs_item_key_to_cpu(eb, &key, slot); in add_all_parents()
482 (is_shared_data_backref(preftrees, eb->start) || in add_all_parents()
483 ref->root_id != btrfs_header_owner(eb))) { in add_all_parents()
490 fi = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item); in add_all_parents()
491 type = btrfs_file_extent_type(eb, fi); in add_all_parents()
494 disk_byte = btrfs_file_extent_disk_bytenr(eb, fi); in add_all_parents()
495 data_offset = btrfs_file_extent_offset(eb, fi); in add_all_parents()
505 ret = check_extent_in_eb(&key, eb, fi, in add_all_parents()
513 ret = ulist_add_merge_ptr(parents, eb->start, in add_all_parents()
549 struct extent_buffer *eb; in resolve_indirect_ref() local
629 eb = path->nodes[level]; in resolve_indirect_ref()
630 while (!eb) { in resolve_indirect_ref()
636 eb = path->nodes[level]; in resolve_indirect_ref()
798 struct extent_buffer *eb; in add_missing_keys() local
810 eb = read_tree_block(fs_info, ref->wanted_disk_byte, in add_missing_keys()
812 if (IS_ERR(eb)) { in add_missing_keys()
814 return PTR_ERR(eb); in add_missing_keys()
816 if (!extent_buffer_uptodate(eb)) { in add_missing_keys()
818 free_extent_buffer(eb); in add_missing_keys()
823 btrfs_tree_read_lock(eb); in add_missing_keys()
824 if (btrfs_header_level(eb) == 0) in add_missing_keys()
825 btrfs_item_key_to_cpu(eb, &ref->key_for_search, 0); in add_missing_keys()
827 btrfs_node_key_to_cpu(eb, &ref->key_for_search, 0); in add_missing_keys()
829 btrfs_tree_read_unlock(eb); in add_missing_keys()
830 free_extent_buffer(eb); in add_missing_keys()
1369 struct extent_buffer *eb; in find_parent_nodes() local
1371 eb = read_tree_block(fs_info, ref->parent, 0, in find_parent_nodes()
1373 if (IS_ERR(eb)) { in find_parent_nodes()
1374 ret = PTR_ERR(eb); in find_parent_nodes()
1377 if (!extent_buffer_uptodate(eb)) { in find_parent_nodes()
1378 free_extent_buffer(eb); in find_parent_nodes()
1384 btrfs_tree_read_lock(eb); in find_parent_nodes()
1385 ret = find_extent_in_eb(eb, bytenr, in find_parent_nodes()
1388 btrfs_tree_read_unlock(eb); in find_parent_nodes()
1389 free_extent_buffer(eb); in find_parent_nodes()
1894 struct extent_buffer *eb = eb_in; in btrfs_ref_to_path() local
1904 read_extent_buffer(eb, dest + bytes_left, in btrfs_ref_to_path()
1906 if (eb != eb_in) { in btrfs_ref_to_path()
1908 btrfs_tree_read_unlock(eb); in btrfs_ref_to_path()
1909 free_extent_buffer(eb); in btrfs_ref_to_path()
1925 eb = path->nodes[0]; in btrfs_ref_to_path()
1927 if (eb != eb_in) { in btrfs_ref_to_path()
1932 iref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref); in btrfs_ref_to_path()
1934 name_len = btrfs_inode_ref_name_len(eb, iref); in btrfs_ref_to_path()
1965 const struct extent_buffer *eb; in extent_from_logical() local
1999 eb = path->nodes[0]; in extent_from_logical()
2000 item_size = btrfs_item_size(eb, path->slots[0]); in extent_from_logical()
2003 ei = btrfs_item_ptr(eb, path->slots[0], struct btrfs_extent_item); in extent_from_logical()
2004 flags = btrfs_extent_flags(eb, ei); in extent_from_logical()
2034 const struct extent_buffer *eb, in get_extent_inline_ref() argument
2047 flags = btrfs_extent_flags(eb, ei); in get_extent_inline_ref()
2069 *out_type = btrfs_get_extent_inline_ref_type(eb, *out_eiref, in get_extent_inline_ref()
2089 int tree_backref_for_extent(unsigned long *ptr, struct extent_buffer *eb, in tree_backref_for_extent() argument
2101 ret = get_extent_inline_ref(ptr, eb, key, ei, item_size, in tree_backref_for_extent()
2115 *out_root = btrfs_extent_inline_ref_offset(eb, eiref); in tree_backref_for_extent()
2121 *out_level = btrfs_tree_block_level(eb, info); in tree_backref_for_extent()
2284 struct extent_buffer *eb, struct inode_fs_paths *ipath);
2297 struct extent_buffer *eb; in iterate_inode_refs() local
2316 eb = btrfs_clone_extent_buffer(path->nodes[0]); in iterate_inode_refs()
2317 if (!eb) { in iterate_inode_refs()
2323 iref = btrfs_item_ptr(eb, slot, struct btrfs_inode_ref); in iterate_inode_refs()
2325 for (cur = 0; cur < btrfs_item_size(eb, slot); cur += len) { in iterate_inode_refs()
2326 name_len = btrfs_inode_ref_name_len(eb, iref); in iterate_inode_refs()
2333 (unsigned long)(iref + 1), eb, ipath); in iterate_inode_refs()
2339 free_extent_buffer(eb); in iterate_inode_refs()
2356 struct extent_buffer *eb; in iterate_inode_extrefs() local
2374 eb = btrfs_clone_extent_buffer(path->nodes[0]); in iterate_inode_extrefs()
2375 if (!eb) { in iterate_inode_extrefs()
2381 item_size = btrfs_item_size(eb, slot); in iterate_inode_extrefs()
2382 ptr = btrfs_item_ptr_offset(eb, slot); in iterate_inode_extrefs()
2389 parent = btrfs_inode_extref_parent(eb, extref); in iterate_inode_extrefs()
2390 name_len = btrfs_inode_extref_name_len(eb, extref); in iterate_inode_extrefs()
2392 (unsigned long)&extref->name, eb, ipath); in iterate_inode_extrefs()
2396 cur_offset += btrfs_inode_extref_name_len(eb, extref); in iterate_inode_extrefs()
2399 free_extent_buffer(eb); in iterate_inode_extrefs()
2414 struct extent_buffer *eb, struct inode_fs_paths *ipath) in inode_to_path() argument
2427 name_off, eb, inum, fspath_min, bytes_left); in inode_to_path()
2656 struct extent_buffer *eb = btrfs_backref_get_eb(iter); in btrfs_backref_iter_next() local
2676 type = btrfs_extent_inline_ref_type(eb, iref); in btrfs_backref_iter_next()
2920 struct extent_buffer *eb; in handle_indirect_tree_backref() local
2970 eb = path->nodes[level]; in handle_indirect_tree_backref()
2971 if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) { in handle_indirect_tree_backref()
3005 eb = path->nodes[level]; in handle_indirect_tree_backref()
3006 rb_node = rb_simple_search(&cache->rb_root, eb->start); in handle_indirect_tree_backref()
3008 upper = btrfs_backref_alloc_node(cache, eb->start, in handle_indirect_tree_backref()
3016 upper->owner = btrfs_header_owner(eb); in handle_indirect_tree_backref()
3024 if (btrfs_block_can_be_shared(root, eb)) in handle_indirect_tree_backref()
3049 upper->owner = btrfs_header_owner(eb); in handle_indirect_tree_backref()
3126 struct extent_buffer *eb; in btrfs_backref_add_tree_node() local
3131 eb = btrfs_backref_get_eb(iter); in btrfs_backref_add_tree_node()
3140 type = btrfs_get_extent_inline_ref_type(eb, iref, in btrfs_backref_add_tree_node()
3147 key.offset = btrfs_extent_inline_ref_offset(eb, iref); in btrfs_backref_add_tree_node()