Lines Matching defs:leaf
1554 * or the content of some node/leaf from a past generation that got
2456 * For example we are in leaf X processing its last item, which is the
2462 * range [768K, 2M[, which may end up as the last item of leaf X or as
2463 * the first item of the next leaf - in either case btrfs_next_leaf()
2685 * We clone the leaf and use it during fiemap. This is because while
2686 * using the leaf we do expensive things like checking if an extent is
2688 * other tasks for too long, we use a clone of the leaf. We have locked
2691 * want to insert items for other inodes in the same leaf or b+tree
2693 * to push items into this leaf when trying to insert an item in a
2694 * neighbour leaf).
2841 struct extent_buffer *leaf;
2865 leaf = path->nodes[0];
2866 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2878 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
2879 if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_INLINE) {
2887 * case: we have one hole file extent item at slot 0 of a leaf and
2888 * another hole file extent item as the last item in the previous leaf.
2891 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei);
2901 leaf = path->nodes[0];
2902 ei = btrfs_item_ptr(leaf, path->slots[0],
2904 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei);
2960 struct extent_buffer *leaf = path->nodes[0];
2972 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2985 backref_ctx->curr_leaf_bytenr = leaf->start;
3011 ei = btrfs_item_ptr(leaf, path->slots[0],
3013 compression = btrfs_file_extent_compression(leaf, ei);
3014 extent_type = btrfs_file_extent_type(leaf, ei);
3015 extent_gen = btrfs_file_extent_generation(leaf, ei);
3018 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, ei);
3020 extent_offset = btrfs_file_extent_offset(leaf, ei);
3092 * non-cloned leaf, and fiemap_fill_next_extent() can trigger page