Lines Matching refs:bc_nlevels
438 for (i = 0; i < cur->bc_nlevels; i++) {
492 for (i = 0; i < new->bc_nlevels; i++) {
754 (level == cur->bc_nlevels - 1)) {
997 (lev == cur->bc_nlevels - 1))
1611 ASSERT(level < cur->bc_nlevels);
1640 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1660 if (lev == cur->bc_nlevels) {
1667 ASSERT(lev < cur->bc_nlevels);
1713 ASSERT(level < cur->bc_nlevels);
1742 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1753 if (lev == cur->bc_nlevels) {
1760 ASSERT(lev < cur->bc_nlevels);
1802 (level == cur->bc_nlevels - 1)) {
1895 if (XFS_IS_CORRUPT(cur->bc_mp, cur->bc_nlevels == 0))
1911 for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {
1934 if (level != 0 || cur->bc_nlevels != 1) {
2162 if (level + 1 >= cur->bc_nlevels)
2170 for (level++; level < cur->bc_nlevels; level++) {
2190 if (level + 1 >= cur->bc_nlevels)
2238 for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {
2336 level == cur->bc_nlevels - 1)
2531 (level == cur->bc_nlevels - 1))
2845 if (level + 1 < cur->bc_nlevels) {
2993 level = cur->bc_nlevels - 1;
3027 cur->bc_nlevels++;
3028 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels);
3120 block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);
3123 error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);
3153 xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);
3189 xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);
3190 cur->bc_levels[cur->bc_nlevels].ptr = nptr;
3191 cur->bc_nlevels++;
3192 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels);
3217 level == cur->bc_nlevels - 1) {
3303 (level >= cur->bc_nlevels)) {
3542 cur->bc_nlevels = pcur->bc_nlevels;
3590 ASSERT(cur->bc_nlevels > 1);
3596 level = cur->bc_nlevels - 1;
3660 cur->bc_nlevels--;
3691 cur->bc_nlevels--;
3825 if (level == cur->bc_nlevels - 1) {
3902 level == cur->bc_nlevels - 2) {
4205 (level + 1 < cur->bc_nlevels)) {
4280 for (level = 1; level < cur->bc_nlevels; level++) {
4399 for (level = cur->bc_nlevels - 1; level >= 0; level--) {
4493 ASSERT(level == cur->bc_nlevels - 1);
4817 level = cur->bc_nlevels - 1;
4831 while (level < cur->bc_nlevels) {
4838 if (level < cur->bc_nlevels - 1)
4917 for (i = 0; i < cur->bc_nlevels; i++) {