Lines Matching refs:insert

35 			 struct bkey_i *insert,
51 if (insert) {
55 (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) &&
83 if (insert) {
85 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));
114 struct bkey_i *insert = NULL;
142 insert = _insert.k;
148 bch2_cut_front(iter.pos, insert);
149 bch2_cut_back(new->k.p, insert);
150 bch2_cut_back(insert->k.p, &new->k_i);
154 * @insert: key that we're going to update, initialized from
157 * @new: extent with new pointers that we'll be adding to @insert
164 (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) &&
166 bch2_extent_ptr_set_cached(bkey_i_to_s(insert), ptr);
175 trace_move_extent_fail2(m, k, bkey_i_to_s_c(&new->k_i), insert, "no rewrites found:");
185 if ((ptr_c = bch2_bkey_has_device_c(bkey_i_to_s_c(insert), ptr->dev)) &&
192 trace_move_extent_fail2(m, k, bkey_i_to_s_c(&new->k_i), insert, "new replicas conflicted:");
198 if ((ptr = bch2_bkey_has_device(bkey_i_to_s(insert), p.ptr.dev)))
199 bch2_bkey_drop_ptr_noerror(bkey_i_to_s(insert), ptr);
201 durability = bch2_bkey_durability(c, bkey_i_to_s_c(insert)) +
206 bkey_for_each_ptr_decode(old.k, bch2_bkey_ptrs(bkey_i_to_s(insert)), p, entry) {
213 bch2_extent_ptr_set_cached(bkey_i_to_s(insert), &entry->ptr);
220 bch2_extent_ptr_decoded_append(insert, &p);
222 bch2_bkey_narrow_crcs(insert, (struct bch_extent_crc_unpacked) { 0 });
223 bch2_extent_normalize(c, bkey_i_to_s(insert));
225 ret = bch2_sum_sector_overwrites(trans, &iter, insert,
241 next_pos = insert->k.p;
250 int invalid = bch2_bkey_invalid(c, bkey_i_to_s_c(insert), __btree_node_type(0, m->btree_id), 0, &err);
256 prt_str(&buf, "about to insert invalid key in data update path");
262 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));
279 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));
286 k.k->p, bkey_start_pos(&insert->k)) ?:
288 k.k->p, insert->k.p) ?:
289 bch2_bkey_set_needs_rebalance(c, insert, &op->opts) ?:
290 bch2_trans_update(trans, &iter, insert,