34 			 struct bkey_i *insert,  in trace_move_extent_fail2()  argument
50 	if (insert) {  in trace_move_extent_fail2()
54 			    (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) &&  in trace_move_extent_fail2()
82 	if (insert) {  in trace_move_extent_fail2()
84 		bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));  in trace_move_extent_fail2()
113 		struct bkey_i *insert = NULL;  in __bch2_data_update_index_update()  local
141 		insert = _insert.k;  in __bch2_data_update_index_update()
147 		bch2_cut_front(iter.pos,	insert);  in __bch2_data_update_index_update()
148 		bch2_cut_back(new->k.p,		insert);  in __bch2_data_update_index_update()
149 		bch2_cut_back(insert->k.p,	&new->k_i);  in __bch2_data_update_index_update()
153 		 * @insert: key that we're going to update, initialized from  in __bch2_data_update_index_update()
156 		 * @new: extent with new pointers that we'll be adding to @insert  in __bch2_data_update_index_update()
163 			    (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) &&  in __bch2_data_update_index_update()
165 				bch2_extent_ptr_set_cached(bkey_i_to_s(insert), ptr);  in __bch2_data_update_index_update()
174 			trace_move_extent_fail2(m, k, bkey_i_to_s_c(&new->k_i), insert, "no rewrites found:");  in __bch2_data_update_index_update()
184 			if ((ptr_c = bch2_bkey_has_device_c(bkey_i_to_s_c(insert), ptr->dev)) &&  in __bch2_data_update_index_update()
191 			trace_move_extent_fail2(m, k, bkey_i_to_s_c(&new->k_i), insert, "new replicas conflicted:");  in __bch2_data_update_index_update()
197 			if ((ptr = bch2_bkey_has_device(bkey_i_to_s(insert), p.ptr.dev)))  in __bch2_data_update_index_update()
198 				bch2_bkey_drop_ptr_noerror(bkey_i_to_s(insert), ptr);  in __bch2_data_update_index_update()
200 		durability = bch2_bkey_durability(c, bkey_i_to_s_c(insert)) +  in __bch2_data_update_index_update()
205 		bkey_for_each_ptr_decode(old.k, bch2_bkey_ptrs(bkey_i_to_s(insert)), p, entry) {  in __bch2_data_update_index_update()
212 				bch2_extent_ptr_set_cached(bkey_i_to_s(insert), &entry->ptr);  in __bch2_data_update_index_update()
219 			bch2_extent_ptr_decoded_append(insert, &p);  in __bch2_data_update_index_update()
221 		bch2_bkey_narrow_crcs(insert, (struct bch_extent_crc_unpacked) { 0 });  in __bch2_data_update_index_update()
222 		bch2_extent_normalize(c, bkey_i_to_s(insert));  in __bch2_data_update_index_update()
224 		ret = bch2_sum_sector_overwrites(trans, &iter, insert,  in __bch2_data_update_index_update()
240 		next_pos = insert->k.p;  in __bch2_data_update_index_update()
249 …int invalid = bch2_bkey_invalid(c, bkey_i_to_s_c(insert), __btree_node_type(0, m->btree_id), 0, &e…  in __bch2_data_update_index_update()
255 			prt_str(&buf, "about to insert invalid key in data update path");  in __bch2_data_update_index_update()
261 			bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));  in __bch2_data_update_index_update()
278 			bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));  in __bch2_data_update_index_update()
285 						k.k->p, bkey_start_pos(&insert->k)) ?:  in __bch2_data_update_index_update()
287 						k.k->p, insert->k.p) ?:  in __bch2_data_update_index_update()
288 			bch2_bkey_set_needs_rebalance(c, insert, &op->opts) ?:  in __bch2_data_update_index_update()
289 			bch2_trans_update(trans, &iter, insert,  in __bch2_data_update_index_update()