bc_nlevels        461 fs/xfs/libxfs/xfs_alloc.c 	if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) {
bc_nlevels        500 fs/xfs/libxfs/xfs_alloc_btree.c 		cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
bc_nlevels        505 fs/xfs/libxfs/xfs_alloc_btree.c 		cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
bc_nlevels        302 fs/xfs/libxfs/xfs_bmap_btree.c 	if (level == cur->bc_nlevels - 1) {
bc_nlevels        320 fs/xfs/libxfs/xfs_bmap_btree.c 	if (level == cur->bc_nlevels - 1) {
bc_nlevels        348 fs/xfs/libxfs/xfs_bmap_btree.c 	if (level != cur->bc_nlevels - 1)
bc_nlevels        559 fs/xfs/libxfs/xfs_bmap_btree.c 	cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1;
bc_nlevels        372 fs/xfs/libxfs/xfs_btree.c 	for (i = 0; i < cur->bc_nlevels; i++) {
bc_nlevels        422 fs/xfs/libxfs/xfs_btree.c 	for (i = 0; i < new->bc_nlevels; i++) {
bc_nlevels        674 fs/xfs/libxfs/xfs_btree.c 	    (level == cur->bc_nlevels - 1)) {
bc_nlevels        972 fs/xfs/libxfs/xfs_btree.c 	    (lev == cur->bc_nlevels - 1))
bc_nlevels       1587 fs/xfs/libxfs/xfs_btree.c 	ASSERT(level < cur->bc_nlevels);
bc_nlevels       1616 fs/xfs/libxfs/xfs_btree.c 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
bc_nlevels       1636 fs/xfs/libxfs/xfs_btree.c 	if (lev == cur->bc_nlevels) {
bc_nlevels       1643 fs/xfs/libxfs/xfs_btree.c 	ASSERT(lev < cur->bc_nlevels);
bc_nlevels       1689 fs/xfs/libxfs/xfs_btree.c 	ASSERT(level < cur->bc_nlevels);
bc_nlevels       1718 fs/xfs/libxfs/xfs_btree.c 	for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
bc_nlevels       1729 fs/xfs/libxfs/xfs_btree.c 	if (lev == cur->bc_nlevels) {
bc_nlevels       1736 fs/xfs/libxfs/xfs_btree.c 	ASSERT(lev < cur->bc_nlevels);
bc_nlevels       1778 fs/xfs/libxfs/xfs_btree.c 	    (level == cur->bc_nlevels - 1)) {
bc_nlevels       1870 fs/xfs/libxfs/xfs_btree.c 	if (cur->bc_nlevels == 0)
bc_nlevels       1886 fs/xfs/libxfs/xfs_btree.c 	for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {
bc_nlevels       1909 fs/xfs/libxfs/xfs_btree.c 				if (level != 0 || cur->bc_nlevels != 1) {
bc_nlevels       2137 fs/xfs/libxfs/xfs_btree.c 	if (level + 1 >= cur->bc_nlevels)
bc_nlevels       2145 fs/xfs/libxfs/xfs_btree.c 	for (level++; level < cur->bc_nlevels; level++) {
bc_nlevels       2165 fs/xfs/libxfs/xfs_btree.c 		if (level + 1 >= cur->bc_nlevels)
bc_nlevels       2213 fs/xfs/libxfs/xfs_btree.c 	for (level++, ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {
bc_nlevels       2311 fs/xfs/libxfs/xfs_btree.c 	    level == cur->bc_nlevels - 1)
bc_nlevels       2505 fs/xfs/libxfs/xfs_btree.c 	    (level == cur->bc_nlevels - 1))
bc_nlevels       2816 fs/xfs/libxfs/xfs_btree.c 	if (level + 1 < cur->bc_nlevels) {
bc_nlevels       2938 fs/xfs/libxfs/xfs_btree.c 	level = cur->bc_nlevels - 1;
bc_nlevels       2971 fs/xfs/libxfs/xfs_btree.c 	cur->bc_nlevels++;
bc_nlevels       3063 fs/xfs/libxfs/xfs_btree.c 	block = xfs_btree_get_block(cur, cur->bc_nlevels - 1, &bp);
bc_nlevels       3066 fs/xfs/libxfs/xfs_btree.c 	error = xfs_btree_check_block(cur, block, cur->bc_nlevels - 1, bp);
bc_nlevels       3096 fs/xfs/libxfs/xfs_btree.c 	xfs_btree_init_block_cur(cur, nbp, cur->bc_nlevels, 2);
bc_nlevels       3132 fs/xfs/libxfs/xfs_btree.c 	xfs_btree_setbuf(cur, cur->bc_nlevels, nbp);
bc_nlevels       3133 fs/xfs/libxfs/xfs_btree.c 	cur->bc_ptrs[cur->bc_nlevels] = nptr;
bc_nlevels       3134 fs/xfs/libxfs/xfs_btree.c 	cur->bc_nlevels++;
bc_nlevels       3159 fs/xfs/libxfs/xfs_btree.c 	    level == cur->bc_nlevels - 1) {
bc_nlevels       3245 fs/xfs/libxfs/xfs_btree.c 	    (level >= cur->bc_nlevels)) {
bc_nlevels       3479 fs/xfs/libxfs/xfs_btree.c 			cur->bc_nlevels = pcur->bc_nlevels;
bc_nlevels       3527 fs/xfs/libxfs/xfs_btree.c 	ASSERT(cur->bc_nlevels > 1);
bc_nlevels       3533 fs/xfs/libxfs/xfs_btree.c 	level = cur->bc_nlevels - 1;
bc_nlevels       3597 fs/xfs/libxfs/xfs_btree.c 	cur->bc_nlevels--;
bc_nlevels       3628 fs/xfs/libxfs/xfs_btree.c 	cur->bc_nlevels--;
bc_nlevels       3762 fs/xfs/libxfs/xfs_btree.c 	if (level == cur->bc_nlevels - 1) {
bc_nlevels       3839 fs/xfs/libxfs/xfs_btree.c 		    level == cur->bc_nlevels - 2) {
bc_nlevels       4121 fs/xfs/libxfs/xfs_btree.c 		   (level + 1 < cur->bc_nlevels)) {
bc_nlevels       4196 fs/xfs/libxfs/xfs_btree.c 		for (level = 1; level < cur->bc_nlevels; level++) {
bc_nlevels       4299 fs/xfs/libxfs/xfs_btree.c 	for (level = cur->bc_nlevels - 1; level >= 0; level--) {
bc_nlevels       4388 fs/xfs/libxfs/xfs_btree.c 		ASSERT(level == cur->bc_nlevels - 1);
bc_nlevels       4658 fs/xfs/libxfs/xfs_btree.c 	level = cur->bc_nlevels - 1;
bc_nlevels       4672 fs/xfs/libxfs/xfs_btree.c 	while (level < cur->bc_nlevels) {
bc_nlevels       4678 fs/xfs/libxfs/xfs_btree.c 			if (level < cur->bc_nlevels - 1)
bc_nlevels       4757 fs/xfs/libxfs/xfs_btree.c 		for (i = 0; i < cur->bc_nlevels; i++) {
bc_nlevels        204 fs/xfs/libxfs/xfs_btree.h 	uint8_t		bc_nlevels;	/* number of levels in the tree */
bc_nlevels        223 fs/xfs/libxfs/xfs_ialloc.c 	if (cur->bc_nlevels == 1) {
bc_nlevels        422 fs/xfs/libxfs/xfs_ialloc_btree.c 		cur->bc_nlevels = be32_to_cpu(agi->agi_level);
bc_nlevels        426 fs/xfs/libxfs/xfs_ialloc_btree.c 		cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
bc_nlevels        337 fs/xfs/libxfs/xfs_refcount_btree.c 	cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level);
bc_nlevels        472 fs/xfs/libxfs/xfs_rmap_btree.c 	cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]);
bc_nlevels        259 fs/xfs/scrub/bitmap.c 	for (i = 0; i < cur->bc_nlevels && cur->bc_ptrs[i] == 1; i++) {
bc_nlevels        390 fs/xfs/scrub/bmap.c 		for (i = 0; i < bs->cur->bc_nlevels - 1; i++) {
bc_nlevels        148 fs/xfs/scrub/btree.c 	if (cur->bc_nlevels == 1)
bc_nlevels        196 fs/xfs/scrub/btree.c 	if (level + 1 >= cur->bc_nlevels)
bc_nlevels        229 fs/xfs/scrub/btree.c 	    level == bs->cur->bc_nlevels)
bc_nlevels        323 fs/xfs/scrub/btree.c 	if (level == cur->bc_nlevels - 1) {
bc_nlevels        474 fs/xfs/scrub/btree.c 	ok_level = bs->cur->bc_nlevels - 1;
bc_nlevels        555 fs/xfs/scrub/btree.c 	if (level >= cur->bc_nlevels - 1)
bc_nlevels        619 fs/xfs/scrub/btree.c 	if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) {
bc_nlevels        628 fs/xfs/scrub/btree.c 	level = cur->bc_nlevels - 1;
bc_nlevels        630 fs/xfs/scrub/btree.c 	if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr))
bc_nlevels        638 fs/xfs/scrub/btree.c 	while (level < cur->bc_nlevels) {
bc_nlevels        646 fs/xfs/scrub/btree.c 				if (level < cur->bc_nlevels - 1)
bc_nlevels        671 fs/xfs/scrub/btree.c 			if (level < cur->bc_nlevels - 1)
bc_nlevels         23 fs/xfs/scrub/trace.c 	if (level < cur->bc_nlevels && cur->bc_bufs[level])
bc_nlevels         25 fs/xfs/scrub/trace.c 	else if (level == cur->bc_nlevels - 1 &&
bc_nlevels        507 fs/xfs/scrub/trace.h 		__entry->nlevels = cur->bc_nlevels;
bc_nlevels       2219 fs/xfs/xfs_trace.h 		__entry->nlevels = cur->bc_nlevels;