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 "commands/vacuum.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, bool is_build)
 

Function Documentation

◆ cmpEntries()

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

Definition at line 450 of file ginutil.c.

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

Referenced by ginExtractEntries().

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

◆ ginCompareAttEntries()

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

Definition at line 417 of file ginutil.c.

References ginCompareEntries().

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

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

◆ ginCompareEntries()

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

Definition at line 395 of file ginutil.c.

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

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

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

◆ ginExtractEntries()

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

Definition at line 490 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().

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

◆ ginGetStats()

void ginGetStats ( Relation  index,
GinStatsData stats 
)

Definition at line 630 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().

631 {
632  Buffer metabuffer;
633  Page metapage;
634  GinMetaPageData *metadata;
635 
636  metabuffer = ReadBuffer(index, GIN_METAPAGE_BLKNO);
637  LockBuffer(metabuffer, GIN_SHARE);
638  metapage = BufferGetPage(metabuffer);
639  metadata = GinPageGetMeta(metapage);
640 
641  stats->nPendingPages = metadata->nPendingPages;
642  stats->nTotalPages = metadata->nTotalPages;
643  stats->nEntryPages = metadata->nEntryPages;
644  stats->nDataPages = metadata->nDataPages;
645  stats->nEntries = metadata->nEntries;
646  stats->ginVersion = metadata->ginVersion;
647 
648  UnlockReleaseBuffer(metabuffer);
649 }
BlockNumber nEntryPages
Definition: ginblock.h:81
BlockNumber nEntryPages
Definition: gin.h:46
int64 nEntries
Definition: gin.h:48
BlockNumber nTotalPages
Definition: ginblock.h:80
#define GIN_METAPAGE_BLKNO
Definition: ginblock.h:52
int64 nEntries
Definition: ginblock.h:83
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3541
#define BufferGetPage(buffer)
Definition: bufmgr.h:169
#define GIN_SHARE
Definition: gin_private.h:49
BlockNumber nPendingPages
Definition: gin.h:44
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3757
BlockNumber nDataPages
Definition: gin.h:47
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:607
BlockNumber nTotalPages
Definition: gin.h:45
int32 ginVersion
Definition: ginblock.h:100
int32 ginVersion
Definition: gin.h:49
BlockNumber nDataPages
Definition: ginblock.h:82
#define GinPageGetMeta(p)
Definition: ginblock.h:105
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:78
BlockNumber nPendingPages
Definition: ginblock.h:74

◆ ginhandler()

Datum ginhandler ( PG_FUNCTION_ARGS  )

Definition at line 38 of file ginutil.c.

References IndexAmRoutine::amadjustmembers, IndexAmRoutine::ambeginscan, IndexAmRoutine::ambuild, IndexAmRoutine::ambuildempty, IndexAmRoutine::ambuildphasename, 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::amoptsprocnum, IndexAmRoutine::amparallelrescan, IndexAmRoutine::amparallelvacuumoptions, IndexAmRoutine::ampredlocks, IndexAmRoutine::amproperty, IndexAmRoutine::amrescan, IndexAmRoutine::amrestrpos, IndexAmRoutine::amsearcharray, IndexAmRoutine::amsearchnulls, IndexAmRoutine::amstorage, IndexAmRoutine::amstrategies, IndexAmRoutine::amsupport, IndexAmRoutine::amusemaintenanceworkmem, IndexAmRoutine::amvacuumcleanup, IndexAmRoutine::amvalidate, GIN_OPTIONS_PROC, ginadjustmembers(), ginbeginscan(), ginbuild(), ginbuildempty(), ginbulkdelete(), gincostestimate(), ginendscan(), gingetbitmap(), gininsert(), GINNProcs, ginoptions(), ginrescan(), ginvacuumcleanup(), ginvalidate(), InvalidOid, makeNode, PG_RETURN_POINTER, VACUUM_OPTION_PARALLEL_BULKDEL, and VACUUM_OPTION_PARALLEL_CLEANUP.

39 {
41 
42  amroutine->amstrategies = 0;
43  amroutine->amsupport = GINNProcs;
44  amroutine->amoptsprocnum = GIN_OPTIONS_PROC;
45  amroutine->amcanorder = false;
46  amroutine->amcanorderbyop = false;
47  amroutine->amcanbackward = false;
48  amroutine->amcanunique = false;
49  amroutine->amcanmulticol = true;
50  amroutine->amoptionalkey = true;
51  amroutine->amsearcharray = false;
52  amroutine->amsearchnulls = false;
53  amroutine->amstorage = true;
54  amroutine->amclusterable = false;
55  amroutine->ampredlocks = true;
56  amroutine->amcanparallel = false;
57  amroutine->amcaninclude = false;
58  amroutine->amusemaintenanceworkmem = true;
59  amroutine->amparallelvacuumoptions =
61  amroutine->amkeytype = InvalidOid;
62 
63  amroutine->ambuild = ginbuild;
64  amroutine->ambuildempty = ginbuildempty;
65  amroutine->aminsert = gininsert;
66  amroutine->ambulkdelete = ginbulkdelete;
67  amroutine->amvacuumcleanup = ginvacuumcleanup;
68  amroutine->amcanreturn = NULL;
69  amroutine->amcostestimate = gincostestimate;
70  amroutine->amoptions = ginoptions;
71  amroutine->amproperty = NULL;
72  amroutine->ambuildphasename = NULL;
73  amroutine->amvalidate = ginvalidate;
74  amroutine->amadjustmembers = ginadjustmembers;
75  amroutine->ambeginscan = ginbeginscan;
76  amroutine->amrescan = ginrescan;
77  amroutine->amgettuple = NULL;
78  amroutine->amgetbitmap = gingetbitmap;
79  amroutine->amendscan = ginendscan;
80  amroutine->ammarkpos = NULL;
81  amroutine->amrestrpos = NULL;
82  amroutine->amestimateparallelscan = NULL;
83  amroutine->aminitparallelscan = NULL;
84  amroutine->amparallelrescan = NULL;
85 
86  PG_RETURN_POINTER(amroutine);
87 }
ambeginscan_function ambeginscan
Definition: amapi.h:270
uint8 amparallelvacuumoptions
Definition: amapi.h:247
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:360
IndexBulkDeleteResult * ginvacuumcleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
Definition: ginvacuum.c:687
IndexScanDesc ginbeginscan(Relation rel, int nkeys, int norderbys)
Definition: ginscan.c:25
int64 gingetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
Definition: ginget.c:1913
void ginendscan(IndexScanDesc scan)
Definition: ginscan.c:458
ambulkdelete_function ambulkdelete
Definition: amapi.h:261
void ginrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
Definition: ginscan.c:442
bool amcanmulticol
Definition: amapi.h:227
uint16 amsupport
Definition: amapi.h:215
amgettuple_function amgettuple
Definition: amapi.h:272
void gincostestimate(PlannerInfo *root, IndexPath *path, double loop_count, Cost *indexStartupCost, Cost *indexTotalCost, Selectivity *indexSelectivity, double *indexCorrelation, double *indexPages)
Definition: selfuncs.c:7003
bool amcanorderbyop
Definition: amapi.h:221
amproperty_function amproperty
Definition: amapi.h:266
amparallelrescan_function amparallelrescan
Definition: amapi.h:281
bool amstorage
Definition: amapi.h:235
bool ampredlocks
Definition: amapi.h:239
void ginbuildempty(Relation index)
Definition: gininsert.c:437
aminsert_function aminsert
Definition: amapi.h:260
Oid amkeytype
Definition: amapi.h:249
bool amoptionalkey
Definition: amapi.h:229
amvalidate_function amvalidate
Definition: amapi.h:268
amgetbitmap_function amgetbitmap
Definition: amapi.h:273
IndexBuildResult * ginbuild(Relation heap, Relation index, IndexInfo *indexInfo)
Definition: gininsert.c:320
ambuild_function ambuild
Definition: amapi.h:258
amoptions_function amoptions
Definition: amapi.h:265
bool ginvalidate(Oid opclassoid)
Definition: ginvalidate.c:33
void ginadjustmembers(Oid opfamilyoid, Oid opclassoid, List *operators, List *functions)
Definition: ginvalidate.c:279
bool amcaninclude
Definition: amapi.h:243
amcostestimate_function amcostestimate
Definition: amapi.h:264
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:225
amvacuumcleanup_function amvacuumcleanup
Definition: amapi.h:262
amendscan_function amendscan
Definition: amapi.h:274
bool amcanbackward
Definition: amapi.h:223
#define GINNProcs
Definition: gin.h:29
amrescan_function amrescan
Definition: amapi.h:271
bool amcanparallel
Definition: amapi.h:241
bytea * ginoptions(Datum reloptions, bool validate)
Definition: ginutil.c:609
bool amsearchnulls
Definition: amapi.h:233
#define GIN_OPTIONS_PROC
Definition: gin.h:28
bool amclusterable
Definition: amapi.h:237
bool amsearcharray
Definition: amapi.h:231
#define InvalidOid
Definition: postgres_ext.h:36
bool amusemaintenanceworkmem
Definition: amapi.h:245
#define makeNode(_type_)
Definition: nodes.h:577
amadjustmembers_function amadjustmembers
Definition: amapi.h:269
IndexBulkDeleteResult * ginbulkdelete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: ginvacuum.c:564
ammarkpos_function ammarkpos
Definition: amapi.h:275
bool amcanorder
Definition: amapi.h:219
ambuildphasename_function ambuildphasename
Definition: amapi.h:267
#define VACUUM_OPTION_PARALLEL_BULKDEL
Definition: vacuum.h:45
amestimateparallelscan_function amestimateparallelscan
Definition: amapi.h:279
uint16 amstrategies
Definition: amapi.h:213
uint16 amoptsprocnum
Definition: amapi.h:217
ambuildempty_function ambuildempty
Definition: amapi.h:259
#define VACUUM_OPTION_PARALLEL_CLEANUP
Definition: vacuum.h:60
amcanreturn_function amcanreturn
Definition: amapi.h:263
aminitparallelscan_function aminitparallelscan
Definition: amapi.h:280
amrestrpos_function amrestrpos
Definition: amapi.h:276

◆ GinInitBuffer()

void GinInitBuffer ( Buffer  b,
uint32  f 
)

Definition at line 357 of file ginutil.c.

References BufferGetPage, BufferGetPageSize, and GinInitPage().

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

358 {
360 }
void GinInitPage(Page page, uint32 f, Size pageSize)
Definition: ginutil.c:344
#define BufferGetPage(buffer)
Definition: bufmgr.h:169
#define BufferGetPageSize(buffer)
Definition: bufmgr.h:156

◆ GinInitMetabuffer()

void GinInitMetabuffer ( Buffer  b)

Definition at line 363 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(), ginRedoDeleteListPages(), and ginRedoUpdateMetapage().

364 {
365  GinMetaPageData *metadata;
366  Page page = BufferGetPage(b);
367 
369 
370  metadata = GinPageGetMeta(page);
371 
372  metadata->head = metadata->tail = InvalidBlockNumber;
373  metadata->tailFreeSize = 0;
374  metadata->nPendingPages = 0;
375  metadata->nPendingHeapTuples = 0;
376  metadata->nTotalPages = 0;
377  metadata->nEntryPages = 0;
378  metadata->nDataPages = 0;
379  metadata->nEntries = 0;
380  metadata->ginVersion = GIN_CURRENT_VERSION;
381 
382  /*
383  * Set pd_lower just past the end of the metadata. This is essential,
384  * because without doing so, metadata will be lost if xlog.c compresses
385  * the page.
386  */
387  ((PageHeader) page)->pd_lower =
388  ((char *) metadata + sizeof(GinMetaPageData)) - (char *) page;
389 }
BlockNumber nEntryPages
Definition: ginblock.h:81
void GinInitPage(Page page, uint32 f, Size pageSize)
Definition: ginutil.c:344
BlockNumber nTotalPages
Definition: ginblock.h:80
int64 nEntries
Definition: ginblock.h:83
int64 nPendingHeapTuples
Definition: ginblock.h:75
#define GIN_META
Definition: ginblock.h:44
BlockNumber head
Definition: ginblock.h:62
BlockNumber tail
Definition: ginblock.h:63
#define BufferGetPage(buffer)
Definition: bufmgr.h:169
#define BufferGetPageSize(buffer)
Definition: bufmgr.h:156
PageHeaderData * PageHeader
Definition: bufpage.h:166
uint32 tailFreeSize
Definition: ginblock.h:68
#define GIN_CURRENT_VERSION
Definition: ginblock.h:103
#define InvalidBlockNumber
Definition: block.h:33
int32 ginVersion
Definition: ginblock.h:100
BlockNumber nDataPages
Definition: ginblock.h:82
#define GinPageGetMeta(p)
Definition: ginblock.h:105
Pointer Page
Definition: bufpage.h:78
BlockNumber nPendingPages
Definition: ginblock.h:74

◆ GinInitPage()

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

Definition at line 344 of file ginutil.c.

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

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

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

◆ GinNewBuffer()

Buffer GinNewBuffer ( Relation  index)

Definition at line 298 of file ginutil.c.

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

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

299 {
300  Buffer buffer;
301  bool needLock;
302 
303  /* First, try to get a page from FSM */
304  for (;;)
305  {
306  BlockNumber blkno = GetFreeIndexPage(index);
307 
308  if (blkno == InvalidBlockNumber)
309  break;
310 
311  buffer = ReadBuffer(index, blkno);
312 
313  /*
314  * We have to guard against the possibility that someone else already
315  * recycled this page; the buffer may be locked if so.
316  */
317  if (ConditionalLockBuffer(buffer))
318  {
319  if (GinPageIsRecyclable(BufferGetPage(buffer)))
320  return buffer; /* OK to use */
321 
322  LockBuffer(buffer, GIN_UNLOCK);
323  }
324 
325  /* Can't use it, so release buffer and try again */
326  ReleaseBuffer(buffer);
327  }
328 
329  /* Must extend the file */
330  needLock = !RELATION_IS_LOCAL(index);
331  if (needLock)
333 
334  buffer = ReadBuffer(index, P_NEW);
335  LockBuffer(buffer, GIN_EXCLUSIVE);
336 
337  if (needLock)
339 
340  return buffer;
341 }
#define GIN_UNLOCK
Definition: gin_private.h:48
#define ExclusiveLock
Definition: lockdefs.h:44
#define RELATION_IS_LOCAL(relation)
Definition: rel.h:583
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3518
#define P_NEW
Definition: bufmgr.h:91
#define BufferGetPage(buffer)
Definition: bufmgr.h:169
bool ConditionalLockBuffer(Buffer buffer)
Definition: bufmgr.c:3783
void LockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:402
void UnlockRelationForExtension(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:452
#define GIN_EXCLUSIVE
Definition: gin_private.h:50
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3757
BlockNumber GetFreeIndexPage(Relation rel)
Definition: indexfsm.c:38
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:607
#define InvalidBlockNumber
Definition: block.h:33
bool GinPageIsRecyclable(Page page)
Definition: ginvacuum.c:801
int Buffer
Definition: buf.h:23

◆ ginoptions()

bytea* ginoptions ( Datum  reloptions,
bool  validate 
)

Definition at line 609 of file ginutil.c.

References build_reloptions(), lengthof, offsetof, RELOPT_KIND_GIN, RELOPT_TYPE_BOOL, and RELOPT_TYPE_INT.

Referenced by ginhandler().

610 {
611  static const relopt_parse_elt tab[] = {
612  {"fastupdate", RELOPT_TYPE_BOOL, offsetof(GinOptions, useFastUpdate)},
613  {"gin_pending_list_limit", RELOPT_TYPE_INT, offsetof(GinOptions,
614  pendingListCleanupSize)}
615  };
616 
617  return (bytea *) build_reloptions(reloptions, validate,
619  sizeof(GinOptions),
620  tab, lengthof(tab));
621 }
#define lengthof(array)
Definition: c.h:675
void * build_reloptions(Datum reloptions, bool validate, relopt_kind kind, Size relopt_struct_size, const relopt_parse_elt *relopt_elems, int num_relopt_elems)
Definition: reloptions.c:1887
Definition: c.h:562
#define offsetof(type, field)
Definition: c.h:668

◆ gintuple_get_attrnum()

OffsetNumber gintuple_get_attrnum ( GinState ginstate,
IndexTuple  tuple 
)

Definition at line 224 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().

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

◆ gintuple_get_key()

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

Definition at line 257 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().

259 {
260  Datum res;
261  bool isnull;
262 
263  if (ginstate->oneCol)
264  {
265  /*
266  * Single column index doesn't store attribute numbers in tuples
267  */
268  res = index_getattr(tuple, FirstOffsetNumber, ginstate->origTupdesc,
269  &isnull);
270  }
271  else
272  {
273  /*
274  * Since the datum type depends on which index column it's from, we
275  * must be careful to use the right tuple descriptor here.
276  */
277  OffsetNumber colN = gintuple_get_attrnum(ginstate, tuple);
278 
280  ginstate->tupdesc[colN - 1],
281  &isnull);
282  }
283 
284  if (isnull)
285  *category = GinGetNullCategory(tuple, ginstate);
286  else
287  *category = GIN_CAT_NORM_KEY;
288 
289  return res;
290 }
#define GinGetNullCategory(itup, ginstate)
Definition: ginblock.h:221
uint16 OffsetNumber
Definition: off.h:24
OffsetNumber gintuple_get_attrnum(GinState *ginstate, IndexTuple tuple)
Definition: ginutil.c:224
#define GIN_CAT_NORM_KEY
Definition: ginblock.h:209
#define FirstOffsetNumber
Definition: off.h:27
uintptr_t Datum
Definition: postgres.h:367
TupleDesc tupdesc[INDEX_MAX_KEYS]
Definition: gin_private.h:73
#define OffsetNumberNext(offsetNumber)
Definition: off.h:52
#define index_getattr(tup, attnum, tupleDesc, isnull)
Definition: itup.h:100
TupleDesc origTupdesc
Definition: gin_private.h:72
bool oneCol
Definition: gin_private.h:59

◆ ginUpdateStats()

void ginUpdateStats ( Relation  index,
const GinStatsData stats,
bool  is_build 
)

Definition at line 657 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().

658 {
659  Buffer metabuffer;
660  Page metapage;
661  GinMetaPageData *metadata;
662 
663  metabuffer = ReadBuffer(index, GIN_METAPAGE_BLKNO);
664  LockBuffer(metabuffer, GIN_EXCLUSIVE);
665  metapage = BufferGetPage(metabuffer);
666  metadata = GinPageGetMeta(metapage);
667 
669 
670  metadata->nTotalPages = stats->nTotalPages;
671  metadata->nEntryPages = stats->nEntryPages;
672  metadata->nDataPages = stats->nDataPages;
673  metadata->nEntries = stats->nEntries;
674 
675  /*
676  * Set pd_lower just past the end of the metadata. This is essential,
677  * because without doing so, metadata will be lost if xlog.c compresses
678  * the page. (We must do this here because pre-v11 versions of PG did not
679  * set the metapage's pd_lower correctly, so a pg_upgraded index might
680  * contain the wrong value.)
681  */
682  ((PageHeader) metapage)->pd_lower =
683  ((char *) metadata + sizeof(GinMetaPageData)) - (char *) metapage;
684 
685  MarkBufferDirty(metabuffer);
686 
687  if (RelationNeedsWAL(index) && !is_build)
688  {
689  XLogRecPtr recptr;
690  ginxlogUpdateMeta data;
691 
692  data.node = index->rd_node;
693  data.ntuples = 0;
695  memcpy(&data.metadata, metadata, sizeof(GinMetaPageData));
696 
697  XLogBeginInsert();
698  XLogRegisterData((char *) &data, sizeof(ginxlogUpdateMeta));
700 
701  recptr = XLogInsert(RM_GIN_ID, XLOG_GIN_UPDATE_META_PAGE);
702  PageSetLSN(metapage, recptr);
703  }
704 
705  UnlockReleaseBuffer(metabuffer);
706 
708 }
BlockNumber nEntryPages
Definition: ginblock.h:81
BlockNumber prevTail
Definition: ginxlog.h:172
BlockNumber nEntryPages
Definition: gin.h:46
RelFileNode node
Definition: ginxlog.h:170
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1469
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:220
#define END_CRIT_SECTION()
Definition: miscadmin.h:134
#define REGBUF_WILL_INIT
Definition: xloginsert.h:33
#define START_CRIT_SECTION()
Definition: miscadmin.h:132
int64 nEntries
Definition: gin.h:48
BlockNumber nTotalPages
Definition: ginblock.h:80
#define GIN_METAPAGE_BLKNO
Definition: ginblock.h:52
int64 nEntries
Definition: ginblock.h:83
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3541
#define XLOG_GIN_UPDATE_META_PAGE
Definition: ginxlog.h:162
#define REGBUF_STANDARD
Definition: xloginsert.h:35
#define BufferGetPage(buffer)
Definition: bufmgr.h:169
BlockNumber newRightlink
Definition: ginxlog.h:173
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:330
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:422
#define GIN_EXCLUSIVE
Definition: gin_private.h:50
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3757
BlockNumber nDataPages
Definition: gin.h:47
GinMetaPageData metadata
Definition: ginxlog.h:171
RelFileNode rd_node
Definition: rel.h:55
PageHeaderData * PageHeader
Definition: bufpage.h:166
uint64 XLogRecPtr
Definition: xlogdefs.h:21
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:607
#define InvalidBlockNumber
Definition: block.h:33
BlockNumber nTotalPages
Definition: gin.h:45
#define RelationNeedsWAL(relation)
Definition: rel.h:562
BlockNumber nDataPages
Definition: ginblock.h:82
#define GinPageGetMeta(p)
Definition: ginblock.h:105
void XLogBeginInsert(void)
Definition: xloginsert.c:123
#define PageSetLSN(page, lsn)
Definition: bufpage.h:368
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:78

◆ initGinState()

void initGinState ( GinState state,
Relation  index 
)

Definition at line 95 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, TupleDescData::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().

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