Lines Matching refs:insert
97 * a new bset to insert into:
146 /* Inserting into a given leaf node (last stage of insert): */
148 /* Handle overwrites and do insert, for non extents: */
153 struct bkey_i *insert)
160 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k));
161 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));
162 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key));
163 EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b));
164 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos));
167 if (k && bkey_cmp_left_packed(b, k, &insert->k.p))
174 if (bkey_deleted(&insert->k) && !k)
177 if (bkey_deleted(&insert->k)) {
183 push_whiteout(b, insert->k.p);
202 insert->k.needs_whiteout = k->needs_whiteout;
215 bch2_bset_insert(b, node_iter, k, insert, clobber_u64s);
279 * bch2_btree_insert_key_leaf() - insert a key one key into a leaf node
281 * @path: path pointing to @insert's pos
282 * @insert: key to insert
287 struct bkey_i *insert,
299 &path_l(path)->iter, insert)))
563 * For a given btree, this algorithm runs insert triggers before
642 * Check if the insert will fit in the leaf node with the write lock
667 * Don't get journal reservation until after we know insert will
800 prt_printf(err, "invalid bkey on insert from %s -> %ps\n",
822 prt_printf(&buf, "invalid bkey on insert from %s\n", trans->fn);