Lines Matching refs:level
32 int level,
54 ds->state->path.blk[level].blkno),
68 int level)
76 ds->state->path.blk[level].blkno),
83 int level)
85 struct xfs_da_state_blk *blk = &ds->state->path.blk[level];
98 int level,
107 if (hash < ds->hashes[level])
108 xchk_da_set_corrupt(ds, level);
109 ds->hashes[level] = hash;
111 if (level == 0)
115 entry = xchk_da_btree_node_entry(ds, level - 1);
118 xchk_da_set_corrupt(ds, level);
130 int level,
134 xchk_da_set_corrupt(ds, level);
218 int level,
232 * level pointer anywhere.
238 xchk_da_set_corrupt(ds, level);
246 if (!xchk_da_process_error(ds, level, &error))
249 xchk_da_set_corrupt(ds, level);
252 if (altpath->blk[level].bp)
253 xchk_buffer_recheck(ds->sc, altpath->blk[level].bp);
255 /* Compare upper level pointer to sibling pointer. */
256 if (altpath->blk[level].blkno != sibling)
257 xchk_da_set_corrupt(ds, level);
278 int level,
288 /* Top level blocks should not have sibling pointers. */
289 if (level == 0) {
291 xchk_da_set_corrupt(ds, level);
299 error = xchk_da_btree_block_check_sibling(ds, level, 0, back);
302 error = xchk_da_btree_block_check_sibling(ds, level, 1, forw);
313 int level,
327 blk = &ds->state->path.blk[level];
328 ds->state->path.active = level + 1;
338 if (!xchk_da_btree_ptr_ok(ds, level, blkno))
345 if (!xchk_da_process_error(ds, level, &error))
355 if (ds->dargs.whichfork == XFS_DATA_FORK && level == 0 &&
361 xchk_da_set_corrupt(ds, level);
367 pmaxrecs = &ds->maxrecs[level];
371 xchk_da_set_corrupt(ds, level);
377 xchk_da_set_corrupt(ds, level);
381 error = xchk_da_btree_block_check_siblings(ds, level, &hdr3->hdr);
394 xchk_da_set_corrupt(ds, level);
403 xchk_da_set_corrupt(ds, level);
412 xchk_da_set_corrupt(ds, level);
424 if (level == 0) {
425 if (nodehdr.level >= XFS_DA_NODE_MAXDEPTH) {
426 xchk_da_set_corrupt(ds, level);
429 ds->tree_level = nodehdr.level;
431 if (ds->tree_level != nodehdr.level) {
432 xchk_da_set_corrupt(ds, level);
440 xchk_da_set_corrupt(ds, level);
448 if (level > 0) {
451 key = xchk_da_btree_node_entry(ds, level - 1);
453 xchk_da_set_corrupt(ds, level);
481 int level;
506 level = 0;
510 error = xchk_da_btree_block(&ds, level, blkno);
518 if (blks[level].bp == NULL)
521 blks[level].index = 0;
522 while (level >= 0 && level < XFS_DA_NODE_MAXDEPTH) {
524 if (blks[level].magic != XFS_DA_NODE_MAGIC) {
526 if (blks[level].index >= ds.maxrecs[level]) {
527 if (level > 0)
528 blks[level - 1].index++;
530 level--;
535 error = scrub_fn(&ds, level);
542 blks[level].index++;
548 if (blks[level].index >= ds.maxrecs[level]) {
549 if (level > 0)
550 blks[level - 1].index++;
552 level--;
557 key = xchk_da_btree_node_entry(&ds, level);
558 error = xchk_da_btree_hash(&ds, level, &key->hashval);
562 /* Drill another level deeper. */
564 level++;
565 if (level >= XFS_DA_NODE_MAXDEPTH) {
567 xchk_da_set_corrupt(&ds, level - 1);
571 error = xchk_da_btree_block(&ds, level, blkno);
574 if (blks[level].bp == NULL)
577 blks[level].index = 0;
582 for (level = 0; level < XFS_DA_NODE_MAXDEPTH; level++) {
583 if (blks[level].bp == NULL)
585 xfs_trans_brelse(sc->tp, blks[level].bp);
586 blks[level].bp = NULL;