Home
last modified time | relevance | path

Searched refs:bc_levels (Results 1 – 10 of 10) sorted by relevance

/linux-5.19.10/fs/xfs/scrub/ !
Dbtree.c139 rec = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, block); in xchk_btree_rec()
144 if (cur->bc_levels[0].ptr > 1 && in xchk_btree_rec()
155 keyp = xfs_btree_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
164 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
186 key = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
191 if (cur->bc_levels[level].ptr > 1 && in xchk_btree_key()
201 keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock); in xchk_btree_key()
209 key = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
210 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_key()
294 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock); in xchk_btree_block_check_sibling()
[all …]
Dtrace.c24 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()
26 xfs_buf_daddr(cur->bc_levels[level].bp)); in xchk_btree_cur_fsbno()
Dtrace.h351 __entry->ptr = cur->bc_levels[level].ptr;
392 __entry->ptr = cur->bc_levels[level].ptr;
434 __entry->ptr = cur->bc_levels[level].ptr;
474 __entry->ptr = cur->bc_levels[level].ptr;
514 __entry->ptr = cur->bc_levels[level].ptr;
Dbitmap.c259 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xbitmap_set_btcur_path()
Dbmap.c389 bs->cur->bc_levels[0].ptr == 1) { in xchk_bmapbt_rec()
/linux-5.19.10/fs/xfs/libxfs/ !
Dxfs_btree.c442 if (cur->bc_levels[i].bp) in xfs_btree_del_cursor()
443 xfs_trans_brelse(cur->bc_tp, cur->bc_levels[i].bp); in xfs_btree_del_cursor()
496 new->bc_levels[i].ptr = cur->bc_levels[i].ptr; in xfs_btree_dup_cursor()
497 new->bc_levels[i].ra = cur->bc_levels[i].ra; in xfs_btree_dup_cursor()
498 bp = cur->bc_levels[i].bp; in xfs_btree_dup_cursor()
510 new->bc_levels[i].bp = bp; in xfs_btree_dup_cursor()
762 *bpp = cur->bc_levels[level].bp; in xfs_btree_get_block()
792 cur->bc_levels[level].ptr = 1; in xfs_btree_firstrec()
822 cur->bc_levels[level].ptr = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1003 if ((cur->bc_levels[lev].ra | lr) == cur->bc_levels[lev].ra) in xfs_btree_readahead()
[all …]
Dxfs_btree.h253 struct xfs_btree_level bc_levels[]; member
264 return struct_size((struct xfs_btree_cur *)NULL, bc_levels, nlevels); in xfs_btree_cur_sizeof()
Dxfs_alloc.c509 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
510 cntblock = XFS_BUF_TO_BLOCK(cnt_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
1533 acur->cnt->bc_levels[0].ptr = 1; in xfs_alloc_ag_vextent_lastblock()
Dxfs_bmap.c241 if (!cur->bc_levels[i].bp) in xfs_bmap_get_bp()
243 if (xfs_buf_daddr(cur->bc_levels[i].bp) == bno) in xfs_bmap_get_bp()
244 return cur->bc_levels[i].bp; in xfs_bmap_get_bp()
580 if (cur->bc_levels[0].bp == cbp) in xfs_bmap_btree_to_extents()
581 cur->bc_levels[0].bp = NULL; in xfs_bmap_btree_to_extents()
/linux-5.19.10/fs/xfs/ !
Dxfs_trace.h2470 __entry->ptr = cur->bc_levels[level].ptr;