Lines Matching refs:insert
740 * @b is the node we did the final insert into:
923 struct bkey_i *insert = &b->key;
928 BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
935 insert, insert->k.u64s);
1354 struct bkey_i *insert)
1361 BUG_ON(insert->k.type == KEY_TYPE_btree_ptr_v2 &&
1362 !btree_ptr_sectors_written(insert));
1365 bch2_journal_key_overwritten(c, b->c.btree_id, b->c.level, insert->k.p);
1367 if (bch2_bkey_invalid(c, bkey_i_to_s_c(insert),
1369 bch2_bkey_in_btree_node(c, b, bkey_i_to_s_c(insert), &buf)) {
1372 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));
1374 bch2_bkey_invalid(c, bkey_i_to_s_c(insert),
1376 bch2_bkey_in_btree_node(c, b, bkey_i_to_s_c(insert), &buf);
1382 BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
1389 insert, insert->k.u64s);
1392 bkey_iter_pos_cmp(b, k, &insert->k.p) < 0)
1395 bch2_btree_bset_insert_key(trans, path, b, node_iter, insert);
1418 struct bkey_i *insert = bch2_keylist_front(keys);
1424 (bkey_cmp_left_packed(b, k, &insert->k.p) >= 0))
1428 insert = bch2_keylist_front(keys);
1430 if (bpos_gt(insert->k.p, b->key.k.p))
1433 bch2_insert_fixup_btree_ptr(as, trans, path, b, &node_iter, insert);
1548 * For updates to interior nodes, we've got to do the insert before we split
1553 * Worse, if the insert is from btree node coalescing, if we do the insert after
1754 * bch2_btree_insert_node - insert bkeys into a given btree node
1759 * @b: node to insert keys into
1760 * @keys: list of keys to insert