Home
last modified time | relevance | path

Searched refs:bc_ops (Results 1 - 18 of 18) sorted by relevance

/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_btree_staging.c128 * The btree cursor's bc_ops will be overridden as needed to make the staging
143 memcpy(nops, cur->bc_ops, sizeof(struct xfs_btree_ops)); in xfs_btree_stage_afakeroot()
152 cur->bc_ops = nops; in xfs_btree_stage_afakeroot()
174 kmem_free((void *)cur->bc_ops); in xfs_btree_commit_afakeroot()
176 cur->bc_ops = ops; in xfs_btree_commit_afakeroot()
207 * root. The btree cursor's bc_ops will be overridden as needed to make the
224 memcpy(nops, cur->bc_ops, sizeof(struct xfs_btree_ops)); in xfs_btree_stage_ifakeroot()
232 cur->bc_ops = nops; in xfs_btree_stage_ifakeroot()
257 kmem_free((void *)cur->bc_ops); in xfs_btree_commit_ifakeroot()
260 cur->bc_ops in xfs_btree_commit_ifakeroot()
[all...]
H A Dxfs_btree.c83 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
146 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock()
343 error = cur->bc_ops->free_block(cur, bp); in xfs_btree_free_block()
384 kmem_free(cur->bc_ops); in xfs_btree_del_cursor()
410 new = cur->bc_ops->dup_cursor(cur); in xfs_btree_dup_cursor()
428 cur->bc_ops->buf_ops); in xfs_btree_dup_cursor()
548 (n - 1) * cur->bc_ops->rec_len; in xfs_btree_rec_offset()
560 (n - 1) * cur->bc_ops->key_len; in xfs_btree_key_offset()
572 (n - 1) * cur->bc_ops->key_len + (cur->bc_ops in xfs_btree_high_key_offset()
[all...]
H A Dxfs_alloc_btree.c491 cur->bc_ops = &xfs_cntbt_ops; in xfs_allocbt_init_common()
495 cur->bc_ops = &xfs_bnobt_ops; in xfs_allocbt_init_common()
H A Dxfs_ialloc_btree.c441 cur->bc_ops = &xfs_inobt_ops; in xfs_inobt_init_common()
444 cur->bc_ops = &xfs_finobt_ops; in xfs_inobt_init_common()
H A Dxfs_btree.h222 const struct xfs_btree_ops *bc_ops; member
H A Dxfs_rmap_btree.c468 cur->bc_ops = &xfs_rmapbt_ops; in xfs_rmapbt_init_common()
H A Dxfs_refcount_btree.c338 cur->bc_ops = &xfs_refcountbt_ops; in xfs_refcountbt_init_common()
H A Dxfs_bmap_btree.c564 cur->bc_ops = &xfs_bmbt_ops; in xfs_bmbt_init_cursor()
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_btree_staging.c128 * The btree cursor's bc_ops will be overridden as needed to make the staging
143 memcpy(nops, cur->bc_ops, sizeof(struct xfs_btree_ops)); in xfs_btree_stage_afakeroot()
152 cur->bc_ops = nops; in xfs_btree_stage_afakeroot()
174 kmem_free((void *)cur->bc_ops); in xfs_btree_commit_afakeroot()
176 cur->bc_ops = ops; in xfs_btree_commit_afakeroot()
207 * root. The btree cursor's bc_ops will be overridden as needed to make the
224 memcpy(nops, cur->bc_ops, sizeof(struct xfs_btree_ops)); in xfs_btree_stage_ifakeroot()
232 cur->bc_ops = nops; in xfs_btree_stage_ifakeroot()
257 kmem_free((void *)cur->bc_ops); in xfs_btree_commit_ifakeroot()
260 cur->bc_ops in xfs_btree_commit_ifakeroot()
[all...]
H A Dxfs_btree.c150 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_lblock()
216 cur->bc_ops->get_maxrecs(cur, level)) in __xfs_btree_check_sblock()
413 error = cur->bc_ops->free_block(cur, bp); in xfs_btree_free_block()
454 kmem_free(cur->bc_ops); in xfs_btree_del_cursor()
482 new = cur->bc_ops->dup_cursor(cur); in xfs_btree_dup_cursor()
500 cur->bc_ops->buf_ops); in xfs_btree_dup_cursor()
620 (n - 1) * cur->bc_ops->rec_len; in xfs_btree_rec_offset()
632 (n - 1) * cur->bc_ops->key_len; in xfs_btree_key_offset()
644 (n - 1) * cur->bc_ops->key_len + (cur->bc_ops in xfs_btree_high_key_offset()
[all...]
H A Dxfs_btree.h272 const struct xfs_btree_ops *bc_ops; member
603 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0; in xfs_btree_keycmp_lt()
612 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0; in xfs_btree_keycmp_gt()
621 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0; in xfs_btree_keycmp_eq()
659 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0; in xfs_btree_masked_keycmp_lt()
669 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0; in xfs_btree_masked_keycmp_gt()
H A Dxfs_ialloc_btree.c461 cur->bc_ops = &xfs_inobt_ops; in xfs_inobt_init_common()
464 cur->bc_ops = &xfs_finobt_ops; in xfs_inobt_init_common()
H A Dxfs_alloc_btree.c509 cur->bc_ops = &xfs_cntbt_ops; in xfs_allocbt_init_common()
513 cur->bc_ops = &xfs_bnobt_ops; in xfs_allocbt_init_common()
H A Dxfs_refcount_btree.c357 cur->bc_ops = &xfs_refcountbt_ops; in xfs_refcountbt_init_common()
H A Dxfs_rmap_btree.c514 cur->bc_ops = &xfs_rmapbt_ops; in xfs_rmapbt_init_common()
H A Dxfs_bmap_btree.c565 cur->bc_ops = &xfs_bmbt_ops; in xfs_bmbt_init_cursor()
/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dbtree.c143 if (!bs->firstrec && !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
146 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec()
152 cur->bc_ops->init_key_from_rec(&key, rec); in xchk_btree_rec()
155 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec()
162 cur->bc_ops->init_high_key_from_rec(&hkey, rec); in xchk_btree_rec()
164 if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0) in xchk_btree_rec()
191 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level], key)) in xchk_btree_key()
194 memcpy(&bs->lastkey[level], key, cur->bc_ops->key_len); in xchk_btree_key()
202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key()
211 if (cur->bc_ops in xchk_btree_key()
[all...]
/kernel/linux/linux-6.6/fs/xfs/scrub/
H A Dbtree.c156 !cur->bc_ops->recs_inorder(cur, &bs->lastrec, rec)) in xchk_btree_rec()
158 memcpy(&bs->lastrec, rec, cur->bc_ops->rec_len); in xchk_btree_rec()
165 cur->bc_ops->init_key_from_rec(&key, rec); in xchk_btree_rec()
175 cur->bc_ops->init_high_key_from_rec(&hkey, rec); in xchk_btree_rec()
204 !cur->bc_ops->keys_inorder(cur, &bs->lastkey[level - 1].key, key)) in xchk_btree_key()
206 memcpy(&bs->lastkey[level - 1].key, key, cur->bc_ops->key_len); in xchk_btree_key()
501 if (numrecs >= cur->bc_ops->get_minrecs(cur, level)) in xchk_btree_check_minrecs()
518 root_maxrecs = cur->bc_ops->get_dmaxrecs(cur, root_level); in xchk_btree_check_minrecs()
731 cur->bc_ops->init_ptr_from_cur(cur, &ptr); in xchk_btree()

Completed in 20 milliseconds