Lines Matching defs:leaf
691 * This helper will insert some continuous items into the same leaf according
692 * to the free space of the leaf.
701 struct extent_buffer *leaf;
713 leaf = path->nodes[0];
714 free_space = btrfs_leaf_free_space(leaf);
777 data_ptr = btrfs_item_ptr(leaf, slot, char);
778 write_extent_buffer(leaf, &curr->data,
805 struct extent_buffer *leaf;
817 leaf = path->nodes[0];
819 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
821 write_extent_buffer(leaf, delayed_item->data, (unsigned long)ptr,
823 btrfs_mark_buffer_dirty(leaf);
831 * to insert those items into the same leaf.
856 /* insert the continuous items into the same leaf */
878 struct extent_buffer *leaf;
886 leaf = path->nodes[0];
889 last_item = btrfs_header_nritems(leaf) - 1;
895 btrfs_item_key_to_cpu(leaf, &key, i);
915 btrfs_item_key_to_cpu(leaf, &key, i);
1018 struct extent_buffer *leaf;
1040 leaf = path->nodes[0];
1041 inode_item = btrfs_item_ptr(leaf, path->slots[0],
1043 write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item,
1045 btrfs_mark_buffer_dirty(leaf);
1051 if (path->slots[0] >= btrfs_header_nritems(leaf))
1054 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1100 leaf = path->nodes[0];
1186 * point to locked extent buffers (a leaf at the very least).
1197 * the same btree path (leaf).
1901 * same leaf, and we will deal with them at the same time.
1904 * - If the inode ref and the inode item are not in the same leaf,