Lines Matching refs:level
60 int level, in __xfs_btree_check_lblock() argument
79 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_lblock()
82 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
86 level + 1)) in __xfs_btree_check_lblock()
90 level + 1)) in __xfs_btree_check_lblock()
101 int level, in xfs_btree_check_lblock() argument
107 fa = __xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_lblock()
126 int level, in __xfs_btree_check_sblock() argument
143 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_sblock()
146 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock()
150 level + 1)) in __xfs_btree_check_sblock()
154 level + 1)) in __xfs_btree_check_sblock()
165 int level, in xfs_btree_check_sblock() argument
171 fa = __xfs_btree_check_sblock(cur, block, level, bp); in xfs_btree_check_sblock()
189 int level, /* level of the btree block */ in xfs_btree_check_block() argument
193 return xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_block()
195 return xfs_btree_check_sblock(cur, block, level, bp); in xfs_btree_check_block()
203 int level) in xfs_btree_check_lptr() argument
205 if (level <= 0) in xfs_btree_check_lptr()
215 int level) in xfs_btree_check_sptr() argument
217 if (level <= 0) in xfs_btree_check_sptr()
231 int level) in xfs_btree_check_ptr() argument
235 level)) in xfs_btree_check_ptr()
241 level, index); in xfs_btree_check_ptr()
244 level)) in xfs_btree_check_ptr()
249 level, index); in xfs_btree_check_ptr()
584 int level) in xfs_btree_ptr_offset() argument
587 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset()
639 int level = xfs_btree_get_level(block); in xfs_btree_ptr_addr() local
644 ((char *)block + xfs_btree_ptr_offset(cur, n, level)); in xfs_btree_ptr_addr()
670 int level, /* level in btree */ in xfs_btree_get_block() argument
674 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()
679 *bpp = cur->bc_bufs[level]; in xfs_btree_get_block()
725 int level) /* level to check */ in xfs_btree_islastblock() argument
730 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_islastblock()
731 xfs_btree_check_block(cur, block, level, bp); in xfs_btree_islastblock()
745 int level) /* level to change */ in xfs_btree_firstrec() argument
753 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_firstrec()
754 if (xfs_btree_check_block(cur, block, level, bp)) in xfs_btree_firstrec()
764 cur->bc_ptrs[level] = 1; in xfs_btree_firstrec()
775 int level) /* level to change */ in xfs_btree_lastrec() argument
783 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_lastrec()
784 if (xfs_btree_check_block(cur, block, level, bp)) in xfs_btree_lastrec()
794 cur->bc_ptrs[level] = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1138 __u16 level, in xfs_btree_init_block_int() argument
1147 buf->bb_level = cpu_to_be16(level); in xfs_btree_init_block_int()
1180 __u16 level, in xfs_btree_init_block() argument
1185 btnum, level, numrecs, owner, 0); in xfs_btree_init_block()
1192 int level, in xfs_btree_init_block_cur() argument
1209 cur->bc_btnum, level, numrecs, in xfs_btree_init_block_cur()
1222 int level) in xfs_btree_is_lastrec() argument
1226 if (level > 0) in xfs_btree_is_lastrec()
1490 int level = xfs_btree_get_level(block); in xfs_btree_log_ptrs() local
1494 xfs_btree_ptr_offset(cur, first, level), in xfs_btree_log_ptrs()
1495 xfs_btree_ptr_offset(cur, last + 1, level) - 1); in xfs_btree_log_ptrs()
1578 int level, in xfs_btree_increment() argument
1587 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()
1590 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA); in xfs_btree_increment()
1593 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_increment()
1596 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_increment()
1602 if (++cur->bc_ptrs[level] <= xfs_btree_get_numrecs(block)) in xfs_btree_increment()
1616 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()
1649 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) { in xfs_btree_increment()
1680 int level, in xfs_btree_decrement() argument
1689 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()
1692 xfs_btree_readahead(cur, level, XFS_BTCUR_LEFTRA); in xfs_btree_decrement()
1695 if (--cur->bc_ptrs[level] > 0) in xfs_btree_decrement()
1699 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_decrement()
1702 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_decrement()
1718 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()
1742 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) { in xfs_btree_decrement()
1768 int level, /* level in the btree */ in xfs_btree_lookup_get_block() argument
1778 (level == cur->bc_nlevels - 1)) { in xfs_btree_lookup_get_block()
1789 bp = cur->bc_bufs[level]; in xfs_btree_lookup_get_block()
1811 if (be16_to_cpu((*blkp)->bb_level) != level) in xfs_btree_lookup_get_block()
1815 if (level != 0 && be16_to_cpu((*blkp)->bb_numrecs) == 0) in xfs_btree_lookup_get_block()
1818 xfs_btree_setbuf(cur, level, bp); in xfs_btree_lookup_get_block()
1835 int level, in xfs_lookup_get_search_key() argument
1840 if (level == 0) { in xfs_lookup_get_search_key()
1863 int level; /* level in the btree */ in xfs_btree_lookup() local
1886 for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) { in xfs_btree_lookup()
1888 error = xfs_btree_lookup_get_block(cur, level, pp, &block); in xfs_btree_lookup()
1909 if (level != 0 || cur->bc_nlevels != 1) { in xfs_btree_lookup()
1933 kp = xfs_lookup_get_search_key(cur, level, in xfs_btree_lookup()
1956 if (level > 0) { in xfs_btree_lookup()
1965 error = xfs_btree_debug_check_ptr(cur, pp, 0, level); in xfs_btree_lookup()
1969 cur->bc_ptrs[level] = keyno; in xfs_btree_lookup()
2121 int level, in __xfs_btree_updkeys() argument
2137 if (level + 1 >= cur->bc_nlevels) in __xfs_btree_updkeys()
2140 trace_xfs_btree_updkeys(cur, level, bp0); in __xfs_btree_updkeys()
2145 for (level++; level < cur->bc_nlevels; level++) { in __xfs_btree_updkeys()
2149 block = xfs_btree_get_block(cur, level, &bp); in __xfs_btree_updkeys()
2150 trace_xfs_btree_updkeys(cur, level, bp); in __xfs_btree_updkeys()
2152 error = xfs_btree_check_block(cur, block, level, bp); in __xfs_btree_updkeys()
2156 ptr = cur->bc_ptrs[level]; in __xfs_btree_updkeys()
2165 if (level + 1 >= cur->bc_nlevels) in __xfs_btree_updkeys()
2177 int level) in xfs_btree_updkeys_force() argument
2182 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_updkeys_force()
2183 return __xfs_btree_updkeys(cur, level, block, bp, true); in xfs_btree_updkeys_force()
2192 int level) in xfs_btree_update_keys() argument
2200 ASSERT(level >= 0); in xfs_btree_update_keys()
2202 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_update_keys()
2204 return __xfs_btree_updkeys(cur, level, block, bp, false); in xfs_btree_update_keys()
2213 for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) { in xfs_btree_update_keys()
2217 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_update_keys()
2219 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_update_keys()
2223 ptr = cur->bc_ptrs[level]; in xfs_btree_update_keys()
2293 int level, in xfs_btree_lshift() argument
2311 level == cur->bc_nlevels - 1) in xfs_btree_lshift()
2315 right = xfs_btree_get_block(cur, level, &rbp); in xfs_btree_lshift()
2318 error = xfs_btree_check_block(cur, right, level, rbp); in xfs_btree_lshift()
2332 if (cur->bc_ptrs[level] <= 1) in xfs_btree_lshift()
2342 if (lrecs == cur->bc_ops->get_maxrecs(cur, level)) in xfs_btree_lshift()
2362 if (level > 0) { in xfs_btree_lshift()
2373 error = xfs_btree_debug_check_ptr(cur, rpp, 0, level); in xfs_btree_lshift()
2409 if (level > 0) { in xfs_btree_lshift()
2414 error = xfs_btree_debug_check_ptr(cur, rpp, i + 1, level); in xfs_btree_lshift()
2444 i = xfs_btree_firstrec(tcur, level); in xfs_btree_lshift()
2447 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_lshift()
2452 error = xfs_btree_update_keys(tcur, level); in xfs_btree_lshift()
2460 error = xfs_btree_update_keys(cur, level); in xfs_btree_lshift()
2465 cur->bc_ptrs[level]--; in xfs_btree_lshift()
2489 int level, in xfs_btree_rshift() argument
2505 (level == cur->bc_nlevels - 1)) in xfs_btree_rshift()
2509 left = xfs_btree_get_block(cur, level, &lbp); in xfs_btree_rshift()
2512 error = xfs_btree_check_block(cur, left, level, lbp); in xfs_btree_rshift()
2527 if (cur->bc_ptrs[level] >= lrecs) in xfs_btree_rshift()
2537 if (rrecs == cur->bc_ops->get_maxrecs(cur, level)) in xfs_btree_rshift()
2547 if (level > 0) { in xfs_btree_rshift()
2559 error = xfs_btree_debug_check_ptr(cur, rpp, i, level); in xfs_btree_rshift()
2567 error = xfs_btree_debug_check_ptr(cur, lpp, 0, level); in xfs_btree_rshift()
2611 i = xfs_btree_lastrec(tcur, level); in xfs_btree_rshift()
2614 error = xfs_btree_increment(tcur, level, &i); in xfs_btree_rshift()
2620 error = xfs_btree_update_keys(cur, level); in xfs_btree_rshift()
2626 error = xfs_btree_update_keys(tcur, level); in xfs_btree_rshift()
2655 int level, in __xfs_btree_split() argument
2679 left = xfs_btree_get_block(cur, level, &lbp); in __xfs_btree_split()
2682 error = xfs_btree_check_block(cur, left, level, lbp); in __xfs_btree_split()
2712 if ((lrecs & 1) && cur->bc_ptrs[level] <= rrecs + 1) in __xfs_btree_split()
2728 if (level > 0) { in __xfs_btree_split()
2741 error = xfs_btree_debug_check_ptr(cur, lpp, i, level); in __xfs_btree_split()
2798 error = xfs_btree_update_keys(cur, level); in __xfs_btree_split()
2808 if (cur->bc_ptrs[level] > lrecs + 1) { in __xfs_btree_split()
2809 xfs_btree_setbuf(cur, level, rbp); in __xfs_btree_split()
2810 cur->bc_ptrs[level] -= lrecs; in __xfs_btree_split()
2816 if (level + 1 < cur->bc_nlevels) { in __xfs_btree_split()
2820 (*curp)->bc_ptrs[level + 1]++; in __xfs_btree_split()
2835 int level; member
2869 args->result = __xfs_btree_split(args->cur, args->level, args->ptrp, in xfs_btree_split_worker()
2884 int level, in xfs_btree_split() argument
2894 return __xfs_btree_split(cur, level, ptrp, key, curp, stat); in xfs_btree_split()
2897 args.level = level; in xfs_btree_split()
2930 int level; /* btree level */ in xfs_btree_new_iroot() local
2938 level = cur->bc_nlevels - 1; in xfs_btree_new_iroot()
2972 cur->bc_ptrs[level + 1] = 1; in xfs_btree_new_iroot()
2980 error = xfs_btree_debug_check_ptr(cur, pp, i, level); in xfs_btree_new_iroot()
2987 error = xfs_btree_debug_check_ptr(cur, &nptr, 0, level); in xfs_btree_new_iroot()
2997 xfs_btree_setbuf(cur, level, cbp); in xfs_btree_new_iroot()
3147 int level, /* btree level */ in xfs_btree_make_block_unfull() argument
3159 level == cur->bc_nlevels - 1) { in xfs_btree_make_block_unfull()
3162 if (numrecs < cur->bc_ops->get_dmaxrecs(cur, level)) { in xfs_btree_make_block_unfull()
3181 error = xfs_btree_rshift(cur, level, stat); in xfs_btree_make_block_unfull()
3186 error = xfs_btree_lshift(cur, level, stat); in xfs_btree_make_block_unfull()
3191 *oindex = *index = cur->bc_ptrs[level]; in xfs_btree_make_block_unfull()
3201 error = xfs_btree_split(cur, level, nptr, key, ncur, stat); in xfs_btree_make_block_unfull()
3206 *index = cur->bc_ptrs[level]; in xfs_btree_make_block_unfull()
3217 int level, /* level to insert record at */ in xfs_btree_insrec() argument
3245 (level >= cur->bc_nlevels)) { in xfs_btree_insrec()
3253 ptr = cur->bc_ptrs[level]; in xfs_btree_insrec()
3264 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_insrec()
3269 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_insrec()
3275 if (level == 0) { in xfs_btree_insrec()
3290 if (numrecs == cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_insrec()
3291 error = xfs_btree_make_block_unfull(cur, level, numrecs, in xfs_btree_insrec()
3301 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_insrec()
3305 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_insrec()
3316 if (level > 0) { in xfs_btree_insrec()
3325 error = xfs_btree_debug_check_ptr(cur, pp, i, level); in xfs_btree_insrec()
3333 error = xfs_btree_debug_check_ptr(cur, ptrp, 0, level); in xfs_btree_insrec()
3384 error = xfs_btree_update_keys(cur, level); in xfs_btree_insrec()
3393 if (xfs_btree_is_lastrec(cur, block, level)) { in xfs_btree_insrec()
3429 int level; /* current level number in btree */ in xfs_btree_insert() local
3437 level = 0; in xfs_btree_insert()
3458 error = xfs_btree_insrec(pcur, level, &nptr, &rec, key, in xfs_btree_insert()
3467 level++; in xfs_btree_insert()
3517 int level; in xfs_btree_kill_iroot() local
3533 level = cur->bc_nlevels - 1; in xfs_btree_kill_iroot()
3534 if (level == 1) in xfs_btree_kill_iroot()
3544 cblock = xfs_btree_get_block(cur, level - 1, &cbp); in xfs_btree_kill_iroot()
3552 if (numrecs > cur->bc_ops->get_dmaxrecs(cur, level)) in xfs_btree_kill_iroot()
3564 index = numrecs - cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_kill_iroot()
3582 error = xfs_btree_debug_check_ptr(cur, cpp, i, level - 1); in xfs_btree_kill_iroot()
3593 cur->bc_bufs[level - 1] = NULL; in xfs_btree_kill_iroot()
3609 int level, in xfs_btree_kill_root() argument
3626 cur->bc_bufs[level] = NULL; in xfs_btree_kill_root()
3627 cur->bc_ra[level] = 0; in xfs_btree_kill_root()
3636 int level, in xfs_btree_dec_cursor() argument
3642 if (level > 0) { in xfs_btree_dec_cursor()
3643 error = xfs_btree_decrement(cur, level, &i); in xfs_btree_dec_cursor()
3661 int level, /* level removing record from */ in xfs_btree_delrec() argument
3686 ptr = cur->bc_ptrs[level]; in xfs_btree_delrec()
3693 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_delrec()
3697 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_delrec()
3712 if (level > 0) { in xfs_btree_delrec()
3721 error = xfs_btree_debug_check_ptr(cur, lpp, i, level); in xfs_btree_delrec()
3752 if (xfs_btree_is_lastrec(cur, block, level)) { in xfs_btree_delrec()
3762 if (level == cur->bc_nlevels - 1) { in xfs_btree_delrec()
3771 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3783 if (numrecs == 1 && level > 0) { in xfs_btree_delrec()
3790 error = xfs_btree_kill_root(cur, bp, level, pp); in xfs_btree_delrec()
3793 } else if (level > 0) { in xfs_btree_delrec()
3794 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3807 error = xfs_btree_update_keys(cur, level); in xfs_btree_delrec()
3816 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) { in xfs_btree_delrec()
3817 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3839 level == cur->bc_nlevels - 2) { in xfs_btree_delrec()
3842 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3869 i = xfs_btree_lastrec(tcur, level); in xfs_btree_delrec()
3872 error = xfs_btree_increment(tcur, level, &i); in xfs_btree_delrec()
3877 i = xfs_btree_lastrec(tcur, level); in xfs_btree_delrec()
3881 right = xfs_btree_get_block(tcur, level, &rbp); in xfs_btree_delrec()
3883 error = xfs_btree_check_block(tcur, right, level, rbp); in xfs_btree_delrec()
3896 cur->bc_ops->get_minrecs(tcur, level)) { in xfs_btree_delrec()
3897 error = xfs_btree_lshift(tcur, level, &i); in xfs_btree_delrec()
3902 cur->bc_ops->get_minrecs(tcur, level)); in xfs_btree_delrec()
3907 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3921 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3924 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_delrec()
3940 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3943 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_delrec()
3946 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3950 left = xfs_btree_get_block(tcur, level, &lbp); in xfs_btree_delrec()
3952 error = xfs_btree_check_block(cur, left, level, lbp); in xfs_btree_delrec()
3965 cur->bc_ops->get_minrecs(tcur, level)) { in xfs_btree_delrec()
3966 error = xfs_btree_rshift(tcur, level, &i); in xfs_btree_delrec()
3971 cur->bc_ops->get_minrecs(tcur, level)); in xfs_btree_delrec()
3974 if (level == 0) in xfs_btree_delrec()
3998 cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_delrec()
4015 cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_delrec()
4032 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
4046 if (level > 0) { in xfs_btree_delrec()
4059 error = xfs_btree_debug_check_ptr(cur, rpp, i, level); in xfs_btree_delrec()
4112 cur->bc_bufs[level] = lbp; in xfs_btree_delrec()
4113 cur->bc_ptrs[level] += lrecs; in xfs_btree_delrec()
4114 cur->bc_ra[level] = 0; in xfs_btree_delrec()
4121 (level + 1 < cur->bc_nlevels)) { in xfs_btree_delrec()
4122 error = xfs_btree_increment(cur, level + 1, &i); in xfs_btree_delrec()
4133 if (level > 0) in xfs_btree_delrec()
4134 cur->bc_ptrs[level]--; in xfs_btree_delrec()
4167 int level; in xfs_btree_delete() local
4177 for (level = 0, i = 2; i == 2; level++) { in xfs_btree_delete()
4178 error = xfs_btree_delrec(cur, level, &i); in xfs_btree_delete()
4196 for (level = 1; level < cur->bc_nlevels; level++) { in xfs_btree_delete()
4197 if (cur->bc_ptrs[level] == 0) { in xfs_btree_delete()
4198 error = xfs_btree_decrement(cur, level, &i); in xfs_btree_delete()
4257 int level, in xfs_btree_visit_block() argument
4267 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA); in xfs_btree_visit_block()
4268 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_visit_block()
4271 error = fn(cur, level, data); in xfs_btree_visit_block()
4280 return xfs_btree_lookup_get_block(cur, level, &rptr, &block); in xfs_btree_visit_block()
4292 int level; in xfs_btree_visit_blocks() local
4299 for (level = cur->bc_nlevels - 1; level >= 0; level--) { in xfs_btree_visit_blocks()
4301 error = xfs_btree_lookup_get_block(cur, level, &lptr, &block); in xfs_btree_visit_blocks()
4306 if (level > 0) { in xfs_btree_visit_blocks()
4318 error = xfs_btree_visit_block(cur, level, fn, data); in xfs_btree_visit_blocks()
4360 int level, in xfs_btree_block_change_owner() argument
4368 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_block_change_owner()
4388 ASSERT(level == cur->bc_nlevels - 1); in xfs_btree_block_change_owner()
4529 uint level; in xfs_btree_compute_maxlevels() local
4533 for (level = 1; maxblocks > 1; level++) in xfs_btree_compute_maxlevels()
4535 return level; in xfs_btree_compute_maxlevels()
4652 int level; in xfs_btree_overlapped_query_range() local
4658 level = cur->bc_nlevels - 1; in xfs_btree_overlapped_query_range()
4660 error = xfs_btree_lookup_get_block(cur, level, &ptr, &block); in xfs_btree_overlapped_query_range()
4663 xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4664 trace_xfs_btree_overlapped_query_range(cur, level, bp); in xfs_btree_overlapped_query_range()
4666 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_overlapped_query_range()
4670 cur->bc_ptrs[level] = 1; in xfs_btree_overlapped_query_range()
4672 while (level < cur->bc_nlevels) { in xfs_btree_overlapped_query_range()
4673 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4676 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) { in xfs_btree_overlapped_query_range()
4678 if (level < cur->bc_nlevels - 1) in xfs_btree_overlapped_query_range()
4679 cur->bc_ptrs[level + 1]++; in xfs_btree_overlapped_query_range()
4680 level++; in xfs_btree_overlapped_query_range()
4684 if (level == 0) { in xfs_btree_overlapped_query_range()
4709 cur->bc_ptrs[level]++; in xfs_btree_overlapped_query_range()
4714 lkp = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block); in xfs_btree_overlapped_query_range()
4715 hkp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block); in xfs_btree_overlapped_query_range()
4716 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block); in xfs_btree_overlapped_query_range()
4727 level--; in xfs_btree_overlapped_query_range()
4728 error = xfs_btree_lookup_get_block(cur, level, pp, in xfs_btree_overlapped_query_range()
4732 xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4733 trace_xfs_btree_overlapped_query_range(cur, level, bp); in xfs_btree_overlapped_query_range()
4735 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_overlapped_query_range()
4739 cur->bc_ptrs[level] = 1; in xfs_btree_overlapped_query_range()
4745 cur->bc_ptrs[level]++; in xfs_btree_overlapped_query_range()
4834 int level; in xfs_btree_calc_size() local
4839 for (level = 0, rval = 0; len > 1; level++) { in xfs_btree_calc_size()
4851 int level, in xfs_btree_count_blocks_helper() argument