PostgreSQL Source Code  git master
index.c File Reference
#include "postgres.h"
#include <unistd.h>
#include "access/amapi.h"
#include "access/heapam.h"
#include "access/multixact.h"
#include "access/reloptions.h"
#include "access/relscan.h"
#include "access/sysattr.h"
#include "access/tableam.h"
#include "access/transam.h"
#include "access/visibilitymap.h"
#include "access/xact.h"
#include "bootstrap/bootstrap.h"
#include "catalog/binary_upgrade.h"
#include "catalog/catalog.h"
#include "catalog/dependency.h"
#include "catalog/heap.h"
#include "catalog/index.h"
#include "catalog/objectaccess.h"
#include "catalog/partition.h"
#include "catalog/pg_am.h"
#include "catalog/pg_collation.h"
#include "catalog/pg_constraint.h"
#include "catalog/pg_depend.h"
#include "catalog/pg_description.h"
#include "catalog/pg_inherits.h"
#include "catalog/pg_opclass.h"
#include "catalog/pg_operator.h"
#include "catalog/pg_tablespace.h"
#include "catalog/pg_trigger.h"
#include "catalog/pg_type.h"
#include "catalog/storage.h"
#include "commands/event_trigger.h"
#include "commands/progress.h"
#include "commands/tablecmds.h"
#include "commands/trigger.h"
#include "executor/executor.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/optimizer.h"
#include "parser/parser.h"
#include "pgstat.h"
#include "rewrite/rewriteManip.h"
#include "storage/bufmgr.h"
#include "storage/lmgr.h"
#include "storage/predicate.h"
#include "storage/procarray.h"
#include "storage/smgr.h"
#include "utils/builtins.h"
#include "utils/fmgroids.h"
#include "utils/guc.h"
#include "utils/inval.h"
#include "utils/lsyscache.h"
#include "utils/memutils.h"
#include "utils/pg_rusage.h"
#include "utils/snapmgr.h"
#include "utils/syscache.h"
#include "utils/tuplesort.h"
Include dependency graph for index.c:

Go to the source code of this file.

Data Structures

struct  SerializedReindexState
 

Functions

static bool relationHasPrimaryKey (Relation rel)
 
static TupleDesc ConstructTupleDescriptor (Relation heapRelation, IndexInfo *indexInfo, List *indexColNames, Oid accessMethodObjectId, Oid *collationObjectId, Oid *classObjectId)
 
static void InitializeAttributeOids (Relation indexRelation, int numatts, Oid indexoid)
 
static void AppendAttributeTuples (Relation indexRelation, int numatts, Datum *attopts)
 
static void UpdateIndexRelation (Oid indexoid, Oid heapoid, Oid parentIndexId, IndexInfo *indexInfo, Oid *collationOids, Oid *classOids, int16 *coloptions, bool primary, bool isexclusion, bool immediate, bool isvalid, bool isready)
 
static void index_update_stats (Relation rel, bool hasindex, double reltuples)
 
static void IndexCheckExclusion (Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo)
 
static bool validate_index_callback (ItemPointer itemptr, void *opaque)
 
static bool ReindexIsCurrentlyProcessingIndex (Oid indexOid)
 
static void SetReindexProcessing (Oid heapOid, Oid indexOid)
 
static void ResetReindexProcessing (void)
 
static void SetReindexPending (List *indexes)
 
static void RemoveReindexPending (Oid indexOid)
 
static void ResetReindexPending (void)
 
void index_check_primary_key (Relation heapRel, IndexInfo *indexInfo, bool is_alter_table, IndexStmt *stmt)
 
Oid index_create (Relation heapRelation, const char *indexRelationName, Oid indexRelationId, Oid parentIndexRelid, Oid parentConstraintId, Oid relFileNode, IndexInfo *indexInfo, List *indexColNames, Oid accessMethodObjectId, Oid tableSpaceId, Oid *collationObjectId, Oid *classObjectId, int16 *coloptions, Datum reloptions, bits16 flags, bits16 constr_flags, bool allow_system_table_mods, bool is_internal, Oid *constraintId)
 
Oid index_concurrently_create_copy (Relation heapRelation, Oid oldIndexId, const char *newName)
 
void index_concurrently_build (Oid heapRelationId, Oid indexRelationId)
 
void index_concurrently_swap (Oid newIndexId, Oid oldIndexId, const char *oldName)
 
void index_concurrently_set_dead (Oid heapId, Oid indexId)
 
ObjectAddress index_constraint_create (Relation heapRelation, Oid indexRelationId, Oid parentConstraintId, IndexInfo *indexInfo, const char *constraintName, char constraintType, bits16 constr_flags, bool allow_system_table_mods, bool is_internal)
 
void index_drop (Oid indexId, bool concurrent, bool concurrent_lock_mode)
 
IndexInfoBuildIndexInfo (Relation index)
 
IndexInfoBuildDummyIndexInfo (Relation index)
 
bool CompareIndexInfo (IndexInfo *info1, IndexInfo *info2, Oid *collations1, Oid *collations2, Oid *opfamilies1, Oid *opfamilies2, AttrMap *attmap)
 
void BuildSpeculativeIndexInfo (Relation index, IndexInfo *ii)
 
void FormIndexDatum (IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
 
void index_build (Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
 
void validate_index (Oid heapId, Oid indexId, Snapshot snapshot)
 
void index_set_state_flags (Oid indexId, IndexStateFlagsAction action)
 
Oid IndexGetRelation (Oid indexId, bool missing_ok)
 
void reindex_index (Oid indexId, bool skip_constraint_checks, char persistence, int options)
 
bool reindex_relation (Oid relid, int flags, int options)
 
bool ReindexIsProcessingHeap (Oid heapOid)
 
bool ReindexIsProcessingIndex (Oid indexOid)
 
Size EstimateReindexStateSpace (void)
 
void SerializeReindexState (Size maxsize, char *start_address)
 
void RestoreReindexState (void *reindexstate)
 

Variables

Oid binary_upgrade_next_index_pg_class_oid = InvalidOid
 
static Oid currentlyReindexedHeap = InvalidOid
 
static Oid currentlyReindexedIndex = InvalidOid
 
static ListpendingReindexedIndexes = NIL
 

Function Documentation

◆ AppendAttributeTuples()

static void AppendAttributeTuples ( Relation  indexRelation,
int  numatts,
Datum attopts 
)
static

Definition at line 489 of file index.c.

References Assert, CatalogCloseIndexes(), CatalogOpenIndexes(), i, InsertPgAttributeTuple(), RelationGetDescr, RowExclusiveLock, table_close(), table_open(), and TupleDescAttr.

Referenced by index_create().

490 {
491  Relation pg_attribute;
492  CatalogIndexState indstate;
493  TupleDesc indexTupDesc;
494  int i;
495 
496  /*
497  * open the attribute relation and its indexes
498  */
499  pg_attribute = table_open(AttributeRelationId, RowExclusiveLock);
500 
501  indstate = CatalogOpenIndexes(pg_attribute);
502 
503  /*
504  * insert data from new index's tupdesc into pg_attribute
505  */
506  indexTupDesc = RelationGetDescr(indexRelation);
507 
508  for (i = 0; i < numatts; i++)
509  {
510  Form_pg_attribute attr = TupleDescAttr(indexTupDesc, i);
511  Datum attoptions = attopts ? attopts[i] : (Datum) 0;
512 
513  Assert(attr->attnum == i + 1);
514 
515  InsertPgAttributeTuple(pg_attribute, attr, attoptions, indstate);
516  }
517 
518  CatalogCloseIndexes(indstate);
519 
520  table_close(pg_attribute, RowExclusiveLock);
521 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define RelationGetDescr(relation)
Definition: rel.h:462
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
uintptr_t Datum
Definition: postgres.h:367
#define Assert(condition)
Definition: c.h:738
CatalogIndexState CatalogOpenIndexes(Relation heapRel)
Definition: indexing.c:42
void InsertPgAttributeTuple(Relation pg_attribute_rel, Form_pg_attribute new_attribute, Datum attoptions, CatalogIndexState indstate)
Definition: heap.c:726
int i
void CatalogCloseIndexes(CatalogIndexState indstate)
Definition: indexing.c:60
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ BuildDummyIndexInfo()

IndexInfo* BuildDummyIndexInfo ( Relation  index)

Definition at line 2371 of file index.c.

References elog, ERROR, i, IndexInfo::ii_IndexAttrNumbers, INDEX_MAX_KEYS, makeIndexInfo(), NIL, RelationData::rd_index, RelationData::rd_rel, RelationGetDummyIndexExpressions(), and RelationGetRelid.

Referenced by RelationTruncateIndexes().

2372 {
2373  IndexInfo *ii;
2374  Form_pg_index indexStruct = index->rd_index;
2375  int i;
2376  int numAtts;
2377 
2378  /* check the number of keys, and copy attr numbers into the IndexInfo */
2379  numAtts = indexStruct->indnatts;
2380  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2381  elog(ERROR, "invalid indnatts %d for index %u",
2382  numAtts, RelationGetRelid(index));
2383 
2384  /*
2385  * Create the node, using dummy index expressions, and pretending there is
2386  * no predicate.
2387  */
2388  ii = makeIndexInfo(indexStruct->indnatts,
2389  indexStruct->indnkeyatts,
2390  index->rd_rel->relam,
2392  NIL,
2393  indexStruct->indisunique,
2394  indexStruct->indisready,
2395  false);
2396 
2397  /* fill in attribute numbers */
2398  for (i = 0; i < numAtts; i++)
2399  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2400 
2401  /* We ignore the exclusion constraint if any */
2402 
2403  return ii;
2404 }
#define NIL
Definition: pg_list.h:65
List * RelationGetDummyIndexExpressions(Relation relation)
Definition: relcache.c:4627
Form_pg_class rd_rel
Definition: rel.h:89
Form_pg_index rd_index
Definition: rel.h:154
#define ERROR
Definition: elog.h:43
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:740
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
#define INDEX_MAX_KEYS
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
#define RelationGetRelid(relation)
Definition: rel.h:436

◆ BuildIndexInfo()

IndexInfo* BuildIndexInfo ( Relation  index)

Definition at line 2312 of file index.c.

References elog, ERROR, i, IndexInfo::ii_ExclusionOps, IndexInfo::ii_ExclusionProcs, IndexInfo::ii_ExclusionStrats, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_OpclassOptions, INDEX_MAX_KEYS, makeIndexInfo(), RelationData::rd_index, RelationData::rd_rel, RelationGetExclusionInfo(), RelationGetIndexExpressions(), RelationGetIndexPredicate(), RelationGetIndexRawAttOptions(), and RelationGetRelid.

Referenced by _bt_parallel_scan_and_sort(), ATExecAddIndexConstraint(), ATExecAttachPartitionIdx(), AttachPartitionEnsureIndexes(), brinsummarize(), bt_check_every_level(), DefineIndex(), do_analyze_rel(), ExecOpenIndices(), index_concurrently_build(), index_concurrently_create_copy(), reindex_index(), tuplesort_begin_cluster(), unique_key_recheck(), and validate_index().

2313 {
2314  IndexInfo *ii;
2315  Form_pg_index indexStruct = index->rd_index;
2316  int i;
2317  int numAtts;
2318 
2319  /* check the number of keys, and copy attr numbers into the IndexInfo */
2320  numAtts = indexStruct->indnatts;
2321  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2322  elog(ERROR, "invalid indnatts %d for index %u",
2323  numAtts, RelationGetRelid(index));
2324 
2325  /*
2326  * Create the node, fetching any expressions needed for expressional
2327  * indexes and index predicate if any.
2328  */
2329  ii = makeIndexInfo(indexStruct->indnatts,
2330  indexStruct->indnkeyatts,
2331  index->rd_rel->relam,
2334  indexStruct->indisunique,
2335  indexStruct->indisready,
2336  false);
2337 
2338  /* fill in attribute numbers */
2339  for (i = 0; i < numAtts; i++)
2340  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2341 
2342  /* fetch exclusion constraint info if any */
2343  if (indexStruct->indisexclusion)
2344  {
2346  &ii->ii_ExclusionOps,
2347  &ii->ii_ExclusionProcs,
2348  &ii->ii_ExclusionStrats);
2349  }
2350 
2352 
2353  return ii;
2354 }
void RelationGetExclusionInfo(Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
Definition: relcache.c:5002
Oid * ii_ExclusionProcs
Definition: execnodes.h:166
Form_pg_class rd_rel
Definition: rel.h:89
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4681
Form_pg_index rd_index
Definition: rel.h:154
#define ERROR
Definition: elog.h:43
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4568
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:740
Datum * RelationGetIndexRawAttOptions(Relation indexrel)
Definition: relcache.c:5196
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
#define INDEX_MAX_KEYS
Oid * ii_ExclusionOps
Definition: execnodes.h:165
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
uint16 * ii_ExclusionStrats
Definition: execnodes.h:167
#define RelationGetRelid(relation)
Definition: rel.h:436
Datum * ii_OpclassOptions
Definition: execnodes.h:171

◆ BuildSpeculativeIndexInfo()

void BuildSpeculativeIndexInfo ( Relation  index,
IndexInfo ii 
)

Definition at line 2536 of file index.c.

References Assert, BTEqualStrategyNumber, elog, ERROR, get_opcode(), get_opfamily_member(), i, IndexInfo::ii_Unique, IndexInfo::ii_UniqueOps, IndexInfo::ii_UniqueProcs, IndexInfo::ii_UniqueStrats, IndexRelationGetNumberOfKeyAttributes, OidIsValid, palloc(), RelationData::rd_opcintype, RelationData::rd_opfamily, and RelationData::rd_rel.

Referenced by ExecOpenIndices().

2537 {
2538  int indnkeyatts;
2539  int i;
2540 
2541  indnkeyatts = IndexRelationGetNumberOfKeyAttributes(index);
2542 
2543  /*
2544  * fetch info for checking unique indexes
2545  */
2546  Assert(ii->ii_Unique);
2547 
2548  if (index->rd_rel->relam != BTREE_AM_OID)
2549  elog(ERROR, "unexpected non-btree speculative unique index");
2550 
2551  ii->ii_UniqueOps = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2552  ii->ii_UniqueProcs = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2553  ii->ii_UniqueStrats = (uint16 *) palloc(sizeof(uint16) * indnkeyatts);
2554 
2555  /*
2556  * We have to look up the operator's strategy number. This provides a
2557  * cross-check that the operator does match the index.
2558  */
2559  /* We need the func OIDs and strategy numbers too */
2560  for (i = 0; i < indnkeyatts; i++)
2561  {
2563  ii->ii_UniqueOps[i] =
2564  get_opfamily_member(index->rd_opfamily[i],
2565  index->rd_opcintype[i],
2566  index->rd_opcintype[i],
2567  ii->ii_UniqueStrats[i]);
2568  if (!OidIsValid(ii->ii_UniqueOps[i]))
2569  elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
2570  ii->ii_UniqueStrats[i], index->rd_opcintype[i],
2571  index->rd_opcintype[i], index->rd_opfamily[i]);
2572  ii->ii_UniqueProcs[i] = get_opcode(ii->ii_UniqueOps[i]);
2573  }
2574 }
uint16 * ii_UniqueStrats
Definition: execnodes.h:170
Form_pg_class rd_rel
Definition: rel.h:89
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:644
Oid * ii_UniqueOps
Definition: execnodes.h:168
unsigned short uint16
Definition: c.h:366
#define ERROR
Definition: elog.h:43
Oid * ii_UniqueProcs
Definition: execnodes.h:169
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:164
Oid * rd_opfamily
Definition: rel.h:169
#define IndexRelationGetNumberOfKeyAttributes(relation)
Definition: rel.h:455
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1153
bool ii_Unique
Definition: execnodes.h:172
#define Assert(condition)
Definition: c.h:738
void * palloc(Size size)
Definition: mcxt.c:949
#define elog(elevel,...)
Definition: elog.h:214
int i
Oid * rd_opcintype
Definition: rel.h:170
#define BTEqualStrategyNumber
Definition: stratnum.h:31

◆ CompareIndexInfo()

bool CompareIndexInfo ( IndexInfo info1,
IndexInfo info2,
Oid collations1,
Oid collations2,
Oid opfamilies1,
Oid opfamilies2,
AttrMap attmap 
)

Definition at line 2417 of file index.c.

References AttrMap::attnums, elog, equal(), ERROR, i, IndexInfo::ii_Am, IndexInfo::ii_ExclusionOps, IndexInfo::ii_Expressions, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_NumIndexKeyAttrs, IndexInfo::ii_Predicate, IndexInfo::ii_Unique, InvalidAttrNumber, InvalidOid, map_variable_attnos(), AttrMap::maplen, and NIL.

Referenced by ATExecAttachPartitionIdx(), AttachPartitionEnsureIndexes(), and DefineIndex().

2421 {
2422  int i;
2423 
2424  if (info1->ii_Unique != info2->ii_Unique)
2425  return false;
2426 
2427  /* indexes are only equivalent if they have the same access method */
2428  if (info1->ii_Am != info2->ii_Am)
2429  return false;
2430 
2431  /* and same number of attributes */
2432  if (info1->ii_NumIndexAttrs != info2->ii_NumIndexAttrs)
2433  return false;
2434 
2435  /* and same number of key attributes */
2436  if (info1->ii_NumIndexKeyAttrs != info2->ii_NumIndexKeyAttrs)
2437  return false;
2438 
2439  /*
2440  * and columns match through the attribute map (actual attribute numbers
2441  * might differ!) Note that this implies that index columns that are
2442  * expressions appear in the same positions. We will next compare the
2443  * expressions themselves.
2444  */
2445  for (i = 0; i < info1->ii_NumIndexAttrs; i++)
2446  {
2447  if (attmap->maplen < info2->ii_IndexAttrNumbers[i])
2448  elog(ERROR, "incorrect attribute map");
2449 
2450  /* ignore expressions at this stage */
2451  if ((info1->ii_IndexAttrNumbers[i] != InvalidAttrNumber) &&
2452  (attmap->attnums[info2->ii_IndexAttrNumbers[i] - 1] !=
2453  info1->ii_IndexAttrNumbers[i]))
2454  return false;
2455 
2456  /* collation and opfamily is not valid for including columns */
2457  if (i >= info1->ii_NumIndexKeyAttrs)
2458  continue;
2459 
2460  if (collations1[i] != collations2[i])
2461  return false;
2462  if (opfamilies1[i] != opfamilies2[i])
2463  return false;
2464  }
2465 
2466  /*
2467  * For expression indexes: either both are expression indexes, or neither
2468  * is; if they are, make sure the expressions match.
2469  */
2470  if ((info1->ii_Expressions != NIL) != (info2->ii_Expressions != NIL))
2471  return false;
2472  if (info1->ii_Expressions != NIL)
2473  {
2474  bool found_whole_row;
2475  Node *mapped;
2476 
2477  mapped = map_variable_attnos((Node *) info2->ii_Expressions,
2478  1, 0, attmap,
2479  InvalidOid, &found_whole_row);
2480  if (found_whole_row)
2481  {
2482  /*
2483  * we could throw an error here, but seems out of scope for this
2484  * routine.
2485  */
2486  return false;
2487  }
2488 
2489  if (!equal(info1->ii_Expressions, mapped))
2490  return false;
2491  }
2492 
2493  /* Partial index predicates must be identical, if they exist */
2494  if ((info1->ii_Predicate == NULL) != (info2->ii_Predicate == NULL))
2495  return false;
2496  if (info1->ii_Predicate != NULL)
2497  {
2498  bool found_whole_row;
2499  Node *mapped;
2500 
2501  mapped = map_variable_attnos((Node *) info2->ii_Predicate,
2502  1, 0, attmap,
2503  InvalidOid, &found_whole_row);
2504  if (found_whole_row)
2505  {
2506  /*
2507  * we could throw an error here, but seems out of scope for this
2508  * routine.
2509  */
2510  return false;
2511  }
2512  if (!equal(info1->ii_Predicate, mapped))
2513  return false;
2514  }
2515 
2516  /* No support currently for comparing exclusion indexes. */
2517  if (info1->ii_ExclusionOps != NULL || info2->ii_ExclusionOps != NULL)
2518  return false;
2519 
2520  return true;
2521 }
#define NIL
Definition: pg_list.h:65
List * ii_Predicate
Definition: execnodes.h:163
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3028
int maplen
Definition: attmap.h:37
Definition: nodes.h:526
Node * map_variable_attnos(Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
int ii_NumIndexAttrs
Definition: execnodes.h:158
#define InvalidOid
Definition: postgres_ext.h:36
bool ii_Unique
Definition: execnodes.h:172
List * ii_Expressions
Definition: execnodes.h:161
AttrNumber * attnums
Definition: attmap.h:36
#define InvalidAttrNumber
Definition: attnum.h:23
Oid * ii_ExclusionOps
Definition: execnodes.h:165
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
Oid ii_Am
Definition: execnodes.h:177

◆ ConstructTupleDescriptor()

static TupleDesc ConstructTupleDescriptor ( Relation  heapRelation,
IndexInfo indexInfo,
List indexColNames,
Oid  accessMethodObjectId,
Oid collationObjectId,
Oid classObjectId 
)
static

Definition at line 268 of file index.c.

References IndexAmRoutine::amkeytype, Assert, ATTRIBUTE_FIXED_PART_SIZE, AttrNumberGetAttrOffset, CheckAttributeType(), CLAOID, CreateTemplateTupleDesc(), elog, ERROR, exprType(), exprTypmod(), FormData_pg_attribute, get_base_element_type(), GetIndexAmRoutineByAmId(), GETSTRUCT, HeapTupleIsValid, i, IndexInfo::ii_Expressions, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_NumIndexKeyAttrs, InvalidOid, lfirst, list_head(), lnext(), MemSet, NameStr, namestrcpy(), NIL, ObjectIdGetDatum, OidIsValid, pfree(), RelationGetDescr, RelationGetForm, ReleaseSysCache(), SearchSysCache1(), TupleDescAttr, and TYPEOID.

Referenced by index_create().

274 {
275  int numatts = indexInfo->ii_NumIndexAttrs;
276  int numkeyatts = indexInfo->ii_NumIndexKeyAttrs;
277  ListCell *colnames_item = list_head(indexColNames);
278  ListCell *indexpr_item = list_head(indexInfo->ii_Expressions);
279  IndexAmRoutine *amroutine;
280  TupleDesc heapTupDesc;
281  TupleDesc indexTupDesc;
282  int natts; /* #atts in heap rel --- for error checks */
283  int i;
284 
285  /* We need access to the index AM's API struct */
286  amroutine = GetIndexAmRoutineByAmId(accessMethodObjectId, false);
287 
288  /* ... and to the table's tuple descriptor */
289  heapTupDesc = RelationGetDescr(heapRelation);
290  natts = RelationGetForm(heapRelation)->relnatts;
291 
292  /*
293  * allocate the new tuple descriptor
294  */
295  indexTupDesc = CreateTemplateTupleDesc(numatts);
296 
297  /*
298  * Fill in the pg_attribute row.
299  */
300  for (i = 0; i < numatts; i++)
301  {
302  AttrNumber atnum = indexInfo->ii_IndexAttrNumbers[i];
303  Form_pg_attribute to = TupleDescAttr(indexTupDesc, i);
304  HeapTuple tuple;
305  Form_pg_type typeTup;
306  Form_pg_opclass opclassTup;
307  Oid keyType;
308 
310  to->attnum = i + 1;
311  to->attstattarget = -1;
312  to->attcacheoff = -1;
313  to->attislocal = true;
314  to->attcollation = (i < numkeyatts) ?
315  collationObjectId[i] : InvalidOid;
316 
317  /*
318  * Set the attribute name as specified by caller.
319  */
320  if (colnames_item == NULL) /* shouldn't happen */
321  elog(ERROR, "too few entries in colnames list");
322  namestrcpy(&to->attname, (const char *) lfirst(colnames_item));
323  colnames_item = lnext(indexColNames, colnames_item);
324 
325  /*
326  * For simple index columns, we copy some pg_attribute fields from the
327  * parent relation. For expressions we have to look at the expression
328  * result.
329  */
330  if (atnum != 0)
331  {
332  /* Simple index column */
333  const FormData_pg_attribute *from;
334 
335  Assert(atnum > 0); /* should've been caught above */
336 
337  if (atnum > natts) /* safety check */
338  elog(ERROR, "invalid column number %d", atnum);
339  from = TupleDescAttr(heapTupDesc,
340  AttrNumberGetAttrOffset(atnum));
341 
342  to->atttypid = from->atttypid;
343  to->attlen = from->attlen;
344  to->attndims = from->attndims;
345  to->atttypmod = from->atttypmod;
346  to->attbyval = from->attbyval;
347  to->attstorage = from->attstorage;
348  to->attalign = from->attalign;
349  }
350  else
351  {
352  /* Expressional index */
353  Node *indexkey;
354 
355  if (indexpr_item == NULL) /* shouldn't happen */
356  elog(ERROR, "too few entries in indexprs list");
357  indexkey = (Node *) lfirst(indexpr_item);
358  indexpr_item = lnext(indexInfo->ii_Expressions, indexpr_item);
359 
360  /*
361  * Lookup the expression type in pg_type for the type length etc.
362  */
363  keyType = exprType(indexkey);
364  tuple = SearchSysCache1(TYPEOID, ObjectIdGetDatum(keyType));
365  if (!HeapTupleIsValid(tuple))
366  elog(ERROR, "cache lookup failed for type %u", keyType);
367  typeTup = (Form_pg_type) GETSTRUCT(tuple);
368 
369  /*
370  * Assign some of the attributes values. Leave the rest.
371  */
372  to->atttypid = keyType;
373  to->attlen = typeTup->typlen;
374  to->attbyval = typeTup->typbyval;
375  to->attstorage = typeTup->typstorage;
376  to->attalign = typeTup->typalign;
377  to->atttypmod = exprTypmod(indexkey);
378 
379  ReleaseSysCache(tuple);
380 
381  /*
382  * Make sure the expression yields a type that's safe to store in
383  * an index. We need this defense because we have index opclasses
384  * for pseudo-types such as "record", and the actually stored type
385  * had better be safe; eg, a named composite type is okay, an
386  * anonymous record type is not. The test is the same as for
387  * whether a table column is of a safe type (which is why we
388  * needn't check for the non-expression case).
389  */
390  CheckAttributeType(NameStr(to->attname),
391  to->atttypid, to->attcollation,
392  NIL, 0);
393  }
394 
395  /*
396  * We do not yet have the correct relation OID for the index, so just
397  * set it invalid for now. InitializeAttributeOids() will fix it
398  * later.
399  */
400  to->attrelid = InvalidOid;
401 
402  /*
403  * Check the opclass and index AM to see if either provides a keytype
404  * (overriding the attribute type). Opclass (if exists) takes
405  * precedence.
406  */
407  keyType = amroutine->amkeytype;
408 
409  if (i < indexInfo->ii_NumIndexKeyAttrs)
410  {
411  tuple = SearchSysCache1(CLAOID, ObjectIdGetDatum(classObjectId[i]));
412  if (!HeapTupleIsValid(tuple))
413  elog(ERROR, "cache lookup failed for opclass %u",
414  classObjectId[i]);
415  opclassTup = (Form_pg_opclass) GETSTRUCT(tuple);
416  if (OidIsValid(opclassTup->opckeytype))
417  keyType = opclassTup->opckeytype;
418 
419  /*
420  * If keytype is specified as ANYELEMENT, and opcintype is
421  * ANYARRAY, then the attribute type must be an array (else it'd
422  * not have matched this opclass); use its element type.
423  *
424  * We could also allow ANYCOMPATIBLE/ANYCOMPATIBLEARRAY here, but
425  * there seems no need to do so; there's no reason to declare an
426  * opclass as taking ANYCOMPATIBLEARRAY rather than ANYARRAY.
427  */
428  if (keyType == ANYELEMENTOID && opclassTup->opcintype == ANYARRAYOID)
429  {
430  keyType = get_base_element_type(to->atttypid);
431  if (!OidIsValid(keyType))
432  elog(ERROR, "could not get element type of array type %u",
433  to->atttypid);
434  }
435 
436  ReleaseSysCache(tuple);
437  }
438 
439  /*
440  * If a key type different from the heap value is specified, update
441  * the type-related fields in the index tupdesc.
442  */
443  if (OidIsValid(keyType) && keyType != to->atttypid)
444  {
445  tuple = SearchSysCache1(TYPEOID, ObjectIdGetDatum(keyType));
446  if (!HeapTupleIsValid(tuple))
447  elog(ERROR, "cache lookup failed for type %u", keyType);
448  typeTup = (Form_pg_type) GETSTRUCT(tuple);
449 
450  to->atttypid = keyType;
451  to->atttypmod = -1;
452  to->attlen = typeTup->typlen;
453  to->attbyval = typeTup->typbyval;
454  to->attalign = typeTup->typalign;
455  to->attstorage = typeTup->typstorage;
456 
457  ReleaseSysCache(tuple);
458  }
459  }
460 
461  pfree(amroutine);
462 
463  return indexTupDesc;
464 }
#define NIL
Definition: pg_list.h:65
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:321
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:44
#define RelationGetDescr(relation)
Definition: rel.h:462
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:275
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
#define RelationGetForm(relation)
Definition: rel.h:430
Definition: nodes.h:526
#define MemSet(start, val, len)
Definition: c.h:971
unsigned int Oid
Definition: postgres_ext.h:31
int namestrcpy(Name name, const char *str)
Definition: name.c:250
Oid amkeytype
Definition: amapi.h:207
#define OidIsValid(objectId)
Definition: c.h:644
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
IndexAmRoutine * GetIndexAmRoutineByAmId(Oid amoid, bool noerror)
Definition: amapi.c:56
#define AttrNumberGetAttrOffset(attNum)
Definition: attnum.h:51
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:185
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
int ii_NumIndexAttrs
Definition: execnodes.h:158
#define InvalidOid
Definition: postgres_ext.h:36
FormData_pg_attribute
Definition: pg_attribute.h:177
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * ii_Expressions
Definition: execnodes.h:161
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
FormData_pg_type * Form_pg_type
Definition: pg_type.h:255
Oid get_base_element_type(Oid typid)
Definition: lsyscache.c:2660
#define elog(elevel,...)
Definition: elog.h:214
int i
#define NameStr(name)
Definition: c.h:615
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
void CheckAttributeType(const char *attname, Oid atttypid, Oid attcollation, List *containing_rowtypes, int flags)
Definition: heap.c:581
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
int16 AttrNumber
Definition: attnum.h:21

◆ EstimateReindexStateSpace()

Size EstimateReindexStateSpace ( void  )

Definition at line 3933 of file index.c.

References list_length(), mul_size(), and offsetof.

Referenced by InitializeParallelDSM().

3934 {
3937 }
static List * pendingReindexedIndexes
Definition: index.c:3821
unsigned int Oid
Definition: postgres_ext.h:31
Size mul_size(Size s1, Size s2)
Definition: shmem.c:515
static int list_length(const List *l)
Definition: pg_list.h:169
#define offsetof(type, field)
Definition: c.h:661

◆ FormIndexDatum()

void FormIndexDatum ( IndexInfo indexInfo,
TupleTableSlot slot,
EState estate,
Datum values,
bool isnull 
)

Definition at line 2596 of file index.c.

References Assert, elog, ERROR, ExecEvalExprSwitchContext(), ExecPrepareExprList(), GetPerTupleExprContext, i, IndexInfo::ii_Expressions, IndexInfo::ii_ExpressionsState, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, lfirst, list_head(), lnext(), NIL, slot_getattr(), and slot_getsysattr().

Referenced by CatalogIndexInsert(), check_exclusion_or_unique_constraint(), comparetup_cluster(), compute_index_stats(), ExecCheckIndexConstraints(), ExecInsertIndexTuples(), heapam_index_build_range_scan(), heapam_index_validate_scan(), IndexCheckExclusion(), and unique_key_recheck().

2601 {
2602  ListCell *indexpr_item;
2603  int i;
2604 
2605  if (indexInfo->ii_Expressions != NIL &&
2606  indexInfo->ii_ExpressionsState == NIL)
2607  {
2608  /* First time through, set up expression evaluation state */
2609  indexInfo->ii_ExpressionsState =
2610  ExecPrepareExprList(indexInfo->ii_Expressions, estate);
2611  /* Check caller has set up context correctly */
2612  Assert(GetPerTupleExprContext(estate)->ecxt_scantuple == slot);
2613  }
2614  indexpr_item = list_head(indexInfo->ii_ExpressionsState);
2615 
2616  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
2617  {
2618  int keycol = indexInfo->ii_IndexAttrNumbers[i];
2619  Datum iDatum;
2620  bool isNull;
2621 
2622  if (keycol < 0)
2623  iDatum = slot_getsysattr(slot, keycol, &isNull);
2624  else if (keycol != 0)
2625  {
2626  /*
2627  * Plain index column; get the value we need directly from the
2628  * heap tuple.
2629  */
2630  iDatum = slot_getattr(slot, keycol, &isNull);
2631  }
2632  else
2633  {
2634  /*
2635  * Index expression --- need to evaluate it.
2636  */
2637  if (indexpr_item == NULL)
2638  elog(ERROR, "wrong number of index expressions");
2639  iDatum = ExecEvalExprSwitchContext((ExprState *) lfirst(indexpr_item),
2640  GetPerTupleExprContext(estate),
2641  &isNull);
2642  indexpr_item = lnext(indexInfo->ii_ExpressionsState, indexpr_item);
2643  }
2644  values[i] = iDatum;
2645  isnull[i] = isNull;
2646  }
2647 
2648  if (indexpr_item != NULL)
2649  elog(ERROR, "wrong number of index expressions");
2650 }
#define NIL
Definition: pg_list.h:65
static Datum ExecEvalExprSwitchContext(ExprState *state, ExprContext *econtext, bool *isNull)
Definition: executor.h:305
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:321
#define GetPerTupleExprContext(estate)
Definition: executor.h:506
List * ii_ExpressionsState
Definition: execnodes.h:162
#define ERROR
Definition: elog.h:43
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
List * ExecPrepareExprList(List *nodes, EState *estate)
Definition: execExpr.c:566
uintptr_t Datum
Definition: postgres.h:367
int ii_NumIndexAttrs
Definition: execnodes.h:158
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: tuptable.h:381
List * ii_Expressions
Definition: execnodes.h:161
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
static Datum values[MAXATTR]
Definition: bootstrap.c:167
#define elog(elevel,...)
Definition: elog.h:214
int i
static Datum slot_getsysattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: tuptable.h:402
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160

◆ index_build()

void index_build ( Relation  heapRelation,
Relation  indexRelation,
IndexInfo indexInfo,
bool  isreindex,
bool  parallel 
)

Definition at line 2823 of file index.c.

References IndexAmRoutine::ambuild, IndexAmRoutine::ambuildempty, Assert, AtEOXact_GUC(), CatalogTupleUpdate(), CommandCounterIncrement(), DEBUG1, EarlyPruningEnabled, elog, ereport, errmsg(), errmsg_plural(), ERROR, GETSTRUCT, GetUserIdAndSecContext(), heap_freetuple(), IndexBuildResult::heap_tuples, HeapTupleIsValid, IndexInfo::ii_BrokenHotChain, IndexInfo::ii_Concurrent, IndexInfo::ii_ExclusionOps, IndexInfo::ii_ParallelWorkers, IndexBuildResult::index_tuples, index_update_stats(), IndexCheckExclusion(), INDEXRELID, INIT_FORKNUM, IsNormalProcessingMode, NewGUCNestLevel(), ObjectIdGetDatum, pgstat_progress_update_multi_param(), plan_create_index_workers(), PointerIsValid, PROGRESS_CREATEIDX_PHASE, PROGRESS_CREATEIDX_PHASE_BUILD, PROGRESS_CREATEIDX_SUBPHASE, PROGRESS_CREATEIDX_SUBPHASE_INITIALIZE, PROGRESS_CREATEIDX_TUPLES_DONE, PROGRESS_CREATEIDX_TUPLES_TOTAL, PROGRESS_SCAN_BLOCKS_DONE, PROGRESS_SCAN_BLOCKS_TOTAL, RelationData::rd_indam, RelationData::rd_rel, RelationData::rd_smgr, RelationGetRelationName, RelationGetRelid, RelationIsValid, RelationOpenSmgr, RowExclusiveLock, SearchSysCacheCopy1, SECURITY_RESTRICTED_OPERATION, SetUserIdAndSecContext(), smgrcreate(), smgrexists(), HeapTupleData::t_self, table_close(), table_open(), and val.

Referenced by build_indices(), index_concurrently_build(), index_create(), reindex_index(), and RelationTruncateIndexes().

2828 {
2829  IndexBuildResult *stats;
2830  Oid save_userid;
2831  int save_sec_context;
2832  int save_nestlevel;
2833 
2834  /*
2835  * sanity checks
2836  */
2837  Assert(RelationIsValid(indexRelation));
2838  Assert(PointerIsValid(indexRelation->rd_indam));
2839  Assert(PointerIsValid(indexRelation->rd_indam->ambuild));
2840  Assert(PointerIsValid(indexRelation->rd_indam->ambuildempty));
2841 
2842  /*
2843  * Determine worker process details for parallel CREATE INDEX. Currently,
2844  * only btree has support for parallel builds.
2845  *
2846  * Note that planner considers parallel safety for us.
2847  */
2848  if (parallel && IsNormalProcessingMode() &&
2849  indexRelation->rd_rel->relam == BTREE_AM_OID)
2850  indexInfo->ii_ParallelWorkers =
2852  RelationGetRelid(indexRelation));
2853 
2854  if (indexInfo->ii_ParallelWorkers == 0)
2855  ereport(DEBUG1,
2856  (errmsg("building index \"%s\" on table \"%s\" serially",
2857  RelationGetRelationName(indexRelation),
2858  RelationGetRelationName(heapRelation))));
2859  else
2860  ereport(DEBUG1,
2861  (errmsg_plural("building index \"%s\" on table \"%s\" with request for %d parallel worker",
2862  "building index \"%s\" on table \"%s\" with request for %d parallel workers",
2863  indexInfo->ii_ParallelWorkers,
2864  RelationGetRelationName(indexRelation),
2865  RelationGetRelationName(heapRelation),
2866  indexInfo->ii_ParallelWorkers)));
2867 
2868  /*
2869  * Switch to the table owner's userid, so that any index functions are run
2870  * as that user. Also lock down security-restricted operations and
2871  * arrange to make GUC variable changes local to this command.
2872  */
2873  GetUserIdAndSecContext(&save_userid, &save_sec_context);
2874  SetUserIdAndSecContext(heapRelation->rd_rel->relowner,
2875  save_sec_context | SECURITY_RESTRICTED_OPERATION);
2876  save_nestlevel = NewGUCNestLevel();
2877 
2878  /* Set up initial progress report status */
2879  {
2880  const int index[] = {
2887  };
2888  const int64 val[] = {
2891  0, 0, 0, 0
2892  };
2893 
2894  pgstat_progress_update_multi_param(6, index, val);
2895  }
2896 
2897  /*
2898  * Call the access method's build procedure
2899  */
2900  stats = indexRelation->rd_indam->ambuild(heapRelation, indexRelation,
2901  indexInfo);
2902  Assert(PointerIsValid(stats));
2903 
2904  /*
2905  * If this is an unlogged index, we may need to write out an init fork for
2906  * it -- but we must first check whether one already exists. If, for
2907  * example, an unlogged relation is truncated in the transaction that
2908  * created it, or truncated twice in a subsequent transaction, the
2909  * relfilenode won't change, and nothing needs to be done here.
2910  */
2911  if (indexRelation->rd_rel->relpersistence == RELPERSISTENCE_UNLOGGED &&
2912  !smgrexists(indexRelation->rd_smgr, INIT_FORKNUM))
2913  {
2914  RelationOpenSmgr(indexRelation);
2915  smgrcreate(indexRelation->rd_smgr, INIT_FORKNUM, false);
2916  indexRelation->rd_indam->ambuildempty(indexRelation);
2917  }
2918 
2919  /*
2920  * If we found any potentially broken HOT chains, mark the index as not
2921  * being usable until the current transaction is below the event horizon.
2922  * See src/backend/access/heap/README.HOT for discussion. Also set this
2923  * if early pruning/vacuuming is enabled for the heap relation. While it
2924  * might become safe to use the index earlier based on actual cleanup
2925  * activity and other active transactions, the test for that would be much
2926  * more complex and would require some form of blocking, so keep it simple
2927  * and fast by just using the current transaction.
2928  *
2929  * However, when reindexing an existing index, we should do nothing here.
2930  * Any HOT chains that are broken with respect to the index must predate
2931  * the index's original creation, so there is no need to change the
2932  * index's usability horizon. Moreover, we *must not* try to change the
2933  * index's pg_index entry while reindexing pg_index itself, and this
2934  * optimization nicely prevents that. The more complex rules needed for a
2935  * reindex are handled separately after this function returns.
2936  *
2937  * We also need not set indcheckxmin during a concurrent index build,
2938  * because we won't set indisvalid true until all transactions that care
2939  * about the broken HOT chains or early pruning/vacuuming are gone.
2940  *
2941  * Therefore, this code path can only be taken during non-concurrent
2942  * CREATE INDEX. Thus the fact that heap_update will set the pg_index
2943  * tuple's xmin doesn't matter, because that tuple was created in the
2944  * current transaction anyway. That also means we don't need to worry
2945  * about any concurrent readers of the tuple; no other transaction can see
2946  * it yet.
2947  */
2948  if ((indexInfo->ii_BrokenHotChain || EarlyPruningEnabled(heapRelation)) &&
2949  !isreindex &&
2950  !indexInfo->ii_Concurrent)
2951  {
2952  Oid indexId = RelationGetRelid(indexRelation);
2953  Relation pg_index;
2954  HeapTuple indexTuple;
2955  Form_pg_index indexForm;
2956 
2957  pg_index = table_open(IndexRelationId, RowExclusiveLock);
2958 
2959  indexTuple = SearchSysCacheCopy1(INDEXRELID,
2960  ObjectIdGetDatum(indexId));
2961  if (!HeapTupleIsValid(indexTuple))
2962  elog(ERROR, "cache lookup failed for index %u", indexId);
2963  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
2964 
2965  /* If it's a new index, indcheckxmin shouldn't be set ... */
2966  Assert(!indexForm->indcheckxmin);
2967 
2968  indexForm->indcheckxmin = true;
2969  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
2970 
2971  heap_freetuple(indexTuple);
2972  table_close(pg_index, RowExclusiveLock);
2973  }
2974 
2975  /*
2976  * Update heap and index pg_class rows
2977  */
2978  index_update_stats(heapRelation,
2979  true,
2980  stats->heap_tuples);
2981 
2982  index_update_stats(indexRelation,
2983  false,
2984  stats->index_tuples);
2985 
2986  /* Make the updated catalog row versions visible */
2988 
2989  /*
2990  * If it's for an exclusion constraint, make a second pass over the heap
2991  * to verify that the constraint is satisfied. We must not do this until
2992  * the index is fully valid. (Broken HOT chains shouldn't matter, though;
2993  * see comments for IndexCheckExclusion.)
2994  */
2995  if (indexInfo->ii_ExclusionOps != NULL)
2996  IndexCheckExclusion(heapRelation, indexRelation, indexInfo);
2997 
2998  /* Roll back any GUC changes executed by index functions */
2999  AtEOXact_GUC(false, save_nestlevel);
3000 
3001  /* Restore userid and security context */
3002  SetUserIdAndSecContext(save_userid, save_sec_context);
3003 }
struct IndexAmRoutine * rd_indam
Definition: rel.h:168
static void index_update_stats(Relation rel, bool hasindex, double reltuples)
Definition: index.c:2675
#define DEBUG1
Definition: elog.h:25
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void smgrcreate(SMgrRelation reln, ForkNumber forknum, bool isRedo)
Definition: smgr.c:333
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define SECURITY_RESTRICTED_OPERATION
Definition: miscadmin.h:298
void SetUserIdAndSecContext(Oid userid, int sec_context)
Definition: miscinit.c:551
int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...)
Definition: elog.c:934
struct SMgrRelationData * rd_smgr
Definition: rel.h:57
#define PROGRESS_CREATEIDX_TUPLES_TOTAL
Definition: progress.h:84
bool smgrexists(SMgrRelation reln, ForkNumber forknum)
Definition: smgr.c:247
Form_pg_class rd_rel
Definition: rel.h:89
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
Definition: type.h:89
#define RelationOpenSmgr(relation)
Definition: rel.h:493
#define EarlyPruningEnabled(rel)
Definition: snapmgr.h:45
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
ambuild_function ambuild
Definition: amapi.h:216
#define RelationIsValid(relation)
Definition: rel.h:409
ItemPointerData t_self
Definition: htup.h:65
#define IsNormalProcessingMode()
Definition: miscadmin.h:394
void GetUserIdAndSecContext(Oid *userid, int *sec_context)
Definition: miscinit.c:544
#define RowExclusiveLock
Definition: lockdefs.h:38
void AtEOXact_GUC(bool isCommit, int nestLevel)
Definition: guc.c:5900
#define RelationGetRelationName(relation)
Definition: rel.h:470
bool ii_BrokenHotChain
Definition: execnodes.h:175
static void IndexCheckExclusion(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo)
Definition: index.c:3018
#define PROGRESS_CREATEIDX_SUBPHASE_INITIALIZE
Definition: progress.h:104
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
#define PROGRESS_CREATEIDX_PHASE
Definition: progress.h:82
#define PROGRESS_SCAN_BLOCKS_DONE
Definition: progress.h:120
void CommandCounterIncrement(void)
Definition: xact.c:1005
#define ereport(elevel,...)
Definition: elog.h:144
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
#define PROGRESS_CREATEIDX_PHASE_BUILD
Definition: progress.h:92
void pgstat_progress_update_multi_param(int nparam, const int *index, const int64 *val)
Definition: pgstat.c:3183
int ii_ParallelWorkers
Definition: execnodes.h:176
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:224
int plan_create_index_workers(Oid tableOid, Oid indexOid)
Definition: planner.c:6244
#define PROGRESS_SCAN_BLOCKS_TOTAL
Definition: progress.h:119
bool ii_Concurrent
Definition: execnodes.h:174
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
int NewGUCNestLevel(void)
Definition: guc.c:5886
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define PROGRESS_CREATEIDX_TUPLES_DONE
Definition: progress.h:85
#define elog(elevel,...)
Definition: elog.h:214
ambuildempty_function ambuildempty
Definition: amapi.h:217
#define PROGRESS_CREATEIDX_SUBPHASE
Definition: progress.h:83
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define PointerIsValid(pointer)
Definition: c.h:632
#define RelationGetRelid(relation)
Definition: rel.h:436
long val
Definition: informix.c:664
double index_tuples
Definition: genam.h:33
double heap_tuples
Definition: genam.h:32

◆ index_check_primary_key()

void index_check_primary_key ( Relation  heapRel,
IndexInfo indexInfo,
bool  is_alter_table,
IndexStmt stmt 
)

Definition at line 202 of file index.c.

References ATTNUM, attnum, elog, ereport, errcode(), errmsg(), ERROR, GETSTRUCT, HeapTupleIsValid, i, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexKeyAttrs, Int16GetDatum, NameStr, ObjectIdGetDatum, RelationData::rd_rel, RelationGetRelationName, RelationGetRelid, relationHasPrimaryKey(), ReleaseSysCache(), and SearchSysCache2().

Referenced by ATExecAddIndexConstraint(), and DefineIndex().

206 {
207  int i;
208 
209  /*
210  * If ALTER TABLE or CREATE TABLE .. PARTITION OF, check that there isn't
211  * already a PRIMARY KEY. In CREATE TABLE for an ordinary relation, we
212  * have faith that the parser rejected multiple pkey clauses; and CREATE
213  * INDEX doesn't have a way to say PRIMARY KEY, so it's no problem either.
214  */
215  if ((is_alter_table || heapRel->rd_rel->relispartition) &&
216  relationHasPrimaryKey(heapRel))
217  {
218  ereport(ERROR,
219  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
220  errmsg("multiple primary keys for table \"%s\" are not allowed",
221  RelationGetRelationName(heapRel))));
222  }
223 
224  /*
225  * Check that all of the attributes in a primary key are marked as not
226  * null. (We don't really expect to see that; it'd mean the parser messed
227  * up. But it seems wise to check anyway.)
228  */
229  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
230  {
231  AttrNumber attnum = indexInfo->ii_IndexAttrNumbers[i];
232  HeapTuple atttuple;
233  Form_pg_attribute attform;
234 
235  if (attnum == 0)
236  ereport(ERROR,
237  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
238  errmsg("primary keys cannot be expressions")));
239 
240  /* System attributes are never null, so no need to check */
241  if (attnum < 0)
242  continue;
243 
244  atttuple = SearchSysCache2(ATTNUM,
246  Int16GetDatum(attnum));
247  if (!HeapTupleIsValid(atttuple))
248  elog(ERROR, "cache lookup failed for attribute %d of relation %u",
249  attnum, RelationGetRelid(heapRel));
250  attform = (Form_pg_attribute) GETSTRUCT(atttuple);
251 
252  if (!attform->attnotnull)
253  ereport(ERROR,
254  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
255  errmsg("primary key column \"%s\" is not marked NOT NULL",
256  NameStr(attform->attname))));
257 
258  ReleaseSysCache(atttuple);
259  }
260 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define Int16GetDatum(X)
Definition: postgres.h:451
int errcode(int sqlerrcode)
Definition: elog.c:610
Form_pg_class rd_rel
Definition: rel.h:89
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
#define RelationGetRelationName(relation)
Definition: rel.h:470
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
static bool relationHasPrimaryKey(Relation rel)
Definition: index.c:148
int16 attnum
Definition: pg_attribute.h:79
#define ereport(elevel,...)
Definition: elog.h:144
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
HeapTuple SearchSysCache2(int cacheId, Datum key1, Datum key2)
Definition: syscache.c:1127
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
int i
#define NameStr(name)
Definition: c.h:615
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
int16 AttrNumber
Definition: attnum.h:21
#define RelationGetRelid(relation)
Definition: rel.h:436

◆ index_concurrently_build()

void index_concurrently_build ( Oid  heapRelationId,
Oid  indexRelationId 
)

Definition at line 1411 of file index.c.

References ActiveSnapshotSet(), Assert, BuildIndexInfo(), IndexInfo::ii_BrokenHotChain, IndexInfo::ii_Concurrent, IndexInfo::ii_ReadyForInserts, index_build(), index_close(), INDEX_CREATE_SET_READY, index_open(), index_set_state_flags(), NoLock, RowExclusiveLock, ShareUpdateExclusiveLock, table_close(), and table_open().

Referenced by DefineIndex(), and ReindexRelationConcurrently().

1413 {
1414  Relation heapRel;
1415  Relation indexRelation;
1416  IndexInfo *indexInfo;
1417 
1418  /* This had better make sure that a snapshot is active */
1420 
1421  /* Open and lock the parent heap relation */
1422  heapRel = table_open(heapRelationId, ShareUpdateExclusiveLock);
1423 
1424  /* And the target index relation */
1425  indexRelation = index_open(indexRelationId, RowExclusiveLock);
1426 
1427  /*
1428  * We have to re-build the IndexInfo struct, since it was lost in the
1429  * commit of the transaction where this concurrent index was created at
1430  * the catalog level.
1431  */
1432  indexInfo = BuildIndexInfo(indexRelation);
1433  Assert(!indexInfo->ii_ReadyForInserts);
1434  indexInfo->ii_Concurrent = true;
1435  indexInfo->ii_BrokenHotChain = false;
1436 
1437  /* Now build the index */
1438  index_build(heapRel, indexRelation, indexInfo, false, true);
1439 
1440  /* Close both the relations, but keep the locks */
1441  table_close(heapRel, NoLock);
1442  index_close(indexRelation, NoLock);
1443 
1444  /*
1445  * Update the pg_index row to mark the index as ready for inserts. Once we
1446  * commit this transaction, any new transactions that open the table must
1447  * insert new entries into the index for insertions and non-HOT updates.
1448  */
1450 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3330
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2312
#define NoLock
Definition: lockdefs.h:34
#define RowExclusiveLock
Definition: lockdefs.h:38
bool ii_BrokenHotChain
Definition: execnodes.h:175
bool ActiveSnapshotSet(void)
Definition: snapmgr.c:853
bool ii_ReadyForInserts
Definition: execnodes.h:173
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
void index_build(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
Definition: index.c:2823
#define Assert(condition)
Definition: c.h:738
bool ii_Concurrent
Definition: execnodes.h:174
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132

◆ index_concurrently_create_copy()

Oid index_concurrently_create_copy ( Relation  heapRelation,
Oid  oldIndexId,
const char *  newName 
)

Definition at line 1252 of file index.c.

References Assert, BuildIndexInfo(), DatumGetPointer, elog, ereport, errcode(), errmsg(), ERROR, HeapTupleIsValid, i, IndexInfo::ii_Am, IndexInfo::ii_ExclusionOps, IndexInfo::ii_Expressions, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_NumIndexKeyAttrs, IndexInfo::ii_Predicate, IndexInfo::ii_Unique, index_close(), index_create(), INDEX_CREATE_CONCURRENT, INDEX_CREATE_SKIP_BUILD, index_open(), INDEXRELID, InvalidOid, lappend(), make_ands_implicit(), makeIndexInfo(), NameStr, NIL, NoLock, ObjectIdGetDatum, pfree(), RelationData::rd_indcollation, RelationData::rd_rel, RelationGetDescr, ReleaseSysCache(), RELOID, RowExclusiveLock, SearchSysCache1(), stringToNode(), SysCacheGetAttr(), TextDatumGetCString, TupleDescAttr, int2vector::values, and oidvector::values.

Referenced by ReindexRelationConcurrently().

1253 {
1254  Relation indexRelation;
1255  IndexInfo *oldInfo,
1256  *newInfo;
1257  Oid newIndexId = InvalidOid;
1258  HeapTuple indexTuple,
1259  classTuple;
1260  Datum indclassDatum,
1261  colOptionDatum,
1262  optionDatum;
1263  oidvector *indclass;
1264  int2vector *indcoloptions;
1265  bool isnull;
1266  List *indexColNames = NIL;
1267  List *indexExprs = NIL;
1268  List *indexPreds = NIL;
1269 
1270  indexRelation = index_open(oldIndexId, RowExclusiveLock);
1271 
1272  /* The new index needs some information from the old index */
1273  oldInfo = BuildIndexInfo(indexRelation);
1274 
1275  /*
1276  * Concurrent build of an index with exclusion constraints is not
1277  * supported.
1278  */
1279  if (oldInfo->ii_ExclusionOps != NULL)
1280  ereport(ERROR,
1281  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1282  errmsg("concurrent index creation for exclusion constraints is not supported")));
1283 
1284  /* Get the array of class and column options IDs from index info */
1285  indexTuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(oldIndexId));
1286  if (!HeapTupleIsValid(indexTuple))
1287  elog(ERROR, "cache lookup failed for index %u", oldIndexId);
1288  indclassDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1289  Anum_pg_index_indclass, &isnull);
1290  Assert(!isnull);
1291  indclass = (oidvector *) DatumGetPointer(indclassDatum);
1292 
1293  colOptionDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1294  Anum_pg_index_indoption, &isnull);
1295  Assert(!isnull);
1296  indcoloptions = (int2vector *) DatumGetPointer(colOptionDatum);
1297 
1298  /* Fetch options of index if any */
1299  classTuple = SearchSysCache1(RELOID, oldIndexId);
1300  if (!HeapTupleIsValid(classTuple))
1301  elog(ERROR, "cache lookup failed for relation %u", oldIndexId);
1302  optionDatum = SysCacheGetAttr(RELOID, classTuple,
1303  Anum_pg_class_reloptions, &isnull);
1304 
1305  /*
1306  * Fetch the list of expressions and predicates directly from the
1307  * catalogs. This cannot rely on the information from IndexInfo of the
1308  * old index as these have been flattened for the planner.
1309  */
1310  if (oldInfo->ii_Expressions != NIL)
1311  {
1312  Datum exprDatum;
1313  char *exprString;
1314 
1315  exprDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1316  Anum_pg_index_indexprs, &isnull);
1317  Assert(!isnull);
1318  exprString = TextDatumGetCString(exprDatum);
1319  indexExprs = (List *) stringToNode(exprString);
1320  pfree(exprString);
1321  }
1322  if (oldInfo->ii_Predicate != NIL)
1323  {
1324  Datum predDatum;
1325  char *predString;
1326 
1327  predDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1328  Anum_pg_index_indpred, &isnull);
1329  Assert(!isnull);
1330  predString = TextDatumGetCString(predDatum);
1331  indexPreds = (List *) stringToNode(predString);
1332 
1333  /* Also convert to implicit-AND format */
1334  indexPreds = make_ands_implicit((Expr *) indexPreds);
1335  pfree(predString);
1336  }
1337 
1338  /*
1339  * Build the index information for the new index. Note that rebuild of
1340  * indexes with exclusion constraints is not supported, hence there is no
1341  * need to fill all the ii_Exclusion* fields.
1342  */
1343  newInfo = makeIndexInfo(oldInfo->ii_NumIndexAttrs,
1344  oldInfo->ii_NumIndexKeyAttrs,
1345  oldInfo->ii_Am,
1346  indexExprs,
1347  indexPreds,
1348  oldInfo->ii_Unique,
1349  false, /* not ready for inserts */
1350  true);
1351 
1352  /*
1353  * Extract the list of column names and the column numbers for the new
1354  * index information. All this information will be used for the index
1355  * creation.
1356  */
1357  for (int i = 0; i < oldInfo->ii_NumIndexAttrs; i++)
1358  {
1359  TupleDesc indexTupDesc = RelationGetDescr(indexRelation);
1360  Form_pg_attribute att = TupleDescAttr(indexTupDesc, i);
1361 
1362  indexColNames = lappend(indexColNames, NameStr(att->attname));
1363  newInfo->ii_IndexAttrNumbers[i] = oldInfo->ii_IndexAttrNumbers[i];
1364  }
1365 
1366  /*
1367  * Now create the new index.
1368  *
1369  * For a partition index, we adjust the partition dependency later, to
1370  * ensure a consistent state at all times. That is why parentIndexRelid
1371  * is not set here.
1372  */
1373  newIndexId = index_create(heapRelation,
1374  newName,
1375  InvalidOid, /* indexRelationId */
1376  InvalidOid, /* parentIndexRelid */
1377  InvalidOid, /* parentConstraintId */
1378  InvalidOid, /* relFileNode */
1379  newInfo,
1380  indexColNames,
1381  indexRelation->rd_rel->relam,
1382  indexRelation->rd_rel->reltablespace,
1383  indexRelation->rd_indcollation,
1384  indclass->values,
1385  indcoloptions->values,
1386  optionDatum,
1388  0,
1389  true, /* allow table to be a system catalog? */
1390  false, /* is_internal? */
1391  NULL);
1392 
1393  /* Close the relations used and clean up */
1394  index_close(indexRelation, NoLock);
1395  ReleaseSysCache(indexTuple);
1396  ReleaseSysCache(classTuple);
1397 
1398  return newIndexId;
1399 }
#define NIL
Definition: pg_list.h:65
Definition: c.h:594
List * ii_Predicate
Definition: execnodes.h:163
#define RelationGetDescr(relation)
Definition: rel.h:462
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
int errcode(int sqlerrcode)
Definition: elog.c:610
void * stringToNode(const char *str)
Definition: read.c:89
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2312
Form_pg_class rd_rel
Definition: rel.h:89
unsigned int Oid
Definition: postgres_ext.h:31
Oid index_create(Relation heapRelation, const char *indexRelationName, Oid indexRelationId, Oid parentIndexRelid, Oid parentConstraintId, Oid relFileNode, IndexInfo *indexInfo, List *indexColNames, Oid accessMethodObjectId, Oid tableSpaceId, Oid *collationObjectId, Oid *classObjectId, int16 *coloptions, Datum reloptions, bits16 flags, bits16 constr_flags, bool allow_system_table_mods, bool is_internal, Oid *constraintId)
Definition: index.c:694
void pfree(void *pointer)
Definition: mcxt.c:1056
Oid * rd_indcollation
Definition: rel.h:179
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
#define NoLock
Definition: lockdefs.h:34
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:602
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:740
List * lappend(List *list, void *datum)
Definition: list.c:322
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
Definition: c.h:583
#define TextDatumGetCString(d)
Definition: builtins.h:88
uintptr_t Datum
Definition: postgres.h:367
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
int ii_NumIndexAttrs
Definition: execnodes.h:158
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:716
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:1377
#define InvalidOid
Definition: postgres_ext.h:36
#define INDEX_CREATE_CONCURRENT
Definition: index.h:50
#define ereport(elevel,...)
Definition: elog.h:144
bool ii_Unique
Definition: execnodes.h:172
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * ii_Expressions
Definition: execnodes.h:161
#define Assert(condition)
Definition: c.h:738
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:591
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
#define DatumGetPointer(X)
Definition: postgres.h:549
#define INDEX_CREATE_SKIP_BUILD
Definition: index.h:49
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
int i
#define NameStr(name)
Definition: c.h:615
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
Definition: pg_list.h:50
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132
Oid ii_Am
Definition: execnodes.h:177

◆ index_concurrently_set_dead()

void index_concurrently_set_dead ( Oid  heapId,
Oid  indexId 
)

Definition at line 1745 of file index.c.

References CacheInvalidateRelcache(), index_close(), INDEX_DROP_SET_DEAD, index_open(), index_set_state_flags(), NoLock, ShareUpdateExclusiveLock, table_close(), table_open(), and TransferPredicateLocksToHeapRelation().

Referenced by index_drop(), and ReindexRelationConcurrently().

1746 {
1747  Relation userHeapRelation;
1748  Relation userIndexRelation;
1749 
1750  /*
1751  * No more predicate locks will be acquired on this index, and we're about
1752  * to stop doing inserts into the index which could show conflicts with
1753  * existing predicate locks, so now is the time to move them to the heap
1754  * relation.
1755  */
1756  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
1757  userIndexRelation = index_open(indexId, ShareUpdateExclusiveLock);
1758  TransferPredicateLocksToHeapRelation(userIndexRelation);
1759 
1760  /*
1761  * Now we are sure that nobody uses the index for queries; they just might
1762  * have it open for updating it. So now we can unset indisready and
1763  * indislive, then wait till nobody could be using it at all anymore.
1764  */
1766 
1767  /*
1768  * Invalidate the relcache for the table, so that after this commit all
1769  * sessions will refresh the table's index list. Forgetting just the
1770  * index's relcache entry is not enough.
1771  */
1772  CacheInvalidateRelcache(userHeapRelation);
1773 
1774  /*
1775  * Close the relations again, though still holding session lock.
1776  */
1777  table_close(userHeapRelation, NoLock);
1778  index_close(userIndexRelation, NoLock);
1779 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3330
#define NoLock
Definition: lockdefs.h:34
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3077
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1270
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132

◆ index_concurrently_swap()

void index_concurrently_swap ( Oid  newIndexId,
Oid  oldIndexId,
const char *  oldName 
)

Definition at line 1459 of file index.c.

References PgStat_StatTabEntry::blocks_fetched, PgStat_StatTabEntry::blocks_hit, BTEqualStrategyNumber, CatalogTupleUpdate(), changeDependenciesOf(), changeDependenciesOn(), CONSTROID, DeleteInheritsTuple(), DescriptionObjIndexId, elog, ERROR, get_index_constraint(), get_index_ref_constraints(), get_partition_ancestors(), get_rel_relispartition(), GETSTRUCT, heap_copytuple(), heap_freetuple(), heap_modify_tuple(), HeapTupleIsValid, INDEXRELID, Int32GetDatum, sort-test::key, lappend_oid(), lfirst_oid, linitial_oid, list_free(), NameStr, namestrcpy(), NIL, NoLock, PgStat_StatTabEntry::numscans, ObjectIdGetDatum, OidIsValid, pgstat_fetch_stat_tabentry(), RelationData::pgstat_info, relation_close(), relation_open(), RelationGetDescr, RELOID, RowExclusiveLock, ScanKeyInit(), SearchSysCacheCopy1, ShareUpdateExclusiveLock, StoreSingleInheritance(), systable_beginscan(), systable_endscan(), systable_getnext(), PgStat_TableCounts::t_blocks_fetched, PgStat_TableCounts::t_blocks_hit, PgStat_TableStatus::t_counts, PgStat_TableCounts::t_numscans, HeapTupleData::t_self, PgStat_TableCounts::t_tuples_fetched, PgStat_TableCounts::t_tuples_returned, table_close(), table_open(), TriggerConstraintIndexId, PgStat_StatTabEntry::tuples_fetched, PgStat_StatTabEntry::tuples_returned, and values.

Referenced by ReindexRelationConcurrently().

1460 {
1461  Relation pg_class,
1462  pg_index,
1463  pg_constraint,
1464  pg_trigger;
1465  Relation oldClassRel,
1466  newClassRel;
1467  HeapTuple oldClassTuple,
1468  newClassTuple;
1469  Form_pg_class oldClassForm,
1470  newClassForm;
1471  HeapTuple oldIndexTuple,
1472  newIndexTuple;
1473  Form_pg_index oldIndexForm,
1474  newIndexForm;
1475  bool isPartition;
1476  Oid indexConstraintOid;
1477  List *constraintOids = NIL;
1478  ListCell *lc;
1479 
1480  /*
1481  * Take a necessary lock on the old and new index before swapping them.
1482  */
1483  oldClassRel = relation_open(oldIndexId, ShareUpdateExclusiveLock);
1484  newClassRel = relation_open(newIndexId, ShareUpdateExclusiveLock);
1485 
1486  /* Now swap names and dependencies of those indexes */
1487  pg_class = table_open(RelationRelationId, RowExclusiveLock);
1488 
1489  oldClassTuple = SearchSysCacheCopy1(RELOID,
1490  ObjectIdGetDatum(oldIndexId));
1491  if (!HeapTupleIsValid(oldClassTuple))
1492  elog(ERROR, "could not find tuple for relation %u", oldIndexId);
1493  newClassTuple = SearchSysCacheCopy1(RELOID,
1494  ObjectIdGetDatum(newIndexId));
1495  if (!HeapTupleIsValid(newClassTuple))
1496  elog(ERROR, "could not find tuple for relation %u", newIndexId);
1497 
1498  oldClassForm = (Form_pg_class) GETSTRUCT(oldClassTuple);
1499  newClassForm = (Form_pg_class) GETSTRUCT(newClassTuple);
1500 
1501  /* Swap the names */
1502  namestrcpy(&newClassForm->relname, NameStr(oldClassForm->relname));
1503  namestrcpy(&oldClassForm->relname, oldName);
1504 
1505  /* Swap the partition flags to track inheritance properly */
1506  isPartition = newClassForm->relispartition;
1507  newClassForm->relispartition = oldClassForm->relispartition;
1508  oldClassForm->relispartition = isPartition;
1509 
1510  CatalogTupleUpdate(pg_class, &oldClassTuple->t_self, oldClassTuple);
1511  CatalogTupleUpdate(pg_class, &newClassTuple->t_self, newClassTuple);
1512 
1513  heap_freetuple(oldClassTuple);
1514  heap_freetuple(newClassTuple);
1515 
1516  /* Now swap index info */
1517  pg_index = table_open(IndexRelationId, RowExclusiveLock);
1518 
1519  oldIndexTuple = SearchSysCacheCopy1(INDEXRELID,
1520  ObjectIdGetDatum(oldIndexId));
1521  if (!HeapTupleIsValid(oldIndexTuple))
1522  elog(ERROR, "could not find tuple for relation %u", oldIndexId);
1523  newIndexTuple = SearchSysCacheCopy1(INDEXRELID,
1524  ObjectIdGetDatum(newIndexId));
1525  if (!HeapTupleIsValid(newIndexTuple))
1526  elog(ERROR, "could not find tuple for relation %u", newIndexId);
1527 
1528  oldIndexForm = (Form_pg_index) GETSTRUCT(oldIndexTuple);
1529  newIndexForm = (Form_pg_index) GETSTRUCT(newIndexTuple);
1530 
1531  /*
1532  * Copy constraint flags from the old index. This is safe because the old
1533  * index guaranteed uniqueness.
1534  */
1535  newIndexForm->indisprimary = oldIndexForm->indisprimary;
1536  oldIndexForm->indisprimary = false;
1537  newIndexForm->indisexclusion = oldIndexForm->indisexclusion;
1538  oldIndexForm->indisexclusion = false;
1539  newIndexForm->indimmediate = oldIndexForm->indimmediate;
1540  oldIndexForm->indimmediate = true;
1541 
1542  /* Preserve indisclustered in the new index */
1543  newIndexForm->indisclustered = oldIndexForm->indisclustered;
1544 
1545  /*
1546  * Mark the new index as valid, and the old index as invalid similarly
1547  * to what index_set_state_flags() does.
1548  */
1549  newIndexForm->indisvalid = true;
1550  oldIndexForm->indisvalid = false;
1551  oldIndexForm->indisclustered = false;
1552 
1553  CatalogTupleUpdate(pg_index, &oldIndexTuple->t_self, oldIndexTuple);
1554  CatalogTupleUpdate(pg_index, &newIndexTuple->t_self, newIndexTuple);
1555 
1556  heap_freetuple(oldIndexTuple);
1557  heap_freetuple(newIndexTuple);
1558 
1559  /*
1560  * Move constraints and triggers over to the new index
1561  */
1562 
1563  constraintOids = get_index_ref_constraints(oldIndexId);
1564 
1565  indexConstraintOid = get_index_constraint(oldIndexId);
1566 
1567  if (OidIsValid(indexConstraintOid))
1568  constraintOids = lappend_oid(constraintOids, indexConstraintOid);
1569 
1570  pg_constraint = table_open(ConstraintRelationId, RowExclusiveLock);
1571  pg_trigger = table_open(TriggerRelationId, RowExclusiveLock);
1572 
1573  foreach(lc, constraintOids)
1574  {
1575  HeapTuple constraintTuple,
1576  triggerTuple;
1577  Form_pg_constraint conForm;
1578  ScanKeyData key[1];
1579  SysScanDesc scan;
1580  Oid constraintOid = lfirst_oid(lc);
1581 
1582  /* Move the constraint from the old to the new index */
1583  constraintTuple = SearchSysCacheCopy1(CONSTROID,
1584  ObjectIdGetDatum(constraintOid));
1585  if (!HeapTupleIsValid(constraintTuple))
1586  elog(ERROR, "could not find tuple for constraint %u", constraintOid);
1587 
1588  conForm = ((Form_pg_constraint) GETSTRUCT(constraintTuple));
1589 
1590  if (conForm->conindid == oldIndexId)
1591  {
1592  conForm->conindid = newIndexId;
1593 
1594  CatalogTupleUpdate(pg_constraint, &constraintTuple->t_self, constraintTuple);
1595  }
1596 
1597  heap_freetuple(constraintTuple);
1598 
1599  /* Search for trigger records */
1600  ScanKeyInit(&key[0],
1601  Anum_pg_trigger_tgconstraint,
1602  BTEqualStrategyNumber, F_OIDEQ,
1603  ObjectIdGetDatum(constraintOid));
1604 
1605  scan = systable_beginscan(pg_trigger, TriggerConstraintIndexId, true,
1606  NULL, 1, key);
1607 
1608  while (HeapTupleIsValid((triggerTuple = systable_getnext(scan))))
1609  {
1610  Form_pg_trigger tgForm = (Form_pg_trigger) GETSTRUCT(triggerTuple);
1611 
1612  if (tgForm->tgconstrindid != oldIndexId)
1613  continue;
1614 
1615  /* Make a modifiable copy */
1616  triggerTuple = heap_copytuple(triggerTuple);
1617  tgForm = (Form_pg_trigger) GETSTRUCT(triggerTuple);
1618 
1619  tgForm->tgconstrindid = newIndexId;
1620 
1621  CatalogTupleUpdate(pg_trigger, &triggerTuple->t_self, triggerTuple);
1622 
1623  heap_freetuple(triggerTuple);
1624  }
1625 
1626  systable_endscan(scan);
1627  }
1628 
1629  /*
1630  * Move comment if any
1631  */
1632  {
1633  Relation description;
1634  ScanKeyData skey[3];
1635  SysScanDesc sd;
1636  HeapTuple tuple;
1637  Datum values[Natts_pg_description] = {0};
1638  bool nulls[Natts_pg_description] = {0};
1639  bool replaces[Natts_pg_description] = {0};
1640 
1641  values[Anum_pg_description_objoid - 1] = ObjectIdGetDatum(newIndexId);
1642  replaces[Anum_pg_description_objoid - 1] = true;
1643 
1644  ScanKeyInit(&skey[0],
1645  Anum_pg_description_objoid,
1646  BTEqualStrategyNumber, F_OIDEQ,
1647  ObjectIdGetDatum(oldIndexId));
1648  ScanKeyInit(&skey[1],
1649  Anum_pg_description_classoid,
1650  BTEqualStrategyNumber, F_OIDEQ,
1651  ObjectIdGetDatum(RelationRelationId));
1652  ScanKeyInit(&skey[2],
1653  Anum_pg_description_objsubid,
1654  BTEqualStrategyNumber, F_INT4EQ,
1655  Int32GetDatum(0));
1656 
1657  description = table_open(DescriptionRelationId, RowExclusiveLock);
1658 
1659  sd = systable_beginscan(description, DescriptionObjIndexId, true,
1660  NULL, 3, skey);
1661 
1662  while ((tuple = systable_getnext(sd)) != NULL)
1663  {
1664  tuple = heap_modify_tuple(tuple, RelationGetDescr(description),
1665  values, nulls, replaces);
1666  CatalogTupleUpdate(description, &tuple->t_self, tuple);
1667 
1668  break; /* Assume there can be only one match */
1669  }
1670 
1671  systable_endscan(sd);
1672  table_close(description, NoLock);
1673  }
1674 
1675  /*
1676  * Swap inheritance relationship with parent index
1677  */
1678  if (get_rel_relispartition(oldIndexId))
1679  {
1680  List *ancestors = get_partition_ancestors(oldIndexId);
1681  Oid parentIndexRelid = linitial_oid(ancestors);
1682 
1683  DeleteInheritsTuple(oldIndexId, parentIndexRelid);
1684  StoreSingleInheritance(newIndexId, parentIndexRelid, 1);
1685 
1686  list_free(ancestors);
1687  }
1688 
1689  /*
1690  * Swap all dependencies of and on the old index to the new one, and
1691  * vice-versa. Note that a call to CommandCounterIncrement() would cause
1692  * duplicate entries in pg_depend, so this should not be done.
1693  */
1694  changeDependenciesOf(RelationRelationId, newIndexId, oldIndexId);
1695  changeDependenciesOn(RelationRelationId, newIndexId, oldIndexId);
1696 
1697  changeDependenciesOf(RelationRelationId, oldIndexId, newIndexId);
1698  changeDependenciesOn(RelationRelationId, oldIndexId, newIndexId);
1699 
1700  /*
1701  * Copy over statistics from old to new index
1702  */
1703  {
1704  PgStat_StatTabEntry *tabentry;
1705 
1706  tabentry = pgstat_fetch_stat_tabentry(oldIndexId);
1707  if (tabentry)
1708  {
1709  if (newClassRel->pgstat_info)
1710  {
1711  newClassRel->pgstat_info->t_counts.t_numscans = tabentry->numscans;
1712  newClassRel->pgstat_info->t_counts.t_tuples_returned = tabentry->tuples_returned;
1713  newClassRel->pgstat_info->t_counts.t_tuples_fetched = tabentry->tuples_fetched;
1714  newClassRel->pgstat_info->t_counts.t_blocks_fetched = tabentry->blocks_fetched;
1715  newClassRel->pgstat_info->t_counts.t_blocks_hit = tabentry->blocks_hit;
1716 
1717  /*
1718  * The data will be sent by the next pgstat_report_stat()
1719  * call.
1720  */
1721  }
1722  }
1723  }
1724 
1725  /* Close relations */
1726  table_close(pg_class, RowExclusiveLock);
1727  table_close(pg_index, RowExclusiveLock);
1728  table_close(pg_constraint, RowExclusiveLock);
1729  table_close(pg_trigger, RowExclusiveLock);
1730 
1731  /* The lock taken previously is not released until the end of transaction */
1732  relation_close(oldClassRel, NoLock);
1733  relation_close(newClassRel, NoLock);
1734 }
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:680
#define NIL
Definition: pg_list.h:65
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:529
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
PgStat_Counter tuples_returned
Definition: pgstat.h:639
#define RelationGetDescr(relation)
Definition: rel.h:462
PgStat_Counter t_tuples_fetched
Definition: pgstat.h:103
bool DeleteInheritsTuple(Oid inhrelid, Oid inhparent)
Definition: pg_inherits.c:454
PgStat_Counter numscans
Definition: pgstat.h:637
PgStat_TableCounts t_counts
Definition: pgstat.h:159
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
int namestrcpy(Name name, const char *str)
Definition: name.c:250
List * lappend_oid(List *list, Oid datum)
Definition: list.c:358
#define OidIsValid(objectId)
Definition: c.h:644
PgStat_Counter t_tuples_returned
Definition: pgstat.h:102
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:356
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:448
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: relation.c:48
ItemPointerData t_self
Definition: htup.h:65
PgStat_StatTabEntry * pgstat_fetch_stat_tabentry(Oid relid)
Definition: pgstat.c:2455
#define NoLock
Definition: lockdefs.h:34
#define RowExclusiveLock
Definition: lockdefs.h:38
PgStat_Counter tuples_fetched
Definition: pgstat.h:640
Oid get_index_constraint(Oid indexId)
Definition: pg_depend.c:916
#define TriggerConstraintIndexId
Definition: indexing.h:251
void StoreSingleInheritance(Oid relationId, Oid parentOid, int32 seqNumber)
Definition: pg_inherits.c:417
PgStat_Counter t_blocks_hit
Definition: pgstat.h:116
bool get_rel_relispartition(Oid relid)
Definition: lsyscache.c:1890
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
uintptr_t Datum
Definition: postgres.h:367
PgStat_Counter blocks_hit
Definition: pgstat.h:653
PgStat_Counter t_numscans
Definition: pgstat.h:100
long changeDependenciesOf(Oid classId, Oid oldObjectId, Oid newObjectId)
Definition: pg_depend.c:407
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
FormData_pg_constraint * Form_pg_constraint
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: relation.c:206
#define linitial_oid(l)
Definition: pg_list.h:197
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:224
struct PgStat_TableStatus * pgstat_info
Definition: rel.h:216
FormData_pg_trigger * Form_pg_trigger
Definition: pg_trigger.h:72
List * get_index_ref_constraints(Oid indexId)
Definition: pg_depend.c:972
static Datum values[MAXATTR]
Definition: bootstrap.c:167
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
#define Int32GetDatum(X)
Definition: postgres.h:479
void list_free(List *list)
Definition: list.c:1377
#define elog(elevel,...)
Definition: elog.h:214
#define NameStr(name)
Definition: c.h:615
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
HeapTuple heap_modify_tuple(HeapTuple tuple, TupleDesc tupleDesc, Datum *replValues, bool *replIsnull, bool *doReplace)
Definition: heaptuple.c:1113
PgStat_Counter blocks_fetched
Definition: pgstat.h:652
Definition: pg_list.h:50
long changeDependenciesOn(Oid refClassId, Oid oldRefObjectId, Oid newRefObjectId)
Definition: pg_depend.c:463
List * get_partition_ancestors(Oid relid)
Definition: partition.c:115
#define BTEqualStrategyNumber
Definition: stratnum.h:31
PgStat_Counter t_blocks_fetched
Definition: pgstat.h:115
#define lfirst_oid(lc)
Definition: pg_list.h:192
#define DescriptionObjIndexId
Definition: indexing.h:154

◆ index_constraint_create()

ObjectAddress index_constraint_create ( Relation  heapRelation,
Oid  indexRelationId,
Oid  parentConstraintId,
IndexInfo indexInfo,
const char *  constraintName,
char  constraintType,
bits16  constr_flags,
bool  allow_system_table_mods,
bool  is_internal 
)

Definition at line 1806 of file index.c.

References CreateTrigStmt::args, Assert, CatalogTupleUpdate(), CreateTrigStmt::columns, CreateTrigStmt::constrrel, CreateConstraintEntry(), CreateTrigger(), CreateTrigStmt::deferrable, deleteDependencyRecordsForClass(), DEPENDENCY_AUTO, DEPENDENCY_INTERNAL, DEPENDENCY_PARTITION_PRI, DEPENDENCY_PARTITION_SEC, elog, ereport, errcode(), errmsg(), ERROR, CreateTrigStmt::events, CreateTrigStmt::funcname, GETSTRUCT, heap_freetuple(), HeapTupleIsValid, IndexInfo::ii_ExclusionOps, IndexInfo::ii_Expressions, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_NumIndexKeyAttrs, INDEX_CONSTR_CREATE_DEFERRABLE, INDEX_CONSTR_CREATE_INIT_DEFERRED, INDEX_CONSTR_CREATE_MARK_AS_PRIMARY, INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS, INDEX_CONSTR_CREATE_UPDATE_INDEX, INDEXRELID, CreateTrigStmt::initdeferred, InvalidOid, InvokeObjectPostAlterHookArg, IsBootstrapProcessingMode, CreateTrigStmt::isconstraint, IsNormalProcessingMode, IsSystemRelation(), makeNode, NIL, ObjectAddressSet, ObjectIdGetDatum, OidIsValid, recordDependencyOn(), CreateTrigStmt::relation, RelationGetNamespace, RelationGetRelid, CreateTrigStmt::row, RowExclusiveLock, SearchSysCacheCopy1, SystemFuncName(), HeapTupleData::t_self, table_close(), table_open(), CreateTrigStmt::timing, CreateTrigStmt::trigname, and CreateTrigStmt::whenClause.

Referenced by ATExecAddIndexConstraint(), and index_create().

1815 {
1816  Oid namespaceId = RelationGetNamespace(heapRelation);
1817  ObjectAddress myself,
1818  idxaddr;
1819  Oid conOid;
1820  bool deferrable;
1821  bool initdeferred;
1822  bool mark_as_primary;
1823  bool islocal;
1824  bool noinherit;
1825  int inhcount;
1826 
1827  deferrable = (constr_flags & INDEX_CONSTR_CREATE_DEFERRABLE) != 0;
1828  initdeferred = (constr_flags & INDEX_CONSTR_CREATE_INIT_DEFERRED) != 0;
1829  mark_as_primary = (constr_flags & INDEX_CONSTR_CREATE_MARK_AS_PRIMARY) != 0;
1830 
1831  /* constraint creation support doesn't work while bootstrapping */
1833 
1834  /* enforce system-table restriction */
1835  if (!allow_system_table_mods &&
1836  IsSystemRelation(heapRelation) &&
1838  ereport(ERROR,
1839  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1840  errmsg("user-defined indexes on system catalog tables are not supported")));
1841 
1842  /* primary/unique constraints shouldn't have any expressions */
1843  if (indexInfo->ii_Expressions &&
1844  constraintType != CONSTRAINT_EXCLUSION)
1845  elog(ERROR, "constraints cannot have index expressions");
1846 
1847  /*
1848  * If we're manufacturing a constraint for a pre-existing index, we need
1849  * to get rid of the existing auto dependencies for the index (the ones
1850  * that index_create() would have made instead of calling this function).
1851  *
1852  * Note: this code would not necessarily do the right thing if the index
1853  * has any expressions or predicate, but we'd never be turning such an
1854  * index into a UNIQUE or PRIMARY KEY constraint.
1855  */
1856  if (constr_flags & INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS)
1857  deleteDependencyRecordsForClass(RelationRelationId, indexRelationId,
1858  RelationRelationId, DEPENDENCY_AUTO);
1859 
1860  if (OidIsValid(parentConstraintId))
1861  {
1862  islocal = false;
1863  inhcount = 1;
1864  noinherit = false;
1865  }
1866  else
1867  {
1868  islocal = true;
1869  inhcount = 0;
1870  noinherit = true;
1871  }
1872 
1873  /*
1874  * Construct a pg_constraint entry.
1875  */
1876  conOid = CreateConstraintEntry(constraintName,
1877  namespaceId,
1878  constraintType,
1879  deferrable,
1880  initdeferred,
1881  true,
1882  parentConstraintId,
1883  RelationGetRelid(heapRelation),
1884  indexInfo->ii_IndexAttrNumbers,
1885  indexInfo->ii_NumIndexKeyAttrs,
1886  indexInfo->ii_NumIndexAttrs,
1887  InvalidOid, /* no domain */
1888  indexRelationId, /* index OID */
1889  InvalidOid, /* no foreign key */
1890  NULL,
1891  NULL,
1892  NULL,
1893  NULL,
1894  0,
1895  ' ',
1896  ' ',
1897  ' ',
1898  indexInfo->ii_ExclusionOps,
1899  NULL, /* no check constraint */
1900  NULL,
1901  islocal,
1902  inhcount,
1903  noinherit,
1904  is_internal);
1905 
1906  /*
1907  * Register the index as internally dependent on the constraint.
1908  *
1909  * Note that the constraint has a dependency on the table, so we don't
1910  * need (or want) any direct dependency from the index to the table.
1911  */
1912  ObjectAddressSet(myself, ConstraintRelationId, conOid);
1913  ObjectAddressSet(idxaddr, RelationRelationId, indexRelationId);
1914  recordDependencyOn(&idxaddr, &myself, DEPENDENCY_INTERNAL);
1915 
1916  /*
1917  * Also, if this is a constraint on a partition, give it partition-type
1918  * dependencies on the parent constraint as well as the table.
1919  */
1920  if (OidIsValid(parentConstraintId))
1921  {
1922  ObjectAddress referenced;
1923 
1924  ObjectAddressSet(referenced, ConstraintRelationId, parentConstraintId);
1925  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_PRI);
1926  ObjectAddressSet(referenced, RelationRelationId,
1927  RelationGetRelid(heapRelation));
1928  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_SEC);
1929  }
1930 
1931  /*
1932  * If the constraint is deferrable, create the deferred uniqueness
1933  * checking trigger. (The trigger will be given an internal dependency on
1934  * the constraint by CreateTrigger.)
1935  */
1936  if (deferrable)
1937  {
1938  CreateTrigStmt *trigger;
1939 
1940  trigger = makeNode(CreateTrigStmt);
1941  trigger->trigname = (constraintType == CONSTRAINT_PRIMARY) ?
1942  "PK_ConstraintTrigger" :
1943  "Unique_ConstraintTrigger";
1944  trigger->relation = NULL;
1945  trigger->funcname = SystemFuncName("unique_key_recheck");
1946  trigger->args = NIL;
1947  trigger->row = true;
1948  trigger->timing = TRIGGER_TYPE_AFTER;
1949  trigger->events = TRIGGER_TYPE_INSERT | TRIGGER_TYPE_UPDATE;
1950  trigger->columns = NIL;
1951  trigger->whenClause = NULL;
1952  trigger->isconstraint = true;
1953  trigger->deferrable = true;
1954  trigger->initdeferred = initdeferred;
1955  trigger->constrrel = NULL;
1956 
1957  (void) CreateTrigger(trigger, NULL, RelationGetRelid(heapRelation),
1958  InvalidOid, conOid, indexRelationId, InvalidOid,
1959  InvalidOid, NULL, true, false);
1960  }
1961 
1962  /*
1963  * If needed, mark the index as primary and/or deferred in pg_index.
1964  *
1965  * Note: When making an existing index into a constraint, caller must have
1966  * a table lock that prevents concurrent table updates; otherwise, there
1967  * is a risk that concurrent readers of the table will miss seeing this
1968  * index at all.
1969  */
1970  if ((constr_flags & INDEX_CONSTR_CREATE_UPDATE_INDEX) &&
1971  (mark_as_primary || deferrable))
1972  {
1973  Relation pg_index;
1974  HeapTuple indexTuple;
1975  Form_pg_index indexForm;
1976  bool dirty = false;
1977 
1978  pg_index = table_open(IndexRelationId, RowExclusiveLock);
1979 
1980  indexTuple = SearchSysCacheCopy1(INDEXRELID,
1981  ObjectIdGetDatum(indexRelationId));
1982  if (!HeapTupleIsValid(indexTuple))
1983  elog(ERROR, "cache lookup failed for index %u", indexRelationId);
1984  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
1985 
1986  if (mark_as_primary && !indexForm->indisprimary)
1987  {
1988  indexForm->indisprimary = true;
1989  dirty = true;
1990  }
1991 
1992  if (deferrable && indexForm->indimmediate)
1993  {
1994  indexForm->indimmediate = false;
1995  dirty = true;
1996  }
1997 
1998  if (dirty)
1999  {
2000  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
2001 
2002  InvokeObjectPostAlterHookArg(IndexRelationId, indexRelationId, 0,
2003  InvalidOid, is_internal);
2004  }
2005 
2006  heap_freetuple(indexTuple);
2007  table_close(pg_index, RowExclusiveLock);
2008  }
2009 
2010  return myself;
2011 }
#define NIL
Definition: pg_list.h:65
List * SystemFuncName(char *name)
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
bool IsSystemRelation(Relation relation)
Definition: catalog.c:68
Node * whenClause
Definition: parsenodes.h:2438
Oid CreateConstraintEntry(const char *constraintName, Oid constraintNamespace, char constraintType, bool isDeferrable, bool isDeferred, bool isValidated, Oid parentConstrId, Oid relId, const int16 *constraintKey, int constraintNKeys, int constraintNTotalKeys, Oid domainId, Oid indexRelId, Oid foreignRelId, const int16 *foreignKey, const Oid *pfEqOp, const Oid *ppEqOp, const Oid *ffEqOp, int foreignNKeys, char foreignUpdateType, char foreignDeleteType, char foreignMatchType, const Oid *exclOp, Node *conExpr, const char *conBin, bool conIsLocal, int conInhCount, bool conNoInherit, bool is_internal)
Definition: pg_constraint.c:50
int errcode(int sqlerrcode)
Definition: elog.c:610
void recordDependencyOn(const ObjectAddress *depender, const ObjectAddress *referenced, DependencyType behavior)
Definition: pg_depend.c:43
#define INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS
Definition: index.h:79
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:644
#define InvokeObjectPostAlterHookArg(classId, objectId, subId, auxiliaryId, is_internal)
Definition: objectaccess.h:178
#define INDEX_CONSTR_CREATE_INIT_DEFERRED
Definition: index.h:77
RangeVar * constrrel
Definition: parsenodes.h:2445
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
ItemPointerData t_self
Definition: htup.h:65
#define IsNormalProcessingMode()
Definition: miscadmin.h:394
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
int ii_NumIndexAttrs
Definition: execnodes.h:158
long deleteDependencyRecordsForClass(Oid classId, Oid objectId, Oid refclassId, char deptype)
Definition: pg_depend.c:240
#define InvalidOid
Definition: postgres_ext.h:36
#define ereport(elevel,...)
Definition: elog.h:144
#define makeNode(_type_)
Definition: nodes.h:574
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * ii_Expressions
Definition: execnodes.h:161
#define Assert(condition)
Definition: c.h:738
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:224
#define INDEX_CONSTR_CREATE_UPDATE_INDEX
Definition: index.h:78
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
RangeVar * relation
Definition: parsenodes.h:2429
ObjectAddress CreateTrigger(CreateTrigStmt *stmt, const char *queryString, Oid relOid, Oid refRelOid, Oid constraintOid, Oid indexOid, Oid funcoid, Oid parentTriggerOid, Node *whenClause, bool isInternal, bool in_partition)
Definition: trigger.c:157
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define RelationGetRelid(relation)
Definition: rel.h:436
#define INDEX_CONSTR_CREATE_DEFERRABLE
Definition: index.h:76
#define INDEX_CONSTR_CREATE_MARK_AS_PRIMARY
Definition: index.h:75
#define RelationGetNamespace(relation)
Definition: rel.h:477

◆ index_create()

Oid index_create ( Relation  heapRelation,
const char *  indexRelationName,
Oid  indexRelationId,
Oid  parentIndexRelid,
Oid  parentConstraintId,
Oid  relFileNode,
IndexInfo indexInfo,
List indexColNames,
Oid  accessMethodObjectId,
Oid  tableSpaceId,
Oid collationObjectId,
Oid classObjectId,
int16 coloptions,
Datum  reloptions,
bits16  flags,
bits16  constr_flags,
bool  allow_system_table_mods,
bool  is_internal,
Oid constraintId 
)

Definition at line 694 of file index.c.

References AccessExclusiveLock, AppendAttributeTuples(), Assert, binary_upgrade_next_index_pg_class_oid, CacheInvalidateRelcache(), CLAOID, ObjectAddress::classId, CommandCounterIncrement(), CONSTRAINT_RELATION, ConstraintNameIsUsed(), ConstructTupleDescriptor(), DEPENDENCY_AUTO, DEPENDENCY_NORMAL, DEPENDENCY_PARTITION_PRI, DEPENDENCY_PARTITION_SEC, elog, ereport, errcode(), ERRCODE_DUPLICATE_OBJECT, errmsg(), ERROR, get_collation_isdeterministic(), get_relname_relid(), GetNewRelFileNode(), GETSTRUCT, heap_create(), HeapTupleIsValid, i, IndexInfo::ii_ExclusionOps, IndexInfo::ii_Expressions, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_NumIndexKeyAttrs, IndexInfo::ii_OpclassOptions, IndexInfo::ii_Predicate, IndexInfo::ii_Unique, index_build(), index_close(), INDEX_CONSTR_CREATE_DEFERRABLE, index_constraint_create(), INDEX_CREATE_ADD_CONSTRAINT, INDEX_CREATE_CONCURRENT, INDEX_CREATE_IF_NOT_EXISTS, INDEX_CREATE_INVALID, INDEX_CREATE_IS_PRIMARY, INDEX_CREATE_PARTITIONED, INDEX_CREATE_SKIP_BUILD, index_opclass_options(), index_register(), index_update_stats(), InitializeAttributeOids(), InsertPgClassTuple(), InvalidMultiXactId, InvalidOid, InvalidTransactionId, InvokeObjectPostCreateHookArg, IsBinaryUpgrade, IsBootstrapProcessingMode, IsCatalogRelation(), IsNormalProcessingMode, IsSystemRelation(), LockRelation(), NameStr, NoLock, NOTICE, ObjectAddress::objectId, ObjectIdGetDatum, ObjectAddress::objectSubId, OidIsValid, RelationData::rd_index, RelationData::rd_indexcxt, RelationData::rd_rel, recordDependencyOn(), recordDependencyOnSingleRelExpr(), RelationGetNamespace, RelationGetRelationName, RelationGetRelid, RelationInitIndexAccessInfo(), RelationIsMapped, ReleaseSysCache(), RowExclusiveLock, SearchSysCache1(), SetRelationHasSubclass(), StoreSingleInheritance(), table_close(), table_open(), and UpdateIndexRelation().

Referenced by create_toast_table(), DefineIndex(), and index_concurrently_create_copy().

713 {
714  Oid heapRelationId = RelationGetRelid(heapRelation);
715  Relation pg_class;
716  Relation indexRelation;
717  TupleDesc indexTupDesc;
718  bool shared_relation;
719  bool mapped_relation;
720  bool is_exclusion;
721  Oid namespaceId;
722  int i;
723  char relpersistence;
724  bool isprimary = (flags & INDEX_CREATE_IS_PRIMARY) != 0;
725  bool invalid = (flags & INDEX_CREATE_INVALID) != 0;
726  bool concurrent = (flags & INDEX_CREATE_CONCURRENT) != 0;
727  bool partitioned = (flags & INDEX_CREATE_PARTITIONED) != 0;
728  char relkind;
729  TransactionId relfrozenxid;
730  MultiXactId relminmxid;
731 
732  /* constraint flags can only be set when a constraint is requested */
733  Assert((constr_flags == 0) ||
734  ((flags & INDEX_CREATE_ADD_CONSTRAINT) != 0));
735  /* partitioned indexes must never be "built" by themselves */
736  Assert(!partitioned || (flags & INDEX_CREATE_SKIP_BUILD));
737 
738  relkind = partitioned ? RELKIND_PARTITIONED_INDEX : RELKIND_INDEX;
739  is_exclusion = (indexInfo->ii_ExclusionOps != NULL);
740 
741  pg_class = table_open(RelationRelationId, RowExclusiveLock);
742 
743  /*
744  * The index will be in the same namespace as its parent table, and is
745  * shared across databases if and only if the parent is. Likewise, it
746  * will use the relfilenode map if and only if the parent does; and it
747  * inherits the parent's relpersistence.
748  */
749  namespaceId = RelationGetNamespace(heapRelation);
750  shared_relation = heapRelation->rd_rel->relisshared;
751  mapped_relation = RelationIsMapped(heapRelation);
752  relpersistence = heapRelation->rd_rel->relpersistence;
753 
754  /*
755  * check parameters
756  */
757  if (indexInfo->ii_NumIndexAttrs < 1)
758  elog(ERROR, "must index at least one column");
759 
760  if (!allow_system_table_mods &&
761  IsSystemRelation(heapRelation) &&
763  ereport(ERROR,
764  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
765  errmsg("user-defined indexes on system catalog tables are not supported")));
766 
767  /*
768  * Btree text_pattern_ops uses text_eq as the equality operator, which is
769  * fine as long as the collation is deterministic; text_eq then reduces to
770  * bitwise equality and so it is semantically compatible with the other
771  * operators and functions in that opclass. But with a nondeterministic
772  * collation, text_eq could yield results that are incompatible with the
773  * actual behavior of the index (which is determined by the opclass's
774  * comparison function). We prevent such problems by refusing creation of
775  * an index with that opclass and a nondeterministic collation.
776  *
777  * The same applies to varchar_pattern_ops and bpchar_pattern_ops. If we
778  * find more cases, we might decide to create a real mechanism for marking
779  * opclasses as incompatible with nondeterminism; but for now, this small
780  * hack suffices.
781  *
782  * Another solution is to use a special operator, not text_eq, as the
783  * equality opclass member; but that is undesirable because it would
784  * prevent index usage in many queries that work fine today.
785  */
786  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
787  {
788  Oid collation = collationObjectId[i];
789  Oid opclass = classObjectId[i];
790 
791  if (collation)
792  {
793  if ((opclass == TEXT_BTREE_PATTERN_OPS_OID ||
794  opclass == VARCHAR_BTREE_PATTERN_OPS_OID ||
795  opclass == BPCHAR_BTREE_PATTERN_OPS_OID) &&
796  !get_collation_isdeterministic(collation))
797  {
798  HeapTuple classtup;
799 
800  classtup = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
801  if (!HeapTupleIsValid(classtup))
802  elog(ERROR, "cache lookup failed for operator class %u", opclass);
803  ereport(ERROR,
804  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
805  errmsg("nondeterministic collations are not supported for operator class \"%s\"",
806  NameStr(((Form_pg_opclass) GETSTRUCT(classtup))->opcname))));
807  ReleaseSysCache(classtup);
808  }
809  }
810  }
811 
812  /*
813  * Concurrent index build on a system catalog is unsafe because we tend to
814  * release locks before committing in catalogs.
815  */
816  if (concurrent &&
817  IsCatalogRelation(heapRelation))
818  ereport(ERROR,
819  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
820  errmsg("concurrent index creation on system catalog tables is not supported")));
821 
822  /*
823  * This case is currently not supported. There's no way to ask for it in
824  * the grammar with CREATE INDEX, but it can happen with REINDEX.
825  */
826  if (concurrent && is_exclusion)
827  ereport(ERROR,
828  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
829  errmsg("concurrent index creation for exclusion constraints is not supported")));
830 
831  /*
832  * We cannot allow indexing a shared relation after initdb (because
833  * there's no way to make the entry in other databases' pg_class).
834  */
835  if (shared_relation && !IsBootstrapProcessingMode())
836  ereport(ERROR,
837  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
838  errmsg("shared indexes cannot be created after initdb")));
839 
840  /*
841  * Shared relations must be in pg_global, too (last-ditch check)
842  */
843  if (shared_relation && tableSpaceId != GLOBALTABLESPACE_OID)
844  elog(ERROR, "shared relations must be placed in pg_global tablespace");
845 
846  /*
847  * Check for duplicate name (both as to the index, and as to the
848  * associated constraint if any). Such cases would fail on the relevant
849  * catalogs' unique indexes anyway, but we prefer to give a friendlier
850  * error message.
851  */
852  if (get_relname_relid(indexRelationName, namespaceId))
853  {
854  if ((flags & INDEX_CREATE_IF_NOT_EXISTS) != 0)
855  {
856  ereport(NOTICE,
857  (errcode(ERRCODE_DUPLICATE_TABLE),
858  errmsg("relation \"%s\" already exists, skipping",
859  indexRelationName)));
860  table_close(pg_class, RowExclusiveLock);
861  return InvalidOid;
862  }
863 
864  ereport(ERROR,
865  (errcode(ERRCODE_DUPLICATE_TABLE),
866  errmsg("relation \"%s\" already exists",
867  indexRelationName)));
868  }
869 
870  if ((flags & INDEX_CREATE_ADD_CONSTRAINT) != 0 &&
872  indexRelationName))
873  {
874  /*
875  * INDEX_CREATE_IF_NOT_EXISTS does not apply here, since the
876  * conflicting constraint is not an index.
877  */
878  ereport(ERROR,
880  errmsg("constraint \"%s\" for relation \"%s\" already exists",
881  indexRelationName, RelationGetRelationName(heapRelation))));
882  }
883 
884  /*
885  * construct tuple descriptor for index tuples
886  */
887  indexTupDesc = ConstructTupleDescriptor(heapRelation,
888  indexInfo,
889  indexColNames,
890  accessMethodObjectId,
891  collationObjectId,
892  classObjectId);
893 
894  /*
895  * Allocate an OID for the index, unless we were told what to use.
896  *
897  * The OID will be the relfilenode as well, so make sure it doesn't
898  * collide with either pg_class OIDs or existing physical files.
899  */
900  if (!OidIsValid(indexRelationId))
901  {
902  /* Use binary-upgrade override for pg_class.oid/relfilenode? */
903  if (IsBinaryUpgrade)
904  {
906  ereport(ERROR,
907  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
908  errmsg("pg_class index OID value not set when in binary upgrade mode")));
909 
910  indexRelationId = binary_upgrade_next_index_pg_class_oid;
912  }
913  else
914  {
915  indexRelationId =
916  GetNewRelFileNode(tableSpaceId, pg_class, relpersistence);
917  }
918  }
919 
920  /*
921  * create the index relation's relcache entry and, if necessary, the
922  * physical disk file. (If we fail further down, it's the smgr's
923  * responsibility to remove the disk file again, if any.)
924  */
925  indexRelation = heap_create(indexRelationName,
926  namespaceId,
927  tableSpaceId,
928  indexRelationId,
929  relFileNode,
930  accessMethodObjectId,
931  indexTupDesc,
932  relkind,
933  relpersistence,
934  shared_relation,
935  mapped_relation,
936  allow_system_table_mods,
937  &relfrozenxid,
938  &relminmxid);
939 
940  Assert(relfrozenxid == InvalidTransactionId);
941  Assert(relminmxid == InvalidMultiXactId);
942  Assert(indexRelationId == RelationGetRelid(indexRelation));
943 
944  /*
945  * Obtain exclusive lock on it. Although no other transactions can see it
946  * until we commit, this prevents deadlock-risk complaints from lock
947  * manager in cases such as CLUSTER.
948  */
949  LockRelation(indexRelation, AccessExclusiveLock);
950 
951  /*
952  * Fill in fields of the index's pg_class entry that are not set correctly
953  * by heap_create.
954  *
955  * XXX should have a cleaner way to create cataloged indexes
956  */
957  indexRelation->rd_rel->relowner = heapRelation->rd_rel->relowner;
958  indexRelation->rd_rel->relam = accessMethodObjectId;
959  indexRelation->rd_rel->relispartition = OidIsValid(parentIndexRelid);
960 
961  /*
962  * store index's pg_class entry
963  */
964  InsertPgClassTuple(pg_class, indexRelation,
965  RelationGetRelid(indexRelation),
966  (Datum) 0,
967  reloptions);
968 
969  /* done with pg_class */
970  table_close(pg_class, RowExclusiveLock);
971 
972  /*
973  * now update the object id's of all the attribute tuple forms in the
974  * index relation's tuple descriptor
975  */
976  InitializeAttributeOids(indexRelation,
977  indexInfo->ii_NumIndexAttrs,
978  indexRelationId);
979 
980  /*
981  * append ATTRIBUTE tuples for the index
982  */
983  AppendAttributeTuples(indexRelation, indexInfo->ii_NumIndexAttrs,
984  indexInfo->ii_OpclassOptions);
985 
986  /* ----------------
987  * update pg_index
988  * (append INDEX tuple)
989  *
990  * Note that this stows away a representation of "predicate".
991  * (Or, could define a rule to maintain the predicate) --Nels, Feb '92
992  * ----------------
993  */
994  UpdateIndexRelation(indexRelationId, heapRelationId, parentIndexRelid,
995  indexInfo,
996  collationObjectId, classObjectId, coloptions,
997  isprimary, is_exclusion,
998  (constr_flags & INDEX_CONSTR_CREATE_DEFERRABLE) == 0,
999  !concurrent && !invalid,
1000  !concurrent);
1001 
1002  /*
1003  * Register relcache invalidation on the indexes' heap relation, to
1004  * maintain consistency of its index list
1005  */
1006  CacheInvalidateRelcache(heapRelation);
1007 
1008  /* update pg_inherits and the parent's relhassubclass, if needed */
1009  if (OidIsValid(parentIndexRelid))
1010  {
1011  StoreSingleInheritance(indexRelationId, parentIndexRelid, 1);
1012  SetRelationHasSubclass(parentIndexRelid, true);
1013  }
1014 
1015  /*
1016  * Register constraint and dependencies for the index.
1017  *
1018  * If the index is from a CONSTRAINT clause, construct a pg_constraint
1019  * entry. The index will be linked to the constraint, which in turn is
1020  * linked to the table. If it's not a CONSTRAINT, we need to make a
1021  * dependency directly on the table.
1022  *
1023  * We don't need a dependency on the namespace, because there'll be an
1024  * indirect dependency via our parent table.
1025  *
1026  * During bootstrap we can't register any dependencies, and we don't try
1027  * to make a constraint either.
1028  */
1030  {
1031  ObjectAddress myself,
1032  referenced;
1033 
1034  myself.classId = RelationRelationId;
1035  myself.objectId = indexRelationId;
1036  myself.objectSubId = 0;
1037 
1038  if ((flags & INDEX_CREATE_ADD_CONSTRAINT) != 0)
1039  {
1040  char constraintType;
1041  ObjectAddress localaddr;
1042 
1043  if (isprimary)
1044  constraintType = CONSTRAINT_PRIMARY;
1045  else if (indexInfo->ii_Unique)
1046  constraintType = CONSTRAINT_UNIQUE;
1047  else if (is_exclusion)
1048  constraintType = CONSTRAINT_EXCLUSION;
1049  else
1050  {
1051  elog(ERROR, "constraint must be PRIMARY, UNIQUE or EXCLUDE");
1052  constraintType = 0; /* keep compiler quiet */
1053  }
1054 
1055  localaddr = index_constraint_create(heapRelation,
1056  indexRelationId,
1057  parentConstraintId,
1058  indexInfo,
1059  indexRelationName,
1060  constraintType,
1061  constr_flags,
1062  allow_system_table_mods,
1063  is_internal);
1064  if (constraintId)
1065  *constraintId = localaddr.objectId;
1066  }
1067  else
1068  {
1069  bool have_simple_col = false;
1070 
1071  /* Create auto dependencies on simply-referenced columns */
1072  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
1073  {
1074  if (indexInfo->ii_IndexAttrNumbers[i] != 0)
1075  {
1076  referenced.classId = RelationRelationId;
1077  referenced.objectId = heapRelationId;
1078  referenced.objectSubId = indexInfo->ii_IndexAttrNumbers[i];
1079 
1080  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
1081 
1082  have_simple_col = true;
1083  }
1084  }
1085 
1086  /*
1087  * If there are no simply-referenced columns, give the index an
1088  * auto dependency on the whole table. In most cases, this will
1089  * be redundant, but it might not be if the index expressions and
1090  * predicate contain no Vars or only whole-row Vars.
1091  */
1092  if (!have_simple_col)
1093  {
1094  referenced.classId = RelationRelationId;
1095  referenced.objectId = heapRelationId;
1096  referenced.objectSubId = 0;
1097 
1098  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
1099  }
1100  }
1101 
1102  /*
1103  * If this is an index partition, create partition dependencies on
1104  * both the parent index and the table. (Note: these must be *in
1105  * addition to*, not instead of, all other dependencies. Otherwise
1106  * we'll be short some dependencies after DETACH PARTITION.)
1107  */
1108  if (OidIsValid(parentIndexRelid))
1109  {
1110  referenced.classId = RelationRelationId;
1111  referenced.objectId = parentIndexRelid;
1112  referenced.objectSubId = 0;
1113 
1114  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_PRI);
1115 
1116  referenced.classId = RelationRelationId;
1117  referenced.objectId = heapRelationId;
1118  referenced.objectSubId = 0;
1119 
1120  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_SEC);
1121  }
1122 
1123  /* Store dependency on collations */
1124  /* The default collation is pinned, so don't bother recording it */
1125  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
1126  {
1127  if (OidIsValid(collationObjectId[i]) &&
1128  collationObjectId[i] != DEFAULT_COLLATION_OID)
1129  {
1130  referenced.classId = CollationRelationId;
1131  referenced.objectId = collationObjectId[i];
1132  referenced.objectSubId = 0;
1133 
1134  recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
1135  }
1136  }
1137 
1138  /* Store dependency on operator classes */
1139  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
1140  {
1141  referenced.classId = OperatorClassRelationId;
1142  referenced.objectId = classObjectId[i];
1143  referenced.objectSubId = 0;
1144 
1145  recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
1146  }
1147 
1148  /* Store dependencies on anything mentioned in index expressions */
1149  if (indexInfo->ii_Expressions)
1150  {
1152  (Node *) indexInfo->ii_Expressions,
1153  heapRelationId,
1155  DEPENDENCY_AUTO, false);
1156  }
1157 
1158  /* Store dependencies on anything mentioned in predicate */
1159  if (indexInfo->ii_Predicate)
1160  {
1162  (Node *) indexInfo->ii_Predicate,
1163  heapRelationId,
1165  DEPENDENCY_AUTO, false);
1166  }
1167  }
1168  else
1169  {
1170  /* Bootstrap mode - assert we weren't asked for constraint support */
1171  Assert((flags & INDEX_CREATE_ADD_CONSTRAINT) == 0);
1172  }
1173 
1174  /* Post creation hook for new index */
1175  InvokeObjectPostCreateHookArg(RelationRelationId,
1176  indexRelationId, 0, is_internal);
1177 
1178  /*
1179  * Advance the command counter so that we can see the newly-entered
1180  * catalog tuples for the index.
1181  */
1183 
1184  /*
1185  * In bootstrap mode, we have to fill in the index strategy structure with
1186  * information from the catalogs. If we aren't bootstrapping, then the
1187  * relcache entry has already been rebuilt thanks to sinval update during
1188  * CommandCounterIncrement.
1189  */
1191  RelationInitIndexAccessInfo(indexRelation);
1192  else
1193  Assert(indexRelation->rd_indexcxt != NULL);
1194 
1195  indexRelation->rd_index->indnkeyatts = indexInfo->ii_NumIndexKeyAttrs;
1196 
1197  /* Validate opclass-specific options */
1198  if (indexInfo->ii_OpclassOptions)
1199  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
1200  (void) index_opclass_options(indexRelation, i + 1,
1201  indexInfo->ii_OpclassOptions[i],
1202  true);
1203 
1204  /*
1205  * If this is bootstrap (initdb) time, then we don't actually fill in the
1206  * index yet. We'll be creating more indexes and classes later, so we
1207  * delay filling them in until just before we're done with bootstrapping.
1208  * Similarly, if the caller specified to skip the build then filling the
1209  * index is delayed till later (ALTER TABLE can save work in some cases
1210  * with this). Otherwise, we call the AM routine that constructs the
1211  * index.
1212  */
1214  {
1215  index_register(heapRelationId, indexRelationId, indexInfo);
1216  }
1217  else if ((flags & INDEX_CREATE_SKIP_BUILD) != 0)
1218  {
1219  /*
1220  * Caller is responsible for filling the index later on. However,
1221  * we'd better make sure that the heap relation is correctly marked as
1222  * having an index.
1223  */
1224  index_update_stats(heapRelation,
1225  true,
1226  -1.0);
1227  /* Make the above update visible */
1229  }
1230  else
1231  {
1232  index_build(heapRelation, indexRelation, indexInfo, false, true);
1233  }
1234 
1235  /*
1236  * Close the index; but we keep the lock that we acquired above until end
1237  * of transaction. Closing the heap is caller's responsibility.
1238  */
1239  index_close(indexRelation, NoLock);
1240 
1241  return indexRelationId;
1242 }
bool IsCatalogRelation(Relation relation)
Definition: catalog.c:98
static void index_update_stats(Relation rel, bool hasindex, double reltuples)
Definition: index.c:2675
bool ConstraintNameIsUsed(ConstraintCategory conCat, Oid objId, const char *conname)
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
static void UpdateIndexRelation(Oid indexoid, Oid heapoid, Oid parentIndexId, IndexInfo *indexInfo, Oid *collationOids, Oid *classOids, int16 *coloptions, bool primary, bool isexclusion, bool immediate, bool isvalid, bool isready)
Definition: index.c:530
List * ii_Predicate
Definition: execnodes.h:163
bool IsSystemRelation(Relation relation)
Definition: catalog.c:68
uint32 TransactionId
Definition: c.h:513
#define INDEX_CREATE_IF_NOT_EXISTS
Definition: index.h:51
#define INDEX_CREATE_INVALID
Definition: index.h:53
static void InitializeAttributeOids(Relation indexRelation, int numatts, Oid indexoid)
Definition: index.c:471
Oid binary_upgrade_next_index_pg_class_oid
Definition: index.c:85
Definition: nodes.h:526
bool get_collation_isdeterministic(Oid colloid)
Definition: lsyscache.c:1003
int errcode(int sqlerrcode)
Definition: elog.c:610
void recordDependencyOn(const ObjectAddress *depender, const ObjectAddress *referenced, DependencyType behavior)
Definition: pg_depend.c:43
Form_pg_class rd_rel
Definition: rel.h:89
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:644
bool IsBinaryUpgrade
Definition: globals.c:110
void SetRelationHasSubclass(Oid relationId, bool relhassubclass)
Definition: tablecmds.c:2895
void InsertPgClassTuple(Relation pg_class_desc, Relation new_rel_desc, Oid new_rel_oid, Datum relacl, Datum reloptions)
Definition: heap.c:882
Form_pg_index rd_index
Definition: rel.h:154
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
Oid get_relname_relid(const char *relname, Oid relnamespace)
Definition: lsyscache.c:1748
#define NoLock
Definition: lockdefs.h:34
#define IsNormalProcessingMode()
Definition: miscadmin.h:394
#define RowExclusiveLock
Definition: lockdefs.h:38
#define InvalidTransactionId
Definition: transam.h:31
#define RelationGetRelationName(relation)
Definition: rel.h:470
static TupleDesc ConstructTupleDescriptor(Relation heapRelation, IndexInfo *indexInfo, List *indexColNames, Oid accessMethodObjectId, Oid *collationObjectId, Oid *classObjectId)
Definition: index.c:268
void StoreSingleInheritance(Oid relationId, Oid parentOid, int32 seqNumber)
Definition: pg_inherits.c:417
void index_register(Oid heap, Oid ind, IndexInfo *indexInfo)
Definition: bootstrap.c:1069
bytea * index_opclass_options(Relation indrel, AttrNumber attnum, Datum attoptions, bool validate)
Definition: indexam.c:936
#define RelationIsMapped(relation)
Definition: rel.h:485
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
uintptr_t Datum
Definition: postgres.h:367
void CommandCounterIncrement(void)
Definition: xact.c:1005
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
int ii_NumIndexAttrs
Definition: execnodes.h:158
#define InvalidMultiXactId
Definition: multixact.h:23
#define InvokeObjectPostCreateHookArg(classId, objectId, subId, is_internal)
Definition: objectaccess.h:153
#define INDEX_CREATE_IS_PRIMARY
Definition: index.h:47
#define InvalidOid
Definition: postgres_ext.h:36
#define INDEX_CREATE_CONCURRENT
Definition: index.h:50
#define ereport(elevel,...)
Definition: elog.h:144
#define NOTICE
Definition: elog.h:37
TransactionId MultiXactId
Definition: c.h:523
bool ii_Unique
Definition: execnodes.h:172
void index_build(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
Definition: index.c:2823
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * ii_Expressions
Definition: execnodes.h:161
#define Assert(condition)
Definition: c.h:738
void recordDependencyOnSingleRelExpr(const ObjectAddress *depender, Node *expr, Oid relId, DependencyType behavior, DependencyType self_behavior, bool reverse_self)
Definition: dependency.c:1630
Relation heap_create(const char *relname, Oid relnamespace, Oid reltablespace, Oid relid, Oid relfilenode, Oid accessmtd, TupleDesc tupDesc, char relkind, char relpersistence, bool shared_relation, bool mapped_relation, bool allow_system_table_mods, TransactionId *relfrozenxid, MultiXactId *relminmxid)
Definition: heap.c:294
Oid GetNewRelFileNode(Oid reltablespace, Relation pg_class, char relpersistence)
Definition: catalog.c:380
static void AppendAttributeTuples(Relation indexRelation, int numatts, Datum *attopts)
Definition: index.c:489
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1270
void RelationInitIndexAccessInfo(Relation relation)
Definition: relcache.c:1350
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
#define INDEX_CREATE_SKIP_BUILD
Definition: index.h:49
#define AccessExclusiveLock
Definition: lockdefs.h:45
#define INDEX_CREATE_PARTITIONED
Definition: index.h:52
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
MemoryContext rd_indexcxt
Definition: rel.h:166
int i
void LockRelation(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:216
#define NameStr(name)
Definition: c.h:615
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
#define INDEX_CREATE_ADD_CONSTRAINT
Definition: index.h:48
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
#define ERRCODE_DUPLICATE_OBJECT
Definition: streamutil.c:31
#define RelationGetRelid(relation)
Definition: rel.h:436
#define INDEX_CONSTR_CREATE_DEFERRABLE
Definition: index.h:76
Datum * ii_OpclassOptions
Definition: execnodes.h:171
ObjectAddress index_constraint_create(Relation heapRelation, Oid indexRelationId, Oid parentConstraintId, IndexInfo *indexInfo, const char *constraintName, char constraintType, bits16 constr_flags, bool allow_system_table_mods, bool is_internal)
Definition: index.c:1806
#define RelationGetNamespace(relation)
Definition: rel.h:477

◆ index_drop()

void index_drop ( Oid  indexId,
bool  concurrent,
bool  concurrent_lock_mode 
)

Definition at line 2025 of file index.c.

References AccessExclusiveLock, Assert, CacheInvalidateRelcache(), CatalogTupleDelete(), CheckTableNotInUse(), CommitTransactionCommand(), LockRelId::dbId, DeleteAttributeTuples(), DeleteInheritsTuple(), DeleteRelationTuple(), elog, ereport, errcode(), errmsg(), ERROR, get_rel_persistence(), GetTopTransactionIdIfAny(), heap_attisnull(), HeapTupleIsValid, index_close(), index_concurrently_set_dead(), INDEX_DROP_CLEAR_VALID, index_open(), index_set_state_flags(), IndexGetRelation(), INDEXRELID, InvalidOid, InvalidTransactionId, LockRelationIdForSession(), LockInfoData::lockRelId, NoLock, ObjectIdGetDatum, PopActiveSnapshot(), RelationData::rd_lockInfo, RelationData::rd_rel, RelationDropStorage(), RelationForgetRelation(), RelationGetDescr, ReleaseSysCache(), LockRelId::relId, RemoveStatistics(), RowExclusiveLock, SearchSysCache1(), SET_LOCKTAG_RELATION, ShareUpdateExclusiveLock, StartTransactionCommand(), HeapTupleData::t_self, table_close(), table_open(), TransferPredicateLocksToHeapRelation(), UnlockRelationIdForSession(), and WaitForLockers().

Referenced by doDeletion().

2026 {
2027  Oid heapId;
2028  Relation userHeapRelation;
2029  Relation userIndexRelation;
2030  Relation indexRelation;
2031  HeapTuple tuple;
2032  bool hasexprs;
2033  LockRelId heaprelid,
2034  indexrelid;
2035  LOCKTAG heaplocktag;
2036  LOCKMODE lockmode;
2037 
2038  /*
2039  * A temporary relation uses a non-concurrent DROP. Other backends can't
2040  * access a temporary relation, so there's no harm in grabbing a stronger
2041  * lock (see comments in RemoveRelations), and a non-concurrent DROP is
2042  * more efficient.
2043  */
2044  Assert(get_rel_persistence(indexId) != RELPERSISTENCE_TEMP ||
2045  (!concurrent && !concurrent_lock_mode));
2046 
2047  /*
2048  * To drop an index safely, we must grab exclusive lock on its parent
2049  * table. Exclusive lock on the index alone is insufficient because
2050  * another backend might be about to execute a query on the parent table.
2051  * If it relies on a previously cached list of index OIDs, then it could
2052  * attempt to access the just-dropped index. We must therefore take a
2053  * table lock strong enough to prevent all queries on the table from
2054  * proceeding until we commit and send out a shared-cache-inval notice
2055  * that will make them update their index lists.
2056  *
2057  * In the concurrent case we avoid this requirement by disabling index use
2058  * in multiple steps and waiting out any transactions that might be using
2059  * the index, so we don't need exclusive lock on the parent table. Instead
2060  * we take ShareUpdateExclusiveLock, to ensure that two sessions aren't
2061  * doing CREATE/DROP INDEX CONCURRENTLY on the same index. (We will get
2062  * AccessExclusiveLock on the index below, once we're sure nobody else is
2063  * using it.)
2064  */
2065  heapId = IndexGetRelation(indexId, false);
2066  lockmode = (concurrent || concurrent_lock_mode) ? ShareUpdateExclusiveLock : AccessExclusiveLock;
2067  userHeapRelation = table_open(heapId, lockmode);
2068  userIndexRelation = index_open(indexId, lockmode);
2069 
2070  /*
2071  * We might still have open queries using it in our own session, which the
2072  * above locking won't prevent, so test explicitly.
2073  */
2074  CheckTableNotInUse(userIndexRelation, "DROP INDEX");
2075 
2076  /*
2077  * Drop Index Concurrently is more or less the reverse process of Create
2078  * Index Concurrently.
2079  *
2080  * First we unset indisvalid so queries starting afterwards don't use the
2081  * index to answer queries anymore. We have to keep indisready = true so
2082  * transactions that are still scanning the index can continue to see
2083  * valid index contents. For instance, if they are using READ COMMITTED
2084  * mode, and another transaction makes changes and commits, they need to
2085  * see those new tuples in the index.
2086  *
2087  * After all transactions that could possibly have used the index for
2088  * queries end, we can unset indisready and indislive, then wait till
2089  * nobody could be touching it anymore. (Note: we need indislive because
2090  * this state must be distinct from the initial state during CREATE INDEX
2091  * CONCURRENTLY, which has indislive true while indisready and indisvalid
2092  * are false. That's because in that state, transactions must examine the
2093  * index for HOT-safety decisions, while in this state we don't want them
2094  * to open it at all.)
2095  *
2096  * Since all predicate locks on the index are about to be made invalid, we
2097  * must promote them to predicate locks on the heap. In the
2098  * non-concurrent case we can just do that now. In the concurrent case
2099  * it's a bit trickier. The predicate locks must be moved when there are
2100  * no index scans in progress on the index and no more can subsequently
2101  * start, so that no new predicate locks can be made on the index. Also,
2102  * they must be moved before heap inserts stop maintaining the index, else
2103  * the conflict with the predicate lock on the index gap could be missed
2104  * before the lock on the heap relation is in place to detect a conflict
2105  * based on the heap tuple insert.
2106  */
2107  if (concurrent)
2108  {
2109  /*
2110  * We must commit our transaction in order to make the first pg_index
2111  * state update visible to other sessions. If the DROP machinery has
2112  * already performed any other actions (removal of other objects,
2113  * pg_depend entries, etc), the commit would make those actions
2114  * permanent, which would leave us with inconsistent catalog state if
2115  * we fail partway through the following sequence. Since DROP INDEX
2116  * CONCURRENTLY is restricted to dropping just one index that has no
2117  * dependencies, we should get here before anything's been done ---
2118  * but let's check that to be sure. We can verify that the current
2119  * transaction has not executed any transactional updates by checking
2120  * that no XID has been assigned.
2121  */
2123  ereport(ERROR,
2124  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2125  errmsg("DROP INDEX CONCURRENTLY must be first action in transaction")));
2126 
2127  /*
2128  * Mark index invalid by updating its pg_index entry
2129  */
2131 
2132  /*
2133  * Invalidate the relcache for the table, so that after this commit
2134  * all sessions will refresh any cached plans that might reference the
2135  * index.
2136  */
2137  CacheInvalidateRelcache(userHeapRelation);
2138 
2139  /* save lockrelid and locktag for below, then close but keep locks */
2140  heaprelid = userHeapRelation->rd_lockInfo.lockRelId;
2141  SET_LOCKTAG_RELATION(heaplocktag, heaprelid.dbId, heaprelid.relId);
2142  indexrelid = userIndexRelation->rd_lockInfo.lockRelId;
2143 
2144  table_close(userHeapRelation, NoLock);
2145  index_close(userIndexRelation, NoLock);
2146 
2147  /*
2148  * We must commit our current transaction so that the indisvalid
2149  * update becomes visible to other transactions; then start another.
2150  * Note that any previously-built data structures are lost in the
2151  * commit. The only data we keep past here are the relation IDs.
2152  *
2153  * Before committing, get a session-level lock on the table, to ensure
2154  * that neither it nor the index can be dropped before we finish. This
2155  * cannot block, even if someone else is waiting for access, because
2156  * we already have the same lock within our transaction.
2157  */
2160 
2164 
2165  /*
2166  * Now we must wait until no running transaction could be using the
2167  * index for a query. Use AccessExclusiveLock here to check for
2168  * running transactions that hold locks of any kind on the table. Note
2169  * we do not need to worry about xacts that open the table for reading
2170  * after this point; they will see the index as invalid when they open
2171  * the relation.
2172  *
2173  * Note: the reason we use actual lock acquisition here, rather than
2174  * just checking the ProcArray and sleeping, is that deadlock is
2175  * possible if one of the transactions in question is blocked trying
2176  * to acquire an exclusive lock on our table. The lock code will
2177  * detect deadlock and error out properly.
2178  *
2179  * Note: we report progress through WaitForLockers() unconditionally
2180  * here, even though it will only be used when we're called by REINDEX
2181  * CONCURRENTLY and not when called by DROP INDEX CONCURRENTLY.
2182  */
2183  WaitForLockers(heaplocktag, AccessExclusiveLock, true);
2184 
2185  /* Finish invalidation of index and mark it as dead */
2186  index_concurrently_set_dead(heapId, indexId);
2187 
2188  /*
2189  * Again, commit the transaction to make the pg_index update visible
2190  * to other sessions.
2191  */
2194 
2195  /*
2196  * Wait till every transaction that saw the old index state has
2197  * finished. See above about progress reporting.
2198  */
2199  WaitForLockers(heaplocktag, AccessExclusiveLock, true);
2200 
2201  /*
2202  * Re-open relations to allow us to complete our actions.
2203  *
2204  * At this point, nothing should be accessing the index, but lets
2205  * leave nothing to chance and grab AccessExclusiveLock on the index
2206  * before the physical deletion.
2207  */
2208  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
2209  userIndexRelation = index_open(indexId, AccessExclusiveLock);
2210  }
2211  else
2212  {
2213  /* Not concurrent, so just transfer predicate locks and we're good */
2214  TransferPredicateLocksToHeapRelation(userIndexRelation);
2215  }
2216 
2217  /*
2218  * Schedule physical removal of the files (if any)
2219  */
2220  if (userIndexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
2221  RelationDropStorage(userIndexRelation);
2222 
2223  /*
2224  * Close and flush the index's relcache entry, to ensure relcache doesn't
2225  * try to rebuild it while we're deleting catalog entries. We keep the
2226  * lock though.
2227  */
2228  index_close(userIndexRelation, NoLock);
2229 
2230  RelationForgetRelation(indexId);
2231 
2232  /*
2233  * fix INDEX relation, and check for expressional index
2234  */
2235  indexRelation = table_open(IndexRelationId, RowExclusiveLock);
2236 
2237  tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
2238  if (!HeapTupleIsValid(tuple))
2239  elog(ERROR, "cache lookup failed for index %u", indexId);
2240 
2241  hasexprs = !heap_attisnull(tuple, Anum_pg_index_indexprs,
2242  RelationGetDescr(indexRelation));
2243 
2244  CatalogTupleDelete(indexRelation, &tuple->t_self);
2245 
2246  ReleaseSysCache(tuple);
2247  table_close(indexRelation, RowExclusiveLock);
2248 
2249  /*
2250  * if it has any expression columns, we might have stored statistics about
2251  * them.
2252  */
2253  if (hasexprs)
2254  RemoveStatistics(indexId, 0);
2255 
2256  /*
2257  * fix ATTRIBUTE relation
2258  */
2259  DeleteAttributeTuples(indexId);
2260 
2261  /*
2262  * fix RELATION relation
2263  */
2264  DeleteRelationTuple(indexId);
2265 
2266  /*
2267  * fix INHERITS relation
2268  */
2269  DeleteInheritsTuple(indexId, InvalidOid);
2270 
2271  /*
2272  * We are presently too lazy to attempt to compute the new correct value
2273  * of relhasindex (the next VACUUM will fix it if necessary). So there is
2274  * no need to update the pg_class tuple for the owning relation. But we
2275  * must send out a shared-cache-inval notice on the owning relation to
2276  * ensure other backends update their relcache lists of indexes. (In the
2277  * concurrent case, this is redundant but harmless.)
2278  */
2279  CacheInvalidateRelcache(userHeapRelation);
2280 
2281  /*
2282  * Close owning rel, but keep lock
2283  */
2284  table_close(userHeapRelation, NoLock);
2285 
2286  /*
2287  * Release the session locks before we go.
2288  */
2289  if (concurrent)
2290  {
2293  }
2294 }
void WaitForLockers(LOCKTAG heaplocktag, LOCKMODE lockmode, bool progress)
Definition: lmgr.c:942
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3409
LockRelId lockRelId
Definition: rel.h:44
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define RelationGetDescr(relation)
Definition: rel.h:462
int LOCKMODE
Definition: lockdefs.h:26
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3330
void CommitTransactionCommand(void)
Definition: xact.c:2898
Oid dbId
Definition: rel.h:39
Definition: lock.h:163
bool DeleteInheritsTuple(Oid inhrelid, Oid inhparent)
Definition: pg_inherits.c:454
int errcode(int sqlerrcode)
Definition: elog.c:610
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Definition: heaptuple.c:359
void RelationForgetRelation(Oid rid)
Definition: relcache.c:2710
void PopActiveSnapshot(void)
Definition: snapmgr.c:814
void CatalogTupleDelete(Relation heapRel, ItemPointer tid)
Definition: indexing.c:269
Form_pg_class rd_rel
Definition: rel.h:89
unsigned int Oid
Definition: postgres_ext.h:31
void UnlockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:382
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
Definition: rel.h:36
void LockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:369
ItemPointerData t_self
Definition: htup.h:65
#define SET_LOCKTAG_RELATION(locktag, dboid, reloid)
Definition: lock.h:180
#define NoLock
Definition: lockdefs.h:34
LockInfoData rd_lockInfo
Definition: rel.h:92
#define RowExclusiveLock
Definition: lockdefs.h:38
#define InvalidTransactionId
Definition: transam.h:31
TransactionId GetTopTransactionIdIfAny(void)
Definition: xact.c:409
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:3479
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3077
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void RelationDropStorage(Relation rel)
Definition: storage.c:147
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
#define InvalidOid
Definition: postgres_ext.h:36
#define ereport(elevel,...)
Definition: elog.h:144
void DeleteRelationTuple(Oid relid)
Definition: heap.c:1506
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
void StartTransactionCommand(void)
Definition: xact.c:2797
void DeleteAttributeTuples(Oid relid)
Definition: heap.c:1535
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1270
void RemoveStatistics(Oid relid, AttrNumber attnum)
Definition: heap.c:3123
char get_rel_persistence(Oid relid)
Definition: lsyscache.c:1941
#define AccessExclusiveLock
Definition: lockdefs.h:45
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
void index_concurrently_set_dead(Oid heapId, Oid indexId)
Definition: index.c:1745
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132
Oid relId
Definition: rel.h:38

◆ index_set_state_flags()

void index_set_state_flags ( Oid  indexId,
IndexStateFlagsAction  action 
)

Definition at line 3330 of file index.c.

References Assert, elog, ERROR, GETSTRUCT, GetTopTransactionIdIfAny(), heap_inplace_update(), HeapTupleIsValid, INDEX_CREATE_SET_READY, INDEX_CREATE_SET_VALID, INDEX_DROP_CLEAR_VALID, INDEX_DROP_SET_DEAD, INDEXRELID, InvalidTransactionId, ObjectIdGetDatum, RowExclusiveLock, SearchSysCacheCopy1, table_close(), and table_open().

Referenced by DefineIndex(), index_concurrently_build(), index_concurrently_set_dead(), and index_drop().

3331 {
3332  Relation pg_index;
3333  HeapTuple indexTuple;
3334  Form_pg_index indexForm;
3335 
3336  /* Assert that current xact hasn't done any transactional updates */
3338 
3339  /* Open pg_index and fetch a writable copy of the index's tuple */
3340  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3341 
3342  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3343  ObjectIdGetDatum(indexId));
3344  if (!HeapTupleIsValid(indexTuple))
3345  elog(ERROR, "cache lookup failed for index %u", indexId);
3346  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3347 
3348  /* Perform the requested state change on the copy */
3349  switch (action)
3350  {
3352  /* Set indisready during a CREATE INDEX CONCURRENTLY sequence */
3353  Assert(indexForm->indislive);
3354  Assert(!indexForm->indisready);
3355  Assert(!indexForm->indisvalid);
3356  indexForm->indisready = true;
3357  break;
3359  /* Set indisvalid during a CREATE INDEX CONCURRENTLY sequence */
3360  Assert(indexForm->indislive);
3361  Assert(indexForm->indisready);
3362  Assert(!indexForm->indisvalid);
3363  indexForm->indisvalid = true;
3364  break;
3366 
3367  /*
3368  * Clear indisvalid during a DROP INDEX CONCURRENTLY sequence
3369  *
3370  * If indisready == true we leave it set so the index still gets
3371  * maintained by active transactions. We only need to ensure that
3372  * indisvalid is false. (We don't assert that either is initially
3373  * true, though, since we want to be able to retry a DROP INDEX
3374  * CONCURRENTLY that failed partway through.)
3375  *
3376  * Note: the CLUSTER logic assumes that indisclustered cannot be
3377  * set on any invalid index, so clear that flag too.
3378  */
3379  indexForm->indisvalid = false;
3380  indexForm->indisclustered = false;
3381  break;
3382  case INDEX_DROP_SET_DEAD:
3383 
3384  /*
3385  * Clear indisready/indislive during DROP INDEX CONCURRENTLY
3386  *
3387  * We clear both indisready and indislive, because we not only
3388  * want to stop updates, we want to prevent sessions from touching
3389  * the index at all.
3390  */
3391  Assert(!indexForm->indisvalid);
3392  indexForm->indisready = false;
3393  indexForm->indislive = false;
3394  break;
3395  }
3396 
3397  /* ... and write it back in-place */
3398  heap_inplace_update(pg_index, indexTuple);
3399 
3400  table_close(pg_index, RowExclusiveLock);
3401 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
#define RowExclusiveLock
Definition: lockdefs.h:38
#define InvalidTransactionId
Definition: transam.h:31
TransactionId GetTopTransactionIdIfAny(void)
Definition: xact.c:409
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:5717
#define elog(elevel,...)
Definition: elog.h:214
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ index_update_stats()

static void index_update_stats ( Relation  rel,
bool  hasindex,
double  reltuples 
)
static

Definition at line 2675 of file index.c.

References Assert, BTEqualStrategyNumber, CacheInvalidateRelcacheByTuple(), elog, ERROR, ForwardScanDirection, GETSTRUCT, heap_copytuple(), heap_freetuple(), heap_getnext(), heap_inplace_update(), HeapTupleIsValid, IsBootstrapProcessingMode, sort-test::key, ObjectIdGetDatum, ReindexIsProcessingHeap(), RelationGetNumberOfBlocks, RelationGetRelid, RELOID, RowExclusiveLock, ScanKeyInit(), SearchSysCacheCopy1, table_beginscan_catalog(), table_close(), table_endscan(), table_open(), and visibilitymap_count().

Referenced by index_build(), and index_create().

2678 {
2679  Oid relid = RelationGetRelid(rel);
2680  Relation pg_class;
2681  HeapTuple tuple;
2682  Form_pg_class rd_rel;
2683  bool dirty;
2684 
2685  /*
2686  * We always update the pg_class row using a non-transactional,
2687  * overwrite-in-place update. There are several reasons for this:
2688  *
2689  * 1. In bootstrap mode, we have no choice --- UPDATE wouldn't work.
2690  *
2691  * 2. We could be reindexing pg_class itself, in which case we can't move
2692  * its pg_class row because CatalogTupleInsert/CatalogTupleUpdate might
2693  * not know about all the indexes yet (see reindex_relation).
2694  *
2695  * 3. Because we execute CREATE INDEX with just share lock on the parent
2696  * rel (to allow concurrent index creations), an ordinary update could
2697  * suffer a tuple-concurrently-updated failure against another CREATE
2698  * INDEX committing at about the same time. We can avoid that by having
2699  * them both do nontransactional updates (we assume they will both be
2700  * trying to change the pg_class row to the same thing, so it doesn't
2701  * matter which goes first).
2702  *
2703  * It is safe to use a non-transactional update even though our
2704  * transaction could still fail before committing. Setting relhasindex
2705  * true is safe even if there are no indexes (VACUUM will eventually fix
2706  * it). And of course the new relpages and reltuples counts are correct
2707  * regardless. However, we don't want to change relpages (or
2708  * relallvisible) if the caller isn't providing an updated reltuples
2709  * count, because that would bollix the reltuples/relpages ratio which is
2710  * what's really important.
2711  */
2712 
2713  pg_class = table_open(RelationRelationId, RowExclusiveLock);
2714 
2715  /*
2716  * Make a copy of the tuple to update. Normally we use the syscache, but
2717  * we can't rely on that during bootstrap or while reindexing pg_class
2718  * itself.
2719  */
2720  if (IsBootstrapProcessingMode() ||
2721  ReindexIsProcessingHeap(RelationRelationId))
2722  {
2723  /* don't assume syscache will work */
2724  TableScanDesc pg_class_scan;
2725  ScanKeyData key[1];
2726 
2727  ScanKeyInit(&key[0],
2728  Anum_pg_class_oid,
2729  BTEqualStrategyNumber, F_OIDEQ,
2730  ObjectIdGetDatum(relid));
2731 
2732  pg_class_scan = table_beginscan_catalog(pg_class, 1, key);
2733  tuple = heap_getnext(pg_class_scan, ForwardScanDirection);
2734  tuple = heap_copytuple(tuple);
2735  table_endscan(pg_class_scan);
2736  }
2737  else
2738  {
2739  /* normal case, use syscache */
2740  tuple = SearchSysCacheCopy1(RELOID, ObjectIdGetDatum(relid));
2741  }
2742 
2743  if (!HeapTupleIsValid(tuple))
2744  elog(ERROR, "could not find tuple for relation %u", relid);
2745  rd_rel = (Form_pg_class) GETSTRUCT(tuple);
2746 
2747  /* Should this be a more comprehensive test? */
2748  Assert(rd_rel->relkind != RELKIND_PARTITIONED_INDEX);
2749 
2750  /* Apply required updates, if any, to copied tuple */
2751 
2752  dirty = false;
2753  if (rd_rel->relhasindex != hasindex)
2754  {
2755  rd_rel->relhasindex = hasindex;
2756  dirty = true;
2757  }
2758 
2759  if (reltuples >= 0)
2760  {
2761  BlockNumber relpages = RelationGetNumberOfBlocks(rel);
2762  BlockNumber relallvisible;
2763 
2764  if (rd_rel->relkind != RELKIND_INDEX)
2765  visibilitymap_count(rel, &relallvisible, NULL);
2766  else /* don't bother for indexes */
2767  relallvisible = 0;
2768 
2769  if (rd_rel->relpages != (int32) relpages)
2770  {
2771  rd_rel->relpages = (int32) relpages;
2772  dirty = true;
2773  }
2774  if (rd_rel->reltuples != (float4) reltuples)
2775  {
2776  rd_rel->reltuples = (float4) reltuples;
2777  dirty = true;
2778  }
2779  if (rd_rel->relallvisible != (int32) relallvisible)
2780  {
2781  rd_rel->relallvisible = (int32) relallvisible;
2782  dirty = true;
2783  }
2784  }
2785 
2786  /*
2787  * If anything changed, write out the tuple
2788  */
2789  if (dirty)
2790  {
2791  heap_inplace_update(pg_class, tuple);
2792  /* the above sends a cache inval message */
2793  }
2794  else
2795  {
2796  /* no need to change tuple, but force relcache inval anyway */
2798  }
2799 
2800  heap_freetuple(tuple);
2801 
2802  table_close(pg_class, RowExclusiveLock);
2803 }
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:680
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
TableScanDesc table_beginscan_catalog(Relation relation, int nkeys, struct ScanKeyData *key)
Definition: tableam.c:98
uint32 BlockNumber
Definition: block.h:31
void visibilitymap_count(Relation rel, BlockNumber *all_visible, BlockNumber *all_frozen)
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
signed int int32
Definition: c.h:355
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
bool ReindexIsProcessingHeap(Oid heapOid)
Definition: index.c:3828
HeapTuple heap_getnext(TableScanDesc sscan, ScanDirection direction)
Definition: heapam.c:1291
#define RowExclusiveLock
Definition: lockdefs.h:38
float float4
Definition: c.h:490
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:195
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
static void table_endscan(TableScanDesc scan)
Definition: tableam.h:863
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:392
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:5717
#define elog(elevel,...)
Definition: elog.h:214
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
void CacheInvalidateRelcacheByTuple(HeapTuple classTuple)
Definition: inval.c:1306
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define RelationGetRelid(relation)
Definition: rel.h:436
#define BTEqualStrategyNumber
Definition: stratnum.h:31

◆ IndexCheckExclusion()

static void IndexCheckExclusion ( Relation  heapRelation,
Relation  indexRelation,
IndexInfo indexInfo 
)
static

Definition at line 3018 of file index.c.

References check_exclusion_constraint(), CHECK_FOR_INTERRUPTS, CreateExecutorState(), ExprContext::ecxt_per_tuple_memory, ExprContext::ecxt_scantuple, ExecDropSingleTupleTableSlot(), ExecPrepareQual(), ExecQual(), FormIndexDatum(), ForwardScanDirection, FreeExecutorState(), GetLatestSnapshot(), GetPerTupleExprContext, IndexInfo::ii_ExpressionsState, IndexInfo::ii_Predicate, IndexInfo::ii_PredicateState, INDEX_MAX_KEYS, MemoryContextReset(), NIL, RegisterSnapshot(), ReindexIsCurrentlyProcessingIndex(), RelationGetRelid, ResetReindexProcessing(), table_beginscan_strat(), table_endscan(), table_scan_getnextslot(), table_slot_create(), TupleTableSlot::tts_tid, UnregisterSnapshot(), and values.

Referenced by index_build().

3021 {
3022  TableScanDesc scan;
3024  bool isnull[INDEX_MAX_KEYS];
3025  ExprState *predicate;
3026  TupleTableSlot *slot;
3027  EState *estate;
3028  ExprContext *econtext;
3029  Snapshot snapshot;
3030 
3031  /*
3032  * If we are reindexing the target index, mark it as no longer being
3033  * reindexed, to forestall an Assert in index_beginscan when we try to use
3034  * the index for probes. This is OK because the index is now fully valid.
3035  */
3038 
3039  /*
3040  * Need an EState for evaluation of index expressions and partial-index
3041  * predicates. Also a slot to hold the current tuple.
3042  */
3043  estate = CreateExecutorState();
3044  econtext = GetPerTupleExprContext(estate);
3045  slot = table_slot_create(heapRelation, NULL);
3046 
3047  /* Arrange for econtext's scan tuple to be the tuple under test */
3048  econtext->ecxt_scantuple = slot;
3049 
3050  /* Set up execution state for predicate, if any. */
3051  predicate = ExecPrepareQual(indexInfo->ii_Predicate, estate);
3052 
3053  /*
3054  * Scan all live tuples in the base relation.
3055  */
3056  snapshot = RegisterSnapshot(GetLatestSnapshot());
3057  scan = table_beginscan_strat(heapRelation, /* relation */
3058  snapshot, /* snapshot */
3059  0, /* number of keys */
3060  NULL, /* scan key */
3061  true, /* buffer access strategy OK */
3062  true); /* syncscan OK */
3063 
3064  while (table_scan_getnextslot(scan, ForwardScanDirection, slot))
3065  {
3067 
3068  /*
3069  * In a partial index, ignore tuples that don't satisfy the predicate.
3070  */
3071  if (predicate != NULL)
3072  {
3073  if (!ExecQual(predicate, econtext))
3074  continue;
3075  }
3076 
3077  /*
3078  * Extract index column values, including computing expressions.
3079  */
3080  FormIndexDatum(indexInfo,
3081  slot,
3082  estate,
3083  values,
3084  isnull);
3085 
3086  /*
3087  * Check that this tuple has no conflicts.
3088  */
3089  check_exclusion_constraint(heapRelation,
3090  indexRelation, indexInfo,
3091  &(slot->tts_tid), values, isnull,
3092  estate, true);
3093 
3095  }
3096 
3097  table_endscan(scan);
3098  UnregisterSnapshot(snapshot);
3099 
3101 
3102  FreeExecutorState(estate);
3103 
3104  /* These may have been pointing to the now-gone estate */
3105  indexInfo->ii_ExpressionsState = NIL;
3106  indexInfo->ii_PredicateState = NULL;
3107 }
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
Definition: tableam.c:77
void FormIndexDatum(IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
Definition: index.c:2596
#define NIL
Definition: pg_list.h:65
List * ii_Predicate
Definition: execnodes.h:163
static bool ReindexIsCurrentlyProcessingIndex(Oid indexOid)
Definition: index.c:3838
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:865
ExprState * ii_PredicateState
Definition: execnodes.h:164
MemoryContext ecxt_per_tuple_memory
Definition: execnodes.h:234
void MemoryContextReset(MemoryContext context)
Definition: mcxt.c:136
static bool table_scan_getnextslot(TableScanDesc sscan, ScanDirection direction, TupleTableSlot *slot)
Definition: tableam.h:904
static bool ExecQual(ExprState *state, ExprContext *econtext)
Definition: executor.h:370
static TableScanDesc table_beginscan_strat(Relation rel, Snapshot snapshot, int nkeys, struct ScanKeyData *key, bool allow_strat, bool allow_sync)
Definition: tableam.h:779
static void ResetReindexProcessing(void)
Definition: index.c:3879
void FreeExecutorState(EState *estate)
Definition: execUtils.c:190
#define GetPerTupleExprContext(estate)
Definition: executor.h:506
List * ii_ExpressionsState
Definition: execnodes.h:162
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
Definition: execTuples.c:1224
ExprState * ExecPrepareQual(List *qual, EState *estate)
Definition: execExpr.c:520
EState * CreateExecutorState(void)
Definition: execUtils.c:88
void UnregisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:907
uintptr_t Datum
Definition: postgres.h:367
#define INDEX_MAX_KEYS
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:226
Snapshot GetLatestSnapshot(void)
Definition: snapmgr.c:381
static void table_endscan(TableScanDesc scan)
Definition: tableam.h:863
static Datum values[MAXATTR]
Definition: bootstrap.c:167
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:99
void check_exclusion_constraint(Relation heap, Relation index, IndexInfo *indexInfo, ItemPointer tupleid, Datum *values, bool *isnull, EState *estate, bool newIndex)
Definition: execIndexing.c:866
ItemPointerData tts_tid
Definition: tuptable.h:130
#define RelationGetRelid(relation)
Definition: rel.h:436

◆ IndexGetRelation()

Oid IndexGetRelation ( Oid  indexId,
bool  missing_ok 
)

Definition at line 3409 of file index.c.

References Assert, elog, ERROR, GETSTRUCT, HeapTupleIsValid, INDEXRELID, InvalidOid, ObjectIdGetDatum, ReleaseSysCache(), and SearchSysCache1().

Referenced by ATExecDetachPartition(), ATPostAlterTypeCleanup(), brin_desummarize_range(), brin_summarize_range(), bringetbitmap(), brinvacuumcleanup(), bt_index_check_internal(), CheckIndexCompatible(), CreateTrigger(), index_drop(), RangeVarCallbackForAttachIndex(), RangeVarCallbackForDropRelation(), RangeVarCallbackForReindexIndex(), reindex_index(), and ReindexRelationConcurrently().

3410 {
3411  HeapTuple tuple;
3413  Oid result;
3414 
3415  tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
3416  if (!HeapTupleIsValid(tuple))
3417  {
3418  if (missing_ok)
3419  return InvalidOid;
3420  elog(ERROR, "cache lookup failed for index %u", indexId);
3421  }
3422  index = (Form_pg_index) GETSTRUCT(tuple);
3423  Assert(index->indexrelid == indexId);
3424 
3425  result = index->indrelid;
3426  ReleaseSysCache(tuple);
3427  return result;
3428 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
unsigned int Oid
Definition: postgres_ext.h:31
Definition: type.h:89
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
#define InvalidOid
Definition: postgres_ext.h:36
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:738
#define elog(elevel,...)
Definition: elog.h:214

◆ InitializeAttributeOids()

static void InitializeAttributeOids ( Relation  indexRelation,
int  numatts,
Oid  indexoid 
)
static

Definition at line 471 of file index.c.

References i, RelationGetDescr, and TupleDescAttr.

Referenced by index_create().

474 {
475  TupleDesc tupleDescriptor;
476  int i;
477 
478  tupleDescriptor = RelationGetDescr(indexRelation);
479 
480  for (i = 0; i < numatts; i += 1)
481  TupleDescAttr(tupleDescriptor, i)->attrelid = indexoid;
482 }
#define RelationGetDescr(relation)
Definition: rel.h:462
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
int i

◆ reindex_index()

void reindex_index ( Oid  indexId,
bool  skip_constraint_checks,
char  persistence,
int  options 
)

Definition at line 3434 of file index.c.

References AccessExclusiveLock, BuildIndexInfo(), CacheInvalidateRelcache(), CatalogTupleUpdate(), CheckTableNotInUse(), EarlyPruningEnabled, elog, ereport, errcode(), errdetail_internal(), errmsg(), ERROR, get_index_isvalid(), get_rel_name(), GETSTRUCT, HeapTupleIsValid, IndexInfo::ii_BrokenHotChain, IndexInfo::ii_ExclusionOps, IndexInfo::ii_ExclusionProcs, IndexInfo::ii_ExclusionStrats, IndexInfo::ii_Unique, index_build(), index_close(), index_open(), IndexGetRelation(), INDEXRELID, INFO, IsToastNamespace(), NoLock, ObjectIdGetDatum, PG_END_TRY, PG_FINALLY, pg_rusage_init(), pg_rusage_show(), PG_TRY, pgstat_progress_end_command(), pgstat_progress_start_command(), pgstat_progress_update_param(), progress, PROGRESS_COMMAND_CREATE_INDEX, PROGRESS_CREATEIDX_ACCESS_METHOD_OID, PROGRESS_CREATEIDX_COMMAND, PROGRESS_CREATEIDX_COMMAND_REINDEX, PROGRESS_CREATEIDX_INDEX_OID, RelationData::rd_rel, REINDEXOPT_REPORT_PROGRESS, REINDEXOPT_VERBOSE, RELATION_IS_OTHER_TEMP, RelationGetNamespace, RelationGetRelationName, RelationSetNewRelfilenode(), ResetReindexProcessing(), RowExclusiveLock, SearchSysCacheCopy1, SetReindexProcessing(), ShareLock, HeapTupleData::t_self, table_close(), table_open(), and TransferPredicateLocksToHeapRelation().

Referenced by reindex_relation(), and ReindexIndex().

3436 {
3437  Relation iRel,
3438  heapRelation;
3439  Oid heapId;
3440  IndexInfo *indexInfo;
3441  volatile bool skipped_constraint = false;
3442  PGRUsage ru0;
3444 
3445  pg_rusage_init(&ru0);
3446 
3447  /*
3448  * Open and lock the parent heap relation. ShareLock is sufficient since
3449  * we only need to be sure no schema or data changes are going on.
3450  */
3451  heapId = IndexGetRelation(indexId, false);
3452  heapRelation = table_open(heapId, ShareLock);
3453 
3454  if (progress)
3455  {
3457  heapId);
3461  indexId);
3462  }
3463 
3464  /*
3465  * Open the target index relation and get an exclusive lock on it, to
3466  * ensure that no one else is touching this particular index.
3467  */
3468  iRel = index_open(indexId, AccessExclusiveLock);
3469 
3470  if (progress)
3472  iRel->rd_rel->relam);
3473 
3474  /*
3475  * The case of reindexing partitioned tables and indexes is handled
3476  * differently by upper layers, so this case shouldn't arise.
3477  */
3478  if (iRel->rd_rel->relkind == RELKIND_PARTITIONED_INDEX)
3479  elog(ERROR, "unsupported relation kind for index \"%s\"",
3480  RelationGetRelationName(iRel));
3481 
3482  /*
3483  * Don't allow reindex on temp tables of other backends ... their local
3484  * buffer manager is not going to cope.
3485  */
3486  if (RELATION_IS_OTHER_TEMP(iRel))
3487  ereport(ERROR,
3488  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3489  errmsg("cannot reindex temporary tables of other sessions")));
3490 
3491  /*
3492  * Don't allow reindex of an invalid index on TOAST table. This is a
3493  * leftover from a failed REINDEX CONCURRENTLY, and if rebuilt it would
3494  * not be possible to drop it anymore.
3495  */
3497  !get_index_isvalid(indexId))
3498  ereport(ERROR,
3499  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3500  errmsg("cannot reindex invalid index on TOAST table")));
3501 
3502  /*
3503  * Also check for active uses of the index in the current transaction; we
3504  * don't want to reindex underneath an open indexscan.
3505  */
3506  CheckTableNotInUse(iRel, "REINDEX INDEX");
3507 
3508  /*
3509  * All predicate locks on the index are about to be made invalid. Promote
3510  * them to relation locks on the heap.
3511  */
3513 
3514  /* Fetch info needed for index_build */
3515  indexInfo = BuildIndexInfo(iRel);
3516 
3517  /* If requested, skip checking uniqueness/exclusion constraints */
3518  if (skip_constraint_checks)
3519  {
3520  if (indexInfo->ii_Unique || indexInfo->ii_ExclusionOps != NULL)
3521  skipped_constraint = true;
3522  indexInfo->ii_Unique = false;
3523  indexInfo->ii_ExclusionOps = NULL;
3524  indexInfo->ii_ExclusionProcs = NULL;
3525  indexInfo->ii_ExclusionStrats = NULL;
3526  }
3527 
3528  /* ensure SetReindexProcessing state isn't leaked */
3529  PG_TRY();
3530  {
3531  /* Suppress use of the target index while rebuilding it */
3532  SetReindexProcessing(heapId, indexId);
3533 
3534  /* Create a new physical relation for the index */
3535  RelationSetNewRelfilenode(iRel, persistence);
3536 
3537  /* Initialize the index and rebuild */
3538  /* Note: we do not need to re-establish pkey setting */
3539  index_build(heapRelation, iRel, indexInfo, true, true);
3540  }
3541  PG_FINALLY();
3542  {
3543  /* Make sure flag gets cleared on error exit */
3545  }
3546  PG_END_TRY();
3547 
3548  /*
3549  * If the index is marked invalid/not-ready/dead (ie, it's from a failed
3550  * CREATE INDEX CONCURRENTLY, or a DROP INDEX CONCURRENTLY failed midway),
3551  * and we didn't skip a uniqueness check, we can now mark it valid. This
3552  * allows REINDEX to be used to clean up in such cases.
3553  *
3554  * We can also reset indcheckxmin, because we have now done a
3555  * non-concurrent index build, *except* in the case where index_build
3556  * found some still-broken HOT chains. If it did, and we don't have to
3557  * change any of the other flags, we just leave indcheckxmin alone (note
3558  * that index_build won't have changed it, because this is a reindex).
3559  * This is okay and desirable because not updating the tuple leaves the
3560  * index's usability horizon (recorded as the tuple's xmin value) the same
3561  * as it was.
3562  *
3563  * But, if the index was invalid/not-ready/dead and there were broken HOT
3564  * chains, we had better force indcheckxmin true, because the normal
3565  * argument that the HOT chains couldn't conflict with the index is
3566  * suspect for an invalid index. (A conflict is definitely possible if
3567  * the index was dead. It probably shouldn't happen otherwise, but let's
3568  * be conservative.) In this case advancing the usability horizon is
3569  * appropriate.
3570  *
3571  * Another reason for avoiding unnecessary updates here is that while
3572  * reindexing pg_index itself, we must not try to update tuples in it.
3573  * pg_index's indexes should always have these flags in their clean state,
3574  * so that won't happen.
3575  *
3576  * If early pruning/vacuuming is enabled for the heap relation, the
3577  * usability horizon must be advanced to the current transaction on every
3578  * build or rebuild. pg_index is OK in this regard because catalog tables
3579  * are not subject to early cleanup.
3580  */
3581  if (!skipped_constraint)
3582  {
3583  Relation pg_index;
3584  HeapTuple indexTuple;
3585  Form_pg_index indexForm;
3586  bool index_bad;
3587  bool early_pruning_enabled = EarlyPruningEnabled(heapRelation);
3588 
3589  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3590 
3591  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3592  ObjectIdGetDatum(indexId));
3593  if (!HeapTupleIsValid(indexTuple))
3594  elog(ERROR, "cache lookup failed for index %u", indexId);
3595  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3596 
3597  index_bad = (!indexForm->indisvalid ||
3598  !indexForm->indisready ||
3599  !indexForm->indislive);
3600  if (index_bad ||
3601  (indexForm->indcheckxmin && !indexInfo->ii_BrokenHotChain) ||
3602  early_pruning_enabled)
3603  {
3604  if (!indexInfo->ii_BrokenHotChain && !early_pruning_enabled)
3605  indexForm->indcheckxmin = false;
3606  else if (index_bad || early_pruning_enabled)
3607  indexForm->indcheckxmin = true;
3608  indexForm->indisvalid = true;
3609  indexForm->indisready = true;
3610  indexForm->indislive = true;
3611  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
3612 
3613  /*
3614  * Invalidate the relcache for the table, so that after we commit
3615  * all sessions will refresh the table's index list. This ensures
3616  * that if anyone misses seeing the pg_index row during this
3617  * update, they'll refresh their list before attempting any update
3618  * on the table.
3619  */
3620  CacheInvalidateRelcache(heapRelation);
3621  }
3622 
3623  table_close(pg_index, RowExclusiveLock);
3624  }
3625 
3626  /* Log what we did */
3628  ereport(INFO,
3629  (errmsg("index \"%s\" was reindexed",
3630  get_rel_name(indexId)),
3631  errdetail_internal("%s",
3632  pg_rusage_show(&ru0))));
3633 
3634  if (progress)
3636 
3637  /* Close rels, but keep locks */
3638  index_close(iRel, NoLock);
3639  table_close(heapRelation, NoLock);
3640 }
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3409
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
void pgstat_progress_start_command(ProgressCommandType cmdtype, Oid relid)
Definition: pgstat.c:3140
static void SetReindexProcessing(Oid heapOid, Oid indexOid)
Definition: index.c:3862
void pgstat_progress_update_param(int index, int64 val)
Definition: pgstat.c:3161
#define REINDEXOPT_REPORT_PROGRESS
Definition: parsenodes.h:3347
Oid * ii_ExclusionProcs
Definition: execnodes.h:166
int errcode(int sqlerrcode)
Definition: elog.c:610
#define INFO
Definition: elog.h:33
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2312
bool IsToastNamespace(Oid namespaceId)
Definition: catalog.c:195
Form_pg_class rd_rel
Definition: rel.h:89
unsigned int Oid
Definition: postgres_ext.h:31
#define REINDEXOPT_VERBOSE
Definition: parsenodes.h:3346
int errdetail_internal(const char *fmt,...)
Definition: elog.c:984
static void ResetReindexProcessing(void)
Definition: index.c:3879
void pg_rusage_init(PGRUsage *ru0)
Definition: pg_rusage.c:27
void RelationSetNewRelfilenode(Relation relation, char persistence)
Definition: relcache.c:3422
#define EarlyPruningEnabled(rel)
Definition: snapmgr.h:45
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
ItemPointerData t_self
Definition: htup.h:65
#define NoLock
Definition: lockdefs.h:34
#define RowExclusiveLock
Definition: lockdefs.h:38
#define PROGRESS_CREATEIDX_INDEX_OID
Definition: progress.h:80
const char * pg_rusage_show(const PGRUsage *ru0)
Definition: pg_rusage.c:40
#define RelationGetRelationName(relation)
Definition: rel.h:470
bool ii_BrokenHotChain
Definition: execnodes.h:175
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:3479
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3077
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
int progress
Definition: pgbench.c:234
#define PG_FINALLY()
Definition: elog.h:312
void pgstat_progress_end_command(void)
Definition: pgstat.c:3212
#define PROGRESS_CREATEIDX_COMMAND_REINDEX
Definition: progress.h:110
#define ereport(elevel,...)
Definition: elog.h:144
bool ii_Unique
Definition: execnodes.h:172
void index_build(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
Definition: index.c:2823
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:566
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:224
bool get_index_isvalid(Oid index_oid)
Definition: lsyscache.c:3321
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1270
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
#define AccessExclusiveLock
Definition: lockdefs.h:45
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
#define ShareLock
Definition: lockdefs.h:41
uint16 * ii_ExclusionStrats
Definition: execnodes.h:167
#define PG_TRY()
Definition: elog.h:295
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1791
#define PROGRESS_CREATEIDX_COMMAND
Definition: progress.h:79
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132
#define PG_END_TRY()
Definition: elog.h:320
#define PROGRESS_CREATEIDX_ACCESS_METHOD_OID
Definition: progress.h:81
#define RelationGetNamespace(relation)
Definition: rel.h:477

◆ reindex_relation()

bool reindex_relation ( Oid  relid,
int  flags,
int  options 
)

Definition at line 3678 of file index.c.

References Assert, CommandCounterIncrement(), ereport, errcode(), errmsg(), get_index_isvalid(), get_namespace_name(), get_rel_name(), get_rel_namespace(), i, IsToastNamespace(), lfirst_oid, NIL, NoLock, OidIsValid, PG_END_TRY, PG_FINALLY, PG_TRY, pgstat_progress_update_param(), PROGRESS_CLUSTER_INDEX_REBUILD_COUNT, RelationData::rd_rel, reindex_index(), REINDEX_REL_CHECK_CONSTRAINTS, REINDEX_REL_FORCE_INDEXES_PERMANENT, REINDEX_REL_FORCE_INDEXES_UNLOGGED, REINDEX_REL_PROCESS_TOAST, REINDEX_REL_SUPPRESS_INDEX_USE, reindex_relation(), ReindexIsProcessingIndex(), RelationGetIndexList(), RelationGetRelationName, ResetReindexPending(), SetReindexPending(), ShareLock, table_close(), table_open(), and WARNING.

Referenced by ExecuteTruncateGuts(), finish_heap_swap(), reindex_relation(), ReindexMultipleTables(), and ReindexTable().

3679 {
3680  Relation rel;
3681  Oid toast_relid;
3682  List *indexIds;
3683  bool result;
3684  int i;
3685 
3686  /*
3687  * Open and lock the relation. ShareLock is sufficient since we only need
3688  * to prevent schema and data changes in it. The lock level used here
3689  * should match ReindexTable().
3690  */
3691  rel = table_open(relid, ShareLock);
3692 
3693  /*
3694  * This may be useful when implemented someday; but that day is not today.
3695  * For now, avoid erroring out when called in a multi-table context
3696  * (REINDEX SCHEMA) and happen to come across a partitioned table. The
3697  * partitions may be reindexed on their own anyway.
3698  */
3699  if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
3700  {
3701  ereport(WARNING,
3702  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3703  errmsg("REINDEX of partitioned tables is not yet implemented, skipping \"%s\"",
3704  RelationGetRelationName(rel))));
3705  table_close(rel, ShareLock);
3706  return false;
3707  }
3708 
3709  toast_relid = rel->rd_rel->reltoastrelid;
3710 
3711  /*
3712  * Get the list of index OIDs for this relation. (We trust to the
3713  * relcache to get this with a sequential scan if ignoring system
3714  * indexes.)
3715  */
3716  indexIds = RelationGetIndexList(rel);
3717 
3718  PG_TRY();
3719  {
3720  ListCell *indexId;
3721  char persistence;
3722 
3723  if (flags & REINDEX_REL_SUPPRESS_INDEX_USE)
3724  {
3725  /* Suppress use of all the indexes until they are rebuilt */
3726  SetReindexPending(indexIds);
3727 
3728  /*
3729  * Make the new heap contents visible --- now things might be
3730  * inconsistent!
3731  */
3733  }
3734 
3735  /*
3736  * Compute persistence of indexes: same as that of owning rel, unless
3737  * caller specified otherwise.
3738  */
3740  persistence = RELPERSISTENCE_UNLOGGED;
3741  else if (flags & REINDEX_REL_FORCE_INDEXES_PERMANENT)
3742  persistence = RELPERSISTENCE_PERMANENT;
3743  else
3744  persistence = rel->rd_rel->relpersistence;
3745 
3746  /* Reindex all the indexes. */
3747  i = 1;
3748  foreach(indexId, indexIds)
3749  {
3750  Oid indexOid = lfirst_oid(indexId);
3751  Oid indexNamespaceId = get_rel_namespace(indexOid);
3752 
3753  /*
3754  * Skip any invalid indexes on a TOAST table. These can only be
3755  * duplicate leftovers from a failed REINDEX CONCURRENTLY, and if
3756  * rebuilt it would not be possible to drop them anymore.
3757  */
3758  if (IsToastNamespace(indexNamespaceId) &&
3759  !get_index_isvalid(indexOid))
3760  {
3761  ereport(WARNING,
3762  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3763  errmsg("cannot reindex invalid index \"%s.%s\" on TOAST table, skipping",
3764  get_namespace_name(indexNamespaceId),
3765  get_rel_name(indexOid))));
3766  continue;
3767  }
3768 
3769  reindex_index(indexOid, !(flags & REINDEX_REL_CHECK_CONSTRAINTS),
3770  persistence, options);
3771 
3773 
3774  /* Index should no longer be in the pending list */
3775  Assert(!ReindexIsProcessingIndex(indexOid));
3776 
3777  /* Set index rebuild count */
3779  i);
3780  i++;
3781  }
3782  }
3783  PG_FINALLY();
3784  {
3785  /* Make sure list gets cleared on error exit */
3787  }
3788  PG_END_TRY();
3789 
3790  /*
3791  * Close rel, but continue to hold the lock.
3792  */
3793  table_close(rel, NoLock);
3794 
3795  result = (indexIds != NIL);
3796 
3797  /*
3798  * If the relation has a secondary toast rel, reindex that too while we
3799  * still hold the lock on the master table.
3800  */
3801  if ((flags & REINDEX_REL_PROCESS_TOAST) && OidIsValid(toast_relid))
3802  result |= reindex_relation(toast_relid, flags, options);
3803 
3804  return result;
3805 }
#define NIL
Definition: pg_list.h:65
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
static void SetReindexPending(List *indexes)
Definition: index.c:3894
void pgstat_progress_update_param(int index, int64 val)
Definition: pgstat.c:3161
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1815
static void ResetReindexPending(void)
Definition: index.c:3922
int errcode(int sqlerrcode)
Definition: elog.c:610
#define REINDEX_REL_SUPPRESS_INDEX_USE
Definition: index.h:139
bool IsToastNamespace(Oid namespaceId)
Definition: catalog.c:195
Form_pg_class rd_rel
Definition: rel.h:89
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:644
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3155
#define NoLock
Definition: lockdefs.h:34
#define RelationGetRelationName(relation)
Definition: rel.h:470
#define WARNING
Definition: elog.h:40
#define PG_FINALLY()
Definition: elog.h:312
void CommandCounterIncrement(void)
Definition: xact.c:1005
#define ereport(elevel,...)
Definition: elog.h:144
#define REINDEX_REL_FORCE_INDEXES_UNLOGGED
Definition: index.h:141
#define Assert(condition)
Definition: c.h:738
bool get_index_isvalid(Oid index_oid)
Definition: lsyscache.c:3321
#define REINDEX_REL_CHECK_CONSTRAINTS
Definition: index.h:140
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4334
void reindex_index(Oid indexId, bool skip_constraint_checks, char persistence, int options)
Definition: index.c:3434
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define ShareLock
Definition: lockdefs.h:41
int i
#define PROGRESS_CLUSTER_INDEX_REBUILD_COUNT
Definition: progress.h:62
#define REINDEX_REL_FORCE_INDEXES_PERMANENT
Definition: index.h:142
#define REINDEX_REL_PROCESS_TOAST
Definition: index.h:138
#define PG_TRY()
Definition: elog.h:295
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
bool ReindexIsProcessingIndex(Oid indexOid)
Definition: index.c:3849
bool reindex_relation(Oid relid, int flags, int options)
Definition: index.c:3678
Definition: pg_list.h:50
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1791
#define PG_END_TRY()
Definition: elog.h:320
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ ReindexIsCurrentlyProcessingIndex()

static bool ReindexIsCurrentlyProcessingIndex ( Oid  indexOid)
static

Definition at line 3838 of file index.c.

References currentlyReindexedIndex.

Referenced by IndexCheckExclusion().

3839 {
3840  return indexOid == currentlyReindexedIndex;
3841 }
static Oid currentlyReindexedIndex
Definition: index.c:3820

◆ ReindexIsProcessingHeap()

bool ReindexIsProcessingHeap ( Oid  heapOid)

Definition at line 3828 of file index.c.

References currentlyReindexedHeap.

Referenced by index_update_stats().

3829 {
3830  return heapOid == currentlyReindexedHeap;
3831 }
static Oid currentlyReindexedHeap
Definition: index.c:3819

◆ ReindexIsProcessingIndex()

bool ReindexIsProcessingIndex ( Oid  indexOid)

Definition at line 3849 of file index.c.

References currentlyReindexedIndex, and list_member_oid().

Referenced by CatalogIndexInsert(), reindex_relation(), systable_beginscan(), and systable_beginscan_ordered().

3850 {
3851  return indexOid == currentlyReindexedIndex ||
3853 }
static List * pendingReindexedIndexes
Definition: index.c:3821
static Oid currentlyReindexedIndex
Definition: index.c:3820
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:675

◆ relationHasPrimaryKey()

static bool relationHasPrimaryKey ( Relation  rel)
static

Definition at line 148 of file index.c.

References elog, ERROR, GETSTRUCT, HeapTupleIsValid, INDEXRELID, lfirst_oid, list_free(), ObjectIdGetDatum, RelationGetIndexList(), ReleaseSysCache(), and SearchSysCache1().

Referenced by index_check_primary_key().

149 {
150  bool result = false;
151  List *indexoidlist;
152  ListCell *indexoidscan;
153 
154  /*
155  * Get the list of index OIDs for the table from the relcache, and look up
156  * each one in the pg_index syscache until we find one marked primary key
157  * (hopefully there isn't more than one such).
158  */
159  indexoidlist = RelationGetIndexList(rel);
160 
161  foreach(indexoidscan, indexoidlist)
162  {
163  Oid indexoid = lfirst_oid(indexoidscan);
164  HeapTuple indexTuple;
165 
166  indexTuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexoid));
167  if (!HeapTupleIsValid(indexTuple)) /* should not happen */
168  elog(ERROR, "cache lookup failed for index %u", indexoid);
169  result = ((Form_pg_index) GETSTRUCT(indexTuple))->indisprimary;
170  ReleaseSysCache(indexTuple);
171  if (result)
172  break;
173  }
174 
175  list_free(indexoidlist);
176 
177  return result;
178 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
unsigned int Oid
Definition: postgres_ext.h:31
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4334
void list_free(List *list)
Definition: list.c:1377
#define elog(elevel,...)
Definition: elog.h:214
Definition: pg_list.h:50
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ RemoveReindexPending()

static void RemoveReindexPending ( Oid  indexOid)
static

Definition at line 3909 of file index.c.

References elog, ERROR, IsInParallelMode(), and list_delete_oid().

Referenced by SetReindexProcessing().

3910 {
3911  if (IsInParallelMode())
3912  elog(ERROR, "cannot modify reindex state during a parallel operation");
3914  indexOid);
3915 }
static List * pendingReindexedIndexes
Definition: index.c:3821
bool IsInParallelMode(void)
Definition: xact.c:996
#define ERROR
Definition: elog.h:43
List * list_delete_oid(List *list, Oid datum)
Definition: list.c:835
#define elog(elevel,...)
Definition: elog.h:214

◆ ResetReindexPending()

static void ResetReindexPending ( void  )
static

Definition at line 3922 of file index.c.

References NIL.

Referenced by reindex_relation().

3923 {
3924  /* This may be called in leader error path */
3926 }
#define NIL
Definition: pg_list.h:65
static List * pendingReindexedIndexes
Definition: index.c:3821

◆ ResetReindexProcessing()

static void ResetReindexProcessing ( void  )
static

Definition at line 3879 of file index.c.

References currentlyReindexedHeap, currentlyReindexedIndex, and InvalidOid.

Referenced by IndexCheckExclusion(), and reindex_index().

3880 {
3881  /* This may be called in leader error path */
3884 }
static Oid currentlyReindexedHeap
Definition: index.c:3819
static Oid currentlyReindexedIndex
Definition: index.c:3820
#define InvalidOid
Definition: postgres_ext.h:36

◆ RestoreReindexState()

void RestoreReindexState ( void *  reindexstate)

Definition at line 3962 of file index.c.

References Assert, SerializedReindexState::currentlyReindexedHeap, currentlyReindexedHeap, SerializedReindexState::currentlyReindexedIndex, currentlyReindexedIndex, lappend_oid(), MemoryContextSwitchTo(), NIL, SerializedReindexState::numPendingReindexedIndexes, SerializedReindexState::pendingReindexedIndexes, and TopMemoryContext.

Referenced by ParallelWorkerMain().

3963 {
3964  SerializedReindexState *sistate = (SerializedReindexState *) reindexstate;
3965  int c = 0;
3966  MemoryContext oldcontext;
3967 
3970 
3973  for (c = 0; c < sistate->numPendingReindexedIndexes; ++c)
3976  sistate->pendingReindexedIndexes[c]);
3977  MemoryContextSwitchTo(oldcontext);
3978 }
#define NIL
Definition: pg_list.h:65
static Oid currentlyReindexedHeap
Definition: index.c:3819
Oid currentlyReindexedIndex
Definition: index.c:94
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static List * pendingReindexedIndexes
Definition: index.c:3821
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:96
List * lappend_oid(List *list, Oid datum)
Definition: list.c:358
char * c
MemoryContext TopMemoryContext
Definition: mcxt.c:44
int numPendingReindexedIndexes
Definition: index.c:95
static Oid currentlyReindexedIndex
Definition: index.c:3820
#define Assert(condition)
Definition: c.h:738
Oid currentlyReindexedHeap
Definition: index.c:93

◆ SerializeReindexState()

void SerializeReindexState ( Size  maxsize,
char *  start_address 
)

Definition at line 3944 of file index.c.

References SerializedReindexState::currentlyReindexedHeap, currentlyReindexedHeap, SerializedReindexState::currentlyReindexedIndex, currentlyReindexedIndex, lfirst_oid, list_length(), SerializedReindexState::numPendingReindexedIndexes, and SerializedReindexState::pendingReindexedIndexes.

Referenced by InitializeParallelDSM().

3945 {
3946  SerializedReindexState *sistate = (SerializedReindexState *) start_address;
3947  int c = 0;
3948  ListCell *lc;
3949 
3953  foreach(lc, pendingReindexedIndexes)
3954  sistate->pendingReindexedIndexes[c++] = lfirst_oid(lc);
3955 }
static Oid currentlyReindexedHeap
Definition: index.c:3819
Oid currentlyReindexedIndex
Definition: index.c:94
static List * pendingReindexedIndexes
Definition: index.c:3821
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:96
char * c
int numPendingReindexedIndexes
Definition: index.c:95
static Oid currentlyReindexedIndex
Definition: index.c:3820
static int list_length(const List *l)
Definition: pg_list.h:169
Oid currentlyReindexedHeap
Definition: index.c:93
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ SetReindexPending()

static void SetReindexPending ( List indexes)
static

Definition at line 3894 of file index.c.

References elog, ERROR, IsInParallelMode(), and list_copy().

Referenced by reindex_relation().

3895 {
3896  /* Reindexing is not re-entrant. */
3898  elog(ERROR, "cannot reindex while reindexing");
3899  if (IsInParallelMode())
3900  elog(ERROR, "cannot modify reindex state during a parallel operation");
3902 }
static List * pendingReindexedIndexes
Definition: index.c:3821
List * list_copy(const List *oldlist)
Definition: list.c:1404
bool IsInParallelMode(void)
Definition: xact.c:996
#define ERROR
Definition: elog.h:43
#define elog(elevel,...)
Definition: elog.h:214

◆ SetReindexProcessing()

static void SetReindexProcessing ( Oid  heapOid,
Oid  indexOid 
)
static

Definition at line 3862 of file index.c.

References Assert, currentlyReindexedHeap, currentlyReindexedIndex, elog, ERROR, OidIsValid, and RemoveReindexPending().

Referenced by reindex_index().

3863 {
3864  Assert(OidIsValid(heapOid) && OidIsValid(indexOid));
3865  /* Reindexing is not re-entrant. */
3867  elog(ERROR, "cannot reindex while reindexing");
3868  currentlyReindexedHeap = heapOid;
3869  currentlyReindexedIndex = indexOid;
3870  /* Index is no longer "pending" reindex. */
3871  RemoveReindexPending(indexOid);
3872 }
static Oid currentlyReindexedHeap
Definition: index.c:3819
#define OidIsValid(objectId)
Definition: c.h:644
#define ERROR
Definition: elog.h:43
static Oid currentlyReindexedIndex
Definition: index.c:3820
static void RemoveReindexPending(Oid indexOid)
Definition: index.c:3909
#define Assert(condition)
Definition: c.h:738
#define elog(elevel,...)
Definition: elog.h:214

◆ UpdateIndexRelation()

static void UpdateIndexRelation ( Oid  indexoid,
Oid  heapoid,
Oid  parentIndexId,
IndexInfo indexInfo,
Oid collationOids,
Oid classOids,
int16 coloptions,
bool  primary,
bool  isexclusion,
bool  immediate,
bool  isvalid,
bool  isready 
)
static

Definition at line 530 of file index.c.

References BoolGetDatum, buildint2vector(), buildoidvector(), CatalogTupleInsert(), CStringGetTextDatum, heap_form_tuple(), heap_freetuple(), i, IndexInfo::ii_Expressions, IndexInfo::ii_IndexAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_NumIndexKeyAttrs, IndexInfo::ii_Predicate, IndexInfo::ii_Unique, Int16GetDatum, make_ands_explicit(), MemSet, NIL, nodeToString(), ObjectIdGetDatum, pfree(), PointerGetDatum, RelationGetDescr, RowExclusiveLock, table_close(), table_open(), values, and int2vector::values.

Referenced by index_create().

542 {
543  int2vector *indkey;
544  oidvector *indcollation;
545  oidvector *indclass;
546  int2vector *indoption;
547  Datum exprsDatum;
548  Datum predDatum;
549  Datum values[Natts_pg_index];
550  bool nulls[Natts_pg_index];
551  Relation pg_index;
552  HeapTuple tuple;
553  int i;
554 
555  /*
556  * Copy the index key, opclass, and indoption info into arrays (should we
557  * make the caller pass them like this to start with?)
558  */
559  indkey = buildint2vector(NULL, indexInfo->ii_NumIndexAttrs);
560  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
561  indkey->values[i] = indexInfo->ii_IndexAttrNumbers[i];
562  indcollation = buildoidvector(collationOids, indexInfo->ii_NumIndexKeyAttrs);
563  indclass = buildoidvector(classOids, indexInfo->ii_NumIndexKeyAttrs);
564  indoption = buildint2vector(coloptions, indexInfo->ii_NumIndexKeyAttrs);
565 
566  /*
567  * Convert the index expressions (if any) to a text datum
568  */
569  if (indexInfo->ii_Expressions != NIL)
570  {
571  char *exprsString;
572 
573  exprsString = nodeToString(indexInfo->ii_Expressions);
574  exprsDatum = CStringGetTextDatum(exprsString);
575  pfree(exprsString);
576  }
577  else
578  exprsDatum = (Datum) 0;
579 
580  /*
581  * Convert the index predicate (if any) to a text datum. Note we convert
582  * implicit-AND format to normal explicit-AND for storage.
583  */
584  if (indexInfo->ii_Predicate != NIL)
585  {
586  char *predString;
587 
588  predString = nodeToString(make_ands_explicit(indexInfo->ii_Predicate));
589  predDatum = CStringGetTextDatum(predString);
590  pfree(predString);
591  }
592  else
593  predDatum = (Datum) 0;
594 
595 
596  /*
597  * open the system catalog index relation
598  */
599  pg_index = table_open(IndexRelationId, RowExclusiveLock);
600 
601  /*
602  * Build a pg_index tuple
603  */
604  MemSet(nulls, false, sizeof(nulls));
605 
606  values[Anum_pg_index_indexrelid - 1] = ObjectIdGetDatum(indexoid);
607  values[Anum_pg_index_indrelid - 1] = ObjectIdGetDatum(heapoid);
608  values[Anum_pg_index_indnatts - 1] = Int16GetDatum(indexInfo->ii_NumIndexAttrs);
609  values[Anum_pg_index_indnkeyatts - 1] = Int16GetDatum(indexInfo->ii_NumIndexKeyAttrs);
610  values[Anum_pg_index_indisunique - 1] = BoolGetDatum(indexInfo->ii_Unique);
611  values[Anum_pg_index_indisprimary - 1] = BoolGetDatum(primary);
612  values[Anum_pg_index_indisexclusion - 1] = BoolGetDatum(isexclusion);
613  values[Anum_pg_index_indimmediate - 1] = BoolGetDatum(immediate);
614  values[Anum_pg_index_indisclustered - 1] = BoolGetDatum(false);
615  values[Anum_pg_index_indisvalid - 1] = BoolGetDatum(isvalid);
616  values[Anum_pg_index_indcheckxmin - 1] = BoolGetDatum(false);
617  values[Anum_pg_index_indisready - 1] = BoolGetDatum(isready);
618  values[Anum_pg_index_indislive - 1] = BoolGetDatum(true);
619  values[Anum_pg_index_indisreplident - 1] = BoolGetDatum(false);
620  values[Anum_pg_index_indkey - 1] = PointerGetDatum(indkey);
621  values[Anum_pg_index_indcollation - 1] = PointerGetDatum(indcollation);
622  values[Anum_pg_index_indclass - 1] = PointerGetDatum(indclass);
623  values[Anum_pg_index_indoption - 1] = PointerGetDatum(indoption);
624  values[Anum_pg_index_indexprs - 1] = exprsDatum;
625  if (exprsDatum == (Datum) 0)
626  nulls[Anum_pg_index_indexprs - 1] = true;
627  values[Anum_pg_index_indpred - 1] = predDatum;
628  if (predDatum == (Datum) 0)
629  nulls[Anum_pg_index_indpred - 1] = true;
630 
631  tuple = heap_form_tuple(RelationGetDescr(pg_index), values, nulls);
632 
633  /*
634  * insert the tuple into the pg_index catalog
635  */
636  CatalogTupleInsert(pg_index, tuple);
637 
638  /*
639  * close the relation and free the tuple
640  */
641  table_close(pg_index, RowExclusiveLock);
642  heap_freetuple(tuple);
643 }
#define NIL
Definition: pg_list.h:65
Definition: c.h:594
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
List * ii_Predicate
Definition: execnodes.h:163
#define RelationGetDescr(relation)
Definition: rel.h:462
#define PointerGetDatum(X)
Definition: postgres.h:556
int2vector * buildint2vector(const int16 *int2s, int n)
Definition: int.c:114
#define Int16GetDatum(X)
Definition: postgres.h:451
#define MemSet(start, val, len)
Definition: c.h:971
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, Datum *values, bool *isnull)
Definition: heaptuple.c:1020
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
void pfree(void *pointer)
Definition: mcxt.c:1056
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
#define RowExclusiveLock
Definition: lockdefs.h:38
Definition: c.h:583
uintptr_t Datum
Definition: postgres.h:367
Expr * make_ands_explicit(List *andclauses)
Definition: makefuncs.c:705
int ii_NumIndexAttrs
Definition: execnodes.h:158
#define BoolGetDatum(X)
Definition: postgres.h:402
bool ii_Unique
Definition: execnodes.h:172
List * ii_Expressions
Definition: execnodes.h:161
oidvector * buildoidvector(const Oid *oids, int n)
Definition: oid.c:167
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:591
static Datum values[MAXATTR]
Definition: bootstrap.c:167
int i
#define CStringGetTextDatum(s)
Definition: builtins.h:87
char * nodeToString(const void *obj)
Definition: outfuncs.c:4329
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
void CatalogTupleInsert(Relation heapRel, HeapTuple tup)
Definition: indexing.c:183

◆ validate_index()