fs/btrfs/delayed-inode.c

648  * that fit in a leaf. The delayed items (dir index keys) are sorted by their key
684 	 * order to ensure we do not end up with out of order items in our leaf.
783 	 * For normal operations we will batch an entire leaf's worth of delayed
785 	 * index_item_leaves by 1 as we inserted 1 leaf's worth of items.
787 	 * However for log replay we may not have inserted an entire leaf's
794 		 * We inserted one batch of items into a leaf a there are more
797 		 * the leaf we just flushed to.
853 	struct extent_buffer *leaf = path->nodes[0];
859 	ASSERT(leaf != NULL);
862 	last_slot = btrfs_header_nritems(leaf) - 1;
877 	 * leaf - if so, we can add it to the batch of items to delete from the
878 	 * leaf.
888 		btrfs_item_key_to_cpu(leaf, &key, slot);
948 			 * There's no matching item in the leaf. This means we
1019 	struct extent_buffer *leaf;
1038 	leaf = path->nodes[0];
1039 	inode_item = btrfs_item_ptr(leaf, path->slots[0],
1041 	write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item,
1043 	btrfs_mark_buffer_dirty(trans, leaf);
1055 	if (path->slots[0] + 1 >= btrfs_header_nritems(leaf)) {
1068 		leaf = path->nodes[0];
1072 	btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1186 		 * point to locked extent buffers (a leaf at the very least).
1197 	 * the same btree path (leaf).
1458 	 * leaf, so we can release 1 unit of metadata that was previously
1589 	 * If there's only one leaf reserved, we can decrement this item from the
1590 	 * current batch, otherwise we can not because we don't know which leaf
1592 	 * accumulate enough dir index items to fill more than one leaf (even
1593 	 * when using a leaf size of 4K).
1980 	 *   same leaf, and we will deal with them at the same time.
1983 	 * - If the inode ref and the inode item are not in the same leaf,