Lines Matching defs:leaf
160 * every tree block (leaf or node) starts with this header.
312 * A leaf is full of items. offset and size tell us where to find
313 * the item in the leaf (relative to the start of the data area)
334 * all non-leaf blocks are nodes, they hold only keys and pointers to
349 * btrfs_paths remember the path taken from the root down to the leaf.
350 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
2315 * The leaf data grows from end-to-front in the node.
2317 * which is the stop of the leaf data stack
2319 static inline unsigned int leaf_data_end(const struct extent_buffer *leaf)
2321 u32 nr = btrfs_header_nritems(leaf);
2324 return BTRFS_LEAF_DATA_SIZE(leaf->fs_info);
2325 return btrfs_item_offset_nr(leaf, nr - 1);
2475 /* helper function to cast into the data area of the leaf. */
2476 #define btrfs_item_ptr(leaf, slot, type) \
2478 btrfs_item_offset_nr(leaf, slot)))
2480 #define btrfs_item_ptr_offset(leaf, slot) \
2482 btrfs_item_offset_nr(leaf, slot)))
2797 int btrfs_leaf_free_space(struct extent_buffer *leaf);
2938 struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf,
2942 struct extent_buffer *leaf, int slot, u64 ref_objectid,