PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
brin.c File Reference
#include "postgres.h"
#include "access/brin.h"
#include "access/brin_page.h"
#include "access/brin_pageops.h"
#include "access/brin_xlog.h"
#include "access/reloptions.h"
#include "access/relscan.h"
#include "access/xloginsert.h"
#include "catalog/index.h"
#include "catalog/pg_am.h"
#include "miscadmin.h"
#include "pgstat.h"
#include "postmaster/autovacuum.h"
#include "storage/bufmgr.h"
#include "storage/freespace.h"
#include "utils/builtins.h"
#include "utils/index_selfuncs.h"
#include "utils/memutils.h"
#include "utils/rel.h"
Include dependency graph for brin.c:

Go to the source code of this file.

Data Structures

struct  BrinBuildState
 
struct  BrinOpaque
 

Macros

#define BRIN_ALL_BLOCKRANGES   InvalidBlockNumber
 

Typedefs

typedef struct BrinBuildState BrinBuildState
 
typedef struct BrinOpaque BrinOpaque
 

Functions

static BrinBuildStateinitialize_brin_buildstate (Relation idxRel, BrinRevmap *revmap, BlockNumber pagesPerRange)
 
static void terminate_brin_buildstate (BrinBuildState *state)
 
static void brinsummarize (Relation index, Relation heapRel, BlockNumber pageRange, double *numSummarized, double *numExisting)
 
static void form_and_insert_tuple (BrinBuildState *state)
 
static void union_tuples (BrinDesc *bdesc, BrinMemTuple *a, BrinTuple *b)
 
static void brin_vacuum_scan (Relation idxrel, BufferAccessStrategy strategy)
 
Datum brinhandler (PG_FUNCTION_ARGS)
 
bool brininsert (Relation idxRel, Datum *values, bool *nulls, ItemPointer heaptid, Relation heapRel, IndexUniqueCheck checkUnique, IndexInfo *indexInfo)
 
IndexScanDesc brinbeginscan (Relation r, int nkeys, int norderbys)
 
int64 bringetbitmap (IndexScanDesc scan, TIDBitmap *tbm)
 
void brinrescan (IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
 
void brinendscan (IndexScanDesc scan)
 
static void brinbuildCallback (Relation index, HeapTuple htup, Datum *values, bool *isnull, bool tupleIsAlive, void *brstate)
 
IndexBuildResultbrinbuild (Relation heap, Relation index, IndexInfo *indexInfo)
 
void brinbuildempty (Relation index)
 
IndexBulkDeleteResultbrinbulkdelete (IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
 
IndexBulkDeleteResultbrinvacuumcleanup (IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
 
byteabrinoptions (Datum reloptions, bool validate)
 
Datum brin_summarize_new_values (PG_FUNCTION_ARGS)
 
Datum brin_summarize_range (PG_FUNCTION_ARGS)
 
Datum brin_desummarize_range (PG_FUNCTION_ARGS)
 
BrinDescbrin_build_desc (Relation rel)
 
void brin_free_desc (BrinDesc *bdesc)
 
void brinGetStats (Relation index, BrinStatsData *stats)
 
static void summarize_range (IndexInfo *indexInfo, BrinBuildState *state, Relation heapRel, BlockNumber heapBlk, BlockNumber heapNumBlks)
 

Macro Definition Documentation

#define BRIN_ALL_BLOCKRANGES   InvalidBlockNumber

Typedef Documentation

Function Documentation

BrinDesc* brin_build_desc ( Relation  rel)

Definition at line 999 of file brin.c.

References ALLOCSET_SMALL_SIZES, AllocSetContextCreate(), BrinDesc::bd_context, BrinDesc::bd_disktdesc, BrinDesc::bd_index, BrinDesc::bd_info, BrinDesc::bd_totalstored, BrinDesc::bd_tupdesc, BRIN_PROCNUM_OPCINFO, CurrentMemoryContext, DatumGetPointer, FunctionCall1, index_getprocinfo(), MemoryContextSwitchTo(), tupleDesc::natts, offsetof, BrinOpcInfo::oi_nstored, palloc(), pfree(), RelationGetDescr, totalsize, and TupleDescAttr.

Referenced by brin_page_items(), brinbeginscan(), brininsert(), and initialize_brin_buildstate().

1000 {
1001  BrinOpcInfo **opcinfo;
1002  BrinDesc *bdesc;
1003  TupleDesc tupdesc;
1004  int totalstored = 0;
1005  int keyno;
1006  long totalsize;
1007  MemoryContext cxt;
1008  MemoryContext oldcxt;
1009 
1011  "brin desc cxt",
1013  oldcxt = MemoryContextSwitchTo(cxt);
1014  tupdesc = RelationGetDescr(rel);
1015 
1016  /*
1017  * Obtain BrinOpcInfo for each indexed column. While at it, accumulate
1018  * the number of columns stored, since the number is opclass-defined.
1019  */
1020  opcinfo = (BrinOpcInfo **) palloc(sizeof(BrinOpcInfo *) * tupdesc->natts);
1021  for (keyno = 0; keyno < tupdesc->natts; keyno++)
1022  {
1023  FmgrInfo *opcInfoFn;
1024  Form_pg_attribute attr = TupleDescAttr(tupdesc, keyno);
1025 
1026  opcInfoFn = index_getprocinfo(rel, keyno + 1, BRIN_PROCNUM_OPCINFO);
1027 
1028  opcinfo[keyno] = (BrinOpcInfo *)
1029  DatumGetPointer(FunctionCall1(opcInfoFn, attr->atttypid));
1030  totalstored += opcinfo[keyno]->oi_nstored;
1031  }
1032 
1033  /* Allocate our result struct and fill it in */
1034  totalsize = offsetof(BrinDesc, bd_info) +
1035  sizeof(BrinOpcInfo *) * tupdesc->natts;
1036 
1037  bdesc = palloc(totalsize);
1038  bdesc->bd_context = cxt;
1039  bdesc->bd_index = rel;
1040  bdesc->bd_tupdesc = tupdesc;
1041  bdesc->bd_disktdesc = NULL; /* generated lazily */
1042  bdesc->bd_totalstored = totalstored;
1043 
1044  for (keyno = 0; keyno < tupdesc->natts; keyno++)
1045  bdesc->bd_info[keyno] = opcinfo[keyno];
1046  pfree(opcinfo);
1047 
1048  MemoryContextSwitchTo(oldcxt);
1049 
1050  return bdesc;
1051 }
Definition: fmgr.h:56
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:855
#define RelationGetDescr(relation)
Definition: rel.h:428
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:84
#define ALLOCSET_SMALL_SIZES
Definition: memutils.h:175
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define BRIN_PROCNUM_OPCINFO
Definition: brin_internal.h:67
int natts
Definition: tupdesc.h:73
void pfree(void *pointer)
Definition: mcxt.c:949
Relation bd_index
Definition: brin_internal.h:47
uint16 oi_nstored
Definition: brin_internal.h:28
int bd_totalstored
Definition: brin_internal.h:56
TupleDesc bd_tupdesc
Definition: brin_internal.h:50
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
static uint64 totalsize
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
BrinOpcInfo * bd_info[FLEXIBLE_ARRAY_MEMBER]
Definition: brin_internal.h:59
#define DatumGetPointer(X)
Definition: postgres.h:555
MemoryContext bd_context
Definition: brin_internal.h:44
void * palloc(Size size)
Definition: mcxt.c:848
TupleDesc bd_disktdesc
Definition: brin_internal.h:53
#define FunctionCall1(flinfo, arg1)
Definition: fmgr.h:603
#define offsetof(type, field)
Definition: c.h:549
Datum brin_desummarize_range ( PG_FUNCTION_ARGS  )

Definition at line 924 of file brin.c.

References ACL_KIND_CLASS, aclcheck_error(), ACLCHECK_NOT_OWNER, BRIN_AM_OID, brinRevmapDesummarizeRange(), ereport, errcode(), ERRCODE_UNDEFINED_TABLE, errmsg(), ERROR, GetUserId(), heap_open(), index_open(), IndexGetRelation(), INT64_FORMAT, MaxBlockNumber, OidIsValid, pg_class_ownercheck(), PG_GETARG_INT64, PG_GETARG_OID, PG_RETURN_VOID, psprintf(), RelationData::rd_rel, relation_close(), RelationGetRelationName, RELKIND_INDEX, and ShareUpdateExclusiveLock.

925 {
926  Oid indexoid = PG_GETARG_OID(0);
927  int64 heapBlk64 = PG_GETARG_INT64(1);
928  BlockNumber heapBlk;
929  Oid heapoid;
930  Relation heapRel;
931  Relation indexRel;
932  bool done;
933 
934  if (heapBlk64 > MaxBlockNumber || heapBlk64 < 0)
935  {
936  char *blk = psprintf(INT64_FORMAT, heapBlk64);
937 
938  ereport(ERROR,
939  (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
940  errmsg("block number out of range: %s", blk)));
941  }
942  heapBlk = (BlockNumber) heapBlk64;
943 
944  /*
945  * We must lock table before index to avoid deadlocks. However, if the
946  * passed indexoid isn't an index then IndexGetRelation() will fail.
947  * Rather than emitting a not-very-helpful error message, postpone
948  * complaining, expecting that the is-it-an-index test below will fail.
949  */
950  heapoid = IndexGetRelation(indexoid, true);
951  if (OidIsValid(heapoid))
952  heapRel = heap_open(heapoid, ShareUpdateExclusiveLock);
953  else
954  heapRel = NULL;
955 
956  indexRel = index_open(indexoid, ShareUpdateExclusiveLock);
957 
958  /* Must be a BRIN index */
959  if (indexRel->rd_rel->relkind != RELKIND_INDEX ||
960  indexRel->rd_rel->relam != BRIN_AM_OID)
961  ereport(ERROR,
962  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
963  errmsg("\"%s\" is not a BRIN index",
964  RelationGetRelationName(indexRel))));
965 
966  /* User must own the index (comparable to privileges needed for VACUUM) */
967  if (!pg_class_ownercheck(indexoid, GetUserId()))
969  RelationGetRelationName(indexRel));
970 
971  /*
972  * Since we did the IndexGetRelation call above without any lock, it's
973  * barely possible that a race against an index drop/recreation could have
974  * netted us the wrong table. Recheck.
975  */
976  if (heapRel == NULL || heapoid != IndexGetRelation(indexoid, false))
977  ereport(ERROR,
979  errmsg("could not open parent table of index %s",
980  RelationGetRelationName(indexRel))));
981 
982  /* the revmap does the hard work */
983  do
984  {
985  done = brinRevmapDesummarizeRange(indexRel, heapBlk);
986  }
987  while (!done);
988 
991 
992  PG_RETURN_VOID();
993 }
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3281
#define ERRCODE_UNDEFINED_TABLE
Definition: pgbench.c:61
#define BRIN_AM_OID
Definition: pg_am.h:85
Oid GetUserId(void)
Definition: miscinit.c:284
char * psprintf(const char *fmt,...)
Definition: psprintf.c:46
int errcode(int sqlerrcode)
Definition: elog.c:575
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: heapam.c:1266
uint32 BlockNumber
Definition: block.h:31
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:532
#define ERROR
Definition: elog.h:43
#define MaxBlockNumber
Definition: block.h:35
#define PG_GETARG_OID(n)
Definition: fmgr.h:240
void aclcheck_error(AclResult aclerr, AclObjectKind objectkind, const char *objectname)
Definition: aclchk.c:3399
#define RelationGetRelationName(relation)
Definition: rel.h:436
#define ereport(elevel, rest)
Definition: elog.h:122
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
#define PG_RETURN_VOID()
Definition: fmgr.h:309
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
bool pg_class_ownercheck(Oid class_oid, Oid roleid)
Definition: aclchk.c:4546
bool brinRevmapDesummarizeRange(Relation idxrel, BlockNumber heapBlk)
Definition: brin_revmap.c:321
#define INT64_FORMAT
Definition: c.h:300
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_INDEX
Definition: pg_class.h:161
#define PG_GETARG_INT64(n)
Definition: fmgr.h:247
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:151
void brin_free_desc ( BrinDesc bdesc)

Definition at line 1054 of file brin.c.

References Assert, BrinDesc::bd_context, BrinDesc::bd_tupdesc, MemoryContextDelete(), and tupleDesc::tdrefcount.

Referenced by brin_page_items(), brinendscan(), and terminate_brin_buildstate().

1055 {
1056  /* make sure the tupdesc is still valid */
1057  Assert(bdesc->bd_tupdesc->tdrefcount >= 1);
1058  /* no need for retail pfree */
1060 }
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:200
TupleDesc bd_tupdesc
Definition: brin_internal.h:50
#define Assert(condition)
Definition: c.h:664
MemoryContext bd_context
Definition: brin_internal.h:44
int tdrefcount
Definition: tupdesc.h:77
Datum brin_summarize_new_values ( PG_FUNCTION_ARGS  )

Definition at line 838 of file brin.c.

References BRIN_ALL_BLOCKRANGES, brin_summarize_range(), DirectFunctionCall2, Int64GetDatum(), and PG_GETARG_DATUM.

839 {
840  Datum relation = PG_GETARG_DATUM(0);
841 
843  relation,
845 }
#define PG_GETARG_DATUM(n)
Definition: fmgr.h:233
Datum brin_summarize_range(PG_FUNCTION_ARGS)
Definition: brin.c:853
Datum Int64GetDatum(int64 X)
Definition: fmgr.c:1791
uintptr_t Datum
Definition: postgres.h:372
#define BRIN_ALL_BLOCKRANGES
Definition: brin.c:64
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:587
Datum brin_summarize_range ( PG_FUNCTION_ARGS  )

Definition at line 853 of file brin.c.

References ACL_KIND_CLASS, aclcheck_error(), ACLCHECK_NOT_OWNER, BRIN_ALL_BLOCKRANGES, BRIN_AM_OID, brinsummarize(), ereport, errcode(), ERRCODE_UNDEFINED_TABLE, errmsg(), ERROR, GetUserId(), heap_open(), index_open(), IndexGetRelation(), INT64_FORMAT, OidIsValid, pg_class_ownercheck(), PG_GETARG_INT64, PG_GETARG_OID, PG_RETURN_INT32, psprintf(), RelationData::rd_rel, relation_close(), RelationGetRelationName, RELKIND_INDEX, and ShareUpdateExclusiveLock.

Referenced by brin_summarize_new_values(), and perform_work_item().

854 {
855  Oid indexoid = PG_GETARG_OID(0);
856  int64 heapBlk64 = PG_GETARG_INT64(1);
857  BlockNumber heapBlk;
858  Oid heapoid;
859  Relation indexRel;
860  Relation heapRel;
861  double numSummarized = 0;
862 
863  if (heapBlk64 > BRIN_ALL_BLOCKRANGES || heapBlk64 < 0)
864  {
865  char *blk = psprintf(INT64_FORMAT, heapBlk64);
866 
867  ereport(ERROR,
868  (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
869  errmsg("block number out of range: %s", blk)));
870  }
871  heapBlk = (BlockNumber) heapBlk64;
872 
873  /*
874  * We must lock table before index to avoid deadlocks. However, if the
875  * passed indexoid isn't an index then IndexGetRelation() will fail.
876  * Rather than emitting a not-very-helpful error message, postpone
877  * complaining, expecting that the is-it-an-index test below will fail.
878  */
879  heapoid = IndexGetRelation(indexoid, true);
880  if (OidIsValid(heapoid))
881  heapRel = heap_open(heapoid, ShareUpdateExclusiveLock);
882  else
883  heapRel = NULL;
884 
885  indexRel = index_open(indexoid, ShareUpdateExclusiveLock);
886 
887  /* Must be a BRIN index */
888  if (indexRel->rd_rel->relkind != RELKIND_INDEX ||
889  indexRel->rd_rel->relam != BRIN_AM_OID)
890  ereport(ERROR,
891  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
892  errmsg("\"%s\" is not a BRIN index",
893  RelationGetRelationName(indexRel))));
894 
895  /* User must own the index (comparable to privileges needed for VACUUM) */
896  if (!pg_class_ownercheck(indexoid, GetUserId()))
898  RelationGetRelationName(indexRel));
899 
900  /*
901  * Since we did the IndexGetRelation call above without any lock, it's
902  * barely possible that a race against an index drop/recreation could have
903  * netted us the wrong table. Recheck.
904  */
905  if (heapRel == NULL || heapoid != IndexGetRelation(indexoid, false))
906  ereport(ERROR,
908  errmsg("could not open parent table of index %s",
909  RelationGetRelationName(indexRel))));
910 
911  /* OK, do it */
912  brinsummarize(indexRel, heapRel, heapBlk, &numSummarized, NULL);
913 
916 
917  PG_RETURN_INT32((int32) numSummarized);
918 }
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3281
#define ERRCODE_UNDEFINED_TABLE
Definition: pgbench.c:61
#define BRIN_AM_OID
Definition: pg_am.h:85
Oid GetUserId(void)
Definition: miscinit.c:284
char * psprintf(const char *fmt,...)
Definition: psprintf.c:46
#define PG_RETURN_INT32(x)
Definition: fmgr.h:314
int errcode(int sqlerrcode)
Definition: elog.c:575
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: heapam.c:1266
uint32 BlockNumber
Definition: block.h:31
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:532
signed int int32
Definition: c.h:246
#define ERROR
Definition: elog.h:43
#define PG_GETARG_OID(n)
Definition: fmgr.h:240
void aclcheck_error(AclResult aclerr, AclObjectKind objectkind, const char *objectname)
Definition: aclchk.c:3399
#define RelationGetRelationName(relation)
Definition: rel.h:436
#define ereport(elevel, rest)
Definition: elog.h:122
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
static void brinsummarize(Relation index, Relation heapRel, BlockNumber pageRange, double *numSummarized, double *numExisting)
Definition: brin.c:1243
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
bool pg_class_ownercheck(Oid class_oid, Oid roleid)
Definition: aclchk.c:4546
#define INT64_FORMAT
Definition: c.h:300
#define BRIN_ALL_BLOCKRANGES
Definition: brin.c:64
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_INDEX
Definition: pg_class.h:161
#define PG_GETARG_INT64(n)
Definition: fmgr.h:247
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:151
static void brin_vacuum_scan ( Relation  idxrel,
BufferAccessStrategy  strategy 
)
static

Definition at line 1401 of file brin.c.

References brin_page_cleanup(), buf, CHECK_FOR_INTERRUPTS, FreeSpaceMapVacuum(), MAIN_FORKNUM, RBM_NORMAL, ReadBufferExtended(), RelationGetNumberOfBlocks, and ReleaseBuffer().

Referenced by brinvacuumcleanup().

1402 {
1403  bool vacuum_fsm = false;
1404  BlockNumber blkno;
1405 
1406  /*
1407  * Scan the index in physical order, and clean up any possible mess in
1408  * each page.
1409  */
1410  for (blkno = 0; blkno < RelationGetNumberOfBlocks(idxrel); blkno++)
1411  {
1412  Buffer buf;
1413 
1415 
1416  buf = ReadBufferExtended(idxrel, MAIN_FORKNUM, blkno,
1417  RBM_NORMAL, strategy);
1418 
1419  vacuum_fsm |= brin_page_cleanup(idxrel, buf);
1420 
1421  ReleaseBuffer(buf);
1422  }
1423 
1424  /*
1425  * If we made any change to the FSM, make sure the new info is visible all
1426  * the way to the top.
1427  */
1428  if (vacuum_fsm)
1429  FreeSpaceMapVacuum(idxrel);
1430 }
Buffer ReadBufferExtended(Relation reln, ForkNumber forkNum, BlockNumber blockNum, ReadBufferMode mode, BufferAccessStrategy strategy)
Definition: bufmgr.c:640
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
static char * buf
Definition: pg_test_fsync.c:67
void FreeSpaceMapVacuum(Relation rel)
Definition: freespace.c:379
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
bool brin_page_cleanup(Relation idxrel, Buffer buf)
Definition: brin_pageops.c:595
int Buffer
Definition: buf.h:23
IndexScanDesc brinbeginscan ( Relation  r,
int  nkeys,
int  norderbys 
)

Definition at line 324 of file brin.c.

References BrinOpaque::bo_bdesc, BrinOpaque::bo_pagesPerRange, BrinOpaque::bo_rmAccess, brin_build_desc(), brinRevmapInitialize(), IndexScanDescData::opaque, palloc(), RelationGetIndexScan(), and IndexScanDescData::xs_snapshot.

Referenced by brinhandler().

325 {
326  IndexScanDesc scan;
327  BrinOpaque *opaque;
328 
329  scan = RelationGetIndexScan(r, nkeys, norderbys);
330 
331  opaque = (BrinOpaque *) palloc(sizeof(BrinOpaque));
332  opaque->bo_rmAccess = brinRevmapInitialize(r, &opaque->bo_pagesPerRange,
333  scan->xs_snapshot);
334  opaque->bo_bdesc = brin_build_desc(r);
335  scan->opaque = opaque;
336 
337  return scan;
338 }
Snapshot xs_snapshot
Definition: relscan.h:91
BlockNumber bo_pagesPerRange
Definition: brin.c:59
BrinRevmap * bo_rmAccess
Definition: brin.c:60
BrinDesc * bo_bdesc
Definition: brin.c:61
BrinDesc * brin_build_desc(Relation rel)
Definition: brin.c:999
BrinRevmap * brinRevmapInitialize(Relation idxrel, BlockNumber *pagesPerRange, Snapshot snapshot)
Definition: brin_revmap.c:71
void * palloc(Size size)
Definition: mcxt.c:848
IndexScanDesc RelationGetIndexScan(Relation indexRelation, int nkeys, int norderbys)
Definition: genam.c:78
IndexBuildResult* brinbuild ( Relation  heap,
Relation  index,
IndexInfo indexInfo 
)

Definition at line 647 of file brin.c.

References Assert, BRIN_CURRENT_VERSION, BRIN_METAPAGE_BLKNO, brin_metapage_init(), brinbuildCallback(), BrinGetPagesPerRange, brinRevmapInitialize(), brinRevmapTerminate(), BrinBuildState::bs_numtuples, BrinBuildState::bs_rmAccess, BUFFER_LOCK_EXCLUSIVE, BufferGetBlockNumber(), BufferGetPage, elog, ERROR, form_and_insert_tuple(), IndexBuildResult::heap_tuples, IndexBuildResult::index_tuples, IndexBuildHeapScan(), initialize_brin_buildstate(), LockBuffer(), MarkBufferDirty(), P_NEW, PageSetLSN, xl_brin_createidx::pagesPerRange, palloc(), ReadBuffer(), REGBUF_WILL_INIT, RelationGetNumberOfBlocks, RelationGetRelationName, RelationNeedsWAL, SizeOfBrinCreateIdx, terminate_brin_buildstate(), UnlockReleaseBuffer(), xl_brin_createidx::version, XLOG_BRIN_CREATE_INDEX, XLogBeginInsert(), XLogInsert(), XLogRegisterBuffer(), and XLogRegisterData().

Referenced by brinhandler().

648 {
649  IndexBuildResult *result;
650  double reltuples;
651  double idxtuples;
652  BrinRevmap *revmap;
654  Buffer meta;
655  BlockNumber pagesPerRange;
656 
657  /*
658  * We expect to be called exactly once for any index relation.
659  */
660  if (RelationGetNumberOfBlocks(index) != 0)
661  elog(ERROR, "index \"%s\" already contains data",
662  RelationGetRelationName(index));
663 
664  /*
665  * Critical section not required, because on error the creation of the
666  * whole relation will be rolled back.
667  */
668 
669  meta = ReadBuffer(index, P_NEW);
672 
675  MarkBufferDirty(meta);
676 
677  if (RelationNeedsWAL(index))
678  {
679  xl_brin_createidx xlrec;
680  XLogRecPtr recptr;
681  Page page;
682 
684  xlrec.pagesPerRange = BrinGetPagesPerRange(index);
685 
686  XLogBeginInsert();
687  XLogRegisterData((char *) &xlrec, SizeOfBrinCreateIdx);
689 
690  recptr = XLogInsert(RM_BRIN_ID, XLOG_BRIN_CREATE_INDEX);
691 
692  page = BufferGetPage(meta);
693  PageSetLSN(page, recptr);
694  }
695 
696  UnlockReleaseBuffer(meta);
697 
698  /*
699  * Initialize our state, including the deformed tuple state.
700  */
701  revmap = brinRevmapInitialize(index, &pagesPerRange, NULL);
702  state = initialize_brin_buildstate(index, revmap, pagesPerRange);
703 
704  /*
705  * Now scan the relation. No syncscan allowed here because we want the
706  * heap blocks in physical order.
707  */
708  reltuples = IndexBuildHeapScan(heap, index, indexInfo, false,
709  brinbuildCallback, (void *) state);
710 
711  /* process the final batch */
712  form_and_insert_tuple(state);
713 
714  /* release resources */
715  idxtuples = state->bs_numtuples;
718 
719  /*
720  * Return statistics
721  */
722  result = (IndexBuildResult *) palloc(sizeof(IndexBuildResult));
723 
724  result->heap_tuples = reltuples;
725  result->index_tuples = idxtuples;
726 
727  return result;
728 }
#define BRIN_CURRENT_VERSION
Definition: brin_page.h:72
#define BRIN_METAPAGE_BLKNO
Definition: brin_page.h:75
#define SizeOfBrinCreateIdx
Definition: brin_xlog.h:55
void brinRevmapTerminate(BrinRevmap *revmap)
Definition: brin_revmap.c:103
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1450
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
#define XLOG_BRIN_CREATE_INDEX
Definition: brin_xlog.h:31
#define REGBUF_WILL_INIT
Definition: xloginsert.h:32
static void brinbuildCallback(Relation index, HeapTuple htup, Datum *values, bool *isnull, bool tupleIsAlive, void *brstate)
Definition: brin.c:584
uint32 BlockNumber
Definition: block.h:31
static void form_and_insert_tuple(BrinBuildState *state)
Definition: brin.c:1339
#define P_NEW
Definition: bufmgr.h:82
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
#define BrinGetPagesPerRange(relation)
Definition: brin.h:40
void brin_metapage_init(Page page, BlockNumber pagesPerRange, uint16 version)
Definition: brin_pageops.c:476
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3332
#define ERROR
Definition: elog.h:43
BrinRevmap * bs_rmAccess
Definition: brin.c:49
#define RelationGetRelationName(relation)
Definition: rel.h:436
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:664
Definition: regguts.h:298
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
BrinRevmap * brinRevmapInitialize(Relation idxrel, BlockNumber *pagesPerRange, Snapshot snapshot)
Definition: brin_revmap.c:71
#define RelationNeedsWAL(relation)
Definition: rel.h:505
int bs_numtuples
Definition: brin.c:45
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2605
double IndexBuildHeapScan(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool allow_sync, IndexBuildCallback callback, void *callback_state)
Definition: index.c:2175
void * palloc(Size size)
Definition: mcxt.c:848
BlockNumber pagesPerRange
Definition: brin_xlog.h:52
static BrinBuildState * initialize_brin_buildstate(Relation idxRel, BrinRevmap *revmap, BlockNumber pagesPerRange)
Definition: brin.c:1087
#define elog
Definition: elog.h:219
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
double index_tuples
Definition: genam.h:33
double heap_tuples
Definition: genam.h:32
static void terminate_brin_buildstate(BrinBuildState *state)
Definition: brin.c:1112
static void brinbuildCallback ( Relation  index,
HeapTuple  htup,
Datum values,
bool isnull,
bool  tupleIsAlive,
void *  brstate 
)
static

Definition at line 584 of file brin.c.

References BrinDesc::bd_tupdesc, BRIN_elog, brin_memtuple_initialize(), BRIN_PROCNUM_ADDVALUE, BrinBuildState::bs_bdesc, BrinBuildState::bs_currRangeStart, BrinBuildState::bs_dtuple, BrinBuildState::bs_pagesPerRange, BrinMemTuple::bt_columns, DEBUG2, form_and_insert_tuple(), FunctionCall4Coll(), i, index_getprocinfo(), ItemPointerGetBlockNumber, tupleDesc::natts, PointerGetDatum, HeapTupleData::t_self, and TupleDescAttr.

Referenced by brinbuild(), and summarize_range().

590 {
591  BrinBuildState *state = (BrinBuildState *) brstate;
592  BlockNumber thisblock;
593  int i;
594 
595  thisblock = ItemPointerGetBlockNumber(&htup->t_self);
596 
597  /*
598  * If we're in a block that belongs to a future range, summarize what
599  * we've got and start afresh. Note the scan might have skipped many
600  * pages, if they were devoid of live tuples; make sure to insert index
601  * tuples for those too.
602  */
603  while (thisblock > state->bs_currRangeStart + state->bs_pagesPerRange - 1)
604  {
605 
606  BRIN_elog((DEBUG2,
607  "brinbuildCallback: completed a range: %u--%u",
608  state->bs_currRangeStart,
609  state->bs_currRangeStart + state->bs_pagesPerRange));
610 
611  /* create the index tuple and insert it */
612  form_and_insert_tuple(state);
613 
614  /* set state to correspond to the next range */
615  state->bs_currRangeStart += state->bs_pagesPerRange;
616 
617  /* re-initialize state for it */
619  }
620 
621  /* Accumulate the current tuple into the running state */
622  for (i = 0; i < state->bs_bdesc->bd_tupdesc->natts; i++)
623  {
624  FmgrInfo *addValue;
625  BrinValues *col;
627 
628  col = &state->bs_dtuple->bt_columns[i];
629  addValue = index_getprocinfo(index, i + 1,
631 
632  /*
633  * Update dtuple state, if and as necessary.
634  */
635  FunctionCall4Coll(addValue,
636  attr->attcollation,
637  PointerGetDatum(state->bs_bdesc),
638  PointerGetDatum(col),
639  values[i], isnull[i]);
640  }
641 }
Definition: fmgr.h:56
#define BRIN_elog(args)
Definition: brin_internal.h:81
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:855
#define PointerGetDatum(X)
Definition: postgres.h:562
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:84
Datum FunctionCall4Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4)
Definition: fmgr.c:1094
uint32 BlockNumber
Definition: block.h:31
static void form_and_insert_tuple(BrinBuildState *state)
Definition: brin.c:1339
BlockNumber bs_currRangeStart
Definition: brin.c:48
int natts
Definition: tupdesc.h:73
#define BRIN_PROCNUM_ADDVALUE
Definition: brin_internal.h:68
BlockNumber bs_pagesPerRange
Definition: brin.c:47
ItemPointerData t_self
Definition: htup.h:65
#define DEBUG2
Definition: elog.h:24
BrinValues bt_columns[FLEXIBLE_ARRAY_MEMBER]
Definition: brin_tuple.h:46
TupleDesc bd_tupdesc
Definition: brin_internal.h:50
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
Definition: regguts.h:298
static Datum values[MAXATTR]
Definition: bootstrap.c:164
int i
BrinMemTuple * bs_dtuple
Definition: brin.c:51
BrinDesc * bs_bdesc
Definition: brin.c:50
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:76
BrinMemTuple * brin_memtuple_initialize(BrinMemTuple *dtuple, BrinDesc *brdesc)
Definition: brin_tuple.c:384
void brinbuildempty ( Relation  index)

Definition at line 731 of file brin.c.

References BRIN_CURRENT_VERSION, brin_metapage_init(), BrinGetPagesPerRange, BUFFER_LOCK_EXCLUSIVE, BufferGetPage, END_CRIT_SECTION, INIT_FORKNUM, LockBuffer(), log_newpage_buffer(), MarkBufferDirty(), P_NEW, RBM_NORMAL, ReadBufferExtended(), START_CRIT_SECTION, and UnlockReleaseBuffer().

Referenced by brinhandler().

732 {
733  Buffer metabuf;
734 
735  /* An empty BRIN index has a metapage only. */
736  metabuf =
739 
740  /* Initialize and xlog metabuffer. */
744  MarkBufferDirty(metabuf);
745  log_newpage_buffer(metabuf, false);
747 
748  UnlockReleaseBuffer(metabuf);
749 }
#define BRIN_CURRENT_VERSION
Definition: brin_page.h:72
XLogRecPtr log_newpage_buffer(Buffer buffer, bool page_std)
Definition: xloginsert.c:1009
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1450
Buffer ReadBufferExtended(Relation reln, ForkNumber forkNum, BlockNumber blockNum, ReadBufferMode mode, BufferAccessStrategy strategy)
Definition: bufmgr.c:640
#define END_CRIT_SECTION()
Definition: miscadmin.h:133
#define START_CRIT_SECTION()
Definition: miscadmin.h:131
#define P_NEW
Definition: bufmgr.h:82
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
#define BrinGetPagesPerRange(relation)
Definition: brin.h:40
void brin_metapage_init(Page page, BlockNumber pagesPerRange, uint16 version)
Definition: brin_pageops.c:476
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3332
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
int Buffer
Definition: buf.h:23
IndexBulkDeleteResult* brinbulkdelete ( IndexVacuumInfo info,
IndexBulkDeleteResult stats,
IndexBulkDeleteCallback  callback,
void *  callback_state 
)

Definition at line 761 of file brin.c.

References palloc0().

Referenced by brinhandler().

763 {
764  /* allocate stats if first time through, else re-use existing struct */
765  if (stats == NULL)
767 
768  return stats;
769 }
void * palloc0(Size size)
Definition: mcxt.c:877
void brinendscan ( IndexScanDesc  scan)

Definition at line 567 of file brin.c.

References BrinOpaque::bo_bdesc, BrinOpaque::bo_rmAccess, brin_free_desc(), brinRevmapTerminate(), IndexScanDescData::opaque, and pfree().

Referenced by brinhandler().

568 {
569  BrinOpaque *opaque = (BrinOpaque *) scan->opaque;
570 
572  brin_free_desc(opaque->bo_bdesc);
573  pfree(opaque);
574 }
void brin_free_desc(BrinDesc *bdesc)
Definition: brin.c:1054
void brinRevmapTerminate(BrinRevmap *revmap)
Definition: brin_revmap.c:103
void pfree(void *pointer)
Definition: mcxt.c:949
BrinRevmap * bo_rmAccess
Definition: brin.c:60
BrinDesc * bo_bdesc
Definition: brin.c:61
int64 bringetbitmap ( IndexScanDesc  scan,
TIDBitmap tbm 
)

Definition at line 353 of file brin.c.

References AccessShareLock, addrange(), ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate(), Assert, BrinDesc::bd_tupdesc, BrinOpaque::bo_bdesc, BrinOpaque::bo_pagesPerRange, BrinOpaque::bo_rmAccess, brin_copy_tuple(), brin_deform_tuple(), brin_new_memtuple(), BRIN_PROCNUM_CONSISTENT, brinGetTupleForHeapBlock(), BrinMemTuple::bt_columns, BrinMemTuple::bt_placeholder, buf, BUFFER_LOCK_SHARE, BUFFER_LOCK_UNLOCK, CHECK_FOR_INTERRUPTS, CurrentMemoryContext, DatumGetBool, fmgr_info_copy(), FunctionCall3Coll(), heap_close, heap_open(), index_getprocinfo(), IndexGetRelation(), IndexScanDescData::indexRelation, InvalidBuffer, InvalidOid, IndexScanDescData::keyData, LockBuffer(), MemoryContextDelete(), MemoryContextResetAndDeleteChildren, MemoryContextSwitchTo(), tupleDesc::natts, IndexScanDescData::numberOfKeys, IndexScanDescData::opaque, palloc0(), pgstat_count_index_scan, PointerGetDatum, RelationGetNumberOfBlocks, RelationGetRelid, ReleaseBuffer(), ScanKeyData::sk_attno, ScanKeyData::sk_collation, ScanKeyData::sk_flags, SK_ISNULL, tbm_add_page(), TupleDescAttr, and IndexScanDescData::xs_snapshot.

Referenced by brinhandler().

354 {
355  Relation idxRel = scan->indexRelation;
357  BrinDesc *bdesc;
358  Oid heapOid;
359  Relation heapRel;
360  BrinOpaque *opaque;
361  BlockNumber nblocks;
362  BlockNumber heapBlk;
363  int totalpages = 0;
364  FmgrInfo *consistentFn;
365  MemoryContext oldcxt;
366  MemoryContext perRangeCxt;
367  BrinMemTuple *dtup;
368  BrinTuple *btup = NULL;
369  Size btupsz = 0;
370 
371  opaque = (BrinOpaque *) scan->opaque;
372  bdesc = opaque->bo_bdesc;
373  pgstat_count_index_scan(idxRel);
374 
375  /*
376  * We need to know the size of the table so that we know how long to
377  * iterate on the revmap.
378  */
379  heapOid = IndexGetRelation(RelationGetRelid(idxRel), false);
380  heapRel = heap_open(heapOid, AccessShareLock);
381  nblocks = RelationGetNumberOfBlocks(heapRel);
382  heap_close(heapRel, AccessShareLock);
383 
384  /*
385  * Make room for the consistent support procedures of indexed columns. We
386  * don't look them up here; we do that lazily the first time we see a scan
387  * key reference each of them. We rely on zeroing fn_oid to InvalidOid.
388  */
389  consistentFn = palloc0(sizeof(FmgrInfo) * bdesc->bd_tupdesc->natts);
390 
391  /* allocate an initial in-memory tuple, out of the per-range memcxt */
392  dtup = brin_new_memtuple(bdesc);
393 
394  /*
395  * Setup and use a per-range memory context, which is reset every time we
396  * loop below. This avoids having to free the tuples within the loop.
397  */
399  "bringetbitmap cxt",
401  oldcxt = MemoryContextSwitchTo(perRangeCxt);
402 
403  /*
404  * Now scan the revmap. We start by querying for heap page 0,
405  * incrementing by the number of pages per range; this gives us a full
406  * view of the table.
407  */
408  for (heapBlk = 0; heapBlk < nblocks; heapBlk += opaque->bo_pagesPerRange)
409  {
410  bool addrange;
411  bool gottuple = false;
412  BrinTuple *tup;
413  OffsetNumber off;
414  Size size;
415 
417 
419 
420  tup = brinGetTupleForHeapBlock(opaque->bo_rmAccess, heapBlk, &buf,
421  &off, &size, BUFFER_LOCK_SHARE,
422  scan->xs_snapshot);
423  if (tup)
424  {
425  gottuple = true;
426  btup = brin_copy_tuple(tup, size, btup, &btupsz);
428  }
429 
430  /*
431  * For page ranges with no indexed tuple, we must return the whole
432  * range; otherwise, compare it to the scan keys.
433  */
434  if (!gottuple)
435  {
436  addrange = true;
437  }
438  else
439  {
440  dtup = brin_deform_tuple(bdesc, btup, dtup);
441  if (dtup->bt_placeholder)
442  {
443  /*
444  * Placeholder tuples are always returned, regardless of the
445  * values stored in them.
446  */
447  addrange = true;
448  }
449  else
450  {
451  int keyno;
452 
453  /*
454  * Compare scan keys with summary values stored for the range.
455  * If scan keys are matched, the page range must be added to
456  * the bitmap. We initially assume the range needs to be
457  * added; in particular this serves the case where there are
458  * no keys.
459  */
460  addrange = true;
461  for (keyno = 0; keyno < scan->numberOfKeys; keyno++)
462  {
463  ScanKey key = &scan->keyData[keyno];
464  AttrNumber keyattno = key->sk_attno;
465  BrinValues *bval = &dtup->bt_columns[keyattno - 1];
466  Datum add;
467 
468  /*
469  * The collation of the scan key must match the collation
470  * used in the index column (but only if the search is not
471  * IS NULL/ IS NOT NULL). Otherwise we shouldn't be using
472  * this index ...
473  */
474  Assert((key->sk_flags & SK_ISNULL) ||
475  (key->sk_collation ==
476  TupleDescAttr(bdesc->bd_tupdesc,
477  keyattno - 1)->attcollation));
478 
479  /* First time this column? look up consistent function */
480  if (consistentFn[keyattno - 1].fn_oid == InvalidOid)
481  {
482  FmgrInfo *tmp;
483 
484  tmp = index_getprocinfo(idxRel, keyattno,
486  fmgr_info_copy(&consistentFn[keyattno - 1], tmp,
488  }
489 
490  /*
491  * Check whether the scan key is consistent with the page
492  * range values; if so, have the pages in the range added
493  * to the output bitmap.
494  *
495  * When there are multiple scan keys, failure to meet the
496  * criteria for a single one of them is enough to discard
497  * the range as a whole, so break out of the loop as soon
498  * as a false return value is obtained.
499  */
500  add = FunctionCall3Coll(&consistentFn[keyattno - 1],
501  key->sk_collation,
502  PointerGetDatum(bdesc),
503  PointerGetDatum(bval),
504  PointerGetDatum(key));
505  addrange = DatumGetBool(add);
506  if (!addrange)
507  break;
508  }
509  }
510  }
511 
512  /* add the pages in the range to the output bitmap, if needed */
513  if (addrange)
514  {
515  BlockNumber pageno;
516 
517  for (pageno = heapBlk;
518  pageno <= heapBlk + opaque->bo_pagesPerRange - 1;
519  pageno++)
520  {
521  MemoryContextSwitchTo(oldcxt);
522  tbm_add_page(tbm, pageno);
523  totalpages++;
524  MemoryContextSwitchTo(perRangeCxt);
525  }
526  }
527  }
528 
529  MemoryContextSwitchTo(oldcxt);
530  MemoryContextDelete(perRangeCxt);
531 
532  if (buf != InvalidBuffer)
533  ReleaseBuffer(buf);
534 
535  /*
536  * XXX We have an approximation of the number of *pages* that our scan
537  * returns, but we don't have a precise idea of the number of heap tuples
538  * involved.
539  */
540  return totalpages * 10;
541 }
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
Definition: fmgr.h:56
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3281
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:200
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:855
BrinTuple * brin_copy_tuple(BrinTuple *tuple, Size len, BrinTuple *dest, Size *destsz)
Definition: brin_tuple.c:321
BrinTuple * brinGetTupleForHeapBlock(BrinRevmap *revmap, BlockNumber heapBlk, Buffer *buf, OffsetNumber *off, Size *size, int mode, Snapshot snapshot)
Definition: brin_revmap.c:197
#define PointerGetDatum(X)
Definition: postgres.h:562
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:84
static void addrange(struct cvec *cv, chr from, chr to)
Definition: regc_cvec.c:90
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define AccessShareLock
Definition: lockdefs.h:36
Snapshot xs_snapshot
Definition: relscan.h:91
#define InvalidBuffer
Definition: buf.h:25
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
#define heap_close(r, l)
Definition: heapam.h:97
unsigned int Oid
Definition: postgres_ext.h:31
BrinMemTuple * brin_new_memtuple(BrinDesc *brdesc)
Definition: brin_tuple.c:357
int natts
Definition: tupdesc.h:73
BlockNumber bo_pagesPerRange
Definition: brin.c:59
Relation indexRelation
Definition: relscan.h:90
uint16 OffsetNumber
Definition: off.h:24
BrinMemTuple * brin_deform_tuple(BrinDesc *brdesc, BrinTuple *tuple, BrinMemTuple *dMemtuple)
Definition: brin_tuple.c:422
bool bt_placeholder
Definition: brin_tuple.h:38
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:165
void fmgr_info_copy(FmgrInfo *dstinfo, FmgrInfo *srcinfo, MemoryContext destcxt)
Definition: fmgr.c:524
BrinValues bt_columns[FLEXIBLE_ARRAY_MEMBER]
Definition: brin_tuple.h:46
static char * buf
Definition: pg_test_fsync.c:67
BrinRevmap * bo_rmAccess
Definition: brin.c:60
#define DatumGetBool(X)
Definition: postgres.h:399
#define pgstat_count_index_scan(rel)
Definition: pgstat.h:1275
TupleDesc bd_tupdesc
Definition: brin_internal.h:50
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
#define SK_ISNULL
Definition: skey.h:115
#define MemoryContextResetAndDeleteChildren(ctx)
Definition: memutils.h:67
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
BrinDesc * bo_bdesc
Definition: brin.c:61
void * palloc0(Size size)
Definition: mcxt.c:877
uintptr_t Datum
Definition: postgres.h:372
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
#define InvalidOid
Definition: postgres_ext.h:36
Datum FunctionCall3Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2, Datum arg3)
Definition: fmgr.c:1069
int sk_flags
Definition: skey.h:66
#define Assert(condition)
Definition: c.h:664
#define BRIN_PROCNUM_CONSISTENT
Definition: brin_internal.h:69
size_t Size
Definition: c.h:350
ScanKey keyData
Definition: relscan.h:94
void tbm_add_page(TIDBitmap *tbm, BlockNumber pageno)
Definition: tidbitmap.c:453
Oid sk_collation
Definition: skey.h:70
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
int Buffer
Definition: buf.h:23
int16 AttrNumber
Definition: attnum.h:21
#define RelationGetRelid(relation)
Definition: rel.h:416
AttrNumber sk_attno
Definition: skey.h:67
void brinGetStats ( Relation  index,
BrinStatsData stats 
)

Definition at line 1066 of file brin.c.

References BRIN_METAPAGE_BLKNO, BUFFER_LOCK_SHARE, BufferGetPage, BrinMetaPageData::lastRevmapPage, LockBuffer(), PageGetContents, BrinStatsData::pagesPerRange, BrinMetaPageData::pagesPerRange, ReadBuffer(), BrinStatsData::revmapNumPages, and UnlockReleaseBuffer().

Referenced by brincostestimate().

1067 {
1068  Buffer metabuffer;
1069  Page metapage;
1070  BrinMetaPageData *metadata;
1071 
1072  metabuffer = ReadBuffer(index, BRIN_METAPAGE_BLKNO);
1073  LockBuffer(metabuffer, BUFFER_LOCK_SHARE);
1074  metapage = BufferGetPage(metabuffer);
1075  metadata = (BrinMetaPageData *) PageGetContents(metapage);
1076 
1077  stats->pagesPerRange = metadata->pagesPerRange;
1078  stats->revmapNumPages = metadata->lastRevmapPage - 1;
1079 
1080  UnlockReleaseBuffer(metabuffer);
1081 }
#define BRIN_METAPAGE_BLKNO
Definition: brin_page.h:75
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3332
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
BlockNumber lastRevmapPage
Definition: brin_page.h:69
#define PageGetContents(page)
Definition: bufpage.h:242
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
BlockNumber pagesPerRange
Definition: brin.h:34
BlockNumber pagesPerRange
Definition: brin_page.h:68
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:74
BlockNumber revmapNumPages
Definition: brin.h:35
Datum brinhandler ( PG_FUNCTION_ARGS  )

Definition at line 82 of file brin.c.

References IndexAmRoutine::ambeginscan, IndexAmRoutine::ambuild, IndexAmRoutine::ambuildempty, IndexAmRoutine::ambulkdelete, IndexAmRoutine::amcanbackward, 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, BRIN_LAST_OPTIONAL_PROCNUM, brinbeginscan(), brinbuild(), brinbuildempty(), brinbulkdelete(), brincostestimate(), brinendscan(), bringetbitmap(), brininsert(), brinoptions(), brinrescan(), brinvacuumcleanup(), brinvalidate(), InvalidOid, makeNode, and PG_RETURN_POINTER.

83 {
85 
86  amroutine->amstrategies = 0;
88  amroutine->amcanorder = false;
89  amroutine->amcanorderbyop = false;
90  amroutine->amcanbackward = false;
91  amroutine->amcanunique = false;
92  amroutine->amcanmulticol = true;
93  amroutine->amoptionalkey = true;
94  amroutine->amsearcharray = false;
95  amroutine->amsearchnulls = true;
96  amroutine->amstorage = true;
97  amroutine->amclusterable = false;
98  amroutine->ampredlocks = false;
99  amroutine->amcanparallel = false;
100  amroutine->amkeytype = InvalidOid;
101 
102  amroutine->ambuild = brinbuild;
103  amroutine->ambuildempty = brinbuildempty;
104  amroutine->aminsert = brininsert;
105  amroutine->ambulkdelete = brinbulkdelete;
106  amroutine->amvacuumcleanup = brinvacuumcleanup;
107  amroutine->amcanreturn = NULL;
108  amroutine->amcostestimate = brincostestimate;
109  amroutine->amoptions = brinoptions;
110  amroutine->amproperty = NULL;
111  amroutine->amvalidate = brinvalidate;
112  amroutine->ambeginscan = brinbeginscan;
113  amroutine->amrescan = brinrescan;
114  amroutine->amgettuple = NULL;
115  amroutine->amgetbitmap = bringetbitmap;
116  amroutine->amendscan = brinendscan;
117  amroutine->ammarkpos = NULL;
118  amroutine->amrestrpos = NULL;
119  amroutine->amestimateparallelscan = NULL;
120  amroutine->aminitparallelscan = NULL;
121  amroutine->amparallelrescan = NULL;
122 
123  PG_RETURN_POINTER(amroutine);
124 }
IndexBulkDeleteResult * brinbulkdelete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: brin.c:761
ambeginscan_function ambeginscan
Definition: amapi.h:208
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:321
ambulkdelete_function ambulkdelete
Definition: amapi.h:201
bool amcanmulticol
Definition: amapi.h:179
uint16 amsupport
Definition: amapi.h:169
IndexBuildResult * brinbuild(Relation heap, Relation index, IndexInfo *indexInfo)
Definition: brin.c:647
bool brininsert(Relation idxRel, Datum *values, bool *nulls, ItemPointer heaptid, Relation heapRel, IndexUniqueCheck checkUnique, IndexInfo *indexInfo)
Definition: brin.c:139
amgettuple_function amgettuple
Definition: amapi.h:210
bool amcanorderbyop
Definition: amapi.h:173
amproperty_function amproperty
Definition: amapi.h:206
bool brinvalidate(Oid opclassoid)
Definition: brin_validate.c:38
amparallelrescan_function amparallelrescan
Definition: amapi.h:219
bool amstorage
Definition: amapi.h:187
int64 bringetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
Definition: brin.c:353
bool ampredlocks
Definition: amapi.h:191
aminsert_function aminsert
Definition: amapi.h:200
Oid amkeytype
Definition: amapi.h:195
bool amoptionalkey
Definition: amapi.h:181
void brinendscan(IndexScanDesc scan)
Definition: brin.c:567
amvalidate_function amvalidate
Definition: amapi.h:207
bytea * brinoptions(Datum reloptions, bool validate)
Definition: brin.c:806
amgetbitmap_function amgetbitmap
Definition: amapi.h:211
ambuild_function ambuild
Definition: amapi.h:198
amoptions_function amoptions
Definition: amapi.h:205
amcostestimate_function amcostestimate
Definition: amapi.h:204
bool amcanunique
Definition: amapi.h:177
amvacuumcleanup_function amvacuumcleanup
Definition: amapi.h:202
amendscan_function amendscan
Definition: amapi.h:212
bool amcanbackward
Definition: amapi.h:175
void brinrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
Definition: brin.c:547
amrescan_function amrescan
Definition: amapi.h:209
bool amcanparallel
Definition: amapi.h:193
IndexScanDesc brinbeginscan(Relation r, int nkeys, int norderbys)
Definition: brin.c:324
bool amsearchnulls
Definition: amapi.h:185
bool amclusterable
Definition: amapi.h:189
bool amsearcharray
Definition: amapi.h:183
#define InvalidOid
Definition: postgres_ext.h:36
#define makeNode(_type_)
Definition: nodes.h:557
void brincostestimate(PlannerInfo *root, IndexPath *path, double loop_count, Cost *indexStartupCost, Cost *indexTotalCost, Selectivity *indexSelectivity, double *indexCorrelation, double *indexPages)
Definition: selfuncs.c:7886
ammarkpos_function ammarkpos
Definition: amapi.h:213
bool amcanorder
Definition: amapi.h:171
amestimateparallelscan_function amestimateparallelscan
Definition: amapi.h:217
#define BRIN_LAST_OPTIONAL_PROCNUM
Definition: brin_internal.h:74
uint16 amstrategies
Definition: amapi.h:167
ambuildempty_function ambuildempty
Definition: amapi.h:199
IndexBulkDeleteResult * brinvacuumcleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
Definition: brin.c:776
void brinbuildempty(Relation index)
Definition: brin.c:731
amcanreturn_function amcanreturn
Definition: amapi.h:203
aminitparallelscan_function aminitparallelscan
Definition: amapi.h:218
amrestrpos_function amrestrpos
Definition: amapi.h:214
bool brininsert ( Relation  idxRel,
Datum values,
bool nulls,
ItemPointer  heaptid,
Relation  heapRel,
IndexUniqueCheck  checkUnique,
IndexInfo indexInfo 
)

Definition at line 139 of file brin.c.

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate(), AutoVacuumRequestWork(), AVW_BRINSummarizeRange, BrinDesc::bd_tupdesc, brin_build_desc(), brin_can_do_samepage_update(), brin_copy_tuple(), brin_deform_tuple(), brin_doupdate(), brin_form_tuple(), BRIN_PROCNUM_ADDVALUE, BrinGetAutoSummarize, brinGetTupleForHeapBlock(), brinRevmapInitialize(), brinRevmapTerminate(), BrinMemTuple::bt_columns, buf, BUFFER_LOCK_SHARE, BUFFER_LOCK_UNLOCK, BufferGetPage, BufferIsValid, CHECK_FOR_INTERRUPTS, CurrentMemoryContext, DatumGetBool, FirstOffsetNumber, FunctionCall4Coll(), IndexInfo::ii_AmCache, IndexInfo::ii_Context, index_getprocinfo(), InvalidBuffer, ItemIdGetLength, ItemPointerGetBlockNumber, ItemPointerGetOffsetNumber, LockBuffer(), MemoryContextDelete(), MemoryContextResetAndDeleteChildren, MemoryContextSwitchTo(), tupleDesc::natts, PageGetItemId, PointerGetDatum, RelationData::rd_indcollation, RelationGetRelid, and ReleaseBuffer().

Referenced by brinhandler().

143 {
144  BlockNumber pagesPerRange;
145  BlockNumber origHeapBlk;
146  BlockNumber heapBlk;
147  BrinDesc *bdesc = (BrinDesc *) indexInfo->ii_AmCache;
148  BrinRevmap *revmap;
150  MemoryContext tupcxt = NULL;
152  bool autosummarize = BrinGetAutoSummarize(idxRel);
153 
154  revmap = brinRevmapInitialize(idxRel, &pagesPerRange, NULL);
155 
156  /*
157  * origHeapBlk is the block number where the insertion occurred. heapBlk
158  * is the first block in the corresponding page range.
159  */
160  origHeapBlk = ItemPointerGetBlockNumber(heaptid);
161  heapBlk = (origHeapBlk / pagesPerRange) * pagesPerRange;
162 
163  for (;;)
164  {
165  bool need_insert = false;
166  OffsetNumber off;
167  BrinTuple *brtup;
168  BrinMemTuple *dtup;
169  int keyno;
170 
172 
173  /*
174  * If auto-summarization is enabled and we just inserted the first
175  * tuple into the first block of a new non-first page range, request a
176  * summarization run of the previous range.
177  */
178  if (autosummarize &&
179  heapBlk > 0 &&
180  heapBlk == origHeapBlk &&
182  {
183  BlockNumber lastPageRange = heapBlk - 1;
184  BrinTuple *lastPageTuple;
185 
186  lastPageTuple =
187  brinGetTupleForHeapBlock(revmap, lastPageRange, &buf, &off,
188  NULL, BUFFER_LOCK_SHARE, NULL);
189  if (!lastPageTuple)
191  RelationGetRelid(idxRel),
192  lastPageRange);
193  else
195  }
196 
197  brtup = brinGetTupleForHeapBlock(revmap, heapBlk, &buf, &off,
198  NULL, BUFFER_LOCK_SHARE, NULL);
199 
200  /* if range is unsummarized, there's nothing to do */
201  if (!brtup)
202  break;
203 
204  /* First time through in this statement? */
205  if (bdesc == NULL)
206  {
207  MemoryContextSwitchTo(indexInfo->ii_Context);
208  bdesc = brin_build_desc(idxRel);
209  indexInfo->ii_AmCache = (void *) bdesc;
210  MemoryContextSwitchTo(oldcxt);
211  }
212  /* First time through in this brininsert call? */
213  if (tupcxt == NULL)
214  {
216  "brininsert cxt",
218  MemoryContextSwitchTo(tupcxt);
219  }
220 
221  dtup = brin_deform_tuple(bdesc, brtup, NULL);
222 
223  /*
224  * Compare the key values of the new tuple to the stored index values;
225  * our deformed tuple will get updated if the new tuple doesn't fit
226  * the original range (note this means we can't break out of the loop
227  * early). Make a note of whether this happens, so that we know to
228  * insert the modified tuple later.
229  */
230  for (keyno = 0; keyno < bdesc->bd_tupdesc->natts; keyno++)
231  {
232  Datum result;
233  BrinValues *bval;
234  FmgrInfo *addValue;
235 
236  bval = &dtup->bt_columns[keyno];
237  addValue = index_getprocinfo(idxRel, keyno + 1,
239  result = FunctionCall4Coll(addValue,
240  idxRel->rd_indcollation[keyno],
241  PointerGetDatum(bdesc),
242  PointerGetDatum(bval),
243  values[keyno],
244  nulls[keyno]);
245  /* if that returned true, we need to insert the updated tuple */
246  need_insert |= DatumGetBool(result);
247  }
248 
249  if (!need_insert)
250  {
251  /*
252  * The tuple is consistent with the new values, so there's nothing
253  * to do.
254  */
256  }
257  else
258  {
259  Page page = BufferGetPage(buf);
260  ItemId lp = PageGetItemId(page, off);
261  Size origsz;
262  BrinTuple *origtup;
263  Size newsz;
264  BrinTuple *newtup;
265  bool samepage;
266 
267  /*
268  * Make a copy of the old tuple, so that we can compare it after
269  * re-acquiring the lock.
270  */
271  origsz = ItemIdGetLength(lp);
272  origtup = brin_copy_tuple(brtup, origsz, NULL, NULL);
273 
274  /*
275  * Before releasing the lock, check if we can attempt a same-page
276  * update. Another process could insert a tuple concurrently in
277  * the same page though, so downstream we must be prepared to cope
278  * if this turns out to not be possible after all.
279  */
280  newtup = brin_form_tuple(bdesc, heapBlk, dtup, &newsz);
281  samepage = brin_can_do_samepage_update(buf, origsz, newsz);
283 
284  /*
285  * Try to update the tuple. If this doesn't work for whatever
286  * reason, we need to restart from the top; the revmap might be
287  * pointing at a different tuple for this block now, so we need to
288  * recompute to ensure both our new heap tuple and the other
289  * inserter's are covered by the combined tuple. It might be that
290  * we don't need to update at all.
291  */
292  if (!brin_doupdate(idxRel, pagesPerRange, revmap, heapBlk,
293  buf, off, origtup, origsz, newtup, newsz,
294  samepage))
295  {
296  /* no luck; start over */
298  continue;
299  }
300  }
301 
302  /* success! */
303  break;
304  }
305 
306  brinRevmapTerminate(revmap);
307  if (BufferIsValid(buf))
309  MemoryContextSwitchTo(oldcxt);
310  if (tupcxt != NULL)
311  MemoryContextDelete(tupcxt);
312 
313  return false;
314 }
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
MemoryContext ii_Context
Definition: execnodes.h:151
Definition: fmgr.h:56
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:200
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:855
BrinTuple * brin_copy_tuple(BrinTuple *tuple, Size len, BrinTuple *dest, Size *destsz)
Definition: brin_tuple.c:321
void brinRevmapTerminate(BrinRevmap *revmap)
Definition: brin_revmap.c:103
BrinTuple * brinGetTupleForHeapBlock(BrinRevmap *revmap, BlockNumber heapBlk, Buffer *buf, OffsetNumber *off, Size *size, int mode, Snapshot snapshot)
Definition: brin_revmap.c:197
#define PointerGetDatum(X)
Definition: postgres.h:562
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define InvalidBuffer
Definition: buf.h:25
Datum FunctionCall4Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4)
Definition: fmgr.c:1094
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
bool brin_doupdate(Relation idxrel, BlockNumber pagesPerRange, BrinRevmap *revmap, BlockNumber heapBlk, Buffer oldbuf, OffsetNumber oldoff, const BrinTuple *origtup, Size origsz, const BrinTuple *newtup, Size newsz, bool samepage)
Definition: brin_pageops.c:55
int natts
Definition: tupdesc.h:73
uint16 OffsetNumber
Definition: off.h:24
BrinMemTuple * brin_deform_tuple(BrinDesc *brdesc, BrinTuple *tuple, BrinMemTuple *dMemtuple)
Definition: brin_tuple.c:422
#define BRIN_PROCNUM_ADDVALUE
Definition: brin_internal.h:68
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
Oid * rd_indcollation
Definition: rel.h:193
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:165
BrinValues bt_columns[FLEXIBLE_ARRAY_MEMBER]
Definition: brin_tuple.h:46
static char * buf
Definition: pg_test_fsync.c:67
#define FirstOffsetNumber
Definition: off.h:27
#define DatumGetBool(X)
Definition: postgres.h:399
TupleDesc bd_tupdesc
Definition: brin_internal.h:50
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
bool brin_can_do_samepage_update(Buffer buffer, Size origsz, Size newsz)
Definition: brin_pageops.c:321
void * ii_AmCache
Definition: execnodes.h:150
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:231
#define MemoryContextResetAndDeleteChildren(ctx)
Definition: memutils.h:67
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
uintptr_t Datum
Definition: postgres.h:372
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
BrinDesc * brin_build_desc(Relation rel)
Definition: brin.c:999
size_t Size
Definition: c.h:350
BrinRevmap * brinRevmapInitialize(Relation idxrel, BlockNumber *pagesPerRange, Snapshot snapshot)
Definition: brin_revmap.c:71
#define BufferIsValid(bufnum)
Definition: bufmgr.h:114
#define ItemPointerGetOffsetNumber(pointer)
Definition: itemptr.h:95
static Datum values[MAXATTR]
Definition: bootstrap.c:164
#define BrinGetAutoSummarize(relation)
Definition: brin.h:44
BrinTuple * brin_form_tuple(BrinDesc *brdesc, BlockNumber blkno, BrinMemTuple *tuple, Size *size)
Definition: brin_tuple.c:89
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
void AutoVacuumRequestWork(AutoVacuumWorkItemType type, Oid relationId, BlockNumber blkno)
Definition: autovacuum.c:3198
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
#define ItemPointerGetBlockNumber(pointer)
Definition: itemptr.h:76
int Buffer
Definition: buf.h:23
#define RelationGetRelid(relation)
Definition: rel.h:416
Pointer Page
Definition: bufpage.h:74
bytea* brinoptions ( Datum  reloptions,
bool  validate 
)

Definition at line 806 of file brin.c.

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

Referenced by brinhandler().

807 {
809  BrinOptions *rdopts;
810  int numoptions;
811  static const relopt_parse_elt tab[] = {
812  {"pages_per_range", RELOPT_TYPE_INT, offsetof(BrinOptions, pagesPerRange)},
813  {"autosummarize", RELOPT_TYPE_BOOL, offsetof(BrinOptions, autosummarize)}
814  };
815 
816  options = parseRelOptions(reloptions, validate, RELOPT_KIND_BRIN,
817  &numoptions);
818 
819  /* if none set, we're done */
820  if (numoptions == 0)
821  return NULL;
822 
823  rdopts = allocateReloptStruct(sizeof(BrinOptions), options, numoptions);
824 
825  fillRelOptions((void *) rdopts, sizeof(BrinOptions), options, numoptions,
826  validate, tab, lengthof(tab));
827 
828  pfree(options);
829 
830  return (bytea *) rdopts;
831 }
#define lengthof(array)
Definition: c.h:556
void pfree(void *pointer)
Definition: mcxt.c:949
void * allocateReloptStruct(Size base, relopt_value *options, int numoptions)
Definition: reloptions.c:1215
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:1239
Definition: c.h:433
relopt_value * parseRelOptions(Datum options, bool validate, relopt_kind kind, int *numrelopts)
Definition: reloptions.c:1020
#define offsetof(type, field)
Definition: c.h:549
void brinrescan ( IndexScanDesc  scan,
ScanKey  scankey,
int  nscankeys,
ScanKey  orderbys,
int  norderbys 
)

Definition at line 547 of file brin.c.

References IndexScanDescData::keyData, memmove, and IndexScanDescData::numberOfKeys.

Referenced by brinhandler().

549 {
550  /*
551  * Other index AMs preprocess the scan keys at this point, or sometime
552  * early during the scan; this lets them optimize by removing redundant
553  * keys, or doing early returns when they are impossible to satisfy; see
554  * _bt_preprocess_keys for an example. Something like that could be added
555  * here someday, too.
556  */
557 
558  if (scankey && scan->numberOfKeys > 0)
559  memmove(scan->keyData, scankey,
560  scan->numberOfKeys * sizeof(ScanKeyData));
561 }
#define memmove(d, s, c)
Definition: c.h:1047
ScanKey keyData
Definition: relscan.h:94
static void brinsummarize ( Relation  index,
Relation  heapRel,
BlockNumber  pageRange,
double *  numSummarized,
double *  numExisting 
)
static

Definition at line 1243 of file brin.c.

References Assert, BRIN_ALL_BLOCKRANGES, brin_memtuple_initialize(), brinGetTupleForHeapBlock(), brinRevmapInitialize(), brinRevmapTerminate(), BrinBuildState::bs_bdesc, BrinBuildState::bs_dtuple, buf, BUFFER_LOCK_SHARE, BUFFER_LOCK_UNLOCK, BufferIsValid, BuildIndexInfo(), CHECK_FOR_INTERRUPTS, initialize_brin_buildstate(), InvalidBuffer, LockBuffer(), pfree(), RelationGetNumberOfBlocks, ReleaseBuffer(), summarize_range(), and terminate_brin_buildstate().

Referenced by brin_summarize_range(), and brinvacuumcleanup().

1245 {
1246  BrinRevmap *revmap;
1247  BrinBuildState *state = NULL;
1248  IndexInfo *indexInfo = NULL;
1249  BlockNumber heapNumBlocks;
1250  BlockNumber heapBlk;
1251  BlockNumber pagesPerRange;
1252  Buffer buf;
1253  BlockNumber startBlk;
1254  BlockNumber endBlk;
1255 
1256  /* determine range of pages to process; nothing to do for an empty table */
1257  heapNumBlocks = RelationGetNumberOfBlocks(heapRel);
1258  if (heapNumBlocks == 0)
1259  return;
1260 
1261  revmap = brinRevmapInitialize(index, &pagesPerRange, NULL);
1262 
1263  if (pageRange == BRIN_ALL_BLOCKRANGES)
1264  {
1265  startBlk = 0;
1266  endBlk = heapNumBlocks;
1267  }
1268  else
1269  {
1270  startBlk = (pageRange / pagesPerRange) * pagesPerRange;
1271  /* Nothing to do if start point is beyond end of table */
1272  if (startBlk > heapNumBlocks)
1273  {
1274  brinRevmapTerminate(revmap);
1275  return;
1276  }
1277  endBlk = startBlk + pagesPerRange;
1278  if (endBlk > heapNumBlocks)
1279  endBlk = heapNumBlocks;
1280  }
1281 
1282  /*
1283  * Scan the revmap to find unsummarized items.
1284  */
1285  buf = InvalidBuffer;
1286  for (heapBlk = startBlk; heapBlk < endBlk; heapBlk += pagesPerRange)
1287  {
1288  BrinTuple *tup;
1289  OffsetNumber off;
1290 
1292 
1293  tup = brinGetTupleForHeapBlock(revmap, heapBlk, &buf, &off, NULL,
1294  BUFFER_LOCK_SHARE, NULL);
1295  if (tup == NULL)
1296  {
1297  /* no revmap entry for this heap range. Summarize it. */
1298  if (state == NULL)
1299  {
1300  /* first time through */
1301  Assert(!indexInfo);
1302  state = initialize_brin_buildstate(index, revmap,
1303  pagesPerRange);
1304  indexInfo = BuildIndexInfo(index);
1305  }
1306  summarize_range(indexInfo, state, heapRel, heapBlk, heapNumBlocks);
1307 
1308  /* and re-initialize state for the next range */
1310 
1311  if (numSummarized)
1312  *numSummarized += 1.0;
1313  }
1314  else
1315  {
1316  if (numExisting)
1317  *numExisting += 1.0;
1319  }
1320  }
1321 
1322  if (BufferIsValid(buf))
1323  ReleaseBuffer(buf);
1324 
1325  /* free resources */
1326  brinRevmapTerminate(revmap);
1327  if (state)
1328  {
1330  pfree(indexInfo);
1331  }
1332 }
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
void brinRevmapTerminate(BrinRevmap *revmap)
Definition: brin_revmap.c:103
BrinTuple * brinGetTupleForHeapBlock(BrinRevmap *revmap, BlockNumber heapBlk, Buffer *buf, OffsetNumber *off, Size *size, int mode, Snapshot snapshot)
Definition: brin_revmap.c:197
static void summarize_range(IndexInfo *indexInfo, BrinBuildState *state, Relation heapRel, BlockNumber heapBlk, BlockNumber heapNumBlks)
Definition: brin.c:1144
#define InvalidBuffer
Definition: buf.h:25
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:1642
uint16 OffsetNumber
Definition: off.h:24
void pfree(void *pointer)
Definition: mcxt.c:949
static char * buf
Definition: pg_test_fsync.c:67
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
#define Assert(condition)
Definition: c.h:664
Definition: regguts.h:298
BrinRevmap * brinRevmapInitialize(Relation idxrel, BlockNumber *pagesPerRange, Snapshot snapshot)
Definition: brin_revmap.c:71
#define BufferIsValid(bufnum)
Definition: bufmgr.h:114
#define BRIN_ALL_BLOCKRANGES
Definition: brin.c:64
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
BrinMemTuple * bs_dtuple
Definition: brin.c:51
static BrinBuildState * initialize_brin_buildstate(Relation idxRel, BrinRevmap *revmap, BlockNumber pagesPerRange)
Definition: brin.c:1087
BrinDesc * bs_bdesc
Definition: brin.c:50
int Buffer
Definition: buf.h:23
BrinMemTuple * brin_memtuple_initialize(BrinMemTuple *dtuple, BrinDesc *brdesc)
Definition: brin_tuple.c:384
static void terminate_brin_buildstate(BrinBuildState *state)
Definition: brin.c:1112
IndexBulkDeleteResult* brinvacuumcleanup ( IndexVacuumInfo info,
IndexBulkDeleteResult stats 
)

Definition at line 776 of file brin.c.

References AccessShareLock, IndexVacuumInfo::analyze_only, BRIN_ALL_BLOCKRANGES, brin_vacuum_scan(), brinsummarize(), heap_close, heap_open(), IndexVacuumInfo::index, IndexGetRelation(), IndexBulkDeleteResult::num_index_tuples, IndexBulkDeleteResult::num_pages, palloc0(), RelationGetNumberOfBlocks, RelationGetRelid, and IndexVacuumInfo::strategy.

Referenced by brinhandler().

777 {
778  Relation heapRel;
779 
780  /* No-op in ANALYZE ONLY mode */
781  if (info->analyze_only)
782  return stats;
783 
784  if (!stats)
786  stats->num_pages = RelationGetNumberOfBlocks(info->index);
787  /* rest of stats is initialized by zeroing */
788 
789  heapRel = heap_open(IndexGetRelation(RelationGetRelid(info->index), false),
791 
792  brin_vacuum_scan(info->index, info->strategy);
793 
794  brinsummarize(info->index, heapRel, BRIN_ALL_BLOCKRANGES,
795  &stats->num_index_tuples, &stats->num_index_tuples);
796 
797  heap_close(heapRel, AccessShareLock);
798 
799  return stats;
800 }
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3281
bool analyze_only
Definition: genam.h:47
BufferAccessStrategy strategy
Definition: genam.h:51
#define AccessShareLock
Definition: lockdefs.h:36
Relation index
Definition: genam.h:46
#define heap_close(r, l)
Definition: heapam.h:97
BlockNumber num_pages
Definition: genam.h:73
static void brin_vacuum_scan(Relation idxrel, BufferAccessStrategy strategy)
Definition: brin.c:1401
void * palloc0(Size size)
Definition: mcxt.c:877
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:199
static void brinsummarize(Relation index, Relation heapRel, BlockNumber pageRange, double *numSummarized, double *numExisting)
Definition: brin.c:1243
#define BRIN_ALL_BLOCKRANGES
Definition: brin.c:64
double num_index_tuples
Definition: genam.h:76
#define RelationGetRelid(relation)
Definition: rel.h:416
static void form_and_insert_tuple ( BrinBuildState state)
static

Definition at line 1339 of file brin.c.

References brin_doinsert(), brin_form_tuple(), BrinBuildState::bs_bdesc, BrinBuildState::bs_currentInsertBuf, BrinBuildState::bs_currRangeStart, BrinBuildState::bs_dtuple, BrinBuildState::bs_irel, BrinBuildState::bs_numtuples, BrinBuildState::bs_pagesPerRange, BrinBuildState::bs_rmAccess, and pfree().

Referenced by brinbuild(), and brinbuildCallback().

1340 {
1341  BrinTuple *tup;
1342  Size size;
1343 
1344  tup = brin_form_tuple(state->bs_bdesc, state->bs_currRangeStart,
1345  state->bs_dtuple, &size);
1346  brin_doinsert(state->bs_irel, state->bs_pagesPerRange, state->bs_rmAccess,
1347  &state->bs_currentInsertBuf, state->bs_currRangeStart,
1348  tup, size);
1349  state->bs_numtuples++;
1350 
1351  pfree(tup);
1352 }
Buffer bs_currentInsertBuf
Definition: brin.c:46
Relation bs_irel
Definition: brin.c:44
BlockNumber bs_currRangeStart
Definition: brin.c:48
OffsetNumber brin_doinsert(Relation idxrel, BlockNumber pagesPerRange, BrinRevmap *revmap, Buffer *buffer, BlockNumber heapBlk, BrinTuple *tup, Size itemsz)
Definition: brin_pageops.c:340
BlockNumber bs_pagesPerRange
Definition: brin.c:47
void pfree(void *pointer)
Definition: mcxt.c:949
BrinRevmap * bs_rmAccess
Definition: brin.c:49
size_t Size
Definition: c.h:350
int bs_numtuples
Definition: brin.c:45
BrinTuple * brin_form_tuple(BrinDesc *brdesc, BlockNumber blkno, BrinMemTuple *tuple, Size *size)
Definition: brin_tuple.c:89
BrinMemTuple * bs_dtuple
Definition: brin.c:51
BrinDesc * bs_bdesc
Definition: brin.c:50
static BrinBuildState * initialize_brin_buildstate ( Relation  idxRel,
BrinRevmap revmap,
BlockNumber  pagesPerRange 
)
static

Definition at line 1087 of file brin.c.

References brin_build_desc(), brin_memtuple_initialize(), brin_new_memtuple(), BrinBuildState::bs_bdesc, BrinBuildState::bs_currentInsertBuf, BrinBuildState::bs_currRangeStart, BrinBuildState::bs_dtuple, BrinBuildState::bs_irel, BrinBuildState::bs_numtuples, BrinBuildState::bs_pagesPerRange, BrinBuildState::bs_rmAccess, InvalidBuffer, and palloc().

Referenced by brinbuild(), and brinsummarize().

1089 {
1091 
1092  state = palloc(sizeof(BrinBuildState));
1093 
1094  state->bs_irel = idxRel;
1095  state->bs_numtuples = 0;
1097  state->bs_pagesPerRange = pagesPerRange;
1098  state->bs_currRangeStart = 0;
1099  state->bs_rmAccess = revmap;
1100  state->bs_bdesc = brin_build_desc(idxRel);
1101  state->bs_dtuple = brin_new_memtuple(state->bs_bdesc);
1102 
1104 
1105  return state;
1106 }
Buffer bs_currentInsertBuf
Definition: brin.c:46
#define InvalidBuffer
Definition: buf.h:25
BrinMemTuple * brin_new_memtuple(BrinDesc *brdesc)
Definition: brin_tuple.c:357
Relation bs_irel
Definition: brin.c:44
BlockNumber bs_currRangeStart
Definition: brin.c:48
BlockNumber bs_pagesPerRange
Definition: brin.c:47
BrinRevmap * bs_rmAccess
Definition: brin.c:49
BrinDesc * brin_build_desc(Relation rel)
Definition: brin.c:999
Definition: regguts.h:298
int bs_numtuples
Definition: brin.c:45
void * palloc(Size size)
Definition: mcxt.c:848
BrinMemTuple * bs_dtuple
Definition: brin.c:51
BrinDesc * bs_bdesc
Definition: brin.c:50
BrinMemTuple * brin_memtuple_initialize(BrinMemTuple *dtuple, BrinDesc *brdesc)
Definition: brin_tuple.c:384
static void summarize_range ( IndexInfo indexInfo,
BrinBuildState state,
Relation  heapRel,
BlockNumber  heapBlk,
BlockNumber  heapNumBlks 
)
static

Definition at line 1144 of file brin.c.

References brin_can_do_samepage_update(), brin_copy_tuple(), brin_doinsert(), brin_doupdate(), brin_form_placeholder_tuple(), brin_form_tuple(), brin_free_tuple(), brinbuildCallback(), brinGetTupleForHeapBlock(), BrinBuildState::bs_bdesc, BrinBuildState::bs_currRangeStart, BrinBuildState::bs_dtuple, BrinBuildState::bs_irel, BrinBuildState::bs_pagesPerRange, BrinBuildState::bs_rmAccess, BUFFER_LOCK_SHARE, BUFFER_LOCK_UNLOCK, CHECK_FOR_INTERRUPTS, elog, ERROR, IndexBuildHeapRangeScan(), InvalidBuffer, LockBuffer(), ReleaseBuffer(), and union_tuples().

Referenced by brinsummarize().

1146 {
1147  Buffer phbuf;
1148  BrinTuple *phtup;
1149  Size phsz;
1150  OffsetNumber offset;
1151  BlockNumber scanNumBlks;
1152 
1153  /*
1154  * Insert the placeholder tuple
1155  */
1156  phbuf = InvalidBuffer;
1157  phtup = brin_form_placeholder_tuple(state->bs_bdesc, heapBlk, &phsz);
1158  offset = brin_doinsert(state->bs_irel, state->bs_pagesPerRange,
1159  state->bs_rmAccess, &phbuf,
1160  heapBlk, phtup, phsz);
1161 
1162  /*
1163  * Execute the partial heap scan covering the heap blocks in the specified
1164  * page range, summarizing the heap tuples in it. This scan stops just
1165  * short of brinbuildCallback creating the new index entry.
1166  *
1167  * Note that it is critical we use the "any visible" mode of
1168  * IndexBuildHeapRangeScan here: otherwise, we would miss tuples inserted
1169  * by transactions that are still in progress, among other corner cases.
1170  */
1171  state->bs_currRangeStart = heapBlk;
1172  scanNumBlks = heapBlk + state->bs_pagesPerRange <= heapNumBlks ?
1173  state->bs_pagesPerRange : heapNumBlks - heapBlk;
1174  IndexBuildHeapRangeScan(heapRel, state->bs_irel, indexInfo, false, true,
1175  heapBlk, scanNumBlks,
1176  brinbuildCallback, (void *) state);
1177 
1178  /*
1179  * Now we update the values obtained by the scan with the placeholder
1180  * tuple. We do this in a loop which only terminates if we're able to
1181  * update the placeholder tuple successfully; if we are not, this means
1182  * somebody else modified the placeholder tuple after we read it.
1183  */
1184  for (;;)
1185  {
1186  BrinTuple *newtup;
1187  Size newsize;
1188  bool didupdate;
1189  bool samepage;
1190 
1192 
1193  /*
1194  * Update the summary tuple and try to update.
1195  */
1196  newtup = brin_form_tuple(state->bs_bdesc,
1197  heapBlk, state->bs_dtuple, &newsize);
1198  samepage = brin_can_do_samepage_update(phbuf, phsz, newsize);
1199  didupdate =
1200  brin_doupdate(state->bs_irel, state->bs_pagesPerRange,
1201  state->bs_rmAccess, heapBlk, phbuf, offset,
1202  phtup, phsz, newtup, newsize, samepage);
1203  brin_free_tuple(phtup);
1204  brin_free_tuple(newtup);
1205 
1206  /* If the update succeeded, we're done. */
1207  if (didupdate)
1208  break;
1209 
1210  /*
1211  * If the update didn't work, it might be because somebody updated the
1212  * placeholder tuple concurrently. Extract the new version, union it
1213  * with the values we have from the scan, and start over. (There are
1214  * other reasons for the update to fail, but it's simple to treat them
1215  * the same.)
1216  */
1217  phtup = brinGetTupleForHeapBlock(state->bs_rmAccess, heapBlk, &phbuf,
1218  &offset, &phsz, BUFFER_LOCK_SHARE,
1219  NULL);
1220  /* the placeholder tuple must exist */
1221  if (phtup == NULL)
1222  elog(ERROR, "missing placeholder tuple");
1223  phtup = brin_copy_tuple(phtup, phsz, NULL, NULL);
1225 
1226  /* merge it into the tuple from the heap scan */
1227  union_tuples(state->bs_bdesc, state->bs_dtuple, phtup);
1228  }
1229 
1230  ReleaseBuffer(phbuf);
1231 }
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:87
BrinTuple * brin_copy_tuple(BrinTuple *tuple, Size len, BrinTuple *dest, Size *destsz)
Definition: brin_tuple.c:321
static void union_tuples(BrinDesc *bdesc, BrinMemTuple *a, BrinTuple *b)
Definition: brin.c:1359
BrinTuple * brinGetTupleForHeapBlock(BrinRevmap *revmap, BlockNumber heapBlk, Buffer *buf, OffsetNumber *off, Size *size, int mode, Snapshot snapshot)
Definition: brin_revmap.c:197
#define InvalidBuffer
Definition: buf.h:25
static void brinbuildCallback(Relation index, HeapTuple htup, Datum *values, bool *isnull, bool tupleIsAlive, void *brstate)
Definition: brin.c:584
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
bool brin_doupdate(Relation idxrel, BlockNumber pagesPerRange, BrinRevmap *revmap, BlockNumber heapBlk, Buffer oldbuf, OffsetNumber oldoff, const BrinTuple *origtup, Size origsz, const BrinTuple *newtup, Size newsz, bool samepage)
Definition: brin_pageops.c:55
Relation bs_irel
Definition: brin.c:44
BlockNumber bs_currRangeStart
Definition: brin.c:48
uint16 OffsetNumber
Definition: off.h:24
OffsetNumber brin_doinsert(Relation idxrel, BlockNumber pagesPerRange, BrinRevmap *revmap, Buffer *buffer, BlockNumber heapBlk, BrinTuple *tup, Size itemsz)
Definition: brin_pageops.c:340
BlockNumber bs_pagesPerRange
Definition: brin.c:47
#define ERROR
Definition: elog.h:43
BrinRevmap * bs_rmAccess
Definition: brin.c:49
bool brin_can_do_samepage_update(Buffer buffer, Size origsz, Size newsz)
Definition: brin_pageops.c:321
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
void brin_free_tuple(BrinTuple *tuple)
Definition: brin_tuple.c:308
size_t Size
Definition: c.h:350
BrinTuple * brin_form_tuple(BrinDesc *brdesc, BlockNumber blkno, BrinMemTuple *tuple, Size *size)
Definition: brin_tuple.c:89
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:88
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
BrinMemTuple * bs_dtuple
Definition: brin.c:51
BrinDesc * bs_bdesc
Definition: brin.c:50
#define elog
Definition: elog.h:219
int Buffer
Definition: buf.h:23
BrinTuple * brin_form_placeholder_tuple(BrinDesc *brdesc, BlockNumber blkno, Size *size)
Definition: brin_tuple.c:263
double IndexBuildHeapRangeScan(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool allow_sync, bool anyvisible, BlockNumber start_blockno, BlockNumber numblocks, IndexBuildCallback callback, void *callback_state)
Definition: index.c:2200
static void terminate_brin_buildstate ( BrinBuildState state)
static

Definition at line 1112 of file brin.c.

References brin_free_desc(), BrinBuildState::bs_bdesc, BrinBuildState::bs_currentInsertBuf, BrinBuildState::bs_dtuple, BrinBuildState::bs_irel, BufferGetBlockNumber(), BufferGetPage, BufferIsInvalid, PageGetFreeSpace(), pfree(), RecordPageWithFreeSpace(), and ReleaseBuffer().

Referenced by brinbuild(), and brinsummarize().

1113 {
1114  /* release the last index buffer used */
1115  if (!BufferIsInvalid(state->bs_currentInsertBuf))
1116  {
1117  Page page;
1118 
1119  page = BufferGetPage(state->bs_currentInsertBuf);
1122  PageGetFreeSpace(page));
1124  }
1125 
1126  brin_free_desc(state->bs_bdesc);
1127  pfree(state->bs_dtuple);
1128  pfree(state);
1129 }
void brin_free_desc(BrinDesc *bdesc)
Definition: brin.c:1054
void RecordPageWithFreeSpace(Relation rel, BlockNumber heapBlk, Size spaceAvail)
Definition: freespace.c:181
Buffer bs_currentInsertBuf
Definition: brin.c:46
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
Relation bs_irel
Definition: brin.c:44
Size PageGetFreeSpace(Page page)
Definition: bufpage.c:582
void pfree(void *pointer)
Definition: mcxt.c:949
#define BufferIsInvalid(buffer)
Definition: buf.h:31
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2605
BrinMemTuple * bs_dtuple
Definition: brin.c:51
BrinDesc * bs_bdesc
Definition: brin.c:50
Pointer Page
Definition: bufpage.h:74
static void union_tuples ( BrinDesc bdesc,
BrinMemTuple a,
BrinTuple b 
)
static

Definition at line 1359 of file brin.c.

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate(), BrinDesc::bd_index, BrinDesc::bd_tupdesc, brin_deform_tuple(), BRIN_PROCNUM_UNION, BrinMemTuple::bt_columns, CurrentMemoryContext, FunctionCall3Coll(), index_getprocinfo(), MemoryContextDelete(), MemoryContextSwitchTo(), tupleDesc::natts, PointerGetDatum, and RelationData::rd_indcollation.

Referenced by summarize_range().

1360 {
1361  int keyno;
1362  BrinMemTuple *db;
1363  MemoryContext cxt;
1364  MemoryContext oldcxt;
1365 
1366  /* Use our own memory context to avoid retail pfree */
1368  "brin union",
1370  oldcxt = MemoryContextSwitchTo(cxt);
1371  db = brin_deform_tuple(bdesc, b, NULL);
1372  MemoryContextSwitchTo(oldcxt);
1373 
1374  for (keyno = 0; keyno < bdesc->bd_tupdesc->natts; keyno++)
1375  {
1376  FmgrInfo *unionFn;
1377  BrinValues *col_a = &a->bt_columns[keyno];
1378  BrinValues *col_b = &db->bt_columns[keyno];
1379 
1380  unionFn = index_getprocinfo(bdesc->bd_index, keyno + 1,
1382  FunctionCall3Coll(unionFn,
1383  bdesc->bd_index->rd_indcollation[keyno],
1384  PointerGetDatum(bdesc),
1385  PointerGetDatum(col_a),
1386  PointerGetDatum(col_b));
1387  }
1388 
1389  MemoryContextDelete(cxt);
1390 }
Definition: fmgr.h:56
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:200
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:855
#define PointerGetDatum(X)
Definition: postgres.h:562
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
int natts
Definition: tupdesc.h:73
BrinMemTuple * brin_deform_tuple(BrinDesc *brdesc, BrinTuple *tuple, BrinMemTuple *dMemtuple)
Definition: brin_tuple.c:422
Oid * rd_indcollation
Definition: rel.h:193
Relation bd_index
Definition: brin_internal.h:47
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:165
BrinValues bt_columns[FLEXIBLE_ARRAY_MEMBER]
Definition: brin_tuple.h:46
TupleDesc bd_tupdesc
Definition: brin_internal.h:50
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
Datum FunctionCall3Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2, Datum arg3)
Definition: fmgr.c:1069
#define BRIN_PROCNUM_UNION
Definition: brin_internal.h:70