row0ins.c 55.1 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
/******************************************************
Insert into a table

(c) 1996 Innobase Oy

Created 4/20/1996 Heikki Tuuri
*******************************************************/

#include "row0ins.h"

#ifdef UNIV_NONINL
#include "row0ins.ic"
#endif

#include "dict0dict.h"
#include "dict0boot.h"
#include "trx0undo.h"
#include "btr0btr.h"
#include "btr0cur.h"
#include "mach0data.h"
#include "que0que.h"
#include "row0upd.h"
#include "row0sel.h"
#include "row0row.h"
#include "rem0cmp.h"
#include "lock0lock.h"
#include "log0log.h"
#include "eval0eval.h"
#include "data0data.h"
#include "usr0sess.h"

#define	ROW_INS_PREV	1
#define	ROW_INS_NEXT	2

unknown's avatar
unknown committed
35 36 37 38 39 40

/*********************************************************************
This prototype is copied from /mysql/sql/ha_innodb.cc.
Invalidates the MySQL query cache for the table.
NOTE that the exact prototype of this function has to be in
/innobase/row/row0ins.c! */
unknown's avatar
unknown committed
41
extern
unknown's avatar
unknown committed
42 43 44 45 46
void
innobase_invalidate_query_cache(
/*============================*/
	trx_t*	trx,		/* in: transaction which modifies the table */
	char*	full_name,	/* in: concatenation of database name, null
unknown's avatar
unknown committed
47 48 49 50 51
				char '\0', table name, null char'\0';
				NOTE that in Windows this is always
				in LOWER CASE! */
	ulint	full_name_len);	/* in: full name length where also the null
				chars count */
unknown's avatar
unknown committed
52 53


54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219
/*************************************************************************
Creates an insert node struct. */

ins_node_t*
ins_node_create(
/*============*/
					/* out, own: insert node struct */
	ulint		ins_type,	/* in: INS_VALUES, ... */
	dict_table_t*	table, 		/* in: table where to insert */
	mem_heap_t*	heap)		/* in: mem heap where created */
{
	ins_node_t*	node;

	node = mem_heap_alloc(heap, sizeof(ins_node_t));

	node->common.type = QUE_NODE_INSERT;

	node->ins_type = ins_type;

	node->state = INS_NODE_SET_IX_LOCK;
	node->table = table;
	node->index = NULL;
	node->entry = NULL;

	node->select = NULL;
	
	node->trx_id = ut_dulint_zero;
	
	node->entry_sys_heap = mem_heap_create(128);

	node->magic_n = INS_NODE_MAGIC_N;	
	
	return(node);
}

/***************************************************************
Creates an entry template for each index of a table. */
static
void
ins_node_create_entry_list(
/*=======================*/
	ins_node_t*	node)	/* in: row insert node */
{
	dict_index_t*	index;
	dtuple_t*	entry;

	ut_ad(node->entry_sys_heap);

	UT_LIST_INIT(node->entry_list);

	index = dict_table_get_first_index(node->table);
	
	while (index != NULL) {
		entry = row_build_index_entry(node->row, index,
							node->entry_sys_heap);
		UT_LIST_ADD_LAST(tuple_list, node->entry_list, entry);

		index = dict_table_get_next_index(index);
	}
}

/*********************************************************************
Adds system field buffers to a row. */
static
void
row_ins_alloc_sys_fields(
/*=====================*/
	ins_node_t*	node)	/* in: insert node */
{
	dtuple_t*	row;
	dict_table_t*	table;
	mem_heap_t*	heap;
	dict_col_t*	col;
	dfield_t*	dfield;
	ulint		len;
	byte*		ptr;

	row = node->row;
	table = node->table;
	heap = node->entry_sys_heap;

	ut_ad(row && table && heap);
	ut_ad(dtuple_get_n_fields(row) == dict_table_get_n_cols(table));

	/* 1. Allocate buffer for row id */

	col = dict_table_get_sys_col(table, DATA_ROW_ID);
	
	dfield = dtuple_get_nth_field(row, dict_col_get_no(col));

	ptr = mem_heap_alloc(heap, DATA_ROW_ID_LEN);
				
	dfield_set_data(dfield, ptr, DATA_ROW_ID_LEN);

	node->row_id_buf = ptr;

	if (table->type == DICT_TABLE_CLUSTER_MEMBER) {

		/* 2. Fill in the dfield for mix id */

		col = dict_table_get_sys_col(table, DATA_MIX_ID);
	
		dfield = dtuple_get_nth_field(row, dict_col_get_no(col));

		len = mach_dulint_get_compressed_size(table->mix_id);
		ptr = mem_heap_alloc(heap, DATA_MIX_ID_LEN);
				
		mach_dulint_write_compressed(ptr, table->mix_id);
		dfield_set_data(dfield, ptr, len);
	}

	/* 3. Allocate buffer for trx id */

	col = dict_table_get_sys_col(table, DATA_TRX_ID);
	
	dfield = dtuple_get_nth_field(row, dict_col_get_no(col));
	ptr = mem_heap_alloc(heap, DATA_TRX_ID_LEN);
				
	dfield_set_data(dfield, ptr, DATA_TRX_ID_LEN);

	node->trx_id_buf = ptr;

	/* 4. Allocate buffer for roll ptr */

	col = dict_table_get_sys_col(table, DATA_ROLL_PTR);
	
	dfield = dtuple_get_nth_field(row, dict_col_get_no(col));
	ptr = mem_heap_alloc(heap, DATA_ROLL_PTR_LEN);
				
	dfield_set_data(dfield, ptr, DATA_ROLL_PTR_LEN);
}

/*************************************************************************
Sets a new row to insert for an INS_DIRECT node. This function is only used
if we have constructed the row separately, which is a rare case; this
function is quite slow. */

void
ins_node_set_new_row(
/*=================*/
	ins_node_t*	node,	/* in: insert node */
	dtuple_t*	row)	/* in: new row (or first row) for the node */
{
	node->state = INS_NODE_SET_IX_LOCK;
	node->index = NULL;
	node->entry = NULL;

	node->row = row;

	mem_heap_empty(node->entry_sys_heap);

	/* Create templates for index entries */
			
	ins_node_create_entry_list(node);

	/* Allocate from entry_sys_heap buffers for sys fields */

	row_ins_alloc_sys_fields(node);

	/* As we allocated a new trx id buf, the trx id should be written
	there again: */

	node->trx_id = ut_dulint_zero;
}

/***********************************************************************
unknown's avatar
unknown committed
220 221
Does an insert operation by updating a delete-marked existing record
in the index. This situation can occur if the delete-marked record is
222 223 224 225 226 227
kept in the index for consistent reads. */
static
ulint
row_ins_sec_index_entry_by_modify(
/*==============================*/
				/* out: DB_SUCCESS or error code */
unknown's avatar
unknown committed
228 229 230
	ulint		mode,	/* in: BTR_MODIFY_LEAF or BTR_MODIFY_TREE,
				depending on whether mtr holds just a leaf
				latch or also a tree latch */
231
	btr_cur_t*	cursor,	/* in: B-tree cursor */
232
	dtuple_t*	entry,	/* in: index entry to insert */
233 234 235
	que_thr_t*	thr,	/* in: query thread */
	mtr_t*		mtr)	/* in: mtr */
{
unknown's avatar
unknown committed
236
	big_rec_t*	dummy_big_rec;
237 238 239 240 241 242
	mem_heap_t*	heap;
	upd_t*		update;
	rec_t*		rec;
	ulint		err;
	
	rec = btr_cur_get_rec(cursor);
243
	
244 245 246
	ut_ad((cursor->index->type & DICT_CLUSTERED) == 0);
	ut_ad(rec_get_deleted_flag(rec));
	
unknown's avatar
unknown committed
247
	/* We know that in the alphabetical ordering, entry and rec are
unknown's avatar
unknown committed
248
	identified. But in their binary form there may be differences if
unknown's avatar
unknown committed
249
	there are char fields in them. Therefore we have to calculate the
unknown's avatar
unknown committed
250
	difference. */
251 252 253 254 255
	
	heap = mem_heap_create(1024);
	
	update = row_upd_build_sec_rec_difference_binary(cursor->index,
							entry, rec, heap); 
unknown's avatar
unknown committed
256 257 258
	if (mode == BTR_MODIFY_LEAF) {
		/* Try an optimistic updating of the record, keeping changes
		within the page */
259

unknown's avatar
unknown committed
260 261 262 263 264 265 266 267 268 269
		err = btr_cur_optimistic_update(BTR_KEEP_SYS_FLAG, cursor,
						update, 0, thr, mtr);
		if (err == DB_OVERFLOW || err == DB_UNDERFLOW) {
			err = DB_FAIL;
		}
	} else  {
		ut_a(mode == BTR_MODIFY_TREE);
		err = btr_cur_pessimistic_update(BTR_KEEP_SYS_FLAG, cursor,
					&dummy_big_rec, update, 0, thr, mtr);
	}
270 271

	mem_heap_free(heap);
272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288

	return(err);
}

/***********************************************************************
Does an insert operation by delete unmarking and updating a delete marked
existing record in the index. This situation can occur if the delete marked
record is kept in the index for consistent reads. */
static
ulint
row_ins_clust_index_entry_by_modify(
/*================================*/
				/* out: DB_SUCCESS, DB_FAIL, or error code */
	ulint		mode,	/* in: BTR_MODIFY_LEAF or BTR_MODIFY_TREE,
				depending on whether mtr holds just a leaf
				latch or also a tree latch */
	btr_cur_t*	cursor,	/* in: B-tree cursor */
289 290 291
	big_rec_t**	big_rec,/* out: possible big rec vector of fields
				which have to be stored externally by the
				caller */
292
	dtuple_t*	entry,	/* in: index entry to insert */
293 294 295
	ulint*		ext_vec,/* in: array containing field numbers of
				externally stored fields in entry, or NULL */
	ulint		n_ext_vec,/* in: number of fields in ext_vec */
296 297 298 299 300 301 302 303
	que_thr_t*	thr,	/* in: query thread */
	mtr_t*		mtr)	/* in: mtr */
{
	mem_heap_t*	heap;
	rec_t*		rec;
	upd_t*		update;
	ulint		err;
	
304
	ut_ad(cursor->index->type & DICT_CLUSTERED);
305
	
306 307
	*big_rec = NULL;

308 309 310 311 312 313 314
	rec = btr_cur_get_rec(cursor);

	ut_ad(rec_get_deleted_flag(rec));	

	heap = mem_heap_create(1024);
	
	/* Build an update vector containing all the fields to be modified;
unknown's avatar
Merge  
unknown committed
315 316
	NOTE that this vector may NOT contain system columns trx_id or
	roll_ptr */
317
	
318
	update = row_upd_build_difference_binary(cursor->index, entry, ext_vec,
319
						n_ext_vec, rec, heap); 
320 321 322 323
	if (mode == BTR_MODIFY_LEAF) {
		/* Try optimistic updating of the record, keeping changes
		within the page */

unknown's avatar
unknown committed
324 325
		err = btr_cur_optimistic_update(0, cursor, update, 0, thr,
								   mtr);
326
		if (err == DB_OVERFLOW || err == DB_UNDERFLOW) {
327 328 329
			err = DB_FAIL;
		}
	} else  {
330 331 332
		ut_a(mode == BTR_MODIFY_TREE);
		err = btr_cur_pessimistic_update(0, cursor, big_rec, update,
								0, thr, mtr);
333 334 335 336 337 338 339
	}
	
	mem_heap_free(heap);

	return(err);
}

unknown's avatar
unknown committed
340
/*************************************************************************
unknown's avatar
unknown committed
341
Returns TRUE if in a cascaded update/delete an ancestor node of node
unknown's avatar
unknown committed
342
updates (not DELETE, but UPDATE) table. */
unknown's avatar
unknown committed
343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359
static
ibool
row_ins_cascade_ancestor_updates_table(
/*===================================*/
				/* out: TRUE if an ancestor updates table */
	que_node_t*	node,	/* in: node in a query graph */
	dict_table_t*	table)	/* in: table */
{
	que_node_t*	parent;
	upd_node_t*	upd_node;

	parent = que_node_get_parent(node);
	
	while (que_node_get_type(parent) == QUE_NODE_UPDATE) {

		upd_node = parent;

unknown's avatar
unknown committed
360
		if (upd_node->table == table && upd_node->is_delete == FALSE) {
unknown's avatar
unknown committed
361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382

			return(TRUE);
		}

		parent = que_node_get_parent(parent);

		ut_a(parent);
	}

	return(FALSE);
}
	
/**********************************************************************
Calculates the update vector node->cascade->update for a child table in
a cascaded update. */
static
ulint
row_ins_cascade_calc_update_vec(
/*============================*/
					/* out: number of fields in the
					calculated update vector; the value
					can also be 0 if no foreign key
unknown's avatar
unknown committed
383 384 385 386 387
					fields changed; the returned value
					is ULINT_UNDEFINED if the column
					type in the child table is too short
					to fit the new value in the parent
					table: that means the update fails */
unknown's avatar
unknown committed
388 389
	upd_node_t*	node,		/* in: update node of the parent
					table */
unknown's avatar
unknown committed
390
	dict_foreign_t*	foreign,	/* in: foreign key constraint whose
unknown's avatar
unknown committed
391
					type is != 0 */
unknown's avatar
unknown committed
392 393
	mem_heap_t*	heap)		/* in: memory heap to use as
					temporary storage */
unknown's avatar
unknown committed
394 395 396 397 398 399 400 401 402 403 404 405
{
	upd_node_t*	cascade		= node->cascade_node;
	dict_table_t*	table		= foreign->foreign_table;
	dict_index_t*	index		= foreign->foreign_index;
	upd_t*		update;
	upd_field_t*	ufield;
	dict_table_t*	parent_table;
	dict_index_t*	parent_index;
	upd_t*		parent_update;
	upd_field_t*	parent_ufield;
	ulint		n_fields_updated;
	ulint           parent_field_no;
unknown's avatar
unknown committed
406
	dtype_t*	type;
unknown's avatar
unknown committed
407 408 409 410 411 412
	ulint		i;
	ulint		j;
	    	
	ut_a(node && foreign && cascade && table && index);

	/* Calculate the appropriate update vector which will set the fields
unknown's avatar
unknown committed
413 414 415
	in the child index record to the same value (possibly padded with 
	spaces if the column is a fixed length CHAR or FIXBINARY column) as
	the referenced index record will get in the update. */
unknown's avatar
unknown committed
416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450

	parent_table = node->table;
	ut_a(parent_table == foreign->referenced_table);
	parent_index = foreign->referenced_index;
	parent_update = node->update;
		
	update = cascade->update;

	update->info_bits = 0;
	update->n_fields = foreign->n_fields;
		
	n_fields_updated = 0;

	for (i = 0; i < foreign->n_fields; i++) {

		parent_field_no = dict_table_get_nth_col_pos(
					parent_table,
					dict_index_get_nth_col_no(
							parent_index, i));

		for (j = 0; j < parent_update->n_fields; j++) {
			parent_ufield = parent_update->fields + j;
		
			if (parent_ufield->field_no == parent_field_no) {

				/* A field in the parent index record is
				updated. Let us make the update vector
				field for the child table. */

 				ufield = update->fields + n_fields_updated;

				ufield->field_no =
					dict_table_get_nth_col_pos(table,
					dict_index_get_nth_col_no(index, i));
				ufield->exp = NULL;
unknown's avatar
unknown committed
451

unknown's avatar
unknown committed
452
				ufield->new_val = parent_ufield->new_val;
unknown's avatar
unknown committed
453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500

				type = dict_index_get_nth_type(index, i);

				/* Do not allow a NOT NULL column to be
				updated as NULL */

				if (ufield->new_val.len == UNIV_SQL_NULL
				    && (type->prtype & DATA_NOT_NULL)) {

				        return(ULINT_UNDEFINED);
				}

				/* If the new value would not fit in the
				column, do not allow the update */

				if (ufield->new_val.len != UNIV_SQL_NULL
				    && ufield->new_val.len
				       > dtype_get_len(type)) {

				        return(ULINT_UNDEFINED);
				}

				/* If the parent column type has a different
				length than the child column type, we may
				need to pad with spaces the new value of the
				child column */

				if (dtype_is_fixed_size(type)
				    && ufield->new_val.len != UNIV_SQL_NULL
				    && ufield->new_val.len
				       < dtype_get_fixed_size(type)) {

				        ufield->new_val.data =
						mem_heap_alloc(heap,
						  dtype_get_fixed_size(type));
					ufield->new_val.len = 
						dtype_get_fixed_size(type);
					ut_a(dtype_get_pad_char(type)
					     != ULINT_UNDEFINED);

					memset(ufield->new_val.data,
					       (byte)dtype_get_pad_char(type),
					       dtype_get_fixed_size(type));
					ut_memcpy(ufield->new_val.data,
						parent_ufield->new_val.data,
						parent_ufield->new_val.len);
				}

unknown's avatar
unknown committed
501 502 503 504 505 506 507 508 509 510 511 512
				ufield->extern_storage = FALSE;

				n_fields_updated++;
			}
		}
	}

	update->n_fields = n_fields_updated;

	return(n_fields_updated);
}

unknown's avatar
unknown committed
513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617
/*************************************************************************
Reports a foreign key error associated with an update or a delete of a
parent table index entry. */
static
void
row_ins_foreign_report_err(
/*=======================*/
	char*		errstr,		/* in: error string from the viewpoint
					of the parent table */
	que_thr_t*	thr,		/* in: query thread whose run_node
					is an update node */
	dict_foreign_t*	foreign,	/* in: foreign key constraint */
	rec_t*		rec,		/* in: a matching index record in the
					child table */
	dtuple_t*	entry)		/* in: index entry in the parent
					table */
{
	char*	buf	= dict_foreign_err_buf;

	mutex_enter(&dict_foreign_err_mutex);
	ut_sprintf_timestamp(buf);
	sprintf(buf + strlen(buf), " Transaction:\n");
	trx_print(buf + strlen(buf), thr_get_trx(thr));

	sprintf(buf + strlen(buf),
"Foreign key constraint fails for table %.500s:\n",
				foreign->foreign_table_name);
	dict_print_info_on_foreign_key_in_create_format(
				foreign, buf + strlen(buf));
	sprintf(buf + strlen(buf), "\n%s", errstr);
	sprintf(buf + strlen(buf),
" in parent table, in index %.500s tuple:\n",
			foreign->referenced_index->name);
	if (entry) {
		dtuple_sprintf(buf + strlen(buf), 1000, entry);
	}
	sprintf(buf + strlen(buf),
"\nBut in child table %.500s, in index %.500s, there is a record:\n",
		foreign->foreign_table_name, foreign->foreign_index->name);
	if (rec) {
		rec_sprintf(buf + strlen(buf), 1000, rec);
	}
	sprintf(buf + strlen(buf), "\n");
       
	ut_a(strlen(buf) < DICT_FOREIGN_ERR_BUF_LEN);

	mutex_exit(&dict_foreign_err_mutex);
}

/*************************************************************************
Reports a foreign key error to dict_foreign_err_buf when we are trying
to add an index entry to a child table. Note that the adding may be the result
of an update, too. */
static
void
row_ins_foreign_report_add_err(
/*===========================*/
	que_thr_t*	thr,		/* in: query thread whose run_node
					is an insert node */
	dict_foreign_t*	foreign,	/* in: foreign key constraint */
	rec_t*		rec,		/* in: a record in the parent table:
					it does not match entry because we
					have an error! */
	dtuple_t*	entry)		/* in: index entry to insert in the
					child table */
{
	char*	buf	= dict_foreign_err_buf;

	mutex_enter(&dict_foreign_err_mutex);
	ut_sprintf_timestamp(buf);
	sprintf(buf + strlen(buf), " Transaction:\n");
	trx_print(buf + strlen(buf), thr_get_trx(thr));			
	sprintf(buf + strlen(buf),
"Foreign key constraint fails for table %.500s:\n",
				foreign->foreign_table_name);
	dict_print_info_on_foreign_key_in_create_format(
				foreign, buf + strlen(buf));
	sprintf(buf + strlen(buf),
"\nTrying to add in child table, in index %.500s tuple:\n",
			foreign->foreign_index->name);
	if (entry) {
		dtuple_sprintf(buf + strlen(buf), 1000, entry);
	}
	sprintf(buf + strlen(buf),
"\nBut in parent table %.500s, in index %.500s,\n"
"the closest match we can find is record:\n",
				foreign->referenced_table_name,
				foreign->referenced_index->name);
	if (rec && page_rec_is_supremum(rec)) {
		/* If the cursor ended on a supremum record, it is better
		to report the previous record in the error message, so that
		the user gets a more descriptive error message. */
		rec = page_rec_get_prev(rec);
	}

	if (rec) {
		rec_sprintf(buf + strlen(buf), 1000, rec);
	}
	sprintf(buf + strlen(buf), "\n");

	ut_a(strlen(buf) < DICT_FOREIGN_ERR_BUF_LEN);

	mutex_exit(&dict_foreign_err_mutex);
}

unknown's avatar
unknown committed
618 619 620 621
/*************************************************************************
Perform referential actions or checks when a parent row is deleted or updated
and the constraint had an ON DELETE or ON UPDATE condition which was not
RESTRICT. */
unknown's avatar
unknown committed
622 623
static
ulint
unknown's avatar
unknown committed
624 625
row_ins_foreign_check_on_constraint(
/*================================*/
unknown's avatar
unknown committed
626 627 628 629 630 631 632 633
					/* out: DB_SUCCESS, DB_LOCK_WAIT,
					or error code */
	que_thr_t*	thr,		/* in: query thread whose run_node
					is an update node */
	dict_foreign_t*	foreign,	/* in: foreign key constraint whose
					type is != 0 */
	btr_pcur_t*	pcur,		/* in: cursor placed on a matching
					index record in the child table */
unknown's avatar
unknown committed
634 635
	dtuple_t*	entry,		/* in: index entry in the parent
					table */
unknown's avatar
unknown committed
636 637 638 639 640 641 642 643 644 645
	mtr_t*		mtr)		/* in: mtr holding the latch of pcur
					page */
{
	upd_node_t*	node;
	upd_node_t*	cascade;
	dict_table_t*	table		= foreign->foreign_table;
	dict_index_t*	index;
	dict_index_t*	clust_index;
	dtuple_t*	ref;
	mem_heap_t*	tmp_heap;
unknown's avatar
unknown committed
646
	mem_heap_t*	upd_vec_heap	= NULL;
unknown's avatar
unknown committed
647 648 649
	rec_t*		rec;
	rec_t*		clust_rec;
	upd_t*		update;
unknown's avatar
unknown committed
650
	ulint		n_to_update;
unknown's avatar
unknown committed
651 652
	ulint		err;
	ulint		i;
unknown's avatar
unknown committed
653 654
	char*		ptr;
	char		table_name_buf[1000];
unknown's avatar
unknown committed
655 656 657 658
	char		err_buf[1000];
	
	ut_a(thr && foreign && pcur && mtr);

unknown's avatar
unknown committed
659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674
	/* Since we are going to delete or update a row, we have to invalidate
	the MySQL query cache for table */

	ut_a(ut_strlen(table->name) < 998);
	
	ut_memcpy(table_name_buf, table->name, ut_strlen(table->name) + 1);

	ptr = table_name_buf;

	while (*ptr != '/') {
		ptr++;
	}

	*ptr = '\0';
	
	/* We call a function in ha_innodb.cc */
unknown's avatar
unknown committed
675
#ifndef UNIV_HOTBACKUP
unknown's avatar
unknown committed
676
	innobase_invalidate_query_cache(thr_get_trx(thr), table_name_buf,
unknown's avatar
unknown committed
677
						ut_strlen(table->name) + 1);
unknown's avatar
unknown committed
678
#endif
unknown's avatar
unknown committed
679 680
	node = thr->run_node;

unknown's avatar
unknown committed
681 682 683 684
	if (node->is_delete && 0 == (foreign->type &
			(DICT_FOREIGN_ON_DELETE_CASCADE
			 | DICT_FOREIGN_ON_DELETE_SET_NULL))) {

unknown's avatar
unknown committed
685 686 687 688
		row_ins_foreign_report_err((char*)"Trying to delete",
					thr, foreign,
					btr_pcur_get_rec(pcur), entry);

unknown's avatar
unknown committed
689 690 691 692 693 694 695 696 697
	        return(DB_ROW_IS_REFERENCED);
	}

	if (!node->is_delete && 0 == (foreign->type &
			(DICT_FOREIGN_ON_UPDATE_CASCADE
			 | DICT_FOREIGN_ON_UPDATE_SET_NULL))) {

		/* This is an UPDATE */
			 
unknown's avatar
unknown committed
698 699 700 701
		row_ins_foreign_report_err((char*)"Trying to update",
					thr, foreign,
					btr_pcur_get_rec(pcur), entry);

unknown's avatar
unknown committed
702 703 704
	        return(DB_ROW_IS_REFERENCED);
	}

unknown's avatar
unknown committed
705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724
	if (node->cascade_node == NULL) {
		/* Extend our query graph by creating a child to current
		update node. The child is used in the cascade or set null
		operation. */

		node->cascade_heap = mem_heap_create(128);
		node->cascade_node = row_create_update_node_for_mysql(
						table, node->cascade_heap);
		que_node_set_parent(node->cascade_node, node);
	}

	/* Initialize cascade_node to do the operation we want. Note that we
	use the SAME cascade node to do all foreign key operations of the
	SQL DELETE: the table of the cascade node may change if there are
	several child tables to the table where the delete is done! */

	cascade = node->cascade_node;
	
	cascade->table = table;

unknown's avatar
unknown committed
725 726 727 728
	cascade->foreign = foreign;
	
	if (node->is_delete
	    && (foreign->type & DICT_FOREIGN_ON_DELETE_CASCADE)) {
unknown's avatar
unknown committed
729 730 731 732 733 734 735 736 737 738 739 740 741
		cascade->is_delete = TRUE;
	} else {
		cascade->is_delete = FALSE;

		if (foreign->n_fields > cascade->update_n_fields) {
			/* We have to make the update vector longer */

			cascade->update = upd_create(foreign->n_fields,
							node->cascade_heap);
			cascade->update_n_fields = foreign->n_fields;
		}
	}

unknown's avatar
unknown committed
742 743 744 745 746 747 748 749 750
	/* We do not allow cyclic cascaded updating (DELETE is allowed,
	but not UPDATE) of the same table, as this can lead to an infinite
	cycle. Check that we are not updating the same table which is
	already being modified in this cascade chain. We have to check
	this also because the modification of the indexes of a 'parent'
	table may still be incomplete, and we must avoid seeing the indexes
	of the parent table in an inconsistent state! */

	if (!cascade->is_delete
unknown's avatar
unknown committed
751 752 753 754 755 756 757
	    && row_ins_cascade_ancestor_updates_table(cascade, table)) {

	        /* We do not know if this would break foreign key
	        constraints, but play safe and return an error */

	        err = DB_ROW_IS_REFERENCED;

unknown's avatar
unknown committed
758 759 760 761
		row_ins_foreign_report_err(
(char*)"Trying an update, possibly causing a cyclic cascaded update\n"
"in the child table,", thr, foreign, btr_pcur_get_rec(pcur), entry);

unknown's avatar
unknown committed
762 763 764
		goto nonstandard_exit_func;
	}

unknown's avatar
unknown committed
765 766
	index = btr_pcur_get_btr_cur(pcur)->index;

unknown's avatar
unknown committed
767 768
	ut_a(index == foreign->foreign_index);
	
unknown's avatar
unknown committed
769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794
	rec = btr_pcur_get_rec(pcur);

	if (index->type & DICT_CLUSTERED) {
		/* pcur is already positioned in the clustered index of
		the child table */
	
		clust_index = index;
		clust_rec = rec;
	} else {
		/* We have to look for the record in the clustered index
		in the child table */

		clust_index = dict_table_get_first_index(table);

		tmp_heap = mem_heap_create(256);
		
		ref = row_build_row_ref(ROW_COPY_POINTERS, index, rec,
								tmp_heap);
		btr_pcur_open_with_no_init(clust_index, ref,
			PAGE_CUR_LE, BTR_SEARCH_LEAF,
			cascade->pcur, 0, mtr);

		mem_heap_free(tmp_heap);

		clust_rec = btr_pcur_get_rec(cascade->pcur);

unknown's avatar
unknown committed
795 796 797 798
		if (!page_rec_is_user_rec(clust_rec)
		    || btr_pcur_get_low_match(cascade->pcur)
		       < dict_index_get_n_unique(clust_index)) {

unknown's avatar
unknown committed
799
		        fprintf(stderr,
unknown's avatar
unknown committed
800
			"InnoDB: error in cascade of a foreign key op\n"
unknown's avatar
unknown committed
801 802 803
		  	"InnoDB: index %s table %s\n", index->name,
		  	index->table->name);

unknown's avatar
unknown committed
804 805
			rec_sprintf(err_buf, 900, rec);
			fprintf(stderr, "InnoDB: record %s\n", err_buf);
unknown's avatar
unknown committed
806

unknown's avatar
unknown committed
807 808 809 810
			rec_sprintf(err_buf, 900, clust_rec);
			fprintf(stderr, "InnoDB: clustered record %s\n",
							   err_buf);
			fprintf(stderr,
unknown's avatar
unknown committed
811
			"InnoDB: Make a detailed bug report and send it\n");
unknown's avatar
unknown committed
812
			fprintf(stderr, "InnoDB: to mysql@lists.mysql.com\n");
unknown's avatar
unknown committed
813

unknown's avatar
unknown committed
814
			err = DB_SUCCESS;
unknown's avatar
unknown committed
815

unknown's avatar
unknown committed
816 817
			goto nonstandard_exit_func;
		}
unknown's avatar
unknown committed
818 819 820 821 822 823 824
	}

	/* Set an X-lock on the row to delete or update in the child table */

	err = lock_table(0, table, LOCK_IX, thr);

	if (err == DB_SUCCESS) {
unknown's avatar
unknown committed
825 826 827 828
		/* Here it suffices to use a LOCK_REC_NOT_GAP type lock;
		we already have a normal shared lock on the appropriate
		gap if the search criterion was not unique */
		
unknown's avatar
unknown committed
829
		err = lock_clust_rec_read_check_and_lock(0, clust_rec,
unknown's avatar
unknown committed
830
				clust_index, LOCK_X, LOCK_REC_NOT_GAP, thr);
unknown's avatar
unknown committed
831 832 833 834 835 836 837 838
	}
	
	if (err != DB_SUCCESS) {

		goto nonstandard_exit_func;
	}

	if (rec_get_deleted_flag(clust_rec)) {
unknown's avatar
unknown committed
839 840 841 842
		/* This can happen if there is a circular reference of
		rows such that cascading delete comes to delete a row
		already in the process of being delete marked */
/*
unknown's avatar
unknown committed
843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858
	  	fprintf(stderr,
			"InnoDB: error 2 in cascade of a foreign key op\n"
		  	"InnoDB: index %s table %s\n", index->name,
		  	index->table->name);

	  	rec_sprintf(err_buf, 900, rec);
	  	fprintf(stderr, "InnoDB: record %s\n", err_buf);

	  	rec_sprintf(err_buf, 900, clust_rec);
	  	fprintf(stderr, "InnoDB: clustered record %s\n", err_buf);

	  	fprintf(stderr,
			"InnoDB: Make a detailed bug report and send it\n");
	  	fprintf(stderr, "InnoDB: to mysql@lists.mysql.com\n");

		ut_a(0);
unknown's avatar
unknown committed
859 860
*/
		err = DB_SUCCESS;		
unknown's avatar
unknown committed
861 862 863 864

		goto nonstandard_exit_func;
	}

unknown's avatar
unknown committed
865 866 867 868 869
	if ((node->is_delete
	    && (foreign->type & DICT_FOREIGN_ON_DELETE_SET_NULL))
	   || (!node->is_delete
	    && (foreign->type & DICT_FOREIGN_ON_UPDATE_SET_NULL))) {
	    	
unknown's avatar
unknown committed
870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888
		/* Build the appropriate update vector which sets
		foreign->n_fields first fields in rec to SQL NULL */

		update = cascade->update;

		update->info_bits = 0;
		update->n_fields = foreign->n_fields;
		
		for (i = 0; i < foreign->n_fields; i++) {
			(update->fields + i)->field_no
				= dict_table_get_nth_col_pos(table,
					dict_index_get_nth_col_no(index, i));
			(update->fields + i)->exp = NULL;
			(update->fields + i)->new_val.len = UNIV_SQL_NULL;
			(update->fields + i)->new_val.data = NULL;
			(update->fields + i)->extern_storage = FALSE;
		}
	}

unknown's avatar
unknown committed
889 890 891 892 893 894
	if (!node->is_delete
	    && (foreign->type & DICT_FOREIGN_ON_UPDATE_CASCADE)) {

		/* Build the appropriate update vector which sets changing
		foreign->n_fields first fields in rec to new values */

unknown's avatar
unknown committed
895 896 897 898 899 900 901 902 903 904 905 906 907 908 909
		upd_vec_heap = mem_heap_create(256);

		n_to_update = row_ins_cascade_calc_update_vec(node, foreign,
							      upd_vec_heap);
		if (n_to_update == ULINT_UNDEFINED) {
		        err = DB_ROW_IS_REFERENCED;

			row_ins_foreign_report_err(
(char*)"Trying a cascaded update where the updated value in the child\n"
"table would not fit in the length of the column, or the value would\n"
"be NULL and the column is declared as not NULL in the child table,",
			thr, foreign, btr_pcur_get_rec(pcur), entry);

		       goto nonstandard_exit_func;
		}
unknown's avatar
unknown committed
910 911 912 913 914 915 916 917 918 919 920 921 922

		if (cascade->update->n_fields == 0) {

			/* The update does not change any columns referred
			to in this foreign key constraint: no need to do
			anything */

			err = DB_SUCCESS;		

			goto nonstandard_exit_func;			
		}
	}
	
unknown's avatar
unknown committed
923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947
	/* Store pcur position and initialize or store the cascade node
	pcur stored position */
	
	btr_pcur_store_position(pcur, mtr);
	
	if (index == clust_index) {
		btr_pcur_copy_stored_position(cascade->pcur, pcur);
	} else {
		btr_pcur_store_position(cascade->pcur, mtr);
	}
		
	mtr_commit(mtr);

	ut_a(cascade->pcur->rel_pos == BTR_PCUR_ON);

	cascade->state = UPD_NODE_UPDATE_CLUSTERED;
	
	err = row_update_cascade_for_mysql(thr, cascade,
						foreign->foreign_table);
	mtr_start(mtr);

	/* Restore pcur position */
	
	btr_pcur_restore_position(BTR_SEARCH_LEAF, pcur, mtr);

unknown's avatar
unknown committed
948 949 950 951
	if (upd_vec_heap) {
	        mem_heap_free(upd_vec_heap);
	}

unknown's avatar
unknown committed
952 953 954 955
	return(err);

nonstandard_exit_func:

unknown's avatar
unknown committed
956 957 958 959
	if (upd_vec_heap) {
	        mem_heap_free(upd_vec_heap);
	}

unknown's avatar
unknown committed
960 961 962 963 964 965 966 967 968 969
	btr_pcur_store_position(pcur, mtr);

	mtr_commit(mtr);
	mtr_start(mtr);

	btr_pcur_restore_position(BTR_SEARCH_LEAF, pcur, mtr);

	return(err);
}

unknown's avatar
unknown committed
970 971
/*************************************************************************
Sets a shared lock on a record. Used in locking possible duplicate key
unknown's avatar
unknown committed
972
records and also in checking foreign key constraints. */
unknown's avatar
unknown committed
973 974 975 976 977
static
ulint
row_ins_set_shared_rec_lock(
/*========================*/
				/* out: DB_SUCCESS or error code */
unknown's avatar
unknown committed
978 979
	ulint		type, 	/* in: LOCK_ORDINARY, LOCK_GAP, or
				LOCK_REC_NOT_GAP type lock */
unknown's avatar
unknown committed
980 981 982 983 984
	rec_t*		rec,	/* in: record */
	dict_index_t*	index,	/* in: index */
	que_thr_t*	thr)	/* in: query thread */	
{
	ulint	err;
985 986

	if (index->type & DICT_CLUSTERED) {
unknown's avatar
unknown committed
987
		err = lock_clust_rec_read_check_and_lock(0, rec, index, LOCK_S,
unknown's avatar
unknown committed
988
								type, thr);
989
	} else {
unknown's avatar
unknown committed
990
		err = lock_sec_rec_read_check_and_lock(0, rec, index, LOCK_S,
unknown's avatar
unknown committed
991
								type, thr);
992 993
	}

unknown's avatar
unknown committed
994 995
	return(err);
}
996
	
997 998 999
/*******************************************************************
Checks if foreign key constraint fails for an index entry. Sets shared locks
which lock either the success or the failure of the constraint. NOTE that
unknown's avatar
unknown committed
1000
the caller must have a shared latch on dict_operation_lock. */
1001 1002 1003 1004

ulint
row_ins_check_foreign_constraint(
/*=============================*/
unknown's avatar
unknown committed
1005
				/* out: DB_SUCCESS,
1006 1007
				DB_NO_REFERENCED_ROW,
				or DB_ROW_IS_REFERENCED */
unknown's avatar
unknown committed
1008
	ibool		check_ref,/* in: TRUE if we want to check that
1009 1010 1011 1012 1013 1014 1015 1016 1017 1018
				the referenced table is ok, FALSE if we
				want to to check the foreign key table */
	dict_foreign_t*	foreign,/* in: foreign constraint; NOTE that the
				tables mentioned in it must be in the
				dictionary cache if they exist at all */
	dict_table_t*	table,	/* in: if check_ref is TRUE, then the foreign
				table, else the referenced table */
	dtuple_t*	entry,	/* in: index entry for index */
	que_thr_t*	thr)	/* in: query thread */
{
unknown's avatar
unknown committed
1019
  	upd_node_t*  	upd_node;
1020 1021 1022
	dict_table_t*	check_table;
	dict_index_t*	check_index;
	ulint		n_fields_cmp;
unknown's avatar
unknown committed
1023
	ibool		unique_search;
1024 1025 1026 1027 1028
	rec_t*		rec;
	btr_pcur_t	pcur;
	ibool		moved;
	int		cmp;
	ulint		err;
unknown's avatar
unknown committed
1029
	ulint		i;
unknown's avatar
unknown committed
1030
	char*		buf		= dict_foreign_err_buf;
1031 1032
	mtr_t		mtr;

unknown's avatar
unknown committed
1033
run_again:
unknown's avatar
unknown committed
1034
	ut_ad(rw_lock_own(&dict_operation_lock, RW_LOCK_SHARED));
unknown's avatar
unknown committed
1035
	
unknown's avatar
unknown committed
1036
	err = DB_SUCCESS;
1037

unknown's avatar
unknown committed
1038 1039 1040 1041 1042 1043 1044
	if (thr_get_trx(thr)->check_foreigns == FALSE) {
		/* The user has suppressed foreign key checks currently for
		this session */

		return(DB_SUCCESS);
	}

unknown's avatar
unknown committed
1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
	/* If any of the foreign key fields in entry is SQL NULL, we
	suppress the foreign key check: this is compatible with Oracle,
	for example */

	for (i = 0; i < foreign->n_fields; i++) {
		if (UNIV_SQL_NULL == dfield_get_len(
                                         dtuple_get_nth_field(entry, i))) {

			return(DB_SUCCESS);
		}
	}

unknown's avatar
unknown committed
1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080
	if (que_node_get_type(thr->run_node) == QUE_NODE_UPDATE) {
	        upd_node = thr->run_node;

	        if (!(upd_node->is_delete) && upd_node->foreign == foreign) {
		        /* If a cascaded update is done as defined by a 
			foreign key constraint, do not check that
			constraint for the child row. In ON UPDATE CASCADE
			the update of the parent row is only half done when
			we come here: if we would check the constraint here
			for the child row it would fail.

			A QUESTION remains: if in the child table there are
			several constraints which refer to the same parent
			table, we should merge all updates to the child as
			one update? And the updates can be contradictory!
			Currently we just perform the update associated
			with each foreign key constraint, one after
			another, and the user has problems predicting in
			which order they are performed. */
		
		        return(DB_SUCCESS);
		}
	}

1081 1082 1083 1084 1085 1086 1087 1088 1089 1090
	if (check_ref) {
		check_table = foreign->referenced_table;
		check_index = foreign->referenced_index;
	} else {
		check_table = foreign->foreign_table;
		check_index = foreign->foreign_index;
	}

	if (check_table == NULL) {
		if (check_ref) {
unknown's avatar
unknown committed
1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
			mutex_enter(&dict_foreign_err_mutex);
			ut_sprintf_timestamp(buf);
			sprintf(buf + strlen(buf), " Transaction:\n");
			trx_print(buf + strlen(buf), thr_get_trx(thr));
			sprintf(buf + strlen(buf),
"Foreign key constraint fails for table %.500s:\n",
				foreign->foreign_table_name);
			dict_print_info_on_foreign_key_in_create_format(
				foreign, buf + strlen(buf));
			sprintf(buf + strlen(buf),
"\nTrying to add to index %.500s tuple:\n", foreign->foreign_index->name);
			dtuple_sprintf(buf + strlen(buf), 1000, entry);
			sprintf(buf + strlen(buf),
"\nBut the parent table %.500s does not currently exist!\n",
				foreign->referenced_table_name);

			ut_a(strlen(buf) < DICT_FOREIGN_ERR_BUF_LEN);
			mutex_exit(&dict_foreign_err_mutex);

1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125
			return(DB_NO_REFERENCED_ROW);
		}

		return(DB_SUCCESS);
	}

	ut_a(check_table && check_index);

	if (check_table != table) {
		/* We already have a LOCK_IX on table, but not necessarily
		on check_table */
		
		err = lock_table(0, check_table, LOCK_IS, thr);

		if (err != DB_SUCCESS) {

unknown's avatar
unknown committed
1126
			goto do_possible_lock_wait;
1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137
		}
	}

	mtr_start(&mtr);

	/* Store old value on n_fields_cmp */

	n_fields_cmp = dtuple_get_n_fields_cmp(entry);

	dtuple_set_n_fields_cmp(entry, foreign->n_fields);

unknown's avatar
unknown committed
1138 1139 1140 1141 1142 1143 1144 1145
	if (dict_index_get_n_unique(check_index) <= foreign->n_fields) {
		/* We can just set a LOCK_REC_NOT_GAP type lock */
	
		unique_search = TRUE;
	} else {
		unique_search = FALSE;
	}

1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157
	btr_pcur_open(check_index, entry, PAGE_CUR_GE,
					BTR_SEARCH_LEAF, &pcur, &mtr);

	/* Scan index records and check if there is a matching record */

	for (;;) {
		rec = btr_pcur_get_rec(&pcur);

		if (rec == page_get_infimum_rec(buf_frame_align(rec))) {

			goto next_rec;
		}
unknown's avatar
unknown committed
1158
		
1159 1160
		if (rec == page_get_supremum_rec(buf_frame_align(rec))) {
		
unknown's avatar
unknown committed
1161 1162 1163 1164 1165 1166 1167
			err = row_ins_set_shared_rec_lock(LOCK_ORDINARY, rec,
							check_index, thr);
			if (err != DB_SUCCESS) {

				break;
			}

1168 1169 1170 1171 1172 1173
			goto next_rec;
		}

		cmp = cmp_dtuple_rec(entry, rec);

		if (cmp == 0) {
unknown's avatar
unknown committed
1174
			if (rec_get_deleted_flag(rec)) {
unknown's avatar
unknown committed
1175 1176
				err = row_ins_set_shared_rec_lock(
							LOCK_ORDINARY,
unknown's avatar
unknown committed
1177 1178 1179 1180 1181 1182
							rec, check_index, thr);
				if (err != DB_SUCCESS) {

					break;
				}
			} else {
1183
				/* Found a matching record */
unknown's avatar
unknown committed
1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
				
				if (unique_search) {
					err = row_ins_set_shared_rec_lock(
							LOCK_REC_NOT_GAP,
							rec, check_index, thr);
				} else {
					err = row_ins_set_shared_rec_lock(
							LOCK_ORDINARY,
							rec, check_index, thr);
				}
				
				if (err != DB_SUCCESS) {

					break;
				}
1199

unknown's avatar
unknown committed
1200 1201 1202 1203 1204
/*				printf(
"FOREIGN: Found matching record from %s %s\n",
		check_index->table_name, check_index->name);
				rec_print(rec);
*/
1205 1206
				if (check_ref) {			
					err = DB_SUCCESS;
unknown's avatar
unknown committed
1207 1208 1209

					break;
				} else if (foreign->type != 0) {
unknown's avatar
unknown committed
1210 1211 1212 1213
					/* There is an ON UPDATE or ON DELETE
					condition: check them in a separate
					function */

unknown's avatar
unknown committed
1214
					err =
unknown's avatar
unknown committed
1215
					  row_ins_foreign_check_on_constraint(
unknown's avatar
unknown committed
1216 1217
						thr, foreign, &pcur, entry,
									&mtr);
unknown's avatar
unknown committed
1218 1219 1220 1221
					if (err != DB_SUCCESS) {

						break;
					}
1222
				} else {
unknown's avatar
unknown committed
1223 1224 1225 1226
					row_ins_foreign_report_err(
					(char*)"Trying to delete or update",
						thr, foreign, rec, entry);

1227
					err = DB_ROW_IS_REFERENCED;
unknown's avatar
unknown committed
1228
					break;
1229 1230 1231 1232 1233
				}
			}
		}

		if (cmp < 0) {
unknown's avatar
unknown committed
1234 1235 1236 1237 1238 1239 1240
			err = row_ins_set_shared_rec_lock(LOCK_GAP,
						rec, check_index, thr);
			if (err != DB_SUCCESS) {

				break;
			}

1241 1242
			if (check_ref) {			
				err = DB_NO_REFERENCED_ROW;
unknown's avatar
unknown committed
1243 1244
				row_ins_foreign_report_add_err(
						thr, foreign, rec, entry);
1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257
			} else {
				err = DB_SUCCESS;
			}

			break;
		}

		ut_a(cmp == 0);
next_rec:
		moved = btr_pcur_move_to_next(&pcur, &mtr);

		if (!moved) {
			if (check_ref) {			
unknown's avatar
unknown committed
1258 1259 1260
				rec = btr_pcur_get_rec(&pcur);
				row_ins_foreign_report_add_err(
						thr, foreign, rec, entry);
1261 1262 1263 1264 1265 1266 1267 1268 1269
				err = DB_NO_REFERENCED_ROW;
			} else {
				err = DB_SUCCESS;
			}

			break;
		}
	}

unknown's avatar
unknown committed
1270 1271
	btr_pcur_close(&pcur);

1272 1273 1274 1275 1276
	mtr_commit(&mtr);

	/* Restore old value */
	dtuple_set_n_fields_cmp(entry, n_fields_cmp);

unknown's avatar
unknown committed
1277 1278 1279 1280 1281
do_possible_lock_wait:
	if (err == DB_LOCK_WAIT) {
		thr_get_trx(thr)->error_state = err;

		que_thr_stop_for_mysql(thr);
unknown's avatar
unknown committed
1282

unknown's avatar
unknown committed
1283
		srv_suspend_mysql_thread(thr);
unknown's avatar
unknown committed
1284
	
unknown's avatar
unknown committed
1285
		if (thr_get_trx(thr)->error_state == DB_SUCCESS) {
unknown's avatar
unknown committed
1286 1287 1288

		        goto run_again;
		}
unknown's avatar
unknown committed
1289

unknown's avatar
unknown committed
1290
		err = thr_get_trx(thr)->error_state;
unknown's avatar
unknown committed
1291 1292
	}

1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305
	return(err);
}

/*******************************************************************
Checks if foreign key constraints fail for an index entry. If index
is not mentioned in any constraint, this function does nothing,
Otherwise does searches to the indexes of referenced tables and
sets shared locks which lock either the success or the failure of
a constraint. */
static
ulint
row_ins_check_foreign_constraints(
/*==============================*/
unknown's avatar
unknown committed
1306
				/* out: DB_SUCCESS or error code */
1307 1308 1309 1310 1311 1312 1313
	dict_table_t*	table,	/* in: table */
	dict_index_t*	index,	/* in: index */
	dtuple_t*	entry,	/* in: index entry for index */
	que_thr_t*	thr)	/* in: query thread */
{
	dict_foreign_t*	foreign;
	ulint		err;
unknown's avatar
unknown committed
1314 1315 1316 1317
	trx_t*		trx;
	ibool		got_s_lock	= FALSE;

	trx = thr_get_trx(thr);
1318 1319 1320 1321 1322 1323 1324 1325

	foreign = UT_LIST_GET_FIRST(table->foreign_list);

	while (foreign) {
		if (foreign->foreign_index == index) {

			if (foreign->referenced_table == NULL) {
				dict_table_get(foreign->referenced_table_name,
unknown's avatar
unknown committed
1326
									trx);
1327 1328
			}

unknown's avatar
unknown committed
1329
			if (0 == trx->dict_operation_lock_mode) {
unknown's avatar
unknown committed
1330 1331
				got_s_lock = TRUE;

unknown's avatar
unknown committed
1332
				row_mysql_freeze_data_dictionary(trx);
unknown's avatar
unknown committed
1333
			}
1334 1335

			err = row_ins_check_foreign_constraint(TRUE, foreign,
unknown's avatar
unknown committed
1336
						table, entry, thr);
unknown's avatar
unknown committed
1337
			if (got_s_lock) {
unknown's avatar
unknown committed
1338
				row_mysql_unfreeze_data_dictionary(trx);
unknown's avatar
unknown committed
1339 1340
			}
				
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351
			if (err != DB_SUCCESS) {
				return(err);
			}
		}

		foreign = UT_LIST_GET_NEXT(foreign_list, foreign);
	}

	return(DB_SUCCESS);
}

unknown's avatar
unknown committed
1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
/*******************************************************************
Checks if a unique key violation to rec would occur at the index entry
insert. */
static
ibool
row_ins_dupl_error_with_rec(
/*========================*/
				/* out: TRUE if error */
	rec_t*		rec,	/* in: user record; NOTE that we assume
				that the caller already has a record lock on
				the record! */
	dtuple_t*	entry,	/* in: entry to insert */
	dict_index_t*	index)	/* in: index */
{
	ulint	matched_fields;
	ulint	matched_bytes;
	ulint	n_unique;
	ulint   i;
	
	n_unique = dict_index_get_n_unique(index);

	matched_fields = 0;
	matched_bytes = 0;

	cmp_dtuple_rec_with_match(entry, rec, &matched_fields, &matched_bytes);

	if (matched_fields < n_unique) {

	        return(FALSE);
	}

	/* In a unique secondary index we allow equal key values if they
	contain SQL NULLs */

	if (!(index->type & DICT_CLUSTERED)) {

	        for (i = 0; i < n_unique; i++) {
	                if (UNIV_SQL_NULL == dfield_get_len(
                                         dtuple_get_nth_field(entry, i))) {

	                        return(FALSE);
	                }
	        }
	}

	if (!rec_get_deleted_flag(rec)) {

	        return(TRUE);
	}

	return(FALSE);
}	

1405 1406
/*******************************************************************
Scans a unique non-clustered index at a given index entry to determine
unknown's avatar
unknown committed
1407 1408
whether a uniqueness violation has occurred for the key value of the entry.
Set shared locks on possible duplicate records. */
1409 1410 1411 1412
static
ulint
row_ins_scan_sec_index_for_duplicate(
/*=================================*/
unknown's avatar
unknown committed
1413 1414
				/* out: DB_SUCCESS, DB_DUPLICATE_KEY, or
				DB_LOCK_WAIT */
1415 1416
	dict_index_t*	index,	/* in: non-clustered unique index */
	dtuple_t*	entry,	/* in: index entry */
unknown's avatar
unknown committed
1417
	que_thr_t*	thr)	/* in: query thread */
1418
{
unknown's avatar
unknown committed
1419 1420
	ulint		n_unique;
	ulint		i;
1421 1422 1423 1424
	int		cmp;
	ulint		n_fields_cmp;
	rec_t*		rec;
	btr_pcur_t	pcur;
unknown's avatar
unknown committed
1425 1426
	ulint		err		= DB_SUCCESS;
	ibool		moved;
1427 1428
	mtr_t		mtr;

unknown's avatar
unknown committed
1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442
	n_unique = dict_index_get_n_unique(index);

	/* If the secondary index is unique, but one of the fields in the
	n_unique first fields is NULL, a unique key violation cannot occur,
	since we define NULL != NULL in this case */

	for (i = 0; i < n_unique; i++) {
		if (UNIV_SQL_NULL == dfield_get_len(
                                         dtuple_get_nth_field(entry, i))) {

			return(DB_SUCCESS);
		}
	}

1443 1444 1445 1446 1447 1448 1449 1450
	mtr_start(&mtr);

	/* Store old value on n_fields_cmp */

	n_fields_cmp = dtuple_get_n_fields_cmp(entry);

	dtuple_set_n_fields_cmp(entry, dict_index_get_n_unique(index));
	
unknown's avatar
unknown committed
1451
	btr_pcur_open(index, entry, PAGE_CUR_GE, BTR_SEARCH_LEAF, &pcur, &mtr);
1452

unknown's avatar
unknown committed
1453
	/* Scan index records and check if there is a duplicate */
1454 1455

	for (;;) {
unknown's avatar
unknown committed
1456 1457 1458 1459 1460 1461 1462
		rec = btr_pcur_get_rec(&pcur);

		if (rec == page_get_infimum_rec(buf_frame_align(rec))) {

			goto next_rec;
		}
				
unknown's avatar
unknown committed
1463
		/* Try to place a lock on the index record */
unknown's avatar
unknown committed
1464

unknown's avatar
unknown committed
1465 1466
		err = row_ins_set_shared_rec_lock(LOCK_ORDINARY, rec, index,
									thr);
unknown's avatar
unknown committed
1467 1468

		if (err != DB_SUCCESS) {
1469 1470 1471 1472

			break;
		}

unknown's avatar
unknown committed
1473 1474 1475 1476
		if (rec == page_get_supremum_rec(buf_frame_align(rec))) {
		
			goto next_rec;
		}
1477 1478 1479 1480

		cmp = cmp_dtuple_rec(entry, rec);

		if (cmp == 0) {
unknown's avatar
unknown committed
1481 1482 1483
			if (row_ins_dupl_error_with_rec(rec, entry, index)) {
				err = DB_DUPLICATE_KEY;

1484
				thr_get_trx(thr)->error_info = index;
unknown's avatar
unknown committed
1485 1486

				break;
1487 1488 1489 1490 1491 1492 1493 1494
			}
		}

		if (cmp < 0) {
			break;
		}

		ut_a(cmp == 0);
unknown's avatar
unknown committed
1495 1496
next_rec:
		moved = btr_pcur_move_to_next(&pcur, &mtr);
1497

unknown's avatar
unknown committed
1498 1499 1500
		if (!moved) {
			break;
		}
1501 1502 1503 1504 1505 1506 1507
	}

	mtr_commit(&mtr);

	/* Restore old value */
	dtuple_set_n_fields_cmp(entry, n_fields_cmp);

unknown's avatar
unknown committed
1508
	return(err);
1509 1510 1511
}

/*******************************************************************
unknown's avatar
unknown committed
1512 1513 1514
Checks if a unique key violation error would occur at an index entry
insert. Sets shared locks on possible duplicate records. Works only
for a clustered index! */
1515 1516
static
ulint
unknown's avatar
unknown committed
1517 1518 1519 1520 1521 1522
row_ins_duplicate_error_in_clust(
/*=============================*/
				/* out: DB_SUCCESS if no error,
				DB_DUPLICATE_KEY if error, DB_LOCK_WAIT if we
				have to wait for a lock on a possible
				duplicate record */
1523 1524
	btr_cur_t*	cursor,	/* in: B-tree cursor */
	dtuple_t*	entry,	/* in: entry to insert */
unknown's avatar
unknown committed
1525 1526
	que_thr_t*	thr,	/* in: query thread */
	mtr_t*		mtr)	/* in: mtr */
1527
{
unknown's avatar
unknown committed
1528
	ulint	err;
1529 1530 1531
	rec_t*	rec;
	page_t*	page;
	ulint	n_unique;
unknown's avatar
unknown committed
1532
	trx_t*	trx	= thr_get_trx(thr);
1533

1534 1535
	UT_NOT_USED(mtr);
	
unknown's avatar
unknown committed
1536
	ut_a(cursor->index->type & DICT_CLUSTERED);
1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560
	ut_ad(cursor->index->type & DICT_UNIQUE);

	/* NOTE: For unique non-clustered indexes there may be any number
	of delete marked records with the same value for the non-clustered
	index key (remember multiversioning), and which differ only in
	the row refererence part of the index record, containing the
	clustered index key fields. For such a secondary index record,
	to avoid race condition, we must FIRST do the insertion and after
	that check that the uniqueness condition is not breached! */
	
	/* NOTE: A problem is that in the B-tree node pointers on an
	upper level may match more to the entry than the actual existing
	user records on the leaf level. So, even if low_match would suggest
	that a duplicate key violation may occur, this may not be the case. */

	n_unique = dict_index_get_n_unique(cursor->index);
	
	if (cursor->low_match >= n_unique) {
		
		rec = btr_cur_get_rec(cursor);
		page = buf_frame_align(rec);

		if (rec != page_get_infimum_rec(page)) {

unknown's avatar
unknown committed
1561 1562 1563 1564 1565
			/* We set a lock on the possible duplicate: this
			is needed in logical logging of MySQL to make
			sure that in roll-forward we get the same duplicate
			errors as in original execution */
		
unknown's avatar
unknown committed
1566 1567
			err = row_ins_set_shared_rec_lock(LOCK_REC_NOT_GAP,
						rec, cursor->index, thr);
unknown's avatar
unknown committed
1568 1569 1570 1571 1572
			if (err != DB_SUCCESS) {
					
				return(err);
			}

1573
			if (row_ins_dupl_error_with_rec(rec, entry,
unknown's avatar
unknown committed
1574
							cursor->index)) {
1575
				trx->error_info = cursor->index;
1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587
				return(DB_DUPLICATE_KEY);
			}
		}
	}

	if (cursor->up_match >= n_unique) {

		rec = page_rec_get_next(btr_cur_get_rec(cursor));
		page = buf_frame_align(rec);

		if (rec != page_get_supremum_rec(page)) {

unknown's avatar
unknown committed
1588 1589
			err = row_ins_set_shared_rec_lock(LOCK_REC_NOT_GAP,
						rec, cursor->index, thr);
unknown's avatar
unknown committed
1590 1591 1592 1593 1594
			if (err != DB_SUCCESS) {
					
				return(err);
			}

1595
			if (row_ins_dupl_error_with_rec(rec, entry,
unknown's avatar
unknown committed
1596
							cursor->index)) {
1597
				trx->error_info = cursor->index;
1598 1599 1600 1601 1602 1603 1604 1605
				return(DB_DUPLICATE_KEY);
			}
		}

		ut_a(!(cursor->index->type & DICT_CLUSTERED));
						/* This should never happen */
	}

unknown's avatar
unknown committed
1606
	return(DB_SUCCESS);
1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672
}

/*******************************************************************
Checks if an index entry has long enough common prefix with an existing
record so that the intended insert of the entry must be changed to a modify of
the existing record. In the case of a clustered index, the prefix must be
n_unique fields long, and in the case of a secondary index, all fields must be
equal. */
UNIV_INLINE
ulint
row_ins_must_modify(
/*================*/
				/* out: 0 if no update, ROW_INS_PREV if
				previous should be updated; currently we
				do the search so that only the low_match
				record can match enough to the search tuple,
				not the next record */
	btr_cur_t*	cursor)	/* in: B-tree cursor */
{
	ulint	enough_match;
	rec_t*	rec;
	page_t*	page;
	
	/* NOTE: (compare to the note in row_ins_duplicate_error) Because node
	pointers on upper levels of the B-tree may match more to entry than
	to actual user records on the leaf level, we have to check if the
	candidate record is actually a user record. In a clustered index
	node pointers contain index->n_unique first fields, and in the case
	of a secondary index, all fields of the index. */

	enough_match = dict_index_get_n_unique_in_tree(cursor->index);
	
	if (cursor->low_match >= enough_match) {

		rec = btr_cur_get_rec(cursor);
		page = buf_frame_align(rec);

		if (rec != page_get_infimum_rec(page)) {

			return(ROW_INS_PREV);
		}
	}

	return(0);
}

/*******************************************************************
Tries to insert an index entry to an index. If the index is clustered
and a record with the same unique key is found, the other record is
necessarily marked deleted by a committed transaction, or a unique key
violation error occurs. The delete marked record is then updated to an
existing record, and we must write an undo log record on the delete
marked record. If the index is secondary, and a record with exactly the
same fields is found, the other record is necessarily marked deleted.
It is then unmarked. Otherwise, the entry is just inserted to the index. */

ulint
row_ins_index_entry_low(
/*====================*/
				/* out: DB_SUCCESS, DB_LOCK_WAIT, DB_FAIL
				if pessimistic retry needed, or error code */
	ulint		mode,	/* in: BTR_MODIFY_LEAF or BTR_MODIFY_TREE,
				depending on whether we wish optimistic or
				pessimistic descent down the index tree */
	dict_index_t*	index,	/* in: index */
	dtuple_t*	entry,	/* in: index entry to insert */
1673 1674 1675
	ulint*		ext_vec,/* in: array containing field numbers of
				externally stored fields in entry, or NULL */
	ulint		n_ext_vec,/* in: number of fields in ext_vec */
1676 1677
	que_thr_t*	thr)	/* in: query thread */
{
unknown's avatar
unknown committed
1678 1679
	btr_cur_t	cursor;
	ulint		ignore_sec_unique	= 0;
unknown's avatar
unknown committed
1680
	ulint		modify = 0; /* remove warning */
1681
	rec_t*		insert_rec;
1682 1683 1684
	rec_t*		rec;
	ulint		err;
	ulint		n_unique;
unknown's avatar
unknown committed
1685
	big_rec_t*	big_rec			= NULL;
1686 1687 1688
	mtr_t		mtr;
	
	log_free_check();
unknown's avatar
unknown committed
1689

1690 1691 1692 1693 1694 1695 1696 1697
	mtr_start(&mtr);

	cursor.thr = thr;

	/* Note that we use PAGE_CUR_LE as the search mode, because then
	the function will return in both low_match and up_match of the
	cursor sensible values */
	
unknown's avatar
unknown committed
1698 1699 1700 1701
	if (!(thr_get_trx(thr)->check_unique_secondary)) {
		ignore_sec_unique = BTR_IGNORE_SEC_UNIQUE;
	}

1702
	btr_cur_search_to_nth_level(index, 0, entry, PAGE_CUR_LE,
unknown's avatar
unknown committed
1703 1704
				mode | BTR_INSERT | ignore_sec_unique,
				&cursor, 0, &mtr);
1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719

	if (cursor.flag == BTR_CUR_INSERT_TO_IBUF) {
		/* The insertion was made to the insert buffer already during
		the search: we are done */

		err = DB_SUCCESS;

		goto function_exit;
	}	
					
	n_unique = dict_index_get_n_unique(index);

	if (index->type & DICT_UNIQUE && (cursor.up_match >= n_unique
					 || cursor.low_match >= n_unique)) {

unknown's avatar
unknown committed
1720 1721 1722
		if (index->type & DICT_CLUSTERED) {			 
			/* Note that the following may return also
			DB_LOCK_WAIT */
1723

unknown's avatar
unknown committed
1724 1725 1726
			err = row_ins_duplicate_error_in_clust(&cursor,
							entry, thr, &mtr);
			if (err != DB_SUCCESS) {
1727

unknown's avatar
unknown committed
1728 1729 1730 1731 1732 1733 1734
				goto function_exit;
			}
		} else {
			mtr_commit(&mtr);
			err = row_ins_scan_sec_index_for_duplicate(index,
								entry, thr);
			mtr_start(&mtr);
1735

unknown's avatar
unknown committed
1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750
			if (err != DB_SUCCESS) {

				goto function_exit;
			}

			/* We did not find a duplicate and we have now
			locked with s-locks the necessary records to
			prevent any insertion of a duplicate by another
			transaction. Let us now reposition the cursor and
			continue the insertion. */
			
			btr_cur_search_to_nth_level(index, 0, entry,
					PAGE_CUR_LE, mode | BTR_INSERT,
					&cursor, 0, &mtr);
		}		
1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767
	}

	modify = row_ins_must_modify(&cursor);

	if (modify != 0) {
		/* There is already an index entry with a long enough common
		prefix, we must convert the insert into a modify of an
		existing record */

		if (modify == ROW_INS_NEXT) {
			rec = page_rec_get_next(btr_cur_get_rec(&cursor));

			btr_cur_position(index, rec, &cursor);
		}

		if (index->type & DICT_CLUSTERED) {
			err = row_ins_clust_index_entry_by_modify(mode,
1768 1769 1770 1771
							&cursor, &big_rec,
							entry,
							ext_vec, n_ext_vec,
							thr, &mtr);
1772
		} else {
unknown's avatar
unknown committed
1773 1774
			err = row_ins_sec_index_entry_by_modify(mode, &cursor,
								entry,
1775 1776 1777 1778
								thr, &mtr);
		}
		
	} else {
1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793
		if (mode == BTR_MODIFY_LEAF) {
			err = btr_cur_optimistic_insert(0, &cursor, entry,
					&insert_rec, &big_rec, thr, &mtr);
		} else {
			ut_a(mode == BTR_MODIFY_TREE);
			err = btr_cur_pessimistic_insert(0, &cursor, entry,
					&insert_rec, &big_rec, thr, &mtr);
		}

		if (err == DB_SUCCESS) {
			if (ext_vec) {
				rec_set_field_extern_bits(insert_rec,
						ext_vec, n_ext_vec, &mtr);
			}
		}
1794
	}
1795

1796 1797 1798
function_exit:
	mtr_commit(&mtr);

1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816
	if (big_rec) {
		mtr_start(&mtr);
	
		btr_cur_search_to_nth_level(index, 0, entry, PAGE_CUR_LE,
					BTR_MODIFY_TREE, &cursor, 0, &mtr);

		err = btr_store_big_rec_extern_fields(index,
						btr_cur_get_rec(&cursor), 
						big_rec, &mtr);
		if (modify) {
			dtuple_big_rec_free(big_rec);
		} else {
			dtuple_convert_back_big_rec(index, entry, big_rec);
		}

		mtr_commit(&mtr);
	}

1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832
	return(err);
}

/*******************************************************************
Inserts an index entry to index. Tries first optimistic, then pessimistic
descent down the tree. If the entry matches enough to a delete marked record,
performs the insert by updating or delete unmarking the delete marked
record. */

ulint
row_ins_index_entry(
/*================*/
				/* out: DB_SUCCESS, DB_LOCK_WAIT,
				DB_DUPLICATE_KEY, or some other error code */
	dict_index_t*	index,	/* in: index */
	dtuple_t*	entry,	/* in: index entry to insert */
1833 1834 1835
	ulint*		ext_vec,/* in: array containing field numbers of
				externally stored fields in entry, or NULL */
	ulint		n_ext_vec,/* in: number of fields in ext_vec */
1836 1837 1838 1839
	que_thr_t*	thr)	/* in: query thread */
{
	ulint	err;

1840 1841 1842 1843 1844 1845 1846 1847 1848
	if (UT_LIST_GET_FIRST(index->table->foreign_list)) {
		err = row_ins_check_foreign_constraints(index->table, index,
								entry, thr);
		if (err != DB_SUCCESS) {

			return(err);
		}
	}

1849 1850
	/* Try first optimistic descent to the B-tree */

1851
	err = row_ins_index_entry_low(BTR_MODIFY_LEAF, index, entry,
unknown's avatar
unknown committed
1852
						ext_vec, n_ext_vec, thr);
1853 1854 1855 1856 1857 1858 1859
	if (err != DB_FAIL) {

		return(err);
	}

	/* Try then pessimistic descent to the B-tree */

1860 1861
	err = row_ins_index_entry_low(BTR_MODIFY_TREE, index, entry,
						ext_vec, n_ext_vec, thr);
1862 1863 1864 1865 1866 1867
	return(err);
}

/***************************************************************
Sets the values of the dtuple fields in entry from the values of appropriate
columns in row. */
unknown's avatar
unknown committed
1868
static
1869 1870 1871
void
row_ins_index_entry_set_vals(
/*=========================*/
unknown's avatar
unknown committed
1872
	dict_index_t*	index,	/* in: index */
1873 1874 1875
	dtuple_t*	entry,	/* in: index entry to make */
	dtuple_t*	row)	/* in: row */
{
unknown's avatar
unknown committed
1876
	dict_field_t*	ind_field;
1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887
	dfield_t*	field;
	dfield_t*	row_field;
	ulint		n_fields;
	ulint		i;

	ut_ad(entry && row);

	n_fields = dtuple_get_n_fields(entry);

	for (i = 0; i < n_fields; i++) {
		field = dtuple_get_nth_field(entry, i);
unknown's avatar
unknown committed
1888 1889 1890
		ind_field = dict_index_get_nth_field(index, i);

		row_field = dtuple_get_nth_field(row, ind_field->col->ind);
1891

unknown's avatar
unknown committed
1892 1893 1894 1895 1896 1897 1898 1899 1900
		/* Check column prefix indexes */
		if (ind_field->prefix_len > 0
		    && dfield_get_len(row_field) != UNIV_SQL_NULL
		    && dfield_get_len(row_field) > ind_field->prefix_len) {
		    
		        field->len = ind_field->prefix_len;
		} else {
		        field->len = row_field->len;
		}
1901 1902 1903 1904 1905 1906 1907

		field->data = row_field->data;
	}
}

/***************************************************************
Inserts a single index entry to the table. */
1908
static
1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920
ulint
row_ins_index_entry_step(
/*=====================*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	ins_node_t*	node,	/* in: row insert node */
	que_thr_t*	thr)	/* in: query thread */
{
	ulint	err;

	ut_ad(dtuple_check_typed(node->row));
	
unknown's avatar
unknown committed
1921
	row_ins_index_entry_set_vals(node->index, node->entry, node->row);
1922 1923 1924
	
	ut_ad(dtuple_check_typed(node->entry));

1925
	err = row_ins_index_entry(node->index, node->entry, NULL, 0, thr);
1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094

	return(err);
}

/***************************************************************
Allocates a row id for row and inits the node->index field. */
UNIV_INLINE
void
row_ins_alloc_row_id_step(
/*======================*/
	ins_node_t*	node)	/* in: row insert node */
{
	dulint	row_id;
	
	ut_ad(node->state == INS_NODE_ALLOC_ROW_ID);
	
	if (dict_table_get_first_index(node->table)->type & DICT_UNIQUE) {

		/* No row id is stored if the clustered index is unique */

		return;
	}
	
	/* Fill in row id value to row */

	row_id = dict_sys_get_new_row_id();

	dict_sys_write_row_id(node->row_id_buf, row_id);
}

/***************************************************************
Gets a row to insert from the values list. */
UNIV_INLINE
void
row_ins_get_row_from_values(
/*========================*/
	ins_node_t*	node)	/* in: row insert node */
{
	que_node_t*	list_node;
	dfield_t*	dfield;
	dtuple_t*	row;
	ulint		i;
	
	/* The field values are copied in the buffers of the select node and
	it is safe to use them until we fetch from select again: therefore
	we can just copy the pointers */

	row = node->row; 

	i = 0;
	list_node = node->values_list;

	while (list_node) {
		eval_exp(list_node);

		dfield = dtuple_get_nth_field(row, i);
		dfield_copy_data(dfield, que_node_get_val(list_node));

		i++;
		list_node = que_node_get_next(list_node);
	}
}

/***************************************************************
Gets a row to insert from the select list. */
UNIV_INLINE
void
row_ins_get_row_from_select(
/*========================*/
	ins_node_t*	node)	/* in: row insert node */
{
	que_node_t*	list_node;
	dfield_t*	dfield;
	dtuple_t*	row;
	ulint		i;

	/* The field values are copied in the buffers of the select node and
	it is safe to use them until we fetch from select again: therefore
	we can just copy the pointers */

	row = node->row; 

	i = 0;
	list_node = node->select->select_list;

	while (list_node) {
		dfield = dtuple_get_nth_field(row, i);
		dfield_copy_data(dfield, que_node_get_val(list_node));

		i++;
		list_node = que_node_get_next(list_node);
	}
}
	
/***************************************************************
Inserts a row to a table. */

ulint
row_ins(
/*====*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	ins_node_t*	node,	/* in: row insert node */
	que_thr_t*	thr)	/* in: query thread */
{
	ulint	err;
	
	ut_ad(node && thr);

	if (node->state == INS_NODE_ALLOC_ROW_ID) {

		row_ins_alloc_row_id_step(node);
	
		node->index = dict_table_get_first_index(node->table);
		node->entry = UT_LIST_GET_FIRST(node->entry_list);

		if (node->ins_type == INS_SEARCHED) {

			row_ins_get_row_from_select(node);

		} else if (node->ins_type == INS_VALUES) {

			row_ins_get_row_from_values(node);
		}

		node->state = INS_NODE_INSERT_ENTRIES;
	}

	ut_ad(node->state == INS_NODE_INSERT_ENTRIES);

	while (node->index != NULL) {
		err = row_ins_index_entry_step(node, thr);
		
		if (err != DB_SUCCESS) {

			return(err);
		}

		node->index = dict_table_get_next_index(node->index);
		node->entry = UT_LIST_GET_NEXT(tuple_list, node->entry);
	}

	ut_ad(node->entry == NULL);
	
	node->state = INS_NODE_ALLOC_ROW_ID;
	
	return(DB_SUCCESS);
}

/***************************************************************
Inserts a row to a table. This is a high-level function used in SQL execution
graphs. */

que_thr_t*
row_ins_step(
/*=========*/
				/* out: query thread to run next or NULL */
	que_thr_t*	thr)	/* in: query thread */
{
	ins_node_t*	node;
	que_node_t*	parent;
	sel_node_t*	sel_node;
	trx_t*		trx;
	ulint		err;

	ut_ad(thr);
	
	trx = thr_get_trx(thr);

unknown's avatar
Merge  
unknown committed
2095 2096
	trx_start_if_not_started(trx);
	
2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189
	node = thr->run_node;

	ut_ad(que_node_get_type(node) == QUE_NODE_INSERT);

	parent = que_node_get_parent(node);
	sel_node = node->select;

	if (thr->prev_node == parent) {
		node->state = INS_NODE_SET_IX_LOCK;
	}

	/* If this is the first time this node is executed (or when
	execution resumes after wait for the table IX lock), set an
	IX lock on the table and reset the possible select node. */

	if (node->state == INS_NODE_SET_IX_LOCK) {

		/* It may be that the current session has not yet started
		its transaction, or it has been committed: */
		
		if (UT_DULINT_EQ(trx->id, node->trx_id)) {
			/* No need to do IX-locking or write trx id to buf */

			goto same_trx;
		}	

		trx_write_trx_id(node->trx_id_buf, trx->id);

		err = lock_table(0, node->table, LOCK_IX, thr);

		if (err != DB_SUCCESS) {

			goto error_handling;
		}

		node->trx_id = trx->id;
	same_trx:				
		node->state = INS_NODE_ALLOC_ROW_ID;

		if (node->ins_type == INS_SEARCHED) {
			/* Reset the cursor */
			sel_node->state = SEL_NODE_OPEN;
 		
			/* Fetch a row to insert */
		
			thr->run_node = sel_node;
	
			return(thr);
		}
	}

	if ((node->ins_type == INS_SEARCHED)
				&& (sel_node->state != SEL_NODE_FETCH)) {

		ut_ad(sel_node->state == SEL_NODE_NO_MORE_ROWS);

		/* No more rows to insert */
		thr->run_node = parent;
	
		return(thr);
	}

	/* DO THE CHECKS OF THE CONSISTENCY CONSTRAINTS HERE */

	err = row_ins(node, thr);

error_handling:
	trx->error_state = err;

	if (err == DB_SUCCESS) {
		/* Ok: do nothing */

	} else if (err == DB_LOCK_WAIT) {

		return(NULL);
	} else {
		/* SQL error detected */

		return(NULL);
	}

	/* DO THE TRIGGER ACTIONS HERE */

	if (node->ins_type == INS_SEARCHED) {
		/* Fetch a row to insert */
		
		thr->run_node = sel_node;
	} else {
		thr->run_node = que_node_get_parent(node);
	}

	return(thr);
}