73  * every tree block (leaf or node) starts with this header.
218  * A leaf is full of items. offset and size tell us where to find
219  * the item in the leaf (relative to the start of the data area)
240  * all non-leaf blocks are nodes, they hold only keys and pointers to
256 	struct btrfs_leaf leaf;  member
286 	return &p->nodes[0]->leaf.items[p->slots[0]].key;  in btrfs_path_leaf_key()
313 	return p->nodes[0]->leaf.items[p->slots[0]].size;  in btrfs_path_item_size()
316 static inline void *btrfs_leaf_data(struct btrfs_leaf *leaf, u32 slot)  in btrfs_leaf_data()  argument
318 	return ((u8 *) leaf) + sizeof(struct btrfs_header)  in btrfs_leaf_data()
319 	       + leaf->items[slot].offset;  in btrfs_leaf_data()
324 	return btrfs_leaf_data(&p->nodes[0]->leaf, p->slots[0]);  in btrfs_path_leaf_data()