Lines Matching refs:insert
34 struct bkey_i **insert,
49 if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert)))
53 bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p);
63 *insert = update;
69 struct bkey_i *insert,
78 ret = bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?:
85 bch2_bkey_merge(c, bkey_i_to_s(insert), k);
287 struct bkey_i *insert,
295 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k),
299 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
305 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) {
306 if (bch2_bkey_maybe_mergable(k.k, &insert->k)) {
307 ret = extent_front_merge(trans, &iter, k, &insert, flags);
315 while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) {
316 bool done = bkey_lt(insert->k.p, k.k->p);
318 ret = bch2_trans_update_extent_overwrite(trans, &iter, flags, k, bkey_i_to_s_c(insert));
326 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
333 if (bch2_bkey_maybe_mergable(&insert->k, k.k)) {
334 ret = extent_back_merge(trans, &iter, insert, k);
339 if (!bkey_deleted(&insert->k))
340 ret = bch2_btree_insert_nonextent(trans, btree_id, insert, flags);
365 * The old key in the insert entry might actually refer to an existing
655 * bch2_btree_insert - insert keys into the extent btree
657 * @id: btree to insert into
658 * @k: key to insert