← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/innobase/include/lock0iter.h

  • Committer: Monty Taylor
  • Date: 2009-04-14 19:16:51 UTC
  • mto: (997.2.5 mordred)
  • mto: This revision was merged to the branch mainline in revision 994.
  • Revision ID: mordred@inaugust.com-20090414191651-ltbww6hpqks8k7qk
Clarified instructions in README.

Show diffs side-by-side

added added

removed removed

Lines of Context:
storage/innobase/include/lock0iter.h
16
16
 
17
17
*****************************************************************************/
18
18
 
19
 
/**************************************************//**
20
 
@file include/lock0iter.h
 
19
/******************************************************
21
20
Lock queue iterator type and function prototypes.
22
21
 
23
22
Created July 16, 2007 Vasil Dimov
37
36
        ulint           bit_no;
38
37
} lock_queue_iterator_t;
39
38
 
40
 
/*******************************************************************//**
 
39
/***********************************************************************
41
40
Initialize lock queue iterator so that it starts to iterate from
42
41
"lock". bit_no specifies the record number within the heap where the
43
42
record is stored. It can be undefined (ULINT_UNDEFINED) in two cases:
50
49
void
51
50
lock_queue_iterator_reset(
52
51
/*======================*/
53
 
        lock_queue_iterator_t*  iter,   /*!< out: iterator */
54
 
        const lock_t*           lock,   /*!< in: lock to start from */
55
 
        ulint                   bit_no);/*!< in: record number in the
 
52
        lock_queue_iterator_t*  iter,   /* out: iterator */
 
53
        const lock_t*           lock,   /* in: lock to start from */
 
54
        ulint                   bit_no);/* in: record number in the
56
55
                                        heap */
57
56
 
58
 
/*******************************************************************//**
 
57
/***********************************************************************
59
58
Gets the previous lock in the lock queue, returns NULL if there are no
60
59
more locks (i.e. the current lock is the first one). The iterator is
61
 
receded (if not-NULL is returned).
62
 
@return previous lock or NULL */
 
60
receded (if not-NULL is returned). */
63
61
 
64
62
const lock_t*
65
63
lock_queue_iterator_get_prev(
66
64
/*=========================*/
67
 
        lock_queue_iterator_t*  iter);  /*!< in/out: iterator */
 
65
                                        /* out: previous lock or NULL */
 
66
        lock_queue_iterator_t*  iter);  /* in/out: iterator */
68
67
 
69
68
#endif /* lock0iter_h */