Lines Matching defs:leaf
139 * Split a leaf node, rebalance, then possibly split
167 * If a leaf node then
168 * Allocate a new leaf node, then rebalance across them.
183 * Entry wouldn't fit, split the leaf again.
308 xfs_dir2_leaf_t *leaf;
333 leaf = (xfs_dir2_leaf_t *)oldroot;
334 size = (int)((char *)&leaf->ents[be16_to_cpu(leaf->hdr.count)] -
335 (char *)leaf);
622 * Deallocate an empty leaf node, remove it from its parent,
1147 * A leaf block that ends in the hashval that we are interested in
1150 * next leaf and keep searching.
1347 * Unlink the leaf block from the doubly linked chain of leaves.