Lines Matching refs:level
28 int level,
49 trace_xchk_ifork_btree_op_error(sc, cur, level,
52 trace_xchk_btree_op_error(sc, cur, level,
63 int level,
66 return __xchk_btree_process_error(sc, cur, level, error,
74 int level,
77 return __xchk_btree_process_error(sc, cur, level, error,
86 int level,
93 trace_xchk_ifork_btree_error(sc, cur, level,
96 trace_xchk_btree_error(sc, cur, level,
104 int level)
106 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT,
114 int level)
116 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT,
175 int level)
184 block = xfs_btree_get_block(cur, level, &bp);
185 key = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block);
187 trace_xchk_btree_key(bs->sc, cur, level);
190 if (!bs->firstkey[level] &&
191 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level], key))
192 xchk_btree_set_corrupt(bs->sc, cur, level);
193 bs->firstkey[level] = false;
194 memcpy(&bs->lastkey[level], key, cur->bc_ops->key_len);
196 if (level + 1 >= cur->bc_nlevels)
200 keyblock = xfs_btree_get_block(cur, level + 1, &bp);
201 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock);
203 xchk_btree_set_corrupt(bs->sc, cur, level);
209 key = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block);
210 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock);
212 xchk_btree_set_corrupt(bs->sc, cur, level);
222 int level,
229 level == bs->cur->bc_nlevels)
234 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level);
236 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level);
238 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
247 int level,
260 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) ||
266 * level pointer anywhere.
270 error = xfs_btree_increment(ncur, level + 1, &success);
272 error = xfs_btree_decrement(ncur, level + 1, &success);
274 xchk_btree_set_corrupt(bs->sc, cur, level);
279 /* Increment upper level pointer. */
281 error = xfs_btree_increment(ncur, level + 1, &success);
283 error = xfs_btree_decrement(ncur, level + 1, &success);
284 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error))
287 xchk_btree_set_corrupt(bs->sc, cur, level + 1);
291 /* Compare upper level pointer to sibling pointer. */
292 pblock = xfs_btree_get_block(ncur, level + 1, &pbp);
293 pp = xfs_btree_ptr_addr(ncur, ncur->bc_ptrs[level + 1], pblock);
294 if (!xchk_btree_ptr_ok(bs, level + 1, pp))
300 xchk_btree_set_corrupt(bs->sc, cur, level);
315 int level;
320 level = xfs_btree_get_level(block);
323 if (level == cur->bc_nlevels - 1) {
326 xchk_btree_set_corrupt(bs->sc, cur, level);
332 * parent level pointers?
335 error = xchk_btree_block_check_sibling(bs, level, -1, &leftsib);
338 error = xchk_btree_block_check_sibling(bs, level, 1, &rightsib);
348 int level;
358 int level,
378 level, &error))
405 int level,
419 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
436 co->level = level;
442 return xchk_btree_check_block_owner(bs, level, XFS_BUF_ADDR(bp));
452 int level,
460 if (numrecs >= cur->bc_ops->get_minrecs(cur, level))
471 level == cur->bc_nlevels - 2) {
480 xchk_btree_set_corrupt(bs->sc, cur, level);
485 * Otherwise, only the root level is allowed to have fewer than minrecs
488 if (level < root_level)
489 xchk_btree_set_corrupt(bs->sc, cur, level);
499 int level,
510 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock);
511 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) ||
515 xfs_btree_get_block(bs->cur, level, pbp);
518 level, *pbp);
521 level, *pbp);
523 xchk_btree_set_corrupt(bs->sc, bs->cur, level);
529 xchk_btree_check_minrecs(bs, level, *pblock);
535 error = xchk_btree_check_owner(bs, level, *pbp);
553 int level,
564 if (level >= cur->bc_nlevels - 1)
571 parent_block = xfs_btree_get_block(cur, level + 1, &bp);
572 parent_keys = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1],
583 high_pk = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1],
615 int level;
637 level = cur->bc_nlevels - 1;
641 error = xchk_btree_get_block(&bs, level, &ptr, &block, &bp);
645 cur->bc_ptrs[level] = 1;
647 while (level < cur->bc_nlevels) {
648 block = xfs_btree_get_block(cur, level, &bp);
650 if (level == 0) {
652 if (cur->bc_ptrs[level] >
654 xchk_btree_block_keys(&bs, level, block);
655 if (level < cur->bc_nlevels - 1)
656 cur->bc_ptrs[level + 1]++;
657 level++;
673 cur->bc_ptrs[level]++;
678 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) {
679 xchk_btree_block_keys(&bs, level, block);
680 if (level < cur->bc_nlevels - 1)
681 cur->bc_ptrs[level + 1]++;
682 level++;
687 xchk_btree_key(&bs, level);
689 /* Drill another level deeper. */
690 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block);
691 if (!xchk_btree_ptr_ok(&bs, level, pp)) {
692 cur->bc_ptrs[level]++;
695 level--;
696 error = xchk_btree_get_block(&bs, level, pp, &block, &bp);
700 cur->bc_ptrs[level] = 1;
708 co->level, co->daddr);