Home
last modified time | relevance | path

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

/fs/xfs/scrub/
A Dbtree.c150 rec = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, block); in xchk_btree_rec()
569 cur->bc_levels[level + 1].ptr, parent_block); in xchk_btree_block_check_keys()
730 cur->bc_levels[level].ptr = 1; in xchk_btree()
737 if (cur->bc_levels[level].ptr > in xchk_btree()
741 cur->bc_levels[level + 1].ptr++; in xchk_btree()
750 recp = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, in xchk_btree()
759 cur->bc_levels[level].ptr++; in xchk_btree()
764 if (cur->bc_levels[level].ptr > in xchk_btree()
768 cur->bc_levels[level + 1].ptr++; in xchk_btree()
779 cur->bc_levels[level].ptr++; in xchk_btree()
[all …]
A Dtrace.c44 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()
46 xfs_buf_daddr(cur->bc_levels[level].bp)); in xchk_btree_cur_fsbno()
A Dagb_bitmap.c96 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xagb_bitmap_set_btcur_path()
A Drmap.c164 if (cur->bc_levels[level].ptr > 1) in xchk_rmapbt_check_unwritten_in_keyflags()
A Dtrace.h580 __entry->ptr = cur->bc_levels[level].ptr;
621 __entry->ptr = cur->bc_levels[level].ptr;
663 __entry->ptr = cur->bc_levels[level].ptr;
703 __entry->ptr = cur->bc_levels[level].ptr;
743 __entry->ptr = cur->bc_levels[level].ptr;
A Dbmap.c542 bs->cur->bc_levels[0].ptr == 1) { in xchk_bmapbt_rec()
/fs/xfs/libxfs/
A Dxfs_btree.c517 if (cur->bc_levels[i].bp) in xfs_btree_del_cursor()
596 new->bc_levels[i].ptr = cur->bc_levels[i].ptr; in xfs_btree_dup_cursor()
597 new->bc_levels[i].ra = cur->bc_levels[i].ra; in xfs_btree_dup_cursor()
598 bp = cur->bc_levels[i].bp; in xfs_btree_dup_cursor()
613 new->bc_levels[i].bp = bp; in xfs_btree_dup_cursor()
1055 if ((cur->bc_levels[lev].ra | lr) == cur->bc_levels[lev].ra) in xfs_btree_readahead()
1134 if (cur->bc_levels[lev].bp) in xfs_btree_setbuf()
1136 cur->bc_levels[lev].bp = bp; in xfs_btree_setbuf()
1137 cur->bc_levels[lev].ra = 0; in xfs_btree_setbuf()
3124 cur->bc_levels[1].ptr = 1; in xfs_btree_promote_leaf_iroot()
[all …]
A Dxfs_btree.h307 struct xfs_btree_level bc_levels[]; member
318 return struct_size_t(struct xfs_btree_cur, bc_levels, nlevels); in xfs_btree_cur_sizeof()
A Dxfs_bmap.c266 if (!cur->bc_levels[i].bp) in xfs_bmap_get_bp()
268 if (xfs_buf_daddr(cur->bc_levels[i].bp) == bno) in xfs_bmap_get_bp()
269 return cur->bc_levels[i].bp; in xfs_bmap_get_bp()
614 if (cur->bc_levels[0].bp == cbp) in xfs_bmap_btree_to_extents()
615 cur->bc_levels[0].bp = NULL; in xfs_bmap_btree_to_extents()
A Dxfs_alloc.c639 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
640 cntblock = XFS_BUF_TO_BLOCK(cnt_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
1631 acur->cnt->bc_levels[0].ptr = 1; in xfs_alloc_ag_vextent_lastblock()
/fs/xfs/
A Dxfs_trace.h2879 __entry->ptr = cur->bc_levels[level].ptr;

Completed in 57 milliseconds