Home
last modified time | relevance | path

Searched refs:bch2_trans_kmalloc (Results 1 – 17 of 17) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_update.c161 update = bch2_trans_kmalloc(trans, sizeof(struct bkey_i)); in __bch2_insert_snapshot_whiteouts()
244 update = bch2_trans_kmalloc(trans, sizeof(*update)); in bch2_trans_update_extent_overwrite()
553 struct bkey_i *n = bch2_trans_kmalloc(trans, bkey_bytes(&k->k)); in bch2_btree_insert_clone_trans()
675 struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(*k)); in bch2_btree_delete_at()
788 struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(*k)); in bch2_btree_bit_mod_iter()
H A Ddirent.c178 dirent = bch2_trans_kmalloc(trans, u64s * sizeof(u64)); in dirent_create_key()
357 new_src = bch2_trans_kmalloc(trans, sizeof(struct bkey_i)); in bch2_dirent_rename()
H A Dalloc_background.c411 ret = bch2_trans_kmalloc(trans, max(bkey_bytes(k.k), sizeof(struct bkey_i_alloc_v4))); in __bch2_alloc_to_v4_mut()
748 g = bch2_trans_kmalloc(trans, sizeof(*g)); in bch2_bucket_gen_update()
1215 bch2_trans_kmalloc(trans, sizeof(*g)); in bch2_check_alloc_key()
1273 bch2_trans_kmalloc(trans, sizeof(*update)); in bch2_check_alloc_hole_freespace()
1337 struct bkey_i *u = bch2_trans_kmalloc(trans, sizeof(g)); in bch2_check_alloc_hole_bucket_gens()
1540 struct bkey_i *u = bch2_trans_kmalloc(trans, sizeof(g)); in bch2_check_bucket_gens_key()
2269 freespace = bch2_trans_kmalloc(trans, sizeof(*freespace)); in bch2_dev_freespace_init()
H A Drebalance.c196 struct bkey_i *n = bch2_trans_kmalloc(trans, bkey_bytes(k.k) + 8); in bch2_get_update_rebalance_opts()
240 cookie = bch2_trans_kmalloc(trans, sizeof(*cookie)); in bch2_set_rebalance_needs_scan_trans()
H A Dstr_hash.c41 struct bkey_i_dirent *new = bch2_trans_kmalloc(trans, bkey_bytes(old.k) + 32); in fsck_rename_dirent()
H A Dinode.c377 inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p)); in bch2_inode_write_flags()
389 bch2_trans_kmalloc(trans, sizeof(*inode_p)); in __bch2_fsck_write_inode()
419 inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p)); in bch2_inode_to_v3()
H A Dstr_hash.h362 delete = bch2_trans_kmalloc(trans, sizeof(*delete)); in bch2_hash_delete_at()
H A Dacl.c224 xattr = bch2_trans_kmalloc(trans, u64s * sizeof(u64)); in bch2_acl_to_xattr()
H A Dfsck.c399 struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(*k)); in maybe_delete_dirent()
614 struct bkey_i_subvolume *new_subvol = bch2_trans_kmalloc(trans, sizeof(*new_subvol)); in reconstruct_subvol()
2124 n = bch2_trans_kmalloc(trans, bkey_bytes(d.k)); in check_dirent_target()
2535 bch2_trans_kmalloc(trans, sizeof(*root_subvol)); in check_root_trans()
3125 u = bch2_trans_kmalloc(trans, sizeof(*u)); in fix_reflink_p_key()
H A Dxattr.c196 xattr = bch2_trans_kmalloc(trans, u64s * sizeof(u64)); in bch2_xattr_set()
H A Dsubvolume.c544 h = bch2_trans_kmalloc(trans, sizeof(*h)); in bch2_subvolume_unlink()
H A Dreflink.c514 r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k)); in bch2_make_extent_indirect()
H A Dbtree_iter.h548 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size) in bch2_trans_kmalloc() function
H A Dbtree_gc.c965 new = bch2_trans_kmalloc(trans, bkey_bytes(k.k)); in bch2_gc_write_stripes_key()
H A Dio_read.c585 new = bch2_trans_kmalloc(trans, bkey_bytes(k.k) + in __bch2_rbio_narrow_crcs()
H A Dsnapshot.c872 struct bkey_i_snapshot *snapshot = bch2_trans_kmalloc(trans, sizeof(*snapshot)); in check_snapshot_exists()
H A Dec.c1325 n = bch2_trans_kmalloc(trans, bkey_bytes(k.k) + sizeof(stripe_ptr)); in ec_stripe_update_extent()