mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 23:04:20 +01:00
1601bdc38a
------------------------------------------------------------------------
r5092 | marko | 2009-05-25 09:54:17 +0300 (Mon, 25 May 2009) | 1 line
branches/zip: Adjust some function comments after r5091.
------------------------------------------------------------------------
r5100 | marko | 2009-05-25 12:09:45 +0300 (Mon, 25 May 2009) | 1 line
branches/zip: Split some long lines that were introduced in r5091.
------------------------------------------------------------------------
r5101 | marko | 2009-05-25 12:42:47 +0300 (Mon, 25 May 2009) | 2 lines
branches/zip: Introduce the macro TEMP_INDEX_PREFIX_STR.
This is to avoid triggering an error in Doxygen.
------------------------------------------------------------------------
r5102 | marko | 2009-05-25 13:47:14 +0300 (Mon, 25 May 2009) | 1 line
branches/zip: Add missing file comments.
------------------------------------------------------------------------
r5103 | marko | 2009-05-25 13:52:29 +0300 (Mon, 25 May 2009) | 10 lines
branches/zip: Add @file comments, and convert decorative
/*********************************
comments to Doxygen /** style like this:
/*****************************//**
This conversion was performed by the following command:
perl -i -e 'while(<ARGV>){if (m|^/\*{30}\**$|) {
s|\*{4}$|//**| if ++$com>1; $_ .= "\@file $ARGV\n" if $com==2}
print; if(eof){$.=0;undef $com}}' */*[ch] include/univ.i
------------------------------------------------------------------------
r5104 | marko | 2009-05-25 14:39:07 +0300 (Mon, 25 May 2009) | 2 lines
branches/zip: Revert ut0auxconf_* to r5102,
that is, make Doxygen ignore these test programs.
------------------------------------------------------------------------
r5105 | marko | 2009-05-25 14:52:20 +0300 (Mon, 25 May 2009) | 2 lines
branches/zip: Enclose some #error checks inside #ifndef DOXYGEN
to prevent bogus Doxygen errors.
------------------------------------------------------------------------
r5106 | marko | 2009-05-25 16:09:24 +0300 (Mon, 25 May 2009) | 2 lines
branches/zip: Add some Doxygen comments, mainly to structs, typedefs,
macros and global variables. Many more to go.
------------------------------------------------------------------------
r5108 | marko | 2009-05-26 00:32:35 +0300 (Tue, 26 May 2009) | 2 lines
branches/zip: lexyy.c: Remove the inadvertently added @file directive.
There is nothing for Doxygen to see in this file, move along.
------------------------------------------------------------------------
r5125 | marko | 2009-05-26 16:28:49 +0300 (Tue, 26 May 2009) | 3 lines
branches/zip: Add some Doxygen comments for many structs, typedefs,
#defines and global variables. Many are still missing.
------------------------------------------------------------------------
r5134 | marko | 2009-05-27 09:08:43 +0300 (Wed, 27 May 2009) | 1 line
branches/zip: Add some Doxygen @return comments.
------------------------------------------------------------------------
r5139 | marko | 2009-05-27 10:01:40 +0300 (Wed, 27 May 2009) | 1 line
branches/zip: Add Doxyfile.
------------------------------------------------------------------------
r5143 | marko | 2009-05-27 10:57:25 +0300 (Wed, 27 May 2009) | 3 lines
branches/zip: buf0buf.h, Doxyfile: Fix the Doxygen translation.
@defgroup is for source code modules, not for field groups.
Tell Doxygen to expand the UT_LIST declarations.
------------------------------------------------------------------------
69 lines
2.6 KiB
C
69 lines
2.6 KiB
C
/*****************************************************************************
|
|
|
|
Copyright (c) 2007, 2009, Innobase Oy. All Rights Reserved.
|
|
|
|
This program is free software; you can redistribute it and/or modify it under
|
|
the terms of the GNU General Public License as published by the Free Software
|
|
Foundation; version 2 of the License.
|
|
|
|
This program is distributed in the hope that it will be useful, but WITHOUT
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License along with
|
|
this program; if not, write to the Free Software Foundation, Inc., 59 Temple
|
|
Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*****************************************************************************/
|
|
|
|
/**************************************************//**
|
|
@file include/lock0iter.h
|
|
Lock queue iterator type and function prototypes.
|
|
|
|
Created July 16, 2007 Vasil Dimov
|
|
*******************************************************/
|
|
|
|
#ifndef lock0iter_h
|
|
#define lock0iter_h
|
|
|
|
#include "univ.i"
|
|
#include "lock0types.h"
|
|
|
|
typedef struct lock_queue_iterator_struct {
|
|
const lock_t* current_lock;
|
|
/* In case this is a record lock queue (not table lock queue)
|
|
then bit_no is the record number within the heap in which the
|
|
record is stored. */
|
|
ulint bit_no;
|
|
} lock_queue_iterator_t;
|
|
|
|
/*******************************************************************//**
|
|
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:
|
|
1. If the lock is a table lock, thus we have a table lock queue;
|
|
2. 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. */
|
|
UNIV_INTERN
|
|
void
|
|
lock_queue_iterator_reset(
|
|
/*======================*/
|
|
lock_queue_iterator_t* iter, /*!< out: iterator */
|
|
const lock_t* lock, /*!< in: lock to start from */
|
|
ulint bit_no);/*!< in: record number in the
|
|
heap */
|
|
|
|
/*******************************************************************//**
|
|
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).
|
|
@return previous lock or NULL */
|
|
|
|
const lock_t*
|
|
lock_queue_iterator_get_prev(
|
|
/*=========================*/
|
|
lock_queue_iterator_t* iter); /*!< in/out: iterator */
|
|
|
|
#endif /* lock0iter_h */
|