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/toast_compression.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/tablespace.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/rel.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, 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)
 
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, Oid tablespaceOid, 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, ReindexParams *params)
 
bool reindex_relation (Oid relid, int flags, ReindexParams *params)
 
bool ReindexIsProcessingHeap (Oid heapOid)
 
bool ReindexIsProcessingIndex (Oid indexOid)
 
void ResetReindexState (int nestLevel)
 
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
 
static int reindexingNestLevel = 0
 

Function Documentation

◆ AppendAttributeTuples()

static void AppendAttributeTuples ( Relation  indexRelation,
Datum attopts 
)
static

Definition at line 500 of file index.c.

References CatalogCloseIndexes(), CatalogOpenIndexes(), InsertPgAttributeTuples(), InvalidOid, RelationGetDescr, RowExclusiveLock, table_close(), and table_open().

Referenced by index_create().

501 {
502  Relation pg_attribute;
503  CatalogIndexState indstate;
504  TupleDesc indexTupDesc;
505 
506  /*
507  * open the attribute relation and its indexes
508  */
509  pg_attribute = table_open(AttributeRelationId, RowExclusiveLock);
510 
511  indstate = CatalogOpenIndexes(pg_attribute);
512 
513  /*
514  * insert data from new index's tupdesc into pg_attribute
515  */
516  indexTupDesc = RelationGetDescr(indexRelation);
517 
518  InsertPgAttributeTuples(pg_attribute, indexTupDesc, InvalidOid, attopts, indstate);
519 
520  CatalogCloseIndexes(indstate);
521 
522  table_close(pg_attribute, RowExclusiveLock);
523 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define RelationGetDescr(relation)
Definition: rel.h:495
#define RowExclusiveLock
Definition: lockdefs.h:38
void InsertPgAttributeTuples(Relation pg_attribute_rel, TupleDesc tupdesc, Oid new_rel_oid, Datum *attoptions, CatalogIndexState indstate)
Definition: heap.c:740
#define InvalidOid
Definition: postgres_ext.h:36
CatalogIndexState CatalogOpenIndexes(Relation heapRel)
Definition: indexing.c:43
void CatalogCloseIndexes(CatalogIndexState indstate)
Definition: indexing.c:61
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ BuildDummyIndexInfo()

IndexInfo* BuildDummyIndexInfo ( Relation  index)

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

2436 {
2437  IndexInfo *ii;
2438  Form_pg_index indexStruct = index->rd_index;
2439  int i;
2440  int numAtts;
2441 
2442  /* check the number of keys, and copy attr numbers into the IndexInfo */
2443  numAtts = indexStruct->indnatts;
2444  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2445  elog(ERROR, "invalid indnatts %d for index %u",
2446  numAtts, RelationGetRelid(index));
2447 
2448  /*
2449  * Create the node, using dummy index expressions, and pretending there is
2450  * no predicate.
2451  */
2452  ii = makeIndexInfo(indexStruct->indnatts,
2453  indexStruct->indnkeyatts,
2454  index->rd_rel->relam,
2456  NIL,
2457  indexStruct->indisunique,
2458  indexStruct->indisready,
2459  false);
2460 
2461  /* fill in attribute numbers */
2462  for (i = 0; i < numAtts; i++)
2463  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2464 
2465  /* We ignore the exclusion constraint if any */
2466 
2467  return ii;
2468 }
#define NIL
Definition: pg_list.h:65
List * RelationGetDummyIndexExpressions(Relation relation)
Definition: relcache.c:4863
Form_pg_class rd_rel
Definition: rel.h:109
Form_pg_index rd_index
Definition: rel.h:187
#define ERROR
Definition: elog.h:46
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:743
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
#define INDEX_MAX_KEYS
#define elog(elevel,...)
Definition: elog.h:232
int i
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
#define RelationGetRelid(relation)
Definition: rel.h:469

◆ BuildIndexInfo()

IndexInfo* BuildIndexInfo ( Relation  index)

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

2377 {
2378  IndexInfo *ii;
2379  Form_pg_index indexStruct = index->rd_index;
2380  int i;
2381  int numAtts;
2382 
2383  /* check the number of keys, and copy attr numbers into the IndexInfo */
2384  numAtts = indexStruct->indnatts;
2385  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2386  elog(ERROR, "invalid indnatts %d for index %u",
2387  numAtts, RelationGetRelid(index));
2388 
2389  /*
2390  * Create the node, fetching any expressions needed for expressional
2391  * indexes and index predicate if any.
2392  */
2393  ii = makeIndexInfo(indexStruct->indnatts,
2394  indexStruct->indnkeyatts,
2395  index->rd_rel->relam,
2398  indexStruct->indisunique,
2399  indexStruct->indisready,
2400  false);
2401 
2402  /* fill in attribute numbers */
2403  for (i = 0; i < numAtts; i++)
2404  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2405 
2406  /* fetch exclusion constraint info if any */
2407  if (indexStruct->indisexclusion)
2408  {
2410  &ii->ii_ExclusionOps,
2411  &ii->ii_ExclusionProcs,
2412  &ii->ii_ExclusionStrats);
2413  }
2414 
2416 
2417  return ii;
2418 }
void RelationGetExclusionInfo(Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
Definition: relcache.c:5313
Oid * ii_ExclusionProcs
Definition: execnodes.h:166
Form_pg_class rd_rel
Definition: rel.h:109
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4917
Form_pg_index rd_index
Definition: rel.h:187
#define ERROR
Definition: elog.h:46
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4804
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:743
Datum * RelationGetIndexRawAttOptions(Relation indexrel)
Definition: relcache.c:5521
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
#define INDEX_MAX_KEYS
Oid * ii_ExclusionOps
Definition: execnodes.h:165
#define elog(elevel,...)
Definition: elog.h:232
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:469
Datum * ii_OpclassOptions
Definition: execnodes.h:171

◆ BuildSpeculativeIndexInfo()

void BuildSpeculativeIndexInfo ( Relation  index,
IndexInfo ii 
)

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

2601 {
2602  int indnkeyatts;
2603  int i;
2604 
2605  indnkeyatts = IndexRelationGetNumberOfKeyAttributes(index);
2606 
2607  /*
2608  * fetch info for checking unique indexes
2609  */
2610  Assert(ii->ii_Unique);
2611 
2612  if (index->rd_rel->relam != BTREE_AM_OID)
2613  elog(ERROR, "unexpected non-btree speculative unique index");
2614 
2615  ii->ii_UniqueOps = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2616  ii->ii_UniqueProcs = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2617  ii->ii_UniqueStrats = (uint16 *) palloc(sizeof(uint16) * indnkeyatts);
2618 
2619  /*
2620  * We have to look up the operator's strategy number. This provides a
2621  * cross-check that the operator does match the index.
2622  */
2623  /* We need the func OIDs and strategy numbers too */
2624  for (i = 0; i < indnkeyatts; i++)
2625  {
2627  ii->ii_UniqueOps[i] =
2628  get_opfamily_member(index->rd_opfamily[i],
2629  index->rd_opcintype[i],
2630  index->rd_opcintype[i],
2631  ii->ii_UniqueStrats[i]);
2632  if (!OidIsValid(ii->ii_UniqueOps[i]))
2633  elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
2634  ii->ii_UniqueStrats[i], index->rd_opcintype[i],
2635  index->rd_opcintype[i], index->rd_opfamily[i]);
2636  ii->ii_UniqueProcs[i] = get_opcode(ii->ii_UniqueOps[i]);
2637  }
2638 }
uint16 * ii_UniqueStrats
Definition: execnodes.h:170
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:710
Oid * ii_UniqueOps
Definition: execnodes.h:168
unsigned short uint16
Definition: c.h:440
#define ERROR
Definition: elog.h:46
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:202
#define IndexRelationGetNumberOfKeyAttributes(relation)
Definition: rel.h:488
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1256
bool ii_Unique
Definition: execnodes.h:172
#define Assert(condition)
Definition: c.h:804
void * palloc(Size size)
Definition: mcxt.c:1062
#define elog(elevel,...)
Definition: elog.h:232
int i
Oid * rd_opcintype
Definition: rel.h:203
#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 2481 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().

2485 {
2486  int i;
2487 
2488  if (info1->ii_Unique != info2->ii_Unique)
2489  return false;
2490 
2491  /* indexes are only equivalent if they have the same access method */
2492  if (info1->ii_Am != info2->ii_Am)
2493  return false;
2494 
2495  /* and same number of attributes */
2496  if (info1->ii_NumIndexAttrs != info2->ii_NumIndexAttrs)
2497  return false;
2498 
2499  /* and same number of key attributes */
2500  if (info1->ii_NumIndexKeyAttrs != info2->ii_NumIndexKeyAttrs)
2501  return false;
2502 
2503  /*
2504  * and columns match through the attribute map (actual attribute numbers
2505  * might differ!) Note that this implies that index columns that are
2506  * expressions appear in the same positions. We will next compare the
2507  * expressions themselves.
2508  */
2509  for (i = 0; i < info1->ii_NumIndexAttrs; i++)
2510  {
2511  if (attmap->maplen < info2->ii_IndexAttrNumbers[i])
2512  elog(ERROR, "incorrect attribute map");
2513 
2514  /* ignore expressions at this stage */
2515  if ((info1->ii_IndexAttrNumbers[i] != InvalidAttrNumber) &&
2516  (attmap->attnums[info2->ii_IndexAttrNumbers[i] - 1] !=
2517  info1->ii_IndexAttrNumbers[i]))
2518  return false;
2519 
2520  /* collation and opfamily is not valid for including columns */
2521  if (i >= info1->ii_NumIndexKeyAttrs)
2522  continue;
2523 
2524  if (collations1[i] != collations2[i])
2525  return false;
2526  if (opfamilies1[i] != opfamilies2[i])
2527  return false;
2528  }
2529 
2530  /*
2531  * For expression indexes: either both are expression indexes, or neither
2532  * is; if they are, make sure the expressions match.
2533  */
2534  if ((info1->ii_Expressions != NIL) != (info2->ii_Expressions != NIL))
2535  return false;
2536  if (info1->ii_Expressions != NIL)
2537  {
2538  bool found_whole_row;
2539  Node *mapped;
2540 
2541  mapped = map_variable_attnos((Node *) info2->ii_Expressions,
2542  1, 0, attmap,
2543  InvalidOid, &found_whole_row);
2544  if (found_whole_row)
2545  {
2546  /*
2547  * we could throw an error here, but seems out of scope for this
2548  * routine.
2549  */
2550  return false;
2551  }
2552 
2553  if (!equal(info1->ii_Expressions, mapped))
2554  return false;
2555  }
2556 
2557  /* Partial index predicates must be identical, if they exist */
2558  if ((info1->ii_Predicate == NULL) != (info2->ii_Predicate == NULL))
2559  return false;
2560  if (info1->ii_Predicate != NULL)
2561  {
2562  bool found_whole_row;
2563  Node *mapped;
2564 
2565  mapped = map_variable_attnos((Node *) info2->ii_Predicate,
2566  1, 0, attmap,
2567  InvalidOid, &found_whole_row);
2568  if (found_whole_row)
2569  {
2570  /*
2571  * we could throw an error here, but seems out of scope for this
2572  * routine.
2573  */
2574  return false;
2575  }
2576  if (!equal(info1->ii_Predicate, mapped))
2577  return false;
2578  }
2579 
2580  /* No support currently for comparing exclusion indexes. */
2581  if (info1->ii_ExclusionOps != NULL || info2->ii_ExclusionOps != NULL)
2582  return false;
2583 
2584  return true;
2585 }
#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:3113
int maplen
Definition: attmap.h:37
Definition: nodes.h:539
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:46
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:232
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 269 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, InvalidCompressionMethod, InvalidOid, lfirst, list_head(), lnext(), MemSet, NameStr, namestrcpy(), NIL, ObjectIdGetDatum, OidIsValid, pfree(), RelationGetDescr, RelationGetForm, ReleaseSysCache(), SearchSysCache1(), TupleDescAttr, and TYPEOID.

Referenced by index_create().

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

◆ EstimateReindexStateSpace()

Size EstimateReindexStateSpace ( void  )

Definition at line 4071 of file index.c.

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

Referenced by InitializeParallelDSM().

4072 {
4075 }
static List * pendingReindexedIndexes
Definition: index.c:3940
unsigned int Oid
Definition: postgres_ext.h:31
Size mul_size(Size s1, Size s2)
Definition: shmem.c:519
static int list_length(const List *l)
Definition: pg_list.h:149
#define offsetof(type, field)
Definition: c.h:727

◆ FormIndexDatum()

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

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

2665 {
2666  ListCell *indexpr_item;
2667  int i;
2668 
2669  if (indexInfo->ii_Expressions != NIL &&
2670  indexInfo->ii_ExpressionsState == NIL)
2671  {
2672  /* First time through, set up expression evaluation state */
2673  indexInfo->ii_ExpressionsState =
2674  ExecPrepareExprList(indexInfo->ii_Expressions, estate);
2675  /* Check caller has set up context correctly */
2676  Assert(GetPerTupleExprContext(estate)->ecxt_scantuple == slot);
2677  }
2678  indexpr_item = list_head(indexInfo->ii_ExpressionsState);
2679 
2680  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
2681  {
2682  int keycol = indexInfo->ii_IndexAttrNumbers[i];
2683  Datum iDatum;
2684  bool isNull;
2685 
2686  if (keycol < 0)
2687  iDatum = slot_getsysattr(slot, keycol, &isNull);
2688  else if (keycol != 0)
2689  {
2690  /*
2691  * Plain index column; get the value we need directly from the
2692  * heap tuple.
2693  */
2694  iDatum = slot_getattr(slot, keycol, &isNull);
2695  }
2696  else
2697  {
2698  /*
2699  * Index expression --- need to evaluate it.
2700  */
2701  if (indexpr_item == NULL)
2702  elog(ERROR, "wrong number of index expressions");
2703  iDatum = ExecEvalExprSwitchContext((ExprState *) lfirst(indexpr_item),
2704  GetPerTupleExprContext(estate),
2705  &isNull);
2706  indexpr_item = lnext(indexInfo->ii_ExpressionsState, indexpr_item);
2707  }
2708  values[i] = iDatum;
2709  isnull[i] = isNull;
2710  }
2711 
2712  if (indexpr_item != NULL)
2713  elog(ERROR, "wrong number of index expressions");
2714 }
#define NIL
Definition: pg_list.h:65
static Datum ExecEvalExprSwitchContext(ExprState *state, ExprContext *econtext, bool *isNull)
Definition: executor.h:330
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:322
#define GetPerTupleExprContext(estate)
Definition: executor.h:532
List * ii_ExpressionsState
Definition: execnodes.h:162
#define ERROR
Definition: elog.h:46
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
List * ExecPrepareExprList(List *nodes, EState *estate)
Definition: execExpr.c:766
uintptr_t Datum
Definition: postgres.h:411
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:804
#define lfirst(lc)
Definition: pg_list.h:169
static Datum values[MAXATTR]
Definition: bootstrap.c:166
#define elog(elevel,...)
Definition: elog.h:232
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 2896 of file index.c.

References IndexAmRoutine::ambuild, IndexAmRoutine::ambuildempty, Assert, AtEOXact_GUC(), CatalogTupleUpdate(), CommandCounterIncrement(), DEBUG1, EarlyPruningEnabled, elog, ereport, errmsg_internal(), 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(), and table_open().

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

2901 {
2902  IndexBuildResult *stats;
2903  Oid save_userid;
2904  int save_sec_context;
2905  int save_nestlevel;
2906 
2907  /*
2908  * sanity checks
2909  */
2910  Assert(RelationIsValid(indexRelation));
2911  Assert(PointerIsValid(indexRelation->rd_indam));
2912  Assert(PointerIsValid(indexRelation->rd_indam->ambuild));
2913  Assert(PointerIsValid(indexRelation->rd_indam->ambuildempty));
2914 
2915  /*
2916  * Determine worker process details for parallel CREATE INDEX. Currently,
2917  * only btree has support for parallel builds.
2918  *
2919  * Note that planner considers parallel safety for us.
2920  */
2921  if (parallel && IsNormalProcessingMode() &&
2922  indexRelation->rd_rel->relam == BTREE_AM_OID)
2923  indexInfo->ii_ParallelWorkers =
2925  RelationGetRelid(indexRelation));
2926 
2927  if (indexInfo->ii_ParallelWorkers == 0)
2928  ereport(DEBUG1,
2929  (errmsg_internal("building index \"%s\" on table \"%s\" serially",
2930  RelationGetRelationName(indexRelation),
2931  RelationGetRelationName(heapRelation))));
2932  else
2933  ereport(DEBUG1,
2934  (errmsg_internal("building index \"%s\" on table \"%s\" with request for %d parallel workers",
2935  RelationGetRelationName(indexRelation),
2936  RelationGetRelationName(heapRelation),
2937  indexInfo->ii_ParallelWorkers)));
2938 
2939  /*
2940  * Switch to the table owner's userid, so that any index functions are run
2941  * as that user. Also lock down security-restricted operations and
2942  * arrange to make GUC variable changes local to this command.
2943  */
2944  GetUserIdAndSecContext(&save_userid, &save_sec_context);
2945  SetUserIdAndSecContext(heapRelation->rd_rel->relowner,
2946  save_sec_context | SECURITY_RESTRICTED_OPERATION);
2947  save_nestlevel = NewGUCNestLevel();
2948 
2949  /* Set up initial progress report status */
2950  {
2951  const int progress_index[] = {
2958  };
2959  const int64 progress_vals[] = {
2962  0, 0, 0, 0
2963  };
2964 
2965  pgstat_progress_update_multi_param(6, progress_index, progress_vals);
2966  }
2967 
2968  /*
2969  * Call the access method's build procedure
2970  */
2971  stats = indexRelation->rd_indam->ambuild(heapRelation, indexRelation,
2972  indexInfo);
2973  Assert(PointerIsValid(stats));
2974 
2975  /*
2976  * If this is an unlogged index, we may need to write out an init fork for
2977  * it -- but we must first check whether one already exists. If, for
2978  * example, an unlogged relation is truncated in the transaction that
2979  * created it, or truncated twice in a subsequent transaction, the
2980  * relfilenode won't change, and nothing needs to be done here.
2981  */
2982  if (indexRelation->rd_rel->relpersistence == RELPERSISTENCE_UNLOGGED &&
2983  !smgrexists(indexRelation->rd_smgr, INIT_FORKNUM))
2984  {
2985  RelationOpenSmgr(indexRelation);
2986  smgrcreate(indexRelation->rd_smgr, INIT_FORKNUM, false);
2987  indexRelation->rd_indam->ambuildempty(indexRelation);
2988  }
2989 
2990  /*
2991  * If we found any potentially broken HOT chains, mark the index as not
2992  * being usable until the current transaction is below the event horizon.
2993  * See src/backend/access/heap/README.HOT for discussion. Also set this
2994  * if early pruning/vacuuming is enabled for the heap relation. While it
2995  * might become safe to use the index earlier based on actual cleanup
2996  * activity and other active transactions, the test for that would be much
2997  * more complex and would require some form of blocking, so keep it simple
2998  * and fast by just using the current transaction.
2999  *
3000  * However, when reindexing an existing index, we should do nothing here.
3001  * Any HOT chains that are broken with respect to the index must predate
3002  * the index's original creation, so there is no need to change the
3003  * index's usability horizon. Moreover, we *must not* try to change the
3004  * index's pg_index entry while reindexing pg_index itself, and this
3005  * optimization nicely prevents that. The more complex rules needed for a
3006  * reindex are handled separately after this function returns.
3007  *
3008  * We also need not set indcheckxmin during a concurrent index build,
3009  * because we won't set indisvalid true until all transactions that care
3010  * about the broken HOT chains or early pruning/vacuuming are gone.
3011  *
3012  * Therefore, this code path can only be taken during non-concurrent
3013  * CREATE INDEX. Thus the fact that heap_update will set the pg_index
3014  * tuple's xmin doesn't matter, because that tuple was created in the
3015  * current transaction anyway. That also means we don't need to worry
3016  * about any concurrent readers of the tuple; no other transaction can see
3017  * it yet.
3018  */
3019  if ((indexInfo->ii_BrokenHotChain || EarlyPruningEnabled(heapRelation)) &&
3020  !isreindex &&
3021  !indexInfo->ii_Concurrent)
3022  {
3023  Oid indexId = RelationGetRelid(indexRelation);
3024  Relation pg_index;
3025  HeapTuple indexTuple;
3026  Form_pg_index indexForm;
3027 
3028  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3029 
3030  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3031  ObjectIdGetDatum(indexId));
3032  if (!HeapTupleIsValid(indexTuple))
3033  elog(ERROR, "cache lookup failed for index %u", indexId);
3034  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3035 
3036  /* If it's a new index, indcheckxmin shouldn't be set ... */
3037  Assert(!indexForm->indcheckxmin);
3038 
3039  indexForm->indcheckxmin = true;
3040  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
3041 
3042  heap_freetuple(indexTuple);
3043  table_close(pg_index, RowExclusiveLock);
3044  }
3045 
3046  /*
3047  * Update heap and index pg_class rows
3048  */
3049  index_update_stats(heapRelation,
3050  true,
3051  stats->heap_tuples);
3052 
3053  index_update_stats(indexRelation,
3054  false,
3055  stats->index_tuples);
3056 
3057  /* Make the updated catalog row versions visible */
3059 
3060  /*
3061  * If it's for an exclusion constraint, make a second pass over the heap
3062  * to verify that the constraint is satisfied. We must not do this until
3063  * the index is fully valid. (Broken HOT chains shouldn't matter, though;
3064  * see comments for IndexCheckExclusion.)
3065  */
3066  if (indexInfo->ii_ExclusionOps != NULL)
3067  IndexCheckExclusion(heapRelation, indexRelation, indexInfo);
3068 
3069  /* Roll back any GUC changes executed by index functions */
3070  AtEOXact_GUC(false, save_nestlevel);
3071 
3072  /* Restore userid and security context */
3073  SetUserIdAndSecContext(save_userid, save_sec_context);
3074 }
struct IndexAmRoutine * rd_indam
Definition: rel.h:201
static void index_update_stats(Relation rel, bool hasindex, double reltuples)
Definition: index.c:2739
#define DEBUG1
Definition: elog.h:25
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
void smgrcreate(SMgrRelation reln, ForkNumber forknum, bool isRedo)
Definition: smgr.c:333
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
#define SECURITY_RESTRICTED_OPERATION
Definition: miscadmin.h:300
void SetUserIdAndSecContext(Oid userid, int sec_context)
Definition: miscinit.c:590
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:109
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
void pgstat_progress_update_multi_param(int nparam, const int *index, const int64 *val)
#define RelationOpenSmgr(relation)
Definition: rel.h:526
#define EarlyPruningEnabled(rel)
Definition: snapmgr.h:44
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
ambuild_function ambuild
Definition: amapi.h:259
#define RelationIsValid(relation)
Definition: rel.h:442
ItemPointerData t_self
Definition: htup.h:65
#define IsNormalProcessingMode()
Definition: miscadmin.h:396
void GetUserIdAndSecContext(Oid *userid, int *sec_context)
Definition: miscinit.c:583
#define RowExclusiveLock
Definition: lockdefs.h:38
void AtEOXact_GUC(bool isCommit, int nestLevel)
Definition: guc.c:6218
#define RelationGetRelationName(relation)
Definition: rel.h:503
bool ii_BrokenHotChain
Definition: execnodes.h:175
static void IndexCheckExclusion(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo)
Definition: index.c:3089
#define PROGRESS_CREATEIDX_SUBPHASE_INITIALIZE
Definition: progress.h:104
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
#define PROGRESS_CREATEIDX_PHASE
Definition: progress.h:82
#define PROGRESS_SCAN_BLOCKS_DONE
Definition: progress.h:120
void CommandCounterIncrement(void)
Definition: xact.c:1021
#define ereport(elevel,...)
Definition: elog.h:157
int errmsg_internal(const char *fmt,...)
Definition: elog.c:996
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:804
#define PROGRESS_CREATEIDX_PHASE_BUILD
Definition: progress.h:92
int ii_ParallelWorkers
Definition: execnodes.h:176
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:301
int plan_create_index_workers(Oid tableOid, Oid indexOid)
Definition: planner.c:5851
#define PROGRESS_SCAN_BLOCKS_TOTAL
Definition: progress.h:119
bool ii_Concurrent
Definition: execnodes.h:174
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:175
int NewGUCNestLevel(void)
Definition: guc.c:6204
Oid * ii_ExclusionOps
Definition: execnodes.h:165
#define PROGRESS_CREATEIDX_TUPLES_DONE
Definition: progress.h:85
#define elog(elevel,...)
Definition: elog.h:232
ambuildempty_function ambuildempty
Definition: amapi.h:260
#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:698
#define RelationGetRelid(relation)
Definition: rel.h:469
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 203 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().

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

◆ 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:167
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3393
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2376
#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:798
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:2896
#define Assert(condition)
Definition: c.h:804
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,
Oid  tablespaceOid,
const char *  newName 
)

Definition at line 1251 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  tablespaceOid,
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:660
List * ii_Predicate
Definition: execnodes.h:163
#define RelationGetDescr(relation)
Definition: rel.h:495
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
int errcode(int sqlerrcode)
Definition: elog.c:698
void * stringToNode(const char *str)
Definition: read.c:89
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2376
Form_pg_class rd_rel
Definition: rel.h:109
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:696
void pfree(void *pointer)
Definition: mcxt.c:1169
Oid * rd_indcollation
Definition: rel.h:212
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
#define NoLock
Definition: lockdefs.h:34
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:668
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:203
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:743
List * lappend(List *list, void *datum)
Definition: list.c:336
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1127
Definition: c.h:649
#define TextDatumGetCString(d)
Definition: builtins.h:83
uintptr_t Datum
Definition: postgres.h:411
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1175
int ii_NumIndexAttrs
Definition: execnodes.h:158
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:719
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:1388
#define InvalidOid
Definition: postgres_ext.h:36
#define INDEX_CREATE_CONCURRENT
Definition: index.h:64
#define ereport(elevel,...)
Definition: elog.h:157
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:804
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:657
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
#define DatumGetPointer(X)
Definition: postgres.h:593
#define INDEX_CREATE_SKIP_BUILD
Definition: index.h:63
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:909
#define elog(elevel,...)
Definition: elog.h:232
int i
#define NameStr(name)
Definition: c.h:681
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 1808 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().

1809 {
1810  Relation userHeapRelation;
1811  Relation userIndexRelation;
1812 
1813  /*
1814  * No more predicate locks will be acquired on this index, and we're about
1815  * to stop doing inserts into the index which could show conflicts with
1816  * existing predicate locks, so now is the time to move them to the heap
1817  * relation.
1818  */
1819  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
1820  userIndexRelation = index_open(indexId, ShareUpdateExclusiveLock);
1821  TransferPredicateLocksToHeapRelation(userIndexRelation);
1822 
1823  /*
1824  * Now we are sure that nobody uses the index for queries; they just might
1825  * have it open for updating it. So now we can unset indisready and
1826  * indislive, then wait till nobody could be using it at all anymore.
1827  */
1829 
1830  /*
1831  * Invalidate the relcache for the table, so that after this commit all
1832  * sessions will refresh the table's index list. Forgetting just the
1833  * index's relcache entry is not enough.
1834  */
1835  CacheInvalidateRelcache(userHeapRelation);
1836 
1837  /*
1838  * Close the relations again, though still holding session lock.
1839  */
1840  table_close(userHeapRelation, NoLock);
1841  index_close(userIndexRelation, NoLock);
1842 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3393
#define NoLock
Definition: lockdefs.h:34
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3146
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1278
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 AttributeRelidNumIndexId, PgStat_StatTabEntry::blocks_fetched, PgStat_StatTabEntry::blocks_hit, BTEqualStrategyNumber, CatalogTupleUpdate(), changeDependenciesOf(), changeDependenciesOn(), CONSTROID, CopyStatistics(), DeleteInheritsTuple(), DescriptionObjIndexId, elog, ERROR, get_attstattarget(), 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 indisreplident in the new index */
1543  newIndexForm->indisreplident = oldIndexForm->indisreplident;
1544 
1545  /* Preserve indisclustered in the new index */
1546  newIndexForm->indisclustered = oldIndexForm->indisclustered;
1547 
1548  /*
1549  * Mark the new index as valid, and the old index as invalid similarly to
1550  * what index_set_state_flags() does.
1551  */
1552  newIndexForm->indisvalid = true;
1553  oldIndexForm->indisvalid = false;
1554  oldIndexForm->indisclustered = false;
1555  oldIndexForm->indisreplident = false;
1556 
1557  CatalogTupleUpdate(pg_index, &oldIndexTuple->t_self, oldIndexTuple);
1558  CatalogTupleUpdate(pg_index, &newIndexTuple->t_self, newIndexTuple);
1559 
1560  heap_freetuple(oldIndexTuple);
1561  heap_freetuple(newIndexTuple);
1562 
1563  /*
1564  * Move constraints and triggers over to the new index
1565  */
1566 
1567  constraintOids = get_index_ref_constraints(oldIndexId);
1568 
1569  indexConstraintOid = get_index_constraint(oldIndexId);
1570 
1571  if (OidIsValid(indexConstraintOid))
1572  constraintOids = lappend_oid(constraintOids, indexConstraintOid);
1573 
1574  pg_constraint = table_open(ConstraintRelationId, RowExclusiveLock);
1575  pg_trigger = table_open(TriggerRelationId, RowExclusiveLock);
1576 
1577  foreach(lc, constraintOids)
1578  {
1579  HeapTuple constraintTuple,
1580  triggerTuple;
1581  Form_pg_constraint conForm;
1582  ScanKeyData key[1];
1583  SysScanDesc scan;
1584  Oid constraintOid = lfirst_oid(lc);
1585 
1586  /* Move the constraint from the old to the new index */
1587  constraintTuple = SearchSysCacheCopy1(CONSTROID,
1588  ObjectIdGetDatum(constraintOid));
1589  if (!HeapTupleIsValid(constraintTuple))
1590  elog(ERROR, "could not find tuple for constraint %u", constraintOid);
1591 
1592  conForm = ((Form_pg_constraint) GETSTRUCT(constraintTuple));
1593 
1594  if (conForm->conindid == oldIndexId)
1595  {
1596  conForm->conindid = newIndexId;
1597 
1598  CatalogTupleUpdate(pg_constraint, &constraintTuple->t_self, constraintTuple);
1599  }
1600 
1601  heap_freetuple(constraintTuple);
1602 
1603  /* Search for trigger records */
1604  ScanKeyInit(&key[0],
1605  Anum_pg_trigger_tgconstraint,
1606  BTEqualStrategyNumber, F_OIDEQ,
1607  ObjectIdGetDatum(constraintOid));
1608 
1609  scan = systable_beginscan(pg_trigger, TriggerConstraintIndexId, true,
1610  NULL, 1, key);
1611 
1612  while (HeapTupleIsValid((triggerTuple = systable_getnext(scan))))
1613  {
1614  Form_pg_trigger tgForm = (Form_pg_trigger) GETSTRUCT(triggerTuple);
1615 
1616  if (tgForm->tgconstrindid != oldIndexId)
1617  continue;
1618 
1619  /* Make a modifiable copy */
1620  triggerTuple = heap_copytuple(triggerTuple);
1621  tgForm = (Form_pg_trigger) GETSTRUCT(triggerTuple);
1622 
1623  tgForm->tgconstrindid = newIndexId;
1624 
1625  CatalogTupleUpdate(pg_trigger, &triggerTuple->t_self, triggerTuple);
1626 
1627  heap_freetuple(triggerTuple);
1628  }
1629 
1630  systable_endscan(scan);
1631  }
1632 
1633  /*
1634  * Move comment if any
1635  */
1636  {
1637  Relation description;
1638  ScanKeyData skey[3];
1639  SysScanDesc sd;
1640  HeapTuple tuple;
1641  Datum values[Natts_pg_description] = {0};
1642  bool nulls[Natts_pg_description] = {0};
1643  bool replaces[Natts_pg_description] = {0};
1644 
1645  values[Anum_pg_description_objoid - 1] = ObjectIdGetDatum(newIndexId);
1646  replaces[Anum_pg_description_objoid - 1] = true;
1647 
1648  ScanKeyInit(&skey[0],
1649  Anum_pg_description_objoid,
1650  BTEqualStrategyNumber, F_OIDEQ,
1651  ObjectIdGetDatum(oldIndexId));
1652  ScanKeyInit(&skey[1],
1653  Anum_pg_description_classoid,
1654  BTEqualStrategyNumber, F_OIDEQ,
1655  ObjectIdGetDatum(RelationRelationId));
1656  ScanKeyInit(&skey[2],
1657  Anum_pg_description_objsubid,
1658  BTEqualStrategyNumber, F_INT4EQ,
1659  Int32GetDatum(0));
1660 
1661  description = table_open(DescriptionRelationId, RowExclusiveLock);
1662 
1663  sd = systable_beginscan(description, DescriptionObjIndexId, true,
1664  NULL, 3, skey);
1665 
1666  while ((tuple = systable_getnext(sd)) != NULL)
1667  {
1668  tuple = heap_modify_tuple(tuple, RelationGetDescr(description),
1669  values, nulls, replaces);
1670  CatalogTupleUpdate(description, &tuple->t_self, tuple);
1671 
1672  break; /* Assume there can be only one match */
1673  }
1674 
1675  systable_endscan(sd);
1676  table_close(description, NoLock);
1677  }
1678 
1679  /*
1680  * Swap inheritance relationship with parent index
1681  */
1682  if (get_rel_relispartition(oldIndexId))
1683  {
1684  List *ancestors = get_partition_ancestors(oldIndexId);
1685  Oid parentIndexRelid = linitial_oid(ancestors);
1686 
1687  DeleteInheritsTuple(oldIndexId, parentIndexRelid, false, NULL);
1688  StoreSingleInheritance(newIndexId, parentIndexRelid, 1);
1689 
1690  list_free(ancestors);
1691  }
1692 
1693  /*
1694  * Swap all dependencies of and on the old index to the new one, and
1695  * vice-versa. Note that a call to CommandCounterIncrement() would cause
1696  * duplicate entries in pg_depend, so this should not be done.
1697  */
1698  changeDependenciesOf(RelationRelationId, newIndexId, oldIndexId);
1699  changeDependenciesOn(RelationRelationId, newIndexId, oldIndexId);
1700 
1701  changeDependenciesOf(RelationRelationId, oldIndexId, newIndexId);
1702  changeDependenciesOn(RelationRelationId, oldIndexId, newIndexId);
1703 
1704  /*
1705  * Copy over statistics from old to new index
1706  */
1707  {
1708  PgStat_StatTabEntry *tabentry;
1709 
1710  tabentry = pgstat_fetch_stat_tabentry(oldIndexId);
1711  if (tabentry)
1712  {
1713  if (newClassRel->pgstat_info)
1714  {
1715  newClassRel->pgstat_info->t_counts.t_numscans = tabentry->numscans;
1716  newClassRel->pgstat_info->t_counts.t_tuples_returned = tabentry->tuples_returned;
1717  newClassRel->pgstat_info->t_counts.t_tuples_fetched = tabentry->tuples_fetched;
1718  newClassRel->pgstat_info->t_counts.t_blocks_fetched = tabentry->blocks_fetched;
1719  newClassRel->pgstat_info->t_counts.t_blocks_hit = tabentry->blocks_hit;
1720 
1721  /*
1722  * The data will be sent by the next pgstat_report_stat()
1723  * call.
1724  */
1725  }
1726  }
1727  }
1728 
1729  /* Copy data of pg_statistic from the old index to the new one */
1730  CopyStatistics(oldIndexId, newIndexId);
1731 
1732  /* Copy pg_attribute.attstattarget for each index attribute */
1733  {
1734  HeapTuple attrTuple;
1735  Relation pg_attribute;
1736  SysScanDesc scan;
1737  ScanKeyData key[1];
1738 
1739  pg_attribute = table_open(AttributeRelationId, RowExclusiveLock);
1740  ScanKeyInit(&key[0],
1741  Anum_pg_attribute_attrelid,
1742  BTEqualStrategyNumber, F_OIDEQ,
1743  ObjectIdGetDatum(newIndexId));
1744  scan = systable_beginscan(pg_attribute, AttributeRelidNumIndexId,
1745  true, NULL, 1, key);
1746 
1747  while (HeapTupleIsValid((attrTuple = systable_getnext(scan))))
1748  {
1749  Form_pg_attribute att = (Form_pg_attribute) GETSTRUCT(attrTuple);
1750  Datum repl_val[Natts_pg_attribute];
1751  bool repl_null[Natts_pg_attribute];
1752  bool repl_repl[Natts_pg_attribute];
1753  int attstattarget;
1754  HeapTuple newTuple;
1755 
1756  /* Ignore dropped columns */
1757  if (att->attisdropped)
1758  continue;
1759 
1760  /*
1761  * Get attstattarget from the old index and refresh the new value.
1762  */
1763  attstattarget = get_attstattarget(oldIndexId, att->attnum);
1764 
1765  /* no need for a refresh if both match */
1766  if (attstattarget == att->attstattarget)
1767  continue;
1768 
1769  memset(repl_val, 0, sizeof(repl_val));
1770  memset(repl_null, false, sizeof(repl_null));
1771  memset(repl_repl, false, sizeof(repl_repl));
1772 
1773  repl_repl[Anum_pg_attribute_attstattarget - 1] = true;
1774  repl_val[Anum_pg_attribute_attstattarget - 1] = Int32GetDatum(attstattarget);
1775 
1776  newTuple = heap_modify_tuple(attrTuple,
1777  RelationGetDescr(pg_attribute),
1778  repl_val, repl_null, repl_repl);
1779  CatalogTupleUpdate(pg_attribute, &newTuple->t_self, newTuple);
1780 
1781  heap_freetuple(newTuple);
1782  }
1783 
1784  systable_endscan(scan);
1785  table_close(pg_attribute, RowExclusiveLock);
1786  }
1787 
1788  /* Close relations */
1789  table_close(pg_class, RowExclusiveLock);
1790  table_close(pg_index, RowExclusiveLock);
1791  table_close(pg_constraint, RowExclusiveLock);
1792  table_close(pg_trigger, RowExclusiveLock);
1793 
1794  /* The lock taken previously is not released until the end of transaction */
1795  relation_close(oldClassRel, NoLock);
1796  relation_close(newClassRel, NoLock);
1797 }
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:167
#define DescriptionObjIndexId
bool DeleteInheritsTuple(Oid inhrelid, Oid inhparent, bool expect_detach_pending, const char *childname)
Definition: pg_inherits.c:553
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:595
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
#define TriggerConstraintIndexId
Definition: pg_trigger.h:85
PgStat_Counter tuples_returned
Definition: pgstat.h:809
#define RelationGetDescr(relation)
Definition: rel.h:495
PgStat_Counter t_tuples_fetched
Definition: pgstat.h:120
void namestrcpy(Name name, const char *str)
Definition: name.c:233
PgStat_Counter numscans
Definition: pgstat.h:807
PgStat_TableCounts t_counts
Definition: pgstat.h:177
void CopyStatistics(Oid fromrelid, Oid torelid)
Definition: heap.c:3172
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
List * lappend_oid(List *list, Oid datum)
Definition: list.c:372
#define OidIsValid(objectId)
Definition: c.h:710
PgStat_Counter t_tuples_returned
Definition: pgstat.h:119
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:383
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:502
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
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:2742
#define NoLock
Definition: lockdefs.h:34
#define AttributeRelidNumIndexId
Definition: pg_attribute.h:208
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:203
PgStat_Counter tuples_fetched
Definition: pgstat.h:810
Oid get_index_constraint(Oid indexId)
Definition: pg_depend.c:938
void StoreSingleInheritance(Oid relationId, Oid parentOid, int32 seqNumber)
Definition: pg_inherits.c:509
PgStat_Counter t_blocks_hit
Definition: pgstat.h:133
bool get_rel_relispartition(Oid relid)
Definition: lsyscache.c:1998
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
int get_attstattarget(Oid relid, AttrNumber attnum)
Definition: lsyscache.c:883
uintptr_t Datum
Definition: postgres.h:411
PgStat_Counter blocks_hit
Definition: pgstat.h:824
PgStat_Counter t_numscans
Definition: pgstat.h:117
long changeDependenciesOf(Oid classId, Oid oldObjectId, Oid newObjectId)
Definition: pg_depend.c:498
#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:176
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:301
struct PgStat_TableStatus * pgstat_info
Definition: rel.h:249
FormData_pg_trigger * Form_pg_trigger
Definition: pg_trigger.h:80
List * get_index_ref_constraints(Oid indexId)
Definition: pg_depend.c:994
static Datum values[MAXATTR]
Definition: bootstrap.c:166
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:175
#define Int32GetDatum(X)
Definition: postgres.h:523
void list_free(List *list)
Definition: list.c:1391
#define elog(elevel,...)
Definition: elog.h:232
#define NameStr(name)
Definition: c.h:681
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:823
Definition: pg_list.h:50
long changeDependenciesOn(Oid refClassId, Oid oldRefObjectId, Oid newRefObjectId)
Definition: pg_depend.c:554
List * get_partition_ancestors(Oid relid)
Definition: partition.c:133
#define BTEqualStrategyNumber
Definition: stratnum.h:31
PgStat_Counter t_blocks_fetched
Definition: pgstat.h:132
#define lfirst_oid(lc)
Definition: pg_list.h:171

◆ 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 1869 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::replace, CreateTrigStmt::row, RowExclusiveLock, SearchSysCacheCopy1, SystemFuncName(), HeapTupleData::t_self, table_close(), table_open(), CreateTrigStmt::timing, CreateTrigStmt::transitionRels, CreateTrigStmt::trigname, and CreateTrigStmt::whenClause.

Referenced by ATExecAddIndexConstraint(), and index_create().

1878 {
1879  Oid namespaceId = RelationGetNamespace(heapRelation);
1880  ObjectAddress myself,
1881  idxaddr;
1882  Oid conOid;
1883  bool deferrable;
1884  bool initdeferred;
1885  bool mark_as_primary;
1886  bool islocal;
1887  bool noinherit;
1888  int inhcount;
1889 
1890  deferrable = (constr_flags & INDEX_CONSTR_CREATE_DEFERRABLE) != 0;
1891  initdeferred = (constr_flags & INDEX_CONSTR_CREATE_INIT_DEFERRED) != 0;
1892  mark_as_primary = (constr_flags & INDEX_CONSTR_CREATE_MARK_AS_PRIMARY) != 0;
1893 
1894  /* constraint creation support doesn't work while bootstrapping */
1896 
1897  /* enforce system-table restriction */
1898  if (!allow_system_table_mods &&
1899  IsSystemRelation(heapRelation) &&
1901  ereport(ERROR,
1902  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1903  errmsg("user-defined indexes on system catalog tables are not supported")));
1904 
1905  /* primary/unique constraints shouldn't have any expressions */
1906  if (indexInfo->ii_Expressions &&
1907  constraintType != CONSTRAINT_EXCLUSION)
1908  elog(ERROR, "constraints cannot have index expressions");
1909 
1910  /*
1911  * If we're manufacturing a constraint for a pre-existing index, we need
1912  * to get rid of the existing auto dependencies for the index (the ones
1913  * that index_create() would have made instead of calling this function).
1914  *
1915  * Note: this code would not necessarily do the right thing if the index
1916  * has any expressions or predicate, but we'd never be turning such an
1917  * index into a UNIQUE or PRIMARY KEY constraint.
1918  */
1919  if (constr_flags & INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS)
1920  deleteDependencyRecordsForClass(RelationRelationId, indexRelationId,
1921  RelationRelationId, DEPENDENCY_AUTO);
1922 
1923  if (OidIsValid(parentConstraintId))
1924  {
1925  islocal = false;
1926  inhcount = 1;
1927  noinherit = false;
1928  }
1929  else
1930  {
1931  islocal = true;
1932  inhcount = 0;
1933  noinherit = true;
1934  }
1935 
1936  /*
1937  * Construct a pg_constraint entry.
1938  */
1939  conOid = CreateConstraintEntry(constraintName,
1940  namespaceId,
1941  constraintType,
1942  deferrable,
1943  initdeferred,
1944  true,
1945  parentConstraintId,
1946  RelationGetRelid(heapRelation),
1947  indexInfo->ii_IndexAttrNumbers,
1948  indexInfo->ii_NumIndexKeyAttrs,
1949  indexInfo->ii_NumIndexAttrs,
1950  InvalidOid, /* no domain */
1951  indexRelationId, /* index OID */
1952  InvalidOid, /* no foreign key */
1953  NULL,
1954  NULL,
1955  NULL,
1956  NULL,
1957  0,
1958  ' ',
1959  ' ',
1960  ' ',
1961  indexInfo->ii_ExclusionOps,
1962  NULL, /* no check constraint */
1963  NULL,
1964  islocal,
1965  inhcount,
1966  noinherit,
1967  is_internal);
1968 
1969  /*
1970  * Register the index as internally dependent on the constraint.
1971  *
1972  * Note that the constraint has a dependency on the table, so we don't
1973  * need (or want) any direct dependency from the index to the table.
1974  */
1975  ObjectAddressSet(myself, ConstraintRelationId, conOid);
1976  ObjectAddressSet(idxaddr, RelationRelationId, indexRelationId);
1977  recordDependencyOn(&idxaddr, &myself, DEPENDENCY_INTERNAL);
1978 
1979  /*
1980  * Also, if this is a constraint on a partition, give it partition-type
1981  * dependencies on the parent constraint as well as the table.
1982  */
1983  if (OidIsValid(parentConstraintId))
1984  {
1985  ObjectAddress referenced;
1986 
1987  ObjectAddressSet(referenced, ConstraintRelationId, parentConstraintId);
1988  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_PRI);
1989  ObjectAddressSet(referenced, RelationRelationId,
1990  RelationGetRelid(heapRelation));
1991  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_SEC);
1992  }
1993 
1994  /*
1995  * If the constraint is deferrable, create the deferred uniqueness
1996  * checking trigger. (The trigger will be given an internal dependency on
1997  * the constraint by CreateTrigger.)
1998  */
1999  if (deferrable)
2000  {
2002 
2003  trigger->replace = false;
2004  trigger->isconstraint = true;
2005  trigger->trigname = (constraintType == CONSTRAINT_PRIMARY) ?
2006  "PK_ConstraintTrigger" :
2007  "Unique_ConstraintTrigger";
2008  trigger->relation = NULL;
2009  trigger->funcname = SystemFuncName("unique_key_recheck");
2010  trigger->args = NIL;
2011  trigger->row = true;
2012  trigger->timing = TRIGGER_TYPE_AFTER;
2013  trigger->events = TRIGGER_TYPE_INSERT | TRIGGER_TYPE_UPDATE;
2014  trigger->columns = NIL;
2015  trigger->whenClause = NULL;
2016  trigger->transitionRels = NIL;
2017  trigger->deferrable = true;
2018  trigger->initdeferred = initdeferred;
2019  trigger->constrrel = NULL;
2020 
2021  (void) CreateTrigger(trigger, NULL, RelationGetRelid(heapRelation),
2022  InvalidOid, conOid, indexRelationId, InvalidOid,
2023  InvalidOid, NULL, true, false);
2024  }
2025 
2026  /*
2027  * If needed, mark the index as primary and/or deferred in pg_index.
2028  *
2029  * Note: When making an existing index into a constraint, caller must have
2030  * a table lock that prevents concurrent table updates; otherwise, there
2031  * is a risk that concurrent readers of the table will miss seeing this
2032  * index at all.
2033  */
2034  if ((constr_flags & INDEX_CONSTR_CREATE_UPDATE_INDEX) &&
2035  (mark_as_primary || deferrable))
2036  {
2037  Relation pg_index;
2038  HeapTuple indexTuple;
2039  Form_pg_index indexForm;
2040  bool dirty = false;
2041 
2042  pg_index = table_open(IndexRelationId, RowExclusiveLock);
2043 
2044  indexTuple = SearchSysCacheCopy1(INDEXRELID,
2045  ObjectIdGetDatum(indexRelationId));
2046  if (!HeapTupleIsValid(indexTuple))
2047  elog(ERROR, "cache lookup failed for index %u", indexRelationId);
2048  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
2049 
2050  if (mark_as_primary && !indexForm->indisprimary)
2051  {
2052  indexForm->indisprimary = true;
2053  dirty = true;
2054  }
2055 
2056  if (deferrable && indexForm->indimmediate)
2057  {
2058  indexForm->indimmediate = false;
2059  dirty = true;
2060  }
2061 
2062  if (dirty)
2063  {
2064  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
2065 
2066  InvokeObjectPostAlterHookArg(IndexRelationId, indexRelationId, 0,
2067  InvalidOid, is_internal);
2068  }
2069 
2070  heap_freetuple(indexTuple);
2071  table_close(pg_index, RowExclusiveLock);
2072  }
2073 
2074  return myself;
2075 }
#define NIL
Definition: pg_list.h:65
List * SystemFuncName(char *name)
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
bool IsSystemRelation(Relation relation)
Definition: catalog.c:73
Node * whenClause
Definition: parsenodes.h:2529
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:698
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:93
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:710
#define InvokeObjectPostAlterHookArg(classId, objectId, subId, auxiliaryId, is_internal)
Definition: objectaccess.h:178
#define INDEX_CONSTR_CREATE_INIT_DEFERRED
Definition: index.h:91
RangeVar * constrrel
Definition: parsenodes.h:2535
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
int ii_NumIndexKeyAttrs
Definition: execnodes.h:159
ItemPointerData t_self
Definition: htup.h:65
#define IsNormalProcessingMode()
Definition: miscadmin.h:396
#define RowExclusiveLock
Definition: lockdefs.h:38
List * transitionRels
Definition: parsenodes.h:2531
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
int ii_NumIndexAttrs
Definition: execnodes.h:158
long deleteDependencyRecordsForClass(Oid classId, Oid objectId, Oid refclassId, char deptype)
Definition: pg_depend.c:282
#define InvalidOid
Definition: postgres_ext.h:36
#define ereport(elevel,...)
Definition: elog.h:157
#define makeNode(_type_)
Definition: nodes.h:587
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
List * ii_Expressions
Definition: execnodes.h:161
#define Assert(condition)
Definition: c.h:804
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:301
#define INDEX_CONSTR_CREATE_UPDATE_INDEX
Definition: index.h:92
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:394
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:175
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:909
#define elog(elevel,...)
Definition: elog.h:232
RangeVar * relation
Definition: parsenodes.h:2520
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:150
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:469
#define INDEX_CONSTR_CREATE_DEFERRABLE
Definition: index.h:90
#define INDEX_CONSTR_CREATE_MARK_AS_PRIMARY
Definition: index.h:89
#define RelationGetNamespace(relation)
Definition: rel.h:510

◆ 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 696 of file index.c.

References AccessExclusiveLock, add_exact_object_address(), AppendAttributeTuples(), Assert, binary_upgrade_next_index_pg_class_oid, CacheInvalidateRelcache(), CLAOID, CommandCounterIncrement(), CONSTRAINT_RELATION, ConstraintNameIsUsed(), ConstructTupleDescriptor(), DEPENDENCY_AUTO, DEPENDENCY_NORMAL, DEPENDENCY_PARTITION_PRI, DEPENDENCY_PARTITION_SEC, elog, ereport, errcode(), ERRCODE_DUPLICATE_OBJECT, errmsg(), ERROR, free_object_addresses(), 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, new_object_addresses(), NoLock, NOTICE, ObjectAddressSet, ObjectAddressSubSet, ObjectAddress::objectId, ObjectIdGetDatum, OidIsValid, RelationData::rd_index, RelationData::rd_indexcxt, RelationData::rd_rel, record_object_address_dependencies(), 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().

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

◆ index_drop()

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

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

2090 {
2091  Oid heapId;
2092  Relation userHeapRelation;
2093  Relation userIndexRelation;
2094  Relation indexRelation;
2095  HeapTuple tuple;
2096  bool hasexprs;
2097  LockRelId heaprelid,
2098  indexrelid;
2099  LOCKTAG heaplocktag;
2100  LOCKMODE lockmode;
2101 
2102  /*
2103  * A temporary relation uses a non-concurrent DROP. Other backends can't
2104  * access a temporary relation, so there's no harm in grabbing a stronger
2105  * lock (see comments in RemoveRelations), and a non-concurrent DROP is
2106  * more efficient.
2107  */
2108  Assert(get_rel_persistence(indexId) != RELPERSISTENCE_TEMP ||
2109  (!concurrent && !concurrent_lock_mode));
2110 
2111  /*
2112  * To drop an index safely, we must grab exclusive lock on its parent
2113  * table. Exclusive lock on the index alone is insufficient because
2114  * another backend might be about to execute a query on the parent table.
2115  * If it relies on a previously cached list of index OIDs, then it could
2116  * attempt to access the just-dropped index. We must therefore take a
2117  * table lock strong enough to prevent all queries on the table from
2118  * proceeding until we commit and send out a shared-cache-inval notice
2119  * that will make them update their index lists.
2120  *
2121  * In the concurrent case we avoid this requirement by disabling index use
2122  * in multiple steps and waiting out any transactions that might be using
2123  * the index, so we don't need exclusive lock on the parent table. Instead
2124  * we take ShareUpdateExclusiveLock, to ensure that two sessions aren't
2125  * doing CREATE/DROP INDEX CONCURRENTLY on the same index. (We will get
2126  * AccessExclusiveLock on the index below, once we're sure nobody else is
2127  * using it.)
2128  */
2129  heapId = IndexGetRelation(indexId, false);
2130  lockmode = (concurrent || concurrent_lock_mode) ? ShareUpdateExclusiveLock : AccessExclusiveLock;
2131  userHeapRelation = table_open(heapId, lockmode);
2132  userIndexRelation = index_open(indexId, lockmode);
2133 
2134  /*
2135  * We might still have open queries using it in our own session, which the
2136  * above locking won't prevent, so test explicitly.
2137  */
2138  CheckTableNotInUse(userIndexRelation, "DROP INDEX");
2139 
2140  /*
2141  * Drop Index Concurrently is more or less the reverse process of Create
2142  * Index Concurrently.
2143  *
2144  * First we unset indisvalid so queries starting afterwards don't use the
2145  * index to answer queries anymore. We have to keep indisready = true so
2146  * transactions that are still scanning the index can continue to see
2147  * valid index contents. For instance, if they are using READ COMMITTED
2148  * mode, and another transaction makes changes and commits, they need to
2149  * see those new tuples in the index.
2150  *
2151  * After all transactions that could possibly have used the index for
2152  * queries end, we can unset indisready and indislive, then wait till
2153  * nobody could be touching it anymore. (Note: we need indislive because
2154  * this state must be distinct from the initial state during CREATE INDEX
2155  * CONCURRENTLY, which has indislive true while indisready and indisvalid
2156  * are false. That's because in that state, transactions must examine the
2157  * index for HOT-safety decisions, while in this state we don't want them
2158  * to open it at all.)
2159  *
2160  * Since all predicate locks on the index are about to be made invalid, we
2161  * must promote them to predicate locks on the heap. In the
2162  * non-concurrent case we can just do that now. In the concurrent case
2163  * it's a bit trickier. The predicate locks must be moved when there are
2164  * no index scans in progress on the index and no more can subsequently
2165  * start, so that no new predicate locks can be made on the index. Also,
2166  * they must be moved before heap inserts stop maintaining the index, else
2167  * the conflict with the predicate lock on the index gap could be missed
2168  * before the lock on the heap relation is in place to detect a conflict
2169  * based on the heap tuple insert.
2170  */
2171  if (concurrent)
2172  {
2173  /*
2174  * We must commit our transaction in order to make the first pg_index
2175  * state update visible to other sessions. If the DROP machinery has
2176  * already performed any other actions (removal of other objects,
2177  * pg_depend entries, etc), the commit would make those actions
2178  * permanent, which would leave us with inconsistent catalog state if
2179  * we fail partway through the following sequence. Since DROP INDEX
2180  * CONCURRENTLY is restricted to dropping just one index that has no
2181  * dependencies, we should get here before anything's been done ---
2182  * but let's check that to be sure. We can verify that the current
2183  * transaction has not executed any transactional updates by checking
2184  * that no XID has been assigned.
2185  */
2187  ereport(ERROR,
2188  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2189  errmsg("DROP INDEX CONCURRENTLY must be first action in transaction")));
2190 
2191  /*
2192  * Mark index invalid by updating its pg_index entry
2193  */
2195 
2196  /*
2197  * Invalidate the relcache for the table, so that after this commit
2198  * all sessions will refresh any cached plans that might reference the
2199  * index.
2200  */
2201  CacheInvalidateRelcache(userHeapRelation);
2202 
2203  /* save lockrelid and locktag for below, then close but keep locks */
2204  heaprelid = userHeapRelation->rd_lockInfo.lockRelId;
2205  SET_LOCKTAG_RELATION(heaplocktag, heaprelid.dbId, heaprelid.relId);
2206  indexrelid = userIndexRelation->rd_lockInfo.lockRelId;
2207 
2208  table_close(userHeapRelation, NoLock);
2209  index_close(userIndexRelation, NoLock);
2210 
2211  /*
2212  * We must commit our current transaction so that the indisvalid
2213  * update becomes visible to other transactions; then start another.
2214  * Note that any previously-built data structures are lost in the
2215  * commit. The only data we keep past here are the relation IDs.
2216  *
2217  * Before committing, get a session-level lock on the table, to ensure
2218  * that neither it nor the index can be dropped before we finish. This
2219  * cannot block, even if someone else is waiting for access, because
2220  * we already have the same lock within our transaction.
2221  */
2224 
2228 
2229  /*
2230  * Now we must wait until no running transaction could be using the
2231  * index for a query. Use AccessExclusiveLock here to check for
2232  * running transactions that hold locks of any kind on the table. Note
2233  * we do not need to worry about xacts that open the table for reading
2234  * after this point; they will see the index as invalid when they open
2235  * the relation.
2236  *
2237  * Note: the reason we use actual lock acquisition here, rather than
2238  * just checking the ProcArray and sleeping, is that deadlock is
2239  * possible if one of the transactions in question is blocked trying
2240  * to acquire an exclusive lock on our table. The lock code will
2241  * detect deadlock and error out properly.
2242  *
2243  * Note: we report progress through WaitForLockers() unconditionally
2244  * here, even though it will only be used when we're called by REINDEX
2245  * CONCURRENTLY and not when called by DROP INDEX CONCURRENTLY.
2246  */
2247  WaitForLockers(heaplocktag, AccessExclusiveLock, true);
2248 
2249  /* Finish invalidation of index and mark it as dead */
2250  index_concurrently_set_dead(heapId, indexId);
2251 
2252  /*
2253  * Again, commit the transaction to make the pg_index update visible
2254  * to other sessions.
2255  */
2258 
2259  /*
2260  * Wait till every transaction that saw the old index state has
2261  * finished. See above about progress reporting.
2262  */
2263  WaitForLockers(heaplocktag, AccessExclusiveLock, true);
2264 
2265  /*
2266  * Re-open relations to allow us to complete our actions.
2267  *
2268  * At this point, nothing should be accessing the index, but lets
2269  * leave nothing to chance and grab AccessExclusiveLock on the index
2270  * before the physical deletion.
2271  */
2272  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
2273  userIndexRelation = index_open(indexId, AccessExclusiveLock);
2274  }
2275  else
2276  {
2277  /* Not concurrent, so just transfer predicate locks and we're good */
2278  TransferPredicateLocksToHeapRelation(userIndexRelation);
2279  }
2280 
2281  /*
2282  * Schedule physical removal of the files (if any)
2283  */
2284  if (userIndexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
2285  RelationDropStorage(userIndexRelation);
2286 
2287  /*
2288  * Close and flush the index's relcache entry, to ensure relcache doesn't
2289  * try to rebuild it while we're deleting catalog entries. We keep the
2290  * lock though.
2291  */
2292  index_close(userIndexRelation, NoLock);
2293 
2294  RelationForgetRelation(indexId);
2295 
2296  /*
2297  * fix INDEX relation, and check for expressional index
2298  */
2299  indexRelation = table_open(IndexRelationId, RowExclusiveLock);
2300 
2301  tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
2302  if (!HeapTupleIsValid(tuple))
2303  elog(ERROR, "cache lookup failed for index %u", indexId);
2304 
2305  hasexprs = !heap_attisnull(tuple, Anum_pg_index_indexprs,
2306  RelationGetDescr(indexRelation));
2307 
2308  CatalogTupleDelete(indexRelation, &tuple->t_self);
2309 
2310  ReleaseSysCache(tuple);
2311  table_close(indexRelation, RowExclusiveLock);
2312 
2313  /*
2314  * if it has any expression columns, we might have stored statistics about
2315  * them.
2316  */
2317  if (hasexprs)
2318  RemoveStatistics(indexId, 0);
2319 
2320  /*
2321  * fix ATTRIBUTE relation
2322  */
2323  DeleteAttributeTuples(indexId);
2324 
2325  /*
2326  * fix RELATION relation
2327  */
2328  DeleteRelationTuple(indexId);
2329 
2330  /*
2331  * fix INHERITS relation
2332  */
2333  DeleteInheritsTuple(indexId, InvalidOid, false, NULL);
2334 
2335  /*
2336  * We are presently too lazy to attempt to compute the new correct value
2337  * of relhasindex (the next VACUUM will fix it if necessary). So there is
2338  * no need to update the pg_class tuple for the owning relation. But we
2339  * must send out a shared-cache-inval notice on the owning relation to
2340  * ensure other backends update their relcache lists of indexes. (In the
2341  * concurrent case, this is redundant but harmless.)
2342  */
2343  CacheInvalidateRelcache(userHeapRelation);
2344 
2345  /*
2346  * Close owning rel, but keep lock
2347  */
2348  table_close(userHeapRelation, NoLock);
2349 
2350  /*
2351  * Release the session locks before we go.
2352  */
2353  if (concurrent)
2354  {
2357  }
2358 }
void WaitForLockers(LOCKTAG heaplocktag, LOCKMODE lockmode, bool progress)
Definition: lmgr.c:957
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3474
LockRelId lockRelId
Definition: rel.h:44
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
bool DeleteInheritsTuple(Oid inhrelid, Oid inhparent, bool expect_detach_pending, const char *childname)
Definition: pg_inherits.c:553
#define RelationGetDescr(relation)
Definition: rel.h:495
int LOCKMODE
Definition: lockdefs.h:26
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3393
void CommitTransactionCommand(void)
Definition: xact.c:2939
Oid dbId
Definition: rel.h:39
Definition: lock.h:166
int errcode(int sqlerrcode)
Definition: elog.c:698
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Definition: heaptuple.c:359
void RelationForgetRelation(Oid rid)
Definition: relcache.c:2750
void PopActiveSnapshot(void)
Definition: snapmgr.c:759
void CatalogTupleDelete(Relation heapRel, ItemPointer tid)
Definition: indexing.c:350
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
void UnlockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:383
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
Definition: rel.h:36
void LockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:370
ItemPointerData t_self
Definition: htup.h:65
#define SET_LOCKTAG_RELATION(locktag, dboid, reloid)
Definition: lock.h:183
#define NoLock
Definition: lockdefs.h:34
LockInfoData rd_lockInfo
Definition: rel.h:112
#define RowExclusiveLock
Definition: lockdefs.h:38
#define InvalidTransactionId
Definition: transam.h:31
TransactionId GetTopTransactionIdIfAny(void)
Definition: xact.c:425
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:3929
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3146
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1127
void RelationDropStorage(Relation rel)
Definition: storage.c:195
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1175
#define InvalidOid
Definition: postgres_ext.h:36
#define ereport(elevel,...)
Definition: elog.h:157
void DeleteRelationTuple(Oid relid)
Definition: heap.c:1555
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:804
void StartTransactionCommand(void)
Definition: xact.c:2838
void DeleteAttributeTuples(Oid relid)
Definition: heap.c:1584
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1278
void RemoveStatistics(Oid relid, AttrNumber attnum)
Definition: heap.c:3217
char get_rel_persistence(Oid relid)
Definition: lsyscache.c:2049
#define AccessExclusiveLock
Definition: lockdefs.h:45
int errmsg(const char *fmt,...)
Definition: elog.c:909
#define elog(elevel,...)
Definition: elog.h:232
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
void index_concurrently_set_dead(Oid heapId, Oid indexId)
Definition: index.c:1808
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 3393 of file index.c.

References Assert, CatalogTupleUpdate(), elog, ERROR, GETSTRUCT, HeapTupleIsValid, INDEX_CREATE_SET_READY, INDEX_CREATE_SET_VALID, INDEX_DROP_CLEAR_VALID, INDEX_DROP_SET_DEAD, INDEXRELID, ObjectIdGetDatum, RowExclusiveLock, SearchSysCacheCopy1, HeapTupleData::t_self, table_close(), and table_open().

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

3394 {
3395  Relation pg_index;
3396  HeapTuple indexTuple;
3397  Form_pg_index indexForm;
3398 
3399  /* Open pg_index and fetch a writable copy of the index's tuple */
3400  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3401 
3402  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3403  ObjectIdGetDatum(indexId));
3404  if (!HeapTupleIsValid(indexTuple))
3405  elog(ERROR, "cache lookup failed for index %u", indexId);
3406  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3407 
3408  /* Perform the requested state change on the copy */
3409  switch (action)
3410  {
3412  /* Set indisready during a CREATE INDEX CONCURRENTLY sequence */
3413  Assert(indexForm->indislive);
3414  Assert(!indexForm->indisready);
3415  Assert(!indexForm->indisvalid);
3416  indexForm->indisready = true;
3417  break;
3419  /* Set indisvalid during a CREATE INDEX CONCURRENTLY sequence */
3420  Assert(indexForm->indislive);
3421  Assert(indexForm->indisready);
3422  Assert(!indexForm->indisvalid);
3423  indexForm->indisvalid = true;
3424  break;
3426 
3427  /*
3428  * Clear indisvalid during a DROP INDEX CONCURRENTLY sequence
3429  *
3430  * If indisready == true we leave it set so the index still gets
3431  * maintained by active transactions. We only need to ensure that
3432  * indisvalid is false. (We don't assert that either is initially
3433  * true, though, since we want to be able to retry a DROP INDEX
3434  * CONCURRENTLY that failed partway through.)
3435  *
3436  * Note: the CLUSTER logic assumes that indisclustered cannot be
3437  * set on any invalid index, so clear that flag too. Similarly,
3438  * ALTER TABLE assumes that indisreplident cannot be set for
3439  * invalid indexes.
3440  */
3441  indexForm->indisvalid = false;
3442  indexForm->indisclustered = false;
3443  indexForm->indisreplident = false;
3444  break;
3445  case INDEX_DROP_SET_DEAD:
3446 
3447  /*
3448  * Clear indisready/indislive during DROP INDEX CONCURRENTLY
3449  *
3450  * We clear both indisready and indislive, because we not only
3451  * want to stop updates, we want to prevent sessions from touching
3452  * the index at all.
3453  */
3454  Assert(!indexForm->indisvalid);
3455  Assert(!indexForm->indisclustered);
3456  Assert(!indexForm->indisreplident);
3457  indexForm->indisready = false;
3458  indexForm->indislive = false;
3459  break;
3460  }
3461 
3462  /* ... and update it */
3463  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
3464 
3465  table_close(pg_index, RowExclusiveLock);
3466 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
ItemPointerData t_self
Definition: htup.h:65
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:804
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:301
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:175
#define elog(elevel,...)
Definition: elog.h:232
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 2739 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().

2742 {
2743  Oid relid = RelationGetRelid(rel);
2744  Relation pg_class;
2745  HeapTuple tuple;
2746  Form_pg_class rd_rel;
2747  bool dirty;
2748 
2749  /*
2750  * We always update the pg_class row using a non-transactional,
2751  * overwrite-in-place update. There are several reasons for this:
2752  *
2753  * 1. In bootstrap mode, we have no choice --- UPDATE wouldn't work.
2754  *
2755  * 2. We could be reindexing pg_class itself, in which case we can't move
2756  * its pg_class row because CatalogTupleInsert/CatalogTupleUpdate might
2757  * not know about all the indexes yet (see reindex_relation).
2758  *
2759  * 3. Because we execute CREATE INDEX with just share lock on the parent
2760  * rel (to allow concurrent index creations), an ordinary update could
2761  * suffer a tuple-concurrently-updated failure against another CREATE
2762  * INDEX committing at about the same time. We can avoid that by having
2763  * them both do nontransactional updates (we assume they will both be
2764  * trying to change the pg_class row to the same thing, so it doesn't
2765  * matter which goes first).
2766  *
2767  * It is safe to use a non-transactional update even though our
2768  * transaction could still fail before committing. Setting relhasindex
2769  * true is safe even if there are no indexes (VACUUM will eventually fix
2770  * it). And of course the new relpages and reltuples counts are correct
2771  * regardless. However, we don't want to change relpages (or
2772  * relallvisible) if the caller isn't providing an updated reltuples
2773  * count, because that would bollix the reltuples/relpages ratio which is
2774  * what's really important.
2775  */
2776 
2777  pg_class = table_open(RelationRelationId, RowExclusiveLock);
2778 
2779  /*
2780  * Make a copy of the tuple to update. Normally we use the syscache, but
2781  * we can't rely on that during bootstrap or while reindexing pg_class
2782  * itself.
2783  */
2784  if (IsBootstrapProcessingMode() ||
2785  ReindexIsProcessingHeap(RelationRelationId))
2786  {
2787  /* don't assume syscache will work */
2788  TableScanDesc pg_class_scan;
2789  ScanKeyData key[1];
2790 
2791  ScanKeyInit(&key[0],
2792  Anum_pg_class_oid,
2793  BTEqualStrategyNumber, F_OIDEQ,
2794  ObjectIdGetDatum(relid));
2795 
2796  pg_class_scan = table_beginscan_catalog(pg_class, 1, key);
2797  tuple = heap_getnext(pg_class_scan, ForwardScanDirection);
2798  tuple = heap_copytuple(tuple);
2799  table_endscan(pg_class_scan);
2800  }
2801  else
2802  {
2803  /* normal case, use syscache */
2804  tuple = SearchSysCacheCopy1(RELOID, ObjectIdGetDatum(relid));
2805  }
2806 
2807  if (!HeapTupleIsValid(tuple))
2808  elog(ERROR, "could not find tuple for relation %u", relid);
2809  rd_rel = (Form_pg_class) GETSTRUCT(tuple);
2810 
2811  /* Should this be a more comprehensive test? */
2812  Assert(rd_rel->relkind != RELKIND_PARTITIONED_INDEX);
2813 
2814  /*
2815  * As a special hack, if we are dealing with an empty table and the
2816  * existing reltuples is -1, we leave that alone. This ensures that
2817  * creating an index as part of CREATE TABLE doesn't cause the table to
2818  * prematurely look like it's been vacuumed.
2819  */
2820  if (reltuples == 0 && rd_rel->reltuples < 0)
2821  reltuples = -1;
2822 
2823  /* Apply required updates, if any, to copied tuple */
2824 
2825  dirty = false;
2826  if (rd_rel->relhasindex != hasindex)
2827  {
2828  rd_rel->relhasindex = hasindex;
2829  dirty = true;
2830  }
2831 
2832  if (reltuples >= 0)
2833  {
2834  BlockNumber relpages = RelationGetNumberOfBlocks(rel);
2835  BlockNumber relallvisible;
2836 
2837  if (rd_rel->relkind != RELKIND_INDEX)
2838  visibilitymap_count(rel, &relallvisible, NULL);
2839  else /* don't bother for indexes */
2840  relallvisible = 0;
2841 
2842  if (rd_rel->relpages != (int32) relpages)
2843  {
2844  rd_rel->relpages = (int32) relpages;
2845  dirty = true;
2846  }
2847  if (rd_rel->reltuples != (float4) reltuples)
2848  {
2849  rd_rel->reltuples = (float4) reltuples;
2850  dirty = true;
2851  }
2852  if (rd_rel->relallvisible != (int32) relallvisible)
2853  {
2854  rd_rel->relallvisible = (int32) relallvisible;
2855  dirty = true;
2856  }
2857  }
2858 
2859  /*
2860  * If anything changed, write out the tuple
2861  */
2862  if (dirty)
2863  {
2864  heap_inplace_update(pg_class, tuple);
2865  /* the above sends a cache inval message */
2866  }
2867  else
2868  {
2869  /* no need to change tuple, but force relcache inval anyway */
2871  }
2872 
2873  heap_freetuple(tuple);
2874 
2875  table_close(pg_class, RowExclusiveLock);
2876 }
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:680
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
TableScanDesc table_beginscan_catalog(Relation relation, int nkeys, struct ScanKeyData *key)
Definition: tableam.c:112
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:429
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
bool ReindexIsProcessingHeap(Oid heapOid)
Definition: index.c:3948
HeapTuple heap_getnext(TableScanDesc sscan, ScanDirection direction)
Definition: heapam.c:1340
#define RowExclusiveLock
Definition: lockdefs.h:38
float float4
Definition: c.h:564
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:213
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:804
static void table_endscan(TableScanDesc scan)
Definition: tableam.h:991
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:394
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:175
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:6048
#define elog(elevel,...)
Definition: elog.h:232
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
void CacheInvalidateRelcacheByTuple(HeapTuple classTuple)
Definition: inval.c:1314
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
#define RelationGetRelid(relation)
Definition: rel.h:469
#define BTEqualStrategyNumber
Definition: stratnum.h:31

◆ IndexCheckExclusion()

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

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

3092 {
3093  TableScanDesc scan;
3095  bool isnull[INDEX_MAX_KEYS];
3096  ExprState *predicate;
3097  TupleTableSlot *slot;
3098  EState *estate;
3099  ExprContext *econtext;
3100  Snapshot snapshot;
3101 
3102  /*
3103  * If we are reindexing the target index, mark it as no longer being
3104  * reindexed, to forestall an Assert in index_beginscan when we try to use
3105  * the index for probes. This is OK because the index is now fully valid.
3106  */
3109 
3110  /*
3111  * Need an EState for evaluation of index expressions and partial-index
3112  * predicates. Also a slot to hold the current tuple.
3113  */
3114  estate = CreateExecutorState();
3115  econtext = GetPerTupleExprContext(estate);
3116  slot = table_slot_create(heapRelation, NULL);
3117 
3118  /* Arrange for econtext's scan tuple to be the tuple under test */
3119  econtext->ecxt_scantuple = slot;
3120 
3121  /* Set up execution state for predicate, if any. */
3122  predicate = ExecPrepareQual(indexInfo->ii_Predicate, estate);
3123 
3124  /*
3125  * Scan all live tuples in the base relation.
3126  */
3127  snapshot = RegisterSnapshot(GetLatestSnapshot());
3128  scan = table_beginscan_strat(heapRelation, /* relation */
3129  snapshot, /* snapshot */
3130  0, /* number of keys */
3131  NULL, /* scan key */
3132  true, /* buffer access strategy OK */
3133  true); /* syncscan OK */
3134 
3135  while (table_scan_getnextslot(scan, ForwardScanDirection, slot))
3136  {
3138 
3139  /*
3140  * In a partial index, ignore tuples that don't satisfy the predicate.
3141  */
3142  if (predicate != NULL)
3143  {
3144  if (!ExecQual(predicate, econtext))
3145  continue;
3146  }
3147 
3148  /*
3149  * Extract index column values, including computing expressions.
3150  */
3151  FormIndexDatum(indexInfo,
3152  slot,
3153  estate,
3154  values,
3155  isnull);
3156 
3157  /*
3158  * Check that this tuple has no conflicts.
3159  */
3160  check_exclusion_constraint(heapRelation,
3161  indexRelation, indexInfo,
3162  &(slot->tts_tid), values, isnull,
3163  estate, true);
3164 
3166  }
3167 
3168  table_endscan(scan);
3169  UnregisterSnapshot(snapshot);
3170 
3172 
3173  FreeExecutorState(estate);
3174 
3175  /* These may have been pointing to the now-gone estate */
3176  indexInfo->ii_ExpressionsState = NIL;
3177  indexInfo->ii_PredicateState = NULL;
3178 }
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
Definition: tableam.c:91
void FormIndexDatum(IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
Definition: index.c:2660
#define NIL
Definition: pg_list.h:65
List * ii_Predicate
Definition: execnodes.h:163
static bool ReindexIsCurrentlyProcessingIndex(Oid indexOid)
Definition: index.c:3958
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:810
ExprState * ii_PredicateState
Definition: execnodes.h:164
MemoryContext ecxt_per_tuple_memory
Definition: execnodes.h:234
void MemoryContextReset(MemoryContext context)
Definition: mcxt.c:143
static bool table_scan_getnextslot(TableScanDesc sscan, ScanDirection direction, TupleTableSlot *slot)
Definition: tableam.h:1032
static bool ExecQual(ExprState *state, ExprContext *econtext)
Definition: executor.h:395
static TableScanDesc table_beginscan_strat(Relation rel, Snapshot snapshot, int nkeys, struct ScanKeyData *key, bool allow_strat, bool allow_sync)
Definition: tableam.h:907
static void ResetReindexProcessing(void)
Definition: index.c:3999
void FreeExecutorState(EState *estate)
Definition: execUtils.c:186
#define GetPerTupleExprContext(estate)
Definition: executor.h:532
List * ii_ExpressionsState
Definition: execnodes.h:162
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
Definition: execTuples.c:1254
ExprState * ExecPrepareQual(List *qual, EState *estate)
Definition: execExpr.c:720
EState * CreateExecutorState(void)
Definition: execUtils.c:90
void UnregisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:852
uintptr_t Datum
Definition: postgres.h:411
#define INDEX_MAX_KEYS
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:226
Snapshot GetLatestSnapshot(void)
Definition: snapmgr.c:325
static void table_endscan(TableScanDesc scan)
Definition: tableam.h:991
static Datum values[MAXATTR]
Definition: bootstrap.c:166
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:102
void check_exclusion_constraint(Relation heap, Relation index, IndexInfo *indexInfo, ItemPointer tupleid, Datum *values, bool *isnull, EState *estate, bool newIndex)
Definition: execIndexing.c:887
ItemPointerData tts_tid
Definition: tuptable.h:130
#define RelationGetRelid(relation)
Definition: rel.h:469

◆ IndexGetRelation()

Oid IndexGetRelation ( Oid  indexId,
bool  missing_ok 
)

Definition at line 3474 of file index.c.

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

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

3475 {
3476  HeapTuple tuple;
3478  Oid result;
3479 
3480  tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
3481  if (!HeapTupleIsValid(tuple))
3482  {
3483  if (missing_ok)
3484  return InvalidOid;
3485  elog(ERROR, "cache lookup failed for index %u", indexId);
3486  }
3487  index = (Form_pg_index) GETSTRUCT(tuple);
3488  Assert(index->indexrelid == indexId);
3489 
3490  result = index->indrelid;
3491  ReleaseSysCache(tuple);
3492  return result;
3493 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
unsigned int Oid
Definition: postgres_ext.h:31
Definition: type.h:89
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1127
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1175
#define InvalidOid
Definition: postgres_ext.h:36
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:804
#define elog(elevel,...)
Definition: elog.h:232

◆ InitializeAttributeOids()

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

Definition at line 482 of file index.c.

References i, RelationGetDescr, and TupleDescAttr.

Referenced by index_create().

485 {
486  TupleDesc tupleDescriptor;
487  int i;
488 
489  tupleDescriptor = RelationGetDescr(indexRelation);
490 
491  for (i = 0; i < numatts; i += 1)
492  TupleDescAttr(tupleDescriptor, i)->attrelid = indexoid;
493 }
#define RelationGetDescr(relation)
Definition: rel.h:495
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
int i

◆ reindex_index()

void reindex_index ( Oid  indexId,
bool  skip_constraint_checks,
char  persistence,
ReindexParams params 
)

Definition at line 3499 of file index.c.

References AccessExclusiveLock, BuildIndexInfo(), CacheInvalidateRelcache(), CatalogTupleUpdate(), CheckRelationTableSpaceMove(), CheckTableNotInUse(), CommandCounterIncrement(), EarlyPruningEnabled, elog, ereport, errcode(), errdetail_internal(), errmsg(), ERROR, get_index_isvalid(), get_namespace_name(), 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, InvalidOid, IsSystemRelation(), IsToastNamespace(), NoLock, ObjectIdGetDatum, OidIsValid, ReindexParams::options, pg_rusage_init(), pg_rusage_show(), pgstat_progress_end_command(), pgstat_progress_start_command(), pgstat_progress_update_multi_param(), 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_MISSING_OK, REINDEXOPT_REPORT_PROGRESS, REINDEXOPT_VERBOSE, RELATION_IS_OTHER_TEMP, RelationAssumeNewRelfilenode(), RelationDropStorage(), RelationGetNamespace, RelationGetRelationName, RelationSetNewRelfilenode(), ResetReindexProcessing(), RowExclusiveLock, SearchSysCacheCopy1, SetReindexProcessing(), SetRelationTableSpace(), ShareLock, HeapTupleData::t_self, table_close(), table_open(), ReindexParams::tablespaceOid, TransferPredicateLocksToHeapRelation(), and try_table_open().

Referenced by reindex_relation(), ReindexIndex(), and ReindexMultipleInternal().

3501 {
3502  Relation iRel,
3503  heapRelation;
3504  Oid heapId;
3505  IndexInfo *indexInfo;
3506  volatile bool skipped_constraint = false;
3507  PGRUsage ru0;
3508  bool progress = ((params->options & REINDEXOPT_REPORT_PROGRESS) != 0);
3509  bool set_tablespace = false;
3510 
3511  pg_rusage_init(&ru0);
3512 
3513  /*
3514  * Open and lock the parent heap relation. ShareLock is sufficient since
3515  * we only need to be sure no schema or data changes are going on.
3516  */
3517  heapId = IndexGetRelation(indexId,
3518  (params->options & REINDEXOPT_MISSING_OK) != 0);
3519  /* if relation is missing, leave */
3520  if (!OidIsValid(heapId))
3521  return;
3522 
3523  if ((params->options & REINDEXOPT_MISSING_OK) != 0)
3524  heapRelation = try_table_open(heapId, ShareLock);
3525  else
3526  heapRelation = table_open(heapId, ShareLock);
3527 
3528  /* if relation is gone, leave */
3529  if (!heapRelation)
3530  return;
3531 
3532  if (progress)
3533  {
3534  const int progress_cols[] = {
3537  };
3538  const int64 progress_vals[] = {
3540  indexId
3541  };
3542 
3544  heapId);
3545  pgstat_progress_update_multi_param(2, progress_cols, progress_vals);
3546  }
3547 
3548  /*
3549  * Open the target index relation and get an exclusive lock on it, to
3550  * ensure that no one else is touching this particular index.
3551  */
3552  iRel = index_open(indexId, AccessExclusiveLock);
3553 
3554  if (progress)
3556  iRel->rd_rel->relam);
3557 
3558  /*
3559  * Partitioned indexes should never get processed here, as they have no
3560  * physical storage.
3561  */
3562  if (iRel->rd_rel->relkind == RELKIND_PARTITIONED_INDEX)
3563  elog(ERROR, "cannot reindex partitioned index \"%s.%s\"",
3565  RelationGetRelationName(iRel));
3566 
3567  /*
3568  * Don't allow reindex on temp tables of other backends ... their local
3569  * buffer manager is not going to cope.
3570  */
3571  if (RELATION_IS_OTHER_TEMP(iRel))
3572  ereport(ERROR,
3573  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3574  errmsg("cannot reindex temporary tables of other sessions")));
3575 
3576  /*
3577  * Don't allow reindex of an invalid index on TOAST table. This is a
3578  * leftover from a failed REINDEX CONCURRENTLY, and if rebuilt it would
3579  * not be possible to drop it anymore.
3580  */
3582  !get_index_isvalid(indexId))
3583  ereport(ERROR,
3584  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3585  errmsg("cannot reindex invalid index on TOAST table")));
3586 
3587  /*
3588  * System relations cannot be moved even if allow_system_table_mods is
3589  * enabled to keep things consistent with the concurrent case where all
3590  * the indexes of a relation are processed in series, including indexes of
3591  * toast relations.
3592  *
3593  * Note that this check is not part of CheckRelationTableSpaceMove() as it
3594  * gets used for ALTER TABLE SET TABLESPACE that could cascade across
3595  * toast relations.
3596  */
3597  if (OidIsValid(params->tablespaceOid) &&
3598  IsSystemRelation(iRel))
3599  ereport(ERROR,
3600  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3601  errmsg("cannot move system relation \"%s\"",
3602  RelationGetRelationName(iRel))));
3603 
3604  /* Check if the tablespace of this index needs to be changed */
3605  if (OidIsValid(params->tablespaceOid) &&
3607  set_tablespace = true;
3608 
3609  /*
3610  * Also check for active uses of the index in the current transaction; we
3611  * don't want to reindex underneath an open indexscan.
3612  */
3613  CheckTableNotInUse(iRel, "REINDEX INDEX");
3614 
3615  /* Set new tablespace, if requested */
3616  if (set_tablespace)
3617  {
3618  /* Update its pg_class row */
3620 
3621  /*
3622  * Schedule unlinking of the old index storage at transaction
3623  * commit.
3624  */
3625  RelationDropStorage(iRel);
3627 
3628  /* Make sure the reltablespace change is visible */
3630  }
3631 
3632  /*
3633  * All predicate locks on the index are about to be made invalid. Promote
3634  * them to relation locks on the heap.
3635  */
3637 
3638  /* Fetch info needed for index_build */
3639  indexInfo = BuildIndexInfo(iRel);
3640 
3641  /* If requested, skip checking uniqueness/exclusion constraints */
3642  if (skip_constraint_checks)
3643  {
3644  if (indexInfo->ii_Unique || indexInfo->ii_ExclusionOps != NULL)
3645  skipped_constraint = true;
3646  indexInfo->ii_Unique = false;
3647  indexInfo->ii_ExclusionOps = NULL;
3648  indexInfo->ii_ExclusionProcs = NULL;
3649  indexInfo->ii_ExclusionStrats = NULL;
3650  }
3651 
3652  /* Suppress use of the target index while rebuilding it */
3653  SetReindexProcessing(heapId, indexId);
3654 
3655  /* Create a new physical relation for the index */
3656  RelationSetNewRelfilenode(iRel, persistence);
3657 
3658  /* Initialize the index and rebuild */
3659  /* Note: we do not need to re-establish pkey setting */
3660  index_build(heapRelation, iRel, indexInfo, true, true);
3661 
3662  /* Re-allow use of target index */
3664 
3665  /*
3666  * If the index is marked invalid/not-ready/dead (ie, it's from a failed
3667  * CREATE INDEX CONCURRENTLY, or a DROP INDEX CONCURRENTLY failed midway),
3668  * and we didn't skip a uniqueness check, we can now mark it valid. This
3669  * allows REINDEX to be used to clean up in such cases.
3670  *
3671  * We can also reset indcheckxmin, because we have now done a
3672  * non-concurrent index build, *except* in the case where index_build
3673  * found some still-broken HOT chains. If it did, and we don't have to
3674  * change any of the other flags, we just leave indcheckxmin alone (note
3675  * that index_build won't have changed it, because this is a reindex).
3676  * This is okay and desirable because not updating the tuple leaves the
3677  * index's usability horizon (recorded as the tuple's xmin value) the same
3678  * as it was.
3679  *
3680  * But, if the index was invalid/not-ready/dead and there were broken HOT
3681  * chains, we had better force indcheckxmin true, because the normal
3682  * argument that the HOT chains couldn't conflict with the index is
3683  * suspect for an invalid index. (A conflict is definitely possible if
3684  * the index was dead. It probably shouldn't happen otherwise, but let's
3685  * be conservative.) In this case advancing the usability horizon is
3686  * appropriate.
3687  *
3688  * Another reason for avoiding unnecessary updates here is that while
3689  * reindexing pg_index itself, we must not try to update tuples in it.
3690  * pg_index's indexes should always have these flags in their clean state,
3691  * so that won't happen.
3692  *
3693  * If early pruning/vacuuming is enabled for the heap relation, the
3694  * usability horizon must be advanced to the current transaction on every
3695  * build or rebuild. pg_index is OK in this regard because catalog tables
3696  * are not subject to early cleanup.
3697  */
3698  if (!skipped_constraint)
3699  {
3700  Relation pg_index;
3701  HeapTuple indexTuple;
3702  Form_pg_index indexForm;
3703  bool index_bad;
3704  bool early_pruning_enabled = EarlyPruningEnabled(heapRelation);
3705 
3706  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3707 
3708  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3709  ObjectIdGetDatum(indexId));
3710  if (!HeapTupleIsValid(indexTuple))
3711  elog(ERROR, "cache lookup failed for index %u", indexId);
3712  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3713 
3714  index_bad = (!indexForm->indisvalid ||
3715  !indexForm->indisready ||
3716  !indexForm->indislive);
3717  if (index_bad ||
3718  (indexForm->indcheckxmin && !indexInfo->ii_BrokenHotChain) ||
3719  early_pruning_enabled)
3720  {
3721  if (!indexInfo->ii_BrokenHotChain && !early_pruning_enabled)
3722  indexForm->indcheckxmin = false;
3723  else if (index_bad || early_pruning_enabled)
3724  indexForm->indcheckxmin = true;
3725  indexForm->indisvalid = true;
3726  indexForm->indisready = true;
3727  indexForm->indislive = true;
3728  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
3729 
3730  /*
3731  * Invalidate the relcache for the table, so that after we commit
3732  * all sessions will refresh the table's index list. This ensures
3733  * that if anyone misses seeing the pg_index row during this
3734  * update, they'll refresh their list before attempting any update
3735  * on the table.
3736  */
3737  CacheInvalidateRelcache(heapRelation);
3738  }
3739 
3740  table_close(pg_index, RowExclusiveLock);
3741  }
3742 
3743  /* Log what we did */
3744  if ((params->options & REINDEXOPT_VERBOSE) != 0)
3745  ereport(INFO,
3746  (errmsg("index \"%s\" was reindexed",
3747  get_rel_name(indexId)),
3748  errdetail_internal("%s",
3749  pg_rusage_show(&ru0))));
3750 
3751  if (progress)
3753 
3754  /* Close rels, but keep locks */
3755  index_close(iRel, NoLock);
3756  table_close(heapRelation, NoLock);
3757 }
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3474
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
bool IsSystemRelation(Relation relation)
Definition: catalog.c:73
static void SetReindexProcessing(Oid heapOid, Oid indexOid)
Definition: index.c:3980
Oid * ii_ExclusionProcs
Definition: execnodes.h:166
int errcode(int sqlerrcode)
Definition: elog.c:698
#define INFO
Definition: elog.h:33
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2376
bool IsToastNamespace(Oid namespaceId)
Definition: catalog.c:200
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
Relation try_table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:69
#define OidIsValid(objectId)
Definition: c.h:710
void pgstat_progress_end_command(void)
int errdetail_internal(const char *fmt,...)
Definition: elog.c:1069
static void ResetReindexProcessing(void)
Definition: index.c:3999
void pgstat_progress_update_multi_param(int nparam, const int *index, const int64 *val)
void pg_rusage_init(PGRUsage *ru0)
Definition: pg_rusage.c:27
void RelationSetNewRelfilenode(Relation relation, char persistence)
Definition: relcache.c:3595
#define EarlyPruningEnabled(rel)
Definition: snapmgr.h:44
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
#define REINDEXOPT_VERBOSE
Definition: index.h:41
ItemPointerData t_self
Definition: htup.h:65
Oid tablespaceOid
Definition: index.h:36
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3316
void pgstat_progress_start_command(ProgressCommandType cmdtype, Oid relid)
#define NoLock
Definition: lockdefs.h:34
bool CheckRelationTableSpaceMove(Relation rel, Oid newTableSpaceId)
Definition: tablecmds.c:3280
#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:503
bool ii_BrokenHotChain
Definition: execnodes.h:175
#define REINDEXOPT_REPORT_PROGRESS
Definition: index.h:42
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:3929
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3146
#define REINDEXOPT_MISSING_OK
Definition: index.h:43
FormData_pg_index * Form_pg_index
Definition: pg_index.h:69
int progress
Definition: pgbench.c:270
void RelationAssumeNewRelfilenode(Relation relation)
Definition: relcache.c:3746
void RelationDropStorage(Relation rel)
Definition: storage.c:195
void CommandCounterIncrement(void)
Definition: xact.c:1021
#define PROGRESS_CREATEIDX_COMMAND_REINDEX
Definition: progress.h:110
#define InvalidOid
Definition: postgres_ext.h:36
#define ereport(elevel,...)
Definition: elog.h:157
bool ii_Unique
Definition: execnodes.h:172
void index_build(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
Definition: index.c:2896
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
void pgstat_progress_update_param(int index, int64 val)
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:612
bits32 options
Definition: index.h:35
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:301
bool get_index_isvalid(Oid index_oid)
Definition: lsyscache.c:3532
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1278
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:175
#define AccessExclusiveLock
Definition: lockdefs.h:45
Oid * ii_ExclusionOps
Definition: execnodes.h:165
int errmsg(const char *fmt,...)
Definition: elog.c:909
#define elog(elevel,...)
Definition: elog.h:232
#define ShareLock
Definition: lockdefs.h:41
uint16 * ii_ExclusionStrats
Definition: execnodes.h:167
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1899
#define PROGRESS_CREATEIDX_COMMAND
Definition: progress.h:79
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132
void SetRelationTableSpace(Relation rel, Oid newTableSpaceId, Oid newRelFileNode)
Definition: tablecmds.c:3337
#define PROGRESS_CREATEIDX_ACCESS_METHOD_OID
Definition: progress.h:81
#define RelationGetNamespace(relation)
Definition: rel.h:510

◆ reindex_relation()

bool reindex_relation ( Oid  relid,
int  flags,
ReindexParams params 
)

Definition at line 3795 of file index.c.

References Assert, CommandCounterIncrement(), elog, ereport, errcode(), errmsg(), ERROR, get_index_isvalid(), get_namespace_name(), get_rel_name(), get_rel_namespace(), i, InvalidOid, IsToastNamespace(), lfirst_oid, NIL, NoLock, OidIsValid, ReindexParams::options, 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(), REINDEXOPT_MISSING_OK, RelationGetIndexList(), RelationGetNamespace, RelationGetRelationName, SetReindexPending(), ShareLock, table_close(), table_open(), ReindexParams::tablespaceOid, try_table_open(), and WARNING.

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

3796 {
3797  Relation rel;
3798  Oid toast_relid;
3799  List *indexIds;
3800  char persistence;
3801  bool result;
3802  ListCell *indexId;
3803  int i;
3804 
3805  /*
3806  * Open and lock the relation. ShareLock is sufficient since we only need
3807  * to prevent schema and data changes in it. The lock level used here
3808  * should match ReindexTable().
3809  */
3810  if ((params->options & REINDEXOPT_MISSING_OK) != 0)
3811  rel = try_table_open(relid, ShareLock);
3812  else
3813  rel = table_open(relid, ShareLock);
3814 
3815  /* if relation is gone, leave */
3816  if (!rel)
3817  return false;
3818 
3819  /*
3820  * Partitioned tables should never get processed here, as they have no
3821  * physical storage.
3822  */
3823  if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
3824  elog(ERROR, "cannot reindex partitioned table \"%s.%s\"",
3827 
3828  toast_relid = rel->rd_rel->reltoastrelid;
3829 
3830  /*
3831  * Get the list of index OIDs for this relation. (We trust to the
3832  * relcache to get this with a sequential scan if ignoring system
3833  * indexes.)
3834  */
3835  indexIds = RelationGetIndexList(rel);
3836 
3837  if (flags & REINDEX_REL_SUPPRESS_INDEX_USE)
3838  {
3839  /* Suppress use of all the indexes until they are rebuilt */
3840  SetReindexPending(indexIds);
3841 
3842  /*
3843  * Make the new heap contents visible --- now things might be
3844  * inconsistent!
3845  */
3847  }
3848 
3849  /*
3850  * Compute persistence of indexes: same as that of owning rel, unless
3851  * caller specified otherwise.
3852  */
3854  persistence = RELPERSISTENCE_UNLOGGED;
3855  else if (flags & REINDEX_REL_FORCE_INDEXES_PERMANENT)
3856  persistence = RELPERSISTENCE_PERMANENT;
3857  else
3858  persistence = rel->rd_rel->relpersistence;
3859 
3860  /* Reindex all the indexes. */
3861  i = 1;
3862  foreach(indexId, indexIds)
3863  {
3864  Oid indexOid = lfirst_oid(indexId);
3865  Oid indexNamespaceId = get_rel_namespace(indexOid);
3866 
3867  /*
3868  * Skip any invalid indexes on a TOAST table. These can only be
3869  * duplicate leftovers from a failed REINDEX CONCURRENTLY, and if
3870  * rebuilt it would not be possible to drop them anymore.
3871  */
3872  if (IsToastNamespace(indexNamespaceId) &&
3873  !get_index_isvalid(indexOid))
3874  {
3875  ereport(WARNING,
3876  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3877  errmsg("cannot reindex invalid index \"%s.%s\" on TOAST table, skipping",
3878  get_namespace_name(indexNamespaceId),
3879  get_rel_name(indexOid))));
3880  continue;
3881  }
3882 
3883  reindex_index(indexOid, !(flags & REINDEX_REL_CHECK_CONSTRAINTS),
3884  persistence, params);
3885 
3887 
3888  /* Index should no longer be in the pending list */
3889  Assert(!ReindexIsProcessingIndex(indexOid));
3890 
3891  /* Set index rebuild count */
3893  i);
3894  i++;
3895  }
3896 
3897  /*
3898  * Close rel, but continue to hold the lock.
3899  */
3900  table_close(rel, NoLock);
3901 
3902  result = (indexIds != NIL);
3903 
3904  /*
3905  * If the relation has a secondary toast rel, reindex that too while we
3906  * still hold the lock on the main table.
3907  */
3908  if ((flags & REINDEX_REL_PROCESS_TOAST) && OidIsValid(toast_relid))
3909  {
3910  /*
3911  * Note that this should fail if the toast relation is missing, so
3912  * reset REINDEXOPT_MISSING_OK. Even if a new tablespace is set for
3913  * the parent relation, the indexes on its toast table are not moved.
3914  * This rule is enforced by setting tablespaceOid to InvalidOid.
3915  */
3916  ReindexParams newparams = *params;
3917 
3918  newparams.options &= ~(REINDEXOPT_MISSING_OK);
3919  newparams.tablespaceOid = InvalidOid;
3920  result |= reindex_relation(toast_relid, flags, &newparams);
3921  }
3922 
3923  return result;
3924 }
#define NIL
Definition: pg_list.h:65
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
static void SetReindexPending(List *indexes)
Definition: index.c:4013
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1923
int errcode(int sqlerrcode)
Definition: elog.c:698
#define REINDEX_REL_SUPPRESS_INDEX_USE
Definition: index.h:156
bool IsToastNamespace(Oid namespaceId)
Definition: catalog.c:200
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
Relation try_table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:69
#define OidIsValid(objectId)
Definition: c.h:710
#define ERROR
Definition: elog.h:46
Oid tablespaceOid
Definition: index.h:36
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3316
#define NoLock
Definition: lockdefs.h:34
#define RelationGetRelationName(relation)
Definition: rel.h:503
void reindex_index(Oid indexId, bool skip_constraint_checks, char persistence, ReindexParams *params)
Definition: index.c:3499
#define WARNING
Definition: elog.h:40
#define REINDEXOPT_MISSING_OK
Definition: index.h:43
void CommandCounterIncrement(void)
Definition: xact.c:1021
#define InvalidOid
Definition: postgres_ext.h:36
#define ereport(elevel,...)
Definition: elog.h:157
#define REINDEX_REL_FORCE_INDEXES_UNLOGGED
Definition: index.h:158
#define Assert(condition)
Definition: c.h:804
void pgstat_progress_update_param(int index, int64 val)
bits32 options
Definition: index.h:35
bool get_index_isvalid(Oid index_oid)
Definition: lsyscache.c:3532
#define REINDEX_REL_CHECK_CONSTRAINTS
Definition: index.h:157
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4570
bool reindex_relation(Oid relid, int flags, ReindexParams *params)
Definition: index.c:3795
int errmsg(const char *fmt,...)
Definition: elog.c:909
#define elog(elevel,...)
Definition: elog.h:232
#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:159
#define REINDEX_REL_PROCESS_TOAST
Definition: index.h:155
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
bool ReindexIsProcessingIndex(Oid indexOid)
Definition: index.c:3969
Definition: pg_list.h:50
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1899
#define lfirst_oid(lc)
Definition: pg_list.h:171
#define RelationGetNamespace(relation)
Definition: rel.h:510

◆ ReindexIsCurrentlyProcessingIndex()

static bool ReindexIsCurrentlyProcessingIndex ( Oid  indexOid)
static

Definition at line 3958 of file index.c.

References currentlyReindexedIndex.

Referenced by IndexCheckExclusion().

3959 {
3960  return indexOid == currentlyReindexedIndex;
3961 }
static Oid currentlyReindexedIndex
Definition: index.c:3939

◆ ReindexIsProcessingHeap()

bool ReindexIsProcessingHeap ( Oid  heapOid)

Definition at line 3948 of file index.c.

References currentlyReindexedHeap.

Referenced by index_update_stats().

3949 {
3950  return heapOid == currentlyReindexedHeap;
3951 }
static Oid currentlyReindexedHeap
Definition: index.c:3938

◆ ReindexIsProcessingIndex()

bool ReindexIsProcessingIndex ( Oid  indexOid)

Definition at line 3969 of file index.c.

References currentlyReindexedIndex, and list_member_oid().

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

3970 {
3971  return indexOid == currentlyReindexedIndex ||
3973 }
static List * pendingReindexedIndexes
Definition: index.c:3940
static Oid currentlyReindexedIndex
Definition: index.c:3939
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:689

◆ relationHasPrimaryKey()

static bool relationHasPrimaryKey ( Relation  rel)
static

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

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

◆ RemoveReindexPending()

static void RemoveReindexPending ( Oid  indexOid)
static

Definition at line 4029 of file index.c.

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

Referenced by SetReindexProcessing().

4030 {
4031  if (IsInParallelMode())
4032  elog(ERROR, "cannot modify reindex state during a parallel operation");
4034  indexOid);
4035 }
static List * pendingReindexedIndexes
Definition: index.c:3940
bool IsInParallelMode(void)
Definition: xact.c:1012
#define ERROR
Definition: elog.h:46
List * list_delete_oid(List *list, Oid datum)
Definition: list.c:849
#define elog(elevel,...)
Definition: elog.h:232

◆ ResetReindexProcessing()

static void ResetReindexProcessing ( void  )
static

Definition at line 3999 of file index.c.

References currentlyReindexedHeap, currentlyReindexedIndex, and InvalidOid.

Referenced by IndexCheckExclusion(), and reindex_index().

4000 {
4003  /* reindexingNestLevel remains set till end of (sub)transaction */
4004 }
static Oid currentlyReindexedHeap
Definition: index.c:3938
static Oid currentlyReindexedIndex
Definition: index.c:3939
#define InvalidOid
Definition: postgres_ext.h:36

◆ ResetReindexState()

void ResetReindexState ( int  nestLevel)

Definition at line 4042 of file index.c.

References currentlyReindexedHeap, currentlyReindexedIndex, InvalidOid, NIL, and reindexingNestLevel.

Referenced by AbortSubTransaction(), and AbortTransaction().

4043 {
4044  /*
4045  * Because reindexing is not re-entrant, we don't need to cope with nested
4046  * reindexing states. We just need to avoid messing up the outer-level
4047  * state in case a subtransaction fails within a REINDEX. So checking the
4048  * current nest level against that of the reindex operation is sufficient.
4049  */
4050  if (reindexingNestLevel >= nestLevel)
4051  {
4054 
4055  /*
4056  * We needn't try to release the contents of pendingReindexedIndexes;
4057  * that list should be in a transaction-lifespan context, so it will
4058  * go away automatically.
4059  */
4061 
4062  reindexingNestLevel = 0;
4063  }
4064 }
#define NIL
Definition: pg_list.h:65
static Oid currentlyReindexedHeap
Definition: index.c:3938
static List * pendingReindexedIndexes
Definition: index.c:3940
static Oid currentlyReindexedIndex
Definition: index.c:3939
#define InvalidOid
Definition: postgres_ext.h:36
static int reindexingNestLevel
Definition: index.c:3941

◆ RestoreReindexState()

void RestoreReindexState ( void *  reindexstate)

Definition at line 4100 of file index.c.

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

Referenced by ParallelWorkerMain().

4101 {
4102  SerializedReindexState *sistate = (SerializedReindexState *) reindexstate;
4103  int c = 0;
4104  MemoryContext oldcontext;
4105 
4108 
4111  for (c = 0; c < sistate->numPendingReindexedIndexes; ++c)
4114  sistate->pendingReindexedIndexes[c]);
4115  MemoryContextSwitchTo(oldcontext);
4116 
4117  /* Note the worker has its own transaction nesting level */
4119 }
#define NIL
Definition: pg_list.h:65
static Oid currentlyReindexedHeap
Definition: index.c:3938
Oid currentlyReindexedIndex
Definition: index.c:97
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static List * pendingReindexedIndexes
Definition: index.c:3940
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:99
List * lappend_oid(List *list, Oid datum)
Definition: list.c:372
char * c
MemoryContext TopMemoryContext
Definition: mcxt.c:48
int numPendingReindexedIndexes
Definition: index.c:98
static Oid currentlyReindexedIndex
Definition: index.c:3939
int GetCurrentTransactionNestLevel(void)
Definition: xact.c:857
#define Assert(condition)
Definition: c.h:804
static int reindexingNestLevel
Definition: index.c:3941
Oid currentlyReindexedHeap
Definition: index.c:96

◆ SerializeReindexState()

void SerializeReindexState ( Size  maxsize,
char *  start_address 
)

Definition at line 4082 of file index.c.

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

Referenced by InitializeParallelDSM().

4083 {
4084  SerializedReindexState *sistate = (SerializedReindexState *) start_address;
4085  int c = 0;
4086  ListCell *lc;
4087 
4091  foreach(lc, pendingReindexedIndexes)
4092  sistate->pendingReindexedIndexes[c++] = lfirst_oid(lc);
4093 }
static Oid currentlyReindexedHeap
Definition: index.c:3938
Oid currentlyReindexedIndex
Definition: index.c:97
static List * pendingReindexedIndexes
Definition: index.c:3940
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:99
char * c
int numPendingReindexedIndexes
Definition: index.c:98
static Oid currentlyReindexedIndex
Definition: index.c:3939
static int list_length(const List *l)
Definition: pg_list.h:149
Oid currentlyReindexedHeap
Definition: index.c:96
#define lfirst_oid(lc)
Definition: pg_list.h:171

◆ SetReindexPending()

static void SetReindexPending ( List indexes)
static

Definition at line 4013 of file index.c.

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

Referenced by reindex_relation().

4014 {
4015  /* Reindexing is not re-entrant. */
4017  elog(ERROR, "cannot reindex while reindexing");
4018  if (IsInParallelMode())
4019  elog(ERROR, "cannot modify reindex state during a parallel operation");
4022 }
static List * pendingReindexedIndexes
Definition: index.c:3940
List * list_copy(const List *oldlist)
Definition: list.c:1418
bool IsInParallelMode(void)
Definition: xact.c:1012
#define ERROR
Definition: elog.h:46
int GetCurrentTransactionNestLevel(void)
Definition: xact.c:857
static int reindexingNestLevel
Definition: index.c:3941
#define elog(elevel,...)
Definition: elog.h:232

◆ SetReindexProcessing()

static void SetReindexProcessing ( Oid  heapOid,
Oid  indexOid 
)
static

Definition at line 3980 of file index.c.

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

Referenced by reindex_index().

3981 {
3982  Assert(OidIsValid(heapOid) && OidIsValid(indexOid));
3983  /* Reindexing is not re-entrant. */
3985  elog(ERROR, "cannot reindex while reindexing");
3986  currentlyReindexedHeap = heapOid;
3987  currentlyReindexedIndex = indexOid;
3988  /* Index is no longer "pending" reindex. */
3989  RemoveReindexPending(indexOid);
3990  /* This may have been set already, but in case it isn't, do so now. */
3992 }
static Oid currentlyReindexedHeap
Definition: index.c:3938
#define OidIsValid(objectId)
Definition: c.h:710
#define ERROR
Definition: elog.h:46
static Oid currentlyReindexedIndex
Definition: index.c:3939
static void RemoveReindexPending(Oid indexOid)
Definition: index.c:4029
int GetCurrentTransactionNestLevel(void)
Definition: xact.c:857
#define Assert(condition)
Definition: c.h:804
static int reindexingNestLevel
Definition: index.c:3941
#define elog(elevel,...)
Definition: elog.h:232

◆ UpdateIndexRelation()

static void UpdateIndexRelation ( Oid  indexoid,
Oid  heapoid,
Oid  parentIndexId,
IndexInfo indexInfo,