fs/bcachefs/btree_update_interior.c

760 		 * @b is the node we did the final insert into:
931 	struct bkey_i *insert = &b->key;
936 	BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
943 				  insert, insert->k.u64s);
1381 					struct bkey_i *insert)
1388 	BUG_ON(insert->k.type == KEY_TYPE_btree_ptr_v2 &&
1389 	       !btree_ptr_sectors_written(bkey_i_to_s_c(insert)));
1392 		bch2_journal_key_overwritten(c, b->c.btree_id, b->c.level, insert->k.p);
1400 	if (bch2_bkey_validate(c, bkey_i_to_s_c(insert), from) ?:
1401 	    bch2_bkey_in_btree_node(c, b, bkey_i_to_s_c(insert), from)) {
1406 	BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
1413 				  insert, insert->k.u64s);
1416 	       bkey_iter_pos_cmp(b, k, &insert->k.p) < 0)
1419 	bch2_btree_bset_insert_key(trans, path, b, node_iter, insert);
1442 	struct bkey_i *insert = bch2_keylist_front(keys);
1448 	       (bkey_cmp_left_packed(b, k, &insert->k.p) >= 0))
1452 	     insert != keys->top && bpos_le(insert->k.p, b->key.k.p);
1453 	     insert = bkey_next(insert))
1454 		bch2_insert_fixup_btree_ptr(as, trans, path, b, &node_iter, insert);
1461 		     k != insert;
1473 	memmove_u64s_down(keys->keys, insert, keys->top_p - insert->_data);
1474 	keys->top_p -= insert->_data - keys->keys_p;
1599  * For updates to interior nodes, we've got to do the insert before we split
1604  * Worse, if the insert is from btree node coalescing, if we do the insert after
1813  * bch2_btree_insert_node - insert bkeys into a given btree node
1818  * @b:			node to insert keys into
1819  * @keys:		list of keys to insert