Lines Matching refs:level
62 int level, in __xfs_btree_check_lblock() argument
81 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_lblock()
84 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
88 level + 1)) in __xfs_btree_check_lblock()
92 level + 1)) in __xfs_btree_check_lblock()
103 int level, in xfs_btree_check_lblock() argument
109 fa = __xfs_btree_check_lblock(cur, block, level, bp); in xfs_btree_check_lblock()
127 int level, in __xfs_btree_check_sblock() argument
144 if (be16_to_cpu(block->bb_level) != level) in __xfs_btree_check_sblock()
147 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock()
151 level + 1)) in __xfs_btree_check_sblock()
155 level + 1)) in __xfs_btree_check_sblock()
166 int level, in xfs_btree_check_sblock() argument
172 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()
579 int level) in xfs_btree_ptr_offset() argument
582 cur->bc_ops->get_maxrecs(cur, level) * cur->bc_ops->key_len + in xfs_btree_ptr_offset()
634 int level = xfs_btree_get_level(block); in xfs_btree_ptr_addr() local
639 ((char *)block + xfs_btree_ptr_offset(cur, n, level)); in xfs_btree_ptr_addr()
675 int level, /* level in btree */ in xfs_btree_get_block() argument
679 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()
684 *bpp = cur->bc_levels[level].bp; in xfs_btree_get_block()
695 int level) /* level to change */ in xfs_btree_firstrec() argument
703 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_firstrec()
704 if (xfs_btree_check_block(cur, block, level, bp)) in xfs_btree_firstrec()
714 cur->bc_levels[level].ptr = 1; in xfs_btree_firstrec()
725 int level) /* level to change */ in xfs_btree_lastrec() argument
733 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_lastrec()
734 if (xfs_btree_check_block(cur, block, level, bp)) in xfs_btree_lastrec()
744 cur->bc_levels[level].ptr = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1088 __u16 level, in xfs_btree_init_block_int() argument
1097 buf->bb_level = cpu_to_be16(level); in xfs_btree_init_block_int()
1130 __u16 level, in xfs_btree_init_block() argument
1135 btnum, level, numrecs, owner, 0); in xfs_btree_init_block()
1142 int level, in xfs_btree_init_block_cur() argument
1159 xfs_buf_daddr(bp), cur->bc_btnum, level, in xfs_btree_init_block_cur()
1172 int level) in xfs_btree_is_lastrec() argument
1176 if (level > 0) in xfs_btree_is_lastrec()
1439 int level = xfs_btree_get_level(block); in xfs_btree_log_ptrs() local
1443 xfs_btree_ptr_offset(cur, first, level), in xfs_btree_log_ptrs()
1444 xfs_btree_ptr_offset(cur, last + 1, level) - 1); in xfs_btree_log_ptrs()
1527 int level, in xfs_btree_increment() argument
1536 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()
1539 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA); in xfs_btree_increment()
1542 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_increment()
1545 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_increment()
1551 if (++cur->bc_levels[level].ptr <= xfs_btree_get_numrecs(block)) in xfs_btree_increment()
1565 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()
1598 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) { in xfs_btree_increment()
1629 int level, in xfs_btree_decrement() argument
1638 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()
1641 xfs_btree_readahead(cur, level, XFS_BTCUR_LEFTRA); in xfs_btree_decrement()
1644 if (--cur->bc_levels[level].ptr > 0) in xfs_btree_decrement()
1648 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_decrement()
1651 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_decrement()
1667 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()
1691 for (block = xfs_btree_get_block(cur, lev, &bp); lev > level; ) { in xfs_btree_decrement()
1717 int level, /* level in the btree */ in xfs_btree_lookup_get_block() argument
1727 (level == cur->bc_nlevels - 1)) { in xfs_btree_lookup_get_block()
1738 bp = cur->bc_levels[level].bp; in xfs_btree_lookup_get_block()
1760 if (be16_to_cpu((*blkp)->bb_level) != level) in xfs_btree_lookup_get_block()
1764 if (level != 0 && be16_to_cpu((*blkp)->bb_numrecs) == 0) in xfs_btree_lookup_get_block()
1767 xfs_btree_setbuf(cur, level, bp); in xfs_btree_lookup_get_block()
1785 int level, in xfs_lookup_get_search_key() argument
1790 if (level == 0) { in xfs_lookup_get_search_key()
1813 int level; /* level in the btree */ in xfs_btree_lookup() local
1836 for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) { in xfs_btree_lookup()
1838 error = xfs_btree_lookup_get_block(cur, level, pp, &block); in xfs_btree_lookup()
1859 if (level != 0 || cur->bc_nlevels != 1) { in xfs_btree_lookup()
1883 kp = xfs_lookup_get_search_key(cur, level, in xfs_btree_lookup()
1906 if (level > 0) { in xfs_btree_lookup()
1915 error = xfs_btree_debug_check_ptr(cur, pp, 0, level); in xfs_btree_lookup()
1919 cur->bc_levels[level].ptr = keyno; in xfs_btree_lookup()
2072 int level, in __xfs_btree_updkeys() argument
2088 if (level + 1 >= cur->bc_nlevels) in __xfs_btree_updkeys()
2091 trace_xfs_btree_updkeys(cur, level, bp0); in __xfs_btree_updkeys()
2096 for (level++; level < cur->bc_nlevels; level++) { in __xfs_btree_updkeys()
2100 block = xfs_btree_get_block(cur, level, &bp); in __xfs_btree_updkeys()
2101 trace_xfs_btree_updkeys(cur, level, bp); in __xfs_btree_updkeys()
2103 error = xfs_btree_check_block(cur, block, level, bp); in __xfs_btree_updkeys()
2107 ptr = cur->bc_levels[level].ptr; in __xfs_btree_updkeys()
2116 if (level + 1 >= cur->bc_nlevels) in __xfs_btree_updkeys()
2128 int level) in xfs_btree_updkeys_force() argument
2133 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_updkeys_force()
2134 return __xfs_btree_updkeys(cur, level, block, bp, true); in xfs_btree_updkeys_force()
2143 int level) in xfs_btree_update_keys() argument
2151 ASSERT(level >= 0); in xfs_btree_update_keys()
2153 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_update_keys()
2155 return __xfs_btree_updkeys(cur, level, block, bp, false); in xfs_btree_update_keys()
2164 for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) { in xfs_btree_update_keys()
2168 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_update_keys()
2170 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_update_keys()
2174 ptr = cur->bc_levels[level].ptr; in xfs_btree_update_keys()
2244 int level, in xfs_btree_lshift() argument
2262 level == cur->bc_nlevels - 1) in xfs_btree_lshift()
2266 right = xfs_btree_get_block(cur, level, &rbp); in xfs_btree_lshift()
2269 error = xfs_btree_check_block(cur, right, level, rbp); in xfs_btree_lshift()
2283 if (cur->bc_levels[level].ptr <= 1) in xfs_btree_lshift()
2293 if (lrecs == cur->bc_ops->get_maxrecs(cur, level)) in xfs_btree_lshift()
2313 if (level > 0) { in xfs_btree_lshift()
2324 error = xfs_btree_debug_check_ptr(cur, rpp, 0, level); in xfs_btree_lshift()
2360 if (level > 0) { in xfs_btree_lshift()
2363 error = xfs_btree_debug_check_ptr(cur, rpp, i + 1, level); in xfs_btree_lshift()
2393 i = xfs_btree_firstrec(tcur, level); in xfs_btree_lshift()
2399 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_lshift()
2404 error = xfs_btree_update_keys(tcur, level); in xfs_btree_lshift()
2412 error = xfs_btree_update_keys(cur, level); in xfs_btree_lshift()
2417 cur->bc_levels[level].ptr--; in xfs_btree_lshift()
2441 int level, in xfs_btree_rshift() argument
2457 (level == cur->bc_nlevels - 1)) in xfs_btree_rshift()
2461 left = xfs_btree_get_block(cur, level, &lbp); in xfs_btree_rshift()
2464 error = xfs_btree_check_block(cur, left, level, lbp); in xfs_btree_rshift()
2479 if (cur->bc_levels[level].ptr >= lrecs) in xfs_btree_rshift()
2489 if (rrecs == cur->bc_ops->get_maxrecs(cur, level)) in xfs_btree_rshift()
2499 if (level > 0) { in xfs_btree_rshift()
2511 error = xfs_btree_debug_check_ptr(cur, rpp, i, level); in xfs_btree_rshift()
2519 error = xfs_btree_debug_check_ptr(cur, lpp, 0, level); in xfs_btree_rshift()
2563 i = xfs_btree_lastrec(tcur, level); in xfs_btree_rshift()
2569 error = xfs_btree_increment(tcur, level, &i); in xfs_btree_rshift()
2575 error = xfs_btree_update_keys(cur, level); in xfs_btree_rshift()
2581 error = xfs_btree_update_keys(tcur, level); in xfs_btree_rshift()
2610 int level, in __xfs_btree_split() argument
2634 left = xfs_btree_get_block(cur, level, &lbp); in __xfs_btree_split()
2637 error = xfs_btree_check_block(cur, left, level, lbp); in __xfs_btree_split()
2667 if ((lrecs & 1) && cur->bc_levels[level].ptr <= rrecs + 1) in __xfs_btree_split()
2683 if (level > 0) { in __xfs_btree_split()
2696 error = xfs_btree_debug_check_ptr(cur, lpp, i, level); in __xfs_btree_split()
2753 error = xfs_btree_update_keys(cur, level); in __xfs_btree_split()
2763 if (cur->bc_levels[level].ptr > lrecs + 1) { in __xfs_btree_split()
2764 xfs_btree_setbuf(cur, level, rbp); in __xfs_btree_split()
2765 cur->bc_levels[level].ptr -= lrecs; in __xfs_btree_split()
2771 if (level + 1 < cur->bc_nlevels) { in __xfs_btree_split()
2775 (*curp)->bc_levels[level + 1].ptr++; in __xfs_btree_split()
2791 int level; member
2826 args->result = __xfs_btree_split(args->cur, args->level, args->ptrp, in xfs_btree_split_worker()
2848 int level, in xfs_btree_split() argument
2858 return __xfs_btree_split(cur, level, ptrp, key, curp, stat); in xfs_btree_split()
2861 args.level = level; in xfs_btree_split()
2897 int level; /* btree level */ in xfs_btree_new_iroot() local
2905 level = cur->bc_nlevels - 1; in xfs_btree_new_iroot()
2941 cur->bc_levels[level + 1].ptr = 1; in xfs_btree_new_iroot()
2949 error = xfs_btree_debug_check_ptr(cur, pp, i, level); in xfs_btree_new_iroot()
2956 error = xfs_btree_debug_check_ptr(cur, &nptr, 0, level); in xfs_btree_new_iroot()
2966 xfs_btree_setbuf(cur, level, cbp); in xfs_btree_new_iroot()
3117 int level, /* btree level */ in xfs_btree_make_block_unfull() argument
3129 level == cur->bc_nlevels - 1) { in xfs_btree_make_block_unfull()
3132 if (numrecs < cur->bc_ops->get_dmaxrecs(cur, level)) { in xfs_btree_make_block_unfull()
3151 error = xfs_btree_rshift(cur, level, stat); in xfs_btree_make_block_unfull()
3156 error = xfs_btree_lshift(cur, level, stat); in xfs_btree_make_block_unfull()
3161 *oindex = *index = cur->bc_levels[level].ptr; in xfs_btree_make_block_unfull()
3171 error = xfs_btree_split(cur, level, nptr, key, ncur, stat); in xfs_btree_make_block_unfull()
3176 *index = cur->bc_levels[level].ptr; in xfs_btree_make_block_unfull()
3187 int level, /* level to insert record at */ in xfs_btree_insrec() argument
3215 (level >= cur->bc_nlevels)) { in xfs_btree_insrec()
3223 ptr = cur->bc_levels[level].ptr; in xfs_btree_insrec()
3234 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_insrec()
3239 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_insrec()
3245 if (level == 0) { in xfs_btree_insrec()
3260 if (numrecs == cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_insrec()
3261 error = xfs_btree_make_block_unfull(cur, level, numrecs, in xfs_btree_insrec()
3271 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_insrec()
3275 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_insrec()
3286 if (level > 0) { in xfs_btree_insrec()
3295 error = xfs_btree_debug_check_ptr(cur, pp, i, level); in xfs_btree_insrec()
3303 error = xfs_btree_debug_check_ptr(cur, ptrp, 0, level); in xfs_btree_insrec()
3354 error = xfs_btree_update_keys(cur, level); in xfs_btree_insrec()
3363 if (xfs_btree_is_lastrec(cur, block, level)) { in xfs_btree_insrec()
3399 int level; /* current level number in btree */ in xfs_btree_insert() local
3407 level = 0; in xfs_btree_insert()
3428 error = xfs_btree_insrec(pcur, level, &nptr, &rec, key, in xfs_btree_insert()
3440 level++; in xfs_btree_insert()
3490 int level; in xfs_btree_kill_iroot() local
3506 level = cur->bc_nlevels - 1; in xfs_btree_kill_iroot()
3507 if (level == 1) in xfs_btree_kill_iroot()
3517 cblock = xfs_btree_get_block(cur, level - 1, &cbp); in xfs_btree_kill_iroot()
3525 if (numrecs > cur->bc_ops->get_dmaxrecs(cur, level)) in xfs_btree_kill_iroot()
3537 index = numrecs - cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_kill_iroot()
3555 error = xfs_btree_debug_check_ptr(cur, cpp, i, level - 1); in xfs_btree_kill_iroot()
3566 cur->bc_levels[level - 1].bp = NULL; in xfs_btree_kill_iroot()
3582 int level, in xfs_btree_kill_root() argument
3599 cur->bc_levels[level].bp = NULL; in xfs_btree_kill_root()
3600 cur->bc_levels[level].ra = 0; in xfs_btree_kill_root()
3609 int level, in xfs_btree_dec_cursor() argument
3615 if (level > 0) { in xfs_btree_dec_cursor()
3616 error = xfs_btree_decrement(cur, level, &i); in xfs_btree_dec_cursor()
3634 int level, /* level removing record from */ in xfs_btree_delrec() argument
3659 ptr = cur->bc_levels[level].ptr; in xfs_btree_delrec()
3666 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_delrec()
3670 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_delrec()
3685 if (level > 0) { in xfs_btree_delrec()
3694 error = xfs_btree_debug_check_ptr(cur, lpp, i, level); in xfs_btree_delrec()
3725 if (xfs_btree_is_lastrec(cur, block, level)) { in xfs_btree_delrec()
3735 if (level == cur->bc_nlevels - 1) { in xfs_btree_delrec()
3744 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3756 if (numrecs == 1 && level > 0) { in xfs_btree_delrec()
3763 error = xfs_btree_kill_root(cur, bp, level, pp); in xfs_btree_delrec()
3766 } else if (level > 0) { in xfs_btree_delrec()
3767 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3780 error = xfs_btree_update_keys(cur, level); in xfs_btree_delrec()
3789 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) { in xfs_btree_delrec()
3790 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3812 level == cur->bc_nlevels - 2) { in xfs_btree_delrec()
3815 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3842 i = xfs_btree_lastrec(tcur, level); in xfs_btree_delrec()
3848 error = xfs_btree_increment(tcur, level, &i); in xfs_btree_delrec()
3856 i = xfs_btree_lastrec(tcur, level); in xfs_btree_delrec()
3863 right = xfs_btree_get_block(tcur, level, &rbp); in xfs_btree_delrec()
3865 error = xfs_btree_check_block(tcur, right, level, rbp); in xfs_btree_delrec()
3878 cur->bc_ops->get_minrecs(tcur, level)) { in xfs_btree_delrec()
3879 error = xfs_btree_lshift(tcur, level, &i); in xfs_btree_delrec()
3884 cur->bc_ops->get_minrecs(tcur, level)); in xfs_btree_delrec()
3889 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
3903 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3909 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_delrec()
3928 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3934 error = xfs_btree_decrement(tcur, level, &i); in xfs_btree_delrec()
3937 i = xfs_btree_firstrec(tcur, level); in xfs_btree_delrec()
3944 left = xfs_btree_get_block(tcur, level, &lbp); in xfs_btree_delrec()
3946 error = xfs_btree_check_block(cur, left, level, lbp); in xfs_btree_delrec()
3959 cur->bc_ops->get_minrecs(tcur, level)) { in xfs_btree_delrec()
3960 error = xfs_btree_rshift(tcur, level, &i); in xfs_btree_delrec()
3965 cur->bc_ops->get_minrecs(tcur, level)); in xfs_btree_delrec()
3968 if (level == 0) in xfs_btree_delrec()
3992 cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_delrec()
4009 cur->bc_ops->get_maxrecs(cur, level)) { in xfs_btree_delrec()
4026 error = xfs_btree_dec_cursor(cur, level, stat); in xfs_btree_delrec()
4040 if (level > 0) { in xfs_btree_delrec()
4053 error = xfs_btree_debug_check_ptr(cur, rpp, i, level); in xfs_btree_delrec()
4106 cur->bc_levels[level].bp = lbp; in xfs_btree_delrec()
4107 cur->bc_levels[level].ptr += lrecs; in xfs_btree_delrec()
4108 cur->bc_levels[level].ra = 0; in xfs_btree_delrec()
4115 (level + 1 < cur->bc_nlevels)) { in xfs_btree_delrec()
4116 error = xfs_btree_increment(cur, level + 1, &i); in xfs_btree_delrec()
4127 if (level > 0) in xfs_btree_delrec()
4128 cur->bc_levels[level].ptr--; in xfs_btree_delrec()
4161 int level; in xfs_btree_delete() local
4171 for (level = 0, i = 2; i == 2; level++) { in xfs_btree_delete()
4172 error = xfs_btree_delrec(cur, level, &i); in xfs_btree_delete()
4190 for (level = 1; level < cur->bc_nlevels; level++) { in xfs_btree_delete()
4191 if (cur->bc_levels[level].ptr == 0) { in xfs_btree_delete()
4192 error = xfs_btree_decrement(cur, level, &i); in xfs_btree_delete()
4251 int level, in xfs_btree_visit_block() argument
4261 xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA); in xfs_btree_visit_block()
4262 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_visit_block()
4265 error = fn(cur, level, data); in xfs_btree_visit_block()
4274 return xfs_btree_lookup_get_block(cur, level, &rptr, &block); in xfs_btree_visit_block()
4287 int level; in xfs_btree_visit_blocks() local
4294 for (level = cur->bc_nlevels - 1; level >= 0; level--) { in xfs_btree_visit_blocks()
4296 error = xfs_btree_lookup_get_block(cur, level, &lptr, &block); in xfs_btree_visit_blocks()
4301 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()
4707 int level; in xfs_btree_overlapped_query_range() local
4713 level = cur->bc_nlevels - 1; in xfs_btree_overlapped_query_range()
4715 error = xfs_btree_lookup_get_block(cur, level, &ptr, &block); in xfs_btree_overlapped_query_range()
4718 xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4719 trace_xfs_btree_overlapped_query_range(cur, level, bp); in xfs_btree_overlapped_query_range()
4721 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_overlapped_query_range()
4725 cur->bc_levels[level].ptr = 1; in xfs_btree_overlapped_query_range()
4727 while (level < cur->bc_nlevels) { in xfs_btree_overlapped_query_range()
4728 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4731 if (cur->bc_levels[level].ptr > in xfs_btree_overlapped_query_range()
4734 if (level < cur->bc_nlevels - 1) in xfs_btree_overlapped_query_range()
4735 cur->bc_levels[level + 1].ptr++; in xfs_btree_overlapped_query_range()
4736 level++; in xfs_btree_overlapped_query_range()
4740 if (level == 0) { in xfs_btree_overlapped_query_range()
4766 cur->bc_levels[level].ptr++; in xfs_btree_overlapped_query_range()
4771 lkp = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block); in xfs_btree_overlapped_query_range()
4772 hkp = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, in xfs_btree_overlapped_query_range()
4774 pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block); in xfs_btree_overlapped_query_range()
4785 level--; in xfs_btree_overlapped_query_range()
4786 error = xfs_btree_lookup_get_block(cur, level, pp, in xfs_btree_overlapped_query_range()
4790 xfs_btree_get_block(cur, level, &bp); in xfs_btree_overlapped_query_range()
4791 trace_xfs_btree_overlapped_query_range(cur, level, bp); in xfs_btree_overlapped_query_range()
4793 error = xfs_btree_check_block(cur, block, level, bp); in xfs_btree_overlapped_query_range()
4797 cur->bc_levels[level].ptr = 1; in xfs_btree_overlapped_query_range()
4803 cur->bc_levels[level].ptr++; in xfs_btree_overlapped_query_range()
4887 int level, in xfs_btree_count_blocks_helper() argument