read0read.ic 1.8 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
/******************************************************
Cursor read

(c) 1997 Innobase Oy

Created 2/16/1997 Heikki Tuuri
*******************************************************/

/*************************************************************************
Gets the nth trx id in a read view. */
UNIV_INLINE
dulint
read_view_get_nth_trx_id(
/*=====================*/
				/* out: trx id */
	read_view_t*	view,	/* in: read view */
	ulint		n)	/* in: position */
{
	ut_ad(n < view->n_trx_ids);

	return(*(view->trx_ids + n));
}

/*************************************************************************
Sets the nth trx id in a read view. */
UNIV_INLINE
void
read_view_set_nth_trx_id(
/*=====================*/
	read_view_t*	view,	/* in: read view */
	ulint		n,	/* in: position */
	dulint		trx_id)	/* in: trx id to set */
{
	ut_ad(n < view->n_trx_ids);

	*(view->trx_ids + n) = trx_id;
}

/*************************************************************************
Checks if a read view sees the specified transaction. */
UNIV_INLINE
ibool
read_view_sees_trx_id(
/*==================*/
				/* out: TRUE if sees */
	read_view_t*	view,	/* in: read view */
	dulint		trx_id)	/* in: trx id */
{
	ulint	n_ids;
	int	cmp;
	ulint	i;
52

53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
	if (ut_dulint_cmp(trx_id, view->up_limit_id) < 0) {

		return(TRUE);
	}

	if (ut_dulint_cmp(trx_id, view->low_limit_id) >= 0) {

		return(FALSE);
	}

	/* We go through the trx ids in the array smallest first: this order
	may save CPU time, because if there was a very long running
	transaction in the trx id array, its trx id is looked at first, and
	the first two comparisons may well decide the visibility of trx_id. */

	n_ids = view->n_trx_ids;

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

		cmp = ut_dulint_cmp(trx_id,
				read_view_get_nth_trx_id(view, n_ids - i - 1));
74 75
		if (cmp <= 0) {
			return(cmp < 0);
76 77
		}
	}
78

79 80
	return(TRUE);
}