fs/bcachefs/btree_update.c

36 				       struct bkey_i **insert,
51 	if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert)))
55 		bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p);
65 	*insert = update;
71 				      struct bkey_i *insert,
80 	ret =   bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?:
87 	bch2_bkey_merge(c, bkey_i_to_s(insert), k);
268 				    struct bkey_i *insert,
276 	bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k),
280 	k = bch2_btree_iter_peek_max(trans, &iter, POS(insert->k.p.inode, U64_MAX));
286 	if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) {
287 		if (bch2_bkey_maybe_mergable(k.k, &insert->k)) {
288 			ret = extent_front_merge(trans, &iter, k, &insert, flags);
296 	while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) {
297 		bool done = bkey_lt(insert->k.p, k.k->p);
299 		ret = bch2_trans_update_extent_overwrite(trans, &iter, flags, k, bkey_i_to_s_c(insert));
307 		k = bch2_btree_iter_peek_max(trans, &iter, POS(insert->k.p.inode, U64_MAX));
314 	if (bch2_bkey_maybe_mergable(&insert->k, k.k)) {
315 		ret = extent_back_merge(trans, &iter, insert, k);
320 	if (!bkey_deleted(&insert->k))
321 		ret = bch2_btree_insert_nonextent(trans, btree_id, insert, flags);
346 	 * The old key in the insert entry might actually refer to an existing
643  * bch2_btree_insert - insert keys into the extent btree
645  * @id:			btree to insert into
646  * @k:			key to insert