| /linux/fs/xfs/scrub/ |
| H A D | btree.c | 52 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) in __xchk_btree_process_error() 96 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) in __xchk_btree_set_corrupt() 158 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec() 160 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec() 167 cur->bc_ops->init_key_from_rec(&key, rec); in xchk_btree_rec() 173 if (!(cur->bc_ops->geom_flags & XFS_BTGEO_OVERLAPPING)) in xchk_btree_rec() 177 cur->bc_ops->init_high_key_from_rec(&hkey, rec); in xchk_btree_rec() 206 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level - 1].key, key)) in xchk_btree_key() 208 memcpy(&bs->lastkey[level - 1].key, key, cur->bc_ops->key_len); in xchk_btree_key() 220 if (!(cur->bc_ops->geom_flags & XFS_BTGEO_OVERLAPPING)) in xchk_btree_key() [all …]
|
| H A D | ialloc.c | 79 ASSERT(xfs_btree_is_fino(cur->bc_ops)); in xchk_inobt_xref_finobt() 184 ASSERT(xfs_btree_is_ino(cur->bc_ops)); in xchk_finobt_xref_inobt() 520 if (xfs_btree_is_fino(bs->cur->bc_ops)) { in xchk_iallocbt_rec_alignment()
|
| H A D | health.c | 276 unsigned int mask = (*curp)->bc_ops->sick_mask; in xchk_ag_btree_del_cursor_if_sick()
|
| H A D | refcount_repair.c | 532 cur->bc_ops->init_rec_from_cur(cur, block_rec); in xrep_refc_get_records()
|
| H A D | newbt.c | 593 if (cur->bc_ops->ptr_len == XFS_BTREE_LONG_PTR_LEN) in xrep_newbt_claim_block()
|
| H A D | alloc_repair.c | 630 cur->bc_ops->init_rec_from_cur(cur, block_rec); in xrep_abt_get_records()
|
| H A D | trace.h | 563 __string(name, cur->bc_ops->name) 605 __string(name, cur->bc_ops->name) 648 __string(name, cur->bc_ops->name) 686 __string(name, cur->bc_ops->name) 726 __string(name, cur->bc_ops->name)
|
| H A D | rmap_repair.c | 1246 cur->bc_ops->init_rec_from_cur(cur, block_rec); in xrep_rmap_get_records()
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_btree_staging.c | 64 ASSERT(cur->bc_ops->type != XFS_BTREE_TYPE_INODE); in xfs_btree_stage_afakeroot() 131 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_INODE); in xfs_btree_stage_ifakeroot() 310 xfs_btree_init_block(cur->bc_mp, ifp->if_broot, cur->bc_ops, in xfs_btree_bload_prep_block() 444 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_max_npb() 445 return cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_max_npb() 447 ret = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_max_npb() 472 return max_t(unsigned int, cur->bc_ops->get_minrecs(cur, level), npb); in xfs_btree_bload_desired_npb() 500 if (cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_level_geometry() 501 maxnr = cur->bc_ops->get_dmaxrecs(cur, level); in xfs_btree_bload_level_geometry() 503 maxnr = cur->bc_ops->get_maxrecs(cur, level); in xfs_btree_bload_level_geometry() [all …]
|
| H A D | xfs_btree.h | 83 (cur)->bc_ops->statoff + __XBTS_ ## stat) 86 (cur)->bc_ops->statoff + __XBTS_ ## stat, val) 270 const struct xfs_btree_ops *bc_ops; member 552 return cur->bc_ops->cmp_two_keys(cur, key1, key2, NULL) < 0; in xfs_btree_keycmp_lt() 561 return cur->bc_ops->cmp_two_keys(cur, key1, key2, NULL) > 0; in xfs_btree_keycmp_gt() 570 return cur->bc_ops->cmp_two_keys(cur, key1, key2, NULL) == 0; in xfs_btree_keycmp_eq() 608 return cur->bc_ops->cmp_two_keys(cur, key1, key2, mask) < 0; in xfs_btree_masked_keycmp_lt() 618 return cur->bc_ops->cmp_two_keys(cur, key1, key2, mask) > 0; in xfs_btree_masked_keycmp_gt() 642 if (cur->bc_ops->ptr_len == XFS_BTREE_LONG_PTR_LEN) in xfs_btree_islastblock() 685 cur->bc_ops = ops; in xfs_btree_alloc_cursor() [all …]
|
| H A D | xfs_btree_mem.c | 30 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_set_root() 42 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_init_ptr_from_cur() 54 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_dup_cursor() 56 ncur = xfs_btree_alloc_cursor(cur->bc_mp, cur->bc_tp, cur->bc_ops, in xfbtree_dup_cursor() 173 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_alloc_block() 199 ASSERT(cur->bc_ops->type == XFS_BTREE_TYPE_MEM); in xfbtree_free_block()
|
| H A D | xfs_ag.h | 326 const struct xfs_btree_ops *bc_ops; /* btree ops */ member
|
| H A D | xfs_refcount.c | 176 if (xfs_btree_is_rtrefcount(cur->bc_ops)) in xfs_refcount_check_btrec() 189 if (xfs_btree_is_rtrefcount(cur->bc_ops)) { in xfs_refcount_complain_bad_rec() 1135 if (xfs_btree_is_rtrefcount(cur->bc_ops)) in xrefc_free_extent()
|
| H A D | xfs_alloc.c | 276 cur->bc_ops->name, cur->bc_group->xg_gno, fa); in xfs_alloc_complain_bad_rec() 1020 bool isbnobt = xfs_btree_is_bno(cur->bc_ops); in xfs_alloc_cur_check() 4098 ASSERT(xfs_btree_is_bno(cur->bc_ops)); in xfs_alloc_query_range() 4112 ASSERT(xfs_btree_is_bno(cur->bc_ops)); in xfs_alloc_query_all()
|
| /linux/fs/xfs/ |
| H A D | xfs_health.c | 699 if (xfs_btree_is_bmap(cur->bc_ops)) { in xfs_btree_mark_sick() 702 } else if (cur->bc_ops->type != XFS_BTREE_TYPE_MEM) { in xfs_btree_mark_sick() 704 ASSERT(cur->bc_ops->sick_mask); in xfs_btree_mark_sick() 705 xfs_group_mark_sick(cur->bc_group, cur->bc_ops->sick_mask); in xfs_btree_mark_sick()
|
| H A D | xfs_trace.h | 2312 __string(name, cur->bc_ops->name) 2900 __string(name, cur->bc_ops->name) 2938 __string(name, cur->bc_ops->name) 2944 switch (cur->bc_ops->type) { 2961 if (cur->bc_ops->ptr_len == XFS_BTREE_LONG_PTR_LEN) { 2991 __string(name, cur->bc_ops->name) 2998 if (cur->bc_ops->type == XFS_BTREE_TYPE_INODE) 3251 switch (cur->bc_ops->type) { 4733 __string(name, cur->bc_ops->name) 4761 __string(name, cur->bc_ops->name) [all …]
|