Lines Matching defs:leaf
181 * attr leaf and dir leaf blocks.
266 * leaf/node format detection on trees is sketchy, so a node read can be done on
267 * leaf level blocks when detection identifies the tree as a node format tree
467 * Split a leaf node, rebalance, then possibly split
502 * If a leaf node then
503 * Allocate a new leaf node, then rebalance across them.
518 * Entry wouldn't fit, split the leaf again. The new
570 * during a double leaf split in the attr fork. This is guaranteed as
571 * we can't be here if the attr fork only has a single leaf block.
646 struct xfs_dir2_leaf *leaf;
687 leaf = (xfs_dir2_leaf_t *)oldroot;
688 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf);
693 (char *)leaf);
1058 * Deallocate an empty leaf node, remove it from its parent,
1211 * This could be copying a leaf back into the root block in the case of
1212 * there only being a single leaf block left in the tree. Hence we have
1716 * A leaf block that ends in the hashval that we are interested in
1719 * next leaf and keep searching.
1914 * Unlink the leaf block from the doubly linked chain of leaves.