Lines Matching defs:leaf
89 * from the shared data ref, we only have the leaf but we need
449 * 2. We are searching for normal backref but bytenr of this leaf
451 * 3. The leaf owner is not equal to the root we are searching
453 * For these cases, go to the next leaf before we continue.
476 * We are searching for normal backref but bytenr of this leaf
478 * the leaf owner is not equal to the root we are searching for
970 struct extent_buffer *leaf;
982 leaf = path->nodes[0];
985 item_size = btrfs_item_size_nr(leaf, slot);
988 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
989 flags = btrfs_extent_flags(leaf, ei);
990 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1000 *info_level = btrfs_tree_block_level(leaf, info);
1015 type = btrfs_get_extent_inline_ref_type(leaf, iref,
1020 offset = btrfs_extent_inline_ref_offset(leaf, iref);
1033 count = btrfs_shared_data_ref_count(leaf, sdref);
1050 count = btrfs_extent_data_ref_count(leaf, dref);
1051 key.objectid = btrfs_extent_data_ref_objectid(leaf,
1054 key.offset = btrfs_extent_data_ref_offset(leaf, dref);
1062 root = btrfs_extent_data_ref_root(leaf, dref);
1094 struct extent_buffer *leaf;
1107 leaf = path->nodes[0];
1108 btrfs_item_key_to_cpu(leaf, &key, slot);
1129 sdref = btrfs_item_ptr(leaf, slot,
1131 count = btrfs_shared_data_ref_count(leaf, sdref);
1149 dref = btrfs_item_ptr(leaf, slot,
1151 count = btrfs_extent_data_ref_count(leaf, dref);
1152 key.objectid = btrfs_extent_data_ref_objectid(leaf,
1155 key.offset = btrfs_extent_data_ref_offset(leaf, dref);
1163 root = btrfs_extent_data_ref_root(leaf, dref);
1300 struct extent_buffer *leaf;
1304 leaf = path->nodes[0];
1306 btrfs_item_key_to_cpu(leaf, &key, slot);
1637 const struct extent_buffer *leaf;
1649 leaf = path->nodes[0];
1651 if (slot >= btrfs_header_nritems(leaf)) {
1659 * leaf, we must move one leaf over.
1670 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1685 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
2042 "root %llu references leaf %llu, data list %#llx",
2618 * Add the node to leaf node list if no other child block