Lines Matching refs:level
61 int level, in __xfs_btree_check_lblock() argument
80 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_lblock()
83 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
87 level + 1)) in __xfs_btree_check_lblock()
91 level + 1)) in __xfs_btree_check_lblock()
102 int level, in xfs_btree_check_lblock() argument
108 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()
188 int level, /* level of the btree block */ in xfs_btree_check_block() argument
192 return xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_block()
194 return xfs_btree_check_sblock(cur, block, level, bp); in xfs_btree_check_block()
202 int level) in xfs_btree_check_lptr() argument
204 if (level <= 0) in xfs_btree_check_lptr()
214 int level) in xfs_btree_check_sptr() argument
216 if (level <= 0) in xfs_btree_check_sptr()
230 int level) in xfs_btree_check_ptr() argument
234 level)) in xfs_btree_check_ptr()
240 level, index); in xfs_btree_check_ptr()
243 level)) in xfs_btree_check_ptr()
248 level, index); in xfs_btree_check_ptr()
582 int level) in xfs_btree_ptr_offset() argument
585 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset()
637 int level = xfs_btree_get_level(block); in xfs_btree_ptr_addr() local
642 ((char *)block + xfs_btree_ptr_offset(cur, n, level)); in xfs_btree_ptr_addr()
678 int level, /* level in btree */ in xfs_btree_get_block() argument
682 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()
687 *bpp = cur->bc_bufs[level]; in xfs_btree_get_block()
698 int level) /* level to change */ in xfs_btree_firstrec() argument
706 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_firstrec()
707 if (xfs_btree_check_block(cur, block, level, bp)) in xfs_btree_firstrec()
717 cur->bc_ptrs[level] = 1; in xfs_btree_firstrec()
728 int level) /* level to change */ in xfs_btree_lastrec() argument
736 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_lastrec()
737 if (xfs_btree_check_block(cur, block, level, bp)) in xfs_btree_lastrec()
747 cur->bc_ptrs[level] = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1091 __u16 level, in xfs_btree_init_block_int() argument
1100 buf->bb_level = cpu_to_be16(level); in xfs_btree_init_block_int()
1133 __u16 level, in xfs_btree_init_block() argument
1138 btnum, level, numrecs, owner, 0); in xfs_btree_init_block()
1145 int level, in xfs_btree_init_block_cur() argument
1162 cur->bc_btnum, level, numrecs, in xfs_btree_init_block_cur()
1175 int level) in xfs_btree_is_lastrec() argument
1179 if (level > 0) in xfs_btree_is_lastrec()
1442 int level = xfs_btree_get_level(block); in xfs_btree_log_ptrs() local
1446 xfs_btree_ptr_offset(cur, first, level), in xfs_btree_log_ptrs()
1447 xfs_btree_ptr_offset(cur, last + 1, level) - 1); in xfs_btree_log_ptrs()
1530 int level, in xfs_btree_increment() argument
1539 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()
1542 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA); in xfs_btree_increment()
1545 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_increment()
1548 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_increment()
1554 if (++cur->bc_ptrs[level] <= xfs_btree_get_numrecs(block)) in xfs_btree_increment()
1568 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()
1601 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) { in xfs_btree_increment()
1632 int level, in xfs_btree_decrement() argument
1641 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()
1644 xfs_btree_readahead(cur, level, XFS_BTCUR_LEFTRA); in xfs_btree_decrement()
1647 if (--cur->bc_ptrs[level] > 0) in xfs_btree_decrement()
1651 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_decrement()
1654 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_decrement()
1670 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()
1694 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) { in xfs_btree_decrement()
1720 int level, /* level in the btree */ in xfs_btree_lookup_get_block() argument
1730 (level == cur->bc_nlevels - 1)) { in xfs_btree_lookup_get_block()
1741 bp = cur->bc_bufs[level]; in xfs_btree_lookup_get_block()
1763 if (be16_to_cpu((*blkp)->bb_level) != level) in xfs_btree_lookup_get_block()
1767 if (level != 0 && be16_to_cpu((*blkp)->bb_numrecs) == 0) in xfs_btree_lookup_get_block()
1770 xfs_btree_setbuf(cur, level, bp); in xfs_btree_lookup_get_block()
1788 int level, in xfs_lookup_get_search_key() argument
1793 if (level == 0) { in xfs_lookup_get_search_key()
1816 int level; /* level in the btree */ in xfs_btree_lookup() local
1839 for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) { in xfs_btree_lookup()
1841 error = xfs_btree_lookup_get_block(cur, level, pp, &block); in xfs_btree_lookup()
1862 if (level != 0 || cur->bc_nlevels != 1) { in xfs_btree_lookup()
1886 kp = xfs_lookup_get_search_key(cur, level, in xfs_btree_lookup()
1909 if (level > 0) { in xfs_btree_lookup()
1918 error = xfs_btree_debug_check_ptr(cur, pp, 0, level); in xfs_btree_lookup()
1922 cur->bc_ptrs[level] = keyno; in xfs_btree_lookup()
2075 int level, in __xfs_btree_updkeys() argument
2091 if (level + 1 >= cur->bc_nlevels) in __xfs_btree_updkeys()
2094 trace_xfs_btree_updkeys(cur, level, bp0); in __xfs_btree_updkeys()
2099 for (level++; level < cur->bc_nlevels; level++) { in __xfs_btree_updkeys()
2103 block = xfs_btree_get_block(cur, level, &bp); in __xfs_btree_updkeys()
2104 trace_xfs_btree_updkeys(cur, level, bp); in __xfs_btree_updkeys()
2106 error = xfs_btree_check_block(cur, block, level, bp); in __xfs_btree_updkeys()
2110 ptr = cur->bc_ptrs[level]; in __xfs_btree_updkeys()
2119 if (level + 1 >= cur->bc_nlevels) in __xfs_btree_updkeys()
2131 int level) in xfs_btree_updkeys_force() argument
2136 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_updkeys_force()
2137 return __xfs_btree_updkeys(cur, level, block, bp, true); in xfs_btree_updkeys_force()
2146 int level) in xfs_btree_update_keys() argument
2154 ASSERT(level >= 0); in xfs_btree_update_keys()
2156 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_update_keys()
2158 return __xfs_btree_updkeys(cur, level, block, bp, false); in xfs_btree_update_keys()
2167 for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) { in xfs_btree_update_keys()
2171 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_update_keys()
2173 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_update_keys()
2177 ptr = cur->bc_ptrs[level]; in xfs_btree_update_keys()
2247 int level, in xfs_btree_lshift() argument
2265 level == cur->bc_nlevels - 1) in xfs_btree_lshift()
2269 right = xfs_btree_get_block(cur, level, &rbp); in xfs_btree_lshift()
2272 error = xfs_btree_check_block(cur, right, level, rbp); in xfs_btree_lshift()
2286 if (cur->bc_ptrs[level] <= 1) in xfs_btree_lshift()
2296 if (lrecs == cur->bc_ops->get_maxrecs(cur, level)) in xfs_btree_lshift()
2316 if (level > 0) { in xfs_btree_lshift()
2327 error = xfs_btree_debug_check_ptr(cur, rpp, 0, level); in xfs_btree_lshift()
2363 if (level > 0) { in xfs_btree_lshift()
2366 error = xfs_btree_debug_check_ptr(cur, rpp, i + 1, level); in xfs_btree_lshift()
2396 i = xfs_btree_firstrec(tcur, level); in xfs_btree_lshift()
2402 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_lshift()
2407 error = xfs_btree_update_keys(tcur, level); in xfs_btree_lshift()
2415 error = xfs_btree_update_keys(cur, level); in xfs_btree_lshift()
2420 cur->bc_ptrs[level]--; in xfs_btree_lshift()
2444 int level, in xfs_btree_rshift() argument
2460 (level == cur->bc_nlevels - 1)) in xfs_btree_rshift()
2464 left = xfs_btree_get_block(cur, level, &lbp); in xfs_btree_rshift()
2467 error = xfs_btree_check_block(cur, left, level, lbp); in xfs_btree_rshift()
2482 if (cur->bc_ptrs[level] >= lrecs) in xfs_btree_rshift()
2492 if (rrecs == cur->bc_ops->get_maxrecs(cur, level)) in xfs_btree_rshift()
2502 if (level > 0) { in xfs_btree_rshift()
2514 error = xfs_btree_debug_check_ptr(cur, rpp, i, level); in xfs_btree_rshift()
2522 error = xfs_btree_debug_check_ptr(cur, lpp, 0, level); in xfs_btree_rshift()
2566 i = xfs_btree_lastrec(tcur, level); in xfs_btree_rshift()
2572 error = xfs_btree_increment(tcur, level, &i); in xfs_btree_rshift()
2578 error = xfs_btree_update_keys(cur, level); in xfs_btree_rshift()
2584 error = xfs_btree_update_keys(tcur, level); in xfs_btree_rshift()
2613 int level, in __xfs_btree_split() argument
2637 left = xfs_btree_get_block(cur, level, &lbp); in __xfs_btree_split()
2640 error = xfs_btree_check_block(cur, left, level, lbp); in __xfs_btree_split()
2670 if ((lrecs & 1) && cur->bc_ptrs[level] <= rrecs + 1) in __xfs_btree_split()
2686 if (level > 0) { in __xfs_btree_split()
2699 error = xfs_btree_debug_check_ptr(cur, lpp, i, level); in __xfs_btree_split()
2756 error = xfs_btree_update_keys(cur, level); in __xfs_btree_split()
2766 if (cur->bc_ptrs[level] > lrecs + 1) { in __xfs_btree_split()
2767 xfs_btree_setbuf(cur, level, rbp); in __xfs_btree_split()
2768 cur->bc_ptrs[level] -= lrecs; in __xfs_btree_split()
2774 if (level + 1 < cur->bc_nlevels) { in __xfs_btree_split()
2778 (*curp)->bc_ptrs[level + 1]++; in __xfs_btree_split()
2793 int level; member
2828 args->result = __xfs_btree_split(args->cur, args->level, args->ptrp, in xfs_btree_split_worker()
2850 int level, in xfs_btree_split() argument
2860 return __xfs_btree_split(cur, level, ptrp, key, curp, stat); in xfs_btree_split()
2863 args.level = level; in xfs_btree_split()
2896 int level; /* btree level */ in xfs_btree_new_iroot() local
2904 level = cur->bc_nlevels - 1; in xfs_btree_new_iroot()
2938 cur->bc_ptrs[level + 1] = 1; in xfs_btree_new_iroot()
2946 error = xfs_btree_debug_check_ptr(cur, pp, i, level); in xfs_btree_new_iroot()
2953 error = xfs_btree_debug_check_ptr(cur, &nptr, 0, level); in xfs_btree_new_iroot()
2963 xfs_btree_setbuf(cur, level, cbp); in xfs_btree_new_iroot()
3113 int level, /* btree level */ in xfs_btree_make_block_unfull() argument
3125 level == cur->bc_nlevels - 1) { in xfs_btree_make_block_unfull()
3128 if (numrecs < cur->bc_ops->get_dmaxrecs(cur, level)) { in xfs_btree_make_block_unfull()
3147 error = xfs_btree_rshift(cur, level, stat); in xfs_btree_make_block_unfull()
3152 error = xfs_btree_lshift(cur, level, stat); in xfs_btree_make_block_unfull()
3157 *oindex = *index = cur->bc_ptrs[level]; in xfs_btree_make_block_unfull()
3167 error = xfs_btree_split(cur, level, nptr, key, ncur, stat); in xfs_btree_make_block_unfull()
3172 *index = cur->bc_ptrs[level]; in xfs_btree_make_block_unfull()
3183 int level, /* level to insert record at */ in xfs_btree_insrec() argument
3211 (level >= cur->bc_nlevels)) { in xfs_btree_insrec()
3219 ptr = cur->bc_ptrs[level]; in xfs_btree_insrec()
3230 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_insrec()
3235 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_insrec()
3241 if (level == 0) { in xfs_btree_insrec()
3256 if (numrecs == cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_insrec()
3257 error = xfs_btree_make_block_unfull(cur, level, numrecs, in xfs_btree_insrec()
3267 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_insrec()
3271 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_insrec()
3282 if (level > 0) { in xfs_btree_insrec()
3291 error = xfs_btree_debug_check_ptr(cur, pp, i, level); in xfs_btree_insrec()
3299 error = xfs_btree_debug_check_ptr(cur, ptrp, 0, level); in xfs_btree_insrec()
3350 error = xfs_btree_update_keys(cur, level); in xfs_btree_insrec()
3359 if (xfs_btree_is_lastrec(cur, block, level)) { in xfs_btree_insrec()
3395 int level; /* current level number in btree */ in xfs_btree_insert() local
3403 level = 0; in xfs_btree_insert()
3424 error = xfs_btree_insrec(pcur, level, &nptr, &rec, key, in xfs_btree_insert()
3436 level++; in xfs_btree_insert()
3486 int level; in xfs_btree_kill_iroot() local
3502 level = cur->bc_nlevels - 1; in xfs_btree_kill_iroot()
3503 if (level == 1) in xfs_btree_kill_iroot()
3513 cblock = xfs_btree_get_block(cur, level - 1, &cbp); in xfs_btree_kill_iroot()
3521 if (numrecs > cur->bc_ops->get_dmaxrecs(cur, level)) in xfs_btree_kill_iroot()
3533 index = numrecs - cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_kill_iroot()
3551 error = xfs_btree_debug_check_ptr(cur, cpp, i, level - 1); in xfs_btree_kill_iroot()
3562 cur->bc_bufs[level - 1] = NULL; in xfs_btree_kill_iroot()
3578 int level, in xfs_btree_kill_root() argument
3595 cur->bc_bufs[level] = NULL; in xfs_btree_kill_root()
3596 cur->bc_ra[level] = 0; in xfs_btree_kill_root()
3605 int level, in xfs_btree_dec_cursor() argument
3611 if (level > 0) { in xfs_btree_dec_cursor()
3612 error = xfs_btree_decrement(cur, level, &i); in xfs_btree_dec_cursor()
3630 int level, /* level removing record from */ in xfs_btree_delrec() argument
3655 ptr = cur->bc_ptrs[level]; in xfs_btree_delrec()
3662 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_delrec()
3666 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_delrec()
3681 if (level > 0) { in xfs_btree_delrec()
3690 error = xfs_btree_debug_check_ptr(cur, lpp, i, level); in xfs_btree_delrec()
3721 if (xfs_btree_is_lastrec(cur, block, level)) { in xfs_btree_delrec()
3731 if (level == cur->bc_nlevels - 1) { in xfs_btree_delrec()
3740 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3752 if (numrecs == 1 && level > 0) { in xfs_btree_delrec()
3759 error = xfs_btree_kill_root(cur, bp, level, pp); in xfs_btree_delrec()
3762 } else if (level > 0) { in xfs_btree_delrec()
3763 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3776 error = xfs_btree_update_keys(cur, level); in xfs_btree_delrec()
3785 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) { in xfs_btree_delrec()
3786 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3808 level == cur->bc_nlevels - 2) { in xfs_btree_delrec()
3811 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3838 i = xfs_btree_lastrec(tcur, level); in xfs_btree_delrec()
3844 error = xfs_btree_increment(tcur, level, &i); in xfs_btree_delrec()
3852 i = xfs_btree_lastrec(tcur, level); in xfs_btree_delrec()
3859 right = xfs_btree_get_block(tcur, level, &rbp); in xfs_btree_delrec()
3861 error = xfs_btree_check_block(tcur, right, level, rbp); in xfs_btree_delrec()
3874 cur->bc_ops->get_minrecs(tcur, level)) { in xfs_btree_delrec()
3875 error = xfs_btree_lshift(tcur, level, &i); in xfs_btree_delrec()
3880 cur->bc_ops->get_minrecs(tcur, level)); in xfs_btree_delrec()
3885 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3899 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3905 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_delrec()
3924 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3930 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_delrec()
3933 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3940 left = xfs_btree_get_block(tcur, level, &lbp); in xfs_btree_delrec()
3942 error = xfs_btree_check_block(cur, left, level, lbp); in xfs_btree_delrec()
3955 cur->bc_ops->get_minrecs(tcur, level)) { in xfs_btree_delrec()
3956 error = xfs_btree_rshift(tcur, level, &i); in xfs_btree_delrec()
3961 cur->bc_ops->get_minrecs(tcur, level)); in xfs_btree_delrec()
3964 if (level == 0) in xfs_btree_delrec()
3988 cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_delrec()
4005 cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_delrec()
4022 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
4036 if (level > 0) { in xfs_btree_delrec()
4049 error = xfs_btree_debug_check_ptr(cur, rpp, i, level); in xfs_btree_delrec()
4102 cur->bc_bufs[level] = lbp; in xfs_btree_delrec()
4103 cur->bc_ptrs[level] += lrecs; in xfs_btree_delrec()
4104 cur->bc_ra[level] = 0; in xfs_btree_delrec()
4111 (level + 1 < cur->bc_nlevels)) { in xfs_btree_delrec()
4112 error = xfs_btree_increment(cur, level + 1, &i); in xfs_btree_delrec()
4123 if (level > 0) in xfs_btree_delrec()
4124 cur->bc_ptrs[level]--; in xfs_btree_delrec()
4157 int level; in xfs_btree_delete() local
4167 for (level = 0, i = 2; i == 2; level++) { in xfs_btree_delete()
4168 error = xfs_btree_delrec(cur, level, &i); in xfs_btree_delete()
4186 for (level = 1; level < cur->bc_nlevels; level++) { in xfs_btree_delete()
4187 if (cur->bc_ptrs[level] == 0) { in xfs_btree_delete()
4188 error = xfs_btree_decrement(cur, level, &i); in xfs_btree_delete()
4247 int level, in xfs_btree_visit_block() argument
4257 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA); in xfs_btree_visit_block()
4258 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_visit_block()
4261 error = fn(cur, level, data); in xfs_btree_visit_block()
4270 return xfs_btree_lookup_get_block(cur, level, &rptr, &block); in xfs_btree_visit_block()
4283 int level; in xfs_btree_visit_blocks() local
4290 for (level = cur->bc_nlevels - 1; level >= 0; level--) { in xfs_btree_visit_blocks()
4292 error = xfs_btree_lookup_get_block(cur, level, &lptr, &block); in xfs_btree_visit_blocks()
4297 if (level > 0) { in xfs_btree_visit_blocks()
4314 error = xfs_btree_visit_block(cur, level, fn, data); in xfs_btree_visit_blocks()
4356 int level, in xfs_btree_block_change_owner() argument
4364 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_block_change_owner()
4384 ASSERT(level == cur->bc_nlevels - 1); in xfs_btree_block_change_owner()
4525 uint level; in xfs_btree_compute_maxlevels() local
4529 for (level = 1; maxblocks > 1; level++) in xfs_btree_compute_maxlevels()
4531 return level; in xfs_btree_compute_maxlevels()
4648 int level; in xfs_btree_overlapped_query_range() local
4654 level = cur->bc_nlevels - 1; in xfs_btree_overlapped_query_range()
4656 error = xfs_btree_lookup_get_block(cur, level, &ptr, &block); in xfs_btree_overlapped_query_range()
4659 xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4660 trace_xfs_btree_overlapped_query_range(cur, level, bp); in xfs_btree_overlapped_query_range()
4662 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_overlapped_query_range()
4666 cur->bc_ptrs[level] = 1; in xfs_btree_overlapped_query_range()
4668 while (level < cur->bc_nlevels) { in xfs_btree_overlapped_query_range()
4669 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4672 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) { in xfs_btree_overlapped_query_range()
4674 if (level < cur->bc_nlevels - 1) in xfs_btree_overlapped_query_range()
4675 cur->bc_ptrs[level + 1]++; in xfs_btree_overlapped_query_range()
4676 level++; in xfs_btree_overlapped_query_range()
4680 if (level == 0) { in xfs_btree_overlapped_query_range()
4705 cur->bc_ptrs[level]++; in xfs_btree_overlapped_query_range()
4710 lkp = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block); in xfs_btree_overlapped_query_range()
4711 hkp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block); in xfs_btree_overlapped_query_range()
4712 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block); in xfs_btree_overlapped_query_range()
4723 level--; in xfs_btree_overlapped_query_range()
4724 error = xfs_btree_lookup_get_block(cur, level, pp, in xfs_btree_overlapped_query_range()
4728 xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4729 trace_xfs_btree_overlapped_query_range(cur, level, bp); in xfs_btree_overlapped_query_range()
4731 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_overlapped_query_range()
4735 cur->bc_ptrs[level] = 1; in xfs_btree_overlapped_query_range()
4741 cur->bc_ptrs[level]++; in xfs_btree_overlapped_query_range()
4830 int level; in xfs_btree_calc_size() local
4835 for (level = 0, rval = 0; len > 1; level++) { in xfs_btree_calc_size()
4847 int level, in xfs_btree_count_blocks_helper() argument