Lines Matching refs:cur
28 struct xfs_btree_cur *cur, in __xchk_btree_process_error() argument
49 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_process_error()
50 trace_xchk_ifork_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
53 trace_xchk_btree_op_error(sc, cur, level, in __xchk_btree_process_error()
63 struct xfs_btree_cur *cur, in xchk_btree_process_error() argument
67 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
74 struct xfs_btree_cur *cur, in xchk_btree_xref_process_error() argument
78 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
86 struct xfs_btree_cur *cur, in __xchk_btree_set_corrupt() argument
93 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_set_corrupt()
94 trace_xchk_ifork_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
97 trace_xchk_btree_error(sc, cur, level, in __xchk_btree_set_corrupt()
104 struct xfs_btree_cur *cur, in xchk_btree_set_corrupt() argument
107 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT, in xchk_btree_set_corrupt()
114 struct xfs_btree_cur *cur, in xchk_btree_xref_set_corrupt() argument
117 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_XCORRUPT, in xchk_btree_xref_set_corrupt()
129 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec() local
138 block = xfs_btree_get_block(cur, 0, &bp); in xchk_btree_rec()
139 rec = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, block); in xchk_btree_rec()
141 trace_xchk_btree_rec(bs->sc, cur, 0); in xchk_btree_rec()
144 if (cur->bc_levels[0].ptr > 1 && in xchk_btree_rec()
145 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
146 xchk_btree_set_corrupt(bs->sc, cur, 0); in xchk_btree_rec()
147 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec()
149 if (cur->bc_nlevels == 1) in xchk_btree_rec()
153 cur->bc_ops->init_key_from_rec(&key, rec); in xchk_btree_rec()
154 keyblock = xfs_btree_get_block(cur, 1, &bp); in xchk_btree_rec()
155 keyp = xfs_btree_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
156 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec()
157 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
159 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING)) in xchk_btree_rec()
163 cur->bc_ops->init_high_key_from_rec(&hkey, rec); in xchk_btree_rec()
164 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
165 if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0) in xchk_btree_rec()
166 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
178 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key() local
185 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree_key()
186 key = xfs_btree_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
188 trace_xchk_btree_key(bs->sc, cur, level); in xchk_btree_key()
191 if (cur->bc_levels[level].ptr > 1 && in xchk_btree_key()
192 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level - 1], key)) in xchk_btree_key()
193 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
194 memcpy(&bs->lastkey[level - 1], key, cur->bc_ops->key_len); in xchk_btree_key()
196 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()
200 keyblock = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_key()
201 keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock); in xchk_btree_key()
202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key()
203 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
205 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING)) in xchk_btree_key()
209 key = xfs_btree_high_key_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree_key()
210 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_key()
212 if (cur->bc_ops->diff_two_keys(cur, keyp, key) < 0) in xchk_btree_key()
213 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
229 if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && in xchk_btree_ptr_ok()
230 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()
234 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_ptr_ok()
235 res = xfs_btree_check_lptr(bs->cur, be64_to_cpu(ptr->l), level); in xchk_btree_ptr_ok()
237 res = xfs_btree_check_sptr(bs->cur, be32_to_cpu(ptr->s), level); in xchk_btree_ptr_ok()
239 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_ptr_ok()
252 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling() local
260 error = xfs_btree_dup_cursor(cur, &ncur); in xchk_btree_block_check_sibling()
261 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) || in xchk_btree_block_check_sibling()
269 if (xfs_btree_ptr_is_null(cur, sibling)) { in xchk_btree_block_check_sibling()
275 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
285 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error)) in xchk_btree_block_check_sibling()
288 xchk_btree_set_corrupt(bs->sc, cur, level + 1); in xchk_btree_block_check_sibling()
300 if (xfs_btree_diff_two_ptrs(cur, pp, sibling)) in xchk_btree_block_check_sibling()
301 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
313 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings() local
319 xfs_btree_get_sibling(cur, block, &leftsib, XFS_BB_LEFTSIB); in xchk_btree_block_check_siblings()
320 xfs_btree_get_sibling(cur, block, &rightsib, XFS_BB_RIGHTSIB); in xchk_btree_block_check_siblings()
324 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()
325 if (!xfs_btree_ptr_is_null(cur, &leftsib) || in xchk_btree_block_check_siblings()
326 !xfs_btree_ptr_is_null(cur, &rightsib)) in xchk_btree_block_check_siblings()
327 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_siblings()
368 if (!bs->cur) in xchk_btree_check_block_owner()
371 btnum = bs->cur->bc_btnum; in xchk_btree_check_block_owner()
372 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
373 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
375 init_sa = bs->cur->bc_flags & XFS_BTREE_LONG_PTRS; in xchk_btree_check_block_owner()
378 if (!xchk_btree_xref_process_error(bs->sc, bs->cur, in xchk_btree_check_block_owner()
390 bs->cur = NULL; in xchk_btree_check_block_owner()
394 bs->cur = NULL; in xchk_btree_check_block_owner()
410 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner() local
420 if (!(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE)) in xchk_btree_check_owner()
421 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_check_owner()
433 if (cur->bc_btnum == XFS_BTNUM_BNO || cur->bc_btnum == XFS_BTNUM_RMAP) { in xchk_btree_check_owner()
463 if (bs->cur->bc_btnum == XFS_BTNUM_BMAP && in xchk_btree_check_iroot_minrecs()
464 bs->cur->bc_ino.whichfork == XFS_DATA_FORK && in xchk_btree_check_iroot_minrecs()
481 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs() local
482 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()
486 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) in xchk_btree_check_minrecs()
496 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && in xchk_btree_check_minrecs()
497 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()
502 root_block = xfs_btree_get_block(cur, root_level, &root_bp); in xchk_btree_check_minrecs()
503 root_maxrecs = cur->bc_ops->get_dmaxrecs(cur, root_level); in xchk_btree_check_minrecs()
507 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
516 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
537 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
538 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) || in xchk_btree_get_block()
542 xfs_btree_get_block(bs->cur, level, pbp); in xchk_btree_get_block()
543 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_get_block()
544 failed_at = __xfs_btree_check_lblock(bs->cur, *pblock, in xchk_btree_get_block()
547 failed_at = __xfs_btree_check_sblock(bs->cur, *pblock, in xchk_btree_get_block()
550 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_get_block()
584 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys() local
591 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()
595 xfs_btree_get_keys(cur, block, &block_keys); in xchk_btree_block_keys()
598 parent_block = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_block_keys()
599 parent_keys = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_keys()
602 if (cur->bc_ops->diff_two_keys(cur, &block_keys, parent_keys) != 0) in xchk_btree_block_keys()
603 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
605 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING)) in xchk_btree_block_keys()
609 high_bk = xfs_btree_high_key_from_key(cur, &block_keys); in xchk_btree_block_keys()
610 high_pk = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_block_keys()
613 if (cur->bc_ops->diff_two_keys(cur, high_bk, high_pk) != 0) in xchk_btree_block_keys()
614 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
625 struct xfs_btree_cur *cur, in xchk_btree() argument
647 cur_sz = xchk_btree_sizeof(cur->bc_nlevels); in xchk_btree()
649 xchk_btree_set_corrupt(sc, cur, 0); in xchk_btree()
655 bs->cur = cur; in xchk_btree()
668 level = cur->bc_nlevels - 1; in xchk_btree()
669 cur->bc_ops->init_ptr_from_cur(cur, &ptr); in xchk_btree()
670 if (!xchk_btree_ptr_ok(bs, cur->bc_nlevels, &ptr)) in xchk_btree()
676 cur->bc_levels[level].ptr = 1; in xchk_btree()
678 while (level < cur->bc_nlevels) { in xchk_btree()
679 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree()
683 if (cur->bc_levels[level].ptr > in xchk_btree()
686 if (level < cur->bc_nlevels - 1) in xchk_btree()
687 cur->bc_levels[level + 1].ptr++; in xchk_btree()
696 recp = xfs_btree_rec_addr(cur, cur->bc_levels[0].ptr, in xchk_btree()
705 cur->bc_levels[level].ptr++; in xchk_btree()
710 if (cur->bc_levels[level].ptr > in xchk_btree()
713 if (level < cur->bc_nlevels - 1) in xchk_btree()
714 cur->bc_levels[level + 1].ptr++; in xchk_btree()
723 pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree()
725 cur->bc_levels[level].ptr++; in xchk_btree()
733 cur->bc_levels[level].ptr = 1; in xchk_btree()
739 if (!error && bs->cur) in xchk_btree()