Lines Matching full:level
35 int level, in __xchk_btree_process_error() argument
56 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
59 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
70 int level, in xchk_btree_process_error() argument
73 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
81 int level, in xchk_btree_xref_process_error() argument
84 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
93 int level, in __xchk_btree_set_corrupt() argument
100 trace_xchk_ifork_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
103 trace_xchk_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
111 int level) in xchk_btree_set_corrupt() argument
113 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT, in xchk_btree_set_corrupt()
121 int level) in xchk_btree_xref_set_corrupt() argument
123 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT, in xchk_btree_xref_set_corrupt()
182 int level) in xchk_btree_key() argument
191 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree_key()
192 key = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block); in xchk_btree_key()
194 trace_xchk_btree_key(bs->sc, cur, level); in xchk_btree_key()
197 if (!bs->firstkey[level] && in xchk_btree_key()
198 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level], key)) in xchk_btree_key()
199 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
200 bs->firstkey[level] = false; in xchk_btree_key()
201 memcpy(&bs->lastkey[level], key, cur->bc_ops->key_len); in xchk_btree_key()
203 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()
207 keyblock = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_key()
208 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); in xchk_btree_key()
210 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
216 key = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block); in xchk_btree_key()
217 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); in xchk_btree_key()
219 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
229 int level, in xchk_btree_ptr_ok() argument
236 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()
241 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level); in xchk_btree_ptr_ok()
243 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level); in xchk_btree_ptr_ok()
245 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_ptr_ok()
254 int level, in xchk_btree_block_check_sibling() argument
267 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) || in xchk_btree_block_check_sibling()
273 * level pointer anywhere. in xchk_btree_block_check_sibling()
277 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
279 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
281 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
286 /* Increment upper level pointer. */ in xchk_btree_block_check_sibling()
288 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
290 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
291 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error)) in xchk_btree_block_check_sibling()
294 xchk_btree_set_corrupt(bs->sc, cur, level + 1); in xchk_btree_block_check_sibling()
298 /* Compare upper level pointer to sibling pointer. */ in xchk_btree_block_check_sibling()
299 pblock = xfs_btree_get_block(ncur, level + 1, &pbp); in xchk_btree_block_check_sibling()
300 pp = xfs_btree_ptr_addr(ncur, ncur->bc_ptrs[level + 1], pblock); in xchk_btree_block_check_sibling()
301 if (!xchk_btree_ptr_ok(bs, level + 1, pp)) in xchk_btree_block_check_sibling()
307 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
322 int level; in xchk_btree_block_check_siblings() local
327 level = xfs_btree_get_level(block); in xchk_btree_block_check_siblings()
330 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()
333 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_siblings()
339 * parent level pointers? in xchk_btree_block_check_siblings()
342 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib); in xchk_btree_block_check_siblings()
345 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib); in xchk_btree_block_check_siblings()
355 int level; member
365 int level, in xchk_btree_check_block_owner() argument
385 level, &error)) in xchk_btree_check_block_owner()
412 int level, in xchk_btree_check_owner() argument
434 co->level = level; in xchk_btree_check_owner()
440 return xchk_btree_check_block_owner(bs, level, XFS_BUF_ADDR(bp)); in xchk_btree_check_owner()
450 int level, in xchk_btree_check_minrecs() argument
459 if (numrecs >= bs->cur->bc_ops->get_minrecs(bs->cur, level)) in xchk_btree_check_minrecs()
464 * level greater than or equal to the level of the highest dedicated in xchk_btree_check_minrecs()
475 if (level >= ok_level) in xchk_btree_check_minrecs()
478 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_check_minrecs()
488 int level, in xchk_btree_get_block() argument
499 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
500 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) || in xchk_btree_get_block()
504 xfs_btree_get_block(bs->cur, level, pbp); in xchk_btree_get_block()
507 level, *pbp); in xchk_btree_get_block()
510 level, *pbp); in xchk_btree_get_block()
512 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_get_block()
518 xchk_btree_check_minrecs(bs, level, *pblock); in xchk_btree_get_block()
524 error = xchk_btree_check_owner(bs, level, *pbp); in xchk_btree_get_block()
542 int level, in xchk_btree_block_keys() argument
553 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()
560 parent_block = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_block_keys()
561 parent_keys = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], in xchk_btree_block_keys()
572 high_pk = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], in xchk_btree_block_keys()
597 int level; in xchk_btree() local
625 level = cur->bc_nlevels - 1; in xchk_btree()
629 error = xchk_btree_get_block(&bs, level, &ptr, &block, &bp); in xchk_btree()
633 cur->bc_ptrs[level] = 1; in xchk_btree()
635 while (level < cur->bc_nlevels) { in xchk_btree()
636 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree()
638 if (level == 0) { in xchk_btree()
640 if (cur->bc_ptrs[level] > in xchk_btree()
642 xchk_btree_block_keys(&bs, level, block); in xchk_btree()
643 if (level < cur->bc_nlevels - 1) in xchk_btree()
644 cur->bc_ptrs[level + 1]++; in xchk_btree()
645 level++; in xchk_btree()
661 cur->bc_ptrs[level]++; in xchk_btree()
666 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) { in xchk_btree()
667 xchk_btree_block_keys(&bs, level, block); in xchk_btree()
668 if (level < cur->bc_nlevels - 1) in xchk_btree()
669 cur->bc_ptrs[level + 1]++; in xchk_btree()
670 level++; in xchk_btree()
675 xchk_btree_key(&bs, level); in xchk_btree()
677 /* Drill another level deeper. */ in xchk_btree()
678 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block); in xchk_btree()
679 if (!xchk_btree_ptr_ok(&bs, level, pp)) { in xchk_btree()
680 cur->bc_ptrs[level]++; in xchk_btree()
683 level--; in xchk_btree()
684 error = xchk_btree_get_block(&bs, level, pp, &block, &bp); in xchk_btree()
688 cur->bc_ptrs[level] = 1; in xchk_btree()
696 co->level, co->daddr); in xchk_btree()