Lines Matching full:level
29 int level, in __xchk_btree_process_error() argument
51 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
54 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
65 int level, in xchk_btree_process_error() argument
68 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
76 int level, in xchk_btree_xref_process_error() argument
79 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
88 int level, in __xchk_btree_set_corrupt() argument
95 trace_xchk_ifork_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
98 trace_xchk_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
106 int level) in xchk_btree_set_corrupt() argument
108 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT, in xchk_btree_set_corrupt()
116 int level) in xchk_btree_xref_set_corrupt() argument
118 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT, in xchk_btree_xref_set_corrupt()
126 int level) in xchk_btree_set_preen() argument
128 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_PREEN, in xchk_btree_set_preen()
188 int level) in xchk_btree_key() argument
197 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree_key()
198 key = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
200 trace_xchk_btree_key(bs->sc, cur, level); in xchk_btree_key()
203 if (bs->lastkey[level - 1].valid && in xchk_btree_key()
204 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level - 1].key, key)) in xchk_btree_key()
205 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
206 memcpy(&bs->lastkey[level - 1].key, key, cur->bc_ops->key_len); in xchk_btree_key()
207 bs->lastkey[level - 1].valid = true; in xchk_btree_key()
209 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()
213 keyblock = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_key()
214 keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock); in xchk_btree_key()
216 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
222 key = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
223 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_key()
226 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
236 int level, in xchk_btree_ptr_ok() argument
243 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()
248 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level); in xchk_btree_ptr_ok()
250 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level); in xchk_btree_ptr_ok()
252 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_ptr_ok()
261 int level, in xchk_btree_block_check_sibling() argument
274 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) || in xchk_btree_block_check_sibling()
280 * level pointer anywhere. in xchk_btree_block_check_sibling()
284 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
286 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
288 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
293 /* Increment upper level pointer. */ in xchk_btree_block_check_sibling()
295 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
297 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
298 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error)) in xchk_btree_block_check_sibling()
301 xchk_btree_set_corrupt(bs->sc, cur, level + 1); in xchk_btree_block_check_sibling()
305 /* Compare upper level pointer to sibling pointer. */ in xchk_btree_block_check_sibling()
306 pblock = xfs_btree_get_block(ncur, level + 1, &pbp); in xchk_btree_block_check_sibling()
307 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock); in xchk_btree_block_check_sibling()
308 if (!xchk_btree_ptr_ok(bs, level + 1, pp)) in xchk_btree_block_check_sibling()
314 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
329 int level; in xchk_btree_block_check_siblings() local
334 level = xfs_btree_get_level(block); in xchk_btree_block_check_siblings()
337 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()
340 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_siblings()
346 * parent level pointers? in xchk_btree_block_check_siblings()
349 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib); in xchk_btree_block_check_siblings()
352 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib); in xchk_btree_block_check_siblings()
362 int level; member
372 int level, in xchk_btree_check_block_owner() argument
392 level, &error)) in xchk_btree_check_block_owner()
420 int level, in xchk_btree_check_owner() argument
433 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_check_owner()
453 co->level = level; in xchk_btree_check_owner()
459 return xchk_btree_check_block_owner(bs, level, xfs_buf_daddr(bp)); in xchk_btree_check_owner()
493 int level, in xchk_btree_check_minrecs() argument
501 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) in xchk_btree_check_minrecs()
512 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()
522 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
527 * Otherwise, only the root level is allowed to have fewer than minrecs in xchk_btree_check_minrecs()
530 if (level < root_level) in xchk_btree_check_minrecs()
531 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
541 int level, in xchk_btree_block_check_keys() argument
551 if (level == cur->bc_nlevels - 1) in xchk_btree_block_check_keys()
557 parent_block = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_block_check_keys()
558 parent_low_key = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_check_keys()
561 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_block_check_keys()
570 cur->bc_levels[level + 1].ptr, parent_block); in xchk_btree_block_check_keys()
573 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_block_check_keys()
583 int level, in xchk_btree_get_block() argument
594 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
595 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) || in xchk_btree_get_block()
599 xfs_btree_get_block(bs->cur, level, pbp); in xchk_btree_get_block()
602 level, *pbp); in xchk_btree_get_block()
605 level, *pbp); in xchk_btree_get_block()
607 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_get_block()
613 xchk_btree_check_minrecs(bs, level, *pblock); in xchk_btree_get_block()
619 error = xchk_btree_check_owner(bs, level, *pbp); in xchk_btree_get_block()
631 xchk_btree_block_check_keys(bs, level, *pblock); in xchk_btree_get_block()
642 int level, in xchk_btree_block_keys() argument
653 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()
660 parent_block = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_block_keys()
661 parent_keys = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_keys()
672 high_pk = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_keys()
701 int level; in xchk_btree() local
730 level = cur->bc_nlevels - 1; in xchk_btree()
734 error = xchk_btree_get_block(bs, level, &ptr, &block, &bp); in xchk_btree()
738 cur->bc_levels[level].ptr = 1; in xchk_btree()
740 while (level < cur->bc_nlevels) { in xchk_btree()
741 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree()
743 if (level == 0) { in xchk_btree()
745 if (cur->bc_levels[level].ptr > in xchk_btree()
747 xchk_btree_block_keys(bs, level, block); in xchk_btree()
748 if (level < cur->bc_nlevels - 1) in xchk_btree()
749 cur->bc_levels[level + 1].ptr++; in xchk_btree()
750 level++; in xchk_btree()
767 cur->bc_levels[level].ptr++; in xchk_btree()
772 if (cur->bc_levels[level].ptr > in xchk_btree()
774 xchk_btree_block_keys(bs, level, block); in xchk_btree()
775 if (level < cur->bc_nlevels - 1) in xchk_btree()
776 cur->bc_levels[level + 1].ptr++; in xchk_btree()
777 level++; in xchk_btree()
782 xchk_btree_key(bs, level); in xchk_btree()
784 /* Drill another level deeper. */ in xchk_btree()
785 pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree()
786 if (!xchk_btree_ptr_ok(bs, level, pp)) { in xchk_btree()
787 cur->bc_levels[level].ptr++; in xchk_btree()
790 level--; in xchk_btree()
791 error = xchk_btree_get_block(bs, level, pp, &block, &bp); in xchk_btree()
795 cur->bc_levels[level].ptr = 1; in xchk_btree()
802 error = xchk_btree_check_block_owner(bs, co->level, in xchk_btree()