PostgreSQL Source Code  git master
ginutil.c File Reference
#include "postgres.h"
#include "access/gin_private.h"
#include "access/ginxlog.h"
#include "access/reloptions.h"
#include "access/xloginsert.h"
#include "catalog/pg_collation.h"
#include "catalog/pg_type.h"
#include "miscadmin.h"
#include "storage/indexfsm.h"
#include "storage/lmgr.h"
#include "storage/predicate.h"
#include "utils/builtins.h"
#include "utils/index_selfuncs.h"
#include "utils/typcache.h"
Include dependency graph for ginutil.c:

Go to the source code of this file.

Data Structures

struct  keyEntryData
 
struct  cmpEntriesArg
 

Functions

Datum ginhandler (PG_FUNCTION_ARGS)
 
void initGinState (GinState *state, Relation index)
 
OffsetNumber gintuple_get_attrnum (GinState *ginstate, IndexTuple tuple)
 
Datum gintuple_get_key (GinState *ginstate, IndexTuple tuple, GinNullCategory *category)
 
Buffer GinNewBuffer (Relation index)
 
void GinInitPage (Page page, uint32 f, Size pageSize)
 
void GinInitBuffer (Buffer b, uint32 f)
 
void GinInitMetabuffer (Buffer b)
 
int ginCompareEntries (GinState *ginstate, OffsetNumber attnum, Datum a, GinNullCategory categorya, Datum b, GinNullCategory categoryb)
 
int ginCompareAttEntries (GinState *ginstate, OffsetNumber attnuma, Datum a, GinNullCategory categorya, OffsetNumber attnumb, Datum b, GinNullCategory categoryb)
 
static int cmpEntries (const void *a, const void *b, void *arg)
 
DatumginExtractEntries (GinState *ginstate, OffsetNumber attnum, Datum value, bool isNull, int32 *nentries, GinNullCategory **categories)
 
byteaginoptions (Datum reloptions, bool validate)
 
void ginGetStats (Relation index, GinStatsData *stats)
 
void ginUpdateStats (Relation index, const GinStatsData *stats)
 
void GinCheckForSerializableConflictIn (Relation relation, HeapTuple tuple, Buffer buffer)
 

Function Documentation

◆ cmpEntries()

static int cmpEntries ( const void *  a,
const void *  b,
void *  arg 
)
static

Definition at line 448 of file ginutil.c.

References cmpEntriesArg::cmpDatumFunc, cmpEntriesArg::collation, keyEntryData::datum, DatumGetInt32, FunctionCall2Coll(), cmpEntriesArg::haveDups, and keyEntryData::isnull.

Referenced by ginExtractEntries().

449 {
450  const keyEntryData *aa = (const keyEntryData *) a;
451  const keyEntryData *bb = (const keyEntryData *) b;
452  cmpEntriesArg *data = (cmpEntriesArg *) arg;
453  int res;
454 
455  if (aa->isnull)
456  {
457  if (bb->isnull)
458  res = 0; /* NULL "=" NULL */
459  else
460  res = 1; /* NULL ">" not-NULL */
461  }
462  else if (bb->isnull)
463  res = -1; /* not-NULL "<" NULL */
464  else
466  data->collation,
467  aa->datum, bb->datum));
468 
469  /*
470  * Detect if we have any duplicates. If there are equal keys, qsort must
471  * compare them at some point, else it wouldn't know whether one should go
472  * before or after the other.
473  */
474  if (res == 0)
475  data->haveDups = true;
476 
477  return res;
478 }
FmgrInfo * cmpDatumFunc
Definition: ginutil.c:442
#define DatumGetInt32(X)
Definition: postgres.h:455
bool isnull
Definition: ginutil.c:437
Datum FunctionCall2Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2)
Definition: fmgr.c:1132
Datum datum
Definition: ginutil.c:436
bool haveDups
Definition: ginutil.c:444
Oid collation
Definition: ginutil.c:443
void * arg

◆ GinCheckForSerializableConflictIn()

void GinCheckForSerializableConflictIn ( Relation  relation,
HeapTuple  tuple,
Buffer  buffer 
)

Definition at line 723 of file ginutil.c.

References CheckForSerializableConflictIn(), and GinGetUseFastUpdate.

Referenced by ginEntryInsert(), and ginInsertItemPointers().

724 {
725  if (!GinGetUseFastUpdate(relation))
726  CheckForSerializableConflictIn(relation, tuple, buffer);
727 }
void CheckForSerializableConflictIn(Relation relation, HeapTuple tuple, Buffer buffer)
Definition: predicate.c:4280
WalTimeSample buffer[LAG_TRACKER_BUFFER_SIZE]
Definition: walsender.c:215
#define GinGetUseFastUpdate(relation)
Definition: gin_private.h:32

◆ ginCompareAttEntries()

int ginCompareAttEntries ( GinState ginstate,
OffsetNumber  attnuma,
Datum  a,
GinNullCategory  categorya,
OffsetNumber  attnumb,
Datum  b,
GinNullCategory  categoryb 
)

Definition at line 415 of file ginutil.c.

References ginCompareEntries().

Referenced by cmpEntryAccumulator(), entryIsMoveRight(), entryLocateEntry(), and entryLocateLeafEntry().

418 {
419  /* attribute number is the first sort key */
420  if (attnuma != attnumb)
421  return (attnuma < attnumb) ? -1 : 1;
422 
423  return ginCompareEntries(ginstate, attnuma, a, categorya, b, categoryb);
424 }
int ginCompareEntries(GinState *ginstate, OffsetNumber attnum, Datum a, GinNullCategory categorya, Datum b, GinNullCategory categoryb)
Definition: ginutil.c:393

◆ ginCompareEntries()

int ginCompareEntries ( GinState ginstate,
OffsetNumber  attnum,
Datum  a,
GinNullCategory  categorya,
Datum  b,
GinNullCategory  categoryb 
)

Definition at line 393 of file ginutil.c.

References GinState::compareFn, DatumGetInt32, FunctionCall2Coll(), GIN_CAT_NORM_KEY, and GinState::supportCollation.

Referenced by collectMatchBitmap(), collectMatchesForHeapRow(), ginCompareAttEntries(), and ginFillScanEntry().

396 {
397  /* if not of same null category, sort by that first */
398  if (categorya != categoryb)
399  return (categorya < categoryb) ? -1 : 1;
400 
401  /* all null items in same category are equal */
402  if (categorya != GIN_CAT_NORM_KEY)
403  return 0;
404 
405  /* both not null, so safe to call the compareFn */
406  return DatumGetInt32(FunctionCall2Coll(&ginstate->compareFn[attnum - 1],
407  ginstate->supportCollation[attnum - 1],
408  a, b));
409 }
Oid supportCollation[INDEX_MAX_KEYS]
Definition: gin_private.h:82
#define DatumGetInt32(X)
Definition: postgres.h:455
Datum FunctionCall2Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2)
Definition: fmgr.c:1132
#define GIN_CAT_NORM_KEY
Definition: ginblock.h:202
int16 attnum
Definition: pg_attribute.h:79
FmgrInfo compareFn[INDEX_MAX_KEYS]
Definition: gin_private.h:73

◆ ginExtractEntries()

Datum* ginExtractEntries ( GinState ginstate,
OffsetNumber  attnum,
Datum  value,
bool  isNull,
int32 nentries,
GinNullCategory **  categories 
)

Definition at line 488 of file ginutil.c.

References arg, cmpEntriesArg::cmpDatumFunc, cmpEntries(), cmpEntriesArg::collation, GinState::compareFn, keyEntryData::datum, DatumGetPointer, GinState::extractValueFn, FunctionCall3Coll(), GIN_CAT_EMPTY_ITEM, GIN_CAT_NORM_KEY, GIN_CAT_NULL_ITEM, GIN_CAT_NULL_KEY, cmpEntriesArg::haveDups, i, keyEntryData::isnull, palloc(), palloc0(), pfree(), PointerGetDatum, qsort_arg(), and GinState::supportCollation.

Referenced by ginHeapTupleBulkInsert(), ginHeapTupleFastCollect(), and ginHeapTupleInsert().

491 {
492  Datum *entries;
493  bool *nullFlags;
494  int32 i;
495 
496  /*
497  * We don't call the extractValueFn on a null item. Instead generate a
498  * placeholder.
499  */
500  if (isNull)
501  {
502  *nentries = 1;
503  entries = (Datum *) palloc(sizeof(Datum));
504  entries[0] = (Datum) 0;
505  *categories = (GinNullCategory *) palloc(sizeof(GinNullCategory));
506  (*categories)[0] = GIN_CAT_NULL_ITEM;
507  return entries;
508  }
509 
510  /* OK, call the opclass's extractValueFn */
511  nullFlags = NULL; /* in case extractValue doesn't set it */
512  entries = (Datum *)
514  ginstate->supportCollation[attnum - 1],
515  value,
516  PointerGetDatum(nentries),
517  PointerGetDatum(&nullFlags)));
518 
519  /*
520  * Generate a placeholder if the item contained no keys.
521  */
522  if (entries == NULL || *nentries <= 0)
523  {
524  *nentries = 1;
525  entries = (Datum *) palloc(sizeof(Datum));
526  entries[0] = (Datum) 0;
527  *categories = (GinNullCategory *) palloc(sizeof(GinNullCategory));
528  (*categories)[0] = GIN_CAT_EMPTY_ITEM;
529  return entries;
530  }
531 
532  /*
533  * If the extractValueFn didn't create a nullFlags array, create one,
534  * assuming that everything's non-null.
535  */
536  if (nullFlags == NULL)
537  nullFlags = (bool *) palloc0(*nentries * sizeof(bool));
538 
539  /*
540  * If there's more than one key, sort and unique-ify.
541  *
542  * XXX Using qsort here is notationally painful, and the overhead is
543  * pretty bad too. For small numbers of keys it'd likely be better to use
544  * a simple insertion sort.
545  */
546  if (*nentries > 1)
547  {
548  keyEntryData *keydata;
550 
551  keydata = (keyEntryData *) palloc(*nentries * sizeof(keyEntryData));
552  for (i = 0; i < *nentries; i++)
553  {
554  keydata[i].datum = entries[i];
555  keydata[i].isnull = nullFlags[i];
556  }
557 
558  arg.cmpDatumFunc = &ginstate->compareFn[attnum - 1];
559  arg.collation = ginstate->supportCollation[attnum - 1];
560  arg.haveDups = false;
561  qsort_arg(keydata, *nentries, sizeof(keyEntryData),
562  cmpEntries, (void *) &arg);
563 
564  if (arg.haveDups)
565  {
566  /* there are duplicates, must get rid of 'em */
567  int32 j;
568 
569  entries[0] = keydata[0].datum;
570  nullFlags[0] = keydata[0].isnull;
571  j = 1;
572  for (i = 1; i < *nentries; i++)
573  {
574  if (cmpEntries(&keydata[i - 1], &keydata[i], &arg) != 0)
575  {
576  entries[j] = keydata[i].datum;
577  nullFlags[j] = keydata[i].isnull;
578  j++;
579  }
580  }
581  *nentries = j;
582  }
583  else
584  {
585  /* easy, no duplicates */
586  for (i = 0; i < *nentries; i++)
587  {
588  entries[i] = keydata[i].datum;
589  nullFlags[i] = keydata[i].isnull;
590  }
591  }
592 
593  pfree(keydata);
594  }
595 
596  /*
597  * Create GinNullCategory representation from nullFlags.
598  */
599  *categories = (GinNullCategory *) palloc0(*nentries * sizeof(GinNullCategory));
600  for (i = 0; i < *nentries; i++)
601  (*categories)[i] = (nullFlags[i] ? GIN_CAT_NULL_KEY : GIN_CAT_NORM_KEY);
602 
603  return entries;
604 }
Oid supportCollation[INDEX_MAX_KEYS]
Definition: gin_private.h:82
FmgrInfo * cmpDatumFunc
Definition: ginutil.c:442
bool isnull
Definition: ginutil.c:437
#define PointerGetDatum(X)
Definition: postgres.h:539
FmgrInfo extractValueFn[INDEX_MAX_KEYS]
Definition: gin_private.h:74
Datum datum
Definition: ginutil.c:436
signed int int32
Definition: c.h:313
void pfree(void *pointer)
Definition: mcxt.c:1031
signed char GinNullCategory
Definition: ginblock.h:200
bool haveDups
Definition: ginutil.c:444
#define GIN_CAT_NORM_KEY
Definition: ginblock.h:202
void qsort_arg(void *base, size_t nel, size_t elsize, qsort_arg_comparator cmp, void *arg)
Definition: qsort_arg.c:113
#define GIN_CAT_NULL_KEY
Definition: ginblock.h:203
void * palloc0(Size size)
Definition: mcxt.c:955
uintptr_t Datum
Definition: postgres.h:365
#define GIN_CAT_NULL_ITEM
Definition: ginblock.h:205
static struct @131 value
int16 attnum
Definition: pg_attribute.h:79
Datum FunctionCall3Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2, Datum arg3)
Definition: fmgr.c:1154
Oid collation
Definition: ginutil.c:443
#define DatumGetPointer(X)
Definition: postgres.h:532
void * palloc(Size size)
Definition: mcxt.c:924
int i
void * arg
#define GIN_CAT_EMPTY_ITEM
Definition: ginblock.h:204
static int cmpEntries(const void *a, const void *b, void *arg)
Definition: ginutil.c:448
FmgrInfo compareFn[INDEX_MAX_KEYS]
Definition: gin_private.h:73

◆ ginGetStats()

void ginGetStats ( Relation  index,
GinStatsData stats 
)

Definition at line 642 of file ginutil.c.

References BufferGetPage, GIN_METAPAGE_BLKNO, GIN_SHARE, GinPageGetMeta, GinStatsData::ginVersion, GinMetaPageData::ginVersion, LockBuffer(), GinStatsData::nDataPages, GinMetaPageData::nDataPages, GinStatsData::nEntries, GinMetaPageData::nEntries, GinStatsData::nEntryPages, GinMetaPageData::nEntryPages, GinStatsData::nPendingPages, GinMetaPageData::nPendingPages, GinStatsData::nTotalPages, GinMetaPageData::nTotalPages, ReadBuffer(), and UnlockReleaseBuffer().

Referenced by gincostestimate(), gininsert(), and ginNewScanKey().

643 {
644  Buffer metabuffer;
645  Page metapage;
646  GinMetaPageData *metadata;
647 
648  metabuffer = ReadBuffer(index, GIN_METAPAGE_BLKNO);
649  LockBuffer(metabuffer, GIN_SHARE);
650  metapage = BufferGetPage(metabuffer);
651  metadata = GinPageGetMeta(metapage);
652 
653  stats->nPendingPages = metadata->nPendingPages;
654  stats->nTotalPages = metadata->nTotalPages;
655  stats->nEntryPages = metadata->nEntryPages;
656  stats->nDataPages = metadata->nDataPages;
657  stats->nEntries = metadata->nEntries;
658  stats->ginVersion = metadata->ginVersion;
659 
660  UnlockReleaseBuffer(metabuffer);
661 }
BlockNumber nEntryPages
Definition: ginblock.h:79
BlockNumber nEntryPages
Definition: gin.h:45
int64 nEntries
Definition: gin.h:47
BlockNumber nTotalPages
Definition: ginblock.h:78
#define GIN_METAPAGE_BLKNO
Definition: ginblock.h:50
int64 nEntries
Definition: ginblock.h:81
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3332
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define GIN_SHARE
Definition: gin_private.h:44
BlockNumber nPendingPages
Definition: gin.h:43
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
BlockNumber nDataPages
Definition: gin.h:46
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
BlockNumber nTotalPages
Definition: gin.h:44
int32 ginVersion
Definition: ginblock.h:98
int32 ginVersion
Definition: gin.h:48
BlockNumber nDataPages
Definition: ginblock.h:80
#define GinPageGetMeta(p)
Definition: ginblock.h:103
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:74
BlockNumber nPendingPages
Definition: ginblock.h:72

◆ ginhandler()

Datum ginhandler ( PG_FUNCTION_ARGS  )

Definition at line 37 of file ginutil.c.

References IndexAmRoutine::ambeginscan, IndexAmRoutine::ambuild, IndexAmRoutine::ambuildempty, IndexAmRoutine::ambulkdelete, IndexAmRoutine::amcanbackward, IndexAmRoutine::amcaninclude, IndexAmRoutine::amcanmulticol, IndexAmRoutine::amcanorder, IndexAmRoutine::amcanorderbyop, IndexAmRoutine::amcanparallel, IndexAmRoutine::amcanreturn, IndexAmRoutine::amcanunique, IndexAmRoutine::amclusterable, IndexAmRoutine::amcostestimate, IndexAmRoutine::amendscan, IndexAmRoutine::amestimateparallelscan, IndexAmRoutine::amgetbitmap, IndexAmRoutine::amgettuple, IndexAmRoutine::aminitparallelscan, IndexAmRoutine::aminsert, IndexAmRoutine::amkeytype, IndexAmRoutine::ammarkpos, IndexAmRoutine::amoptionalkey, IndexAmRoutine::amoptions, IndexAmRoutine::amparallelrescan, IndexAmRoutine::ampredlocks, IndexAmRoutine::amproperty, IndexAmRoutine::amrescan, IndexAmRoutine::amrestrpos, IndexAmRoutine::amsearcharray, IndexAmRoutine::amsearchnulls, IndexAmRoutine::amstorage, IndexAmRoutine::amstrategies, IndexAmRoutine::amsupport, IndexAmRoutine::amvacuumcleanup, IndexAmRoutine::amvalidate, ginbeginscan(), ginbuild(), ginbuildempty(), ginbulkdelete(), gincostestimate(), ginendscan(), gingetbitmap(), gininsert(), GINNProcs, ginoptions(), ginrescan(), ginvacuumcleanup(), ginvalidate(), InvalidOid, makeNode, and PG_RETURN_POINTER.

38 {
40 
41  amroutine->amstrategies = 0;
42  amroutine->amsupport = GINNProcs;
43  amroutine->amcanorder = false;
44  amroutine->amcanorderbyop = false;
45  amroutine->amcanbackward = false;
46  amroutine->amcanunique = false;
47  amroutine->amcanmulticol = true;
48  amroutine->amoptionalkey = true;
49  amroutine->amsearcharray = false;
50  amroutine->amsearchnulls = false;
51  amroutine->amstorage = true;
52  amroutine->amclusterable = false;
53  amroutine->ampredlocks = true;
54  amroutine->amcanparallel = false;
55  amroutine->amcaninclude = false;
56  amroutine->amkeytype = InvalidOid;
57 
58  amroutine->ambuild = ginbuild;
59  amroutine->ambuildempty = ginbuildempty;
60  amroutine->aminsert = gininsert;
61  amroutine->ambulkdelete = ginbulkdelete;
62  amroutine->amvacuumcleanup = ginvacuumcleanup;
63  amroutine->amcanreturn = NULL;
64  amroutine->amcostestimate = gincostestimate;
65  amroutine->amoptions = ginoptions;
66  amroutine->amproperty = NULL;
67  amroutine->amvalidate = ginvalidate;
68  amroutine->ambeginscan = ginbeginscan;
69  amroutine->amrescan = ginrescan;
70  amroutine->amgettuple = NULL;
71  amroutine->amgetbitmap = gingetbitmap;
72  amroutine->amendscan = ginendscan;
73  amroutine->ammarkpos = NULL;
74  amroutine->amrestrpos = NULL;
75  amroutine->amestimateparallelscan = NULL;
76  amroutine->aminitparallelscan = NULL;
77  amroutine->amparallelrescan = NULL;
78 
79  PG_RETURN_POINTER(amroutine);
80 }
ambeginscan_function ambeginscan
Definition: amapi.h:217
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:326
IndexBulkDeleteResult * ginvacuumcleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
Definition: ginvacuum.c:675
IndexScanDesc ginbeginscan(Relation rel, int nkeys, int norderbys)
Definition: ginscan.c:25
int64 gingetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
Definition: ginget.c:1857
void ginendscan(IndexScanDesc scan)
Definition: ginscan.c:429
ambulkdelete_function ambulkdelete
Definition: amapi.h:210
void ginrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
Definition: ginscan.c:413
bool amcanmulticol
Definition: amapi.h:180
uint16 amsupport
Definition: amapi.h:170
amgettuple_function amgettuple
Definition: amapi.h:219
void gincostestimate(PlannerInfo *root, IndexPath *path, double loop_count, Cost *indexStartupCost, Cost *indexTotalCost, Selectivity *indexSelectivity, double *indexCorrelation, double *indexPages)
Definition: selfuncs.c:7699
bool amcanorderbyop
Definition: amapi.h:174
amproperty_function amproperty
Definition: amapi.h:215
amparallelrescan_function amparallelrescan
Definition: amapi.h:228
bool amstorage
Definition: amapi.h:188
bool ampredlocks
Definition: amapi.h:192
void ginbuildempty(Relation index)
Definition: gininsert.c:437
aminsert_function aminsert
Definition: amapi.h:209
Oid amkeytype
Definition: amapi.h:198
bool amoptionalkey
Definition: amapi.h:182
amvalidate_function amvalidate
Definition: amapi.h:216
amgetbitmap_function amgetbitmap
Definition: amapi.h:220
IndexBuildResult * ginbuild(Relation heap, Relation index, IndexInfo *indexInfo)
Definition: gininsert.c:315
ambuild_function ambuild
Definition: amapi.h:207
amoptions_function amoptions
Definition: amapi.h:214
bool ginvalidate(Oid opclassoid)
Definition: ginvalidate.c:34
bool amcaninclude
Definition: amapi.h:196
amcostestimate_function amcostestimate
Definition: amapi.h:213
bool gininsert(Relation index, Datum *values, bool *isnull, ItemPointer ht_ctid, Relation heapRel, IndexUniqueCheck checkUnique, IndexInfo *indexInfo)
Definition: gininsert.c:488
bool amcanunique
Definition: amapi.h:178
amvacuumcleanup_function amvacuumcleanup
Definition: amapi.h:211
amendscan_function amendscan
Definition: amapi.h:221
bool amcanbackward
Definition: amapi.h:176
#define GINNProcs
Definition: gin.h:28
amrescan_function amrescan
Definition: amapi.h:218
bool amcanparallel
Definition: amapi.h:194
bytea * ginoptions(Datum reloptions, bool validate)
Definition: ginutil.c:607
bool amsearchnulls
Definition: amapi.h:186
bool amclusterable
Definition: amapi.h:190
bool amsearcharray
Definition: amapi.h:184
#define InvalidOid
Definition: postgres_ext.h:36
#define makeNode(_type_)
Definition: nodes.h:565
IndexBulkDeleteResult * ginbulkdelete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: ginvacuum.c:552
ammarkpos_function ammarkpos
Definition: amapi.h:222
bool amcanorder
Definition: amapi.h:172
amestimateparallelscan_function amestimateparallelscan
Definition: amapi.h:226
uint16 amstrategies
Definition: amapi.h:168
ambuildempty_function ambuildempty
Definition: amapi.h:208
amcanreturn_function amcanreturn
Definition: amapi.h:212
aminitparallelscan_function aminitparallelscan
Definition: amapi.h:227
amrestrpos_function amrestrpos
Definition: amapi.h:223

◆ GinInitBuffer()

void GinInitBuffer ( Buffer  b,
uint32  f 
)

Definition at line 355 of file ginutil.c.

References BufferGetPage, BufferGetPageSize, and GinInitPage().

Referenced by ginbuild(), ginbuildempty(), ginRedoCreateIndex(), ginRedoCreatePTree(), ginRedoDeleteListPages(), ginRedoInsertListPage(), and writeListPage().

356 {
358 }
void GinInitPage(Page page, uint32 f, Size pageSize)
Definition: ginutil.c:342
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define BufferGetPageSize(buffer)
Definition: bufmgr.h:147

◆ GinInitMetabuffer()

void GinInitMetabuffer ( Buffer  b)

Definition at line 361 of file ginutil.c.

References BufferGetPage, BufferGetPageSize, GIN_CURRENT_VERSION, GIN_META, GinInitPage(), GinPageGetMeta, GinMetaPageData::ginVersion, GinMetaPageData::head, InvalidBlockNumber, GinMetaPageData::nDataPages, GinMetaPageData::nEntries, GinMetaPageData::nEntryPages, GinMetaPageData::nPendingHeapTuples, GinMetaPageData::nPendingPages, GinMetaPageData::nTotalPages, GinMetaPageData::tail, and GinMetaPageData::tailFreeSize.

Referenced by ginbuild(), ginbuildempty(), ginRedoCreateIndex(), ginRedoDeleteListPages(), and ginRedoUpdateMetapage().

362 {
363  GinMetaPageData *metadata;
364  Page page = BufferGetPage(b);
365 
367 
368  metadata = GinPageGetMeta(page);
369 
370  metadata->head = metadata->tail = InvalidBlockNumber;
371  metadata->tailFreeSize = 0;
372  metadata->nPendingPages = 0;
373  metadata->nPendingHeapTuples = 0;
374  metadata->nTotalPages = 0;
375  metadata->nEntryPages = 0;
376  metadata->nDataPages = 0;
377  metadata->nEntries = 0;
378  metadata->ginVersion = GIN_CURRENT_VERSION;
379 
380  /*
381  * Set pd_lower just past the end of the metadata. This is essential,
382  * because without doing so, metadata will be lost if xlog.c compresses
383  * the page.
384  */
385  ((PageHeader) page)->pd_lower =
386  ((char *) metadata + sizeof(GinMetaPageData)) - (char *) page;
387 }
BlockNumber nEntryPages
Definition: ginblock.h:79
void GinInitPage(Page page, uint32 f, Size pageSize)
Definition: ginutil.c:342
BlockNumber nTotalPages
Definition: ginblock.h:78
int64 nEntries
Definition: ginblock.h:81
int64 nPendingHeapTuples
Definition: ginblock.h:73
#define GIN_META
Definition: ginblock.h:42
BlockNumber head
Definition: ginblock.h:60
BlockNumber tail
Definition: ginblock.h:61
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define BufferGetPageSize(buffer)
Definition: bufmgr.h:147
PageHeaderData * PageHeader
Definition: bufpage.h:162
uint32 tailFreeSize
Definition: ginblock.h:66
#define GIN_CURRENT_VERSION
Definition: ginblock.h:101
#define InvalidBlockNumber
Definition: block.h:33
int32 ginVersion
Definition: ginblock.h:98
BlockNumber nDataPages
Definition: ginblock.h:80
#define GinPageGetMeta(p)
Definition: ginblock.h:103
Pointer Page
Definition: bufpage.h:74
BlockNumber nPendingPages
Definition: ginblock.h:72

◆ GinInitPage()

void GinInitPage ( Page  page,
uint32  f,
Size  pageSize 
)

Definition at line 342 of file ginutil.c.

References GinPageOpaqueData::flags, GinPageGetOpaque, InvalidBlockNumber, PageInit(), and GinPageOpaqueData::rightlink.

Referenced by createPostingTree(), dataPlaceToPageLeafSplit(), dataSplitPageInternal(), entrySplitPage(), GinInitBuffer(), GinInitMetabuffer(), and ginPlaceToPage().

343 {
344  GinPageOpaque opaque;
345 
346  PageInit(page, pageSize, sizeof(GinPageOpaqueData));
347 
348  opaque = GinPageGetOpaque(page);
349  memset(opaque, 0, sizeof(GinPageOpaqueData));
350  opaque->flags = f;
351  opaque->rightlink = InvalidBlockNumber;
352 }
BlockNumber rightlink
Definition: ginblock.h:30
#define GinPageGetOpaque(page)
Definition: ginblock.h:109
#define InvalidBlockNumber
Definition: block.h:33
void PageInit(Page page, Size pageSize, Size specialSize)
Definition: bufpage.c:41

◆ GinNewBuffer()

Buffer GinNewBuffer ( Relation  index)

Definition at line 291 of file ginutil.c.

References buffer, BufferGetPage, ConditionalLockBuffer(), ExclusiveLock, GetFreeIndexPage(), GIN_EXCLUSIVE, GIN_UNLOCK, GinPageIsDeleted, InvalidBlockNumber, LockBuffer(), LockRelationForExtension(), P_NEW, PageIsNew, ReadBuffer(), RELATION_IS_LOCAL, ReleaseBuffer(), and UnlockRelationForExtension().

Referenced by createPostingTree(), ginbuild(), ginPlaceToPage(), and makeSublist().

292 {
293  Buffer buffer;
294  bool needLock;
295 
296  /* First, try to get a page from FSM */
297  for (;;)
298  {
299  BlockNumber blkno = GetFreeIndexPage(index);
300 
301  if (blkno == InvalidBlockNumber)
302  break;
303 
304  buffer = ReadBuffer(index, blkno);
305 
306  /*
307  * We have to guard against the possibility that someone else already
308  * recycled this page; the buffer may be locked if so.
309  */
310  if (ConditionalLockBuffer(buffer))
311  {
312  Page page = BufferGetPage(buffer);
313 
314  if (PageIsNew(page))
315  return buffer; /* OK to use, if never initialized */
316 
317  if (GinPageIsDeleted(page))
318  return buffer; /* OK to use */
319 
320  LockBuffer(buffer, GIN_UNLOCK);
321  }
322 
323  /* Can't use it, so release buffer and try again */
324  ReleaseBuffer(buffer);
325  }
326 
327  /* Must extend the file */
328  needLock = !RELATION_IS_LOCAL(index);
329  if (needLock)
331 
332  buffer = ReadBuffer(index, P_NEW);
333  LockBuffer(buffer, GIN_EXCLUSIVE);
334 
335  if (needLock)
337 
338  return buffer;
339 }
#define GIN_UNLOCK
Definition: gin_private.h:43
#define ExclusiveLock
Definition: lockdefs.h:44
#define RELATION_IS_LOCAL(relation)
Definition: rel.h:528
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
#define P_NEW
Definition: bufmgr.h:82
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
bool ConditionalLockBuffer(Buffer buffer)
Definition: bufmgr.c:3572
void LockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:332
void UnlockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:382
#define GinPageIsDeleted(page)
Definition: ginblock.h:123
#define GIN_EXCLUSIVE
Definition: gin_private.h:45
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
BlockNumber GetFreeIndexPage(Relation rel)
Definition: indexfsm.c:38
WalTimeSample buffer[LAG_TRACKER_BUFFER_SIZE]
Definition: walsender.c:215
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define InvalidBlockNumber
Definition: block.h:33
#define PageIsNew(page)
Definition: bufpage.h:225
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:74

◆ ginoptions()

bytea* ginoptions ( Datum  reloptions,
bool  validate 
)

Definition at line 607 of file ginutil.c.

References allocateReloptStruct(), fillRelOptions(), lengthof, offsetof, options, parseRelOptions(), pfree(), RELOPT_KIND_GIN, RELOPT_TYPE_BOOL, and RELOPT_TYPE_INT.

Referenced by ginhandler().

608 {
610  GinOptions *rdopts;
611  int numoptions;
612  static const relopt_parse_elt tab[] = {
613  {"fastupdate", RELOPT_TYPE_BOOL, offsetof(GinOptions, useFastUpdate)},
614  {"gin_pending_list_limit", RELOPT_TYPE_INT, offsetof(GinOptions,
615  pendingListCleanupSize)}
616  };
617 
618  options = parseRelOptions(reloptions, validate, RELOPT_KIND_GIN,
619  &numoptions);
620 
621  /* if none set, we're done */
622  if (numoptions == 0)
623  return NULL;
624 
625  rdopts = allocateReloptStruct(sizeof(GinOptions), options, numoptions);
626 
627  fillRelOptions((void *) rdopts, sizeof(GinOptions), options, numoptions,
628  validate, tab, lengthof(tab));
629 
630  pfree(options);
631 
632  return (bytea *) rdopts;
633 }
#define lengthof(array)
Definition: c.h:629
void pfree(void *pointer)
Definition: mcxt.c:1031
void * allocateReloptStruct(Size base, relopt_value *options, int numoptions)
Definition: reloptions.c:1242
static char ** options
void fillRelOptions(void *rdopts, Size basesize, relopt_value *options, int numoptions, bool validate, const relopt_parse_elt *elems, int numelems)
Definition: reloptions.c:1266
Definition: c.h:516
relopt_value * parseRelOptions(Datum options, bool validate, relopt_kind kind, int *numrelopts)
Definition: reloptions.c:1048
#define offsetof(type, field)
Definition: c.h:622

◆ gintuple_get_attrnum()

OffsetNumber gintuple_get_attrnum ( GinState ginstate,
IndexTuple  tuple 
)

Definition at line 217 of file ginutil.c.

References Assert, DatumGetUInt16, FirstOffsetNumber, index_getattr, GinState::oneCol, and GinState::tupdesc.

Referenced by addItemPointersToLeafTuple(), collectMatchBitmap(), collectMatchesForHeapRow(), entryIsMoveRight(), entryLocateEntry(), entryLocateLeafEntry(), gintuple_get_key(), ginVacuumEntryPage(), matchPartialInPendingList(), and processPendingPage().

218 {
219  OffsetNumber colN;
220 
221  if (ginstate->oneCol)
222  {
223  /* column number is not stored explicitly */
224  colN = FirstOffsetNumber;
225  }
226  else
227  {
228  Datum res;
229  bool isnull;
230 
231  /*
232  * First attribute is always int16, so we can safely use any tuple
233  * descriptor to obtain first attribute of tuple
234  */
235  res = index_getattr(tuple, FirstOffsetNumber, ginstate->tupdesc[0],
236  &isnull);
237  Assert(!isnull);
238 
239  colN = DatumGetUInt16(res);
240  Assert(colN >= FirstOffsetNumber && colN <= ginstate->origTupdesc->natts);
241  }
242 
243  return colN;
244 }
#define DatumGetUInt16(X)
Definition: postgres.h:441
uint16 OffsetNumber
Definition: off.h:24
#define FirstOffsetNumber
Definition: off.h:27
uintptr_t Datum
Definition: postgres.h:365
TupleDesc tupdesc[INDEX_MAX_KEYS]
Definition: gin_private.h:68
#define Assert(condition)
Definition: c.h:699
#define index_getattr(tup, attnum, tupleDesc, isnull)
Definition: itup.h:100
bool oneCol
Definition: gin_private.h:54

◆ gintuple_get_key()

Datum gintuple_get_key ( GinState ginstate,
IndexTuple  tuple,
GinNullCategory category 
)

Definition at line 250 of file ginutil.c.

References FirstOffsetNumber, GIN_CAT_NORM_KEY, GinGetNullCategory, gintuple_get_attrnum(), index_getattr, OffsetNumberNext, GinState::oneCol, GinState::origTupdesc, and GinState::tupdesc.

Referenced by addItemPointersToLeafTuple(), collectMatchBitmap(), collectMatchesForHeapRow(), entryIsMoveRight(), entryLocateEntry(), entryLocateLeafEntry(), ginVacuumEntryPage(), matchPartialInPendingList(), and processPendingPage().

252 {
253  Datum res;
254  bool isnull;
255 
256  if (ginstate->oneCol)
257  {
258  /*
259  * Single column index doesn't store attribute numbers in tuples
260  */
261  res = index_getattr(tuple, FirstOffsetNumber, ginstate->origTupdesc,
262  &isnull);
263  }
264  else
265  {
266  /*
267  * Since the datum type depends on which index column it's from, we
268  * must be careful to use the right tuple descriptor here.
269  */
270  OffsetNumber colN = gintuple_get_attrnum(ginstate, tuple);
271 
273  ginstate->tupdesc[colN - 1],
274  &isnull);
275  }
276 
277  if (isnull)
278  *category = GinGetNullCategory(tuple, ginstate);
279  else
280  *category = GIN_CAT_NORM_KEY;
281 
282  return res;
283 }
#define GinGetNullCategory(itup, ginstate)
Definition: ginblock.h:214
uint16 OffsetNumber
Definition: off.h:24
OffsetNumber gintuple_get_attrnum(GinState *ginstate, IndexTuple tuple)
Definition: ginutil.c:217
#define GIN_CAT_NORM_KEY
Definition: ginblock.h:202
#define FirstOffsetNumber
Definition: off.h:27
uintptr_t Datum
Definition: postgres.h:365
TupleDesc tupdesc[INDEX_MAX_KEYS]
Definition: gin_private.h:68
#define OffsetNumberNext(offsetNumber)
Definition: off.h:53
#define index_getattr(tup, attnum, tupleDesc, isnull)
Definition: itup.h:100
TupleDesc origTupdesc
Definition: gin_private.h:67
bool oneCol
Definition: gin_private.h:54

◆ ginUpdateStats()

void ginUpdateStats ( Relation  index,
const GinStatsData stats 
)

Definition at line 669 of file ginutil.c.

References BufferGetPage, END_CRIT_SECTION, GIN_EXCLUSIVE, GIN_METAPAGE_BLKNO, GinPageGetMeta, InvalidBlockNumber, LockBuffer(), MarkBufferDirty(), ginxlogUpdateMeta::metadata, GinStatsData::nDataPages, GinMetaPageData::nDataPages, GinStatsData::nEntries, GinMetaPageData::nEntries, GinStatsData::nEntryPages, GinMetaPageData::nEntryPages, ginxlogUpdateMeta::newRightlink, ginxlogUpdateMeta::node, GinStatsData::nTotalPages, GinMetaPageData::nTotalPages, ginxlogUpdateMeta::ntuples, PageSetLSN, ginxlogUpdateMeta::prevTail, RelationData::rd_node, ReadBuffer(), REGBUF_STANDARD, REGBUF_WILL_INIT, RelationNeedsWAL, START_CRIT_SECTION, UnlockReleaseBuffer(), XLOG_GIN_UPDATE_META_PAGE, XLogBeginInsert(), XLogInsert(), XLogRegisterBuffer(), and XLogRegisterData().

Referenced by ginbuild(), and ginvacuumcleanup().

670 {
671  Buffer metabuffer;
672  Page metapage;
673  GinMetaPageData *metadata;
674 
675  metabuffer = ReadBuffer(index, GIN_METAPAGE_BLKNO);
676  LockBuffer(metabuffer, GIN_EXCLUSIVE);
677  metapage = BufferGetPage(metabuffer);
678  metadata = GinPageGetMeta(metapage);
679 
681 
682  metadata->nTotalPages = stats->nTotalPages;
683  metadata->nEntryPages = stats->nEntryPages;
684  metadata->nDataPages = stats->nDataPages;
685  metadata->nEntries = stats->nEntries;
686 
687  /*
688  * Set pd_lower just past the end of the metadata. This is essential,
689  * because without doing so, metadata will be lost if xlog.c compresses
690  * the page. (We must do this here because pre-v11 versions of PG did not
691  * set the metapage's pd_lower correctly, so a pg_upgraded index might
692  * contain the wrong value.)
693  */
694  ((PageHeader) metapage)->pd_lower =
695  ((char *) metadata + sizeof(GinMetaPageData)) - (char *) metapage;
696 
697  MarkBufferDirty(metabuffer);
698 
699  if (RelationNeedsWAL(index))
700  {
701  XLogRecPtr recptr;
702  ginxlogUpdateMeta data;
703 
704  data.node = index->rd_node;
705  data.ntuples = 0;
707  memcpy(&data.metadata, metadata, sizeof(GinMetaPageData));
708 
709  XLogBeginInsert();
710  XLogRegisterData((char *) &data, sizeof(ginxlogUpdateMeta));
712 
713  recptr = XLogInsert(RM_GIN_ID, XLOG_GIN_UPDATE_META_PAGE);
714  PageSetLSN(metapage, recptr);
715  }
716 
717  UnlockReleaseBuffer(metabuffer);
718 
720 }
BlockNumber nEntryPages
Definition: ginblock.h:79
BlockNumber prevTail
Definition: ginxlog.h:173
BlockNumber nEntryPages
Definition: gin.h:45
RelFileNode node
Definition: ginxlog.h:171
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1450
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
#define END_CRIT_SECTION()
Definition: miscadmin.h:133
#define REGBUF_WILL_INIT
Definition: xloginsert.h:32
#define START_CRIT_SECTION()
Definition: miscadmin.h:131
int64 nEntries
Definition: gin.h:47
BlockNumber nTotalPages
Definition: ginblock.h:78
#define GIN_METAPAGE_BLKNO
Definition: ginblock.h:50
int64 nEntries
Definition: ginblock.h:81
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3332
#define XLOG_GIN_UPDATE_META_PAGE
Definition: ginxlog.h:163
#define REGBUF_STANDARD
Definition: xloginsert.h:34
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
BlockNumber newRightlink
Definition: ginxlog.h:174
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
#define GIN_EXCLUSIVE
Definition: gin_private.h:45
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
BlockNumber nDataPages
Definition: gin.h:46
GinMetaPageData metadata
Definition: ginxlog.h:172
RelFileNode rd_node
Definition: rel.h:55
PageHeaderData * PageHeader
Definition: bufpage.h:162
uint64 XLogRecPtr
Definition: xlogdefs.h:21
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define InvalidBlockNumber
Definition: block.h:33
BlockNumber nTotalPages
Definition: gin.h:44
#define RelationNeedsWAL(relation)
Definition: rel.h:510
BlockNumber nDataPages
Definition: ginblock.h:80
#define GinPageGetMeta(p)
Definition: ginblock.h:103
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PageSetLSN(page, lsn)
Definition: bufpage.h:364
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:74

◆ initGinState()

void initGinState ( GinState state,
Relation  index 
)

Definition at line 88 of file ginutil.c.

References GinState::canPartialMatch, TypeCacheEntry::cmp_proc_finfo, GinState::compareFn, GinState::comparePartialFn, GinState::consistentFn, CreateTemplateTupleDesc(), CurrentMemoryContext, elog, ereport, errcode(), errmsg(), ERROR, GinState::extractQueryFn, GinState::extractValueFn, fmgr_info_copy(), FmgrInfo::fn_oid, format_type_be(), GIN_COMPARE_PARTIAL_PROC, GIN_COMPARE_PROC, GIN_CONSISTENT_PROC, GIN_EXTRACTQUERY_PROC, GIN_EXTRACTVALUE_PROC, GIN_TRICONSISTENT_PROC, i, GinState::index, index_getprocid(), index_getprocinfo(), InvalidOid, lookup_type_cache(), MemSet, tupleDesc::natts, OidIsValid, GinState::oneCol, GinState::origTupdesc, RelationData::rd_indcollation, RelationGetDescr, RelationGetRelationName, GinState::supportCollation, GinState::triConsistentFn, GinState::tupdesc, TupleDescAttr, TupleDescInitEntry(), TupleDescInitEntryCollation(), and TYPECACHE_CMP_PROC_FINFO.

Referenced by gin_clean_pending_list(), ginbeginscan(), ginbuild(), ginbulkdelete(), gininsert(), and ginvacuumcleanup().

89 {
90  TupleDesc origTupdesc = RelationGetDescr(index);
91  int i;
92 
93  MemSet(state, 0, sizeof(GinState));
94 
95  state->index = index;
96  state->oneCol = (origTupdesc->natts == 1) ? true : false;
97  state->origTupdesc = origTupdesc;
98 
99  for (i = 0; i < origTupdesc->natts; i++)
100  {
101  Form_pg_attribute attr = TupleDescAttr(origTupdesc, i);
102 
103  if (state->oneCol)
104  state->tupdesc[i] = state->origTupdesc;
105  else
106  {
107  state->tupdesc[i] = CreateTemplateTupleDesc(2, false);
108 
109  TupleDescInitEntry(state->tupdesc[i], (AttrNumber) 1, NULL,
110  INT2OID, -1, 0);
111  TupleDescInitEntry(state->tupdesc[i], (AttrNumber) 2, NULL,
112  attr->atttypid,
113  attr->atttypmod,
114  attr->attndims);
116  attr->attcollation);
117  }
118 
119  /*
120  * If the compare proc isn't specified in the opclass definition, look
121  * up the index key type's default btree comparator.
122  */
123  if (index_getprocid(index, i + 1, GIN_COMPARE_PROC) != InvalidOid)
124  {
125  fmgr_info_copy(&(state->compareFn[i]),
126  index_getprocinfo(index, i + 1, GIN_COMPARE_PROC),
128  }
129  else
130  {
131  TypeCacheEntry *typentry;
132 
133  typentry = lookup_type_cache(attr->atttypid,
135  if (!OidIsValid(typentry->cmp_proc_finfo.fn_oid))
136  ereport(ERROR,
137  (errcode(ERRCODE_UNDEFINED_FUNCTION),
138  errmsg("could not identify a comparison function for type %s",
139  format_type_be(attr->atttypid))));
140  fmgr_info_copy(&(state->compareFn[i]),
141  &(typentry->cmp_proc_finfo),
143  }
144 
145  /* Opclass must always provide extract procs */
146  fmgr_info_copy(&(state->extractValueFn[i]),
149  fmgr_info_copy(&(state->extractQueryFn[i]),
152 
153  /*
154  * Check opclass capability to do tri-state or binary logic consistent
155  * check.
156  */
157  if (index_getprocid(index, i + 1, GIN_TRICONSISTENT_PROC) != InvalidOid)
158  {
159  fmgr_info_copy(&(state->triConsistentFn[i]),
162  }
163 
164  if (index_getprocid(index, i + 1, GIN_CONSISTENT_PROC) != InvalidOid)
165  {
166  fmgr_info_copy(&(state->consistentFn[i]),
167  index_getprocinfo(index, i + 1, GIN_CONSISTENT_PROC),
169  }
170 
171  if (state->consistentFn[i].fn_oid == InvalidOid &&
172  state->triConsistentFn[i].fn_oid == InvalidOid)
173  {
174  elog(ERROR, "missing GIN support function (%d or %d) for attribute %d of index \"%s\"",
176  i + 1, RelationGetRelationName(index));
177  }
178 
179  /*
180  * Check opclass capability to do partial match.
181  */
183  {
184  fmgr_info_copy(&(state->comparePartialFn[i]),
187  state->canPartialMatch[i] = true;
188  }
189  else
190  {
191  state->canPartialMatch[i] = false;
192  }
193 
194  /*
195  * If the index column has a specified collation, we should honor that
196  * while doing comparisons. However, we may have a collatable storage
197  * type for a noncollatable indexed data type (for instance, hstore
198  * uses text index entries). If there's no index collation then
199  * specify default collation in case the support functions need
200  * collation. This is harmless if the support functions don't care
201  * about collation, so we just do it unconditionally. (We could
202  * alternatively call get_typcollation, but that seems like expensive
203  * overkill --- there aren't going to be any cases where a GIN storage
204  * type has a nondefault collation.)
205  */
206  if (OidIsValid(index->rd_indcollation[i]))
207  state->supportCollation[i] = index->rd_indcollation[i];
208  else
209  state->supportCollation[i] = DEFAULT_COLLATION_OID;
210  }
211 }
Oid supportCollation[INDEX_MAX_KEYS]
Definition: gin_private.h:82
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:855
#define GIN_EXTRACTQUERY_PROC
Definition: gin.h:24
Relation index
Definition: gin_private.h:53
#define RelationGetDescr(relation)
Definition: rel.h:433
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:93
bool canPartialMatch[INDEX_MAX_KEYS]
Definition: gin_private.h:80
int errcode(int sqlerrcode)
Definition: elog.c:575
#define MemSet(start, val, len)
Definition: c.h:908
FmgrInfo consistentFn[INDEX_MAX_KEYS]
Definition: gin_private.h:76
char * format_type_be(Oid type_oid)
Definition: format_type.c:328
FmgrInfo extractValueFn[INDEX_MAX_KEYS]
Definition: gin_private.h:74
#define GIN_TRICONSISTENT_PROC
Definition: gin.h:27
#define GIN_COMPARE_PARTIAL_PROC
Definition: gin.h:26
#define OidIsValid(objectId)
Definition: c.h:605
int natts
Definition: tupdesc.h:82
FmgrInfo cmp_proc_finfo
Definition: typcache.h:72
Oid * rd_indcollation
Definition: rel.h:165
#define ERROR
Definition: elog.h:43
void TupleDescInitEntryCollation(TupleDesc desc, AttrNumber attributeNumber, Oid collationid)
Definition: tupdesc.c:761
void fmgr_info_copy(FmgrInfo *dstinfo, FmgrInfo *srcinfo, MemoryContext destcxt)
Definition: fmgr.c:609
FmgrInfo comparePartialFn[INDEX_MAX_KEYS]
Definition: gin_private.h:78
#define GIN_CONSISTENT_PROC
Definition: gin.h:25
#define RelationGetRelationName(relation)
Definition: rel.h:441
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:197
FmgrInfo extractQueryFn[INDEX_MAX_KEYS]
Definition: gin_private.h:75
MemoryContext CurrentMemoryContext
Definition: mcxt.c:38
void TupleDescInitEntry(TupleDesc desc, AttrNumber attributeNumber, const char *attributeName, Oid oidtypeid, int32 typmod, int attdim)
Definition: tupdesc.c:600
#define ereport(elevel, rest)
Definition: elog.h:122
TupleDesc tupdesc[INDEX_MAX_KEYS]
Definition: gin_private.h:68
TypeCacheEntry * lookup_type_cache(Oid type_id, int flags)
Definition: typcache.c:321
#define InvalidOid
Definition: postgres_ext.h:36
Oid fn_oid
Definition: fmgr.h:59
#define GIN_EXTRACTVALUE_PROC
Definition: gin.h:23
TupleDesc CreateTemplateTupleDesc(int natts, bool hasoid)
Definition: tupdesc.c:45
int errmsg(const char *fmt,...)
Definition: elog.c:797
int i
TupleDesc origTupdesc
Definition: gin_private.h:67
#define TYPECACHE_CMP_PROC_FINFO
Definition: typcache.h:133
#define elog
Definition: elog.h:219
FmgrInfo triConsistentFn[INDEX_MAX_KEYS]
Definition: gin_private.h:77
bool oneCol
Definition: gin_private.h:54
int16 AttrNumber
Definition: attnum.h:21
#define GIN_COMPARE_PROC
Definition: gin.h:22
FmgrInfo compareFn[INDEX_MAX_KEYS]
Definition: gin_private.h:73
RegProcedure index_getprocid(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:821