Lines Matching refs:cur
34 struct xfs_btree_cur *cur, in __xchk_btree_process_error() argument
55 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_process_error()
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()
69 struct xfs_btree_cur *cur, in xchk_btree_process_error() argument
73 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_process_error()
80 struct xfs_btree_cur *cur, in xchk_btree_xref_process_error() argument
84 return __xchk_btree_process_error(sc, cur, level, error, in xchk_btree_xref_process_error()
92 struct xfs_btree_cur *cur, in __xchk_btree_set_corrupt() argument
99 if (cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) in __xchk_btree_set_corrupt()
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()
110 struct xfs_btree_cur *cur, in xchk_btree_set_corrupt() argument
113 __xchk_btree_set_corrupt(sc, cur, level, XFS_SCRUB_OFLAG_CORRUPT, in xchk_btree_set_corrupt()
120 struct xfs_btree_cur *cur, 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()
135 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_rec() local
144 block = xfs_btree_get_block(cur, 0, &bp); in xchk_btree_rec()
145 rec = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block); in xchk_btree_rec()
147 trace_xchk_btree_rec(bs->sc, cur, 0); in xchk_btree_rec()
150 if (!bs->firstrec && !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
151 xchk_btree_set_corrupt(bs->sc, cur, 0); in xchk_btree_rec()
153 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec()
155 if (cur->bc_nlevels == 1) in xchk_btree_rec()
159 cur->bc_ops->init_key_from_rec(&key, rec); in xchk_btree_rec()
160 keyblock = xfs_btree_get_block(cur, 1, &bp); in xchk_btree_rec()
161 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[1], keyblock); in xchk_btree_rec()
162 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec()
163 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
165 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING)) in xchk_btree_rec()
169 cur->bc_ops->init_high_key_from_rec(&hkey, rec); in xchk_btree_rec()
170 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[1], keyblock); in xchk_btree_rec()
171 if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0) in xchk_btree_rec()
172 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_rec()
184 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_key() local
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()
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()
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()
209 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key()
210 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
212 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING)) 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()
218 if (cur->bc_ops->diff_two_keys(cur, keyp, key) < 0) in xchk_btree_key()
219 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_key()
235 if ((bs->cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && in xchk_btree_ptr_ok()
236 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()
240 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) 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()
258 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_sibling() local
266 error = xfs_btree_dup_cursor(cur, &ncur); in xchk_btree_block_check_sibling()
267 if (!xchk_btree_process_error(bs->sc, cur, level + 1, &error) || in xchk_btree_block_check_sibling()
275 if (xfs_btree_ptr_is_null(cur, sibling)) { in xchk_btree_block_check_sibling()
281 xchk_btree_set_corrupt(bs->sc, cur, level); 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()
306 if (xfs_btree_diff_two_ptrs(cur, pp, sibling)) in xchk_btree_block_check_sibling()
307 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_sibling()
319 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_check_siblings() local
325 xfs_btree_get_sibling(cur, block, &leftsib, XFS_BB_LEFTSIB); in xchk_btree_block_check_siblings()
326 xfs_btree_get_sibling(cur, block, &rightsib, XFS_BB_RIGHTSIB); in xchk_btree_block_check_siblings()
330 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()
331 if (!xfs_btree_ptr_is_null(cur, &leftsib) || in xchk_btree_block_check_siblings()
332 !xfs_btree_ptr_is_null(cur, &rightsib)) in xchk_btree_block_check_siblings()
333 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_block_check_siblings()
374 if (!bs->cur) in xchk_btree_check_block_owner()
377 btnum = bs->cur->bc_btnum; in xchk_btree_check_block_owner()
378 agno = xfs_daddr_to_agno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
379 agbno = xfs_daddr_to_agbno(bs->cur->bc_mp, daddr); in xchk_btree_check_block_owner()
381 init_sa = bs->cur->bc_flags & XFS_BTREE_LONG_PTRS; in xchk_btree_check_block_owner()
384 if (!xchk_btree_xref_process_error(bs->sc, bs->cur, in xchk_btree_check_block_owner()
396 bs->cur = NULL; in xchk_btree_check_block_owner()
400 bs->cur = NULL; in xchk_btree_check_block_owner()
415 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_owner() local
418 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && bp == NULL) in xchk_btree_check_owner()
429 if (cur->bc_btnum == XFS_BTNUM_BNO || cur->bc_btnum == XFS_BTNUM_RMAP) { in xchk_btree_check_owner()
453 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_check_minrecs() local
454 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()
458 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) in xchk_btree_check_minrecs()
468 if ((cur->bc_flags & XFS_BTREE_ROOT_IN_INODE) && in xchk_btree_check_minrecs()
469 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()
474 root_block = xfs_btree_get_block(cur, root_level, &root_bp); in xchk_btree_check_minrecs()
475 root_maxrecs = cur->bc_ops->get_dmaxrecs(cur, root_level); in xchk_btree_check_minrecs()
478 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
487 xchk_btree_set_corrupt(bs->sc, cur, level); in xchk_btree_check_minrecs()
508 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
509 if (!xchk_btree_process_error(bs->sc, bs->cur, level, &error) || in xchk_btree_get_block()
513 xfs_btree_get_block(bs->cur, level, pbp); in xchk_btree_get_block()
514 if (bs->cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_get_block()
515 failed_at = __xfs_btree_check_lblock(bs->cur, *pblock, in xchk_btree_get_block()
518 failed_at = __xfs_btree_check_sblock(bs->cur, *pblock, in xchk_btree_get_block()
521 xchk_btree_set_corrupt(bs->sc, bs->cur, level); in xchk_btree_get_block()
555 struct xfs_btree_cur *cur = bs->cur; in xchk_btree_block_keys() local
562 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()
566 xfs_btree_get_keys(cur, block, &block_keys); in xchk_btree_block_keys()
569 parent_block = xfs_btree_get_block(cur, level + 1, &bp); in xchk_btree_block_keys()
570 parent_keys = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], in xchk_btree_block_keys()
573 if (cur->bc_ops->diff_two_keys(cur, &block_keys, parent_keys) != 0) in xchk_btree_block_keys()
574 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
576 if (!(cur->bc_flags & XFS_BTREE_OVERLAPPING)) in xchk_btree_block_keys()
580 high_bk = xfs_btree_high_key_from_key(cur, &block_keys); in xchk_btree_block_keys()
581 high_pk = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], in xchk_btree_block_keys()
584 if (cur->bc_ops->diff_two_keys(cur, high_bk, high_pk) != 0) in xchk_btree_block_keys()
585 xchk_btree_set_corrupt(bs->sc, cur, 1); in xchk_btree_block_keys()
596 struct xfs_btree_cur *cur, in xchk_btree() argument
614 bs.cur = cur; in xchk_btree()
625 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) { in xchk_btree()
626 xchk_btree_set_corrupt(sc, cur, 0); in xchk_btree()
634 level = cur->bc_nlevels - 1; in xchk_btree()
635 cur->bc_ops->init_ptr_from_cur(cur, &ptr); in xchk_btree()
636 if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr)) in xchk_btree()
642 cur->bc_ptrs[level] = 1; in xchk_btree()
644 while (level < cur->bc_nlevels) { in xchk_btree()
645 block = xfs_btree_get_block(cur, level, &bp); in xchk_btree()
649 if (cur->bc_ptrs[level] > in xchk_btree()
652 if (level < cur->bc_nlevels - 1) in xchk_btree()
653 cur->bc_ptrs[level + 1]++; in xchk_btree()
662 recp = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block); in xchk_btree()
670 cur->bc_ptrs[level]++; in xchk_btree()
675 if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) { in xchk_btree()
677 if (level < cur->bc_nlevels - 1) in xchk_btree()
678 cur->bc_ptrs[level + 1]++; in xchk_btree()
687 pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block); in xchk_btree()
689 cur->bc_ptrs[level]++; in xchk_btree()
697 cur->bc_ptrs[level] = 1; in xchk_btree()
703 if (!error && bs.cur) in xchk_btree()