Lock queue iterator type and function prototypes. More...

#include "lock0types.h"
#include "univ.i"

Functions
void	lock_queue_iterator_reset (lock_queue_iterator_t iter, const lock_t lock, ulint bit_no)
	Initialize lock queue iterator so that it starts to iterate from "lock". More...

const lock_t *	lock_queue_iterator_get_prev (lock_queue_iterator_t *iter)
	Gets the previous lock in the lock queue, returns NULL if there are no more locks (i.e. More...

Detailed Description

Lock queue iterator type and function prototypes.

Created July 16, 2007 Vasil Dimov

Function Documentation

const lock_t * lock_queue_iterator_get_prev ( lock_queue_iterator_t * iter )

Gets the previous lock in the lock queue, returns NULL if there are no more locks (i.e.

the current lock is the first one). The iterator is receded (if not-NULL is returned).

the current lock is the first one). The iterator is receded (if not-NULL is returned).

Parameters

iter	in/out: iterator

void lock_queue_iterator_reset	(	lock_queue_iterator_t *	iter,
		const lock_t *	lock,
		ulint	bit_no
	)

Initialize lock queue iterator so that it starts to iterate from "lock".

bit_no specifies the record number within the heap where the record is stored. It can be undefined (ULINT_UNDEFINED) in two cases:

If the lock is a table lock, thus we have a table lock queue;
If the lock is a record lock and it is a wait lock. In this case bit_no is calculated in this function by using lock_rec_find_set_bit(). There is exactly one bit set in the bitmap of a wait lock. in: record number in the heap

bit_no specifies the record number within the heap where the record is stored. It can be undefined (ULINT_UNDEFINED) in two cases:

If the lock is a table lock, thus we have a table lock queue;
If the lock is a record lock and it is a wait lock. In this case bit_no is calculated in this function by using lock_rec_find_set_bit(). There is exactly one bit set in the bitmap of a wait lock.

Parameters