Go to the source code of this file.
Classes | |
struct | lock_queue_iterator_struct |
Typedefs | |
typedef struct lock_queue_iterator_struct | lock_queue_iterator_t |
Functions | |
UNIV_INTERN void | lock_queue_iterator_reset (lock_queue_iterator_t *iter, const lock_t *lock, ulint bit_no) |
const lock_t * | lock_queue_iterator_get_prev (lock_queue_iterator_t *iter) |
Lock queue iterator type and function prototypes.
Created July 16, 2007 Vasil Dimov
Definition in file lock0iter.h.
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).
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).
iter | in/out: iterator |
Definition at line 87 of file lock0iter.cc.
References lock_get_type_low(), lock_queue_iterator_get_prev(), LOCK_REC, lock_rec_get_prev(), LOCK_TABLE, ut_ad, ut_error, and UT_LIST_GET_PREV.
Referenced by lock_queue_iterator_get_prev().
UNIV_INTERN 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:
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:
iter | out: iterator |
lock | in: lock to start from |
bit_no | in: record number in the heap |
Definition at line 50 of file lock0iter.cc.
References lock_get_type_low(), lock_queue_iterator_reset(), LOCK_REC, lock_rec_find_set_bit(), LOCK_TABLE, ut_a, ut_ad, and ut_error.
Referenced by lock_queue_iterator_reset().