Lines Matching defs:leaf
638 * that fit in a leaf. The delayed items (dir index keys) are sorted by their key
674 * order to ensure we do not end up with out of order items in our leaf.
773 * For normal operations we will batch an entire leaf's worth of delayed
775 * index_item_leaves by 1 as we inserted 1 leaf's worth of items.
777 * However for log replay we may not have inserted an entire leaf's
784 * We inserted one batch of items into a leaf a there are more
787 * the leaf we just flushed to.
843 struct extent_buffer *leaf = path->nodes[0];
849 ASSERT(leaf != NULL);
852 last_slot = btrfs_header_nritems(leaf) - 1;
867 * leaf - if so, we can add it to the batch of items to delete from the
868 * leaf.
878 btrfs_item_key_to_cpu(leaf, &key, slot);
938 * There's no matching item in the leaf. This means we
1009 struct extent_buffer *leaf;
1028 leaf = path->nodes[0];
1029 inode_item = btrfs_item_ptr(leaf, path->slots[0],
1031 write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item,
1033 btrfs_mark_buffer_dirty(trans, leaf);
1039 if (path->slots[0] >= btrfs_header_nritems(leaf))
1042 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1085 leaf = path->nodes[0];
1170 * point to locked extent buffers (a leaf at the very least).
1181 * the same btree path (leaf).
1443 * leaf, so we can release 1 unit of metadata that was previously
1574 * If there's only one leaf reserved, we can decrement this item from the
1575 * current batch, otherwise we can not because we don't know which leaf
1577 * accumulate enough dir index items to fill more than one leaf (even
1578 * when using a leaf size of 4K).
1970 * same leaf, and we will deal with them at the same time.
1973 * - If the inode ref and the inode item are not in the same leaf,