Lines Matching refs:level
32 int level,
55 ds->state->path.blk[level].blkno),
69 int level)
77 ds->state->path.blk[level].blkno),
84 int level)
86 struct xfs_da_state_blk *blk = &ds->state->path.blk[level];
99 int level,
108 if (hash < ds->hashes[level])
109 xchk_da_set_corrupt(ds, level);
110 ds->hashes[level] = hash;
112 if (level == 0)
116 entry = xchk_da_btree_node_entry(ds, level - 1);
119 xchk_da_set_corrupt(ds, level);
131 int level,
135 xchk_da_set_corrupt(ds, level);
219 int level,
233 * level pointer anywhere.
239 xchk_da_set_corrupt(ds, level);
247 if (!xchk_da_process_error(ds, level, &error))
250 xchk_da_set_corrupt(ds, level);
253 if (altpath->blk[level].bp)
254 xchk_buffer_recheck(ds->sc, altpath->blk[level].bp);
256 /* Compare upper level pointer to sibling pointer. */
257 if (altpath->blk[level].blkno != sibling)
258 xchk_da_set_corrupt(ds, level);
279 int level,
289 /* Top level blocks should not have sibling pointers. */
290 if (level == 0) {
292 xchk_da_set_corrupt(ds, level);
300 error = xchk_da_btree_block_check_sibling(ds, level, 0, back);
303 error = xchk_da_btree_block_check_sibling(ds, level, 1, forw);
314 int level,
328 blk = &ds->state->path.blk[level];
329 ds->state->path.active = level + 1;
339 if (!xchk_da_btree_ptr_ok(ds, level, blkno))
346 if (!xchk_da_process_error(ds, level, &error))
356 if (ds->dargs.whichfork == XFS_DATA_FORK && level == 0 &&
362 xchk_da_set_corrupt(ds, level);
368 pmaxrecs = &ds->maxrecs[level];
372 xchk_da_set_corrupt(ds, level);
378 xchk_da_set_corrupt(ds, level);
382 error = xchk_da_btree_block_check_siblings(ds, level, &hdr3->hdr);
395 xchk_da_set_corrupt(ds, level);
404 xchk_da_set_corrupt(ds, level);
413 xchk_da_set_corrupt(ds, level);
425 if (level == 0) {
426 if (nodehdr.level >= XFS_DA_NODE_MAXDEPTH) {
427 xchk_da_set_corrupt(ds, level);
430 ds->tree_level = nodehdr.level;
432 if (ds->tree_level != nodehdr.level) {
433 xchk_da_set_corrupt(ds, level);
441 xchk_da_set_corrupt(ds, level);
449 if (level > 0) {
452 key = xchk_da_btree_node_entry(ds, level - 1);
454 xchk_da_set_corrupt(ds, level);
482 int level;
510 level = 0;
514 error = xchk_da_btree_block(ds, level, blkno);
522 if (blks[level].bp == NULL)
525 blks[level].index = 0;
526 while (level >= 0 && level < XFS_DA_NODE_MAXDEPTH) {
528 if (blks[level].magic != XFS_DA_NODE_MAGIC) {
530 if (blks[level].index >= ds->maxrecs[level]) {
531 if (level > 0)
532 blks[level - 1].index++;
534 level--;
539 error = scrub_fn(ds, level);
546 blks[level].index++;
552 if (blks[level].index >= ds->maxrecs[level]) {
553 if (level > 0)
554 blks[level - 1].index++;
556 level--;
561 key = xchk_da_btree_node_entry(ds, level);
562 error = xchk_da_btree_hash(ds, level, &key->hashval);
566 /* Drill another level deeper. */
568 level++;
569 if (level >= XFS_DA_NODE_MAXDEPTH) {
571 xchk_da_set_corrupt(ds, level - 1);
575 error = xchk_da_btree_block(ds, level, blkno);
578 if (blks[level].bp == NULL)
581 blks[level].index = 0;
586 for (level = 0; level < XFS_DA_NODE_MAXDEPTH; level++) {
587 if (blks[level].bp == NULL)
589 xfs_trans_brelse(sc->tp, blks[level].bp);
590 blks[level].bp = NULL;