Searched refs:bc_nlevels (Results 1 - 19 of 19) sorted by relevance

/linux-master/fs/xfs/scrub/
H A Dtrace.c36 if (level < cur->bc_nlevels && cur->bc_levels[level].bp)
40 if (level == cur->bc_nlevels - 1 &&
H A Dagb_bitmap.c96 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) {
H A Dbtree.c161 if (cur->bc_nlevels == 1)
209 if (level + 1 >= cur->bc_nlevels)
241 level == bs->cur->bc_nlevels)
333 if (level == cur->bc_nlevels - 1) {
496 unsigned int root_level = cur->bc_nlevels - 1;
511 level == cur->bc_nlevels - 2) {
550 if (level == cur->bc_nlevels - 1)
645 if (level >= cur->bc_nlevels - 1)
701 cur_sz = xchk_btree_sizeof(cur->bc_nlevels);
722 level = cur->bc_nlevels
[all...]
H A Drmap.c159 for (level = 1; level < cur->bc_nlevels; level++) {
498 sc->sa.rmap_cur->bc_nlevels - 1, &error);
521 level = cur->bc_nlevels - 1;
H A Drcbag_btree.c224 cur->bc_nlevels = xfbtree->nlevels;
H A Dbmap.c483 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) {
H A Dtrace.h644 __entry->nlevels = cur->bc_nlevels;
/linux-master/fs/xfs/libxfs/
H A Dxfs_btree_staging.c68 cur->bc_nlevels = afake->af_levels;
135 cur->bc_nlevels = ifake->if_levels;
442 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs)
467 if (level == cur->bc_nlevels - 1)
584 * maxrecs values for the root block (bc_nlevels == level - 1). We're
585 * checking levels 0 and 1 here, so set bc_nlevels such that the btree
588 cur->bc_nlevels = cur->bc_maxlevels - 1;
593 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) {
596 unsigned int level = cur->bc_nlevels
[all...]
H A Dxfs_btree.c510 for (i = 0; i < cur->bc_nlevels; i++) {
601 for (i = 0; i < new->bc_nlevels; i++) {
1694 ASSERT(level < cur->bc_nlevels);
1723 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1743 if (lev == cur->bc_nlevels) {
1751 ASSERT(lev < cur->bc_nlevels);
1797 ASSERT(level < cur->bc_nlevels);
1826 for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
1837 if (lev == cur->bc_nlevels) {
1845 ASSERT(lev < cur->bc_nlevels);
[all...]
H A Dxfs_btree_mem.c58 ncur->bc_nlevels = cur->bc_nlevels;
H A Dxfs_bmap_btree.c300 if (level == cur->bc_nlevels - 1) {
315 if (level == cur->bc_nlevels - 1) {
340 if (level != cur->bc_nlevels - 1)
585 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1;
H A Dxfs_ialloc_btree.c491 cur->bc_nlevels = be32_to_cpu(agi->agi_level);
517 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
H A Dxfs_btree.h269 uint8_t bc_nlevels; /* number of levels in the tree */ member in struct:xfs_btree_cur
702 level == cur->bc_nlevels - 1;
H A Dxfs_alloc_btree.c564 cur->bc_nlevels = be32_to_cpu(agf->agf_bno_level);
590 cur->bc_nlevels = be32_to_cpu(agf->agf_cnt_level);
H A Dxfs_rmap_btree.c541 cur->bc_nlevels = be32_to_cpu(agf->agf_rmap_level);
650 cur->bc_nlevels = xfbt->nlevels;
H A Dxfs_refcount_btree.c376 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level);
H A Dxfs_alloc.c543 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) {
H A Dxfs_ialloc.c255 if (cur->bc_nlevels == 1) {
/linux-master/fs/xfs/
H A Dxfs_trace.h2472 __entry->nlevels = cur->bc_nlevels;
4312 __entry->nlevels = cur->bc_nlevels;
4754 __entry->nlevels = cur->bc_nlevels;

Completed in 776 milliseconds