Lines Matching defs:leaf
193 * attr leaf and dir leaf blocks.
278 * leaf/node format detection on trees is sketchy, so a node read can be done on
279 * leaf level blocks when detection identifies the tree as a node format tree
479 * Split a leaf node, rebalance, then possibly split
517 * If a leaf node then
518 * Allocate a new leaf node, then rebalance across them.
533 * Entry wouldn't fit, split the leaf again. The new
585 * during a double leaf split in the attr fork. This is guaranteed as
586 * we can't be here if the attr fork only has a single leaf block.
661 struct xfs_dir2_leaf *leaf;
702 leaf = (xfs_dir2_leaf_t *)oldroot;
703 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf);
708 (char *)leaf);
1070 * Deallocate an empty leaf node, remove it from its parent,
1223 * This could be copying a leaf back into the root block in the case of
1224 * there only being a single leaf block left in the tree. Hence we have
1728 * A leaf block that ends in the hashval that we are interested in
1731 * next leaf and keep searching.
1926 * Unlink the leaf block from the doubly linked chain of leaves.