Home
last modified time | relevance | path

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

/openbmc/linux/fs/xfs/scrub/
H A 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()
307 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock); in xchk_btree_block_check_sibling()
563 parent_low_key = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_check_keys()
575 cur->bc_levels[level + 1].ptr, parent_block); in xchk_btree_block_check_keys()
[all …]
H A Dtrace.c26 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()
28 xfs_buf_daddr(cur->bc_levels[level].bp)); in xchk_btree_cur_fsbno()
H A Dtrace.h393 __entry->ptr = cur->bc_levels[level].ptr;
434 __entry->ptr = cur->bc_levels[level].ptr;
476 __entry->ptr = cur->bc_levels[level].ptr;
516 __entry->ptr = cur->bc_levels[level].ptr;
556 __entry->ptr = cur->bc_levels[level].ptr;
H A Dbitmap.c311 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xagb_bitmap_set_btcur_path()
H A Drmap.c154 if (cur->bc_levels[level].ptr > 1) in xchk_rmapbt_check_unwritten_in_keyflags()
H A Dbmap.c458 bs->cur->bc_levels[0].ptr == 1) { in xchk_bmapbt_rec()
/openbmc/linux/fs/xfs/libxfs/
H A Dxfs_btree.c439 if (cur->bc_levels[i].bp) in xfs_btree_del_cursor()
440 xfs_trans_brelse(cur->bc_tp, cur->bc_levels[i].bp); in xfs_btree_del_cursor()
493 new->bc_levels[i].ptr = cur->bc_levels[i].ptr; in xfs_btree_dup_cursor()
494 new->bc_levels[i].ra = cur->bc_levels[i].ra; in xfs_btree_dup_cursor()
495 bp = cur->bc_levels[i].bp; in xfs_btree_dup_cursor()
507 new->bc_levels[i].bp = bp; in xfs_btree_dup_cursor()
759 *bpp = cur->bc_levels[level].bp; in xfs_btree_get_block()
789 cur->bc_levels[level].ptr = 1; in xfs_btree_firstrec()
819 cur->bc_levels[level].ptr = be16_to_cpu(block->bb_numrecs); in xfs_btree_lastrec()
1000 if ((cur->bc_levels[lev].ra | lr) == cur->bc_levels[lev].ra) in xfs_btree_readahead()
[all …]
H A Dxfs_btree.h293 struct xfs_btree_level bc_levels[]; member
304 return struct_size_t(struct xfs_btree_cur, bc_levels, nlevels); in xfs_btree_cur_sizeof()
H A Dxfs_alloc.c536 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
537 cntblock = XFS_BUF_TO_BLOCK(cnt_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
1497 acur->cnt->bc_levels[0].ptr = 1; in xfs_alloc_ag_vextent_lastblock()
H A 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()
585 if (cur->bc_levels[0].bp == cbp) in xfs_bmap_btree_to_extents()
586 cur->bc_levels[0].bp = NULL; in xfs_bmap_btree_to_extents()
/openbmc/linux/fs/xfs/
H A Dxfs_trace.h2472 __entry->ptr = cur->bc_levels[level].ptr;