155 				struct bkey_i *insert)  in bch2_btree_bset_insert_key()  argument
162 	EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k));  in bch2_btree_bset_insert_key()
163 	EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));  in bch2_btree_bset_insert_key()
164 	EBUG_ON(bpos_gt(insert->k.p, b->data->max_key));  in bch2_btree_bset_insert_key()
165 	EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b));  in bch2_btree_bset_insert_key()
166 	EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos));  in bch2_btree_bset_insert_key()
169 	if (k && bkey_cmp_left_packed(b, k, &insert->k.p))  in bch2_btree_bset_insert_key()
176 	if (bkey_deleted(&insert->k) && !k)  in bch2_btree_bset_insert_key()
179 	if (bkey_deleted(&insert->k)) {  in bch2_btree_bset_insert_key()
185 			push_whiteout(b, insert->k.p);  in bch2_btree_bset_insert_key()
204 		insert->k.needs_whiteout = k->needs_whiteout;  in bch2_btree_bset_insert_key()
217 	bch2_bset_insert(b, k, insert, clobber_u64s);  in bch2_btree_bset_insert_key()
289 				       struct bkey_i *insert,  in bch2_btree_insert_key_leaf()  argument
301 					&path_l(path)->iter, insert)))  in bch2_btree_insert_key_leaf()