Lines Matching defs:level
106 * by an equal number of pointers to the btree blocks at the next lower level.
307 int level)
315 for (height = ifp->if_height; height > level; height--) {
430 int level,
436 for (height = ifp->if_height; height > level; height--) {
497 int level)
503 if (ifp->if_height < level)
507 node = xfs_iext_find_level(ifp, offset, level);
522 xfs_iext_update_node(ifp, node->keys[0], offset, level, node);
534 level++;
729 int level = 2, pos, nr_entries, i;
731 ASSERT(level <= ifp->if_height);
732 node = xfs_iext_find_level(ifp, offset, level);
749 xfs_iext_update_node(ifp, offset, node->keys[0], level, node);
756 if (level < ifp->if_height) {
760 * recurse up to the next level.
762 level++;
763 parent = xfs_iext_find_level(ifp, offset, level);
1026 int level)
1030 if (level > 1) {
1034 xfs_iext_destroy_node(node->ptrs[i], level - 1);