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