Lines Matching refs:bc_nlevels
218 for (i = 0; i < cur->bc_nlevels; i++) {
268 for (i = 0; i < new->bc_nlevels; i++) {
445 (level == cur->bc_nlevels - 1)) {
748 (lev == cur->bc_nlevels - 1))
1262 ASSERT(level < cur->bc_nlevels);
1291 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1311 if (lev == cur->bc_nlevels) {
1318 ASSERT(lev < cur->bc_nlevels);
1370 ASSERT(level < cur->bc_nlevels);
1399 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1410 if (lev == cur->bc_nlevels) {
1417 ASSERT(lev < cur->bc_nlevels);
1461 (level == cur->bc_nlevels - 1)) {
1544 for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {
1567 ASSERT(level == 0 && cur->bc_nlevels == 1);
1693 for (ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {
1804 level == cur->bc_nlevels - 1)
1987 (level == cur->bc_nlevels - 1))
2301 if (level + 1 < cur->bc_nlevels) {
2350 level = cur->bc_nlevels - 1;
2374 cur->bc_nlevels++;
2471 block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);
2474 error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);
2486 cur->bc_nlevels - 1, 0, &right, &rbp);
2498 cur->bc_nlevels - 1, 0, &left, &lbp);
2505 xfs_btree_init_block(cur, cur->bc_nlevels, 2, new);
2536 xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);
2537 cur->bc_ptrs[cur->bc_nlevels] = nptr;
2538 cur->bc_nlevels++;
2567 level == cur->bc_nlevels - 1) {
2656 (level >= cur->bc_nlevels)) {
2884 cur->bc_nlevels = pcur->bc_nlevels;
2935 ASSERT(cur->bc_nlevels > 1);
2941 level = cur->bc_nlevels - 1;
3008 cur->bc_nlevels--;
3170 if (level == cur->bc_nlevels - 1) {
3247 level == cur->bc_nlevels - 2) {
3533 (level + 1 < cur->bc_nlevels)) {
3589 for (level = 1; level < cur->bc_nlevels; level++) {