row0upd.c 47.7 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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
/******************************************************
Update of a row

(c) 1996 Innobase Oy

Created 12/27/1996 Heikki Tuuri
*******************************************************/

#include "row0upd.h"

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

#include "dict0dict.h"
#include "dict0boot.h"
#include "dict0crea.h"
#include "mach0data.h"
#include "trx0undo.h"
#include "btr0btr.h"
#include "btr0cur.h"
#include "que0que.h"
#include "row0ins.h"
#include "row0sel.h"
#include "row0row.h"
#include "rem0cmp.h"
#include "lock0lock.h"
#include "log0log.h"
#include "pars0sym.h"
#include "eval0eval.h"


/* What kind of latch and lock can we assume when the control comes to
   -------------------------------------------------------------------
an update node?
--------------
Efficiency of massive updates would require keeping an x-latch on a
clustered index page through many updates, and not setting an explicit
x-lock on clustered index records, as they anyway will get an implicit
x-lock when they are updated. A problem is that the read nodes in the
graph should know that they must keep the latch when passing the control
up to the update node, and not set any record lock on the record which
will be updated. Another problem occurs if the execution is stopped,
as the kernel switches to another query thread, or the transaction must
wait for a lock. Then we should be able to release the latch and, maybe,
acquire an explicit x-lock on the record.
	Because this seems too complicated, we conclude that the less
efficient solution of releasing all the latches when the control is
transferred to another node, and acquiring explicit x-locks, is better. */

/* How is a delete performed? If there is a delete without an
explicit cursor, i.e., a searched delete, there are at least
two different situations:
the implicit select cursor may run on (1) the clustered index or
on (2) a secondary index. The delete is performed by setting
the delete bit in the record and substituting the id of the
deleting transaction for the original trx id, and substituting a
new roll ptr for previous roll ptr. The old trx id and roll ptr
are saved in the undo log record. Thus, no physical changes occur
in the index tree structure at the time of the delete. Only
when the undo log is purged, the index records will be physically
deleted from the index trees.

The query graph executing a searched delete would consist of
a delete node which has as a subtree a select subgraph.
The select subgraph should return a (persistent) cursor
in the clustered index, placed on page which is x-latched.
The delete node should look for all secondary index records for
this clustered index entry and mark them as deleted. When is
the x-latch freed? The most efficient way for performing a
searched delete is obviously to keep the x-latch for several
steps of query graph execution. */

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
74
/***************************************************************
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
75 76 77
Checks if an update vector changes some of the first ordering fields of an
index record. This is only used in foreign key checks and we can assume
that index does not contain column prefixes. */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
78 79
static
ibool
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
80 81
row_upd_changes_first_fields_binary(
/*================================*/
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
82 83 84 85 86 87 88
				/* out: TRUE if changes */
	dtuple_t*	entry,	/* in: old value of index entry */
	dict_index_t*	index,	/* in: index of entry */
	upd_t*		update,	/* in: update vector for the row */
	ulint		n);	/* in: how many first fields to check */


89 90
/*************************************************************************
Checks if index currently is mentioned as a referenced index in a foreign
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
91
key constraint. */
92 93 94 95 96
static
ibool
row_upd_index_is_referenced(
/*========================*/
				/* out: TRUE if referenced; NOTE that since
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
97
				we do not hold dict_operation_lock
98 99 100 101
				when leaving the function, it may be that
				the referencing table has been dropped when
				we leave this function: this function is only
				for heuristic use! */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
102 103
	dict_index_t*	index,	/* in: index */
	trx_t*		trx)	/* in: transaction */
104
{
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
105
	dict_table_t*	table		= index->table;
106
	dict_foreign_t*	foreign;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
107
	ibool		froze_data_dict	= FALSE;
108 109 110 111 112 113

	if (!UT_LIST_GET_FIRST(table->referenced_list)) {

		return(FALSE);
	}

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
114 115 116
	if (trx->dict_operation_lock_mode == 0) {
		row_mysql_freeze_data_dictionary(trx);
		froze_data_dict = TRUE;
117 118 119 120 121 122 123
	}

	foreign = UT_LIST_GET_FIRST(table->referenced_list);

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

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
124 125
			if (froze_data_dict) {
				row_mysql_unfreeze_data_dictionary(trx);
126 127 128 129 130 131 132 133
			}

			return(TRUE);
		}

		foreign = UT_LIST_GET_NEXT(referenced_list, foreign);
	}
	
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
134 135
	if (froze_data_dict) {
		row_mysql_unfreeze_data_dictionary(trx);
136 137 138 139 140 141 142
	}

	return(FALSE);
}

/*************************************************************************
Checks if possible foreign key constraints hold after a delete of the record
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
143
under pcur. NOTE that this function will temporarily commit mtr and lose the
144 145 146 147 148
pcur position! */
static
ulint
row_upd_check_references_constraints(
/*=================================*/
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
149
				/* out: DB_SUCCESS or an error code */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
150
	upd_node_t*	node,	/* in: row update node */
151 152 153 154 155 156 157 158 159 160
	btr_pcur_t*	pcur,	/* in: cursor positioned on a record; NOTE: the
				cursor position is lost in this function! */
	dict_table_t*	table,	/* in: table in question */
	dict_index_t*	index,	/* in: index of the cursor */
	que_thr_t*	thr,	/* in: query thread */
	mtr_t*		mtr)	/* in: mtr */
{
	dict_foreign_t*	foreign;
	mem_heap_t*	heap;
	dtuple_t*	entry;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
161
	trx_t*		trx;
162 163
	rec_t*		rec;
	ulint		err;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
164 165 166 167 168 169 170 171
	ibool		got_s_lock	= FALSE;

	if (UT_LIST_GET_FIRST(table->referenced_list) == NULL) {

		return(DB_SUCCESS);
	}

	trx = thr_get_trx(thr);
172 173 174 175 176 177 178 179 180 181 182

	rec = btr_pcur_get_rec(pcur);

	heap = mem_heap_create(500);

	entry = row_rec_to_index_entry(ROW_COPY_DATA, index, rec, heap);

	mtr_commit(mtr);	

	mtr_start(mtr);	
	
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
183
	if (trx->dict_operation_lock_mode == 0) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
184
		got_s_lock = TRUE;
185

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
186
		row_mysql_freeze_data_dictionary(trx);
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
187 188
	}
		
189 190 191
	foreign = UT_LIST_GET_FIRST(table->referenced_list);

	while (foreign) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
192 193 194 195 196 197 198
		/* Note that we may have an update which updates the index
		record, but does NOT update the first fields which are
		referenced in a foreign key constraint. Then the update does
		NOT break the constraint. */

		if (foreign->referenced_index == index
		    && (node->is_delete
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
199
		       || row_upd_changes_first_fields_binary(entry, index,
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
200 201
			    		node->update, foreign->n_fields))) {
			    				
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
202 203 204 205
			if (foreign->foreign_table == NULL) {
				dict_table_get(foreign->foreign_table_name,
									trx);
			}
206

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
207 208 209 210 211 212 213 214 215 216
			if (foreign->foreign_table) {
				mutex_enter(&(dict_sys->mutex));

				(foreign->foreign_table
				->n_foreign_key_checks_running)++;

				mutex_exit(&(dict_sys->mutex));
			}

			/* NOTE that if the thread ends up waiting for a lock
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
217 218 219
			we will release dict_operation_lock temporarily!
			But the counter on the table protects 'foreign' from
			being dropped while the check is running. */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
220
			
221
			err = row_ins_check_foreign_constraint(FALSE, foreign,
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
222
							table, entry, thr);
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
223 224 225 226 227 228 229 230 231 232 233 234 235

			if (foreign->foreign_table) {
				mutex_enter(&(dict_sys->mutex));

				ut_a(foreign->foreign_table
				->n_foreign_key_checks_running > 0);

				(foreign->foreign_table
				->n_foreign_key_checks_running)--;

				mutex_exit(&(dict_sys->mutex));
			}

236
			if (err != DB_SUCCESS) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
237
				if (got_s_lock) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
238 239
					row_mysql_unfreeze_data_dictionary(
									trx);
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
240 241
				}

242 243 244 245 246 247 248 249 250
				mem_heap_free(heap);

				return(err);
			}
		}

		foreign = UT_LIST_GET_NEXT(referenced_list, foreign);
	}

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
251
	if (got_s_lock) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
252
		row_mysql_unfreeze_data_dictionary(trx);
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
253 254
	}

255 256 257 258 259
	mem_heap_free(heap);
	
	return(DB_SUCCESS);
}

260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
/*************************************************************************
Creates an update node for a query graph. */

upd_node_t*
upd_node_create(
/*============*/
				/* out, own: update node */
	mem_heap_t*	heap)	/* in: mem heap where created */
{
	upd_node_t*	node;

	node = mem_heap_alloc(heap, sizeof(upd_node_t));
	node->common.type = QUE_NODE_UPDATE;

	node->state = UPD_NODE_UPDATE_CLUSTERED;
	node->select_will_do_update = FALSE;
	node->in_mysql_interface = FALSE;

	node->row = NULL;
279
	node->ext_vec = NULL;
280
	node->index = NULL;
281 282
	node->update = NULL;
	
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
283
	node->foreign = NULL;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
284 285 286
	node->cascade_heap = NULL;
	node->cascade_node = NULL;
	
287 288 289
	node->select = NULL;
	
	node->heap = mem_heap_create(128);
290
	node->magic_n = UPD_NODE_MAGIC_N;	
291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354

	node->cmpl_info = 0;
	
	return(node);
}

/*************************************************************************
Updates the trx id and roll ptr field in a clustered index record in database
recovery. */

void
row_upd_rec_sys_fields_in_recovery(
/*===============================*/
	rec_t*	rec,	/* in: record */
	ulint	pos,	/* in: TRX_ID position in rec */
	dulint	trx_id,	/* in: transaction id */
	dulint	roll_ptr)/* in: roll ptr of the undo log record */
{
	byte*	field;
	ulint	len;

	field = rec_get_nth_field(rec, pos, &len);
	ut_ad(len == DATA_TRX_ID_LEN);
	trx_write_trx_id(field, trx_id);

	field = rec_get_nth_field(rec, pos + 1, &len);
	ut_ad(len == DATA_ROLL_PTR_LEN);
	trx_write_roll_ptr(field, roll_ptr);
}

/*************************************************************************
Sets the trx id or roll ptr field of a clustered index entry. */

void
row_upd_index_entry_sys_field(
/*==========================*/
	dtuple_t*	entry,	/* in: index entry, where the memory buffers
				for sys fields are already allocated:
				the function just copies the new values to
				them */
	dict_index_t*	index,	/* in: clustered index */
	ulint		type,	/* in: DATA_TRX_ID or DATA_ROLL_PTR */
	dulint		val)	/* in: value to write */
{
	dfield_t*	dfield;
	byte*		field;
	ulint		pos;

	ut_ad(index->type & DICT_CLUSTERED);

	pos = dict_index_get_sys_col_pos(index, type);

	dfield = dtuple_get_nth_field(entry, pos);
	field = dfield_get_data(dfield);

	if (type == DATA_TRX_ID) {
		trx_write_trx_id(field, val);
	} else {
		ut_ad(type == DATA_ROLL_PTR);
		trx_write_roll_ptr(field, val);
	}
}

/***************************************************************
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
355 356
Returns TRUE if row update changes size of some field in index or if some
field to be updated is stored externally in rec or update. */
357 358

ibool
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
359 360
row_upd_changes_field_size_or_external(
/*===================================*/
361
				/* out: TRUE if the update changes the size of
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
362 363
				some field in index or the field is external
				in rec or update */
364 365
	rec_t*		rec,	/* in: record in index */
	dict_index_t*	index,	/* in: index */
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
	upd_t*		update)	/* in: update vector */
{
	upd_field_t*	upd_field;
	dfield_t*	new_val;
	ulint		old_len;
	ulint		new_len;
	ulint		n_fields;
	ulint		i;

	n_fields = upd_get_n_fields(update);

	for (i = 0; i < n_fields; i++) {
		upd_field = upd_get_nth_field(update, i);

		new_val = &(upd_field->new_val);
		new_len = new_val->len;

		if (new_len == UNIV_SQL_NULL) {
			new_len = dtype_get_sql_null_size(
					dict_index_get_nth_type(index, i));
		}

		old_len = rec_get_nth_field_size(rec, upd_field->field_no);
		
		if (old_len != new_len) {

			return(TRUE);
		}
394 395 396 397 398 399 400 401 402 403
		
		if (rec_get_nth_field_extern_bit(rec, upd_field->field_no)) {

			return(TRUE);
		}

		if (upd_field->extern_storage) {

			return(TRUE);
		}
404 405 406 407 408 409 410 411 412 413 414 415 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 451
	}

	return(FALSE);
}

/***************************************************************
Replaces the new column values stored in the update vector to the record
given. No field size changes are allowed. This function is used only for
a clustered index */

void
row_upd_rec_in_place(
/*=================*/
	rec_t*	rec,	/* in/out: record where replaced */
	upd_t*	update)	/* in: update vector */
{
	upd_field_t*	upd_field;
	dfield_t*	new_val;
	ulint		n_fields;
	ulint		i;

	rec_set_info_bits(rec, update->info_bits);

	n_fields = upd_get_n_fields(update);

	for (i = 0; i < n_fields; i++) {
		upd_field = upd_get_nth_field(update, i);
		new_val = &(upd_field->new_val);
		
		rec_set_nth_field(rec, upd_field->field_no,
						dfield_get_data(new_val),
						dfield_get_len(new_val));
	}
}

/*************************************************************************
Writes into the redo log the values of trx id and roll ptr and enough info
to determine their positions within a clustered index record. */

byte*
row_upd_write_sys_vals_to_log(
/*==========================*/
				/* out: new pointer to mlog */
	dict_index_t*	index,	/* in: clustered index */
	trx_t*		trx,	/* in: transaction */
	dulint		roll_ptr,/* in: roll ptr of the undo log record */
	byte*		log_ptr,/* pointer to a buffer of size > 20 opened
				in mlog */
452
	mtr_t*		mtr __attribute__((unused))) /* in: mtr */
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 501 502 503 504 505 506 507 508 509 510 511 512 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 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645
{
	ut_ad(index->type & DICT_CLUSTERED);
	ut_ad(mtr);

	log_ptr += mach_write_compressed(log_ptr,
			dict_index_get_sys_col_pos(index, DATA_TRX_ID));

	trx_write_roll_ptr(log_ptr, roll_ptr);
	log_ptr += DATA_ROLL_PTR_LEN;	

	log_ptr += mach_dulint_write_compressed(log_ptr, trx->id);

	return(log_ptr);
}

/*************************************************************************
Parses the log data of system field values. */

byte*
row_upd_parse_sys_vals(
/*===================*/
			/* out: log data end or NULL */
	byte*	ptr,	/* in: buffer */
	byte*	end_ptr,/* in: buffer end */
	ulint*	pos,	/* out: TRX_ID position in record */
	dulint*	trx_id,	/* out: trx id */
	dulint*	roll_ptr)/* out: roll ptr */
{
	ptr = mach_parse_compressed(ptr, end_ptr, pos);

	if (ptr == NULL) {

		return(NULL);
	}

	if (end_ptr < ptr + DATA_ROLL_PTR_LEN) {

		return(NULL);
	}
	
	*roll_ptr = trx_read_roll_ptr(ptr);
	ptr += DATA_ROLL_PTR_LEN;	

	ptr = mach_dulint_parse_compressed(ptr, end_ptr, trx_id);

	return(ptr);
}

/***************************************************************
Writes to the redo log the new values of the fields occurring in the index. */

void
row_upd_index_write_log(
/*====================*/
	upd_t*	update,	/* in: update vector */
	byte*	log_ptr,/* in: pointer to mlog buffer: must contain at least
			MLOG_BUF_MARGIN bytes of free space; the buffer is
			closed within this function */
	mtr_t*	mtr)	/* in: mtr into whose log to write */
{
	upd_field_t*	upd_field;
	dfield_t*	new_val;
	ulint		len;
	ulint		n_fields;
	byte*		buf_end;
	ulint		i;

	n_fields = upd_get_n_fields(update);

	buf_end = log_ptr + MLOG_BUF_MARGIN;
	
	mach_write_to_1(log_ptr, update->info_bits);
	log_ptr++;
	log_ptr += mach_write_compressed(log_ptr, n_fields);
	
	for (i = 0; i < n_fields; i++) {

		ut_ad(MLOG_BUF_MARGIN > 30);

		if (log_ptr + 30 > buf_end) {
			mlog_close(mtr, log_ptr);
			
			log_ptr = mlog_open(mtr, MLOG_BUF_MARGIN);
			buf_end = log_ptr + MLOG_BUF_MARGIN;
		}

		upd_field = upd_get_nth_field(update, i);

		new_val = &(upd_field->new_val);

		len = new_val->len;

		log_ptr += mach_write_compressed(log_ptr, upd_field->field_no);
		log_ptr += mach_write_compressed(log_ptr, len);

		if (len != UNIV_SQL_NULL) {
			if (log_ptr + len < buf_end) {
				ut_memcpy(log_ptr, new_val->data, len);

				log_ptr += len;
			} else {
				mlog_close(mtr, log_ptr);
			
				mlog_catenate_string(mtr, new_val->data, len);

				log_ptr = mlog_open(mtr, MLOG_BUF_MARGIN);
				buf_end = log_ptr + MLOG_BUF_MARGIN;
			}
		}
	}

	mlog_close(mtr, log_ptr);
}

/*************************************************************************
Parses the log data written by row_upd_index_write_log. */

byte*
row_upd_index_parse(
/*================*/
				/* out: log data end or NULL */
	byte*		ptr,	/* in: buffer */
	byte*		end_ptr,/* in: buffer end */
	mem_heap_t*	heap,	/* in: memory heap where update vector is
				built */
	upd_t**		update_out)/* out: update vector */
{
	upd_t*		update;
	upd_field_t*	upd_field;
	dfield_t*	new_val;
	ulint		len;
	ulint		n_fields;
	byte*		buf;
	ulint		info_bits;
	ulint		i;

	if (end_ptr < ptr + 1) {

		return(NULL);
	}

	info_bits = mach_read_from_1(ptr);
	ptr++;
	ptr = mach_parse_compressed(ptr, end_ptr, &n_fields);

	if (ptr == NULL) {

		return(NULL);
	}

	update = upd_create(n_fields, heap);
	update->info_bits = info_bits;

	for (i = 0; i < n_fields; i++) {
		upd_field = upd_get_nth_field(update, i);
		new_val = &(upd_field->new_val);

		ptr = mach_parse_compressed(ptr, end_ptr,
						&(upd_field->field_no));
		if (ptr == NULL) {

			return(NULL);
		}

		ptr = mach_parse_compressed(ptr, end_ptr, &len);

		if (ptr == NULL) {

			return(NULL);
		}

		new_val->len = len;

		if (len != UNIV_SQL_NULL) {

			if (end_ptr < ptr + len) {

				return(NULL);
			} else {
				buf = mem_heap_alloc(heap, len);
				ut_memcpy(buf, ptr, len);

				ptr += len;

				new_val->data = buf;
			}
		}
	}

	*update_out = update;

	return(ptr);
}
646 647 648

/*******************************************************************
Returns TRUE if ext_vec contains i. */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
649
static
650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673
ibool
upd_ext_vec_contains(
/*=================*/
				/* out: TRUE if i is in ext_vec */
	ulint*	ext_vec,	/* in: array of indexes or NULL */
	ulint	n_ext_vec,	/* in: number of numbers in ext_vec */
	ulint	i)		/* in: a number */
{
	ulint	j;

	if (ext_vec == NULL) {

		return(FALSE);
	}

	for (j = 0; j < n_ext_vec; j++) {
		if (ext_vec[j] == i) {

			return(TRUE);
		}
	}

	return(FALSE);
}
674
	
675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
/*******************************************************************
Builds an update vector from those fields which in a secondary index entry
differ from a record that has the equal ordering fields. NOTE: we compare
the fields as binary strings! */

upd_t*
row_upd_build_sec_rec_difference_binary(
/*====================================*/
				/* out, own: update vector of differing
				fields */
	dict_index_t*	index,	/* in: index */
	dtuple_t*	entry,	/* in: entry to insert */
	rec_t*		rec,	/* in: secondary index record */
	mem_heap_t*	heap)	/* in: memory heap from which allocated */
{
	upd_field_t*	upd_field;
	dfield_t*	dfield;
	byte*		data;
	ulint		len;
	upd_t*		update;
	ulint		n_diff;
	ulint		i;

	/* This function is used only for a secondary index */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
699
	ut_a(0 == (index->type & DICT_CLUSTERED));
700 701 702 703 704 705 706 707 708 709 710

	update = upd_create(dtuple_get_n_fields(entry), heap);

	n_diff = 0;

	for (i = 0; i < dtuple_get_n_fields(entry); i++) {

		data = rec_get_nth_field(rec, i, &len);

		dfield = dtuple_get_nth_field(entry, i);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
711 712 713 714 715 716 717
		/* NOTE that it may be that len != dfield_get_len(dfield) if we
		are updating in a character set and collation where strings of
		different length can be equal in an alphabetical comparison,
		and also in the case where we have a column prefix index
		and the last characters in the index field are spaces; the
		latter case probably caused the assertion failures reported at
		row0upd.c line 713 in versions 4.0.14 - 4.0.16. */
718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740

		/* NOTE: we compare the fields as binary strings!
		(No collation) */

		if (!dfield_data_is_binary_equal(dfield, len, data)) {

			upd_field = upd_get_nth_field(update, n_diff);

			dfield_copy(&(upd_field->new_val), dfield);

			upd_field_set_field_no(upd_field, i, index);

			upd_field->extern_storage = FALSE;

			n_diff++;
		}
	}

	update->n_fields = n_diff;

	return(update);
}

741 742 743
/*******************************************************************
Builds an update vector from those fields, excluding the roll ptr and
trx id fields, which in an index entry differ from a record that has
744
the equal ordering fields. NOTE: we compare the fields as binary strings! */
745 746

upd_t*
747 748
row_upd_build_difference_binary(
/*============================*/
749 750 751 752
				/* out, own: update vector of differing
				fields, excluding roll ptr and trx id */
	dict_index_t*	index,	/* in: clustered index */
	dtuple_t*	entry,	/* in: entry to insert */
753 754 755
	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 */
756 757 758 759 760 761 762 763 764 765 766
	rec_t*		rec,	/* in: clustered index record */
	mem_heap_t*	heap)	/* in: memory heap from which allocated */
{
	upd_field_t*	upd_field;
	dfield_t*	dfield;
	byte*		data;
	ulint		len;
	upd_t*		update;
	ulint		n_diff;
	ulint		roll_ptr_pos;
	ulint		trx_id_pos;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
767
	ibool		extern_bit;
768 769 770
	ulint		i;

	/* This function is used only for a clustered index */
monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
771
	ut_a(index->type & DICT_CLUSTERED);
772 773 774 775 776 777 778 779 780 781 782

	update = upd_create(dtuple_get_n_fields(entry), heap);

	n_diff = 0;

	roll_ptr_pos = dict_index_get_sys_col_pos(index, DATA_ROLL_PTR);
	trx_id_pos = dict_index_get_sys_col_pos(index, DATA_TRX_ID);

	for (i = 0; i < dtuple_get_n_fields(entry); i++) {

		data = rec_get_nth_field(rec, i, &len);
783

784 785
		dfield = dtuple_get_nth_field(entry, i);

786 787 788
		/* NOTE: we compare the fields as binary strings!
		(No collation) */

monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
789 790 791 792
		if (i == trx_id_pos || i == roll_ptr_pos) {

			goto skip_compare;
		}
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
793 794

		extern_bit = rec_get_nth_field_extern_bit(rec, i);
monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
795
		
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
796
		if (extern_bit != upd_ext_vec_contains(ext_vec, n_ext_vec, i)
monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
797
		    || !dfield_data_is_binary_equal(dfield, len, data)) {
798 799 800 801 802 803

			upd_field = upd_get_nth_field(update, n_diff);

			dfield_copy(&(upd_field->new_val), dfield);

			upd_field_set_field_no(upd_field, i, index);
804 805 806 807 808 809

			if (upd_ext_vec_contains(ext_vec, n_ext_vec, i)) {
				upd_field->extern_storage = TRUE;
			} else {
				upd_field->extern_storage = FALSE;
			}
810 811 812
				
			n_diff++;
		}
monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
813 814
skip_compare:
		;
815 816 817 818 819 820 821 822 823 824 825
	}

	update->n_fields = n_diff;

	return(update);
}

/***************************************************************
Replaces the new column values stored in the update vector to the index entry
given. */

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887
void
row_upd_index_replace_new_col_vals_index_pos(
/*=========================================*/
	dtuple_t*	entry,	/* in/out: index entry where replaced */
	dict_index_t*	index,	/* in: index; NOTE that this may also be a
				non-clustered index */
	upd_t*		update,	/* in: an update vector built for the index so
				that the field number in an upd_field is the
				index position */
	mem_heap_t*	heap)	/* in: memory heap to which we allocate and
				copy the new values, set this as NULL if you
				do not want allocation */
{
	dict_field_t*	field;
	upd_field_t*	upd_field;
	dfield_t*	dfield;
	dfield_t*	new_val;
	ulint		j;
	ulint		i;

	ut_ad(index);

	dtuple_set_info_bits(entry, update->info_bits);

	for (j = 0; j < dict_index_get_n_fields(index); j++) {

	        field = dict_index_get_nth_field(index, j);

		for (i = 0; i < upd_get_n_fields(update); i++) {

		        upd_field = upd_get_nth_field(update, i);

			if (upd_field->field_no == j) {

			        dfield = dtuple_get_nth_field(entry, j);

				new_val = &(upd_field->new_val);

				dfield_set_data(dfield, new_val->data,
								new_val->len);
				if (heap && new_val->len != UNIV_SQL_NULL) {
				        dfield->data = mem_heap_alloc(heap,
								new_val->len);
					ut_memcpy(dfield->data, new_val->data,
								new_val->len);
				}

				if (field->prefix_len > 0
			            && new_val->len != UNIV_SQL_NULL
			            && new_val->len > field->prefix_len) {

				        dfield->len = field->prefix_len;
				}
			}
		}
	}
}

/***************************************************************
Replaces the new column values stored in the update vector to the index entry
given. */

888 889 890 891
void
row_upd_index_replace_new_col_vals(
/*===============================*/
	dtuple_t*	entry,	/* in/out: index entry where replaced */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
892
	dict_index_t*	index,	/* in: index; NOTE that this may also be a
893
				non-clustered index */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
894 895 896
	upd_t*		update,	/* in: an update vector built for the
				CLUSTERED index so that the field number in
				an upd_field is the clustered index position */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
897 898 899
	mem_heap_t*	heap)	/* in: memory heap to which we allocate and
				copy the new values, set this as NULL if you
				do not want allocation */
900
{
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
901
	dict_field_t*	field;
902 903 904
	upd_field_t*	upd_field;
	dfield_t*	dfield;
	dfield_t*	new_val;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
905
	ulint		j;
906 907 908 909 910 911
	ulint		i;

	ut_ad(index);

	dtuple_set_info_bits(entry, update->info_bits);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
912
	for (j = 0; j < dict_index_get_n_fields(index); j++) {
913

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
914
	        field = dict_index_get_nth_field(index, j);
915

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
916
		for (i = 0; i < upd_get_n_fields(update); i++) {
917

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
918
		        upd_field = upd_get_nth_field(update, i);
919

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
920
			if (upd_field->field_no == field->col->clust_pos) {
921

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
922
			        dfield = dtuple_get_nth_field(entry, j);
923

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
924
				new_val = &(upd_field->new_val);
925

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
926 927 928 929 930 931 932 933
				dfield_set_data(dfield, new_val->data,
								new_val->len);
				if (heap && new_val->len != UNIV_SQL_NULL) {
				        dfield->data = mem_heap_alloc(heap,
								new_val->len);
					ut_memcpy(dfield->data, new_val->data,
								new_val->len);
				}
934

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
935 936 937
				if (field->prefix_len > 0
			            && new_val->len != UNIV_SQL_NULL
			            && new_val->len > field->prefix_len) {
938

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
939 940 941 942
				        dfield->len = field->prefix_len;
				}
			}
		}
943 944 945 946 947 948
	}
}

/***************************************************************
Checks if an update vector changes an ordering field of an index record.
This function is fast if the update vector is short or the number of ordering
949 950
fields in the index is small. Otherwise, this can be quadratic.
NOTE: we compare the fields as binary strings! */
951 952

ibool
953 954
row_upd_changes_ord_field_binary(
/*=============================*/
955
				/* out: TRUE if update vector changes
956 957 958
				an ordering field in the index record;
				NOTE: the fields are compared as binary
				strings */
959 960 961 962 963
	dtuple_t*	row,	/* in: old value of row, or NULL if the
				row and the data values in update are not
				known when this function is called, e.g., at
				compile time */
	dict_index_t*	index,	/* in: index of the record */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
964 965 966
	upd_t*		update)	/* in: update vector for the row; NOTE: the
				field numbers in this MUST be clustered index
				positions! */
967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992
{
	upd_field_t*	upd_field;
	dict_field_t*	ind_field;
	dict_col_t*	col;
	ulint		n_unique;
	ulint		n_upd_fields;
	ulint		col_pos;
	ulint		col_no;
	ulint		i, j;
	
	ut_ad(update && index);

	n_unique = dict_index_get_n_unique(index);
	n_upd_fields = upd_get_n_fields(update);

	for (i = 0; i < n_unique; i++) {

		ind_field = dict_index_get_nth_field(index, i);
		col = dict_field_get_col(ind_field);
		col_pos = dict_col_get_clust_pos(col);
		col_no = dict_col_get_no(col);

		for (j = 0; j < n_upd_fields; j++) {

			upd_field = upd_get_nth_field(update, j);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
993 994 995 996 997
			/* Note that if the index field is a column prefix
			then it may be that row does not contain an externally
			stored part of the column value, and we cannot compare
			the datas */

998
			if (col_pos == upd_field->field_no
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
999 1000 1001
			    && (row == NULL
			        || ind_field->prefix_len > 0
				|| !dfield_datas_are_binary_equal(
1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012
					dtuple_get_nth_field(row, col_no),
						&(upd_field->new_val)))) {
				return(TRUE);
			}
		}
	}

	return(FALSE);
}

/***************************************************************
1013 1014
Checks if an update vector changes an ordering field of an index record.
NOTE: we compare the fields as binary strings! */
1015 1016

ibool
1017 1018
row_upd_changes_some_index_ord_field_binary(
/*========================================*/
1019 1020 1021 1022 1023
				/* out: TRUE if update vector may change
				an ordering field in an index record */
	dict_table_t*	table,	/* in: table */
	upd_t*		update)	/* in: update vector for the row */
{
1024
	upd_field_t*	upd_field;
1025
	dict_index_t*	index;
1026 1027
	ulint		i;
	
1028 1029
	index = dict_table_get_first_index(table);
	
1030
	for (i = 0; i < upd_get_n_fields(update); i++) {
1031

1032
		upd_field = upd_get_nth_field(update, i);
1033

1034 1035 1036
		if (dict_field_get_col(dict_index_get_nth_field(index,
						upd_field->field_no))
		    ->ord_part) {
1037

1038 1039 1040 1041
		    	return(TRUE);
		}
	}
	
1042 1043 1044
	return(FALSE);
}

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1045
/***************************************************************
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1046 1047 1048
Checks if an update vector changes some of the first ordering fields of an
index record. This is only used in foreign key checks and we can assume
that index does not contain column prefixes. */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1049 1050
static
ibool
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1051 1052
row_upd_changes_first_fields_binary(
/*================================*/
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076
				/* out: TRUE if changes */
	dtuple_t*	entry,	/* in: index entry */
	dict_index_t*	index,	/* in: index of entry */
	upd_t*		update,	/* in: update vector for the row */
	ulint		n)	/* in: how many first fields to check */
{
	upd_field_t*	upd_field;
	dict_field_t*	ind_field;
	dict_col_t*	col;
	ulint		n_upd_fields;
	ulint		col_pos;
	ulint		i, j;
	
	ut_a(update && index);
	ut_a(n <= dict_index_get_n_fields(index));
	
	n_upd_fields = upd_get_n_fields(update);

	for (i = 0; i < n; i++) {

		ind_field = dict_index_get_nth_field(index, i);
		col = dict_field_get_col(ind_field);
		col_pos = dict_col_get_clust_pos(col);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1077 1078
		ut_a(ind_field->prefix_len == 0);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1079 1080 1081 1082 1083
		for (j = 0; j < n_upd_fields; j++) {

			upd_field = upd_get_nth_field(update, j);

			if (col_pos == upd_field->field_no
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1084
			    && !dfield_datas_are_binary_equal(
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1085
					     dtuple_get_nth_field(entry, i),
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1086
					     &(upd_field->new_val))) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1087 1088 1089 1090 1091 1092 1093 1094
				return(TRUE);
			}
		}
	}

	return(FALSE);
}

1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146
/*************************************************************************
Copies the column values from a record. */
UNIV_INLINE
void
row_upd_copy_columns(
/*=================*/
	rec_t*		rec,	/* in: record in a clustered index */
	sym_node_t*	column)	/* in: first column in a column list, or
				NULL */
{
	byte*	data;
	ulint	len;

	while (column) {
		data = rec_get_nth_field(rec,
					column->field_nos[SYM_CLUST_FIELD_NO],
									&len);
		eval_node_copy_and_alloc_val(column, data, len);

		column = UT_LIST_GET_NEXT(col_var_list, column);
	}
}

/*************************************************************************
Calculates the new values for fields to update. Note that row_upd_copy_columns
must have been called first. */
UNIV_INLINE
void
row_upd_eval_new_vals(
/*==================*/
	upd_t*	update)	/* in: update vector */
{
	que_node_t*	exp;
	upd_field_t*	upd_field;
	ulint		n_fields;
	ulint		i;

	n_fields = upd_get_n_fields(update);

	for (i = 0; i < n_fields; i++) {
		upd_field = upd_get_nth_field(update, i);

		exp = upd_field->exp;

		eval_exp(exp);

		dfield_copy_data(&(upd_field->new_val), que_node_get_val(exp));
	}
}

/***************************************************************
Stores to the heap the row on which the node->pcur is positioned. */
1147
static
1148 1149 1150 1151 1152 1153
void
row_upd_store_row(
/*==============*/
	upd_node_t*	node)	/* in: row update node */
{
	dict_index_t*	clust_index;
1154 1155
	upd_t*		update;
	rec_t*		rec;
1156
	
1157
	ut_ad(node->pcur->latch_mode != BTR_NO_LATCHES);
1158 1159 1160 1161 1162 1163 1164 1165

	if (node->row != NULL) {
		mem_heap_empty(node->heap);
		node->row = NULL;
	}
	
	clust_index = dict_table_get_first_index(node->table);

1166 1167 1168 1169
	rec = btr_pcur_get_rec(node->pcur);
	
	node->row = row_build(ROW_COPY_DATA, clust_index, rec, node->heap);

1170 1171
	node->ext_vec = mem_heap_alloc(node->heap, sizeof(ulint)
				                    * rec_get_n_fields(rec));
1172 1173 1174 1175 1176 1177 1178 1179
	if (node->is_delete) {
		update = NULL;
	} else {
		update = node->update;
	}
	
	node->n_ext_vec = btr_push_update_extern_fields(node->ext_vec,
								rec, update);
1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192
}

/***************************************************************
Updates a secondary index entry of a row. */
static
ulint
row_upd_sec_index_entry(
/*====================*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	upd_node_t*	node,	/* in: row update node */
	que_thr_t*	thr)	/* in: query thread */
{
1193
	ibool		check_ref;
1194 1195 1196 1197 1198 1199 1200
	ibool		found;
	dict_index_t*	index;
	dtuple_t*	entry;
	btr_pcur_t	pcur;
	btr_cur_t*	btr_cur;
	mem_heap_t*	heap;
	rec_t*		rec;
1201
	ulint		err	= DB_SUCCESS;
monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
1202
	mtr_t		mtr;
1203 1204 1205
	
	index = node->index;
	
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1206
	check_ref = row_upd_index_is_referenced(index, thr_get_trx(thr));
1207

1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221
	heap = mem_heap_create(1024);

	/* Build old index entry */
	entry = row_build_index_entry(node->row, index, heap);

	log_free_check();
	mtr_start(&mtr);
	
	found = row_search_index_entry(index, entry, BTR_MODIFY_LEAF, &pcur,
									&mtr);
	btr_cur = btr_pcur_get_btr_cur(&pcur);

	rec = btr_cur_get_rec(btr_cur);

1222
	if (!found) {
1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236
		fputs("InnoDB: error in sec index entry update in\n"
			"InnoDB: ", stderr);
		dict_index_name_print(stderr, index);
		fputs("\n"
			"InnoDB: tuple ", stderr);
		dtuple_print(stderr, entry);
		fputs("\n"
			"InnoDB: record ", stderr);
		rec_print(stderr, rec);
		putc('\n', stderr);

		trx_print(stderr, thr_get_trx(thr));

		fputs("\n"
1237
"InnoDB: Submit a detailed bug report to http://bugs.mysql.com\n", stderr);
1238
	} else {
1239 1240 1241 1242 1243 1244 1245
 	  	/* Delete mark the old index record; it can already be
          	delete marked if we return after a lock wait in
          	row_ins_index_entry below */

	  	if (!rec_get_deleted_flag(rec)) {
			err = btr_cur_del_mark_set_sec_rec(0, btr_cur, TRUE,
								thr, &mtr);
1246
			if (err == DB_SUCCESS && check_ref) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1247
			    	
1248 1249 1250
				/* NOTE that the following call loses
				the position of pcur ! */
				err = row_upd_check_references_constraints(
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1251
							node,
1252 1253 1254 1255 1256 1257 1258 1259
							&pcur, index->table,
							index, thr, &mtr);
				if (err != DB_SUCCESS) {

					goto close_cur;
				}
			}

1260
	  	}
1261
	}
1262
close_cur:
1263 1264 1265
	btr_pcur_close(&pcur);
	mtr_commit(&mtr);

1266
	if (node->is_delete || err != DB_SUCCESS) {
1267 1268 1269 1270 1271 1272 1273

		mem_heap_free(heap);	

        	return(err);
	}

	/* Build a new index entry */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1274
	row_upd_index_replace_new_col_vals(entry, index, node->update, NULL);
1275 1276

	/* Insert new index entry */
1277
	err = row_ins_index_entry(index, entry, NULL, 0, thr);
1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301

	mem_heap_free(heap);	

        return(err);
}

/***************************************************************
Updates secondary index record if it is changed in the row update. This
should be quite rare in database applications. */
UNIV_INLINE
ulint
row_upd_sec_step(
/*=============*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	upd_node_t*	node,	/* in: row update node */
	que_thr_t*	thr)	/* in: query thread */
{
	ulint	err;

	ut_ad((node->state == UPD_NODE_UPDATE_ALL_SEC)
				|| (node->state == UPD_NODE_UPDATE_SOME_SEC));
	ut_ad(!(node->index->type & DICT_CLUSTERED));
	
1302
	if (node->state == UPD_NODE_UPDATE_ALL_SEC
1303 1304
	    || row_upd_changes_ord_field_binary(node->row, node->index,
							   node->update)) {
1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326
		err = row_upd_sec_index_entry(node, thr);

		return(err);
	}

	return(DB_SUCCESS);
}

/***************************************************************
Marks the clustered index record deleted and inserts the updated version
of the record to the index. This function should be used when the ordering
fields of the clustered index record change. This should be quite rare in
database applications. */
static
ulint
row_upd_clust_rec_by_insert(
/*========================*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	upd_node_t*	node,	/* in: row update node */
	dict_index_t*	index,	/* in: clustered index of the record */
	que_thr_t*	thr,	/* in: query thread */
1327 1328
	ibool		check_ref,/* in: TRUE if index may be referenced in
				a foreign key constraint */
1329
	mtr_t*		mtr)	/* in: mtr; gets committed here */
1330 1331
{
	mem_heap_t*	heap;
1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355
	btr_pcur_t*	pcur;
	btr_cur_t*	btr_cur;
	trx_t*		trx;
	dict_table_t*	table;
	dtuple_t*	entry;
	ulint		err;
	
	ut_ad(node);
	ut_ad(index->type & DICT_CLUSTERED);

	trx = thr_get_trx(thr);
	table = node->table;
	pcur = node->pcur;
	btr_cur	= btr_pcur_get_btr_cur(pcur);
	
	if (node->state != UPD_NODE_INSERT_CLUSTERED) {

		err = btr_cur_del_mark_set_clust_rec(BTR_NO_LOCKING_FLAG,
						btr_cur, TRUE, thr, mtr);
		if (err != DB_SUCCESS) {
			mtr_commit(mtr);

			return(err);
		}
1356

1357 1358 1359 1360 1361 1362 1363
		/* Mark as not-owned the externally stored fields which the new
		row inherits from the delete marked record: purge should not
		free those externally stored fields even if the delete marked
		record is removed from the index tree, or updated. */

		btr_cur_mark_extern_inherited_fields(btr_cur_get_rec(btr_cur),
							node->update, mtr);
1364 1365 1366
		if (check_ref) {
			/* NOTE that the following call loses
			the position of pcur ! */
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1367
			err = row_upd_check_references_constraints(node,
1368 1369 1370 1371 1372 1373 1374 1375 1376
							pcur, table,
							index, thr, mtr);
			if (err != DB_SUCCESS) {
				mtr_commit(mtr);

				return(err);
			}
		}

1377 1378 1379 1380 1381 1382
	} 

	mtr_commit(mtr);

	node->state = UPD_NODE_INSERT_CLUSTERED;

1383
	heap = mem_heap_create(500);
1384
	
1385 1386
	entry = row_build_index_entry(node->row, index, heap);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1387
	row_upd_index_replace_new_col_vals(entry, index, node->update, NULL);
1388
	
1389 1390
	row_upd_index_entry_sys_field(entry, index, DATA_TRX_ID, trx->id);
	
1391
	/* If we return from a lock wait, for example, we may have
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1392
	extern fields marked as not-owned in entry (marked in the
1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403
	if-branch above). We must unmark them. */
	
	btr_cur_unmark_dtuple_extern_fields(entry, node->ext_vec,
							node->n_ext_vec);
	/* We must mark non-updated extern fields in entry as inherited,
	so that a possible rollback will not free them */
	
	btr_cur_mark_dtuple_inherited_extern(entry, node->ext_vec,
						node->n_ext_vec,
						node->update);
	
1404 1405
	err = row_ins_index_entry(index, entry, node->ext_vec,
						node->n_ext_vec, thr);
1406 1407
	mem_heap_free(heap);
	
1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424
	return(err);
}

/***************************************************************
Updates a clustered index record of a row when the ordering fields do
not change. */
static
ulint
row_upd_clust_rec(
/*==============*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	upd_node_t*	node,	/* in: row update node */
	dict_index_t*	index,	/* in: clustered index */
	que_thr_t*	thr,	/* in: query thread */
	mtr_t*		mtr)	/* in: mtr; gets committed here */
{
1425
	big_rec_t*	big_rec	= NULL;
1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474
	btr_pcur_t*	pcur;
	btr_cur_t*	btr_cur;
	ulint		err;
	
	ut_ad(node);
	ut_ad(index->type & DICT_CLUSTERED);

	pcur = node->pcur;
	btr_cur = btr_pcur_get_btr_cur(pcur);

	ut_ad(FALSE == rec_get_deleted_flag(btr_pcur_get_rec(pcur)));
	
	/* Try optimistic updating of the record, keeping changes within
	the page; we do not check locks because we assume the x-lock on the
	record to update */

	if (node->cmpl_info & UPD_NODE_NO_SIZE_CHANGE) {
		err = btr_cur_update_in_place(BTR_NO_LOCKING_FLAG,
						btr_cur, node->update,
						node->cmpl_info, thr, mtr);
	} else {
		err = btr_cur_optimistic_update(BTR_NO_LOCKING_FLAG,
						btr_cur, node->update,
						node->cmpl_info, thr, mtr);
	}

	mtr_commit(mtr);
	
	if (err == DB_SUCCESS) {

		return(err);
	}

	/* We may have to modify the tree structure: do a pessimistic descent
	down the index tree */

	mtr_start(mtr);
	
	/* NOTE: this transaction has an s-lock or x-lock on the record and
	therefore other transactions cannot modify the record when we have no
	latch on the page. In addition, we assume that other query threads of
	the same transaction do not modify the record in the meantime.
	Therefore we can assert that the restoration of the cursor succeeds. */

	ut_a(btr_pcur_restore_position(BTR_MODIFY_TREE, pcur, mtr));

	ut_ad(FALSE == rec_get_deleted_flag(btr_pcur_get_rec(pcur)));
	
	err = btr_cur_pessimistic_update(BTR_NO_LOCKING_FLAG, btr_cur,
1475 1476
					&big_rec, node->update,
					node->cmpl_info, thr, mtr);
1477 1478
	mtr_commit(mtr);

1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492
	if (err == DB_SUCCESS && big_rec) {
		mtr_start(mtr);
		ut_a(btr_pcur_restore_position(BTR_MODIFY_TREE, pcur, mtr));
	
		err = btr_store_big_rec_extern_fields(index,
						btr_cur_get_rec(btr_cur),
						big_rec, mtr);		
		mtr_commit(mtr);
	}

	if (big_rec) {
		dtuple_big_rec_free(big_rec);
	}
		
1493 1494 1495 1496 1497 1498 1499 1500 1501 1502
	return(err);
}

/***************************************************************
Delete marks a clustered index record. */
static
ulint
row_upd_del_mark_clust_rec(
/*=======================*/
				/* out: DB_SUCCESS if operation successfully
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1503
				completed, else error code */
1504 1505 1506
	upd_node_t*	node,	/* in: row update node */
	dict_index_t*	index,	/* in: clustered index */
	que_thr_t*	thr,	/* in: query thread */
1507 1508
	ibool		check_ref,/* in: TRUE if index may be referenced in
				a foreign key constraint */
1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529
	mtr_t*		mtr)	/* in: mtr; gets committed here */
{
	btr_pcur_t*	pcur;
	btr_cur_t*	btr_cur;
	ulint		err;
	
	ut_ad(node);
	ut_ad(index->type & DICT_CLUSTERED);
	ut_ad(node->is_delete);

	pcur = node->pcur;
	btr_cur = btr_pcur_get_btr_cur(pcur);

	/* Store row because we have to build also the secondary index
	entries */
	
	row_upd_store_row(node);

	/* Mark the clustered index record deleted; we do not have to check
	locks, because we assume that we have an x-lock on the record */

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1530 1531
	err = btr_cur_del_mark_set_clust_rec(BTR_NO_LOCKING_FLAG,
						btr_cur, TRUE, thr, mtr);
1532
	if (err == DB_SUCCESS && check_ref) {
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1533 1534
		/* NOTE that the following call loses the position of pcur ! */

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1535 1536
		err = row_upd_check_references_constraints(node,
							pcur, index->table,
1537 1538 1539 1540 1541 1542 1543 1544
							index, thr, mtr);
		if (err != DB_SUCCESS) {
			mtr_commit(mtr);

			return(err);
		}
	}

1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564
	mtr_commit(mtr);
	
	return(err);
}

/***************************************************************
Updates the clustered index record. */
static
ulint
row_upd_clust_step(
/*===============*/
				/* out: DB_SUCCESS if operation successfully
				completed, DB_LOCK_WAIT in case of a lock wait,
				else error code */
	upd_node_t*	node,	/* in: row update node */
	que_thr_t*	thr)	/* in: query thread */
{
	dict_index_t*	index;
	btr_pcur_t*	pcur;
	ibool		success;
1565
	ibool		check_ref;
1566 1567
	ulint		err;
	mtr_t*		mtr;
1568
	mtr_t		mtr_buf;
1569 1570 1571
	
	index = dict_table_get_first_index(node->table);

heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1572
	check_ref = row_upd_index_is_referenced(index, thr_get_trx(thr));
1573

1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 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
	pcur = node->pcur;

	/* We have to restore the cursor to its position */
	mtr = &mtr_buf;

	mtr_start(mtr);
	
	/* If the restoration does not succeed, then the same
	transaction has deleted the record on which the cursor was,
	and that is an SQL error. If the restoration succeeds, it may
	still be that the same transaction has successively deleted
	and inserted a record with the same ordering fields, but in
	that case we know that the transaction has at least an
	implicit x-lock on the record. */
	
	ut_a(pcur->rel_pos == BTR_PCUR_ON);

	success = btr_pcur_restore_position(BTR_MODIFY_LEAF, pcur, mtr);

	if (!success) {
		err = DB_RECORD_NOT_FOUND;

		mtr_commit(mtr);

		return(err);
	}

	/* If this is a row in SYS_INDEXES table of the data dictionary,
	then we have to free the file segments of the index tree associated
	with the index */

	if (ut_dulint_cmp(node->table->id, DICT_INDEXES_ID) == 0) {

		dict_drop_index_tree(btr_pcur_get_rec(pcur), mtr);

		mtr_commit(mtr);

		mtr_start(mtr);

		success = btr_pcur_restore_position(BTR_MODIFY_LEAF, pcur,
									mtr);
		if (!success) {
			err = DB_ERROR;

			mtr_commit(mtr);

			return(err);
		}
	} 

	if (!node->has_clust_rec_x_lock) {
		err = lock_clust_rec_modify_check_and_lock(0,
						btr_pcur_get_rec(pcur),
						index, thr);
		if (err != DB_SUCCESS) {
			mtr_commit(mtr);

			return(err);
		}
	}

	/* NOTE: the following function calls will also commit mtr */

	if (node->is_delete) {
1638 1639
		err = row_upd_del_mark_clust_rec(node, index, thr, check_ref,
									mtr);
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
		if (err != DB_SUCCESS) {

			return(err);
		}

		node->state = UPD_NODE_UPDATE_ALL_SEC;
		node->index = dict_table_get_next_index(index);

		return(err);
	}
	
	/* If the update is made for MySQL, we already have the update vector
	ready, else we have to do some evaluation: */
 
	if (!node->in_mysql_interface) {
		/* Copy the necessary columns from clust_rec and calculate the
		new values to set */

		row_upd_copy_columns(btr_pcur_get_rec(pcur),
					UT_LIST_GET_FIRST(node->columns));
		row_upd_eval_new_vals(node->update);
	}
		
	if (node->cmpl_info & UPD_NODE_NO_ORD_CHANGE) {

		err = row_upd_clust_rec(node, index, thr, mtr);

		return(err);
	}
	
	row_upd_store_row(node);

1672
	if (row_upd_changes_ord_field_binary(node->row, index, node->update)) {
1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684

		/* Update causes an ordering field (ordering fields within
		the B-tree) of the clustered index record to change: perform
		the update by delete marking and inserting.

		TODO! What to do to the 'Halloween problem', where an update
		moves the record forward in index so that it is again
		updated when the cursor arrives there? Solution: the
		read operation must check the undo record undo number when
		choosing records to update. MySQL solves now the problem
		externally! */

1685 1686
		err = row_upd_clust_rec_by_insert(node, index, thr, check_ref,
									mtr);
1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721
		if (err != DB_SUCCESS) {

			return(err);
		}

		node->state = UPD_NODE_UPDATE_ALL_SEC;
	} else {
		err = row_upd_clust_rec(node, index, thr, mtr);

		if (err != DB_SUCCESS) {

			return(err);
		}

		node->state = UPD_NODE_UPDATE_SOME_SEC;
	}

	node->index = dict_table_get_next_index(index);

	return(err);
}

/***************************************************************
Updates the affected index records of a row. When the control is transferred
to this node, we assume that we have a persistent cursor which was on a
record, and the position of the cursor is stored in the cursor. */
static
ulint
row_upd(
/*====*/
				/* out: DB_SUCCESS if operation successfully
				completed, else error code or DB_LOCK_WAIT */
	upd_node_t*	node,	/* in: row update node */
	que_thr_t*	thr)	/* in: query thread */
{
1722
	ulint	err	= DB_SUCCESS;
1723 1724 1725 1726
	
	ut_ad(node && thr);

	if (node->in_mysql_interface) {
1727
	
1728 1729 1730
		/* We do not get the cmpl_info value from the MySQL
		interpreter: we must calculate it on the fly: */
		
1731
		if (node->is_delete ||
1732 1733
			row_upd_changes_some_index_ord_field_binary(
					node->table, node->update)) {
1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750
			node->cmpl_info = 0; 
		} else {
			node->cmpl_info = UPD_NODE_NO_ORD_CHANGE;
		}
	}

	if (node->state == UPD_NODE_UPDATE_CLUSTERED
				|| node->state == UPD_NODE_INSERT_CLUSTERED) {

		err = row_upd_clust_step(node, thr);
		
		if (err != DB_SUCCESS) {

			goto function_exit;
		}
	}

1751
	if (!node->is_delete && (node->cmpl_info & UPD_NODE_NO_ORD_CHANGE)) {
1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772

		goto function_exit;
	}

	while (node->index != NULL) {
		err = row_upd_sec_step(node, thr);

		if (err != DB_SUCCESS) {

			goto function_exit;
		}

		node->index = dict_table_get_next_index(node->index);
        }

function_exit:
	if (err == DB_SUCCESS) {
		/* Do some cleanup */

		if (node->row != NULL) {
			node->row = NULL;
1773
			node->n_ext_vec = 0;
heikki@hundin.mysql.fi's avatar
heikki@hundin.mysql.fi committed
1774
			mem_heap_empty(node->heap);
1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802
		}

		node->state = UPD_NODE_UPDATE_CLUSTERED;
	}

        return(err);
}

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

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

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

monty@donna.mysql.fi's avatar
Merge  
monty@donna.mysql.fi committed
1803 1804
	trx_start_if_not_started(trx);

1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947
	node = thr->run_node;
	
	sel_node = node->select;

	parent = que_node_get_parent(node);
	
	ut_ad(que_node_get_type(node) == QUE_NODE_UPDATE);
	
	if (thr->prev_node == parent) {
		node->state = UPD_NODE_SET_IX_LOCK;
	}

	if (node->state == UPD_NODE_SET_IX_LOCK) {

		if (!node->has_clust_rec_x_lock) {
			/* It may be that the current session has not yet
			started its transaction, or it has been committed: */

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

			if (err != DB_SUCCESS) {

				goto error_handling;
			}
		}
	
		node->state = UPD_NODE_UPDATE_CLUSTERED;

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

	/* sel_node is NULL if we are in the MySQL interface */
	
	if (sel_node && (sel_node->state != SEL_NODE_FETCH)) {

		if (!node->searched_update) {
			/* An explicit cursor should be positioned on a row
			to update */

			ut_error;
			
			err = DB_ERROR;

			goto error_handling;
		}

		ut_ad(sel_node->state == SEL_NODE_NO_MORE_ROWS);

		/* No more rows to update, or the select node performed the
		updates directly in-place */

		thr->run_node = parent;
	
		return(thr);
	}

	/* DO THE CHECKS OF THE CONSISTENCY CONSTRAINTS HERE */
	
	err = row_upd(node, thr);

error_handling:
	trx->error_state = err;

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

		return(NULL);
	} else {
		return(NULL);
	}

	/* DO THE TRIGGER ACTIONS HERE */

	if (node->searched_update) {
		/* Fetch next row to update */

		thr->run_node = sel_node;
	} else {
		/* It was an explicit cursor update */

		thr->run_node = parent;
	}

	node->state = UPD_NODE_UPDATE_CLUSTERED;

	return(thr);
} 

/*************************************************************************
Performs an in-place update for the current clustered index record in
select. */

void
row_upd_in_place_in_select(
/*=======================*/
	sel_node_t*	sel_node,	/* in: select node */
	que_thr_t*	thr,		/* in: query thread */
	mtr_t*		mtr)		/* in: mtr */
{
	upd_node_t*	node;
	btr_pcur_t*	pcur;
	btr_cur_t*	btr_cur;
	ulint		err;

	ut_ad(sel_node->select_will_do_update);
	ut_ad(sel_node->latch_mode == BTR_MODIFY_LEAF);
	ut_ad(sel_node->asc);

	node = que_node_get_parent(sel_node);

	ut_ad(que_node_get_type(node) == QUE_NODE_UPDATE);

	pcur = node->pcur;
	btr_cur = btr_pcur_get_btr_cur(pcur);

	/* Copy the necessary columns from clust_rec and calculate the new
	values to set */

	row_upd_copy_columns(btr_pcur_get_rec(pcur),
					UT_LIST_GET_FIRST(node->columns));
	row_upd_eval_new_vals(node->update);

	ut_ad(FALSE == rec_get_deleted_flag(btr_pcur_get_rec(pcur)));
	
	ut_ad(node->cmpl_info & UPD_NODE_NO_SIZE_CHANGE);
	ut_ad(node->cmpl_info & UPD_NODE_NO_ORD_CHANGE);
	ut_ad(node->select_will_do_update);

	err = btr_cur_update_in_place(BTR_NO_LOCKING_FLAG, btr_cur,
						node->update, node->cmpl_info,
						thr, mtr);
	ut_ad(err == DB_SUCCESS);
}