Home
last modified time | relevance | path

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

/linux/fs/xfs/scrub/
A Dbtree.c144 if (cur->bc_levels[0].ptr > 1 && in xchk_btree_rec()
191 if (cur->bc_levels[level].ptr > 1 && in xchk_btree_key()
676 cur->bc_levels[level].ptr = 1; in xchk_btree()
683 if (cur->bc_levels[level].ptr > in xchk_btree()
687 cur->bc_levels[level + 1].ptr++; in xchk_btree()
696 recp = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, in xchk_btree()
705 cur->bc_levels[level].ptr++; in xchk_btree()
710 if (cur->bc_levels[level].ptr > in xchk_btree()
714 cur->bc_levels[level + 1].ptr++; in xchk_btree()
725 cur->bc_levels[level].ptr++; in xchk_btree()
[all …]
A 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()
A 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;
A Dbitmap.c259 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xbitmap_set_btcur_path()
A Dbmap.c405 bs->cur->bc_levels[0].ptr == 1) { in xchk_bmapbt_rec()
/linux/fs/xfs/libxfs/
A Dxfs_btree.c370 if (cur->bc_levels[i].bp) in xfs_btree_del_cursor()
418 new->bc_levels[i].ptr = cur->bc_levels[i].ptr; in xfs_btree_dup_cursor()
419 new->bc_levels[i].ra = cur->bc_levels[i].ra; in xfs_btree_dup_cursor()
420 bp = cur->bc_levels[i].bp; in xfs_btree_dup_cursor()
432 new->bc_levels[i].bp = bp; in xfs_btree_dup_cursor()
925 if ((cur->bc_levels[lev].ra | lr) == cur->bc_levels[lev].ra) in xfs_btree_readahead()
928 cur->bc_levels[lev].ra |= lr; in xfs_btree_readahead()
994 if (cur->bc_levels[lev].bp) in xfs_btree_setbuf()
996 cur->bc_levels[lev].bp = bp; in xfs_btree_setbuf()
997 cur->bc_levels[lev].ra = 0; in xfs_btree_setbuf()
[all …]
A 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()
A Dxfs_alloc.c491 bnoblock = XFS_BUF_TO_BLOCK(bno_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
492 cntblock = XFS_BUF_TO_BLOCK(cnt_cur->bc_levels[0].bp); in xfs_alloc_fixup_trees()
1515 acur->cnt->bc_levels[0].ptr = 1; in xfs_alloc_ag_vextent_lastblock()
A Dxfs_bmap.c243 if (!cur->bc_levels[i].bp) in xfs_bmap_get_bp()
245 if (xfs_buf_daddr(cur->bc_levels[i].bp) == bno) in xfs_bmap_get_bp()
246 return cur->bc_levels[i].bp; in xfs_bmap_get_bp()
582 if (cur->bc_levels[0].bp == cbp) in xfs_bmap_btree_to_extents()
583 cur->bc_levels[0].bp = NULL; in xfs_bmap_btree_to_extents()
/linux/fs/xfs/
A Dxfs_trace.h2479 __entry->ptr = cur->bc_levels[level].ptr;

Completed in 44 milliseconds