PostgreSQL Source Code  git master
index.c File Reference
#include "postgres.h"
#include <unistd.h>
#include "access/amapi.h"
#include "access/heapam.h"
#include "access/multixact.h"
#include "access/reloptions.h"
#include "access/relscan.h"
#include "access/sysattr.h"
#include "access/tableam.h"
#include "access/transam.h"
#include "access/visibilitymap.h"
#include "access/xact.h"
#include "bootstrap/bootstrap.h"
#include "catalog/binary_upgrade.h"
#include "catalog/catalog.h"
#include "catalog/dependency.h"
#include "catalog/heap.h"
#include "catalog/index.h"
#include "catalog/objectaccess.h"
#include "catalog/partition.h"
#include "catalog/pg_am.h"
#include "catalog/pg_collation.h"
#include "catalog/pg_constraint.h"
#include "catalog/pg_depend.h"
#include "catalog/pg_description.h"
#include "catalog/pg_inherits.h"
#include "catalog/pg_opclass.h"
#include "catalog/pg_operator.h"
#include "catalog/pg_tablespace.h"
#include "catalog/pg_trigger.h"
#include "catalog/pg_type.h"
#include "catalog/storage.h"
#include "commands/event_trigger.h"
#include "commands/progress.h"
#include "commands/tablecmds.h"
#include "commands/trigger.h"
#include "executor/executor.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/optimizer.h"
#include "parser/parser.h"
#include "pgstat.h"
#include "rewrite/rewriteManip.h"
#include "storage/bufmgr.h"
#include "storage/lmgr.h"
#include "storage/predicate.h"
#include "storage/procarray.h"
#include "storage/smgr.h"
#include "utils/builtins.h"
#include "utils/fmgroids.h"
#include "utils/guc.h"
#include "utils/inval.h"
#include "utils/lsyscache.h"
#include "utils/memutils.h"
#include "utils/pg_rusage.h"
#include "utils/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, const char *newName)
 
void index_concurrently_build (Oid heapRelationId, Oid indexRelationId)
 
void index_concurrently_swap (Oid newIndexId, Oid oldIndexId, const char *oldName)
 
void index_concurrently_set_dead (Oid heapId, Oid indexId)
 
ObjectAddress index_constraint_create (Relation heapRelation, Oid indexRelationId, Oid parentConstraintId, IndexInfo *indexInfo, const char *constraintName, char constraintType, bits16 constr_flags, bool allow_system_table_mods, bool is_internal)
 
void index_drop (Oid indexId, bool concurrent, bool concurrent_lock_mode)
 
IndexInfoBuildIndexInfo (Relation index)
 
IndexInfoBuildDummyIndexInfo (Relation index)
 
bool CompareIndexInfo (IndexInfo *info1, IndexInfo *info2, Oid *collations1, Oid *collations2, Oid *opfamilies1, Oid *opfamilies2, AttrMap *attmap)
 
void BuildSpeculativeIndexInfo (Relation index, IndexInfo *ii)
 
void FormIndexDatum (IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
 
void index_build (Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
 
void validate_index (Oid heapId, Oid indexId, Snapshot snapshot)
 
void index_set_state_flags (Oid indexId, IndexStateFlagsAction action)
 
Oid IndexGetRelation (Oid indexId, bool missing_ok)
 
void reindex_index (Oid indexId, bool skip_constraint_checks, char persistence, int options)
 
bool reindex_relation (Oid relid, int flags, int options)
 
bool ReindexIsProcessingHeap (Oid heapOid)
 
bool ReindexIsProcessingIndex (Oid indexOid)
 
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 488 of file index.c.

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

Referenced by index_create().

489 {
490  Relation pg_attribute;
491  CatalogIndexState indstate;
492  TupleDesc indexTupDesc;
493 
494  /*
495  * open the attribute relation and its indexes
496  */
497  pg_attribute = table_open(AttributeRelationId, RowExclusiveLock);
498 
499  indstate = CatalogOpenIndexes(pg_attribute);
500 
501  /*
502  * insert data from new index's tupdesc into pg_attribute
503  */
504  indexTupDesc = RelationGetDescr(indexRelation);
505 
506  InsertPgAttributeTuples(pg_attribute, indexTupDesc, InvalidOid, attopts, indstate);
507 
508  CatalogCloseIndexes(indstate);
509 
510  table_close(pg_attribute, RowExclusiveLock);
511 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define RelationGetDescr(relation)
Definition: rel.h:482
#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:730
#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 2360 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().

2361 {
2362  IndexInfo *ii;
2363  Form_pg_index indexStruct = index->rd_index;
2364  int i;
2365  int numAtts;
2366 
2367  /* check the number of keys, and copy attr numbers into the IndexInfo */
2368  numAtts = indexStruct->indnatts;
2369  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2370  elog(ERROR, "invalid indnatts %d for index %u",
2371  numAtts, RelationGetRelid(index));
2372 
2373  /*
2374  * Create the node, using dummy index expressions, and pretending there is
2375  * no predicate.
2376  */
2377  ii = makeIndexInfo(indexStruct->indnatts,
2378  indexStruct->indnkeyatts,
2379  index->rd_rel->relam,
2381  NIL,
2382  indexStruct->indisunique,
2383  indexStruct->indisready,
2384  false);
2385 
2386  /* fill in attribute numbers */
2387  for (i = 0; i < numAtts; i++)
2388  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2389 
2390  /* We ignore the exclusion constraint if any */
2391 
2392  return ii;
2393 }
#define NIL
Definition: pg_list.h:65
List * RelationGetDummyIndexExpressions(Relation relation)
Definition: relcache.c:4807
Form_pg_class rd_rel
Definition: rel.h:109
Form_pg_index rd_index
Definition: rel.h:174
#define ERROR
Definition: elog.h:43
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:742
FormData_pg_index * Form_pg_index
Definition: pg_index.h:68
#define INDEX_MAX_KEYS
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
#define RelationGetRelid(relation)
Definition: rel.h:456

◆ BuildIndexInfo()

IndexInfo* BuildIndexInfo ( Relation  index)

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

2302 {
2303  IndexInfo *ii;
2304  Form_pg_index indexStruct = index->rd_index;
2305  int i;
2306  int numAtts;
2307 
2308  /* check the number of keys, and copy attr numbers into the IndexInfo */
2309  numAtts = indexStruct->indnatts;
2310  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2311  elog(ERROR, "invalid indnatts %d for index %u",
2312  numAtts, RelationGetRelid(index));
2313 
2314  /*
2315  * Create the node, fetching any expressions needed for expressional
2316  * indexes and index predicate if any.
2317  */
2318  ii = makeIndexInfo(indexStruct->indnatts,
2319  indexStruct->indnkeyatts,
2320  index->rd_rel->relam,
2323  indexStruct->indisunique,
2324  indexStruct->indisready,
2325  false);
2326 
2327  /* fill in attribute numbers */
2328  for (i = 0; i < numAtts; i++)
2329  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2330 
2331  /* fetch exclusion constraint info if any */
2332  if (indexStruct->indisexclusion)
2333  {
2335  &ii->ii_ExclusionOps,
2336  &ii->ii_ExclusionProcs,
2337  &ii->ii_ExclusionStrats);
2338  }
2339 
2341 
2342  return ii;
2343 }
void RelationGetExclusionInfo(Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
Definition: relcache.c:5182
Oid * ii_ExclusionProcs
Definition: execnodes.h:166
Form_pg_class rd_rel
Definition: rel.h:109
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4861
Form_pg_index rd_index
Definition: rel.h:174
#define ERROR
Definition: elog.h:43
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4748
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:742
Datum * RelationGetIndexRawAttOptions(Relation indexrel)
Definition: relcache.c:5390
FormData_pg_index * Form_pg_index
Definition: pg_index.h:68
#define INDEX_MAX_KEYS
Oid * ii_ExclusionOps
Definition: execnodes.h:165
#define elog(elevel,...)
Definition: elog.h:214
int i
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:160
uint16 * ii_ExclusionStrats
Definition: execnodes.h:167
#define RelationGetRelid(relation)
Definition: rel.h:456
Datum * ii_OpclassOptions
Definition: execnodes.h:171

◆ BuildSpeculativeIndexInfo()

void BuildSpeculativeIndexInfo ( Relation  index,
IndexInfo ii 
)

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

2526 {
2527  int indnkeyatts;
2528  int i;
2529 
2530  indnkeyatts = IndexRelationGetNumberOfKeyAttributes(index);
2531 
2532  /*
2533  * fetch info for checking unique indexes
2534  */
2535  Assert(ii->ii_Unique);
2536 
2537  if (index->rd_rel->relam != BTREE_AM_OID)
2538  elog(ERROR, "unexpected non-btree speculative unique index");
2539 
2540  ii->ii_UniqueOps = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2541  ii->ii_UniqueProcs = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2542  ii->ii_UniqueStrats = (uint16 *) palloc(sizeof(uint16) * indnkeyatts);
2543 
2544  /*
2545  * We have to look up the operator's strategy number. This provides a
2546  * cross-check that the operator does match the index.
2547  */
2548  /* We need the func OIDs and strategy numbers too */
2549  for (i = 0; i < indnkeyatts; i++)
2550  {
2552  ii->ii_UniqueOps[i] =
2553  get_opfamily_member(index->rd_opfamily[i],
2554  index->rd_opcintype[i],
2555  index->rd_opcintype[i],
2556  ii->ii_UniqueStrats[i]);
2557  if (!OidIsValid(ii->ii_UniqueOps[i]))
2558  elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
2559  ii->ii_UniqueStrats[i], index->rd_opcintype[i],
2560  index->rd_opcintype[i], index->rd_opfamily[i]);
2561  ii->ii_UniqueProcs[i] = get_opcode(ii->ii_UniqueOps[i]);
2562  }
2563 }
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:651
Oid * ii_UniqueOps
Definition: execnodes.h:168
unsigned short uint16
Definition: c.h:373
#define ERROR
Definition: elog.h:43
Oid * ii_UniqueProcs
Definition: execnodes.h:169
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:164
Oid * rd_opfamily
Definition: rel.h:189
#define IndexRelationGetNumberOfKeyAttributes(relation)
Definition: rel.h:475
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1202
bool ii_Unique
Definition: execnodes.h:172
#define Assert(condition)
Definition: c.h:745
void * palloc(Size size)
Definition: mcxt.c:950
#define elog(elevel,...)
Definition: elog.h:214
int i
Oid * rd_opcintype
Definition: rel.h:190
#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 2406 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().

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

◆ ConstructTupleDescriptor()

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

Definition at line 267 of file index.c.

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

Referenced by index_create().

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

◆ EstimateReindexStateSpace()

Size EstimateReindexStateSpace ( void  )

Definition at line 3947 of file index.c.

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

Referenced by InitializeParallelDSM().

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

◆ FormIndexDatum()

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

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

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

◆ index_build()

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

Definition at line 2821 of file index.c.

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

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

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

◆ index_check_primary_key()

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

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

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

◆ index_concurrently_build()

void index_concurrently_build ( Oid  heapRelationId,
Oid  indexRelationId 
)

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

1398 {
1399  Relation heapRel;
1400  Relation indexRelation;
1401  IndexInfo *indexInfo;
1402 
1403  /* This had better make sure that a snapshot is active */
1405 
1406  /* Open and lock the parent heap relation */
1407  heapRel = table_open(heapRelationId, ShareUpdateExclusiveLock);
1408 
1409  /* And the target index relation */
1410  indexRelation = index_open(indexRelationId, RowExclusiveLock);
1411 
1412  /*
1413  * We have to re-build the IndexInfo struct, since it was lost in the
1414  * commit of the transaction where this concurrent index was created at
1415  * the catalog level.
1416  */
1417  indexInfo = BuildIndexInfo(indexRelation);
1418  Assert(!indexInfo->ii_ReadyForInserts);
1419  indexInfo->ii_Concurrent = true;
1420  indexInfo->ii_BrokenHotChain = false;
1421 
1422  /* Now build the index */
1423  index_build(heapRel, indexRelation, indexInfo, false, true);
1424 
1425  /* Close both the relations, but keep the locks */
1426  table_close(heapRel, NoLock);
1427  index_close(indexRelation, NoLock);
1428 
1429  /*
1430  * Update the pg_index row to mark the index as ready for inserts. Once we
1431  * commit this transaction, any new transactions that open the table must
1432  * insert new entries into the index for insertions and non-HOT updates.
1433  */
1435 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3320
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2301
#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:2821
#define Assert(condition)
Definition: c.h:745
bool ii_Concurrent
Definition: execnodes.h:174
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:158
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:132

◆ index_concurrently_create_copy()

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

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

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

1735 {
1736  Relation userHeapRelation;
1737  Relation userIndexRelation;
1738 
1739  /*
1740  * No more predicate locks will be acquired on this index, and we're about
1741  * to stop doing inserts into the index which could show conflicts with
1742  * existing predicate locks, so now is the time to move them to the heap
1743  * relation.
1744  */
1745  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
1746  userIndexRelation = index_open(indexId, ShareUpdateExclusiveLock);
1747  TransferPredicateLocksToHeapRelation(userIndexRelation);
1748 
1749  /*
1750  * Now we are sure that nobody uses the index for queries; they just might
1751  * have it open for updating it. So now we can unset indisready and
1752  * indislive, then wait till nobody could be using it at all anymore.
1753  */
1755 
1756  /*
1757  * Invalidate the relcache for the table, so that after this commit all
1758  * sessions will refresh the table's index list. Forgetting just the
1759  * index's relcache entry is not enough.
1760  */
1761  CacheInvalidateRelcache(userHeapRelation);
1762 
1763  /*
1764  * Close the relations again, though still holding session lock.
1765  */
1766  table_close(userHeapRelation, NoLock);
1767  index_close(userIndexRelation, NoLock);
1768 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3320
#define NoLock
Definition: lockdefs.h:34
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3075
#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 1444 of file index.c.

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

Referenced by ReindexRelationConcurrently().

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

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

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

Referenced by ATExecAddIndexConstraint(), and index_create().

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

◆ 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 684 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().

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

◆ index_drop()

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

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

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

3321 {
3322  Relation pg_index;
3323  HeapTuple indexTuple;
3324  Form_pg_index indexForm;
3325 
3326  /* Open pg_index and fetch a writable copy of the index's tuple */
3327  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3328 
3329  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3330  ObjectIdGetDatum(indexId));
3331  if (!HeapTupleIsValid(indexTuple))
3332  elog(ERROR, "cache lookup failed for index %u", indexId);
3333  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3334 
3335  /* Perform the requested state change on the copy */
3336  switch (action)
3337  {
3339  /* Set indisready during a CREATE INDEX CONCURRENTLY sequence */
3340  Assert(indexForm->indislive);
3341  Assert(!indexForm->indisready);
3342  Assert(!indexForm->indisvalid);
3343  indexForm->indisready = true;
3344  break;
3346  /* Set indisvalid during a CREATE INDEX CONCURRENTLY sequence */
3347  Assert(indexForm->indislive);
3348  Assert(indexForm->indisready);
3349  Assert(!indexForm->indisvalid);
3350  indexForm->indisvalid = true;
3351  break;
3353 
3354  /*
3355  * Clear indisvalid during a DROP INDEX CONCURRENTLY sequence
3356  *
3357  * If indisready == true we leave it set so the index still gets
3358  * maintained by active transactions. We only need to ensure that
3359  * indisvalid is false. (We don't assert that either is initially
3360  * true, though, since we want to be able to retry a DROP INDEX
3361  * CONCURRENTLY that failed partway through.)
3362  *
3363  * Note: the CLUSTER logic assumes that indisclustered cannot be
3364  * set on any invalid index, so clear that flag too. Similarly,
3365  * ALTER TABLE assumes that indisreplident cannot be set for
3366  * invalid indexes.
3367  */
3368  indexForm->indisvalid = false;
3369  indexForm->indisclustered = false;
3370  indexForm->indisreplident = false;
3371  break;
3372  case INDEX_DROP_SET_DEAD:
3373 
3374  /*
3375  * Clear indisready/indislive during DROP INDEX CONCURRENTLY
3376  *
3377  * We clear both indisready and indislive, because we not only
3378  * want to stop updates, we want to prevent sessions from touching
3379  * the index at all.
3380  */
3381  Assert(!indexForm->indisvalid);
3382  Assert(!indexForm->indisclustered);
3383  Assert(!indexForm->indisreplident);
3384  indexForm->indisready = false;
3385  indexForm->indislive = false;
3386  break;
3387  }
3388 
3389  /* ... and update it */
3390  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
3391 
3392  table_close(pg_index, RowExclusiveLock);
3393 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
ItemPointerData t_self
Definition: htup.h:65
#define RowExclusiveLock
Definition: lockdefs.h:38
FormData_pg_index * Form_pg_index
Definition: pg_index.h:68
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:745
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:301
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
#define elog(elevel,...)
Definition: elog.h:214
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ index_update_stats()

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

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

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

◆ IndexCheckExclusion()

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

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

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

◆ IndexGetRelation()

Oid IndexGetRelation ( Oid  indexId,
bool  missing_ok 
)

Definition at line 3401 of file index.c.

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

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

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

◆ InitializeAttributeOids()

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

Definition at line 470 of file index.c.

References i, RelationGetDescr, and TupleDescAttr.

Referenced by index_create().

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

◆ reindex_index()

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

Definition at line 3426 of file index.c.

References AccessExclusiveLock, BuildIndexInfo(), CacheInvalidateRelcache(), CatalogTupleUpdate(), CheckTableNotInUse(), 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, IsToastNamespace(), NoLock, ObjectIdGetDatum, OidIsValid, pg_rusage_init(), pg_rusage_show(), pgstat_progress_end_command(), pgstat_progress_start_command(), pgstat_progress_update_param(), progress, PROGRESS_COMMAND_CREATE_INDEX, PROGRESS_CREATEIDX_ACCESS_METHOD_OID, PROGRESS_CREATEIDX_COMMAND, PROGRESS_CREATEIDX_COMMAND_REINDEX, PROGRESS_CREATEIDX_INDEX_OID, RelationData::rd_rel, REINDEXOPT_MISSING_OK, REINDEXOPT_REPORT_PROGRESS, REINDEXOPT_VERBOSE, RELATION_IS_OTHER_TEMP, RelationGetNamespace, RelationGetRelationName, RelationSetNewRelfilenode(), ResetReindexProcessing(), RowExclusiveLock, SearchSysCacheCopy1, SetReindexProcessing(), ShareLock, HeapTupleData::t_self, table_close(), table_open(), TransferPredicateLocksToHeapRelation(), and try_table_open().

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

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

◆ reindex_relation()

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

Definition at line 3676 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, IsToastNamespace(), lfirst_oid, NIL, NoLock, OidIsValid, 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(), try_table_open(), and WARNING.

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

3677 {
3678  Relation rel;
3679  Oid toast_relid;
3680  List *indexIds;
3681  char persistence;
3682  bool result;
3683  ListCell *indexId;
3684  int i;
3685 
3686  /*
3687  * Open and lock the relation. ShareLock is sufficient since we only need
3688  * to prevent schema and data changes in it. The lock level used here
3689  * should match ReindexTable().
3690  */
3691  if ((options & REINDEXOPT_MISSING_OK) != 0)
3692  rel = try_table_open(relid, ShareLock);
3693  else
3694  rel = table_open(relid, ShareLock);
3695 
3696  /* if relation is gone, leave */
3697  if (!rel)
3698  return false;
3699 
3700  /*
3701  * Partitioned tables should never get processed here, as they have no
3702  * physical storage.
3703  */
3704  if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
3705  elog(ERROR, "cannot reindex partitioned table \"%s.%s\"",
3708 
3709  toast_relid = rel->rd_rel->reltoastrelid;
3710 
3711  /*
3712  * Get the list of index OIDs for this relation. (We trust to the
3713  * relcache to get this with a sequential scan if ignoring system
3714  * indexes.)
3715  */
3716  indexIds = RelationGetIndexList(rel);
3717 
3718  if (flags & REINDEX_REL_SUPPRESS_INDEX_USE)
3719  {
3720  /* Suppress use of all the indexes until they are rebuilt */
3721  SetReindexPending(indexIds);
3722 
3723  /*
3724  * Make the new heap contents visible --- now things might be
3725  * inconsistent!
3726  */
3728  }
3729 
3730  /*
3731  * Compute persistence of indexes: same as that of owning rel, unless
3732  * caller specified otherwise.
3733  */
3735  persistence = RELPERSISTENCE_UNLOGGED;
3736  else if (flags & REINDEX_REL_FORCE_INDEXES_PERMANENT)
3737  persistence = RELPERSISTENCE_PERMANENT;
3738  else
3739  persistence = rel->rd_rel->relpersistence;
3740 
3741  /* Reindex all the indexes. */
3742  i = 1;
3743  foreach(indexId, indexIds)
3744  {
3745  Oid indexOid = lfirst_oid(indexId);
3746  Oid indexNamespaceId = get_rel_namespace(indexOid);
3747 
3748  /*
3749  * Skip any invalid indexes on a TOAST table. These can only be
3750  * duplicate leftovers from a failed REINDEX CONCURRENTLY, and if
3751  * rebuilt it would not be possible to drop them anymore.
3752  */
3753  if (IsToastNamespace(indexNamespaceId) &&
3754  !get_index_isvalid(indexOid))
3755  {
3756  ereport(WARNING,
3757  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3758  errmsg("cannot reindex invalid index \"%s.%s\" on TOAST table, skipping",
3759  get_namespace_name(indexNamespaceId),
3760  get_rel_name(indexOid))));
3761  continue;
3762  }
3763 
3764  reindex_index(indexOid, !(flags & REINDEX_REL_CHECK_CONSTRAINTS),
3765  persistence, options);
3766 
3768 
3769  /* Index should no longer be in the pending list */
3770  Assert(!ReindexIsProcessingIndex(indexOid));
3771 
3772  /* Set index rebuild count */
3774  i);
3775  i++;
3776  }
3777 
3778  /*
3779  * Close rel, but continue to hold the lock.
3780  */
3781  table_close(rel, NoLock);
3782 
3783  result = (indexIds != NIL);
3784 
3785  /*
3786  * If the relation has a secondary toast rel, reindex that too while we
3787  * still hold the lock on the main table.
3788  */
3789  if ((flags & REINDEX_REL_PROCESS_TOAST) && OidIsValid(toast_relid))
3790  {
3791  /*
3792  * Note that this should fail if the toast relation is missing, so
3793  * reset REINDEXOPT_MISSING_OK.
3794  */
3795  result |= reindex_relation(toast_relid, flags,
3796  options & ~(REINDEXOPT_MISSING_OK));
3797  }
3798 
3799  return result;
3800 }
#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:3889
void pgstat_progress_update_param(int index, int64 val)
Definition: pgstat.c:3231
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1864
int errcode(int sqlerrcode)
Definition: elog.c:610
#define REINDEX_REL_SUPPRESS_INDEX_USE
Definition: index.h:141
bool IsToastNamespace(Oid namespaceId)
Definition: catalog.c:195
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:651
#define ERROR
Definition: elog.h:43
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3191
#define NoLock
Definition: lockdefs.h:34
#define RelationGetRelationName(relation)
Definition: rel.h:490
#define WARNING
Definition: elog.h:40
void CommandCounterIncrement(void)
Definition: xact.c:1021
#define ereport(elevel,...)
Definition: elog.h:144
#define REINDEX_REL_FORCE_INDEXES_UNLOGGED
Definition: index.h:143
#define Assert(condition)
Definition: c.h:745
bool get_index_isvalid(Oid index_oid)
Definition: lsyscache.c:3357
#define REINDEX_REL_CHECK_CONSTRAINTS
Definition: index.h:142
#define REINDEXOPT_MISSING_OK
Definition: parsenodes.h:3356
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4514
void reindex_index(Oid indexId, bool skip_constraint_checks, char persistence, int options)
Definition: index.c:3426
int errmsg(const char *fmt,...)
Definition: elog.c:824
#define elog(elevel,...)
Definition: elog.h:214
#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:144
#define REINDEX_REL_PROCESS_TOAST
Definition: index.h:140
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
bool ReindexIsProcessingIndex(Oid indexOid)
Definition: index.c:3845
bool reindex_relation(Oid relid, int flags, int options)
Definition: index.c:3676
Definition: pg_list.h:50
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1840
#define lfirst_oid(lc)
Definition: pg_list.h:192
#define RelationGetNamespace(relation)
Definition: rel.h:497

◆ ReindexIsCurrentlyProcessingIndex()

static bool ReindexIsCurrentlyProcessingIndex ( Oid  indexOid)
static

Definition at line 3834 of file index.c.

References currentlyReindexedIndex.

Referenced by IndexCheckExclusion().

3835 {
3836  return indexOid == currentlyReindexedIndex;
3837 }
static Oid currentlyReindexedIndex
Definition: index.c:3815

◆ ReindexIsProcessingHeap()

bool ReindexIsProcessingHeap ( Oid  heapOid)

Definition at line 3824 of file index.c.

References currentlyReindexedHeap.

Referenced by index_update_stats().

3825 {
3826  return heapOid == currentlyReindexedHeap;
3827 }
static Oid currentlyReindexedHeap
Definition: index.c:3814

◆ ReindexIsProcessingIndex()

bool ReindexIsProcessingIndex ( Oid  indexOid)

Definition at line 3845 of file index.c.

References currentlyReindexedIndex, and list_member_oid().

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

3846 {
3847  return indexOid == currentlyReindexedIndex ||
3849 }
static List * pendingReindexedIndexes
Definition: index.c:3816
static Oid currentlyReindexedIndex
Definition: index.c:3815
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674

◆ relationHasPrimaryKey()

static bool relationHasPrimaryKey ( Relation  rel)
static

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

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

◆ RemoveReindexPending()

static void RemoveReindexPending ( Oid  indexOid)
static

Definition at line 3905 of file index.c.

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

Referenced by SetReindexProcessing().

3906 {
3907  if (IsInParallelMode())
3908  elog(ERROR, "cannot modify reindex state during a parallel operation");
3910  indexOid);
3911 }
static List * pendingReindexedIndexes
Definition: index.c:3816
bool IsInParallelMode(void)
Definition: xact.c:1012
#define ERROR
Definition: elog.h:43
List * list_delete_oid(List *list, Oid datum)
Definition: list.c:834
#define elog(elevel,...)
Definition: elog.h:214

◆ ResetReindexProcessing()

static void ResetReindexProcessing ( void  )
static

Definition at line 3875 of file index.c.

References currentlyReindexedHeap, currentlyReindexedIndex, and InvalidOid.

Referenced by IndexCheckExclusion(), and reindex_index().

3876 {
3879  /* reindexingNestLevel remains set till end of (sub)transaction */
3880 }
static Oid currentlyReindexedHeap
Definition: index.c:3814
static Oid currentlyReindexedIndex
Definition: index.c:3815
#define InvalidOid
Definition: postgres_ext.h:36

◆ ResetReindexState()

void ResetReindexState ( int  nestLevel)

Definition at line 3918 of file index.c.

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

Referenced by AbortSubTransaction(), and AbortTransaction().

3919 {
3920  /*
3921  * Because reindexing is not re-entrant, we don't need to cope with nested
3922  * reindexing states. We just need to avoid messing up the outer-level
3923  * state in case a subtransaction fails within a REINDEX. So checking the
3924  * current nest level against that of the reindex operation is sufficient.
3925  */
3926  if (reindexingNestLevel >= nestLevel)
3927  {
3930 
3931  /*
3932  * We needn't try to release the contents of pendingReindexedIndexes;
3933  * that list should be in a transaction-lifespan context, so it will
3934  * go away automatically.
3935  */
3937 
3938  reindexingNestLevel = 0;
3939  }
3940 }
#define NIL
Definition: pg_list.h:65
static Oid currentlyReindexedHeap
Definition: index.c:3814
static List * pendingReindexedIndexes
Definition: index.c:3816
static Oid currentlyReindexedIndex
Definition: index.c:3815
#define InvalidOid
Definition: postgres_ext.h:36
static int reindexingNestLevel
Definition: index.c:3817

◆ RestoreReindexState()

void RestoreReindexState ( void *  reindexstate)

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

3977 {
3978  SerializedReindexState *sistate = (SerializedReindexState *) reindexstate;
3979  int c = 0;
3980  MemoryContext oldcontext;
3981 
3984 
3987  for (c = 0; c < sistate->numPendingReindexedIndexes; ++c)
3990  sistate->pendingReindexedIndexes[c]);
3991  MemoryContextSwitchTo(oldcontext);
3992 
3993  /* Note the worker has its own transaction nesting level */
3995 }
#define NIL
Definition: pg_list.h:65
static Oid currentlyReindexedHeap
Definition: index.c:3814
Oid currentlyReindexedIndex
Definition: index.c:95
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
static List * pendingReindexedIndexes
Definition: index.c:3816
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:97
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
char * c
MemoryContext TopMemoryContext
Definition: mcxt.c:44
int numPendingReindexedIndexes
Definition: index.c:96
static Oid currentlyReindexedIndex
Definition: index.c:3815
int GetCurrentTransactionNestLevel(void)
Definition: xact.c:857
#define Assert(condition)
Definition: c.h:745
static int reindexingNestLevel
Definition: index.c:3817
Oid currentlyReindexedHeap
Definition: index.c:94

◆ SerializeReindexState()

void SerializeReindexState ( Size  maxsize,
char *  start_address 
)

Definition at line 3958 of file index.c.

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

Referenced by InitializeParallelDSM().

3959 {
3960  SerializedReindexState *sistate = (SerializedReindexState *) start_address;
3961  int c = 0;
3962  ListCell *lc;
3963 
3967  foreach(lc, pendingReindexedIndexes)
3968  sistate->pendingReindexedIndexes[c++] = lfirst_oid(lc);
3969 }
static Oid currentlyReindexedHeap
Definition: index.c:3814
Oid currentlyReindexedIndex
Definition: index.c:95
static List * pendingReindexedIndexes
Definition: index.c:3816
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:97
char * c
int numPendingReindexedIndexes
Definition: index.c:96
static Oid currentlyReindexedIndex
Definition: index.c:3815
static int list_length(const List *l)
Definition: pg_list.h:169
Oid currentlyReindexedHeap
Definition: index.c:94
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ SetReindexPending()

static void SetReindexPending ( List indexes)
static

Definition at line 3889 of file index.c.

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

Referenced by reindex_relation().

3890 {
3891  /* Reindexing is not re-entrant. */
3893  elog(ERROR, "cannot reindex while reindexing");
3894  if (IsInParallelMode())
3895  elog(ERROR, "cannot modify reindex state during a parallel operation");
3898 }
static List * pendingReindexedIndexes
Definition: index.c:3816
List * list_copy(const List *oldlist)
Definition: list.c:1403
bool IsInParallelMode(void)
Definition: xact.c:1012
#define ERROR
Definition: elog.h:43
int GetCurrentTransactionNestLevel(void)
Definition: xact.c:857
static int reindexingNestLevel
Definition: index.c:3817
#define elog(elevel,...)
Definition: elog.h:214

◆ SetReindexProcessing()

static void SetReindexProcessing ( Oid  heapOid,
Oid  indexOid 
)
static

Definition at line 3856 of file index.c.

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

Referenced by reindex_index().

3857 {
3858  Assert(OidIsValid(heapOid) && OidIsValid(indexOid));
3859  /* Reindexing is not re-entrant. */
3861  elog(ERROR, "cannot reindex while reindexing");
3862  currentlyReindexedHeap = heapOid;
3863  currentlyReindexedIndex = indexOid;
3864  /* Index is no longer "pending" reindex. */
3865  RemoveReindexPending(indexOid);
3866  /* This may have been set already, but in case it isn't, do so now. */
3868 }
static Oid currentlyReindexedHeap
Definition: index.c:3814
#define OidIsValid(objectId)
Definition: c.h:651
#define ERROR
Definition: elog.h:43
static Oid currentlyReindexedIndex
Definition: index.c:3815
static void RemoveReindexPending(Oid indexOid)
Definition: index.c:3905
int GetCurrentTransactionNestLevel(void)
Definition: xact.c:857
#define Assert(condition)
Definition: c.h:745
static int reindexingNestLevel
Definition: index.c:3817
#define elog(elevel,...)
Definition: elog.h:214

◆ UpdateIndexRelation()

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

Definition at line 520 of file index.c.

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

Referenced by index_create().

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