Home
last modified time | relevance | path

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

/linux-6.12.1/fs/xfs/scrub/
Dbtree.c150 rec = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, block); in xchk_btree_rec()
167 keyp = xfs_btree_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
176 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
198 key = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
214 keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock); in xchk_btree_key()
222 key = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
223 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_key()
303 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock); in xchk_btree_block_check_sibling()
557 parent_low_key = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_check_keys()
569 cur->bc_levels[level + 1].ptr, parent_block); in xchk_btree_block_check_keys()
[all …]
Dtrace.c42 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()
44 xfs_buf_daddr(cur->bc_levels[level].bp)); in xchk_btree_cur_fsbno()
Dagb_bitmap.c96 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xagb_bitmap_set_btcur_path()
Drmap.c164 if (cur->bc_levels[level].ptr > 1) in xchk_rmapbt_check_unwritten_in_keyflags()
Dtrace.h568 __entry->ptr = cur->bc_levels[level].ptr;
609 __entry->ptr = cur->bc_levels[level].ptr;
651 __entry->ptr = cur->bc_levels[level].ptr;
691 __entry->ptr = cur->bc_levels[level].ptr;
731 __entry->ptr = cur->bc_levels[level].ptr;
Dbmap.c482 bs->cur->bc_levels[0].ptr == 1) { in xchk_bmapbt_rec()
/linux-6.12.1/fs/xfs/libxfs/
Dxfs_btree.c511 if (cur->bc_levels[i].bp) in xfs_btree_del_cursor()
512 xfs_trans_brelse(cur->bc_tp, cur->bc_levels[i].bp); in xfs_btree_del_cursor()
602 new->bc_levels[i].ptr = cur->bc_levels[i].ptr; in xfs_btree_dup_cursor()
603 new->bc_levels[i].ra = cur->bc_levels[i].ra; in xfs_btree_dup_cursor()
604 bp = cur->bc_levels[i].bp; in xfs_btree_dup_cursor()
619 new->bc_levels[i].bp = bp; in xfs_btree_dup_cursor()
861 *bpp = cur->bc_levels[level].bp; in xfs_btree_get_block()
891 cur->bc_levels[level].ptr = 1; in xfs_btree_firstrec()
921 cur->bc_levels[level].ptr = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1061 if ((cur->bc_levels[lev].ra | lr) == cur->bc_levels[lev].ra) in xfs_btree_readahead()
[all …]
Dxfs_btree.h289 struct xfs_btree_level bc_levels[]; member
300 return struct_size_t(struct xfs_btree_cur, bc_levels, nlevels); in xfs_btree_cur_sizeof()
Dxfs_alloc.c640 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
641 cntblock = XFS_BUF_TO_BLOCK(cnt_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
1632 acur->cnt->bc_levels[0].ptr = 1; in xfs_alloc_ag_vextent_lastblock()
Dxfs_bmap.c267 if (!cur->bc_levels[i].bp) in xfs_bmap_get_bp()
269 if (xfs_buf_daddr(cur->bc_levels[i].bp) == bno) in xfs_bmap_get_bp()
270 return cur->bc_levels[i].bp; in xfs_bmap_get_bp()
615 if (cur->bc_levels[0].bp == cbp) in xfs_bmap_btree_to_extents()
616 cur->bc_levels[0].bp = NULL; in xfs_bmap_btree_to_extents()
/linux-6.12.1/fs/xfs/
Dxfs_trace.h2506 __entry->ptr = cur->bc_levels[level].ptr;