LCOV - code coverage report
Current view: top level - src/include/access - gin_private.h (source / functions) Hit Total Coverage
Test: PostgreSQL 13beta1 Lines: 8 8 100.0 %
Date: 2020-05-29 00:07:09 Functions: 1 1 100.0 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : /*--------------------------------------------------------------------------
       2             :  * gin_private.h
       3             :  *    header file for postgres inverted index access method implementation.
       4             :  *
       5             :  *  Copyright (c) 2006-2020, PostgreSQL Global Development Group
       6             :  *
       7             :  *  src/include/access/gin_private.h
       8             :  *--------------------------------------------------------------------------
       9             :  */
      10             : #ifndef GIN_PRIVATE_H
      11             : #define GIN_PRIVATE_H
      12             : 
      13             : #include "access/amapi.h"
      14             : #include "access/gin.h"
      15             : #include "access/ginblock.h"
      16             : #include "access/itup.h"
      17             : #include "catalog/pg_am_d.h"
      18             : #include "fmgr.h"
      19             : #include "lib/rbtree.h"
      20             : #include "storage/bufmgr.h"
      21             : 
      22             : /*
      23             :  * Storage type for GIN's reloptions
      24             :  */
      25             : typedef struct GinOptions
      26             : {
      27             :     int32       vl_len_;        /* varlena header (do not touch directly!) */
      28             :     bool        useFastUpdate;  /* use fast updates? */
      29             :     int         pendingListCleanupSize; /* maximum size of pending list */
      30             : } GinOptions;
      31             : 
      32             : #define GIN_DEFAULT_USE_FASTUPDATE  true
      33             : #define GinGetUseFastUpdate(relation) \
      34             :     (AssertMacro(relation->rd_rel->relkind == RELKIND_INDEX && \
      35             :                  relation->rd_rel->relam == GIN_AM_OID), \
      36             :      (relation)->rd_options ? \
      37             :      ((GinOptions *) (relation)->rd_options)->useFastUpdate : GIN_DEFAULT_USE_FASTUPDATE)
      38             : #define GinGetPendingListCleanupSize(relation) \
      39             :     (AssertMacro(relation->rd_rel->relkind == RELKIND_INDEX && \
      40             :                  relation->rd_rel->relam == GIN_AM_OID), \
      41             :      (relation)->rd_options && \
      42             :      ((GinOptions *) (relation)->rd_options)->pendingListCleanupSize != -1 ? \
      43             :      ((GinOptions *) (relation)->rd_options)->pendingListCleanupSize : \
      44             :      gin_pending_list_limit)
      45             : 
      46             : 
      47             : /* Macros for buffer lock/unlock operations */
      48             : #define GIN_UNLOCK  BUFFER_LOCK_UNLOCK
      49             : #define GIN_SHARE   BUFFER_LOCK_SHARE
      50             : #define GIN_EXCLUSIVE  BUFFER_LOCK_EXCLUSIVE
      51             : 
      52             : 
      53             : /*
      54             :  * GinState: working data structure describing the index being worked on
      55             :  */
      56             : typedef struct GinState
      57             : {
      58             :     Relation    index;
      59             :     bool        oneCol;         /* true if single-column index */
      60             : 
      61             :     /*
      62             :      * origTupdesc is the nominal tuple descriptor of the index, ie, the i'th
      63             :      * attribute shows the key type (not the input data type!) of the i'th
      64             :      * index column.  In a single-column index this describes the actual leaf
      65             :      * index tuples.  In a multi-column index, the actual leaf tuples contain
      66             :      * a smallint column number followed by a key datum of the appropriate
      67             :      * type for that column.  We set up tupdesc[i] to describe the actual
      68             :      * rowtype of the index tuples for the i'th column, ie, (int2, keytype).
      69             :      * Note that in any case, leaf tuples contain more data than is known to
      70             :      * the TupleDesc; see access/gin/README for details.
      71             :      */
      72             :     TupleDesc   origTupdesc;
      73             :     TupleDesc   tupdesc[INDEX_MAX_KEYS];
      74             : 
      75             :     /*
      76             :      * Per-index-column opclass support functions
      77             :      */
      78             :     FmgrInfo    compareFn[INDEX_MAX_KEYS];
      79             :     FmgrInfo    extractValueFn[INDEX_MAX_KEYS];
      80             :     FmgrInfo    extractQueryFn[INDEX_MAX_KEYS];
      81             :     FmgrInfo    consistentFn[INDEX_MAX_KEYS];
      82             :     FmgrInfo    triConsistentFn[INDEX_MAX_KEYS];
      83             :     FmgrInfo    comparePartialFn[INDEX_MAX_KEYS];   /* optional method */
      84             :     /* canPartialMatch[i] is true if comparePartialFn[i] is valid */
      85             :     bool        canPartialMatch[INDEX_MAX_KEYS];
      86             :     /* Collations to pass to the support functions */
      87             :     Oid         supportCollation[INDEX_MAX_KEYS];
      88             : } GinState;
      89             : 
      90             : 
      91             : /* ginutil.c */
      92             : extern bytea *ginoptions(Datum reloptions, bool validate);
      93             : extern void initGinState(GinState *state, Relation index);
      94             : extern Buffer GinNewBuffer(Relation index);
      95             : extern void GinInitBuffer(Buffer b, uint32 f);
      96             : extern void GinInitPage(Page page, uint32 f, Size pageSize);
      97             : extern void GinInitMetabuffer(Buffer b);
      98             : extern int  ginCompareEntries(GinState *ginstate, OffsetNumber attnum,
      99             :                               Datum a, GinNullCategory categorya,
     100             :                               Datum b, GinNullCategory categoryb);
     101             : extern int  ginCompareAttEntries(GinState *ginstate,
     102             :                                  OffsetNumber attnuma, Datum a, GinNullCategory categorya,
     103             :                                  OffsetNumber attnumb, Datum b, GinNullCategory categoryb);
     104             : extern Datum *ginExtractEntries(GinState *ginstate, OffsetNumber attnum,
     105             :                                 Datum value, bool isNull,
     106             :                                 int32 *nentries, GinNullCategory **categories);
     107             : 
     108             : extern OffsetNumber gintuple_get_attrnum(GinState *ginstate, IndexTuple tuple);
     109             : extern Datum gintuple_get_key(GinState *ginstate, IndexTuple tuple,
     110             :                               GinNullCategory *category);
     111             : 
     112             : /* gininsert.c */
     113             : extern IndexBuildResult *ginbuild(Relation heap, Relation index,
     114             :                                   struct IndexInfo *indexInfo);
     115             : extern void ginbuildempty(Relation index);
     116             : extern bool gininsert(Relation index, Datum *values, bool *isnull,
     117             :                       ItemPointer ht_ctid, Relation heapRel,
     118             :                       IndexUniqueCheck checkUnique,
     119             :                       struct IndexInfo *indexInfo);
     120             : extern void ginEntryInsert(GinState *ginstate,
     121             :                            OffsetNumber attnum, Datum key, GinNullCategory category,
     122             :                            ItemPointerData *items, uint32 nitem,
     123             :                            GinStatsData *buildStats);
     124             : 
     125             : /* ginbtree.c */
     126             : 
     127             : typedef struct GinBtreeStack
     128             : {
     129             :     BlockNumber blkno;
     130             :     Buffer      buffer;
     131             :     OffsetNumber off;
     132             :     ItemPointerData iptr;
     133             :     /* predictNumber contains predicted number of pages on current level */
     134             :     uint32      predictNumber;
     135             :     struct GinBtreeStack *parent;
     136             : } GinBtreeStack;
     137             : 
     138             : typedef struct GinBtreeData *GinBtree;
     139             : 
     140             : /* Return codes for GinBtreeData.beginPlaceToPage method */
     141             : typedef enum
     142             : {
     143             :     GPTP_NO_WORK,
     144             :     GPTP_INSERT,
     145             :     GPTP_SPLIT
     146             : } GinPlaceToPageRC;
     147             : 
     148             : typedef struct GinBtreeData
     149             : {
     150             :     /* search methods */
     151             :     BlockNumber (*findChildPage) (GinBtree, GinBtreeStack *);
     152             :     BlockNumber (*getLeftMostChild) (GinBtree, Page);
     153             :     bool        (*isMoveRight) (GinBtree, Page);
     154             :     bool        (*findItem) (GinBtree, GinBtreeStack *);
     155             : 
     156             :     /* insert methods */
     157             :     OffsetNumber (*findChildPtr) (GinBtree, Page, BlockNumber, OffsetNumber);
     158             :     GinPlaceToPageRC (*beginPlaceToPage) (GinBtree, Buffer, GinBtreeStack *, void *, BlockNumber, void **, Page *, Page *);
     159             :     void        (*execPlaceToPage) (GinBtree, Buffer, GinBtreeStack *, void *, BlockNumber, void *);
     160             :     void       *(*prepareDownlink) (GinBtree, Buffer);
     161             :     void        (*fillRoot) (GinBtree, Page, BlockNumber, Page, BlockNumber, Page);
     162             : 
     163             :     bool        isData;
     164             : 
     165             :     Relation    index;
     166             :     BlockNumber rootBlkno;
     167             :     GinState   *ginstate;       /* not valid in a data scan */
     168             :     bool        fullScan;
     169             :     bool        isBuild;
     170             : 
     171             :     /* Search key for Entry tree */
     172             :     OffsetNumber entryAttnum;
     173             :     Datum       entryKey;
     174             :     GinNullCategory entryCategory;
     175             : 
     176             :     /* Search key for data tree (posting tree) */
     177             :     ItemPointerData itemptr;
     178             : } GinBtreeData;
     179             : 
     180             : /* This represents a tuple to be inserted to entry tree. */
     181             : typedef struct
     182             : {
     183             :     IndexTuple  entry;          /* tuple to insert */
     184             :     bool        isDelete;       /* delete old tuple at same offset? */
     185             : } GinBtreeEntryInsertData;
     186             : 
     187             : /*
     188             :  * This represents an itempointer, or many itempointers, to be inserted to
     189             :  * a data (posting tree) leaf page
     190             :  */
     191             : typedef struct
     192             : {
     193             :     ItemPointerData *items;
     194             :     uint32      nitem;
     195             :     uint32      curitem;
     196             : } GinBtreeDataLeafInsertData;
     197             : 
     198             : /*
     199             :  * For internal data (posting tree) pages, the insertion payload is a
     200             :  * PostingItem
     201             :  */
     202             : 
     203             : extern GinBtreeStack *ginFindLeafPage(GinBtree btree, bool searchMode,
     204             :                                       bool rootConflictCheck, Snapshot snapshot);
     205             : extern Buffer ginStepRight(Buffer buffer, Relation index, int lockmode);
     206             : extern void freeGinBtreeStack(GinBtreeStack *stack);
     207             : extern void ginInsertValue(GinBtree btree, GinBtreeStack *stack,
     208             :                            void *insertdata, GinStatsData *buildStats);
     209             : 
     210             : /* ginentrypage.c */
     211             : extern IndexTuple GinFormTuple(GinState *ginstate,
     212             :                                OffsetNumber attnum, Datum key, GinNullCategory category,
     213             :                                Pointer data, Size dataSize, int nipd, bool errorTooBig);
     214             : extern void ginPrepareEntryScan(GinBtree btree, OffsetNumber attnum,
     215             :                                 Datum key, GinNullCategory category,
     216             :                                 GinState *ginstate);
     217             : extern void ginEntryFillRoot(GinBtree btree, Page root, BlockNumber lblkno, Page lpage, BlockNumber rblkno, Page rpage);
     218             : extern ItemPointer ginReadTuple(GinState *ginstate, OffsetNumber attnum,
     219             :                                 IndexTuple itup, int *nitems);
     220             : 
     221             : /* gindatapage.c */
     222             : extern ItemPointer GinDataLeafPageGetItems(Page page, int *nitems, ItemPointerData advancePast);
     223             : extern int  GinDataLeafPageGetItemsToTbm(Page page, TIDBitmap *tbm);
     224             : extern BlockNumber createPostingTree(Relation index,
     225             :                                      ItemPointerData *items, uint32 nitems,
     226             :                                      GinStatsData *buildStats, Buffer entrybuffer);
     227             : extern void GinDataPageAddPostingItem(Page page, PostingItem *data, OffsetNumber offset);
     228             : extern void GinPageDeletePostingItem(Page page, OffsetNumber offset);
     229             : extern void ginInsertItemPointers(Relation index, BlockNumber rootBlkno,
     230             :                                   ItemPointerData *items, uint32 nitem,
     231             :                                   GinStatsData *buildStats);
     232             : extern GinBtreeStack *ginScanBeginPostingTree(GinBtree btree, Relation index, BlockNumber rootBlkno, Snapshot snapshot);
     233             : extern void ginDataFillRoot(GinBtree btree, Page root, BlockNumber lblkno, Page lpage, BlockNumber rblkno, Page rpage);
     234             : 
     235             : /*
     236             :  * This is declared in ginvacuum.c, but is passed between ginVacuumItemPointers
     237             :  * and ginVacuumPostingTreeLeaf and as an opaque struct, so we need a forward
     238             :  * declaration for it.
     239             :  */
     240             : typedef struct GinVacuumState GinVacuumState;
     241             : 
     242             : extern void ginVacuumPostingTreeLeaf(Relation rel, Buffer buf, GinVacuumState *gvs);
     243             : 
     244             : /* ginscan.c */
     245             : 
     246             : /*
     247             :  * GinScanKeyData describes a single GIN index qualifier expression.
     248             :  *
     249             :  * From each qual expression, we extract one or more specific index search
     250             :  * conditions, which are represented by GinScanEntryData.  It's quite
     251             :  * possible for identical search conditions to be requested by more than
     252             :  * one qual expression, in which case we merge such conditions to have just
     253             :  * one unique GinScanEntry --- this is particularly important for efficiency
     254             :  * when dealing with full-index-scan entries.  So there can be multiple
     255             :  * GinScanKeyData.scanEntry pointers to the same GinScanEntryData.
     256             :  *
     257             :  * In each GinScanKeyData, nentries is the true number of entries, while
     258             :  * nuserentries is the number that extractQueryFn returned (which is what
     259             :  * we report to consistentFn).  The "user" entries must come first.
     260             :  */
     261             : typedef struct GinScanKeyData *GinScanKey;
     262             : 
     263             : typedef struct GinScanEntryData *GinScanEntry;
     264             : 
     265             : typedef struct GinScanKeyData
     266             : {
     267             :     /* Real number of entries in scanEntry[] (always > 0) */
     268             :     uint32      nentries;
     269             :     /* Number of entries that extractQueryFn and consistentFn know about */
     270             :     uint32      nuserentries;
     271             : 
     272             :     /* array of GinScanEntry pointers, one per extracted search condition */
     273             :     GinScanEntry *scanEntry;
     274             : 
     275             :     /*
     276             :      * At least one of the entries in requiredEntries must be present for a
     277             :      * tuple to match the overall qual.
     278             :      *
     279             :      * additionalEntries contains entries that are needed by the consistent
     280             :      * function to decide if an item matches, but are not sufficient to
     281             :      * satisfy the qual without entries from requiredEntries.
     282             :      */
     283             :     GinScanEntry *requiredEntries;
     284             :     int         nrequired;
     285             :     GinScanEntry *additionalEntries;
     286             :     int         nadditional;
     287             : 
     288             :     /* array of check flags, reported to consistentFn */
     289             :     GinTernaryValue *entryRes;
     290             :     bool        (*boolConsistentFn) (GinScanKey key);
     291             :     GinTernaryValue (*triConsistentFn) (GinScanKey key);
     292             :     FmgrInfo   *consistentFmgrInfo;
     293             :     FmgrInfo   *triConsistentFmgrInfo;
     294             :     Oid         collation;
     295             : 
     296             :     /* other data needed for calling consistentFn */
     297             :     Datum       query;
     298             :     /* NB: these three arrays have only nuserentries elements! */
     299             :     Datum      *queryValues;
     300             :     GinNullCategory *queryCategories;
     301             :     Pointer    *extra_data;
     302             :     StrategyNumber strategy;
     303             :     int32       searchMode;
     304             :     OffsetNumber attnum;
     305             : 
     306             :     /*
     307             :      * An excludeOnly scan key is not able to enumerate all matching tuples.
     308             :      * That is, to be semantically correct on its own, it would need to have a
     309             :      * GIN_CAT_EMPTY_QUERY scanEntry, but it doesn't.  Such a key can still be
     310             :      * used to filter tuples returned by other scan keys, so we will get the
     311             :      * right answers as long as there's at least one non-excludeOnly scan key
     312             :      * for each index attribute considered by the search.  For efficiency
     313             :      * reasons we don't want to have unnecessary GIN_CAT_EMPTY_QUERY entries,
     314             :      * so we will convert an excludeOnly scan key to non-excludeOnly (by
     315             :      * adding a GIN_CAT_EMPTY_QUERY scanEntry) only if there are no other
     316             :      * non-excludeOnly scan keys.
     317             :      */
     318             :     bool        excludeOnly;
     319             : 
     320             :     /*
     321             :      * Match status data.  curItem is the TID most recently tested (could be a
     322             :      * lossy-page pointer).  curItemMatches is true if it passes the
     323             :      * consistentFn test; if so, recheckCurItem is the recheck flag.
     324             :      * isFinished means that all the input entry streams are finished, so this
     325             :      * key cannot succeed for any later TIDs.
     326             :      */
     327             :     ItemPointerData curItem;
     328             :     bool        curItemMatches;
     329             :     bool        recheckCurItem;
     330             :     bool        isFinished;
     331             : }           GinScanKeyData;
     332             : 
     333             : typedef struct GinScanEntryData
     334             : {
     335             :     /* query key and other information from extractQueryFn */
     336             :     Datum       queryKey;
     337             :     GinNullCategory queryCategory;
     338             :     bool        isPartialMatch;
     339             :     Pointer     extra_data;
     340             :     StrategyNumber strategy;
     341             :     int32       searchMode;
     342             :     OffsetNumber attnum;
     343             : 
     344             :     /* Current page in posting tree */
     345             :     Buffer      buffer;
     346             : 
     347             :     /* current ItemPointer to heap */
     348             :     ItemPointerData curItem;
     349             : 
     350             :     /* for a partial-match or full-scan query, we accumulate all TIDs here */
     351             :     TIDBitmap  *matchBitmap;
     352             :     TBMIterator *matchIterator;
     353             :     TBMIterateResult *matchResult;
     354             : 
     355             :     /* used for Posting list and one page in Posting tree */
     356             :     ItemPointerData *list;
     357             :     int         nlist;
     358             :     OffsetNumber offset;
     359             : 
     360             :     bool        isFinished;
     361             :     bool        reduceResult;
     362             :     uint32      predictNumberResult;
     363             :     GinBtreeData btree;
     364             : }           GinScanEntryData;
     365             : 
     366             : typedef struct GinScanOpaqueData
     367             : {
     368             :     MemoryContext tempCtx;
     369             :     GinState    ginstate;
     370             : 
     371             :     GinScanKey  keys;           /* one per scan qualifier expr */
     372             :     uint32      nkeys;
     373             : 
     374             :     GinScanEntry *entries;      /* one per index search condition */
     375             :     uint32      totalentries;
     376             :     uint32      allocentries;   /* allocated length of entries[] */
     377             : 
     378             :     MemoryContext keyCtx;       /* used to hold key and entry data */
     379             : 
     380             :     bool        isVoidRes;      /* true if query is unsatisfiable */
     381             : } GinScanOpaqueData;
     382             : 
     383             : typedef GinScanOpaqueData *GinScanOpaque;
     384             : 
     385             : extern IndexScanDesc ginbeginscan(Relation rel, int nkeys, int norderbys);
     386             : extern void ginendscan(IndexScanDesc scan);
     387             : extern void ginrescan(IndexScanDesc scan, ScanKey key, int nscankeys,
     388             :                       ScanKey orderbys, int norderbys);
     389             : extern void ginNewScanKey(IndexScanDesc scan);
     390             : extern void ginFreeScanKeys(GinScanOpaque so);
     391             : 
     392             : /* ginget.c */
     393             : extern int64 gingetbitmap(IndexScanDesc scan, TIDBitmap *tbm);
     394             : 
     395             : /* ginlogic.c */
     396             : extern void ginInitConsistentFunction(GinState *ginstate, GinScanKey key);
     397             : 
     398             : /* ginvacuum.c */
     399             : extern IndexBulkDeleteResult *ginbulkdelete(IndexVacuumInfo *info,
     400             :                                             IndexBulkDeleteResult *stats,
     401             :                                             IndexBulkDeleteCallback callback,
     402             :                                             void *callback_state);
     403             : extern IndexBulkDeleteResult *ginvacuumcleanup(IndexVacuumInfo *info,
     404             :                                                IndexBulkDeleteResult *stats);
     405             : extern ItemPointer ginVacuumItemPointers(GinVacuumState *gvs,
     406             :                                          ItemPointerData *items, int nitem, int *nremaining);
     407             : 
     408             : /* ginvalidate.c */
     409             : extern bool ginvalidate(Oid opclassoid);
     410             : 
     411             : /* ginbulk.c */
     412             : typedef struct GinEntryAccumulator
     413             : {
     414             :     RBTNode     rbtnode;
     415             :     Datum       key;
     416             :     GinNullCategory category;
     417             :     OffsetNumber attnum;
     418             :     bool        shouldSort;
     419             :     ItemPointerData *list;
     420             :     uint32      maxcount;       /* allocated size of list[] */
     421             :     uint32      count;          /* current number of list[] entries */
     422             : } GinEntryAccumulator;
     423             : 
     424             : typedef struct
     425             : {
     426             :     GinState   *ginstate;
     427             :     Size        allocatedMemory;
     428             :     GinEntryAccumulator *entryallocator;
     429             :     uint32      eas_used;
     430             :     RBTree     *tree;
     431             :     RBTreeIterator tree_walk;
     432             : } BuildAccumulator;
     433             : 
     434             : extern void ginInitBA(BuildAccumulator *accum);
     435             : extern void ginInsertBAEntries(BuildAccumulator *accum,
     436             :                                ItemPointer heapptr, OffsetNumber attnum,
     437             :                                Datum *entries, GinNullCategory *categories,
     438             :                                int32 nentries);
     439             : extern void ginBeginBAScan(BuildAccumulator *accum);
     440             : extern ItemPointerData *ginGetBAEntry(BuildAccumulator *accum,
     441             :                                       OffsetNumber *attnum, Datum *key, GinNullCategory *category,
     442             :                                       uint32 *n);
     443             : 
     444             : /* ginfast.c */
     445             : 
     446             : typedef struct GinTupleCollector
     447             : {
     448             :     IndexTuple *tuples;
     449             :     uint32      ntuples;
     450             :     uint32      lentuples;
     451             :     uint32      sumsize;
     452             : } GinTupleCollector;
     453             : 
     454             : extern void ginHeapTupleFastInsert(GinState *ginstate,
     455             :                                    GinTupleCollector *collector);
     456             : extern void ginHeapTupleFastCollect(GinState *ginstate,
     457             :                                     GinTupleCollector *collector,
     458             :                                     OffsetNumber attnum, Datum value, bool isNull,
     459             :                                     ItemPointer ht_ctid);
     460             : extern void ginInsertCleanup(GinState *ginstate, bool full_clean,
     461             :                              bool fill_fsm, bool forceCleanup, IndexBulkDeleteResult *stats);
     462             : 
     463             : /* ginpostinglist.c */
     464             : 
     465             : extern GinPostingList *ginCompressPostingList(const ItemPointer ipd, int nipd,
     466             :                                               int maxsize, int *nwritten);
     467             : extern int  ginPostingListDecodeAllSegmentsToTbm(GinPostingList *ptr, int totalsize, TIDBitmap *tbm);
     468             : 
     469             : extern ItemPointer ginPostingListDecodeAllSegments(GinPostingList *ptr, int len, int *ndecoded);
     470             : extern ItemPointer ginPostingListDecode(GinPostingList *ptr, int *ndecoded);
     471             : extern ItemPointer ginMergeItemPointers(ItemPointerData *a, uint32 na,
     472             :                                         ItemPointerData *b, uint32 nb,
     473             :                                         int *nmerged);
     474             : 
     475             : /*
     476             :  * Merging the results of several gin scans compares item pointers a lot,
     477             :  * so we want this to be inlined.
     478             :  */
     479             : static inline int
     480     7238214 : ginCompareItemPointers(ItemPointer a, ItemPointer b)
     481             : {
     482     7238214 :     uint64      ia = (uint64) GinItemPointerGetBlockNumber(a) << 32 | GinItemPointerGetOffsetNumber(a);
     483     7238214 :     uint64      ib = (uint64) GinItemPointerGetBlockNumber(b) << 32 | GinItemPointerGetOffsetNumber(b);
     484             : 
     485     7238214 :     if (ia == ib)
     486     1772280 :         return 0;
     487     5465934 :     else if (ia > ib)
     488     1821262 :         return 1;
     489             :     else
     490     3644672 :         return -1;
     491             : }
     492             : 
     493             : extern int  ginTraverseLock(Buffer buffer, bool searchMode);
     494             : 
     495             : #endif                          /* GIN_PRIVATE_H */

Generated by: LCOV version 1.13