Lines Matching full:insert

76 	 * a new bset to insert into:  in bch2_btree_node_prep_for_write()
125 /* Inserting into a given leaf node (last stage of insert): */
127 /* Handle overwrites and do insert, for non extents: */
132 struct bkey_i *insert) in bch2_btree_bset_insert_key() argument
139 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k)); in bch2_btree_bset_insert_key()
140 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
141 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key()
142 EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b)); in bch2_btree_bset_insert_key()
143 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos)); in bch2_btree_bset_insert_key()
146 if (k && bkey_cmp_left_packed(b, k, &insert->k.p)) in bch2_btree_bset_insert_key()
153 if (bkey_deleted(&insert->k) && !k) in bch2_btree_bset_insert_key()
156 if (bkey_deleted(&insert->k)) { in bch2_btree_bset_insert_key()
162 push_whiteout(b, insert->k.p); in bch2_btree_bset_insert_key()
181 insert->k.needs_whiteout = k->needs_whiteout; in bch2_btree_bset_insert_key()
194 bch2_bset_insert(b, node_iter, k, insert, clobber_u64s); in bch2_btree_bset_insert_key()
258 * bch2_btree_insert_key_leaf() - insert a key one key into a leaf node
260 * @path: path pointing to @insert's pos
261 * @insert: key to insert
266 struct bkey_i *insert, in bch2_btree_insert_key_leaf() argument
278 &path_l(path)->iter, insert))) in bch2_btree_insert_key_leaf()
543 * For a given btree, this algorithm runs insert triggers before in bch2_trans_commit_run_triggers()
617 * Check if the insert will fit in the leaf node with the write lock in bch2_trans_commit_write_locked()
642 * Don't get journal reservation until after we know insert will in bch2_trans_commit_write_locked()
775 prt_printf(err, "invalid bkey on insert from %s -> %ps", in bch2_trans_commit_bkey_invalid()
798 prt_printf(&buf, "invalid bkey on insert from %s", trans->fn); in bch2_trans_commit_journal_entry_invalid()