34 				       struct bkey_i **insert,  in extent_front_merge()  argument
49 	if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert)))  in extent_front_merge()
53 		bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p);  in extent_front_merge()
63 	*insert = update;  in extent_front_merge()
69 				      struct bkey_i *insert,  in extent_back_merge()  argument
78 	ret =   bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?:  in extent_back_merge()
85 	bch2_bkey_merge(c, bkey_i_to_s(insert), k);  in extent_back_merge()
287 				    struct bkey_i *insert,  in bch2_trans_update_extent()  argument
295 	bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k),  in bch2_trans_update_extent()
299 	k = bch2_btree_iter_peek_max(&iter, POS(insert->k.p.inode, U64_MAX));  in bch2_trans_update_extent()
305 	if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) {  in bch2_trans_update_extent()
306 		if (bch2_bkey_maybe_mergable(k.k, &insert->k)) {  in bch2_trans_update_extent()
307 			ret = extent_front_merge(trans, &iter, k, &insert, flags);  in bch2_trans_update_extent()
315 	while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) {  in bch2_trans_update_extent()
316 		bool done = bkey_lt(insert->k.p, k.k->p);  in bch2_trans_update_extent()
318 		ret = bch2_trans_update_extent_overwrite(trans, &iter, flags, k, bkey_i_to_s_c(insert));  in bch2_trans_update_extent()
326 		k = bch2_btree_iter_peek_max(&iter, POS(insert->k.p.inode, U64_MAX));  in bch2_trans_update_extent()
333 	if (bch2_bkey_maybe_mergable(&insert->k, k.k)) {  in bch2_trans_update_extent()
334 		ret = extent_back_merge(trans, &iter, insert, k);  in bch2_trans_update_extent()
339 	if (!bkey_deleted(&insert->k))  in bch2_trans_update_extent()
340 		ret = bch2_btree_insert_nonextent(trans, btree_id, insert, flags);  in bch2_trans_update_extent()