PostgreSQL Source Code  git master
index.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * index.c
4  * code to create and destroy POSTGRES index relations
5  *
6  * Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  *
10  * IDENTIFICATION
11  * src/backend/catalog/index.c
12  *
13  *
14  * INTERFACE ROUTINES
15  * index_create() - Create a cataloged index relation
16  * index_drop() - Removes index relation from catalogs
17  * BuildIndexInfo() - Prepare to insert index tuples
18  * FormIndexDatum() - Construct datum vector for one index tuple
19  *
20  *-------------------------------------------------------------------------
21  */
22 #include "postgres.h"
23 
24 #include <unistd.h>
25 
26 #include "access/amapi.h"
27 #include "access/heapam.h"
28 #include "access/multixact.h"
29 #include "access/relscan.h"
30 #include "access/sysattr.h"
31 #include "access/tableam.h"
32 #include "access/transam.h"
33 #include "access/visibilitymap.h"
34 #include "access/xact.h"
35 #include "bootstrap/bootstrap.h"
36 #include "catalog/binary_upgrade.h"
37 #include "catalog/catalog.h"
38 #include "catalog/dependency.h"
39 #include "catalog/heap.h"
40 #include "catalog/index.h"
41 #include "catalog/objectaccess.h"
42 #include "catalog/partition.h"
43 #include "catalog/pg_am.h"
44 #include "catalog/pg_collation.h"
45 #include "catalog/pg_constraint.h"
46 #include "catalog/pg_depend.h"
47 #include "catalog/pg_description.h"
48 #include "catalog/pg_inherits.h"
49 #include "catalog/pg_opclass.h"
50 #include "catalog/pg_operator.h"
51 #include "catalog/pg_tablespace.h"
52 #include "catalog/pg_trigger.h"
53 #include "catalog/pg_type.h"
54 #include "catalog/storage.h"
55 #include "commands/event_trigger.h"
56 #include "commands/progress.h"
57 #include "commands/tablecmds.h"
58 #include "commands/trigger.h"
59 #include "executor/executor.h"
60 #include "miscadmin.h"
61 #include "nodes/makefuncs.h"
62 #include "nodes/nodeFuncs.h"
63 #include "optimizer/optimizer.h"
64 #include "parser/parser.h"
65 #include "pgstat.h"
66 #include "rewrite/rewriteManip.h"
67 #include "storage/bufmgr.h"
68 #include "storage/lmgr.h"
69 #include "storage/predicate.h"
70 #include "storage/procarray.h"
71 #include "storage/smgr.h"
72 #include "utils/builtins.h"
73 #include "utils/fmgroids.h"
74 #include "utils/guc.h"
75 #include "utils/inval.h"
76 #include "utils/lsyscache.h"
77 #include "utils/memutils.h"
78 #include "utils/pg_rusage.h"
79 #include "utils/snapmgr.h"
80 #include "utils/syscache.h"
81 #include "utils/tuplesort.h"
82 
83 /* Potentially set by pg_upgrade_support functions */
85 
86 /*
87  * Pointer-free representation of variables used when reindexing system
88  * catalogs; we use this to propagate those values to parallel workers.
89  */
90 typedef struct
91 {
95  Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER];
97 
98 /* non-export function prototypes */
99 static bool relationHasPrimaryKey(Relation rel);
100 static TupleDesc ConstructTupleDescriptor(Relation heapRelation,
101  IndexInfo *indexInfo,
102  List *indexColNames,
103  Oid accessMethodObjectId,
104  Oid *collationObjectId,
105  Oid *classObjectId);
106 static void InitializeAttributeOids(Relation indexRelation,
107  int numatts, Oid indexoid);
108 static void AppendAttributeTuples(Relation indexRelation, int numatts);
109 static void UpdateIndexRelation(Oid indexoid, Oid heapoid,
110  Oid parentIndexId,
111  IndexInfo *indexInfo,
112  Oid *collationOids,
113  Oid *classOids,
114  int16 *coloptions,
115  bool primary,
116  bool isexclusion,
117  bool immediate,
118  bool isvalid,
119  bool isready);
120 static void index_update_stats(Relation rel,
121  bool hasindex,
122  double reltuples);
123 static void IndexCheckExclusion(Relation heapRelation,
124  Relation indexRelation,
125  IndexInfo *indexInfo);
126 static bool validate_index_callback(ItemPointer itemptr, void *opaque);
127 static bool ReindexIsCurrentlyProcessingIndex(Oid indexOid);
128 static void SetReindexProcessing(Oid heapOid, Oid indexOid);
129 static void ResetReindexProcessing(void);
130 static void SetReindexPending(List *indexes);
131 static void RemoveReindexPending(Oid indexOid);
132 static void ResetReindexPending(void);
133 
134 
135 /*
136  * relationHasPrimaryKey
137  * See whether an existing relation has a primary key.
138  *
139  * Caller must have suitable lock on the relation.
140  *
141  * Note: we intentionally do not check indisvalid here; that's because this
142  * is used to enforce the rule that there can be only one indisprimary index,
143  * and we want that to be true even if said index is invalid.
144  */
145 static bool
147 {
148  bool result = false;
149  List *indexoidlist;
150  ListCell *indexoidscan;
151 
152  /*
153  * Get the list of index OIDs for the table from the relcache, and look up
154  * each one in the pg_index syscache until we find one marked primary key
155  * (hopefully there isn't more than one such).
156  */
157  indexoidlist = RelationGetIndexList(rel);
158 
159  foreach(indexoidscan, indexoidlist)
160  {
161  Oid indexoid = lfirst_oid(indexoidscan);
162  HeapTuple indexTuple;
163 
164  indexTuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexoid));
165  if (!HeapTupleIsValid(indexTuple)) /* should not happen */
166  elog(ERROR, "cache lookup failed for index %u", indexoid);
167  result = ((Form_pg_index) GETSTRUCT(indexTuple))->indisprimary;
168  ReleaseSysCache(indexTuple);
169  if (result)
170  break;
171  }
172 
173  list_free(indexoidlist);
174 
175  return result;
176 }
177 
178 /*
179  * index_check_primary_key
180  * Apply special checks needed before creating a PRIMARY KEY index
181  *
182  * This processing used to be in DefineIndex(), but has been split out
183  * so that it can be applied during ALTER TABLE ADD PRIMARY KEY USING INDEX.
184  *
185  * We check for a pre-existing primary key, and that all columns of the index
186  * are simple column references (not expressions), and that all those
187  * columns are marked NOT NULL. If not, fail.
188  *
189  * We used to automatically change unmarked columns to NOT NULL here by doing
190  * our own local ALTER TABLE command. But that doesn't work well if we're
191  * executing one subcommand of an ALTER TABLE: the operations may not get
192  * performed in the right order overall. Now we expect that the parser
193  * inserted any required ALTER TABLE SET NOT NULL operations before trying
194  * to create a primary-key index.
195  *
196  * Caller had better have at least ShareLock on the table, else the not-null
197  * checking isn't trustworthy.
198  */
199 void
201  IndexInfo *indexInfo,
202  bool is_alter_table,
203  IndexStmt *stmt)
204 {
205  int i;
206 
207  /*
208  * If ALTER TABLE or CREATE TABLE .. PARTITION OF, check that there isn't
209  * already a PRIMARY KEY. In CREATE TABLE for an ordinary relation, we
210  * have faith that the parser rejected multiple pkey clauses; and CREATE
211  * INDEX doesn't have a way to say PRIMARY KEY, so it's no problem either.
212  */
213  if ((is_alter_table || heapRel->rd_rel->relispartition) &&
214  relationHasPrimaryKey(heapRel))
215  {
216  ereport(ERROR,
217  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
218  errmsg("multiple primary keys for table \"%s\" are not allowed",
219  RelationGetRelationName(heapRel))));
220  }
221 
222  /*
223  * Check that all of the attributes in a primary key are marked as not
224  * null. (We don't really expect to see that; it'd mean the parser messed
225  * up. But it seems wise to check anyway.)
226  */
227  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
228  {
229  AttrNumber attnum = indexInfo->ii_IndexAttrNumbers[i];
230  HeapTuple atttuple;
231  Form_pg_attribute attform;
232 
233  if (attnum == 0)
234  ereport(ERROR,
235  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
236  errmsg("primary keys cannot be expressions")));
237 
238  /* System attributes are never null, so no need to check */
239  if (attnum < 0)
240  continue;
241 
242  atttuple = SearchSysCache2(ATTNUM,
244  Int16GetDatum(attnum));
245  if (!HeapTupleIsValid(atttuple))
246  elog(ERROR, "cache lookup failed for attribute %d of relation %u",
247  attnum, RelationGetRelid(heapRel));
248  attform = (Form_pg_attribute) GETSTRUCT(atttuple);
249 
250  if (!attform->attnotnull)
251  ereport(ERROR,
252  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
253  errmsg("primary key column \"%s\" is not marked NOT NULL",
254  NameStr(attform->attname))));
255 
256  ReleaseSysCache(atttuple);
257  }
258 }
259 
260 /*
261  * ConstructTupleDescriptor
262  *
263  * Build an index tuple descriptor for a new index
264  */
265 static TupleDesc
267  IndexInfo *indexInfo,
268  List *indexColNames,
269  Oid accessMethodObjectId,
270  Oid *collationObjectId,
271  Oid *classObjectId)
272 {
273  int numatts = indexInfo->ii_NumIndexAttrs;
274  int numkeyatts = indexInfo->ii_NumIndexKeyAttrs;
275  ListCell *colnames_item = list_head(indexColNames);
276  ListCell *indexpr_item = list_head(indexInfo->ii_Expressions);
277  IndexAmRoutine *amroutine;
278  TupleDesc heapTupDesc;
279  TupleDesc indexTupDesc;
280  int natts; /* #atts in heap rel --- for error checks */
281  int i;
282 
283  /* We need access to the index AM's API struct */
284  amroutine = GetIndexAmRoutineByAmId(accessMethodObjectId, false);
285 
286  /* ... and to the table's tuple descriptor */
287  heapTupDesc = RelationGetDescr(heapRelation);
288  natts = RelationGetForm(heapRelation)->relnatts;
289 
290  /*
291  * allocate the new tuple descriptor
292  */
293  indexTupDesc = CreateTemplateTupleDesc(numatts);
294 
295  /*
296  * Fill in the pg_attribute row.
297  */
298  for (i = 0; i < numatts; i++)
299  {
300  AttrNumber atnum = indexInfo->ii_IndexAttrNumbers[i];
301  Form_pg_attribute to = TupleDescAttr(indexTupDesc, i);
302  HeapTuple tuple;
303  Form_pg_type typeTup;
304  Form_pg_opclass opclassTup;
305  Oid keyType;
306 
308  to->attnum = i + 1;
309  to->attstattarget = -1;
310  to->attcacheoff = -1;
311  to->attislocal = true;
312  to->attcollation = (i < numkeyatts) ?
313  collationObjectId[i] : InvalidOid;
314 
315  /*
316  * For simple index columns, we copy some pg_attribute fields from the
317  * parent relation. For expressions we have to look at the expression
318  * result.
319  */
320  if (atnum != 0)
321  {
322  /* Simple index column */
323  const FormData_pg_attribute *from;
324 
325  Assert(atnum > 0); /* should've been caught above */
326 
327  if (atnum > natts) /* safety check */
328  elog(ERROR, "invalid column number %d", atnum);
329  from = TupleDescAttr(heapTupDesc,
330  AttrNumberGetAttrOffset(atnum));
331 
332  namecpy(&to->attname, &from->attname);
333  to->atttypid = from->atttypid;
334  to->attlen = from->attlen;
335  to->attndims = from->attndims;
336  to->atttypmod = from->atttypmod;
337  to->attbyval = from->attbyval;
338  to->attstorage = from->attstorage;
339  to->attalign = from->attalign;
340  }
341  else
342  {
343  /* Expressional index */
344  Node *indexkey;
345 
346  if (indexpr_item == NULL) /* shouldn't happen */
347  elog(ERROR, "too few entries in indexprs list");
348  indexkey = (Node *) lfirst(indexpr_item);
349  indexpr_item = lnext(indexInfo->ii_Expressions, indexpr_item);
350 
351  /*
352  * Lookup the expression type in pg_type for the type length etc.
353  */
354  keyType = exprType(indexkey);
355  tuple = SearchSysCache1(TYPEOID, ObjectIdGetDatum(keyType));
356  if (!HeapTupleIsValid(tuple))
357  elog(ERROR, "cache lookup failed for type %u", keyType);
358  typeTup = (Form_pg_type) GETSTRUCT(tuple);
359 
360  /*
361  * Assign some of the attributes values. Leave the rest.
362  */
363  to->atttypid = keyType;
364  to->attlen = typeTup->typlen;
365  to->attbyval = typeTup->typbyval;
366  to->attstorage = typeTup->typstorage;
367  to->attalign = typeTup->typalign;
368  to->atttypmod = exprTypmod(indexkey);
369 
370  ReleaseSysCache(tuple);
371 
372  /*
373  * Make sure the expression yields a type that's safe to store in
374  * an index. We need this defense because we have index opclasses
375  * for pseudo-types such as "record", and the actually stored type
376  * had better be safe; eg, a named composite type is okay, an
377  * anonymous record type is not. The test is the same as for
378  * whether a table column is of a safe type (which is why we
379  * needn't check for the non-expression case).
380  */
381  CheckAttributeType(NameStr(to->attname),
382  to->atttypid, to->attcollation,
383  NIL, 0);
384  }
385 
386  /*
387  * We do not yet have the correct relation OID for the index, so just
388  * set it invalid for now. InitializeAttributeOids() will fix it
389  * later.
390  */
391  to->attrelid = InvalidOid;
392 
393  /*
394  * Set the attribute name as specified by caller.
395  */
396  if (colnames_item == NULL) /* shouldn't happen */
397  elog(ERROR, "too few entries in colnames list");
398  namestrcpy(&to->attname, (const char *) lfirst(colnames_item));
399  colnames_item = lnext(indexColNames, colnames_item);
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  /*
409  * Code below is concerned to the opclasses which are not used with
410  * the included columns.
411  */
412  if (i < indexInfo->ii_NumIndexKeyAttrs)
413  {
414  tuple = SearchSysCache1(CLAOID, ObjectIdGetDatum(classObjectId[i]));
415  if (!HeapTupleIsValid(tuple))
416  elog(ERROR, "cache lookup failed for opclass %u",
417  classObjectId[i]);
418  opclassTup = (Form_pg_opclass) GETSTRUCT(tuple);
419  if (OidIsValid(opclassTup->opckeytype))
420  keyType = opclassTup->opckeytype;
421 
422  /*
423  * If keytype is specified as ANYELEMENT, and opcintype is
424  * ANYARRAY, then the attribute type must be an array (else it'd
425  * not have matched this opclass); use its element type.
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 }
464 
465 /* ----------------------------------------------------------------
466  * InitializeAttributeOids
467  * ----------------------------------------------------------------
468  */
469 static void
471  int numatts,
472  Oid indexoid)
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 }
482 
483 /* ----------------------------------------------------------------
484  * AppendAttributeTuples
485  * ----------------------------------------------------------------
486  */
487 static void
488 AppendAttributeTuples(Relation indexRelation, int numatts)
489 {
490  Relation pg_attribute;
491  CatalogIndexState indstate;
492  TupleDesc indexTupDesc;
493  int i;
494 
495  /*
496  * open the attribute relation and its indexes
497  */
498  pg_attribute = table_open(AttributeRelationId, RowExclusiveLock);
499 
500  indstate = CatalogOpenIndexes(pg_attribute);
501 
502  /*
503  * insert data from new index's tupdesc into pg_attribute
504  */
505  indexTupDesc = RelationGetDescr(indexRelation);
506 
507  for (i = 0; i < numatts; i++)
508  {
509  Form_pg_attribute attr = TupleDescAttr(indexTupDesc, i);
510 
511  Assert(attr->attnum == i + 1);
512 
513  InsertPgAttributeTuple(pg_attribute, attr, indstate);
514  }
515 
516  CatalogCloseIndexes(indstate);
517 
518  table_close(pg_attribute, RowExclusiveLock);
519 }
520 
521 /* ----------------------------------------------------------------
522  * UpdateIndexRelation
523  *
524  * Construct and insert a new entry in the pg_index catalog
525  * ----------------------------------------------------------------
526  */
527 static void
529  Oid heapoid,
530  Oid parentIndexId,
531  IndexInfo *indexInfo,
532  Oid *collationOids,
533  Oid *classOids,
534  int16 *coloptions,
535  bool primary,
536  bool isexclusion,
537  bool immediate,
538  bool isvalid,
539  bool isready)
540 {
541  int2vector *indkey;
542  oidvector *indcollation;
543  oidvector *indclass;
544  int2vector *indoption;
545  Datum exprsDatum;
546  Datum predDatum;
547  Datum values[Natts_pg_index];
548  bool nulls[Natts_pg_index];
549  Relation pg_index;
550  HeapTuple tuple;
551  int i;
552 
553  /*
554  * Copy the index key, opclass, and indoption info into arrays (should we
555  * make the caller pass them like this to start with?)
556  */
557  indkey = buildint2vector(NULL, indexInfo->ii_NumIndexAttrs);
558  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
559  indkey->values[i] = indexInfo->ii_IndexAttrNumbers[i];
560  indcollation = buildoidvector(collationOids, indexInfo->ii_NumIndexKeyAttrs);
561  indclass = buildoidvector(classOids, indexInfo->ii_NumIndexKeyAttrs);
562  indoption = buildint2vector(coloptions, indexInfo->ii_NumIndexKeyAttrs);
563 
564  /*
565  * Convert the index expressions (if any) to a text datum
566  */
567  if (indexInfo->ii_Expressions != NIL)
568  {
569  char *exprsString;
570 
571  exprsString = nodeToString(indexInfo->ii_Expressions);
572  exprsDatum = CStringGetTextDatum(exprsString);
573  pfree(exprsString);
574  }
575  else
576  exprsDatum = (Datum) 0;
577 
578  /*
579  * Convert the index predicate (if any) to a text datum. Note we convert
580  * implicit-AND format to normal explicit-AND for storage.
581  */
582  if (indexInfo->ii_Predicate != NIL)
583  {
584  char *predString;
585 
586  predString = nodeToString(make_ands_explicit(indexInfo->ii_Predicate));
587  predDatum = CStringGetTextDatum(predString);
588  pfree(predString);
589  }
590  else
591  predDatum = (Datum) 0;
592 
593  /*
594  * open the system catalog index relation
595  */
596  pg_index = table_open(IndexRelationId, RowExclusiveLock);
597 
598  /*
599  * Build a pg_index tuple
600  */
601  MemSet(nulls, false, sizeof(nulls));
602 
603  values[Anum_pg_index_indexrelid - 1] = ObjectIdGetDatum(indexoid);
604  values[Anum_pg_index_indrelid - 1] = ObjectIdGetDatum(heapoid);
605  values[Anum_pg_index_indnatts - 1] = Int16GetDatum(indexInfo->ii_NumIndexAttrs);
606  values[Anum_pg_index_indnkeyatts - 1] = Int16GetDatum(indexInfo->ii_NumIndexKeyAttrs);
607  values[Anum_pg_index_indisunique - 1] = BoolGetDatum(indexInfo->ii_Unique);
608  values[Anum_pg_index_indisprimary - 1] = BoolGetDatum(primary);
609  values[Anum_pg_index_indisexclusion - 1] = BoolGetDatum(isexclusion);
610  values[Anum_pg_index_indimmediate - 1] = BoolGetDatum(immediate);
611  values[Anum_pg_index_indisclustered - 1] = BoolGetDatum(false);
612  values[Anum_pg_index_indisvalid - 1] = BoolGetDatum(isvalid);
613  values[Anum_pg_index_indcheckxmin - 1] = BoolGetDatum(false);
614  values[Anum_pg_index_indisready - 1] = BoolGetDatum(isready);
615  values[Anum_pg_index_indislive - 1] = BoolGetDatum(true);
616  values[Anum_pg_index_indisreplident - 1] = BoolGetDatum(false);
617  values[Anum_pg_index_indkey - 1] = PointerGetDatum(indkey);
618  values[Anum_pg_index_indcollation - 1] = PointerGetDatum(indcollation);
619  values[Anum_pg_index_indclass - 1] = PointerGetDatum(indclass);
620  values[Anum_pg_index_indoption - 1] = PointerGetDatum(indoption);
621  values[Anum_pg_index_indexprs - 1] = exprsDatum;
622  if (exprsDatum == (Datum) 0)
623  nulls[Anum_pg_index_indexprs - 1] = true;
624  values[Anum_pg_index_indpred - 1] = predDatum;
625  if (predDatum == (Datum) 0)
626  nulls[Anum_pg_index_indpred - 1] = true;
627 
628  tuple = heap_form_tuple(RelationGetDescr(pg_index), values, nulls);
629 
630  /*
631  * insert the tuple into the pg_index catalog
632  */
633  CatalogTupleInsert(pg_index, tuple);
634 
635  /*
636  * close the relation and free the tuple
637  */
638  table_close(pg_index, RowExclusiveLock);
639  heap_freetuple(tuple);
640 }
641 
642 
643 /*
644  * index_create
645  *
646  * heapRelation: table to build index on (suitably locked by caller)
647  * indexRelationName: what it say
648  * indexRelationId: normally, pass InvalidOid to let this routine
649  * generate an OID for the index. During bootstrap this may be
650  * nonzero to specify a preselected OID.
651  * parentIndexRelid: if creating an index partition, the OID of the
652  * parent index; otherwise InvalidOid.
653  * parentConstraintId: if creating a constraint on a partition, the OID
654  * of the constraint in the parent; otherwise InvalidOid.
655  * relFileNode: normally, pass InvalidOid to get new storage. May be
656  * nonzero to attach an existing valid build.
657  * indexInfo: same info executor uses to insert into the index
658  * indexColNames: column names to use for index (List of char *)
659  * accessMethodObjectId: OID of index AM to use
660  * tableSpaceId: OID of tablespace to use
661  * collationObjectId: array of collation OIDs, one per index column
662  * classObjectId: array of index opclass OIDs, one per index column
663  * coloptions: array of per-index-column indoption settings
664  * reloptions: AM-specific options
665  * flags: bitmask that can include any combination of these bits:
666  * INDEX_CREATE_IS_PRIMARY
667  * the index is a primary key
668  * INDEX_CREATE_ADD_CONSTRAINT:
669  * invoke index_constraint_create also
670  * INDEX_CREATE_SKIP_BUILD:
671  * skip the index_build() step for the moment; caller must do it
672  * later (typically via reindex_index())
673  * INDEX_CREATE_CONCURRENT:
674  * do not lock the table against writers. The index will be
675  * marked "invalid" and the caller must take additional steps
676  * to fix it up.
677  * INDEX_CREATE_IF_NOT_EXISTS:
678  * do not throw an error if a relation with the same name
679  * already exists.
680  * INDEX_CREATE_PARTITIONED:
681  * create a partitioned index (table must be partitioned)
682  * constr_flags: flags passed to index_constraint_create
683  * (only if INDEX_CREATE_ADD_CONSTRAINT is set)
684  * allow_system_table_mods: allow table to be a system catalog
685  * is_internal: if true, post creation hook for new index
686  * constraintId: if not NULL, receives OID of created constraint
687  *
688  * Returns the OID of the created index.
689  */
690 Oid
691 index_create(Relation heapRelation,
692  const char *indexRelationName,
693  Oid indexRelationId,
694  Oid parentIndexRelid,
695  Oid parentConstraintId,
696  Oid relFileNode,
697  IndexInfo *indexInfo,
698  List *indexColNames,
699  Oid accessMethodObjectId,
700  Oid tableSpaceId,
701  Oid *collationObjectId,
702  Oid *classObjectId,
703  int16 *coloptions,
704  Datum reloptions,
705  bits16 flags,
706  bits16 constr_flags,
707  bool allow_system_table_mods,
708  bool is_internal,
709  Oid *constraintId)
710 {
711  Oid heapRelationId = RelationGetRelid(heapRelation);
712  Relation pg_class;
713  Relation indexRelation;
714  TupleDesc indexTupDesc;
715  bool shared_relation;
716  bool mapped_relation;
717  bool is_exclusion;
718  Oid namespaceId;
719  int i;
720  char relpersistence;
721  bool isprimary = (flags & INDEX_CREATE_IS_PRIMARY) != 0;
722  bool invalid = (flags & INDEX_CREATE_INVALID) != 0;
723  bool concurrent = (flags & INDEX_CREATE_CONCURRENT) != 0;
724  bool partitioned = (flags & INDEX_CREATE_PARTITIONED) != 0;
725  char relkind;
728 
729  /* constraint flags can only be set when a constraint is requested */
730  Assert((constr_flags == 0) ||
731  ((flags & INDEX_CREATE_ADD_CONSTRAINT) != 0));
732  /* partitioned indexes must never be "built" by themselves */
733  Assert(!partitioned || (flags & INDEX_CREATE_SKIP_BUILD));
734 
735  relkind = partitioned ? RELKIND_PARTITIONED_INDEX : RELKIND_INDEX;
736  is_exclusion = (indexInfo->ii_ExclusionOps != NULL);
737 
738  pg_class = table_open(RelationRelationId, RowExclusiveLock);
739 
740  /*
741  * The index will be in the same namespace as its parent table, and is
742  * shared across databases if and only if the parent is. Likewise, it
743  * will use the relfilenode map if and only if the parent does; and it
744  * inherits the parent's relpersistence.
745  */
746  namespaceId = RelationGetNamespace(heapRelation);
747  shared_relation = heapRelation->rd_rel->relisshared;
748  mapped_relation = RelationIsMapped(heapRelation);
749  relpersistence = heapRelation->rd_rel->relpersistence;
750 
751  /*
752  * check parameters
753  */
754  if (indexInfo->ii_NumIndexAttrs < 1)
755  elog(ERROR, "must index at least one column");
756 
757  if (!allow_system_table_mods &&
758  IsSystemRelation(heapRelation) &&
760  ereport(ERROR,
761  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
762  errmsg("user-defined indexes on system catalog tables are not supported")));
763 
764  /*
765  * Btree text_pattern_ops uses text_eq as the equality operator, which is
766  * fine as long as the collation is deterministic; text_eq then reduces to
767  * bitwise equality and so it is semantically compatible with the other
768  * operators and functions in that opclass. But with a nondeterministic
769  * collation, text_eq could yield results that are incompatible with the
770  * actual behavior of the index (which is determined by the opclass's
771  * comparison function). We prevent such problems by refusing creation of
772  * an index with that opclass and a nondeterministic collation.
773  *
774  * The same applies to varchar_pattern_ops and bpchar_pattern_ops. If we
775  * find more cases, we might decide to create a real mechanism for marking
776  * opclasses as incompatible with nondeterminism; but for now, this small
777  * hack suffices.
778  *
779  * Another solution is to use a special operator, not text_eq, as the
780  * equality opclass member; but that is undesirable because it would
781  * prevent index usage in many queries that work fine today.
782  */
783  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
784  {
785  Oid collation = collationObjectId[i];
786  Oid opclass = classObjectId[i];
787 
788  if (collation)
789  {
790  if ((opclass == TEXT_BTREE_PATTERN_OPS_OID ||
791  opclass == VARCHAR_BTREE_PATTERN_OPS_OID ||
792  opclass == BPCHAR_BTREE_PATTERN_OPS_OID) &&
793  !get_collation_isdeterministic(collation))
794  {
795  HeapTuple classtup;
796 
797  classtup = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
798  if (!HeapTupleIsValid(classtup))
799  elog(ERROR, "cache lookup failed for operator class %u", opclass);
800  ereport(ERROR,
801  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
802  errmsg("nondeterministic collations are not supported for operator class \"%s\"",
803  NameStr(((Form_pg_opclass) GETSTRUCT(classtup))->opcname))));
804  ReleaseSysCache(classtup);
805  }
806  }
807  }
808 
809  /*
810  * Concurrent index build on a system catalog is unsafe because we tend to
811  * release locks before committing in catalogs.
812  */
813  if (concurrent &&
814  IsCatalogRelation(heapRelation))
815  ereport(ERROR,
816  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
817  errmsg("concurrent index creation on system catalog tables is not supported")));
818 
819  /*
820  * This case is currently not supported. There's no way to ask for it in
821  * the grammar with CREATE INDEX, but it can happen with REINDEX.
822  */
823  if (concurrent && is_exclusion)
824  ereport(ERROR,
825  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
826  errmsg("concurrent index creation for exclusion constraints is not supported")));
827 
828  /*
829  * We cannot allow indexing a shared relation after initdb (because
830  * there's no way to make the entry in other databases' pg_class).
831  */
832  if (shared_relation && !IsBootstrapProcessingMode())
833  ereport(ERROR,
834  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
835  errmsg("shared indexes cannot be created after initdb")));
836 
837  /*
838  * Shared relations must be in pg_global, too (last-ditch check)
839  */
840  if (shared_relation && tableSpaceId != GLOBALTABLESPACE_OID)
841  elog(ERROR, "shared relations must be placed in pg_global tablespace");
842 
843  /*
844  * Check for duplicate name (both as to the index, and as to the
845  * associated constraint if any). Such cases would fail on the relevant
846  * catalogs' unique indexes anyway, but we prefer to give a friendlier
847  * error message.
848  */
849  if (get_relname_relid(indexRelationName, namespaceId))
850  {
851  if ((flags & INDEX_CREATE_IF_NOT_EXISTS) != 0)
852  {
853  ereport(NOTICE,
854  (errcode(ERRCODE_DUPLICATE_TABLE),
855  errmsg("relation \"%s\" already exists, skipping",
856  indexRelationName)));
857  table_close(pg_class, RowExclusiveLock);
858  return InvalidOid;
859  }
860 
861  ereport(ERROR,
862  (errcode(ERRCODE_DUPLICATE_TABLE),
863  errmsg("relation \"%s\" already exists",
864  indexRelationName)));
865  }
866 
867  if ((flags & INDEX_CREATE_ADD_CONSTRAINT) != 0 &&
869  indexRelationName))
870  {
871  /*
872  * INDEX_CREATE_IF_NOT_EXISTS does not apply here, since the
873  * conflicting constraint is not an index.
874  */
875  ereport(ERROR,
877  errmsg("constraint \"%s\" for relation \"%s\" already exists",
878  indexRelationName, RelationGetRelationName(heapRelation))));
879  }
880 
881  /*
882  * construct tuple descriptor for index tuples
883  */
884  indexTupDesc = ConstructTupleDescriptor(heapRelation,
885  indexInfo,
886  indexColNames,
887  accessMethodObjectId,
888  collationObjectId,
889  classObjectId);
890 
891  /*
892  * Allocate an OID for the index, unless we were told what to use.
893  *
894  * The OID will be the relfilenode as well, so make sure it doesn't
895  * collide with either pg_class OIDs or existing physical files.
896  */
897  if (!OidIsValid(indexRelationId))
898  {
899  /* Use binary-upgrade override for pg_class.oid/relfilenode? */
900  if (IsBinaryUpgrade)
901  {
903  ereport(ERROR,
904  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
905  errmsg("pg_class index OID value not set when in binary upgrade mode")));
906 
907  indexRelationId = binary_upgrade_next_index_pg_class_oid;
909  }
910  else
911  {
912  indexRelationId =
913  GetNewRelFileNode(tableSpaceId, pg_class, relpersistence);
914  }
915  }
916 
917  /*
918  * create the index relation's relcache entry and, if necessary, the
919  * physical disk file. (If we fail further down, it's the smgr's
920  * responsibility to remove the disk file again, if any.)
921  */
922  indexRelation = heap_create(indexRelationName,
923  namespaceId,
924  tableSpaceId,
925  indexRelationId,
926  relFileNode,
927  accessMethodObjectId,
928  indexTupDesc,
929  relkind,
930  relpersistence,
931  shared_relation,
932  mapped_relation,
933  allow_system_table_mods,
934  &relfrozenxid,
935  &relminmxid);
936 
937  Assert(relfrozenxid == InvalidTransactionId);
938  Assert(relminmxid == InvalidMultiXactId);
939  Assert(indexRelationId == RelationGetRelid(indexRelation));
940 
941  /*
942  * Obtain exclusive lock on it. Although no other transactions can see it
943  * until we commit, this prevents deadlock-risk complaints from lock
944  * manager in cases such as CLUSTER.
945  */
946  LockRelation(indexRelation, AccessExclusiveLock);
947 
948  /*
949  * Fill in fields of the index's pg_class entry that are not set correctly
950  * by heap_create.
951  *
952  * XXX should have a cleaner way to create cataloged indexes
953  */
954  indexRelation->rd_rel->relowner = heapRelation->rd_rel->relowner;
955  indexRelation->rd_rel->relam = accessMethodObjectId;
956  indexRelation->rd_rel->relispartition = OidIsValid(parentIndexRelid);
957 
958  /*
959  * store index's pg_class entry
960  */
961  InsertPgClassTuple(pg_class, indexRelation,
962  RelationGetRelid(indexRelation),
963  (Datum) 0,
964  reloptions);
965 
966  /* done with pg_class */
967  table_close(pg_class, RowExclusiveLock);
968 
969  /*
970  * now update the object id's of all the attribute tuple forms in the
971  * index relation's tuple descriptor
972  */
973  InitializeAttributeOids(indexRelation,
974  indexInfo->ii_NumIndexAttrs,
975  indexRelationId);
976 
977  /*
978  * append ATTRIBUTE tuples for the index
979  */
980  AppendAttributeTuples(indexRelation, indexInfo->ii_NumIndexAttrs);
981 
982  /* ----------------
983  * update pg_index
984  * (append INDEX tuple)
985  *
986  * Note that this stows away a representation of "predicate".
987  * (Or, could define a rule to maintain the predicate) --Nels, Feb '92
988  * ----------------
989  */
990  UpdateIndexRelation(indexRelationId, heapRelationId, parentIndexRelid,
991  indexInfo,
992  collationObjectId, classObjectId, coloptions,
993  isprimary, is_exclusion,
994  (constr_flags & INDEX_CONSTR_CREATE_DEFERRABLE) == 0,
995  !concurrent && !invalid,
996  !concurrent);
997 
998  /*
999  * Register relcache invalidation on the indexes' heap relation, to
1000  * maintain consistency of its index list
1001  */
1002  CacheInvalidateRelcache(heapRelation);
1003 
1004  /* update pg_inherits and the parent's relhassubclass, if needed */
1005  if (OidIsValid(parentIndexRelid))
1006  {
1007  StoreSingleInheritance(indexRelationId, parentIndexRelid, 1);
1008  SetRelationHasSubclass(parentIndexRelid, true);
1009  }
1010 
1011  /*
1012  * Register constraint and dependencies for the index.
1013  *
1014  * If the index is from a CONSTRAINT clause, construct a pg_constraint
1015  * entry. The index will be linked to the constraint, which in turn is
1016  * linked to the table. If it's not a CONSTRAINT, we need to make a
1017  * dependency directly on the table.
1018  *
1019  * We don't need a dependency on the namespace, because there'll be an
1020  * indirect dependency via our parent table.
1021  *
1022  * During bootstrap we can't register any dependencies, and we don't try
1023  * to make a constraint either.
1024  */
1026  {
1027  ObjectAddress myself,
1028  referenced;
1029 
1030  myself.classId = RelationRelationId;
1031  myself.objectId = indexRelationId;
1032  myself.objectSubId = 0;
1033 
1034  if ((flags & INDEX_CREATE_ADD_CONSTRAINT) != 0)
1035  {
1036  char constraintType;
1037  ObjectAddress localaddr;
1038 
1039  if (isprimary)
1040  constraintType = CONSTRAINT_PRIMARY;
1041  else if (indexInfo->ii_Unique)
1042  constraintType = CONSTRAINT_UNIQUE;
1043  else if (is_exclusion)
1044  constraintType = CONSTRAINT_EXCLUSION;
1045  else
1046  {
1047  elog(ERROR, "constraint must be PRIMARY, UNIQUE or EXCLUDE");
1048  constraintType = 0; /* keep compiler quiet */
1049  }
1050 
1051  localaddr = index_constraint_create(heapRelation,
1052  indexRelationId,
1053  parentConstraintId,
1054  indexInfo,
1055  indexRelationName,
1056  constraintType,
1057  constr_flags,
1058  allow_system_table_mods,
1059  is_internal);
1060  if (constraintId)
1061  *constraintId = localaddr.objectId;
1062  }
1063  else
1064  {
1065  bool have_simple_col = false;
1066 
1067  /* Create auto dependencies on simply-referenced columns */
1068  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
1069  {
1070  if (indexInfo->ii_IndexAttrNumbers[i] != 0)
1071  {
1072  referenced.classId = RelationRelationId;
1073  referenced.objectId = heapRelationId;
1074  referenced.objectSubId = indexInfo->ii_IndexAttrNumbers[i];
1075 
1076  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
1077 
1078  have_simple_col = true;
1079  }
1080  }
1081 
1082  /*
1083  * If there are no simply-referenced columns, give the index an
1084  * auto dependency on the whole table. In most cases, this will
1085  * be redundant, but it might not be if the index expressions and
1086  * predicate contain no Vars or only whole-row Vars.
1087  */
1088  if (!have_simple_col)
1089  {
1090  referenced.classId = RelationRelationId;
1091  referenced.objectId = heapRelationId;
1092  referenced.objectSubId = 0;
1093 
1094  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
1095  }
1096  }
1097 
1098  /*
1099  * If this is an index partition, create partition dependencies on
1100  * both the parent index and the table. (Note: these must be *in
1101  * addition to*, not instead of, all other dependencies. Otherwise
1102  * we'll be short some dependencies after DETACH PARTITION.)
1103  */
1104  if (OidIsValid(parentIndexRelid))
1105  {
1106  referenced.classId = RelationRelationId;
1107  referenced.objectId = parentIndexRelid;
1108  referenced.objectSubId = 0;
1109 
1110  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_PRI);
1111 
1112  referenced.classId = RelationRelationId;
1113  referenced.objectId = heapRelationId;
1114  referenced.objectSubId = 0;
1115 
1116  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_SEC);
1117  }
1118 
1119  /* Store dependency on collations */
1120  /* The default collation is pinned, so don't bother recording it */
1121  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
1122  {
1123  if (OidIsValid(collationObjectId[i]) &&
1124  collationObjectId[i] != DEFAULT_COLLATION_OID)
1125  {
1126  referenced.classId = CollationRelationId;
1127  referenced.objectId = collationObjectId[i];
1128  referenced.objectSubId = 0;
1129 
1130  recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
1131  }
1132  }
1133 
1134  /* Store dependency on operator classes */
1135  for (i = 0; i < indexInfo->ii_NumIndexKeyAttrs; i++)
1136  {
1137  referenced.classId = OperatorClassRelationId;
1138  referenced.objectId = classObjectId[i];
1139  referenced.objectSubId = 0;
1140 
1141  recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
1142  }
1143 
1144  /* Store dependencies on anything mentioned in index expressions */
1145  if (indexInfo->ii_Expressions)
1146  {
1148  (Node *) indexInfo->ii_Expressions,
1149  heapRelationId,
1151  DEPENDENCY_AUTO, false);
1152  }
1153 
1154  /* Store dependencies on anything mentioned in predicate */
1155  if (indexInfo->ii_Predicate)
1156  {
1158  (Node *) indexInfo->ii_Predicate,
1159  heapRelationId,
1161  DEPENDENCY_AUTO, false);
1162  }
1163  }
1164  else
1165  {
1166  /* Bootstrap mode - assert we weren't asked for constraint support */
1167  Assert((flags & INDEX_CREATE_ADD_CONSTRAINT) == 0);
1168  }
1169 
1170  /* Post creation hook for new index */
1171  InvokeObjectPostCreateHookArg(RelationRelationId,
1172  indexRelationId, 0, is_internal);
1173 
1174  /*
1175  * Advance the command counter so that we can see the newly-entered
1176  * catalog tuples for the index.
1177  */
1179 
1180  /*
1181  * In bootstrap mode, we have to fill in the index strategy structure with
1182  * information from the catalogs. If we aren't bootstrapping, then the
1183  * relcache entry has already been rebuilt thanks to sinval update during
1184  * CommandCounterIncrement.
1185  */
1187  RelationInitIndexAccessInfo(indexRelation);
1188  else
1189  Assert(indexRelation->rd_indexcxt != NULL);
1190 
1191  indexRelation->rd_index->indnkeyatts = indexInfo->ii_NumIndexKeyAttrs;
1192 
1193  /*
1194  * If this is bootstrap (initdb) time, then we don't actually fill in the
1195  * index yet. We'll be creating more indexes and classes later, so we
1196  * delay filling them in until just before we're done with bootstrapping.
1197  * Similarly, if the caller specified to skip the build then filling the
1198  * index is delayed till later (ALTER TABLE can save work in some cases
1199  * with this). Otherwise, we call the AM routine that constructs the
1200  * index.
1201  */
1203  {
1204  index_register(heapRelationId, indexRelationId, indexInfo);
1205  }
1206  else if ((flags & INDEX_CREATE_SKIP_BUILD) != 0)
1207  {
1208  /*
1209  * Caller is responsible for filling the index later on. However,
1210  * we'd better make sure that the heap relation is correctly marked as
1211  * having an index.
1212  */
1213  index_update_stats(heapRelation,
1214  true,
1215  -1.0);
1216  /* Make the above update visible */
1218  }
1219  else
1220  {
1221  index_build(heapRelation, indexRelation, indexInfo, false, true);
1222  }
1223 
1224  /*
1225  * Close the index; but we keep the lock that we acquired above until end
1226  * of transaction. Closing the heap is caller's responsibility.
1227  */
1228  index_close(indexRelation, NoLock);
1229 
1230  return indexRelationId;
1231 }
1232 
1233 /*
1234  * index_concurrently_create_copy
1235  *
1236  * Create concurrently an index based on the definition of the one provided by
1237  * caller. The index is inserted into catalogs and needs to be built later
1238  * on. This is called during concurrent reindex processing.
1239  */
1240 Oid
1241 index_concurrently_create_copy(Relation heapRelation, Oid oldIndexId, const char *newName)
1242 {
1243  Relation indexRelation;
1244  IndexInfo *oldInfo,
1245  *newInfo;
1246  Oid newIndexId = InvalidOid;
1247  HeapTuple indexTuple,
1248  classTuple;
1249  Datum indclassDatum,
1250  colOptionDatum,
1251  optionDatum;
1252  oidvector *indclass;
1253  int2vector *indcoloptions;
1254  bool isnull;
1255  List *indexColNames = NIL;
1256  List *indexExprs = NIL;
1257  List *indexPreds = NIL;
1258 
1259  indexRelation = index_open(oldIndexId, RowExclusiveLock);
1260 
1261  /* The new index needs some information from the old index */
1262  oldInfo = BuildIndexInfo(indexRelation);
1263 
1264  /*
1265  * Concurrent build of an index with exclusion constraints is not
1266  * supported.
1267  */
1268  if (oldInfo->ii_ExclusionOps != NULL)
1269  ereport(ERROR,
1270  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1271  errmsg("concurrent index creation for exclusion constraints is not supported")));
1272 
1273  /* Get the array of class and column options IDs from index info */
1274  indexTuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(oldIndexId));
1275  if (!HeapTupleIsValid(indexTuple))
1276  elog(ERROR, "cache lookup failed for index %u", oldIndexId);
1277  indclassDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1278  Anum_pg_index_indclass, &isnull);
1279  Assert(!isnull);
1280  indclass = (oidvector *) DatumGetPointer(indclassDatum);
1281 
1282  colOptionDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1283  Anum_pg_index_indoption, &isnull);
1284  Assert(!isnull);
1285  indcoloptions = (int2vector *) DatumGetPointer(colOptionDatum);
1286 
1287  /* Fetch options of index if any */
1288  classTuple = SearchSysCache1(RELOID, oldIndexId);
1289  if (!HeapTupleIsValid(classTuple))
1290  elog(ERROR, "cache lookup failed for relation %u", oldIndexId);
1291  optionDatum = SysCacheGetAttr(RELOID, classTuple,
1292  Anum_pg_class_reloptions, &isnull);
1293 
1294  /*
1295  * Fetch the list of expressions and predicates directly from the
1296  * catalogs. This cannot rely on the information from IndexInfo of the
1297  * old index as these have been flattened for the planner.
1298  */
1299  if (oldInfo->ii_Expressions != NIL)
1300  {
1301  Datum exprDatum;
1302  char *exprString;
1303 
1304  exprDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1305  Anum_pg_index_indexprs, &isnull);
1306  Assert(!isnull);
1307  exprString = TextDatumGetCString(exprDatum);
1308  indexExprs = (List *) stringToNode(exprString);
1309  pfree(exprString);
1310  }
1311  if (oldInfo->ii_Predicate != NIL)
1312  {
1313  Datum predDatum;
1314  char *predString;
1315 
1316  predDatum = SysCacheGetAttr(INDEXRELID, indexTuple,
1317  Anum_pg_index_indpred, &isnull);
1318  Assert(!isnull);
1319  predString = TextDatumGetCString(predDatum);
1320  indexPreds = (List *) stringToNode(predString);
1321 
1322  /* Also convert to implicit-AND format */
1323  indexPreds = make_ands_implicit((Expr *) indexPreds);
1324  pfree(predString);
1325  }
1326 
1327  /*
1328  * Build the index information for the new index. Note that rebuild of
1329  * indexes with exclusion constraints is not supported, hence there is no
1330  * need to fill all the ii_Exclusion* fields.
1331  */
1332  newInfo = makeIndexInfo(oldInfo->ii_NumIndexAttrs,
1333  oldInfo->ii_NumIndexKeyAttrs,
1334  oldInfo->ii_Am,
1335  indexExprs,
1336  indexPreds,
1337  oldInfo->ii_Unique,
1338  false, /* not ready for inserts */
1339  true);
1340 
1341  /*
1342  * Extract the list of column names and the column numbers for the new
1343  * index information. All this information will be used for the index
1344  * creation.
1345  */
1346  for (int i = 0; i < oldInfo->ii_NumIndexAttrs; i++)
1347  {
1348  TupleDesc indexTupDesc = RelationGetDescr(indexRelation);
1349  Form_pg_attribute att = TupleDescAttr(indexTupDesc, i);
1350 
1351  indexColNames = lappend(indexColNames, NameStr(att->attname));
1352  newInfo->ii_IndexAttrNumbers[i] = oldInfo->ii_IndexAttrNumbers[i];
1353  }
1354 
1355  /*
1356  * Now create the new index.
1357  *
1358  * For a partition index, we adjust the partition dependency later, to
1359  * ensure a consistent state at all times. That is why parentIndexRelid
1360  * is not set here.
1361  */
1362  newIndexId = index_create(heapRelation,
1363  newName,
1364  InvalidOid, /* indexRelationId */
1365  InvalidOid, /* parentIndexRelid */
1366  InvalidOid, /* parentConstraintId */
1367  InvalidOid, /* relFileNode */
1368  newInfo,
1369  indexColNames,
1370  indexRelation->rd_rel->relam,
1371  indexRelation->rd_rel->reltablespace,
1372  indexRelation->rd_indcollation,
1373  indclass->values,
1374  indcoloptions->values,
1375  optionDatum,
1377  0,
1378  true, /* allow table to be a system catalog? */
1379  false, /* is_internal? */
1380  NULL);
1381 
1382  /* Close the relations used and clean up */
1383  index_close(indexRelation, NoLock);
1384  ReleaseSysCache(indexTuple);
1385  ReleaseSysCache(classTuple);
1386 
1387  return newIndexId;
1388 }
1389 
1390 /*
1391  * index_concurrently_build
1392  *
1393  * Build index for a concurrent operation. Low-level locks are taken when
1394  * this operation is performed to prevent only schema changes, but they need
1395  * to be kept until the end of the transaction performing this operation.
1396  * 'indexOid' refers to an index relation OID already created as part of
1397  * previous processing, and 'heapOid' refers to its parent heap relation.
1398  */
1399 void
1401  Oid indexRelationId)
1402 {
1403  Relation heapRel;
1404  Relation indexRelation;
1405  IndexInfo *indexInfo;
1406 
1407  /* This had better make sure that a snapshot is active */
1409 
1410  /* Open and lock the parent heap relation */
1411  heapRel = table_open(heapRelationId, ShareUpdateExclusiveLock);
1412 
1413  /* And the target index relation */
1414  indexRelation = index_open(indexRelationId, RowExclusiveLock);
1415 
1416  /*
1417  * We have to re-build the IndexInfo struct, since it was lost in the
1418  * commit of the transaction where this concurrent index was created at
1419  * the catalog level.
1420  */
1421  indexInfo = BuildIndexInfo(indexRelation);
1422  Assert(!indexInfo->ii_ReadyForInserts);
1423  indexInfo->ii_Concurrent = true;
1424  indexInfo->ii_BrokenHotChain = false;
1425 
1426  /* Now build the index */
1427  index_build(heapRel, indexRelation, indexInfo, false, true);
1428 
1429  /* Close both the relations, but keep the locks */
1430  table_close(heapRel, NoLock);
1431  index_close(indexRelation, NoLock);
1432 
1433  /*
1434  * Update the pg_index row to mark the index as ready for inserts. Once we
1435  * commit this transaction, any new transactions that open the table must
1436  * insert new entries into the index for insertions and non-HOT updates.
1437  */
1439 }
1440 
1441 /*
1442  * index_concurrently_swap
1443  *
1444  * Swap name, dependencies, and constraints of the old index over to the new
1445  * index, while marking the old index as invalid and the new as valid.
1446  */
1447 void
1448 index_concurrently_swap(Oid newIndexId, Oid oldIndexId, const char *oldName)
1449 {
1450  Relation pg_class,
1451  pg_index,
1452  pg_constraint,
1453  pg_trigger;
1454  Relation oldClassRel,
1455  newClassRel;
1456  HeapTuple oldClassTuple,
1457  newClassTuple;
1458  Form_pg_class oldClassForm,
1459  newClassForm;
1460  HeapTuple oldIndexTuple,
1461  newIndexTuple;
1462  Form_pg_index oldIndexForm,
1463  newIndexForm;
1464  bool isPartition;
1465  Oid indexConstraintOid;
1466  List *constraintOids = NIL;
1467  ListCell *lc;
1468 
1469  /*
1470  * Take a necessary lock on the old and new index before swapping them.
1471  */
1472  oldClassRel = relation_open(oldIndexId, ShareUpdateExclusiveLock);
1473  newClassRel = relation_open(newIndexId, ShareUpdateExclusiveLock);
1474 
1475  /* Now swap names and dependencies of those indexes */
1476  pg_class = table_open(RelationRelationId, RowExclusiveLock);
1477 
1478  oldClassTuple = SearchSysCacheCopy1(RELOID,
1479  ObjectIdGetDatum(oldIndexId));
1480  if (!HeapTupleIsValid(oldClassTuple))
1481  elog(ERROR, "could not find tuple for relation %u", oldIndexId);
1482  newClassTuple = SearchSysCacheCopy1(RELOID,
1483  ObjectIdGetDatum(newIndexId));
1484  if (!HeapTupleIsValid(newClassTuple))
1485  elog(ERROR, "could not find tuple for relation %u", newIndexId);
1486 
1487  oldClassForm = (Form_pg_class) GETSTRUCT(oldClassTuple);
1488  newClassForm = (Form_pg_class) GETSTRUCT(newClassTuple);
1489 
1490  /* Swap the names */
1491  namestrcpy(&newClassForm->relname, NameStr(oldClassForm->relname));
1492  namestrcpy(&oldClassForm->relname, oldName);
1493 
1494  /* Swap the partition flags to track inheritance properly */
1495  isPartition = newClassForm->relispartition;
1496  newClassForm->relispartition = oldClassForm->relispartition;
1497  oldClassForm->relispartition = isPartition;
1498 
1499  CatalogTupleUpdate(pg_class, &oldClassTuple->t_self, oldClassTuple);
1500  CatalogTupleUpdate(pg_class, &newClassTuple->t_self, newClassTuple);
1501 
1502  heap_freetuple(oldClassTuple);
1503  heap_freetuple(newClassTuple);
1504 
1505  /* Now swap index info */
1506  pg_index = table_open(IndexRelationId, RowExclusiveLock);
1507 
1508  oldIndexTuple = SearchSysCacheCopy1(INDEXRELID,
1509  ObjectIdGetDatum(oldIndexId));
1510  if (!HeapTupleIsValid(oldIndexTuple))
1511  elog(ERROR, "could not find tuple for relation %u", oldIndexId);
1512  newIndexTuple = SearchSysCacheCopy1(INDEXRELID,
1513  ObjectIdGetDatum(newIndexId));
1514  if (!HeapTupleIsValid(newIndexTuple))
1515  elog(ERROR, "could not find tuple for relation %u", newIndexId);
1516 
1517  oldIndexForm = (Form_pg_index) GETSTRUCT(oldIndexTuple);
1518  newIndexForm = (Form_pg_index) GETSTRUCT(newIndexTuple);
1519 
1520  /*
1521  * Copy constraint flags from the old index. This is safe because the old
1522  * index guaranteed uniqueness.
1523  */
1524  newIndexForm->indisprimary = oldIndexForm->indisprimary;
1525  oldIndexForm->indisprimary = false;
1526  newIndexForm->indisexclusion = oldIndexForm->indisexclusion;
1527  oldIndexForm->indisexclusion = false;
1528  newIndexForm->indimmediate = oldIndexForm->indimmediate;
1529  oldIndexForm->indimmediate = true;
1530 
1531  /* Mark old index as valid and new as invalid as index_set_state_flags */
1532  newIndexForm->indisvalid = true;
1533  oldIndexForm->indisvalid = false;
1534  oldIndexForm->indisclustered = false;
1535 
1536  CatalogTupleUpdate(pg_index, &oldIndexTuple->t_self, oldIndexTuple);
1537  CatalogTupleUpdate(pg_index, &newIndexTuple->t_self, newIndexTuple);
1538 
1539  heap_freetuple(oldIndexTuple);
1540  heap_freetuple(newIndexTuple);
1541 
1542  /*
1543  * Move constraints and triggers over to the new index
1544  */
1545 
1546  constraintOids = get_index_ref_constraints(oldIndexId);
1547 
1548  indexConstraintOid = get_index_constraint(oldIndexId);
1549 
1550  if (OidIsValid(indexConstraintOid))
1551  constraintOids = lappend_oid(constraintOids, indexConstraintOid);
1552 
1553  pg_constraint = table_open(ConstraintRelationId, RowExclusiveLock);
1554  pg_trigger = table_open(TriggerRelationId, RowExclusiveLock);
1555 
1556  foreach(lc, constraintOids)
1557  {
1558  HeapTuple constraintTuple,
1559  triggerTuple;
1560  Form_pg_constraint conForm;
1561  ScanKeyData key[1];
1562  SysScanDesc scan;
1563  Oid constraintOid = lfirst_oid(lc);
1564 
1565  /* Move the constraint from the old to the new index */
1566  constraintTuple = SearchSysCacheCopy1(CONSTROID,
1567  ObjectIdGetDatum(constraintOid));
1568  if (!HeapTupleIsValid(constraintTuple))
1569  elog(ERROR, "could not find tuple for constraint %u", constraintOid);
1570 
1571  conForm = ((Form_pg_constraint) GETSTRUCT(constraintTuple));
1572 
1573  if (conForm->conindid == oldIndexId)
1574  {
1575  conForm->conindid = newIndexId;
1576 
1577  CatalogTupleUpdate(pg_constraint, &constraintTuple->t_self, constraintTuple);
1578  }
1579 
1580  heap_freetuple(constraintTuple);
1581 
1582  /* Search for trigger records */
1583  ScanKeyInit(&key[0],
1584  Anum_pg_trigger_tgconstraint,
1585  BTEqualStrategyNumber, F_OIDEQ,
1586  ObjectIdGetDatum(constraintOid));
1587 
1588  scan = systable_beginscan(pg_trigger, TriggerConstraintIndexId, true,
1589  NULL, 1, key);
1590 
1591  while (HeapTupleIsValid((triggerTuple = systable_getnext(scan))))
1592  {
1593  Form_pg_trigger tgForm = (Form_pg_trigger) GETSTRUCT(triggerTuple);
1594 
1595  if (tgForm->tgconstrindid != oldIndexId)
1596  continue;
1597 
1598  /* Make a modifiable copy */
1599  triggerTuple = heap_copytuple(triggerTuple);
1600  tgForm = (Form_pg_trigger) GETSTRUCT(triggerTuple);
1601 
1602  tgForm->tgconstrindid = newIndexId;
1603 
1604  CatalogTupleUpdate(pg_trigger, &triggerTuple->t_self, triggerTuple);
1605 
1606  heap_freetuple(triggerTuple);
1607  }
1608 
1609  systable_endscan(scan);
1610  }
1611 
1612  /*
1613  * Move comment if any
1614  */
1615  {
1616  Relation description;
1617  ScanKeyData skey[3];
1618  SysScanDesc sd;
1619  HeapTuple tuple;
1620  Datum values[Natts_pg_description] = {0};
1621  bool nulls[Natts_pg_description] = {0};
1622  bool replaces[Natts_pg_description] = {0};
1623 
1624  values[Anum_pg_description_objoid - 1] = ObjectIdGetDatum(newIndexId);
1625  replaces[Anum_pg_description_objoid - 1] = true;
1626 
1627  ScanKeyInit(&skey[0],
1628  Anum_pg_description_objoid,
1629  BTEqualStrategyNumber, F_OIDEQ,
1630  ObjectIdGetDatum(oldIndexId));
1631  ScanKeyInit(&skey[1],
1632  Anum_pg_description_classoid,
1633  BTEqualStrategyNumber, F_OIDEQ,
1634  ObjectIdGetDatum(RelationRelationId));
1635  ScanKeyInit(&skey[2],
1636  Anum_pg_description_objsubid,
1637  BTEqualStrategyNumber, F_INT4EQ,
1638  Int32GetDatum(0));
1639 
1640  description = table_open(DescriptionRelationId, RowExclusiveLock);
1641 
1642  sd = systable_beginscan(description, DescriptionObjIndexId, true,
1643  NULL, 3, skey);
1644 
1645  while ((tuple = systable_getnext(sd)) != NULL)
1646  {
1647  tuple = heap_modify_tuple(tuple, RelationGetDescr(description),
1648  values, nulls, replaces);
1649  CatalogTupleUpdate(description, &tuple->t_self, tuple);
1650 
1651  break; /* Assume there can be only one match */
1652  }
1653 
1654  systable_endscan(sd);
1655  table_close(description, NoLock);
1656  }
1657 
1658  /*
1659  * Swap inheritance relationship with parent index
1660  */
1661  if (get_rel_relispartition(oldIndexId))
1662  {
1663  List *ancestors = get_partition_ancestors(oldIndexId);
1664  Oid parentIndexRelid = linitial_oid(ancestors);
1665 
1666  DeleteInheritsTuple(oldIndexId, parentIndexRelid);
1667  StoreSingleInheritance(newIndexId, parentIndexRelid, 1);
1668 
1669  list_free(ancestors);
1670  }
1671 
1672  /*
1673  * Move all dependencies of and on the old index to the new one. First
1674  * remove any dependencies that the new index may have to provide an
1675  * initial clean state for the dependency switch, and then move all the
1676  * dependencies from the old index to the new one.
1677  */
1678  deleteDependencyRecordsFor(RelationRelationId, newIndexId, false);
1679  changeDependenciesOf(RelationRelationId, oldIndexId, newIndexId);
1680  changeDependenciesOn(RelationRelationId, oldIndexId, newIndexId);
1681 
1682  /*
1683  * Copy over statistics from old to new index
1684  */
1685  {
1686  PgStat_StatTabEntry *tabentry;
1687 
1688  tabentry = pgstat_fetch_stat_tabentry(oldIndexId);
1689  if (tabentry)
1690  {
1691  if (newClassRel->pgstat_info)
1692  {
1693  newClassRel->pgstat_info->t_counts.t_numscans = tabentry->numscans;
1694  newClassRel->pgstat_info->t_counts.t_tuples_returned = tabentry->tuples_returned;
1695  newClassRel->pgstat_info->t_counts.t_tuples_fetched = tabentry->tuples_fetched;
1696  newClassRel->pgstat_info->t_counts.t_blocks_fetched = tabentry->blocks_fetched;
1697  newClassRel->pgstat_info->t_counts.t_blocks_hit = tabentry->blocks_hit;
1698 
1699  /*
1700  * The data will be sent by the next pgstat_report_stat()
1701  * call.
1702  */
1703  }
1704  }
1705  }
1706 
1707  /* Close relations */
1708  table_close(pg_class, RowExclusiveLock);
1709  table_close(pg_index, RowExclusiveLock);
1710  table_close(pg_constraint, RowExclusiveLock);
1711  table_close(pg_trigger, RowExclusiveLock);
1712 
1713  /* The lock taken previously is not released until the end of transaction */
1714  relation_close(oldClassRel, NoLock);
1715  relation_close(newClassRel, NoLock);
1716 }
1717 
1718 /*
1719  * index_concurrently_set_dead
1720  *
1721  * Perform the last invalidation stage of DROP INDEX CONCURRENTLY or REINDEX
1722  * CONCURRENTLY before actually dropping the index. After calling this
1723  * function, the index is seen by all the backends as dead. Low-level locks
1724  * taken here are kept until the end of the transaction calling this function.
1725  */
1726 void
1728 {
1729  Relation userHeapRelation;
1730  Relation userIndexRelation;
1731 
1732  /*
1733  * No more predicate locks will be acquired on this index, and we're about
1734  * to stop doing inserts into the index which could show conflicts with
1735  * existing predicate locks, so now is the time to move them to the heap
1736  * relation.
1737  */
1738  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
1739  userIndexRelation = index_open(indexId, ShareUpdateExclusiveLock);
1740  TransferPredicateLocksToHeapRelation(userIndexRelation);
1741 
1742  /*
1743  * Now we are sure that nobody uses the index for queries; they just might
1744  * have it open for updating it. So now we can unset indisready and
1745  * indislive, then wait till nobody could be using it at all anymore.
1746  */
1748 
1749  /*
1750  * Invalidate the relcache for the table, so that after this commit all
1751  * sessions will refresh the table's index list. Forgetting just the
1752  * index's relcache entry is not enough.
1753  */
1754  CacheInvalidateRelcache(userHeapRelation);
1755 
1756  /*
1757  * Close the relations again, though still holding session lock.
1758  */
1759  table_close(userHeapRelation, NoLock);
1760  index_close(userIndexRelation, NoLock);
1761 }
1762 
1763 /*
1764  * index_constraint_create
1765  *
1766  * Set up a constraint associated with an index. Return the new constraint's
1767  * address.
1768  *
1769  * heapRelation: table owning the index (must be suitably locked by caller)
1770  * indexRelationId: OID of the index
1771  * parentConstraintId: if constraint is on a partition, the OID of the
1772  * constraint in the parent.
1773  * indexInfo: same info executor uses to insert into the index
1774  * constraintName: what it say (generally, should match name of index)
1775  * constraintType: one of CONSTRAINT_PRIMARY, CONSTRAINT_UNIQUE, or
1776  * CONSTRAINT_EXCLUSION
1777  * flags: bitmask that can include any combination of these bits:
1778  * INDEX_CONSTR_CREATE_MARK_AS_PRIMARY: index is a PRIMARY KEY
1779  * INDEX_CONSTR_CREATE_DEFERRABLE: constraint is DEFERRABLE
1780  * INDEX_CONSTR_CREATE_INIT_DEFERRED: constraint is INITIALLY DEFERRED
1781  * INDEX_CONSTR_CREATE_UPDATE_INDEX: update the pg_index row
1782  * INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS: remove existing dependencies
1783  * of index on table's columns
1784  * allow_system_table_mods: allow table to be a system catalog
1785  * is_internal: index is constructed due to internal process
1786  */
1789  Oid indexRelationId,
1790  Oid parentConstraintId,
1791  IndexInfo *indexInfo,
1792  const char *constraintName,
1793  char constraintType,
1794  bits16 constr_flags,
1795  bool allow_system_table_mods,
1796  bool is_internal)
1797 {
1798  Oid namespaceId = RelationGetNamespace(heapRelation);
1799  ObjectAddress myself,
1800  idxaddr;
1801  Oid conOid;
1802  bool deferrable;
1803  bool initdeferred;
1804  bool mark_as_primary;
1805  bool islocal;
1806  bool noinherit;
1807  int inhcount;
1808 
1809  deferrable = (constr_flags & INDEX_CONSTR_CREATE_DEFERRABLE) != 0;
1810  initdeferred = (constr_flags & INDEX_CONSTR_CREATE_INIT_DEFERRED) != 0;
1811  mark_as_primary = (constr_flags & INDEX_CONSTR_CREATE_MARK_AS_PRIMARY) != 0;
1812 
1813  /* constraint creation support doesn't work while bootstrapping */
1815 
1816  /* enforce system-table restriction */
1817  if (!allow_system_table_mods &&
1818  IsSystemRelation(heapRelation) &&
1820  ereport(ERROR,
1821  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1822  errmsg("user-defined indexes on system catalog tables are not supported")));
1823 
1824  /* primary/unique constraints shouldn't have any expressions */
1825  if (indexInfo->ii_Expressions &&
1826  constraintType != CONSTRAINT_EXCLUSION)
1827  elog(ERROR, "constraints cannot have index expressions");
1828 
1829  /*
1830  * If we're manufacturing a constraint for a pre-existing index, we need
1831  * to get rid of the existing auto dependencies for the index (the ones
1832  * that index_create() would have made instead of calling this function).
1833  *
1834  * Note: this code would not necessarily do the right thing if the index
1835  * has any expressions or predicate, but we'd never be turning such an
1836  * index into a UNIQUE or PRIMARY KEY constraint.
1837  */
1838  if (constr_flags & INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS)
1839  deleteDependencyRecordsForClass(RelationRelationId, indexRelationId,
1840  RelationRelationId, DEPENDENCY_AUTO);
1841 
1842  if (OidIsValid(parentConstraintId))
1843  {
1844  islocal = false;
1845  inhcount = 1;
1846  noinherit = false;
1847  }
1848  else
1849  {
1850  islocal = true;
1851  inhcount = 0;
1852  noinherit = true;
1853  }
1854 
1855  /*
1856  * Construct a pg_constraint entry.
1857  */
1858  conOid = CreateConstraintEntry(constraintName,
1859  namespaceId,
1860  constraintType,
1861  deferrable,
1862  initdeferred,
1863  true,
1864  parentConstraintId,
1865  RelationGetRelid(heapRelation),
1866  indexInfo->ii_IndexAttrNumbers,
1867  indexInfo->ii_NumIndexKeyAttrs,
1868  indexInfo->ii_NumIndexAttrs,
1869  InvalidOid, /* no domain */
1870  indexRelationId, /* index OID */
1871  InvalidOid, /* no foreign key */
1872  NULL,
1873  NULL,
1874  NULL,
1875  NULL,
1876  0,
1877  ' ',
1878  ' ',
1879  ' ',
1880  indexInfo->ii_ExclusionOps,
1881  NULL, /* no check constraint */
1882  NULL,
1883  islocal,
1884  inhcount,
1885  noinherit,
1886  is_internal);
1887 
1888  /*
1889  * Register the index as internally dependent on the constraint.
1890  *
1891  * Note that the constraint has a dependency on the table, so we don't
1892  * need (or want) any direct dependency from the index to the table.
1893  */
1894  ObjectAddressSet(myself, ConstraintRelationId, conOid);
1895  ObjectAddressSet(idxaddr, RelationRelationId, indexRelationId);
1896  recordDependencyOn(&idxaddr, &myself, DEPENDENCY_INTERNAL);
1897 
1898  /*
1899  * Also, if this is a constraint on a partition, give it partition-type
1900  * dependencies on the parent constraint as well as the table.
1901  */
1902  if (OidIsValid(parentConstraintId))
1903  {
1904  ObjectAddress referenced;
1905 
1906  ObjectAddressSet(referenced, ConstraintRelationId, parentConstraintId);
1907  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_PRI);
1908  ObjectAddressSet(referenced, RelationRelationId,
1909  RelationGetRelid(heapRelation));
1910  recordDependencyOn(&myself, &referenced, DEPENDENCY_PARTITION_SEC);
1911  }
1912 
1913  /*
1914  * If the constraint is deferrable, create the deferred uniqueness
1915  * checking trigger. (The trigger will be given an internal dependency on
1916  * the constraint by CreateTrigger.)
1917  */
1918  if (deferrable)
1919  {
1920  CreateTrigStmt *trigger;
1921 
1922  trigger = makeNode(CreateTrigStmt);
1923  trigger->trigname = (constraintType == CONSTRAINT_PRIMARY) ?
1924  "PK_ConstraintTrigger" :
1925  "Unique_ConstraintTrigger";
1926  trigger->relation = NULL;
1927  trigger->funcname = SystemFuncName("unique_key_recheck");
1928  trigger->args = NIL;
1929  trigger->row = true;
1930  trigger->timing = TRIGGER_TYPE_AFTER;
1931  trigger->events = TRIGGER_TYPE_INSERT | TRIGGER_TYPE_UPDATE;
1932  trigger->columns = NIL;
1933  trigger->whenClause = NULL;
1934  trigger->isconstraint = true;
1935  trigger->deferrable = true;
1936  trigger->initdeferred = initdeferred;
1937  trigger->constrrel = NULL;
1938 
1939  (void) CreateTrigger(trigger, NULL, RelationGetRelid(heapRelation),
1940  InvalidOid, conOid, indexRelationId, InvalidOid,
1941  InvalidOid, NULL, true, false);
1942  }
1943 
1944  /*
1945  * If needed, mark the index as primary and/or deferred in pg_index.
1946  *
1947  * Note: When making an existing index into a constraint, caller must have
1948  * a table lock that prevents concurrent table updates; otherwise, there
1949  * is a risk that concurrent readers of the table will miss seeing this
1950  * index at all.
1951  */
1952  if ((constr_flags & INDEX_CONSTR_CREATE_UPDATE_INDEX) &&
1953  (mark_as_primary || deferrable))
1954  {
1955  Relation pg_index;
1956  HeapTuple indexTuple;
1957  Form_pg_index indexForm;
1958  bool dirty = false;
1959 
1960  pg_index = table_open(IndexRelationId, RowExclusiveLock);
1961 
1962  indexTuple = SearchSysCacheCopy1(INDEXRELID,
1963  ObjectIdGetDatum(indexRelationId));
1964  if (!HeapTupleIsValid(indexTuple))
1965  elog(ERROR, "cache lookup failed for index %u", indexRelationId);
1966  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
1967 
1968  if (mark_as_primary && !indexForm->indisprimary)
1969  {
1970  indexForm->indisprimary = true;
1971  dirty = true;
1972  }
1973 
1974  if (deferrable && indexForm->indimmediate)
1975  {
1976  indexForm->indimmediate = false;
1977  dirty = true;
1978  }
1979 
1980  if (dirty)
1981  {
1982  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
1983 
1984  InvokeObjectPostAlterHookArg(IndexRelationId, indexRelationId, 0,
1985  InvalidOid, is_internal);
1986  }
1987 
1988  heap_freetuple(indexTuple);
1989  table_close(pg_index, RowExclusiveLock);
1990  }
1991 
1992  return myself;
1993 }
1994 
1995 /*
1996  * index_drop
1997  *
1998  * NOTE: this routine should now only be called through performDeletion(),
1999  * else associated dependencies won't be cleaned up.
2000  *
2001  * If concurrent is true, do a DROP INDEX CONCURRENTLY. If concurrent is
2002  * false but concurrent_lock_mode is true, then do a normal DROP INDEX but
2003  * take a lock for CONCURRENTLY processing. That is used as part of REINDEX
2004  * CONCURRENTLY.
2005  */
2006 void
2007 index_drop(Oid indexId, bool concurrent, bool concurrent_lock_mode)
2008 {
2009  Oid heapId;
2010  Relation userHeapRelation;
2011  Relation userIndexRelation;
2012  Relation indexRelation;
2013  HeapTuple tuple;
2014  bool hasexprs;
2015  LockRelId heaprelid,
2016  indexrelid;
2017  LOCKTAG heaplocktag;
2018  LOCKMODE lockmode;
2019 
2020  /*
2021  * To drop an index safely, we must grab exclusive lock on its parent
2022  * table. Exclusive lock on the index alone is insufficient because
2023  * another backend might be about to execute a query on the parent table.
2024  * If it relies on a previously cached list of index OIDs, then it could
2025  * attempt to access the just-dropped index. We must therefore take a
2026  * table lock strong enough to prevent all queries on the table from
2027  * proceeding until we commit and send out a shared-cache-inval notice
2028  * that will make them update their index lists.
2029  *
2030  * In the concurrent case we avoid this requirement by disabling index use
2031  * in multiple steps and waiting out any transactions that might be using
2032  * the index, so we don't need exclusive lock on the parent table. Instead
2033  * we take ShareUpdateExclusiveLock, to ensure that two sessions aren't
2034  * doing CREATE/DROP INDEX CONCURRENTLY on the same index. (We will get
2035  * AccessExclusiveLock on the index below, once we're sure nobody else is
2036  * using it.)
2037  */
2038  heapId = IndexGetRelation(indexId, false);
2039  lockmode = (concurrent || concurrent_lock_mode) ? ShareUpdateExclusiveLock : AccessExclusiveLock;
2040  userHeapRelation = table_open(heapId, lockmode);
2041  userIndexRelation = index_open(indexId, lockmode);
2042 
2043  /*
2044  * We might still have open queries using it in our own session, which the
2045  * above locking won't prevent, so test explicitly.
2046  */
2047  CheckTableNotInUse(userIndexRelation, "DROP INDEX");
2048 
2049  /*
2050  * Drop Index Concurrently is more or less the reverse process of Create
2051  * Index Concurrently.
2052  *
2053  * First we unset indisvalid so queries starting afterwards don't use the
2054  * index to answer queries anymore. We have to keep indisready = true so
2055  * transactions that are still scanning the index can continue to see
2056  * valid index contents. For instance, if they are using READ COMMITTED
2057  * mode, and another transaction makes changes and commits, they need to
2058  * see those new tuples in the index.
2059  *
2060  * After all transactions that could possibly have used the index for
2061  * queries end, we can unset indisready and indislive, then wait till
2062  * nobody could be touching it anymore. (Note: we need indislive because
2063  * this state must be distinct from the initial state during CREATE INDEX
2064  * CONCURRENTLY, which has indislive true while indisready and indisvalid
2065  * are false. That's because in that state, transactions must examine the
2066  * index for HOT-safety decisions, while in this state we don't want them
2067  * to open it at all.)
2068  *
2069  * Since all predicate locks on the index are about to be made invalid, we
2070  * must promote them to predicate locks on the heap. In the
2071  * non-concurrent case we can just do that now. In the concurrent case
2072  * it's a bit trickier. The predicate locks must be moved when there are
2073  * no index scans in progress on the index and no more can subsequently
2074  * start, so that no new predicate locks can be made on the index. Also,
2075  * they must be moved before heap inserts stop maintaining the index, else
2076  * the conflict with the predicate lock on the index gap could be missed
2077  * before the lock on the heap relation is in place to detect a conflict
2078  * based on the heap tuple insert.
2079  */
2080  if (concurrent)
2081  {
2082  /*
2083  * We must commit our transaction in order to make the first pg_index
2084  * state update visible to other sessions. If the DROP machinery has
2085  * already performed any other actions (removal of other objects,
2086  * pg_depend entries, etc), the commit would make those actions
2087  * permanent, which would leave us with inconsistent catalog state if
2088  * we fail partway through the following sequence. Since DROP INDEX
2089  * CONCURRENTLY is restricted to dropping just one index that has no
2090  * dependencies, we should get here before anything's been done ---
2091  * but let's check that to be sure. We can verify that the current
2092  * transaction has not executed any transactional updates by checking
2093  * that no XID has been assigned.
2094  */
2096  ereport(ERROR,
2097  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2098  errmsg("DROP INDEX CONCURRENTLY must be first action in transaction")));
2099 
2100  /*
2101  * Mark index invalid by updating its pg_index entry
2102  */
2104 
2105  /*
2106  * Invalidate the relcache for the table, so that after this commit
2107  * all sessions will refresh any cached plans that might reference the
2108  * index.
2109  */
2110  CacheInvalidateRelcache(userHeapRelation);
2111 
2112  /* save lockrelid and locktag for below, then close but keep locks */
2113  heaprelid = userHeapRelation->rd_lockInfo.lockRelId;
2114  SET_LOCKTAG_RELATION(heaplocktag, heaprelid.dbId, heaprelid.relId);
2115  indexrelid = userIndexRelation->rd_lockInfo.lockRelId;
2116 
2117  table_close(userHeapRelation, NoLock);
2118  index_close(userIndexRelation, NoLock);
2119 
2120  /*
2121  * We must commit our current transaction so that the indisvalid
2122  * update becomes visible to other transactions; then start another.
2123  * Note that any previously-built data structures are lost in the
2124  * commit. The only data we keep past here are the relation IDs.
2125  *
2126  * Before committing, get a session-level lock on the table, to ensure
2127  * that neither it nor the index can be dropped before we finish. This
2128  * cannot block, even if someone else is waiting for access, because
2129  * we already have the same lock within our transaction.
2130  */
2133 
2137 
2138  /*
2139  * Now we must wait until no running transaction could be using the
2140  * index for a query. Use AccessExclusiveLock here to check for
2141  * running transactions that hold locks of any kind on the table. Note
2142  * we do not need to worry about xacts that open the table for reading
2143  * after this point; they will see the index as invalid when they open
2144  * the relation.
2145  *
2146  * Note: the reason we use actual lock acquisition here, rather than
2147  * just checking the ProcArray and sleeping, is that deadlock is
2148  * possible if one of the transactions in question is blocked trying
2149  * to acquire an exclusive lock on our table. The lock code will
2150  * detect deadlock and error out properly.
2151  *
2152  * Note: we report progress through WaitForLockers() unconditionally
2153  * here, even though it will only be used when we're called by REINDEX
2154  * CONCURRENTLY and not when called by DROP INDEX CONCURRENTLY.
2155  */
2156  WaitForLockers(heaplocktag, AccessExclusiveLock, true);
2157 
2158  /* Finish invalidation of index and mark it as dead */
2159  index_concurrently_set_dead(heapId, indexId);
2160 
2161  /*
2162  * Again, commit the transaction to make the pg_index update visible
2163  * to other sessions.
2164  */
2167 
2168  /*
2169  * Wait till every transaction that saw the old index state has
2170  * finished. See above about progress reporting.
2171  */
2172  WaitForLockers(heaplocktag, AccessExclusiveLock, true);
2173 
2174  /*
2175  * Re-open relations to allow us to complete our actions.
2176  *
2177  * At this point, nothing should be accessing the index, but lets
2178  * leave nothing to chance and grab AccessExclusiveLock on the index
2179  * before the physical deletion.
2180  */
2181  userHeapRelation = table_open(heapId, ShareUpdateExclusiveLock);
2182  userIndexRelation = index_open(indexId, AccessExclusiveLock);
2183  }
2184  else
2185  {
2186  /* Not concurrent, so just transfer predicate locks and we're good */
2187  TransferPredicateLocksToHeapRelation(userIndexRelation);
2188  }
2189 
2190  /*
2191  * Schedule physical removal of the files (if any)
2192  */
2193  if (userIndexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
2194  RelationDropStorage(userIndexRelation);
2195 
2196  /*
2197  * Close and flush the index's relcache entry, to ensure relcache doesn't
2198  * try to rebuild it while we're deleting catalog entries. We keep the
2199  * lock though.
2200  */
2201  index_close(userIndexRelation, NoLock);
2202 
2203  RelationForgetRelation(indexId);
2204 
2205  /*
2206  * fix INDEX relation, and check for expressional index
2207  */
2208  indexRelation = table_open(IndexRelationId, RowExclusiveLock);
2209 
2210  tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
2211  if (!HeapTupleIsValid(tuple))
2212  elog(ERROR, "cache lookup failed for index %u", indexId);
2213 
2214  hasexprs = !heap_attisnull(tuple, Anum_pg_index_indexprs,
2215  RelationGetDescr(indexRelation));
2216 
2217  CatalogTupleDelete(indexRelation, &tuple->t_self);
2218 
2219  ReleaseSysCache(tuple);
2220  table_close(indexRelation, RowExclusiveLock);
2221 
2222  /*
2223  * if it has any expression columns, we might have stored statistics about
2224  * them.
2225  */
2226  if (hasexprs)
2227  RemoveStatistics(indexId, 0);
2228 
2229  /*
2230  * fix ATTRIBUTE relation
2231  */
2232  DeleteAttributeTuples(indexId);
2233 
2234  /*
2235  * fix RELATION relation
2236  */
2237  DeleteRelationTuple(indexId);
2238 
2239  /*
2240  * fix INHERITS relation
2241  */
2242  DeleteInheritsTuple(indexId, InvalidOid);
2243 
2244  /*
2245  * We are presently too lazy to attempt to compute the new correct value
2246  * of relhasindex (the next VACUUM will fix it if necessary). So there is
2247  * no need to update the pg_class tuple for the owning relation. But we
2248  * must send out a shared-cache-inval notice on the owning relation to
2249  * ensure other backends update their relcache lists of indexes. (In the
2250  * concurrent case, this is redundant but harmless.)
2251  */
2252  CacheInvalidateRelcache(userHeapRelation);
2253 
2254  /*
2255  * Close owning rel, but keep lock
2256  */
2257  table_close(userHeapRelation, NoLock);
2258 
2259  /*
2260  * Release the session locks before we go.
2261  */
2262  if (concurrent)
2263  {
2266  }
2267 }
2268 
2269 /* ----------------------------------------------------------------
2270  * index_build support
2271  * ----------------------------------------------------------------
2272  */
2273 
2274 /* ----------------
2275  * BuildIndexInfo
2276  * Construct an IndexInfo record for an open index
2277  *
2278  * IndexInfo stores the information about the index that's needed by
2279  * FormIndexDatum, which is used for both index_build() and later insertion
2280  * of individual index tuples. Normally we build an IndexInfo for an index
2281  * just once per command, and then use it for (potentially) many tuples.
2282  * ----------------
2283  */
2284 IndexInfo *
2286 {
2287  IndexInfo *ii;
2288  Form_pg_index indexStruct = index->rd_index;
2289  int i;
2290  int numAtts;
2291 
2292  /* check the number of keys, and copy attr numbers into the IndexInfo */
2293  numAtts = indexStruct->indnatts;
2294  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2295  elog(ERROR, "invalid indnatts %d for index %u",
2296  numAtts, RelationGetRelid(index));
2297 
2298  /*
2299  * Create the node, fetching any expressions needed for expressional
2300  * indexes and index predicate if any.
2301  */
2302  ii = makeIndexInfo(indexStruct->indnatts,
2303  indexStruct->indnkeyatts,
2304  index->rd_rel->relam,
2307  indexStruct->indisunique,
2308  indexStruct->indisready,
2309  false);
2310 
2311  /* fill in attribute numbers */
2312  for (i = 0; i < numAtts; i++)
2313  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2314 
2315  /* fetch exclusion constraint info if any */
2316  if (indexStruct->indisexclusion)
2317  {
2319  &ii->ii_ExclusionOps,
2320  &ii->ii_ExclusionProcs,
2321  &ii->ii_ExclusionStrats);
2322  }
2323 
2324  return ii;
2325 }
2326 
2327 /* ----------------
2328  * BuildDummyIndexInfo
2329  * Construct a dummy IndexInfo record for an open index
2330  *
2331  * This differs from the real BuildIndexInfo in that it will never run any
2332  * user-defined code that might exist in index expressions or predicates.
2333  * Instead of the real index expressions, we return null constants that have
2334  * the right types/typmods/collations. Predicates and exclusion clauses are
2335  * just ignored. This is sufficient for the purpose of truncating an index,
2336  * since we will not need to actually evaluate the expressions or predicates;
2337  * the only thing that's likely to be done with the data is construction of
2338  * a tupdesc describing the index's rowtype.
2339  * ----------------
2340  */
2341 IndexInfo *
2343 {
2344  IndexInfo *ii;
2345  Form_pg_index indexStruct = index->rd_index;
2346  int i;
2347  int numAtts;
2348 
2349  /* check the number of keys, and copy attr numbers into the IndexInfo */
2350  numAtts = indexStruct->indnatts;
2351  if (numAtts < 1 || numAtts > INDEX_MAX_KEYS)
2352  elog(ERROR, "invalid indnatts %d for index %u",
2353  numAtts, RelationGetRelid(index));
2354 
2355  /*
2356  * Create the node, using dummy index expressions, and pretending there is
2357  * no predicate.
2358  */
2359  ii = makeIndexInfo(indexStruct->indnatts,
2360  indexStruct->indnkeyatts,
2361  index->rd_rel->relam,
2363  NIL,
2364  indexStruct->indisunique,
2365  indexStruct->indisready,
2366  false);
2367 
2368  /* fill in attribute numbers */
2369  for (i = 0; i < numAtts; i++)
2370  ii->ii_IndexAttrNumbers[i] = indexStruct->indkey.values[i];
2371 
2372  /* We ignore the exclusion constraint if any */
2373 
2374  return ii;
2375 }
2376 
2377 /*
2378  * CompareIndexInfo
2379  * Return whether the properties of two indexes (in different tables)
2380  * indicate that they have the "same" definitions.
2381  *
2382  * Note: passing collations and opfamilies separately is a kludge. Adding
2383  * them to IndexInfo may result in better coding here and elsewhere.
2384  *
2385  * Use convert_tuples_by_name_map(index2, index1) to build the attmap.
2386  */
2387 bool
2389  Oid *collations1, Oid *collations2,
2390  Oid *opfamilies1, Oid *opfamilies2,
2391  AttrNumber *attmap, int maplen)
2392 {
2393  int i;
2394 
2395  if (info1->ii_Unique != info2->ii_Unique)
2396  return false;
2397 
2398  /* indexes are only equivalent if they have the same access method */
2399  if (info1->ii_Am != info2->ii_Am)
2400  return false;
2401 
2402  /* and same number of attributes */
2403  if (info1->ii_NumIndexAttrs != info2->ii_NumIndexAttrs)
2404  return false;
2405 
2406  /* and same number of key attributes */
2407  if (info1->ii_NumIndexKeyAttrs != info2->ii_NumIndexKeyAttrs)
2408  return false;
2409 
2410  /*
2411  * and columns match through the attribute map (actual attribute numbers
2412  * might differ!) Note that this implies that index columns that are
2413  * expressions appear in the same positions. We will next compare the
2414  * expressions themselves.
2415  */
2416  for (i = 0; i < info1->ii_NumIndexAttrs; i++)
2417  {
2418  if (maplen < info2->ii_IndexAttrNumbers[i])
2419  elog(ERROR, "incorrect attribute map");
2420 
2421  /* ignore expressions at this stage */
2422  if ((info1->ii_IndexAttrNumbers[i] != InvalidAttrNumber) &&
2423  (attmap[info2->ii_IndexAttrNumbers[i] - 1] !=
2424  info1->ii_IndexAttrNumbers[i]))
2425  return false;
2426 
2427  /* collation and opfamily is not valid for including columns */
2428  if (i >= info1->ii_NumIndexKeyAttrs)
2429  continue;
2430 
2431  if (collations1[i] != collations2[i])
2432  return false;
2433  if (opfamilies1[i] != opfamilies2[i])
2434  return false;
2435  }
2436 
2437  /*
2438  * For expression indexes: either both are expression indexes, or neither
2439  * is; if they are, make sure the expressions match.
2440  */
2441  if ((info1->ii_Expressions != NIL) != (info2->ii_Expressions != NIL))
2442  return false;
2443  if (info1->ii_Expressions != NIL)
2444  {
2445  bool found_whole_row;
2446  Node *mapped;
2447 
2448  mapped = map_variable_attnos((Node *) info2->ii_Expressions,
2449  1, 0, attmap, maplen,
2450  InvalidOid, &found_whole_row);
2451  if (found_whole_row)
2452  {
2453  /*
2454  * we could throw an error here, but seems out of scope for this
2455  * routine.
2456  */
2457  return false;
2458  }
2459 
2460  if (!equal(info1->ii_Expressions, mapped))
2461  return false;
2462  }
2463 
2464  /* Partial index predicates must be identical, if they exist */
2465  if ((info1->ii_Predicate == NULL) != (info2->ii_Predicate == NULL))
2466  return false;
2467  if (info1->ii_Predicate != NULL)
2468  {
2469  bool found_whole_row;
2470  Node *mapped;
2471 
2472  mapped = map_variable_attnos((Node *) info2->ii_Predicate,
2473  1, 0, attmap, maplen,
2474  InvalidOid, &found_whole_row);
2475  if (found_whole_row)
2476  {
2477  /*
2478  * we could throw an error here, but seems out of scope for this
2479  * routine.
2480  */
2481  return false;
2482  }
2483  if (!equal(info1->ii_Predicate, mapped))
2484  return false;
2485  }
2486 
2487  /* No support currently for comparing exclusion indexes. */
2488  if (info1->ii_ExclusionOps != NULL || info2->ii_ExclusionOps != NULL)
2489  return false;
2490 
2491  return true;
2492 }
2493 
2494 /* ----------------
2495  * BuildSpeculativeIndexInfo
2496  * Add extra state to IndexInfo record
2497  *
2498  * For unique indexes, we usually don't want to add info to the IndexInfo for
2499  * checking uniqueness, since the B-Tree AM handles that directly. However,
2500  * in the case of speculative insertion, additional support is required.
2501  *
2502  * Do this processing here rather than in BuildIndexInfo() to not incur the
2503  * overhead in the common non-speculative cases.
2504  * ----------------
2505  */
2506 void
2508 {
2509  int indnkeyatts;
2510  int i;
2511 
2512  indnkeyatts = IndexRelationGetNumberOfKeyAttributes(index);
2513 
2514  /*
2515  * fetch info for checking unique indexes
2516  */
2517  Assert(ii->ii_Unique);
2518 
2519  if (index->rd_rel->relam != BTREE_AM_OID)
2520  elog(ERROR, "unexpected non-btree speculative unique index");
2521 
2522  ii->ii_UniqueOps = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2523  ii->ii_UniqueProcs = (Oid *) palloc(sizeof(Oid) * indnkeyatts);
2524  ii->ii_UniqueStrats = (uint16 *) palloc(sizeof(uint16) * indnkeyatts);
2525 
2526  /*
2527  * We have to look up the operator's strategy number. This provides a
2528  * cross-check that the operator does match the index.
2529  */
2530  /* We need the func OIDs and strategy numbers too */
2531  for (i = 0; i < indnkeyatts; i++)
2532  {
2534  ii->ii_UniqueOps[i] =
2535  get_opfamily_member(index->rd_opfamily[i],
2536  index->rd_opcintype[i],
2537  index->rd_opcintype[i],
2538  ii->ii_UniqueStrats[i]);
2539  if (!OidIsValid(ii->ii_UniqueOps[i]))
2540  elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
2541  ii->ii_UniqueStrats[i], index->rd_opcintype[i],
2542  index->rd_opcintype[i], index->rd_opfamily[i]);
2543  ii->ii_UniqueProcs[i] = get_opcode(ii->ii_UniqueOps[i]);
2544  }
2545 }
2546 
2547 /* ----------------
2548  * FormIndexDatum
2549  * Construct values[] and isnull[] arrays for a new index tuple.
2550  *
2551  * indexInfo Info about the index
2552  * slot Heap tuple for which we must prepare an index entry
2553  * estate executor state for evaluating any index expressions
2554  * values Array of index Datums (output area)
2555  * isnull Array of is-null indicators (output area)
2556  *
2557  * When there are no index expressions, estate may be NULL. Otherwise it
2558  * must be supplied, *and* the ecxt_scantuple slot of its per-tuple expr
2559  * context must point to the heap tuple passed in.
2560  *
2561  * Notice we don't actually call index_form_tuple() here; we just prepare
2562  * its input arrays values[] and isnull[]. This is because the index AM
2563  * may wish to alter the data before storage.
2564  * ----------------
2565  */
2566 void
2568  TupleTableSlot *slot,
2569  EState *estate,
2570  Datum *values,
2571  bool *isnull)
2572 {
2573  ListCell *indexpr_item;
2574  int i;
2575 
2576  if (indexInfo->ii_Expressions != NIL &&
2577  indexInfo->ii_ExpressionsState == NIL)
2578  {
2579  /* First time through, set up expression evaluation state */
2580  indexInfo->ii_ExpressionsState =
2581  ExecPrepareExprList(indexInfo->ii_Expressions, estate);
2582  /* Check caller has set up context correctly */
2583  Assert(GetPerTupleExprContext(estate)->ecxt_scantuple == slot);
2584  }
2585  indexpr_item = list_head(indexInfo->ii_ExpressionsState);
2586 
2587  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
2588  {
2589  int keycol = indexInfo->ii_IndexAttrNumbers[i];
2590  Datum iDatum;
2591  bool isNull;
2592 
2593  if (keycol < 0)
2594  iDatum = slot_getsysattr(slot, keycol, &isNull);
2595  else if (keycol != 0)
2596  {
2597  /*
2598  * Plain index column; get the value we need directly from the
2599  * heap tuple.
2600  */
2601  iDatum = slot_getattr(slot, keycol, &isNull);
2602  }
2603  else
2604  {
2605  /*
2606  * Index expression --- need to evaluate it.
2607  */
2608  if (indexpr_item == NULL)
2609  elog(ERROR, "wrong number of index expressions");
2610  iDatum = ExecEvalExprSwitchContext((ExprState *) lfirst(indexpr_item),
2611  GetPerTupleExprContext(estate),
2612  &isNull);
2613  indexpr_item = lnext(indexInfo->ii_ExpressionsState, indexpr_item);
2614  }
2615  values[i] = iDatum;
2616  isnull[i] = isNull;
2617  }
2618 
2619  if (indexpr_item != NULL)
2620  elog(ERROR, "wrong number of index expressions");
2621 }
2622 
2623 
2624 /*
2625  * index_update_stats --- update pg_class entry after CREATE INDEX or REINDEX
2626  *
2627  * This routine updates the pg_class row of either an index or its parent
2628  * relation after CREATE INDEX or REINDEX. Its rather bizarre API is designed
2629  * to ensure we can do all the necessary work in just one update.
2630  *
2631  * hasindex: set relhasindex to this value
2632  * reltuples: if >= 0, set reltuples to this value; else no change
2633  *
2634  * If reltuples >= 0, relpages and relallvisible are also updated (using
2635  * RelationGetNumberOfBlocks() and visibilitymap_count()).
2636  *
2637  * NOTE: an important side-effect of this operation is that an SI invalidation
2638  * message is sent out to all backends --- including me --- causing relcache
2639  * entries to be flushed or updated with the new data. This must happen even
2640  * if we find that no change is needed in the pg_class row. When updating
2641  * a heap entry, this ensures that other backends find out about the new
2642  * index. When updating an index, it's important because some index AMs
2643  * expect a relcache flush to occur after REINDEX.
2644  */
2645 static void
2647  bool hasindex,
2648  double reltuples)
2649 {
2650  Oid relid = RelationGetRelid(rel);
2651  Relation pg_class;
2652  HeapTuple tuple;
2653  Form_pg_class rd_rel;
2654  bool dirty;
2655 
2656  /*
2657  * We always update the pg_class row using a non-transactional,
2658  * overwrite-in-place update. There are several reasons for this:
2659  *
2660  * 1. In bootstrap mode, we have no choice --- UPDATE wouldn't work.
2661  *
2662  * 2. We could be reindexing pg_class itself, in which case we can't move
2663  * its pg_class row because CatalogTupleInsert/CatalogTupleUpdate might
2664  * not know about all the indexes yet (see reindex_relation).
2665  *
2666  * 3. Because we execute CREATE INDEX with just share lock on the parent
2667  * rel (to allow concurrent index creations), an ordinary update could
2668  * suffer a tuple-concurrently-updated failure against another CREATE
2669  * INDEX committing at about the same time. We can avoid that by having
2670  * them both do nontransactional updates (we assume they will both be
2671  * trying to change the pg_class row to the same thing, so it doesn't
2672  * matter which goes first).
2673  *
2674  * It is safe to use a non-transactional update even though our
2675  * transaction could still fail before committing. Setting relhasindex
2676  * true is safe even if there are no indexes (VACUUM will eventually fix
2677  * it). And of course the new relpages and reltuples counts are correct
2678  * regardless. However, we don't want to change relpages (or
2679  * relallvisible) if the caller isn't providing an updated reltuples
2680  * count, because that would bollix the reltuples/relpages ratio which is
2681  * what's really important.
2682  */
2683 
2684  pg_class = table_open(RelationRelationId, RowExclusiveLock);
2685 
2686  /*
2687  * Make a copy of the tuple to update. Normally we use the syscache, but
2688  * we can't rely on that during bootstrap or while reindexing pg_class
2689  * itself.
2690  */
2691  if (IsBootstrapProcessingMode() ||
2692  ReindexIsProcessingHeap(RelationRelationId))
2693  {
2694  /* don't assume syscache will work */
2695  TableScanDesc pg_class_scan;
2696  ScanKeyData key[1];
2697 
2698  ScanKeyInit(&key[0],
2699  Anum_pg_class_oid,
2700  BTEqualStrategyNumber, F_OIDEQ,
2701  ObjectIdGetDatum(relid));
2702 
2703  pg_class_scan = table_beginscan_catalog(pg_class, 1, key);
2704  tuple = heap_getnext(pg_class_scan, ForwardScanDirection);
2705  tuple = heap_copytuple(tuple);
2706  table_endscan(pg_class_scan);
2707  }
2708  else
2709  {
2710  /* normal case, use syscache */
2711  tuple = SearchSysCacheCopy1(RELOID, ObjectIdGetDatum(relid));
2712  }
2713 
2714  if (!HeapTupleIsValid(tuple))
2715  elog(ERROR, "could not find tuple for relation %u", relid);
2716  rd_rel = (Form_pg_class) GETSTRUCT(tuple);
2717 
2718  /* Should this be a more comprehensive test? */
2719  Assert(rd_rel->relkind != RELKIND_PARTITIONED_INDEX);
2720 
2721  /* Apply required updates, if any, to copied tuple */
2722 
2723  dirty = false;
2724  if (rd_rel->relhasindex != hasindex)
2725  {
2726  rd_rel->relhasindex = hasindex;
2727  dirty = true;
2728  }
2729 
2730  if (reltuples >= 0)
2731  {
2734 
2735  if (rd_rel->relkind != RELKIND_INDEX)
2736  visibilitymap_count(rel, &relallvisible, NULL);
2737  else /* don't bother for indexes */
2738  relallvisible = 0;
2739 
2740  if (rd_rel->relpages != (int32) relpages)
2741  {
2742  rd_rel->relpages = (int32) relpages;
2743  dirty = true;
2744  }
2745  if (rd_rel->reltuples != (float4) reltuples)
2746  {
2747  rd_rel->reltuples = (float4) reltuples;
2748  dirty = true;
2749  }
2750  if (rd_rel->relallvisible != (int32) relallvisible)
2751  {
2752  rd_rel->relallvisible = (int32) relallvisible;
2753  dirty = true;
2754  }
2755  }
2756 
2757  /*
2758  * If anything changed, write out the tuple
2759  */
2760  if (dirty)
2761  {
2762  heap_inplace_update(pg_class, tuple);
2763  /* the above sends a cache inval message */
2764  }
2765  else
2766  {
2767  /* no need to change tuple, but force relcache inval anyway */
2769  }
2770 
2771  heap_freetuple(tuple);
2772 
2773  table_close(pg_class, RowExclusiveLock);
2774 }
2775 
2776 
2777 /*
2778  * index_build - invoke access-method-specific index build procedure
2779  *
2780  * On entry, the index's catalog entries are valid, and its physical disk
2781  * file has been created but is empty. We call the AM-specific build
2782  * procedure to fill in the index contents. We then update the pg_class
2783  * entries of the index and heap relation as needed, using statistics
2784  * returned by ambuild as well as data passed by the caller.
2785  *
2786  * isreindex indicates we are recreating a previously-existing index.
2787  * parallel indicates if parallelism may be useful.
2788  *
2789  * Note: before Postgres 8.2, the passed-in heap and index Relations
2790  * were automatically closed by this routine. This is no longer the case.
2791  * The caller opened 'em, and the caller should close 'em.
2792  */
2793 void
2794 index_build(Relation heapRelation,
2795  Relation indexRelation,
2796  IndexInfo *indexInfo,
2797  bool isreindex,
2798  bool parallel)
2799 {
2800  IndexBuildResult *stats;
2801  Oid save_userid;
2802  int save_sec_context;
2803  int save_nestlevel;
2804 
2805  /*
2806  * sanity checks
2807  */
2808  Assert(RelationIsValid(indexRelation));
2809  Assert(PointerIsValid(indexRelation->rd_indam));
2810  Assert(PointerIsValid(indexRelation->rd_indam->ambuild));
2811  Assert(PointerIsValid(indexRelation->rd_indam->ambuildempty));
2812 
2813  /*
2814  * Determine worker process details for parallel CREATE INDEX. Currently,
2815  * only btree has support for parallel builds.
2816  *
2817  * Note that planner considers parallel safety for us.
2818  */
2819  if (parallel && IsNormalProcessingMode() &&
2820  indexRelation->rd_rel->relam == BTREE_AM_OID)
2821  indexInfo->ii_ParallelWorkers =
2823  RelationGetRelid(indexRelation));
2824 
2825  if (indexInfo->ii_ParallelWorkers == 0)
2826  ereport(DEBUG1,
2827  (errmsg("building index \"%s\" on table \"%s\" serially",
2828  RelationGetRelationName(indexRelation),
2829  RelationGetRelationName(heapRelation))));
2830  else
2831  ereport(DEBUG1,
2832  (errmsg_plural("building index \"%s\" on table \"%s\" with request for %d parallel worker",
2833  "building index \"%s\" on table \"%s\" with request for %d parallel workers",
2834  indexInfo->ii_ParallelWorkers,
2835  RelationGetRelationName(indexRelation),
2836  RelationGetRelationName(heapRelation),
2837  indexInfo->ii_ParallelWorkers)));
2838 
2839  /*
2840  * Switch to the table owner's userid, so that any index functions are run
2841  * as that user. Also lock down security-restricted operations and
2842  * arrange to make GUC variable changes local to this command.
2843  */
2844  GetUserIdAndSecContext(&save_userid, &save_sec_context);
2845  SetUserIdAndSecContext(heapRelation->rd_rel->relowner,
2846  save_sec_context | SECURITY_RESTRICTED_OPERATION);
2847  save_nestlevel = NewGUCNestLevel();
2848 
2849  /* Set up initial progress report status */
2850  {
2851  const int index[] = {
2858  };
2859  const int64 val[] = {
2862  0, 0, 0, 0
2863  };
2864 
2865  pgstat_progress_update_multi_param(6, index, val);
2866  }
2867 
2868  /*
2869  * Call the access method's build procedure
2870  */
2871  stats = indexRelation->rd_indam->ambuild(heapRelation, indexRelation,
2872  indexInfo);
2873  Assert(PointerIsValid(stats));
2874 
2875  /*
2876  * If this is an unlogged index, we may need to write out an init fork for
2877  * it -- but we must first check whether one already exists. If, for
2878  * example, an unlogged relation is truncated in the transaction that
2879  * created it, or truncated twice in a subsequent transaction, the
2880  * relfilenode won't change, and nothing needs to be done here.
2881  */
2882  if (indexRelation->rd_rel->relpersistence == RELPERSISTENCE_UNLOGGED &&
2883  !smgrexists(indexRelation->rd_smgr, INIT_FORKNUM))
2884  {
2885  RelationOpenSmgr(indexRelation);
2886  smgrcreate(indexRelation->rd_smgr, INIT_FORKNUM, false);
2887  indexRelation->rd_indam->ambuildempty(indexRelation);
2888  }
2889 
2890  /*
2891  * If we found any potentially broken HOT chains, mark the index as not
2892  * being usable until the current transaction is below the event horizon.
2893  * See src/backend/access/heap/README.HOT for discussion. Also set this
2894  * if early pruning/vacuuming is enabled for the heap relation. While it
2895  * might become safe to use the index earlier based on actual cleanup
2896  * activity and other active transactions, the test for that would be much
2897  * more complex and would require some form of blocking, so keep it simple
2898  * and fast by just using the current transaction.
2899  *
2900  * However, when reindexing an existing index, we should do nothing here.
2901  * Any HOT chains that are broken with respect to the index must predate
2902  * the index's original creation, so there is no need to change the
2903  * index's usability horizon. Moreover, we *must not* try to change the
2904  * index's pg_index entry while reindexing pg_index itself, and this
2905  * optimization nicely prevents that. The more complex rules needed for a
2906  * reindex are handled separately after this function returns.
2907  *
2908  * We also need not set indcheckxmin during a concurrent index build,
2909  * because we won't set indisvalid true until all transactions that care
2910  * about the broken HOT chains or early pruning/vacuuming are gone.
2911  *
2912  * Therefore, this code path can only be taken during non-concurrent
2913  * CREATE INDEX. Thus the fact that heap_update will set the pg_index
2914  * tuple's xmin doesn't matter, because that tuple was created in the
2915  * current transaction anyway. That also means we don't need to worry
2916  * about any concurrent readers of the tuple; no other transaction can see
2917  * it yet.
2918  */
2919  if ((indexInfo->ii_BrokenHotChain || EarlyPruningEnabled(heapRelation)) &&
2920  !isreindex &&
2921  !indexInfo->ii_Concurrent)
2922  {
2923  Oid indexId = RelationGetRelid(indexRelation);
2924  Relation pg_index;
2925  HeapTuple indexTuple;
2926  Form_pg_index indexForm;
2927 
2928  pg_index = table_open(IndexRelationId, RowExclusiveLock);
2929 
2930  indexTuple = SearchSysCacheCopy1(INDEXRELID,
2931  ObjectIdGetDatum(indexId));
2932  if (!HeapTupleIsValid(indexTuple))
2933  elog(ERROR, "cache lookup failed for index %u", indexId);
2934  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
2935 
2936  /* If it's a new index, indcheckxmin shouldn't be set ... */
2937  Assert(!indexForm->indcheckxmin);
2938 
2939  indexForm->indcheckxmin = true;
2940  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
2941 
2942  heap_freetuple(indexTuple);
2943  table_close(pg_index, RowExclusiveLock);
2944  }
2945 
2946  /*
2947  * Update heap and index pg_class rows
2948  */
2949  index_update_stats(heapRelation,
2950  true,
2951  stats->heap_tuples);
2952 
2953  index_update_stats(indexRelation,
2954  false,
2955  stats->index_tuples);
2956 
2957  /* Make the updated catalog row versions visible */
2959 
2960  /*
2961  * If it's for an exclusion constraint, make a second pass over the heap
2962  * to verify that the constraint is satisfied. We must not do this until
2963  * the index is fully valid. (Broken HOT chains shouldn't matter, though;
2964  * see comments for IndexCheckExclusion.)
2965  */
2966  if (indexInfo->ii_ExclusionOps != NULL)
2967  IndexCheckExclusion(heapRelation, indexRelation, indexInfo);
2968 
2969  /* Roll back any GUC changes executed by index functions */
2970  AtEOXact_GUC(false, save_nestlevel);
2971 
2972  /* Restore userid and security context */
2973  SetUserIdAndSecContext(save_userid, save_sec_context);
2974 }
2975 
2976 /*
2977  * IndexCheckExclusion - verify that a new exclusion constraint is satisfied
2978  *
2979  * When creating an exclusion constraint, we first build the index normally
2980  * and then rescan the heap to check for conflicts. We assume that we only
2981  * need to validate tuples that are live according to an up-to-date snapshot,
2982  * and that these were correctly indexed even in the presence of broken HOT
2983  * chains. This should be OK since we are holding at least ShareLock on the
2984  * table, meaning there can be no uncommitted updates from other transactions.
2985  * (Note: that wouldn't necessarily work for system catalogs, since many
2986  * operations release write lock early on the system catalogs.)
2987  */
2988 static void
2990  Relation indexRelation,
2991  IndexInfo *indexInfo)
2992 {
2993  TableScanDesc scan;
2995  bool isnull[INDEX_MAX_KEYS];
2996  ExprState *predicate;
2997  TupleTableSlot *slot;
2998  EState *estate;
2999  ExprContext *econtext;
3000  Snapshot snapshot;
3001 
3002  /*
3003  * If we are reindexing the target index, mark it as no longer being
3004  * reindexed, to forestall an Assert in index_beginscan when we try to use
3005  * the index for probes. This is OK because the index is now fully valid.
3006  */
3009 
3010  /*
3011  * Need an EState for evaluation of index expressions and partial-index
3012  * predicates. Also a slot to hold the current tuple.
3013  */
3014  estate = CreateExecutorState();
3015  econtext = GetPerTupleExprContext(estate);
3016  slot = table_slot_create(heapRelation, NULL);
3017 
3018  /* Arrange for econtext's scan tuple to be the tuple under test */
3019  econtext->ecxt_scantuple = slot;
3020 
3021  /* Set up execution state for predicate, if any. */
3022  predicate = ExecPrepareQual(indexInfo->ii_Predicate, estate);
3023 
3024  /*
3025  * Scan all live tuples in the base relation.
3026  */
3027  snapshot = RegisterSnapshot(GetLatestSnapshot());
3028  scan = table_beginscan_strat(heapRelation, /* relation */
3029  snapshot, /* snapshot */
3030  0, /* number of keys */
3031  NULL, /* scan key */
3032  true, /* buffer access strategy OK */
3033  true); /* syncscan OK */
3034 
3035  while (table_scan_getnextslot(scan, ForwardScanDirection, slot))
3036  {
3038 
3039  /*
3040  * In a partial index, ignore tuples that don't satisfy the predicate.
3041  */
3042  if (predicate != NULL)
3043  {
3044  if (!ExecQual(predicate, econtext))
3045  continue;
3046  }
3047 
3048  /*
3049  * Extract index column values, including computing expressions.
3050  */
3051  FormIndexDatum(indexInfo,
3052  slot,
3053  estate,
3054  values,
3055  isnull);
3056 
3057  /*
3058  * Check that this tuple has no conflicts.
3059  */
3060  check_exclusion_constraint(heapRelation,
3061  indexRelation, indexInfo,
3062  &(slot->tts_tid), values, isnull,
3063  estate, true);
3064 
3066  }
3067 
3068  table_endscan(scan);
3069  UnregisterSnapshot(snapshot);
3070 
3072 
3073  FreeExecutorState(estate);
3074 
3075  /* These may have been pointing to the now-gone estate */
3076  indexInfo->ii_ExpressionsState = NIL;
3077  indexInfo->ii_PredicateState = NULL;
3078 }
3079 
3080 
3081 /*
3082  * validate_index - support code for concurrent index builds
3083  *
3084  * We do a concurrent index build by first inserting the catalog entry for the
3085  * index via index_create(), marking it not indisready and not indisvalid.
3086  * Then we commit our transaction and start a new one, then we wait for all
3087  * transactions that could have been modifying the table to terminate. Now
3088  * we know that any subsequently-started transactions will see the index and
3089  * honor its constraints on HOT updates; so while existing HOT-chains might
3090  * be broken with respect to the index, no currently live tuple will have an
3091  * incompatible HOT update done to it. We now build the index normally via
3092  * index_build(), while holding a weak lock that allows concurrent
3093  * insert/update/delete. Also, we index only tuples that are valid
3094  * as of the start of the scan (see table_index_build_scan), whereas a normal
3095  * build takes care to include recently-dead tuples. This is OK because
3096  * we won't mark the index valid until all transactions that might be able
3097  * to see those tuples are gone. The reason for doing that is to avoid
3098  * bogus unique-index failures due to concurrent UPDATEs (we might see
3099  * different versions of the same row as being valid when we pass over them,
3100  * if we used HeapTupleSatisfiesVacuum). This leaves us with an index that
3101  * does not contain any tuples added to the table while we built the index.
3102  *
3103  * Next, we mark the index "indisready" (but still not "indisvalid") and
3104  * commit the second transaction and start a third. Again we wait for all
3105  * transactions that could have been modifying the table to terminate. Now
3106  * we know that any subsequently-started transactions will see the index and
3107  * insert their new tuples into it. We then take a new reference snapshot
3108  * which is passed to validate_index(). Any tuples that are valid according
3109  * to this snap, but are not in the index, must be added to the index.
3110  * (Any tuples committed live after the snap will be inserted into the
3111  * index by their originating transaction. Any tuples committed dead before
3112  * the snap need not be indexed, because we will wait out all transactions
3113  * that might care about them before we mark the index valid.)
3114  *
3115  * validate_index() works by first gathering all the TIDs currently in the
3116  * index, using a bulkdelete callback that just stores the TIDs and doesn't
3117  * ever say "delete it". (This should be faster than a plain indexscan;
3118  * also, not all index AMs support full-index indexscan.) Then we sort the
3119  * TIDs, and finally scan the table doing a "merge join" against the TID list
3120  * to see which tuples are missing from the index. Thus we will ensure that
3121  * all tuples valid according to the reference snapshot are in the index.
3122  *
3123  * Building a unique index this way is tricky: we might try to insert a
3124  * tuple that is already dead or is in process of being deleted, and we
3125  * mustn't have a uniqueness failure against an updated version of the same
3126  * row. We could try to check the tuple to see if it's already dead and tell
3127  * index_insert() not to do the uniqueness check, but that still leaves us
3128  * with a race condition against an in-progress update. To handle that,
3129  * we expect the index AM to recheck liveness of the to-be-inserted tuple
3130  * before it declares a uniqueness error.
3131  *
3132  * After completing validate_index(), we wait until all transactions that
3133  * were alive at the time of the reference snapshot are gone; this is
3134  * necessary to be sure there are none left with a transaction snapshot
3135  * older than the reference (and hence possibly able to see tuples we did
3136  * not index). Then we mark the index "indisvalid" and commit. Subsequent
3137  * transactions will be able to use it for queries.
3138  *
3139  * Doing two full table scans is a brute-force strategy. We could try to be
3140  * cleverer, eg storing new tuples in a special area of the table (perhaps
3141  * making the table append-only by setting use_fsm). However that would
3142  * add yet more locking issues.
3143  */
3144 void
3145 validate_index(Oid heapId, Oid indexId, Snapshot snapshot)
3146 {
3147  Relation heapRelation,
3148  indexRelation;
3149  IndexInfo *indexInfo;
3150  IndexVacuumInfo ivinfo;
3152  Oid save_userid;
3153  int save_sec_context;
3154  int save_nestlevel;
3155 
3156  {
3157  const int index[] = {
3163  };
3164  const int64 val[] = {
3166  0, 0, 0, 0
3167  };
3168 
3169  pgstat_progress_update_multi_param(5, index, val);
3170  }
3171 
3172  /* Open and lock the parent heap relation */
3173  heapRelation = table_open(heapId, ShareUpdateExclusiveLock);
3174  /* And the target index relation */
3175  indexRelation = index_open(indexId, RowExclusiveLock);
3176 
3177  /*
3178  * Fetch info needed for index_insert. (You might think this should be
3179  * passed in from DefineIndex, but its copy is long gone due to having
3180  * been built in a previous transaction.)
3181  */
3182  indexInfo = BuildIndexInfo(indexRelation);
3183 
3184  /* mark build is concurrent just for consistency */
3185  indexInfo->ii_Concurrent = true;
3186 
3187  /*
3188  * Switch to the table owner's userid, so that any index functions are run
3189  * as that user. Also lock down security-restricted operations and
3190  * arrange to make GUC variable changes local to this command.
3191  */
3192  GetUserIdAndSecContext(&save_userid, &save_sec_context);
3193  SetUserIdAndSecContext(heapRelation->rd_rel->relowner,
3194  save_sec_context | SECURITY_RESTRICTED_OPERATION);
3195  save_nestlevel = NewGUCNestLevel();
3196 
3197  /*
3198  * Scan the index and gather up all the TIDs into a tuplesort object.
3199  */
3200  ivinfo.index = indexRelation;
3201  ivinfo.analyze_only = false;
3202  ivinfo.report_progress = true;
3203  ivinfo.estimated_count = true;
3204  ivinfo.message_level = DEBUG2;
3205  ivinfo.num_heap_tuples = heapRelation->rd_rel->reltuples;
3206  ivinfo.strategy = NULL;
3207 
3208  /*
3209  * Encode TIDs as int8 values for the sort, rather than directly sorting
3210  * item pointers. This can be significantly faster, primarily because TID
3211  * is a pass-by-reference type on all platforms, whereas int8 is
3212  * pass-by-value on most platforms.
3213  */
3214  state.tuplesort = tuplesort_begin_datum(INT8OID, Int8LessOperator,
3215  InvalidOid, false,
3217  NULL, false);
3218  state.htups = state.itups = state.tups_inserted = 0;
3219 
3220  /* ambulkdelete updates progress metrics */
3221  (void) index_bulk_delete(&ivinfo, NULL,
3222  validate_index_callback, (void *) &state);
3223 
3224  /* Execute the sort */
3225  {
3226  const int index[] = {
3230  };
3231  const int64 val[] = {
3233  0, 0
3234  };
3235 
3236  pgstat_progress_update_multi_param(3, index, val);
3237  }
3239 
3240  /*
3241  * Now scan the heap and "merge" it with the index
3242  */
3245  table_index_validate_scan(heapRelation,
3246  indexRelation,
3247  indexInfo,
3248  snapshot,
3249  &state);
3250 
3251  /* Done with tuplesort object */
3252  tuplesort_end(state.tuplesort);
3253 
3254  elog(DEBUG2,
3255  "validate_index found %.0f heap tuples, %.0f index tuples; inserted %.0f missing tuples",
3256  state.htups, state.itups, state.tups_inserted);
3257 
3258  /* Roll back any GUC changes executed by index functions */
3259  AtEOXact_GUC(false, save_nestlevel);
3260 
3261  /* Restore userid and security context */
3262  SetUserIdAndSecContext(save_userid, save_sec_context);
3263 
3264  /* Close rels, but keep locks */
3265  index_close(indexRelation, NoLock);
3266  table_close(heapRelation, NoLock);
3267 }
3268 
3269 /*
3270  * validate_index_callback - bulkdelete callback to collect the index TIDs
3271  */
3272 static bool
3273 validate_index_callback(ItemPointer itemptr, void *opaque)
3274 {
3276  int64 encoded = itemptr_encode(itemptr);
3277 
3278  tuplesort_putdatum(state->tuplesort, Int64GetDatum(encoded), false);
3279  state->itups += 1;
3280  return false; /* never actually delete anything */
3281 }
3282 
3283 /*
3284  * index_set_state_flags - adjust pg_index state flags
3285  *
3286  * This is used during CREATE/DROP INDEX CONCURRENTLY to adjust the pg_index
3287  * flags that denote the index's state. Because the update is not
3288  * transactional and will not roll back on error, this must only be used as
3289  * the last step in a transaction that has not made any transactional catalog
3290  * updates!
3291  *
3292  * Note that heap_inplace_update does send a cache inval message for the
3293  * tuple, so other sessions will hear about the update as soon as we commit.
3294  *
3295  * NB: In releases prior to PostgreSQL 9.4, the use of a non-transactional
3296  * update here would have been unsafe; now that MVCC rules apply even for
3297  * system catalog scans, we could potentially use a transactional update here
3298  * instead.
3299  */
3300 void
3302 {
3303  Relation pg_index;
3304  HeapTuple indexTuple;
3305  Form_pg_index indexForm;
3306 
3307  /* Assert that current xact hasn't done any transactional updates */
3309 
3310  /* Open pg_index and fetch a writable copy of the index's tuple */
3311  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3312 
3313  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3314  ObjectIdGetDatum(indexId));
3315  if (!HeapTupleIsValid(indexTuple))
3316  elog(ERROR, "cache lookup failed for index %u", indexId);
3317  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3318 
3319  /* Perform the requested state change on the copy */
3320  switch (action)
3321  {
3323  /* Set indisready during a CREATE INDEX CONCURRENTLY sequence */
3324  Assert(indexForm->indislive);
3325  Assert(!indexForm->indisready);
3326  Assert(!indexForm->indisvalid);
3327  indexForm->indisready = true;
3328  break;
3330  /* Set indisvalid during a CREATE INDEX CONCURRENTLY sequence */
3331  Assert(indexForm->indislive);
3332  Assert(indexForm->indisready);
3333  Assert(!indexForm->indisvalid);
3334  indexForm->indisvalid = true;
3335  break;
3337 
3338  /*
3339  * Clear indisvalid during a DROP INDEX CONCURRENTLY sequence
3340  *
3341  * If indisready == true we leave it set so the index still gets
3342  * maintained by active transactions. We only need to ensure that
3343  * indisvalid is false. (We don't assert that either is initially
3344  * true, though, since we want to be able to retry a DROP INDEX
3345  * CONCURRENTLY that failed partway through.)
3346  *
3347  * Note: the CLUSTER logic assumes that indisclustered cannot be
3348  * set on any invalid index, so clear that flag too.
3349  */
3350  indexForm->indisvalid = false;
3351  indexForm->indisclustered = false;
3352  break;
3353  case INDEX_DROP_SET_DEAD:
3354 
3355  /*
3356  * Clear indisready/indislive during DROP INDEX CONCURRENTLY
3357  *
3358  * We clear both indisready and indislive, because we not only
3359  * want to stop updates, we want to prevent sessions from touching
3360  * the index at all.
3361  */
3362  Assert(!indexForm->indisvalid);
3363  indexForm->indisready = false;
3364  indexForm->indislive = false;
3365  break;
3366  }
3367 
3368  /* ... and write it back in-place */
3369  heap_inplace_update(pg_index, indexTuple);
3370 
3371  table_close(pg_index, RowExclusiveLock);
3372 }
3373 
3374 
3375 /*
3376  * IndexGetRelation: given an index's relation OID, get the OID of the
3377  * relation it is an index on. Uses the system cache.
3378  */
3379 Oid
3380 IndexGetRelation(Oid indexId, bool missing_ok)
3381 {
3382  HeapTuple tuple;
3384  Oid result;
3385 
3386  tuple = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
3387  if (!HeapTupleIsValid(tuple))
3388  {
3389  if (missing_ok)
3390  return InvalidOid;
3391  elog(ERROR, "cache lookup failed for index %u", indexId);
3392  }
3393  index = (Form_pg_index) GETSTRUCT(tuple);
3394  Assert(index->indexrelid == indexId);
3395 
3396  result = index->indrelid;
3397  ReleaseSysCache(tuple);
3398  return result;
3399 }
3400 
3401 /*
3402  * reindex_index - This routine is used to recreate a single index
3403  */
3404 void
3405 reindex_index(Oid indexId, bool skip_constraint_checks, char persistence,
3406  int options)
3407 {
3408  Relation iRel,
3409  heapRelation;
3410  Oid heapId;
3411  IndexInfo *indexInfo;
3412  volatile bool skipped_constraint = false;
3413  PGRUsage ru0;
3414  bool progress = (options & REINDEXOPT_REPORT_PROGRESS) != 0;
3415 
3416  pg_rusage_init(&ru0);
3417 
3418  /*
3419  * Open and lock the parent heap relation. ShareLock is sufficient since
3420  * we only need to be sure no schema or data changes are going on.
3421  */
3422  heapId = IndexGetRelation(indexId, false);
3423  heapRelation = table_open(heapId, ShareLock);
3424 
3425  if (progress)
3426  {
3428  heapId);
3432  indexId);
3433  }
3434 
3435  /*
3436  * Open the target index relation and get an exclusive lock on it, to
3437  * ensure that no one else is touching this particular index.
3438  */
3439  iRel = index_open(indexId, AccessExclusiveLock);
3440 
3441  if (progress)
3443  iRel->rd_rel->relam);
3444 
3445  /*
3446  * The case of reindexing partitioned tables and indexes is handled
3447  * differently by upper layers, so this case shouldn't arise.
3448  */
3449  if (iRel->rd_rel->relkind == RELKIND_PARTITIONED_INDEX)
3450  elog(ERROR, "unsupported relation kind for index \"%s\"",
3451  RelationGetRelationName(iRel));
3452 
3453  /*
3454  * Don't allow reindex on temp tables of other backends ... their local
3455  * buffer manager is not going to cope.
3456  */
3457  if (RELATION_IS_OTHER_TEMP(iRel))
3458  ereport(ERROR,
3459  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3460  errmsg("cannot reindex temporary tables of other sessions")));
3461 
3462  /*
3463  * Also check for active uses of the index in the current transaction; we
3464  * don't want to reindex underneath an open indexscan.
3465  */
3466  CheckTableNotInUse(iRel, "REINDEX INDEX");
3467 
3468  /*
3469  * All predicate locks on the index are about to be made invalid. Promote
3470  * them to relation locks on the heap.
3471  */
3473 
3474  /* Fetch info needed for index_build */
3475  indexInfo = BuildIndexInfo(iRel);
3476 
3477  /* If requested, skip checking uniqueness/exclusion constraints */
3478  if (skip_constraint_checks)
3479  {
3480  if (indexInfo->ii_Unique || indexInfo->ii_ExclusionOps != NULL)
3481  skipped_constraint = true;
3482  indexInfo->ii_Unique = false;
3483  indexInfo->ii_ExclusionOps = NULL;
3484  indexInfo->ii_ExclusionProcs = NULL;
3485  indexInfo->ii_ExclusionStrats = NULL;
3486  }
3487 
3488  /* ensure SetReindexProcessing state isn't leaked */
3489  PG_TRY();
3490  {
3491  /* Suppress use of the target index while rebuilding it */
3492  SetReindexProcessing(heapId, indexId);
3493 
3494  /* Create a new physical relation for the index */
3495  RelationSetNewRelfilenode(iRel, persistence);
3496 
3497  /* Initialize the index and rebuild */
3498  /* Note: we do not need to re-establish pkey setting */
3499  index_build(heapRelation, iRel, indexInfo, true, true);
3500  }
3501  PG_FINALLY();
3502  {
3503  /* Make sure flag gets cleared on error exit */
3505  }
3506  PG_END_TRY();
3507 
3508  /*
3509  * If the index is marked invalid/not-ready/dead (ie, it's from a failed
3510  * CREATE INDEX CONCURRENTLY, or a DROP INDEX CONCURRENTLY failed midway),
3511  * and we didn't skip a uniqueness check, we can now mark it valid. This
3512  * allows REINDEX to be used to clean up in such cases.
3513  *
3514  * We can also reset indcheckxmin, because we have now done a
3515  * non-concurrent index build, *except* in the case where index_build
3516  * found some still-broken HOT chains. If it did, and we don't have to
3517  * change any of the other flags, we just leave indcheckxmin alone (note
3518  * that index_build won't have changed it, because this is a reindex).
3519  * This is okay and desirable because not updating the tuple leaves the
3520  * index's usability horizon (recorded as the tuple's xmin value) the same
3521  * as it was.
3522  *
3523  * But, if the index was invalid/not-ready/dead and there were broken HOT
3524  * chains, we had better force indcheckxmin true, because the normal
3525  * argument that the HOT chains couldn't conflict with the index is
3526  * suspect for an invalid index. (A conflict is definitely possible if
3527  * the index was dead. It probably shouldn't happen otherwise, but let's
3528  * be conservative.) In this case advancing the usability horizon is
3529  * appropriate.
3530  *
3531  * Another reason for avoiding unnecessary updates here is that while
3532  * reindexing pg_index itself, we must not try to update tuples in it.
3533  * pg_index's indexes should always have these flags in their clean state,
3534  * so that won't happen.
3535  *
3536  * If early pruning/vacuuming is enabled for the heap relation, the
3537  * usability horizon must be advanced to the current transaction on every
3538  * build or rebuild. pg_index is OK in this regard because catalog tables
3539  * are not subject to early cleanup.
3540  */
3541  if (!skipped_constraint)
3542  {
3543  Relation pg_index;
3544  HeapTuple indexTuple;
3545  Form_pg_index indexForm;
3546  bool index_bad;
3547  bool early_pruning_enabled = EarlyPruningEnabled(heapRelation);
3548 
3549  pg_index = table_open(IndexRelationId, RowExclusiveLock);
3550 
3551  indexTuple = SearchSysCacheCopy1(INDEXRELID,
3552  ObjectIdGetDatum(indexId));
3553  if (!HeapTupleIsValid(indexTuple))
3554  elog(ERROR, "cache lookup failed for index %u", indexId);
3555  indexForm = (Form_pg_index) GETSTRUCT(indexTuple);
3556 
3557  index_bad = (!indexForm->indisvalid ||
3558  !indexForm->indisready ||
3559  !indexForm->indislive);
3560  if (index_bad ||
3561  (indexForm->indcheckxmin && !indexInfo->ii_BrokenHotChain) ||
3562  early_pruning_enabled)
3563  {
3564  if (!indexInfo->ii_BrokenHotChain && !early_pruning_enabled)
3565  indexForm->indcheckxmin = false;
3566  else if (index_bad || early_pruning_enabled)
3567  indexForm->indcheckxmin = true;
3568  indexForm->indisvalid = true;
3569  indexForm->indisready = true;
3570  indexForm->indislive = true;
3571  CatalogTupleUpdate(pg_index, &indexTuple->t_self, indexTuple);
3572 
3573  /*
3574  * Invalidate the relcache for the table, so that after we commit
3575  * all sessions will refresh the table's index list. This ensures
3576  * that if anyone misses seeing the pg_index row during this
3577  * update, they'll refresh their list before attempting any update
3578  * on the table.
3579  */
3580  CacheInvalidateRelcache(heapRelation);
3581  }
3582 
3583  table_close(pg_index, RowExclusiveLock);
3584  }
3585 
3586  /* Log what we did */
3587  if (options & REINDEXOPT_VERBOSE)
3588  ereport(INFO,
3589  (errmsg("index \"%s\" was reindexed",
3590  get_rel_name(indexId)),
3591  errdetail_internal("%s",
3592  pg_rusage_show(&ru0))));
3593 
3594  if (progress)
3596 
3597  /* Close rels, but keep locks */
3598  index_close(iRel, NoLock);
3599  table_close(heapRelation, NoLock);
3600 }
3601 
3602 /*
3603  * reindex_relation - This routine is used to recreate all indexes
3604  * of a relation (and optionally its toast relation too, if any).
3605  *
3606  * "flags" is a bitmask that can include any combination of these bits:
3607  *
3608  * REINDEX_REL_PROCESS_TOAST: if true, process the toast table too (if any).
3609  *
3610  * REINDEX_REL_SUPPRESS_INDEX_USE: if true, the relation was just completely
3611  * rebuilt by an operation such as VACUUM FULL or CLUSTER, and therefore its
3612  * indexes are inconsistent with it. This makes things tricky if the relation
3613  * is a system catalog that we might consult during the reindexing. To deal
3614  * with that case, we mark all of the indexes as pending rebuild so that they
3615  * won't be trusted until rebuilt. The caller is required to call us *without*
3616  * having made the rebuilt table visible by doing CommandCounterIncrement;
3617  * we'll do CCI after having collected the index list. (This way we can still
3618  * use catalog indexes while collecting the list.)
3619  *
3620  * REINDEX_REL_CHECK_CONSTRAINTS: if true, recheck unique and exclusion
3621  * constraint conditions, else don't. To avoid deadlocks, VACUUM FULL or
3622  * CLUSTER on a system catalog must omit this flag. REINDEX should be used to
3623  * rebuild an index if constraint inconsistency is suspected. For optimal
3624  * performance, other callers should include the flag only after transforming
3625  * the data in a manner that risks a change in constraint validity.
3626  *
3627  * REINDEX_REL_FORCE_INDEXES_UNLOGGED: if true, set the persistence of the
3628  * rebuilt indexes to unlogged.
3629  *
3630  * REINDEX_REL_FORCE_INDEXES_PERMANENT: if true, set the persistence of the
3631  * rebuilt indexes to permanent.
3632  *
3633  * Returns true if any indexes were rebuilt (including toast table's index
3634  * when relevant). Note that a CommandCounterIncrement will occur after each
3635  * index rebuild.
3636  */
3637 bool
3639 {
3640  Relation rel;
3641  Oid toast_relid;
3642  List *indexIds;
3643  bool result;
3644  int i;
3645 
3646  /*
3647  * Open and lock the relation. ShareLock is sufficient since we only need
3648  * to prevent schema and data changes in it. The lock level used here
3649  * should match ReindexTable().
3650  */
3651  rel = table_open(relid, ShareLock);
3652 
3653  /*
3654  * This may be useful when implemented someday; but that day is not today.
3655  * For now, avoid erroring out when called in a multi-table context
3656  * (REINDEX SCHEMA) and happen to come across a partitioned table. The
3657  * partitions may be reindexed on their own anyway.
3658  */
3659  if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
3660  {
3661  ereport(WARNING,
3662  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3663  errmsg("REINDEX of partitioned tables is not yet implemented, skipping \"%s\"",
3664  RelationGetRelationName(rel))));
3665  table_close(rel, ShareLock);
3666  return false;
3667  }
3668 
3669  toast_relid = rel->rd_rel->reltoastrelid;
3670 
3671  /*
3672  * Get the list of index OIDs for this relation. (We trust to the
3673  * relcache to get this with a sequential scan if ignoring system
3674  * indexes.)
3675  */
3676  indexIds = RelationGetIndexList(rel);
3677 
3678  PG_TRY();
3679  {
3680  ListCell *indexId;
3681  char persistence;
3682 
3683  if (flags & REINDEX_REL_SUPPRESS_INDEX_USE)
3684  {
3685  /* Suppress use of all the indexes until they are rebuilt */
3686  SetReindexPending(indexIds);
3687 
3688  /*
3689  * Make the new heap contents visible --- now things might be
3690  * inconsistent!
3691  */
3693  }
3694 
3695  /*
3696  * Compute persistence of indexes: same as that of owning rel, unless
3697  * caller specified otherwise.
3698  */
3700  persistence = RELPERSISTENCE_UNLOGGED;
3701  else if (flags & REINDEX_REL_FORCE_INDEXES_PERMANENT)
3702  persistence = RELPERSISTENCE_PERMANENT;
3703  else
3704  persistence = rel->rd_rel->relpersistence;
3705 
3706  /* Reindex all the indexes. */
3707  i = 1;
3708  foreach(indexId, indexIds)
3709  {
3710  Oid indexOid = lfirst_oid(indexId);
3711 
3712  reindex_index(indexOid, !(flags & REINDEX_REL_CHECK_CONSTRAINTS),
3713  persistence, options);
3714 
3716 
3717  /* Index should no longer be in the pending list */
3718  Assert(!ReindexIsProcessingIndex(indexOid));
3719 
3720  /* Set index rebuild count */
3722  i);
3723  i++;
3724  }
3725  }
3726  PG_FINALLY();
3727  {
3728  /* Make sure list gets cleared on error exit */
3730  }
3731  PG_END_TRY();
3732 
3733  /*
3734  * Close rel, but continue to hold the lock.
3735  */
3736  table_close(rel, NoLock);
3737 
3738  result = (indexIds != NIL);
3739 
3740  /*
3741  * If the relation has a secondary toast rel, reindex that too while we
3742  * still hold the lock on the master table.
3743  */
3744  if ((flags & REINDEX_REL_PROCESS_TOAST) && OidIsValid(toast_relid))
3745  result |= reindex_relation(toast_relid, flags, options);
3746 
3747  return result;
3748 }
3749 
3750 
3751 /* ----------------------------------------------------------------
3752  * System index reindexing support
3753  *
3754  * When we are busy reindexing a system index, this code provides support
3755  * for preventing catalog lookups from using that index. We also make use
3756  * of this to catch attempted uses of user indexes during reindexing of
3757  * those indexes. This information is propagated to parallel workers;
3758  * attempting to change it during a parallel operation is not permitted.
3759  * ----------------------------------------------------------------
3760  */
3761 
3765 
3766 /*
3767  * ReindexIsProcessingHeap
3768  * True if heap specified by OID is currently being reindexed.
3769  */
3770 bool
3772 {
3773  return heapOid == currentlyReindexedHeap;
3774 }
3775 
3776 /*
3777  * ReindexIsCurrentlyProcessingIndex
3778  * True if index specified by OID is currently being reindexed.
3779  */
3780 static bool
3782 {
3783  return indexOid == currentlyReindexedIndex;
3784 }
3785 
3786 /*
3787  * ReindexIsProcessingIndex
3788  * True if index specified by OID is currently being reindexed,
3789  * or should be treated as invalid because it is awaiting reindex.
3790  */
3791 bool
3793 {
3794  return indexOid == currentlyReindexedIndex ||
3795  list_member_oid(pendingReindexedIndexes, indexOid);
3796 }
3797 
3798 /*
3799  * SetReindexProcessing
3800  * Set flag that specified heap/index are being reindexed.
3801  *
3802  * NB: caller must use a PG_TRY block to ensure ResetReindexProcessing is done.
3803  */
3804 static void
3805 SetReindexProcessing(Oid heapOid, Oid indexOid)
3806 {
3807  Assert(OidIsValid(heapOid) && OidIsValid(indexOid));
3808  /* Reindexing is not re-entrant. */
3810  elog(ERROR, "cannot reindex while reindexing");
3811  currentlyReindexedHeap = heapOid;
3812  currentlyReindexedIndex = indexOid;
3813  /* Index is no longer "pending" reindex. */
3814  RemoveReindexPending(indexOid);
3815 }
3816 
3817 /*
3818  * ResetReindexProcessing
3819  * Unset reindexing status.
3820  */
3821 static void
3823 {
3824  /* This may be called in leader error path */
3827 }
3828 
3829 /*
3830  * SetReindexPending
3831  * Mark the given indexes as pending reindex.
3832  *
3833  * NB: caller must use a PG_TRY block to ensure ResetReindexPending is done.
3834  * Also, we assume that the current memory context stays valid throughout.
3835  */
3836 static void
3838 {
3839  /* Reindexing is not re-entrant. */
3840  if (pendingReindexedIndexes)
3841  elog(ERROR, "cannot reindex while reindexing");
3842  if (IsInParallelMode())
3843  elog(ERROR, "cannot modify reindex state during a parallel operation");
3844  pendingReindexedIndexes = list_copy(indexes);
3845 }
3846 
3847 /*
3848  * RemoveReindexPending
3849  * Remove the given index from the pending list.
3850  */
3851 static void
3853 {
3854  if (IsInParallelMode())
3855  elog(ERROR, "cannot modify reindex state during a parallel operation");
3856  pendingReindexedIndexes = list_delete_oid(pendingReindexedIndexes,
3857  indexOid);
3858 }
3859 
3860 /*
3861  * ResetReindexPending
3862  * Unset reindex-pending status.
3863  */
3864 static void
3866 {
3867  /* This may be called in leader error path */
3868  pendingReindexedIndexes = NIL;
3869 }
3870 
3871 /*
3872  * EstimateReindexStateSpace
3873  * Estimate space needed to pass reindex state to parallel workers.
3874  */
3875 Size
3877 {
3878  return offsetof(SerializedReindexState, pendingReindexedIndexes)
3879  + mul_size(sizeof(Oid), list_length(pendingReindexedIndexes));
3880 }
3881 
3882 /*
3883  * SerializeReindexState
3884  * Serialize reindex state for parallel workers.
3885  */
3886 void
3887 SerializeReindexState(Size maxsize, char *start_address)
3888 {
3889  SerializedReindexState *sistate = (SerializedReindexState *) start_address;
3890  int c = 0;
3891  ListCell *lc;
3892 
3895  sistate->numPendingReindexedIndexes = list_length(pendingReindexedIndexes);
3896  foreach(lc, pendingReindexedIndexes)
3897  sistate->pendingReindexedIndexes[c++] = lfirst_oid(lc);
3898 }
3899 
3900 /*
3901  * RestoreReindexState
3902  * Restore reindex state in a parallel worker.
3903  */
3904 void
3905 RestoreReindexState(void *reindexstate)
3906 {
3907  SerializedReindexState *sistate = (SerializedReindexState *) reindexstate;
3908  int c = 0;
3909  MemoryContext oldcontext;
3910 
3913 
3914  Assert(pendingReindexedIndexes == NIL);
3916  for (c = 0; c < sistate->numPendingReindexedIndexes; ++c)
3917  pendingReindexedIndexes =
3918  lappend_oid(pendingReindexedIndexes,
3919  sistate->pendingReindexedIndexes[c]);
3920  MemoryContextSwitchTo(oldcontext);
3921 }
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
Definition: tableam.c:77
signed short int16
Definition: c.h:346
void FormIndexDatum(IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
Definition: index.c:2567
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:680
void WaitForLockers(LOCKTAG heaplocktag, LOCKMODE lockmode, bool progress)
Definition: lmgr.c:942
#define NIL
Definition: pg_list.h:65
Definition: c.h:595
struct IndexAmRoutine * rd_indam
Definition: rel.h:157
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3380
void RelationGetExclusionInfo(Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
Definition: relcache.c:5015
uint16 * ii_UniqueStrats
Definition: execnodes.h:168
bool IsCatalogRelation(Relation relation)
Definition: catalog.c:99
List * SystemFuncName(char *name)
LockRelId lockRelId
Definition: rel.h:43
static Oid currentlyReindexedHeap
Definition: index.c:3762
#define PROGRESS_CREATEIDX_PHASE_VALIDATE_SORT
Definition: progress.h:78
static void index_update_stats(Relation rel, bool hasindex, double reltuples)
Definition: index.c:2646
bool ConstraintNameIsUsed(ConstraintCategory conCat, Oid objId, const char *conname)
void tuplesort_performsort(Tuplesortstate *state)
Definition: tuplesort.c:1791
bool CompareIndexInfo(IndexInfo *info1, IndexInfo *info2, Oid *collations1, Oid *collations2, Oid *opfamilies1, Oid *opfamilies2, AttrNumber *attmap, int maplen)
Definition: index.c:2388
static Datum ExecEvalExprSwitchContext(ExprState *state, ExprContext *econtext, bool *isNull)
Definition: executor.h:300
#define DEBUG1
Definition: elog.h:25
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
void smgrcreate(SMgrRelation reln, ForkNumber forknum, bool isRedo)
Definition: smgr.c:333
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:525
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
void index_drop(Oid indexId, bool concurrent, bool concurrent_lock_mode)
Definition: index.c:2007
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:528
void tuplesort_putdatum(Tuplesortstate *state, Datum val, bool isNull)
Definition: tuplesort.c:1556
Oid currentlyReindexedIndex
Definition: index.c:93
List * ii_Predicate
Definition: execnodes.h:161
Tuplesortstate * tuplesort_begin_datum(Oid datumType, Oid sortOperator, Oid sortCollation, bool nullsFirstFlag, int workMem, SortCoordinate coordinate, bool randomAccess)
Definition: tuplesort.c:1099
static bool ReindexIsCurrentlyProcessingIndex(Oid indexOid)
Definition: index.c:3781
PgStat_Counter tuples_returned
Definition: pgstat.h:638
bool IsSystemRelation(Relation relation)
Definition: catalog.c:69
uint32 TransactionId
Definition: c.h:514
#define INDEX_CREATE_IF_NOT_EXISTS
Definition: index.h:51
#define SECURITY_RESTRICTED_OPERATION
Definition: miscadmin.h:300
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:865
TableScanDesc table_beginscan_catalog(Relation relation, int nkeys, struct ScanKeyData *key)
Definition: tableam.c:98
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:321
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:44
void SetUserIdAndSecContext(Oid userid, int sec_context)
Definition: miscinit.c:492
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3011
#define RelationGetDescr(relation)
Definition: rel.h:448
#define INDEX_CREATE_INVALID
Definition: index.h:53
int LOCKMODE
Definition: lockdefs.h:26
PgStat_Counter t_tuples_fetched
Definition: pgstat.h:102
void pgstat_progress_start_command(ProgressCommandType cmdtype, Oid relid)
Definition: pgstat.c:3197
int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...)
Definition: elog.c:932
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3301
uint16 bits16
Definition: c.h:367
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:275
static void SetReindexProcessing(Oid heapOid, Oid indexOid)
Definition: index.c:3805
int namecpy(Name n1, const NameData *n2)
Definition: name.c:233
static void SetReindexPending(List *indexes)
Definition: index.c:3837
#define PointerGetDatum(X)
Definition: postgres.h:556
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
Node * whenClause
Definition: parsenodes.h:2417
struct SMgrRelationData * rd_smgr
Definition: rel.h:56
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:51
void SerializeReindexState(Size maxsize, char *start_address)
Definition: index.c:3887
void pgstat_progress_update_param(int index, int64 val)
Definition: pgstat.c:3218
ExprState * ii_PredicateState
Definition: execnodes.h:162
#define RelationGetForm(relation)
Definition: rel.h:416
void CommitTransactionCommand(void)
Definition: xact.c:2898
MemoryContext ecxt_per_tuple_memory
Definition: execnodes.h:231
List * RelationGetDummyIndexExpressions(Relation relation)
Definition: relcache.c:4640
bool analyze_only
Definition: genam.h:47
int2vector * buildint2vector(const int16 *int2s, int n)
Definition: int.c:114
Oid dbId
Definition: rel.h:38
bool report_progress
Definition: genam.h:48
BufferAccessStrategy strategy
Definition: genam.h:52
static void InitializeAttributeOids(Relation indexRelation, int numatts, Oid indexoid)
Definition: index.c:470
Oid binary_upgrade_next_index_pg_class_oid
Definition: index.c:84
#define REINDEXOPT_REPORT_PROGRESS
Definition: parsenodes.h:3317
long deleteDependencyRecordsFor(Oid classId, Oid objectId, bool skipExtensionDeps)
Definition: pg_depend.c:190
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define Int16GetDatum(X)
Definition: postgres.h:451
Definition: lock.h:163
static void ResetReindexPending(void)
Definition: index.c:3865
bool DeleteInheritsTuple(Oid inhrelid, Oid inhparent)
Definition: pg_inherits.c:454
static List * pendingReindexedIndexes
Definition: index.c:3764
List * list_copy(const List *oldlist)
Definition: list.c:1404
Definition: nodes.h:525
Oid * ii_ExclusionProcs
Definition: execnodes.h:164
bool get_collation_isdeterministic(Oid colloid)
Definition: lsyscache.c:942
int errcode(int sqlerrcode)
Definition: elog.c:608
void * stringToNode(const char *str)
Definition: read.c:89
Relation index
Definition: genam.h:46
#define MemSet(start, val, len)
Definition: c.h:962
#define INFO
Definition: elog.h:33
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Definition: heaptuple.c:359
int32 relallvisible
Definition: pg_class.h:66
void MemoryContextReset(MemoryContext context)
Definition: mcxt.c:136
#define PROGRESS_CREATEIDX_TUPLES_TOTAL
Definition: progress.h:67
uint32 BlockNumber
Definition: block.h:31
void RelationForgetRelation(Oid rid)
Definition: relcache.c:2702
void PopActiveSnapshot(void)
Definition: snapmgr.c:814
void CatalogTupleDelete(Relation heapRel, ItemPointer tid)
Definition: indexing.c:269
void recordDependencyOn(const ObjectAddress *depender, const ObjectAddress *referenced, DependencyType behavior)
Definition: pg_depend.c:43
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, Datum *values, bool *isnull)
Definition: heaptuple.c:1020
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2285
bool smgrexists(SMgrRelation reln, ForkNumber forknum)
Definition: smgr.c:247
PgStat_Counter numscans
Definition: pgstat.h:636
#define INDEX_CONSTR_CREATE_REMOVE_OLD_DEPS
Definition: index.h:79
void visibilitymap_count(Relation rel, BlockNumber *all_visible, BlockNumber *all_frozen)
void index_check_primary_key(Relation heapRel, IndexInfo *indexInfo, bool is_alter_table, IndexStmt *stmt)
Definition: index.c:200
PgStat_TableCounts t_counts
Definition: pgstat.h:158
void index_concurrently_swap(Oid newIndexId, Oid oldIndexId, const char *oldName)
Definition: index.c:1448
#define REINDEX_REL_SUPPRESS_INDEX_USE
Definition: index.h:139
static bool table_scan_getnextslot(TableScanDesc sscan, ScanDirection direction, TupleTableSlot *slot)
Definition: tableam.h:872
Form_pg_class rd_rel
Definition: rel.h:83
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1338
unsigned int Oid
Definition: postgres_ext.h:31
static bool ExecQual(ExprState *state, ExprContext *econtext)
Definition: executor.h:365
Oid pendingReindexedIndexes[FLEXIBLE_ARRAY_MEMBER]
Definition: index.c:95
int namestrcpy(Name name, const char *str)
Definition: name.c:250
Oid amkeytype
Definition: amapi.h:201
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:691
List * lappend_oid(List *list, Oid datum)
Definition: list.c:358
#define OidIsValid(objectId)
Definition: c.h:645
#define InvokeObjectPostAlterHookArg(classId, objectId, subId, auxiliaryId, is_internal)
Definition: objectaccess.h:178
PgStat_Counter t_tuples_returned
Definition: pgstat.h:101
Oid * ii_UniqueOps
Definition: execnodes.h:166
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:352
bool IsBinaryUpgrade
Definition: globals.c:110
double itups
Definition: index.h:37
static TableScanDesc table_beginscan_strat(Relation rel, Snapshot snapshot, int nkeys, struct ScanKeyData *key, bool allow_strat, bool allow_sync)
Definition: tableam.h:760
#define REINDEXOPT_VERBOSE
Definition: parsenodes.h:3316
int32 relpages
Definition: pg_class.h:60
char relkind
Definition: pg_class.h:81
signed int int32
Definition: c.h:347
int errdetail_internal(const char *fmt,...)
Definition: elog.c:982
static void ResetReindexProcessing(void)
Definition: index.c:3822
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4694
void pg_rusage_init(PGRUsage *ru0)
Definition: pg_rusage.c:27
Definition: type.h:89
#define INDEX_CONSTR_CREATE_INIT_DEFERRED
Definition: index.h:77
void RelationSetNewRelfilenode(Relation relation, char persistence)
Definition: relcache.c:3417
void SetRelationHasSubclass(Oid relationId, bool relhassubclass)
Definition: tablecmds.c:2837
void InsertPgClassTuple(Relation pg_class_desc, Relation new_rel_desc, Oid new_rel_oid, Datum relacl, Datum reloptions)
Definition: heap.c:848
#define RelationOpenSmgr(relation)
Definition: rel.h:479
RangeVar * constrrel
Definition: parsenodes.h:2424
void FreeExecutorState(EState *estate)
Definition: execUtils.c:190
#define GetPerTupleExprContext(estate)
Definition: executor.h:501
List * ii_ExpressionsState
Definition: execnodes.h:160
Form_pg_index rd_index
Definition: rel.h:143
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:444
unsigned short uint16
Definition: c.h:358
void pfree(void *pointer)
Definition: mcxt.c:1056
bool IsInParallelMode(void)
Definition: xact.c:996
Oid * rd_indcollation
Definition: rel.h:168
#define EarlyPruningEnabled(rel)
Definition: snapmgr.h:45
void UnlockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:382
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
int ii_NumIndexKeyAttrs
Definition: execnodes.h:157
Definition: rel.h:35
ambuild_function ambuild
Definition: amapi.h:210
char relpersistence
Definition: pg_class.h:78
void LockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:369
IndexAmRoutine * GetIndexAmRoutineByAmId(Oid amoid, bool noerror)
Definition: amapi.c:56
#define RelationIsValid(relation)
Definition: rel.h:395
bool ReindexIsProcessingHeap(Oid heapOid)
Definition: index.c:3771
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: relation.c:48
ItemPointerData t_self
Definition: htup.h:65
Oid get_relname_relid(const char *relname, Oid relnamespace)
Definition: lsyscache.c:1687
#define DEBUG2
Definition: elog.h:24
Tuplesortstate * tuplesort
Definition: index.h:35
#define AttrNumberGetAttrOffset(attNum)
Definition: attnum.h:51
PgStat_StatTabEntry * pgstat_fetch_stat_tabentry(Oid relid)
Definition: pgstat.c:2457
#define SET_LOCKTAG_RELATION(locktag, dboid, reloid)
Definition: lock.h:180
char * c
#define NoLock
Definition: lockdefs.h:34
LockInfoData rd_lockInfo
Definition: rel.h:86
#define IsNormalProcessingMode()
Definition: miscadmin.h:376
HeapTuple heap_getnext(TableScanDesc sscan, ScanDirection direction)
Definition: heapam.c:1290
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
Definition: execTuples.c:1224
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4581
Oid * ii_UniqueProcs
Definition: execnodes.h:167
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:603
void GetUserIdAndSecContext(Oid *userid, int *sec_context)
Definition: miscinit.c:485
#define RowExclusiveLock
Definition: lockdefs.h:38
void AtEOXact_GUC(bool isCommit, int nestLevel)
Definition: guc.c:5792
#define PROGRESS_CREATEIDX_INDEX_OID
Definition: progress.h:63
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:163
IndexStateFlagsAction
Definition: index.h:24
const char * pg_rusage_show(const PGRUsage *ru0)
Definition: pg_rusage.c:40
#define InvalidTransactionId
Definition: transam.h:31
#define RelationGetRelationName(relation)
Definition: rel.h:456
ExprState * ExecPrepareQual(List *qual, EState *estate)
Definition: execExpr.c:518
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
List * list_delete_oid(List *list, Oid datum)
Definition: list.c:835
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
PgStat_Counter tuples_fetched
Definition: pgstat.h:639
bool ii_BrokenHotChain
Definition: execnodes.h:172
bool ActiveSnapshotSet(void)
Definition: snapmgr.c:853
Oid * rd_opfamily
Definition: rel.h:158
Oid get_index_constraint(Oid indexId)
Definition: pg_depend.c:873
#define TriggerConstraintIndexId
Definition: indexing.h:254
static int64 itemptr_encode(ItemPointer itemptr)
Definition: index.h:168
static TupleDesc ConstructTupleDescriptor(Relation heapRelation, IndexInfo *indexInfo, List *indexColNames, Oid accessMethodObjectId, Oid *collationObjectId, Oid *classObjectId)
Definition: index.c:266
#define IndexRelationGetNumberOfKeyAttributes(relation)
Definition: rel.h:441
TransactionId GetTopTransactionIdIfAny(void)
Definition: xact.c:409
Oid index_concurrently_create_copy(Relation heapRelation, Oid oldIndexId, const char *newName)
Definition: index.c:1241
IndexInfo * makeIndexInfo(int numattrs, int numkeyattrs, Oid amoid, List *expressions, List *predicates, bool unique, bool isready, bool concurrent)
Definition: makefuncs.c:740
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:3421
void StoreSingleInheritance(Oid relationId, Oid parentOid, int32 seqNumber)
Definition: pg_inherits.c:417
Datum Int64GetDatum(int64 X)
Definition: fmgr.c:1699
static void IndexCheckExclusion(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo)
Definition: index.c:2989
#define ATTRIBUTE_FIXED_PART_SIZE
Definition: pg_attribute.h:192
Size EstimateReindexStateSpace(void)
Definition: index.c:3876
void index_register(Oid heap, Oid ind, IndexInfo *indexInfo)
Definition: bootstrap.c:1077
bool ii_ReadyForInserts
Definition: execnodes.h:170
#define ereport(elevel, rest)
Definition: elog.h:141
Node * map_variable_attnos(Node *node, int target_varno, int sublevels_up, const AttrNumber *attno_map, int map_length, Oid to_rowtype, bool *found_whole_row)
PgStat_Counter t_blocks_hit
Definition: pgstat.h:115
MemoryContext TopMemoryContext
Definition: mcxt.c:44
int numPendingReindexedIndexes
Definition: index.c:94
EState * CreateExecutorState(void)
Definition: execUtils.c:88
void TransferPredicateLocksToHeapRelation(Relation relation)
Definition: predicate.c:3081
bool get_rel_relispartition(Oid relid)
Definition: lsyscache.c:1829
List * ExecPrepareExprList(List *nodes, EState *estate)
Definition: execExpr.c:564
void UnregisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:907
List * lappend(List *list, void *datum)
Definition: list.c:322
static Oid currentlyReindexedIndex
Definition: index.c:3763
#define PROGRESS_CREATEIDX_SUBPHASE_INITIALIZE
Definition: progress.h:87
#define WARNING
Definition: elog.h:40
void validate_index(Oid heapId, Oid indexId, Snapshot snapshot)
Definition: index.c:3145
static void AppendAttributeTuples(Relation indexRelation, int numatts)
Definition: index.c:488
#define RelationIsMapped(relation)
Definition: rel.h:471
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
float float4
Definition: c.h:491
int progress
Definition: pgbench.c:235
#define PROGRESS_CREATEIDX_PHASE
Definition: progress.h:65
Definition: c.h:584
Size mul_size(Size s1, Size s2)
Definition: shmem.c:492
#define PG_FINALLY()
Definition: elog.h:339
#define TextDatumGetCString(d)
Definition: builtins.h:84
#define PROGRESS_SCAN_BLOCKS_DONE
Definition: progress.h:103
void pgstat_progress_end_command(void)
Definition: pgstat.c:3269
void RelationDropStorage(Relation rel)
Definition: storage.c:147
IndexBulkDeleteResult * index_bulk_delete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: indexam.c:682
uintptr_t Datum
Definition: postgres.h:367
void CommandCounterIncrement(void)
Definition: xact.c:1005
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
Expr * make_ands_explicit(List *andclauses)
Definition: makefuncs.c:705
int ii_NumIndexAttrs
Definition: execnodes.h:156
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:716
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:1377
static bool relationHasPrimaryKey(Relation rel)
Definition: index.c:146
#define PROGRESS_CREATEIDX_COMMAND_REINDEX
Definition: progress.h:93
PgStat_Counter blocks_hit
Definition: pgstat.h:651
#define InvalidMultiXactId
Definition: multixact.h:23
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:198
#define InvokeObjectPostCreateHookArg(classId, objectId, subId, is_internal)
Definition: objectaccess.h:153
long deleteDependencyRecordsForClass(Oid classId, Oid objectId, Oid refclassId, char deptype)
Definition: pg_depend.c:240
PgStat_Counter t_numscans
Definition: pgstat.h:99
#define INDEX_CREATE_IS_PRIMARY
Definition: index.h:47
#define BoolGetDatum(X)
Definition: postgres.h:402
static void RemoveReindexPending(Oid indexOid)
Definition: index.c:3852
long changeDependenciesOf(Oid classId, Oid oldObjectId, Oid newObjectId)
Definition: pg_depend.c:407
#define InvalidOid
Definition: postgres_ext.h:36
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: tuptable.h:381
FormData_pg_attribute
Definition: pg_attribute.h:184
#define INDEX_CREATE_CONCURRENT
Definition: index.h:50
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1092
int16 attnum
Definition: pg_attribute.h:79
void DeleteRelationTuple(Oid relid)
Definition: heap.c:1472
int maintenance_work_mem
Definition: globals.c:122
TransactionId relminmxid
Definition: pg_class.h:126
#define NOTICE
Definition: elog.h:37
int message_level
Definition: genam.h:50
TransactionId MultiXactId
Definition: c.h:524
double num_heap_tuples
Definition: genam.h:51
bool ii_Unique
Definition: execnodes.h:169
#define makeNode(_type_)
Definition: nodes.h:573
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
FormData_pg_constraint * Form_pg_constraint
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:675
void index_build(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isreindex, bool parallel)
Definition: index.c:2794
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define REINDEX_REL_FORCE_INDEXES_UNLOGGED
Definition: index.h:141
List * ii_Expressions
Definition: execnodes.h:159
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: relation.c:206
#define Assert(condition)
Definition: c.h:739
oidvector * buildoidvector(const Oid *oids, int n)
Definition: oid.c:167
#define lfirst(lc)
Definition: pg_list.h:190
Definition: regguts.h:298
double tups_inserted
Definition: index.h:37
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:552
#define PROGRESS_CREATEIDX_PHASE_BUILD
Definition: progress.h:75
#define PROGRESS_CREATEIDX_PHASE_VALIDATE_TABLESCAN
Definition: progress.h:79
void StartTransactionCommand(void)
Definition: xact.c:2797
void recordDependencyOnSingleRelExpr(const ObjectAddress *depender, Node *expr, Oid relId, DependencyType behavior, DependencyType self_behavior, bool reverse_self)
Definition: dependency.c:1629
CatalogIndexState CatalogOpenIndexes(Relation heapRel)
Definition: indexing.c:42
Relation heap_create(const char *relname, Oid relnamespace, Oid reltablespace, Oid relid, Oid relfilenode, Oid accessmtd, TupleDesc tupDesc, char relkind, char relpersistence, bool shared_relation, bool mapped_relation, bool allow_system_table_mods, TransactionId *relfrozenxid, MultiXactId *relminmxid)
Definition: heap.c:295
void pgstat_progress_update_multi_param(int nparam, const int *index, const int64 *val)
Definition: pgstat.c:3240
#define linitial_oid(l)
Definition: pg_list.h:197
#define INDEX_MAX_KEYS
int ii_ParallelWorkers
Definition: execnodes.h:173
size_t Size
Definition: c.h:467
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:224
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
struct PgStat_TableStatus * pgstat_info
Definition: rel.h:204
int plan_create_index_workers(Oid tableOid, Oid indexOid)
Definition: planner.c:6249
FormData_pg_type * Form_pg_type
Definition: pg_type.h:250
static int list_length(const List *l)
Definition: pg_list.h:169
#define REINDEX_REL_CHECK_CONSTRAINTS
Definition: index.h:140
FormData_pg_trigger * Form_pg_trigger
Definition: pg_trigger.h:71
HeapTuple SearchSysCache2(int cacheId, Datum key1, Datum key2)
Definition: syscache.c:1127
Oid GetNewRelFileNode(Oid reltablespace, Relation pg_class, char relpersistence)
Definition: catalog.c:385
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:223
#define PROGRESS_SCAN_BLOCKS_TOTAL
Definition: progress.h:102
List * get_index_ref_constraints(Oid indexId)
Definition: pg_depend.c:929
void DeleteAttributeTuples(Oid relid)
Definition: heap.c:1501
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:592
#define INDEX_CONSTR_CREATE_UPDATE_INDEX
Definition: index.h:78
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4347
Snapshot GetLatestSnapshot(void)
Definition: snapmgr.c:381
void reindex_index(Oid indexId, bool skip_constraint_checks, char persistence, int options)
Definition: index.c:3405
bool ii_Concurrent
Definition: execnodes.h:171
#define InvalidAttrNumber
Definition: attnum.h:23
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:152
#define DatumGetPointer(X)
Definition: postgres.h:549
void CacheInvalidateRelcache(Relation relation)
Definition: inval.c:1270
double htups
Definition: index.h:37
void RemoveStatistics(Oid relid, AttrNumber attnum)
Definition: heap.c:3090
static void table_endscan(TableScanDesc scan)
Definition: tableam.h:831
static Datum values[MAXATTR]
Definition: bootstrap.c:167
void RelationInitIndexAccessInfo(Relation relation)
Definition: relcache.c:1361
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:374
FormData_pg_class * Form_pg_class
Definition: pg_class.h:150
#define INDEX_CREATE_SKIP_BUILD
Definition: index.h:49
Oid get_base_element_type(Oid typid)
Definition: lsyscache.c:2599
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:174
#define AccessExclusiveLock
Definition: lockdefs.h:45
#define PROGRESS_CREATEIDX_PHASE_VALIDATE_IDXSCAN
Definition: progress.h:77
#define INDEX_CREATE_PARTITIONED
Definition: index.h:52
#define Int32GetDatum(X)
Definition: postgres.h:479
int NewGUCNestLevel(void)
Definition: guc.c:5778
void InsertPgAttributeTuple(Relation pg_attribute_rel, Form_pg_attribute new_attribute, CatalogIndexState indstate)
Definition: heap.c:694
Oid * ii_ExclusionOps
Definition: execnodes.h:163
void RestoreReindexState(void *reindexstate)
Definition: index.c:3905
void * palloc(Size size)
Definition: mcxt.c:949
int errmsg(const char *fmt,...)
Definition: elog.c:822
void heap_inplace_update(Relation relation, HeapTuple tuple)
Definition: heapam.c:5707
IndexInfo * BuildDummyIndexInfo(Relation index)
Definition: index.c:2342
static void table_index_validate_scan(Relation table_rel, Relation index_rel, struct IndexInfo *index_info, Snapshot snapshot, struct ValidateIndexState *state)
Definition: tableam.h:1563
#define PROGRESS_CREATEIDX_TUPLES_DONE
Definition: progress.h:68
TransactionId relfrozenxid
Definition: pg_class.h:123
void list_free(List *list)
Definition: list.c:1377
#define elog(elevel,...)
Definition: elog.h:228
ambuildempty_function ambuildempty
Definition: amapi.h:211
MemoryContext rd_indexcxt
Definition: rel.h:155
#define ShareLock
Definition: lockdefs.h:41
int i
void LockRelation(Relation relation, LOCKMODE lockmode)
Definition: lmgr.c:216
RangeVar * relation
Definition: parsenodes.h:2408
Oid currentlyReindexedHeap
Definition: index.c:92
#define PROGRESS_CLUSTER_INDEX_REBUILD_COUNT
Definition: progress.h:45
#define NameStr(name)
Definition: c.h:616
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:162
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
#define CStringGetTextDatum(s)
Definition: builtins.h:83
char * nodeToString(const void *obj)
Definition: outfuncs.c:4322
#define REINDEX_REL_FORCE_INDEXES_PERMANENT
Definition: index.h:142
void CatalogCloseIndexes(CatalogIndexState indstate)
Definition: indexing.c:60
#define REINDEX_REL_PROCESS_TOAST
Definition: index.h:138
void BuildSpeculativeIndexInfo(Relation index, IndexInfo *ii)
Definition: index.c:2507
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:99
#define PROGRESS_CREATEIDX_SUBPHASE
Definition: progress.h:66
void CacheInvalidateRelcacheByTuple(HeapTuple classTuple)
Definition: inval.c:1306
void check_exclusion_constraint(Relation heap, Relation index, IndexInfo *indexInfo, ItemPointer tupleid, Datum *values, bool *isnull, EState *estate, bool newIndex)
Definition: execIndexing.c:866
Oid * rd_opcintype
Definition: rel.h:159
static Datum slot_getsysattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: tuptable.h:402
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:158
uint16 * ii_ExclusionStrats
Definition: execnodes.h:165
void CheckAttributeType(const char *attname, Oid atttypid, Oid attcollation, List *containing_rowtypes, int flags)
Definition: heap.c:578
void tuplesort_end(Tuplesortstate *state)
Definition: tuplesort.c:1236
#define PG_TRY()
Definition: elog.h:322
#define INDEX_CREATE_ADD_CONSTRAINT
Definition: index.h:48
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
void index_concurrently_set_dead(Oid heapId, Oid indexId)
Definition: index.c:1727
bool ReindexIsProcessingIndex(Oid indexOid)
Definition: index.c:3792
void index_concurrently_build(Oid heapRelationId, Oid indexRelationId)
Definition: index.c:1400
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
#define ERRCODE_DUPLICATE_OBJECT
Definition: streamutil.c:31
static bool validate_index_callback(ItemPointer itemptr, void *opaque)
Definition: index.c:3273
PgStat_Counter blocks_fetched
Definition: pgstat.h:650
bool reindex_relation(Oid relid, int flags, int options)
Definition: index.c:3638
Definition: pg_list.h:50
long changeDependenciesOn(Oid refClassId, Oid oldRefObjectId, Oid newRefObjectId)
Definition: pg_depend.c:463
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1730
#define PointerIsValid(pointer)
Definition: c.h:633
ItemPointerData tts_tid
Definition: tuptable.h:130
List * get_partition_ancestors(Oid relid)
Definition: partition.c:115
int16 AttrNumber
Definition: attnum.h:21
#define RelationGetRelid(relation)
Definition: rel.h:422
#define INDEX_CONSTR_CREATE_DEFERRABLE
Definition: index.h:76
long val
Definition: informix.c:664
#define PROGRESS_CREATEIDX_COMMAND
Definition: progress.h:62
void CatalogTupleInsert(Relation heapRel, HeapTuple tup)
Definition: indexing.c:183
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:126
float4 reltuples
Definition: pg_class.h:63
#define PG_END_TRY()
Definition: elog.h:347
#define BTEqualStrategyNumber
Definition: stratnum.h:31
#define offsetof(type, field)
Definition: c.h:662
PgStat_Counter t_blocks_fetched
Definition: pgstat.h:114
#define lfirst_oid(lc)
Definition: pg_list.h:192
double index_tuples
Definition: genam.h:33
#define INDEX_CONSTR_CREATE_MARK_AS_PRIMARY
Definition: index.h:75
double heap_tuples
Definition: genam.h:32
#define PROGRESS_CREATEIDX_ACCESS_METHOD_OID
Definition: progress.h:64
Oid relId
Definition: rel.h:37
bool estimated_count
Definition: genam.h:49
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:1788
#define DescriptionObjIndexId
Definition: indexing.h:154
Oid ii_Am
Definition: execnodes.h:174
#define RelationGetNamespace(relation)
Definition: rel.h:463