PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
indexcmds.c File Reference
#include "postgres.h"
#include "access/amapi.h"
#include "access/htup_details.h"
#include "access/reloptions.h"
#include "access/sysattr.h"
#include "access/xact.h"
#include "catalog/catalog.h"
#include "catalog/index.h"
#include "catalog/indexing.h"
#include "catalog/pg_am.h"
#include "catalog/pg_opclass.h"
#include "catalog/pg_opfamily.h"
#include "catalog/pg_tablespace.h"
#include "catalog/pg_type.h"
#include "commands/comment.h"
#include "commands/dbcommands.h"
#include "commands/defrem.h"
#include "commands/tablecmds.h"
#include "commands/tablespace.h"
#include "mb/pg_wchar.h"
#include "miscadmin.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/clauses.h"
#include "optimizer/planner.h"
#include "optimizer/var.h"
#include "parser/parse_coerce.h"
#include "parser/parse_func.h"
#include "parser/parse_oper.h"
#include "storage/lmgr.h"
#include "storage/proc.h"
#include "storage/procarray.h"
#include "utils/acl.h"
#include "utils/builtins.h"
#include "utils/fmgroids.h"
#include "utils/inval.h"
#include "utils/lsyscache.h"
#include "utils/memutils.h"
#include "utils/regproc.h"
#include "utils/snapmgr.h"
#include "utils/syscache.h"
#include "utils/tqual.h"
Include dependency graph for indexcmds.c:

Go to the source code of this file.

Functions

static void CheckPredicate (Expr *predicate)
 
static void ComputeIndexAttrs (IndexInfo *indexInfo, Oid *typeOidP, Oid *collationOidP, Oid *classOidP, int16 *colOptionP, List *attList, List *exclusionOpNames, Oid relId, char *accessMethodName, Oid accessMethodId, bool amcanorder, bool isconstraint)
 
static char * ChooseIndexName (const char *tabname, Oid namespaceId, List *colnames, List *exclusionOpNames, bool primary, bool isconstraint)
 
static char * ChooseIndexNameAddition (List *colnames)
 
static ListChooseIndexColumnNames (List *indexElems)
 
static void RangeVarCallbackForReindexIndex (const RangeVar *relation, Oid relId, Oid oldRelId, void *arg)
 
bool CheckIndexCompatible (Oid oldId, char *accessMethodName, List *attributeList, List *exclusionOpNames)
 
ObjectAddress DefineIndex (Oid relationId, IndexStmt *stmt, Oid indexRelationId, bool is_alter_table, bool check_rights, bool check_not_in_use, bool skip_build, bool quiet)
 
static bool CheckMutability (Expr *expr)
 
Oid ResolveOpClass (List *opclass, Oid attrType, char *accessMethodName, Oid accessMethodId)
 
Oid GetDefaultOpClass (Oid type_id, Oid am_id)
 
char * makeObjectName (const char *name1, const char *name2, const char *label)
 
char * ChooseRelationName (const char *name1, const char *name2, const char *label, Oid namespaceid)
 
Oid ReindexIndex (RangeVar *indexRelation, int options)
 
Oid ReindexTable (RangeVar *relation, int options)
 
void ReindexMultipleTables (const char *objectName, ReindexObjectType objectKind, int options)
 

Function Documentation

bool CheckIndexCompatible ( Oid  oldId,
char *  accessMethodName,
List attributeList,
List exclusionOpNames 
)

Definition at line 117 of file indexcmds.c.

References AccessShareLock, IndexAmRoutine::amcanorder, AMNAME, Anum_pg_index_indclass, Anum_pg_index_indcollation, Anum_pg_index_indexprs, Anum_pg_index_indpred, Assert, ComputeIndexAttrs(), CurrentMemoryContext, DatumGetPointer, elog, ereport, errcode(), errmsg(), ERROR, get_opclass_input_type(), GetIndexAmRoutine(), GETSTRUCT, heap_attisnull(), HeapTupleGetOid, HeapTupleIsValid, i, IndexInfo::ii_AmCache, IndexInfo::ii_Context, IndexInfo::ii_ExclusionOps, IndexInfo::ii_ExclusionProcs, IndexInfo::ii_ExclusionStrats, IndexInfo::ii_Expressions, IndexInfo::ii_ExpressionsState, IndexInfo::ii_PredicateState, index_close(), INDEX_MAX_KEYS, index_open(), IndexGetRelation(), IndexIsValid, INDEXRELID, IsPolymorphicType, list_length(), makeNode, NIL, NoLock, NULL, ObjectIdGetDatum, op_input_types(), palloc(), PointerGetDatum, RelationData::rd_att, RelationGetExclusionInfo(), ReleaseSysCache(), SearchSysCache1, SysCacheGetAttr(), TupleDescAttr, and oidvector::values.

Referenced by TryReuseIndex().

121 {
122  bool isconstraint;
123  Oid *typeObjectId;
124  Oid *collationObjectId;
125  Oid *classObjectId;
126  Oid accessMethodId;
127  Oid relationId;
128  HeapTuple tuple;
129  Form_pg_index indexForm;
130  Form_pg_am accessMethodForm;
131  IndexAmRoutine *amRoutine;
132  bool amcanorder;
133  int16 *coloptions;
134  IndexInfo *indexInfo;
135  int numberOfAttributes;
136  int old_natts;
137  bool isnull;
138  bool ret = true;
139  oidvector *old_indclass;
140  oidvector *old_indcollation;
141  Relation irel;
142  int i;
143  Datum d;
144 
145  /* Caller should already have the relation locked in some way. */
146  relationId = IndexGetRelation(oldId, false);
147 
148  /*
149  * We can pretend isconstraint = false unconditionally. It only serves to
150  * decide the text of an error message that should never happen for us.
151  */
152  isconstraint = false;
153 
154  numberOfAttributes = list_length(attributeList);
155  Assert(numberOfAttributes > 0);
156  Assert(numberOfAttributes <= INDEX_MAX_KEYS);
157 
158  /* look up the access method */
159  tuple = SearchSysCache1(AMNAME, PointerGetDatum(accessMethodName));
160  if (!HeapTupleIsValid(tuple))
161  ereport(ERROR,
162  (errcode(ERRCODE_UNDEFINED_OBJECT),
163  errmsg("access method \"%s\" does not exist",
164  accessMethodName)));
165  accessMethodId = HeapTupleGetOid(tuple);
166  accessMethodForm = (Form_pg_am) GETSTRUCT(tuple);
167  amRoutine = GetIndexAmRoutine(accessMethodForm->amhandler);
168  ReleaseSysCache(tuple);
169 
170  amcanorder = amRoutine->amcanorder;
171 
172  /*
173  * Compute the operator classes, collations, and exclusion operators for
174  * the new index, so we can test whether it's compatible with the existing
175  * one. Note that ComputeIndexAttrs might fail here, but that's OK:
176  * DefineIndex would have called this function with the same arguments
177  * later on, and it would have failed then anyway.
178  */
179  indexInfo = makeNode(IndexInfo);
180  indexInfo->ii_Expressions = NIL;
181  indexInfo->ii_ExpressionsState = NIL;
182  indexInfo->ii_PredicateState = NULL;
183  indexInfo->ii_ExclusionOps = NULL;
184  indexInfo->ii_ExclusionProcs = NULL;
185  indexInfo->ii_ExclusionStrats = NULL;
186  indexInfo->ii_AmCache = NULL;
187  indexInfo->ii_Context = CurrentMemoryContext;
188  typeObjectId = (Oid *) palloc(numberOfAttributes * sizeof(Oid));
189  collationObjectId = (Oid *) palloc(numberOfAttributes * sizeof(Oid));
190  classObjectId = (Oid *) palloc(numberOfAttributes * sizeof(Oid));
191  coloptions = (int16 *) palloc(numberOfAttributes * sizeof(int16));
192  ComputeIndexAttrs(indexInfo,
193  typeObjectId, collationObjectId, classObjectId,
194  coloptions, attributeList,
195  exclusionOpNames, relationId,
196  accessMethodName, accessMethodId,
197  amcanorder, isconstraint);
198 
199 
200  /* Get the soon-obsolete pg_index tuple. */
202  if (!HeapTupleIsValid(tuple))
203  elog(ERROR, "cache lookup failed for index %u", oldId);
204  indexForm = (Form_pg_index) GETSTRUCT(tuple);
205 
206  /*
207  * We don't assess expressions or predicates; assume incompatibility.
208  * Also, if the index is invalid for any reason, treat it as incompatible.
209  */
210  if (!(heap_attisnull(tuple, Anum_pg_index_indpred) &&
212  IndexIsValid(indexForm)))
213  {
214  ReleaseSysCache(tuple);
215  return false;
216  }
217 
218  /* Any change in operator class or collation breaks compatibility. */
219  old_natts = indexForm->indnatts;
220  Assert(old_natts == numberOfAttributes);
221 
223  Assert(!isnull);
224  old_indcollation = (oidvector *) DatumGetPointer(d);
225 
226  d = SysCacheGetAttr(INDEXRELID, tuple, Anum_pg_index_indclass, &isnull);
227  Assert(!isnull);
228  old_indclass = (oidvector *) DatumGetPointer(d);
229 
230  ret = (memcmp(old_indclass->values, classObjectId,
231  old_natts * sizeof(Oid)) == 0 &&
232  memcmp(old_indcollation->values, collationObjectId,
233  old_natts * sizeof(Oid)) == 0);
234 
235  ReleaseSysCache(tuple);
236 
237  if (!ret)
238  return false;
239 
240  /* For polymorphic opcintype, column type changes break compatibility. */
241  irel = index_open(oldId, AccessShareLock); /* caller probably has a lock */
242  for (i = 0; i < old_natts; i++)
243  {
244  if (IsPolymorphicType(get_opclass_input_type(classObjectId[i])) &&
245  TupleDescAttr(irel->rd_att, i)->atttypid != typeObjectId[i])
246  {
247  ret = false;
248  break;
249  }
250  }
251 
252  /* Any change in exclusion operator selections breaks compatibility. */
253  if (ret && indexInfo->ii_ExclusionOps != NULL)
254  {
255  Oid *old_operators,
256  *old_procs;
257  uint16 *old_strats;
258 
259  RelationGetExclusionInfo(irel, &old_operators, &old_procs, &old_strats);
260  ret = memcmp(old_operators, indexInfo->ii_ExclusionOps,
261  old_natts * sizeof(Oid)) == 0;
262 
263  /* Require an exact input type match for polymorphic operators. */
264  if (ret)
265  {
266  for (i = 0; i < old_natts && ret; i++)
267  {
268  Oid left,
269  right;
270 
271  op_input_types(indexInfo->ii_ExclusionOps[i], &left, &right);
272  if ((IsPolymorphicType(left) || IsPolymorphicType(right)) &&
273  TupleDescAttr(irel->rd_att, i)->atttypid != typeObjectId[i])
274  {
275  ret = false;
276  break;
277  }
278  }
279  }
280  }
281 
282  index_close(irel, NoLock);
283  return ret;
284 }
signed short int16
Definition: c.h:255
#define NIL
Definition: pg_list.h:69
Definition: c.h:478
MemoryContext ii_Context
Definition: execnodes.h:151
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3281
void RelationGetExclusionInfo(Relation indexRelation, Oid **operators, Oid **procs, uint16 **strategies)
Definition: relcache.c:5066
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
#define IndexIsValid(indexForm)
Definition: pg_index.h:107
#define PointerGetDatum(X)
Definition: postgres.h:562
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:84
ExprState * ii_PredicateState
Definition: execnodes.h:139
#define Anum_pg_index_indclass
Definition: pg_index.h:89
#define AccessShareLock
Definition: lockdefs.h:36
Oid * ii_ExclusionProcs
Definition: execnodes.h:141
int errcode(int sqlerrcode)
Definition: elog.c:575
unsigned int Oid
Definition: postgres_ext.h:31
#define SearchSysCache1(cacheId, key1)
Definition: syscache.h:156
List * ii_ExpressionsState
Definition: execnodes.h:137
unsigned short uint16
Definition: c.h:267
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
#define IsPolymorphicType(typid)
Definition: pg_type.h:745
static void ComputeIndexAttrs(IndexInfo *indexInfo, Oid *typeOidP, Oid *collationOidP, Oid *classOidP, int16 *colOptionP, List *attList, List *exclusionOpNames, Oid relId, char *accessMethodName, Oid accessMethodId, bool amcanorder, bool isconstraint)
Definition: indexcmds.c:1007
IndexAmRoutine * GetIndexAmRoutine(Oid amhandler)
Definition: amapi.c:33
#define NoLock
Definition: lockdefs.h:34
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:486
bool heap_attisnull(HeapTuple tup, int attnum)
Definition: heaptuple.c:296
void op_input_types(Oid opno, Oid *lefttype, Oid *righttype)
Definition: lsyscache.c:1167
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
#define ereport(elevel, rest)
Definition: elog.h:122
void * ii_AmCache
Definition: execnodes.h:150
FormData_pg_index * Form_pg_index
Definition: pg_index.h:67
uintptr_t Datum
Definition: postgres.h:372
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1117
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:1279
TupleDesc rd_att
Definition: rel.h:115
#define Anum_pg_index_indpred
Definition: pg_index.h:92
#define makeNode(_type_)
Definition: nodes.h:557
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
#define NULL
Definition: c.h:229
List * ii_Expressions
Definition: execnodes.h:136
#define Assert(condition)
Definition: c.h:676
#define INDEX_MAX_KEYS
static int list_length(const List *l)
Definition: pg_list.h:89
bool amcanorder
Definition: amapi.h:171
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
#define DatumGetPointer(X)
Definition: postgres.h:555
#define Anum_pg_index_indcollation
Definition: pg_index.h:88
Oid * ii_ExclusionOps
Definition: execnodes.h:140
FormData_pg_am * Form_pg_am
Definition: pg_am.h:46
void * palloc(Size size)
Definition: mcxt.c:849
int errmsg(const char *fmt,...)
Definition: elog.c:797
int i
#define elog
Definition: elog.h:219
#define HeapTupleGetOid(tuple)
Definition: htup_details.h:695
uint16 * ii_ExclusionStrats
Definition: execnodes.h:142
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:151
#define Anum_pg_index_indexprs
Definition: pg_index.h:91
Oid get_opclass_input_type(Oid opclass)
Definition: lsyscache.c:1069
static bool CheckMutability ( Expr expr)
static

Definition at line 951 of file indexcmds.c.

References contain_mutable_functions(), and expression_planner().

Referenced by CheckPredicate(), and ComputeIndexAttrs().

952 {
953  /*
954  * First run the expression through the planner. This has a couple of
955  * important consequences. First, function default arguments will get
956  * inserted, which may affect volatility (consider "default now()").
957  * Second, inline-able functions will get inlined, which may allow us to
958  * conclude that the function is really less volatile than it's marked. As
959  * an example, polymorphic functions must be marked with the most volatile
960  * behavior that they have for any input type, but once we inline the
961  * function we may be able to conclude that it's not so volatile for the
962  * particular input type we're dealing with.
963  *
964  * We assume here that expression_planner() won't scribble on its input.
965  */
966  expr = expression_planner(expr);
967 
968  /* Now we can search for non-immutable functions */
969  return contain_mutable_functions((Node *) expr);
970 }
Expr * expression_planner(Expr *expr)
Definition: planner.c:5939
Definition: nodes.h:509
bool contain_mutable_functions(Node *clause)
Definition: clauses.c:878
static void CheckPredicate ( Expr predicate)
static

Definition at line 985 of file indexcmds.c.

References CheckMutability(), ereport, errcode(), errmsg(), and ERROR.

Referenced by DefineIndex().

986 {
987  /*
988  * transformExpr() should have already rejected subqueries, aggregates,
989  * and window functions, based on the EXPR_KIND_ for a predicate.
990  */
991 
992  /*
993  * A predicate using mutable functions is probably wrong, for the same
994  * reasons that we don't allow an index expression to use one.
995  */
996  if (CheckMutability(predicate))
997  ereport(ERROR,
998  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
999  errmsg("functions in index predicate must be marked IMMUTABLE")));
1000 }
static bool CheckMutability(Expr *expr)
Definition: indexcmds.c:951
int errcode(int sqlerrcode)
Definition: elog.c:575
#define ERROR
Definition: elog.h:43
#define ereport(elevel, rest)
Definition: elog.h:122
int errmsg(const char *fmt,...)
Definition: elog.c:797
static List * ChooseIndexColumnNames ( List indexElems)
static

Definition at line 1692 of file indexcmds.c.

References buf, i, IndexElem::indexcolname, lappend(), lfirst, IndexElem::name, NAMEDATALEN, NIL, NULL, pg_mbcliplen(), pstrdup(), and result.

Referenced by DefineIndex().

1693 {
1694  List *result = NIL;
1695  ListCell *lc;
1696 
1697  foreach(lc, indexElems)
1698  {
1699  IndexElem *ielem = (IndexElem *) lfirst(lc);
1700  const char *origname;
1701  const char *curname;
1702  int i;
1703  char buf[NAMEDATALEN];
1704 
1705  /* Get the preliminary name from the IndexElem */
1706  if (ielem->indexcolname)
1707  origname = ielem->indexcolname; /* caller-specified name */
1708  else if (ielem->name)
1709  origname = ielem->name; /* simple column reference */
1710  else
1711  origname = "expr"; /* default name for expression */
1712 
1713  /* If it conflicts with any previous column, tweak it */
1714  curname = origname;
1715  for (i = 1;; i++)
1716  {
1717  ListCell *lc2;
1718  char nbuf[32];
1719  int nlen;
1720 
1721  foreach(lc2, result)
1722  {
1723  if (strcmp(curname, (char *) lfirst(lc2)) == 0)
1724  break;
1725  }
1726  if (lc2 == NULL)
1727  break; /* found nonconflicting name */
1728 
1729  sprintf(nbuf, "%d", i);
1730 
1731  /* Ensure generated names are shorter than NAMEDATALEN */
1732  nlen = pg_mbcliplen(origname, strlen(origname),
1733  NAMEDATALEN - 1 - strlen(nbuf));
1734  memcpy(buf, origname, nlen);
1735  strcpy(buf + nlen, nbuf);
1736  curname = buf;
1737  }
1738 
1739  /* And attach to the result list */
1740  result = lappend(result, pstrdup(curname));
1741  }
1742  return result;
1743 }
#define NIL
Definition: pg_list.h:69
char * pstrdup(const char *in)
Definition: mcxt.c:1077
return result
Definition: formatting.c:1633
#define NAMEDATALEN
int pg_mbcliplen(const char *mbstr, int len, int limit)
Definition: mbutils.c:831
static char * buf
Definition: pg_test_fsync.c:66
char * indexcolname
Definition: parsenodes.h:690
List * lappend(List *list, void *datum)
Definition: list.c:128
#define NULL
Definition: c.h:229
#define lfirst(lc)
Definition: pg_list.h:106
char * name
Definition: parsenodes.h:688
int i
Definition: pg_list.h:45
static char * ChooseIndexName ( const char *  tabname,
Oid  namespaceId,
List colnames,
List exclusionOpNames,
bool  primary,
bool  isconstraint 
)
static

Definition at line 1610 of file indexcmds.c.

References ChooseIndexNameAddition(), ChooseRelationName(), NIL, and NULL.

Referenced by DefineIndex().

1613 {
1614  char *indexname;
1615 
1616  if (primary)
1617  {
1618  /* the primary key's name does not depend on the specific column(s) */
1619  indexname = ChooseRelationName(tabname,
1620  NULL,
1621  "pkey",
1622  namespaceId);
1623  }
1624  else if (exclusionOpNames != NIL)
1625  {
1626  indexname = ChooseRelationName(tabname,
1627  ChooseIndexNameAddition(colnames),
1628  "excl",
1629  namespaceId);
1630  }
1631  else if (isconstraint)
1632  {
1633  indexname = ChooseRelationName(tabname,
1634  ChooseIndexNameAddition(colnames),
1635  "key",
1636  namespaceId);
1637  }
1638  else
1639  {
1640  indexname = ChooseRelationName(tabname,
1641  ChooseIndexNameAddition(colnames),
1642  "idx",
1643  namespaceId);
1644  }
1645 
1646  return indexname;
1647 }
#define NIL
Definition: pg_list.h:69
static char * ChooseIndexNameAddition(List *colnames)
Definition: indexcmds.c:1658
#define NULL
Definition: c.h:229
char * ChooseRelationName(const char *name1, const char *name2, const char *label, Oid namespaceid)
Definition: indexcmds.c:1579
static char * ChooseIndexNameAddition ( List colnames)
static

Definition at line 1658 of file indexcmds.c.

References buf, lfirst, name, NAMEDATALEN, pstrdup(), and strlcpy().

Referenced by ChooseIndexName().

1659 {
1660  char buf[NAMEDATALEN * 2];
1661  int buflen = 0;
1662  ListCell *lc;
1663 
1664  buf[0] = '\0';
1665  foreach(lc, colnames)
1666  {
1667  const char *name = (const char *) lfirst(lc);
1668 
1669  if (buflen > 0)
1670  buf[buflen++] = '_'; /* insert _ between names */
1671 
1672  /*
1673  * At this point we have buflen <= NAMEDATALEN. name should be less
1674  * than NAMEDATALEN already, but use strlcpy for paranoia.
1675  */
1676  strlcpy(buf + buflen, name, NAMEDATALEN);
1677  buflen += strlen(buf + buflen);
1678  if (buflen >= NAMEDATALEN)
1679  break;
1680  }
1681  return pstrdup(buf);
1682 }
char * pstrdup(const char *in)
Definition: mcxt.c:1077
#define NAMEDATALEN
static char * buf
Definition: pg_test_fsync.c:66
size_t strlcpy(char *dst, const char *src, size_t siz)
Definition: strlcpy.c:45
#define lfirst(lc)
Definition: pg_list.h:106
const char * name
Definition: encode.c:521
char* ChooseRelationName ( const char *  name1,
const char *  name2,
const char *  label,
Oid  namespaceid 
)

Definition at line 1579 of file indexcmds.c.

References get_relname_relid(), makeObjectName(), NAMEDATALEN, NULL, OidIsValid, pfree(), snprintf(), and StrNCpy.

Referenced by ChooseIndexName(), and generateSerialExtraStmts().

1581 {
1582  int pass = 0;
1583  char *relname = NULL;
1584  char modlabel[NAMEDATALEN];
1585 
1586  /* try the unmodified label first */
1587  StrNCpy(modlabel, label, sizeof(modlabel));
1588 
1589  for (;;)
1590  {
1591  relname = makeObjectName(name1, name2, modlabel);
1592 
1593  if (!OidIsValid(get_relname_relid(relname, namespaceid)))
1594  break;
1595 
1596  /* found a conflict, so try a new name component */
1597  pfree(relname);
1598  snprintf(modlabel, sizeof(modlabel), "%s%d", label, ++pass);
1599  }
1600 
1601  return relname;
1602 }
int snprintf(char *str, size_t count, const char *fmt,...) pg_attribute_printf(3
#define OidIsValid(objectId)
Definition: c.h:538
char * makeObjectName(const char *name1, const char *name2, const char *label)
Definition: indexcmds.c:1499
#define NAMEDATALEN
void pfree(void *pointer)
Definition: mcxt.c:950
Oid get_relname_relid(const char *relname, Oid relnamespace)
Definition: lsyscache.c:1683
static char * label
Definition: pg_basebackup.c:81
#define NULL
Definition: c.h:229
#define StrNCpy(dst, src, len)
Definition: c.h:831
static void ComputeIndexAttrs ( IndexInfo indexInfo,
Oid typeOidP,
Oid collationOidP,
Oid classOidP,
int16 colOptionP,
List attList,
List exclusionOpNames,
Oid  relId,
char *  accessMethodName,
Oid  accessMethodId,
bool  amcanorder,
bool  isconstraint 
)
static

Definition at line 1007 of file indexcmds.c.

References arg, Assert, CheckMutability(), IndexElem::collation, compatible_oper_opid(), elog, ereport, errcode(), errdetail(), errhint(), errmsg(), ERROR, IndexElem::expr, exprCollation(), exprType(), format_operator(), format_type_be(), get_collation_oid(), get_commutator(), get_op_opfamily_strategy(), get_opclass_family(), get_opcode(), GETSTRUCT, HeapTupleIsValid, IndexInfo::ii_ExclusionOps, IndexInfo::ii_ExclusionProcs, IndexInfo::ii_ExclusionStrats, IndexInfo::ii_Expressions, IndexInfo::ii_KeyAttrNumbers, INDOPTION_DESC, INDOPTION_NULLS_FIRST, InvalidAttrNumber, IsA, lappend(), lfirst, list_head(), list_length(), lnext, IndexElem::name, NameStr, NULL, IndexElem::nulls_ordering, ObjectIdGetDatum, OidIsValid, IndexElem::opclass, OPFAMILYOID, IndexElem::ordering, palloc(), ReleaseSysCache(), ResolveOpClass(), SearchSysCache1, SearchSysCacheAttName(), SORTBY_DEFAULT, SORTBY_DESC, SORTBY_NULLS_DEFAULT, SORTBY_NULLS_FIRST, and type_is_collatable().

Referenced by CheckIndexCompatible(), and DefineIndex().

1019 {
1020  ListCell *nextExclOp;
1021  ListCell *lc;
1022  int attn;
1023 
1024  /* Allocate space for exclusion operator info, if needed */
1025  if (exclusionOpNames)
1026  {
1027  int ncols = list_length(attList);
1028 
1029  Assert(list_length(exclusionOpNames) == ncols);
1030  indexInfo->ii_ExclusionOps = (Oid *) palloc(sizeof(Oid) * ncols);
1031  indexInfo->ii_ExclusionProcs = (Oid *) palloc(sizeof(Oid) * ncols);
1032  indexInfo->ii_ExclusionStrats = (uint16 *) palloc(sizeof(uint16) * ncols);
1033  nextExclOp = list_head(exclusionOpNames);
1034  }
1035  else
1036  nextExclOp = NULL;
1037 
1038  /*
1039  * process attributeList
1040  */
1041  attn = 0;
1042  foreach(lc, attList)
1043  {
1044  IndexElem *attribute = (IndexElem *) lfirst(lc);
1045  Oid atttype;
1046  Oid attcollation;
1047 
1048  /*
1049  * Process the column-or-expression to be indexed.
1050  */
1051  if (attribute->name != NULL)
1052  {
1053  /* Simple index attribute */
1054  HeapTuple atttuple;
1055  Form_pg_attribute attform;
1056 
1057  Assert(attribute->expr == NULL);
1058  atttuple = SearchSysCacheAttName(relId, attribute->name);
1059  if (!HeapTupleIsValid(atttuple))
1060  {
1061  /* difference in error message spellings is historical */
1062  if (isconstraint)
1063  ereport(ERROR,
1064  (errcode(ERRCODE_UNDEFINED_COLUMN),
1065  errmsg("column \"%s\" named in key does not exist",
1066  attribute->name)));
1067  else
1068  ereport(ERROR,
1069  (errcode(ERRCODE_UNDEFINED_COLUMN),
1070  errmsg("column \"%s\" does not exist",
1071  attribute->name)));
1072  }
1073  attform = (Form_pg_attribute) GETSTRUCT(atttuple);
1074  indexInfo->ii_KeyAttrNumbers[attn] = attform->attnum;
1075  atttype = attform->atttypid;
1076  attcollation = attform->attcollation;
1077  ReleaseSysCache(atttuple);
1078  }
1079  else
1080  {
1081  /* Index expression */
1082  Node *expr = attribute->expr;
1083 
1084  Assert(expr != NULL);
1085  atttype = exprType(expr);
1086  attcollation = exprCollation(expr);
1087 
1088  /*
1089  * Strip any top-level COLLATE clause. This ensures that we treat
1090  * "x COLLATE y" and "(x COLLATE y)" alike.
1091  */
1092  while (IsA(expr, CollateExpr))
1093  expr = (Node *) ((CollateExpr *) expr)->arg;
1094 
1095  if (IsA(expr, Var) &&
1096  ((Var *) expr)->varattno != InvalidAttrNumber)
1097  {
1098  /*
1099  * User wrote "(column)" or "(column COLLATE something)".
1100  * Treat it like simple attribute anyway.
1101  */
1102  indexInfo->ii_KeyAttrNumbers[attn] = ((Var *) expr)->varattno;
1103  }
1104  else
1105  {
1106  indexInfo->ii_KeyAttrNumbers[attn] = 0; /* marks expression */
1107  indexInfo->ii_Expressions = lappend(indexInfo->ii_Expressions,
1108  expr);
1109 
1110  /*
1111  * transformExpr() should have already rejected subqueries,
1112  * aggregates, and window functions, based on the EXPR_KIND_
1113  * for an index expression.
1114  */
1115 
1116  /*
1117  * An expression using mutable functions is probably wrong,
1118  * since if you aren't going to get the same result for the
1119  * same data every time, it's not clear what the index entries
1120  * mean at all.
1121  */
1122  if (CheckMutability((Expr *) expr))
1123  ereport(ERROR,
1124  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1125  errmsg("functions in index expression must be marked IMMUTABLE")));
1126  }
1127  }
1128 
1129  typeOidP[attn] = atttype;
1130 
1131  /*
1132  * Apply collation override if any
1133  */
1134  if (attribute->collation)
1135  attcollation = get_collation_oid(attribute->collation, false);
1136 
1137  /*
1138  * Check we have a collation iff it's a collatable type. The only
1139  * expected failures here are (1) COLLATE applied to a noncollatable
1140  * type, or (2) index expression had an unresolved collation. But we
1141  * might as well code this to be a complete consistency check.
1142  */
1143  if (type_is_collatable(atttype))
1144  {
1145  if (!OidIsValid(attcollation))
1146  ereport(ERROR,
1147  (errcode(ERRCODE_INDETERMINATE_COLLATION),
1148  errmsg("could not determine which collation to use for index expression"),
1149  errhint("Use the COLLATE clause to set the collation explicitly.")));
1150  }
1151  else
1152  {
1153  if (OidIsValid(attcollation))
1154  ereport(ERROR,
1155  (errcode(ERRCODE_DATATYPE_MISMATCH),
1156  errmsg("collations are not supported by type %s",
1157  format_type_be(atttype))));
1158  }
1159 
1160  collationOidP[attn] = attcollation;
1161 
1162  /*
1163  * Identify the opclass to use.
1164  */
1165  classOidP[attn] = ResolveOpClass(attribute->opclass,
1166  atttype,
1167  accessMethodName,
1168  accessMethodId);
1169 
1170  /*
1171  * Identify the exclusion operator, if any.
1172  */
1173  if (nextExclOp)
1174  {
1175  List *opname = (List *) lfirst(nextExclOp);
1176  Oid opid;
1177  Oid opfamily;
1178  int strat;
1179 
1180  /*
1181  * Find the operator --- it must accept the column datatype
1182  * without runtime coercion (but binary compatibility is OK)
1183  */
1184  opid = compatible_oper_opid(opname, atttype, atttype, false);
1185 
1186  /*
1187  * Only allow commutative operators to be used in exclusion
1188  * constraints. If X conflicts with Y, but Y does not conflict
1189  * with X, bad things will happen.
1190  */
1191  if (get_commutator(opid) != opid)
1192  ereport(ERROR,
1193  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1194  errmsg("operator %s is not commutative",
1195  format_operator(opid)),
1196  errdetail("Only commutative operators can be used in exclusion constraints.")));
1197 
1198  /*
1199  * Operator must be a member of the right opfamily, too
1200  */
1201  opfamily = get_opclass_family(classOidP[attn]);
1202  strat = get_op_opfamily_strategy(opid, opfamily);
1203  if (strat == 0)
1204  {
1205  HeapTuple opftuple;
1206  Form_pg_opfamily opfform;
1207 
1208  /*
1209  * attribute->opclass might not explicitly name the opfamily,
1210  * so fetch the name of the selected opfamily for use in the
1211  * error message.
1212  */
1213  opftuple = SearchSysCache1(OPFAMILYOID,
1214  ObjectIdGetDatum(opfamily));
1215  if (!HeapTupleIsValid(opftuple))
1216  elog(ERROR, "cache lookup failed for opfamily %u",
1217  opfamily);
1218  opfform = (Form_pg_opfamily) GETSTRUCT(opftuple);
1219 
1220  ereport(ERROR,
1221  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1222  errmsg("operator %s is not a member of operator family \"%s\"",
1223  format_operator(opid),
1224  NameStr(opfform->opfname)),
1225  errdetail("The exclusion operator must be related to the index operator class for the constraint.")));
1226  }
1227 
1228  indexInfo->ii_ExclusionOps[attn] = opid;
1229  indexInfo->ii_ExclusionProcs[attn] = get_opcode(opid);
1230  indexInfo->ii_ExclusionStrats[attn] = strat;
1231  nextExclOp = lnext(nextExclOp);
1232  }
1233 
1234  /*
1235  * Set up the per-column options (indoption field). For now, this is
1236  * zero for any un-ordered index, while ordered indexes have DESC and
1237  * NULLS FIRST/LAST options.
1238  */
1239  colOptionP[attn] = 0;
1240  if (amcanorder)
1241  {
1242  /* default ordering is ASC */
1243  if (attribute->ordering == SORTBY_DESC)
1244  colOptionP[attn] |= INDOPTION_DESC;
1245  /* default null ordering is LAST for ASC, FIRST for DESC */
1246  if (attribute->nulls_ordering == SORTBY_NULLS_DEFAULT)
1247  {
1248  if (attribute->ordering == SORTBY_DESC)
1249  colOptionP[attn] |= INDOPTION_NULLS_FIRST;
1250  }
1251  else if (attribute->nulls_ordering == SORTBY_NULLS_FIRST)
1252  colOptionP[attn] |= INDOPTION_NULLS_FIRST;
1253  }
1254  else
1255  {
1256  /* index AM does not support ordering */
1257  if (attribute->ordering != SORTBY_DEFAULT)
1258  ereport(ERROR,
1259  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1260  errmsg("access method \"%s\" does not support ASC/DESC options",
1261  accessMethodName)));
1262  if (attribute->nulls_ordering != SORTBY_NULLS_DEFAULT)
1263  ereport(ERROR,
1264  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1265  errmsg("access method \"%s\" does not support NULLS FIRST/LAST options",
1266  accessMethodName)));
1267  }
1268 
1269  attn++;
1270  }
1271 }
#define INDOPTION_NULLS_FIRST
Definition: pg_index.h:100
#define IsA(nodeptr, _type_)
Definition: nodes.h:560
static bool CheckMutability(Expr *expr)
Definition: indexcmds.c:951
Oid get_commutator(Oid opno)
Definition: lsyscache.c:1313
int errhint(const char *fmt,...)
Definition: elog.c:987
SortByDir ordering
Definition: parsenodes.h:693
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
Definition: nodes.h:509
Oid * ii_ExclusionProcs
Definition: execnodes.h:141
int errcode(int sqlerrcode)
Definition: elog.c:575
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
char * format_operator(Oid operator_oid)
Definition: regproc.c:820
Oid ResolveOpClass(List *opclass, Oid attrType, char *accessMethodName, Oid accessMethodId)
Definition: indexcmds.c:1280
unsigned int Oid
Definition: postgres_ext.h:31
Definition: primnodes.h:163
#define OidIsValid(objectId)
Definition: c.h:538
#define SearchSysCache1(cacheId, key1)
Definition: syscache.h:156
Node * expr
Definition: parsenodes.h:689
unsigned short uint16
Definition: c.h:267
SortByNulls nulls_ordering
Definition: parsenodes.h:694
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
int errdetail(const char *fmt,...)
Definition: elog.c:873
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
#define lnext(lc)
Definition: pg_list.h:105
#define ereport(elevel, rest)
Definition: elog.h:122
List * lappend(List *list, void *datum)
Definition: list.c:128
FormData_pg_opfamily * Form_pg_opfamily
Definition: pg_opfamily.h:44
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1117
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1094
List * opclass
Definition: parsenodes.h:692
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
#define NULL
Definition: c.h:229
List * ii_Expressions
Definition: execnodes.h:136
#define Assert(condition)
Definition: c.h:676
#define lfirst(lc)
Definition: pg_list.h:106
#define INDOPTION_DESC
Definition: pg_index.h:99
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
static int list_length(const List *l)
Definition: pg_list.h:89
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:720
AttrNumber ii_KeyAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:135
char * name
Definition: parsenodes.h:688
HeapTuple SearchSysCacheAttName(Oid relid, const char *attname)
Definition: syscache.c:1205
Oid get_opclass_family(Oid opclass)
Definition: lsyscache.c:1047
#define InvalidAttrNumber
Definition: attnum.h:23
int get_op_opfamily_strategy(Oid opno, Oid opfamily)
Definition: lsyscache.c:80
Oid * ii_ExclusionOps
Definition: execnodes.h:140
void * palloc(Size size)
Definition: mcxt.c:849
int errmsg(const char *fmt,...)
Definition: elog.c:797
Oid compatible_oper_opid(List *op, Oid arg1, Oid arg2, bool noError)
Definition: parse_oper.c:494
#define NameStr(name)
Definition: c.h:499
void * arg
List * collation
Definition: parsenodes.h:691
#define elog
Definition: elog.h:219
uint16 * ii_ExclusionStrats
Definition: execnodes.h:142
bool type_is_collatable(Oid typid)
Definition: lsyscache.c:2806
Definition: pg_list.h:45
Oid get_collation_oid(List *name, bool missing_ok)
Definition: namespace.c:3493
ObjectAddress DefineIndex ( Oid  relationId,
IndexStmt stmt,
Oid  indexRelationId,
bool  is_alter_table,
bool  check_rights,
bool  check_not_in_use,
bool  skip_build,
bool  quiet 
)

Definition at line 308 of file indexcmds.c.

References IndexStmt::accessMethod, ACL_CREATE, ACL_KIND_NAMESPACE, ACL_KIND_TABLESPACE, aclcheck_error(), ACLCHECK_OK, allowSystemTableMods, IndexAmRoutine::amcanmulticol, IndexAmRoutine::amcanorder, IndexAmRoutine::amcanunique, IndexAmRoutine::amgettuple, AMNAME, IndexAmRoutine::amoptions, Assert, bms_is_member(), BuildIndexInfo(), CacheInvalidateRelcacheByRelid(), CheckPredicate(), CheckTableNotInUse(), ChooseIndexColumnNames(), ChooseIndexName(), CommitTransactionCommand(), ComputeIndexAttrs(), IndexStmt::concurrent, CreateComments(), CurrentMemoryContext, LockRelId::dbId, DEBUG1, IndexStmt::deferrable, elog, ereport, errcode(), errmsg(), ERROR, IndexStmt::excludeOpNames, FirstLowInvalidHeapAttributeNumber, get_namespace_name(), get_tablespace_name(), get_tablespace_oid(), GetCurrentVirtualXIDs(), GetDefaultTablespace(), GetIndexAmRoutine(), GETSTRUCT, GetTransactionSnapshot(), GetUserId(), GLOBALTABLESPACE_OID, heap_close, heap_open(), heap_openrv(), HeapTupleGetOid, HeapTupleIsValid, i, IndexStmt::idxcomment, IndexStmt::idxname, IndexStmt::if_not_exists, IndexInfo::ii_AmCache, IndexInfo::ii_BrokenHotChain, IndexInfo::ii_Concurrent, IndexInfo::ii_Context, IndexInfo::ii_ExclusionOps, IndexInfo::ii_ExclusionProcs, IndexInfo::ii_ExclusionStrats, IndexInfo::ii_Expressions, IndexInfo::ii_ExpressionsState, IndexInfo::ii_KeyAttrNumbers, IndexInfo::ii_NumIndexAttrs, IndexInfo::ii_Predicate, IndexInfo::ii_PredicateState, IndexInfo::ii_ReadyForInserts, IndexInfo::ii_Unique, index_build(), index_check_primary_key(), index_close(), index_create(), INDEX_CREATE_SET_READY, INDEX_CREATE_SET_VALID, INDEX_MAX_KEYS, index_open(), index_reloptions(), index_set_state_flags(), IndexStmt::indexParams, IndexStmt::initdeferred, IsBootstrapProcessingMode, IndexStmt::isconstraint, list_length(), LockRelationIdForSession(), LockInfoData::lockRelId, make_ands_implicit(), makeNode, MyDatabaseTableSpace, NIL, NoLock, NOTICE, NULL, ObjectAddressSet, ObjectIdAttributeNumber, OidIsValid, IndexStmt::oldNode, IndexStmt::options, palloc(), pfree(), pg_namespace_aclcheck(), pg_tablespace_aclcheck(), PointerGetDatum, PopActiveSnapshot(), IndexStmt::primary, PROC_IN_VACUUM, PROC_IS_AUTOVACUUM, pull_varattnos(), PushActiveSnapshot(), RelationData::rd_lockInfo, RelationData::rd_rel, RegisterSnapshot(), IndexStmt::relation, RELATION_IS_OTHER_TEMP, RelationGetNamespace, RelationGetRelationName, RelationGetRelid, RelationRelationId, ReleaseSysCache(), LockRelId::relId, RELKIND_FOREIGN_TABLE, RELKIND_MATVIEW, RELKIND_PARTITIONED_TABLE, RELKIND_RELATION, RowExclusiveLock, SearchSysCache1, SET_LOCKTAG_RELATION, SetInvalidVirtualTransactionId, ShareLock, ShareUpdateExclusiveLock, StartTransactionCommand(), IndexStmt::tableSpace, transformRelOptions(), IndexStmt::unique, UnlockRelationIdForSession(), UnregisterSnapshot(), validate_index(), VirtualTransactionIdEquals, VirtualTransactionIdIsValid, VirtualXactLock(), WaitForLockers(), IndexStmt::whereClause, and SnapshotData::xmin.

Referenced by ATExecAddIndex(), and ProcessUtilitySlow().

316 {
317  char *indexRelationName;
318  char *accessMethodName;
319  Oid *typeObjectId;
320  Oid *collationObjectId;
321  Oid *classObjectId;
322  Oid accessMethodId;
323  Oid namespaceId;
324  Oid tablespaceId;
325  List *indexColNames;
326  Relation rel;
327  Relation indexRelation;
328  HeapTuple tuple;
329  Form_pg_am accessMethodForm;
330  IndexAmRoutine *amRoutine;
331  bool amcanorder;
332  amoptions_function amoptions;
333  Datum reloptions;
334  int16 *coloptions;
335  IndexInfo *indexInfo;
336  int numberOfAttributes;
337  TransactionId limitXmin;
338  VirtualTransactionId *old_snapshots;
339  ObjectAddress address;
340  int n_old_snapshots;
341  LockRelId heaprelid;
342  LOCKTAG heaplocktag;
343  LOCKMODE lockmode;
344  Snapshot snapshot;
345  int i;
346 
347  /*
348  * count attributes in index
349  */
350  numberOfAttributes = list_length(stmt->indexParams);
351  if (numberOfAttributes <= 0)
352  ereport(ERROR,
353  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
354  errmsg("must specify at least one column")));
355  if (numberOfAttributes > INDEX_MAX_KEYS)
356  ereport(ERROR,
357  (errcode(ERRCODE_TOO_MANY_COLUMNS),
358  errmsg("cannot use more than %d columns in an index",
359  INDEX_MAX_KEYS)));
360 
361  /*
362  * Only SELECT ... FOR UPDATE/SHARE are allowed while doing a standard
363  * index build; but for concurrent builds we allow INSERT/UPDATE/DELETE
364  * (but not VACUUM).
365  *
366  * NB: Caller is responsible for making sure that relationId refers to the
367  * relation on which the index should be built; except in bootstrap mode,
368  * this will typically require the caller to have already locked the
369  * relation. To avoid lock upgrade hazards, that lock should be at least
370  * as strong as the one we take here.
371  */
372  lockmode = stmt->concurrent ? ShareUpdateExclusiveLock : ShareLock;
373  rel = heap_open(relationId, lockmode);
374 
375  relationId = RelationGetRelid(rel);
376  namespaceId = RelationGetNamespace(rel);
377 
378  if (rel->rd_rel->relkind != RELKIND_RELATION &&
379  rel->rd_rel->relkind != RELKIND_MATVIEW)
380  {
381  if (rel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
382 
383  /*
384  * Custom error message for FOREIGN TABLE since the term is close
385  * to a regular table and can confuse the user.
386  */
387  ereport(ERROR,
388  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
389  errmsg("cannot create index on foreign table \"%s\"",
390  RelationGetRelationName(rel))));
391  else if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
392  ereport(ERROR,
393  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
394  errmsg("cannot create index on partitioned table \"%s\"",
395  RelationGetRelationName(rel))));
396  else
397  ereport(ERROR,
398  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
399  errmsg("\"%s\" is not a table or materialized view",
400  RelationGetRelationName(rel))));
401  }
402 
403  /*
404  * Don't try to CREATE INDEX on temp tables of other backends.
405  */
406  if (RELATION_IS_OTHER_TEMP(rel))
407  ereport(ERROR,
408  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
409  errmsg("cannot create indexes on temporary tables of other sessions")));
410 
411  /*
412  * Unless our caller vouches for having checked this already, insist that
413  * the table not be in use by our own session, either. Otherwise we might
414  * fail to make entries in the new index (for instance, if an INSERT or
415  * UPDATE is in progress and has already made its list of target indexes).
416  */
417  if (check_not_in_use)
418  CheckTableNotInUse(rel, "CREATE INDEX");
419 
420  /*
421  * Verify we (still) have CREATE rights in the rel's namespace.
422  * (Presumably we did when the rel was created, but maybe not anymore.)
423  * Skip check if caller doesn't want it. Also skip check if
424  * bootstrapping, since permissions machinery may not be working yet.
425  */
426  if (check_rights && !IsBootstrapProcessingMode())
427  {
428  AclResult aclresult;
429 
430  aclresult = pg_namespace_aclcheck(namespaceId, GetUserId(),
431  ACL_CREATE);
432  if (aclresult != ACLCHECK_OK)
434  get_namespace_name(namespaceId));
435  }
436 
437  /*
438  * Select tablespace to use. If not specified, use default tablespace
439  * (which may in turn default to database's default).
440  */
441  if (stmt->tableSpace)
442  {
443  tablespaceId = get_tablespace_oid(stmt->tableSpace, false);
444  }
445  else
446  {
447  tablespaceId = GetDefaultTablespace(rel->rd_rel->relpersistence);
448  /* note InvalidOid is OK in this case */
449  }
450 
451  /* Check tablespace permissions */
452  if (check_rights &&
453  OidIsValid(tablespaceId) && tablespaceId != MyDatabaseTableSpace)
454  {
455  AclResult aclresult;
456 
457  aclresult = pg_tablespace_aclcheck(tablespaceId, GetUserId(),
458  ACL_CREATE);
459  if (aclresult != ACLCHECK_OK)
461  get_tablespace_name(tablespaceId));
462  }
463 
464  /*
465  * Force shared indexes into the pg_global tablespace. This is a bit of a
466  * hack but seems simpler than marking them in the BKI commands. On the
467  * other hand, if it's not shared, don't allow it to be placed there.
468  */
469  if (rel->rd_rel->relisshared)
470  tablespaceId = GLOBALTABLESPACE_OID;
471  else if (tablespaceId == GLOBALTABLESPACE_OID)
472  ereport(ERROR,
473  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
474  errmsg("only shared relations can be placed in pg_global tablespace")));
475 
476  /*
477  * Choose the index column names.
478  */
479  indexColNames = ChooseIndexColumnNames(stmt->indexParams);
480 
481  /*
482  * Select name for index if caller didn't specify
483  */
484  indexRelationName = stmt->idxname;
485  if (indexRelationName == NULL)
486  indexRelationName = ChooseIndexName(RelationGetRelationName(rel),
487  namespaceId,
488  indexColNames,
489  stmt->excludeOpNames,
490  stmt->primary,
491  stmt->isconstraint);
492 
493  /*
494  * look up the access method, verify it can handle the requested features
495  */
496  accessMethodName = stmt->accessMethod;
497  tuple = SearchSysCache1(AMNAME, PointerGetDatum(accessMethodName));
498  if (!HeapTupleIsValid(tuple))
499  {
500  /*
501  * Hack to provide more-or-less-transparent updating of old RTREE
502  * indexes to GiST: if RTREE is requested and not found, use GIST.
503  */
504  if (strcmp(accessMethodName, "rtree") == 0)
505  {
506  ereport(NOTICE,
507  (errmsg("substituting access method \"gist\" for obsolete method \"rtree\"")));
508  accessMethodName = "gist";
509  tuple = SearchSysCache1(AMNAME, PointerGetDatum(accessMethodName));
510  }
511 
512  if (!HeapTupleIsValid(tuple))
513  ereport(ERROR,
514  (errcode(ERRCODE_UNDEFINED_OBJECT),
515  errmsg("access method \"%s\" does not exist",
516  accessMethodName)));
517  }
518  accessMethodId = HeapTupleGetOid(tuple);
519  accessMethodForm = (Form_pg_am) GETSTRUCT(tuple);
520  amRoutine = GetIndexAmRoutine(accessMethodForm->amhandler);
521 
522  if (stmt->unique && !amRoutine->amcanunique)
523  ereport(ERROR,
524  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
525  errmsg("access method \"%s\" does not support unique indexes",
526  accessMethodName)));
527  if (numberOfAttributes > 1 && !amRoutine->amcanmulticol)
528  ereport(ERROR,
529  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
530  errmsg("access method \"%s\" does not support multicolumn indexes",
531  accessMethodName)));
532  if (stmt->excludeOpNames && amRoutine->amgettuple == NULL)
533  ereport(ERROR,
534  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
535  errmsg("access method \"%s\" does not support exclusion constraints",
536  accessMethodName)));
537 
538  amcanorder = amRoutine->amcanorder;
539  amoptions = amRoutine->amoptions;
540 
541  pfree(amRoutine);
542  ReleaseSysCache(tuple);
543 
544  /*
545  * Validate predicate, if given
546  */
547  if (stmt->whereClause)
548  CheckPredicate((Expr *) stmt->whereClause);
549 
550  /*
551  * Parse AM-specific options, convert to text array form, validate.
552  */
553  reloptions = transformRelOptions((Datum) 0, stmt->options,
554  NULL, NULL, false, false);
555 
556  (void) index_reloptions(amoptions, reloptions, true);
557 
558  /*
559  * Prepare arguments for index_create, primarily an IndexInfo structure.
560  * Note that ii_Predicate must be in implicit-AND format.
561  */
562  indexInfo = makeNode(IndexInfo);
563  indexInfo->ii_NumIndexAttrs = numberOfAttributes;
564  indexInfo->ii_Expressions = NIL; /* for now */
565  indexInfo->ii_ExpressionsState = NIL;
566  indexInfo->ii_Predicate = make_ands_implicit((Expr *) stmt->whereClause);
567  indexInfo->ii_PredicateState = NULL;
568  indexInfo->ii_ExclusionOps = NULL;
569  indexInfo->ii_ExclusionProcs = NULL;
570  indexInfo->ii_ExclusionStrats = NULL;
571  indexInfo->ii_Unique = stmt->unique;
572  /* In a concurrent build, mark it not-ready-for-inserts */
573  indexInfo->ii_ReadyForInserts = !stmt->concurrent;
574  indexInfo->ii_Concurrent = stmt->concurrent;
575  indexInfo->ii_BrokenHotChain = false;
576  indexInfo->ii_AmCache = NULL;
577  indexInfo->ii_Context = CurrentMemoryContext;
578 
579  typeObjectId = (Oid *) palloc(numberOfAttributes * sizeof(Oid));
580  collationObjectId = (Oid *) palloc(numberOfAttributes * sizeof(Oid));
581  classObjectId = (Oid *) palloc(numberOfAttributes * sizeof(Oid));
582  coloptions = (int16 *) palloc(numberOfAttributes * sizeof(int16));
583  ComputeIndexAttrs(indexInfo,
584  typeObjectId, collationObjectId, classObjectId,
585  coloptions, stmt->indexParams,
586  stmt->excludeOpNames, relationId,
587  accessMethodName, accessMethodId,
588  amcanorder, stmt->isconstraint);
589 
590  /*
591  * Extra checks when creating a PRIMARY KEY index.
592  */
593  if (stmt->primary)
594  index_check_primary_key(rel, indexInfo, is_alter_table);
595 
596  /*
597  * We disallow indexes on system columns other than OID. They would not
598  * necessarily get updated correctly, and they don't seem useful anyway.
599  */
600  for (i = 0; i < indexInfo->ii_NumIndexAttrs; i++)
601  {
602  AttrNumber attno = indexInfo->ii_KeyAttrNumbers[i];
603 
604  if (attno < 0 && attno != ObjectIdAttributeNumber)
605  ereport(ERROR,
606  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
607  errmsg("index creation on system columns is not supported")));
608  }
609 
610  /*
611  * Also check for system columns used in expressions or predicates.
612  */
613  if (indexInfo->ii_Expressions || indexInfo->ii_Predicate)
614  {
615  Bitmapset *indexattrs = NULL;
616 
617  pull_varattnos((Node *) indexInfo->ii_Expressions, 1, &indexattrs);
618  pull_varattnos((Node *) indexInfo->ii_Predicate, 1, &indexattrs);
619 
620  for (i = FirstLowInvalidHeapAttributeNumber + 1; i < 0; i++)
621  {
622  if (i != ObjectIdAttributeNumber &&
624  indexattrs))
625  ereport(ERROR,
626  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
627  errmsg("index creation on system columns is not supported")));
628  }
629  }
630 
631  /*
632  * Report index creation if appropriate (delay this till after most of the
633  * error checks)
634  */
635  if (stmt->isconstraint && !quiet)
636  {
637  const char *constraint_type;
638 
639  if (stmt->primary)
640  constraint_type = "PRIMARY KEY";
641  else if (stmt->unique)
642  constraint_type = "UNIQUE";
643  else if (stmt->excludeOpNames != NIL)
644  constraint_type = "EXCLUDE";
645  else
646  {
647  elog(ERROR, "unknown constraint type");
648  constraint_type = NULL; /* keep compiler quiet */
649  }
650 
651  ereport(DEBUG1,
652  (errmsg("%s %s will create implicit index \"%s\" for table \"%s\"",
653  is_alter_table ? "ALTER TABLE / ADD" : "CREATE TABLE /",
654  constraint_type,
655  indexRelationName, RelationGetRelationName(rel))));
656  }
657 
658  /*
659  * A valid stmt->oldNode implies that we already have a built form of the
660  * index. The caller should also decline any index build.
661  */
662  Assert(!OidIsValid(stmt->oldNode) || (skip_build && !stmt->concurrent));
663 
664  /*
665  * Make the catalog entries for the index, including constraints. Then, if
666  * not skip_build || concurrent, actually build the index.
667  */
668  indexRelationId =
669  index_create(rel, indexRelationName, indexRelationId, stmt->oldNode,
670  indexInfo, indexColNames,
671  accessMethodId, tablespaceId,
672  collationObjectId, classObjectId,
673  coloptions, reloptions, stmt->primary,
674  stmt->isconstraint, stmt->deferrable, stmt->initdeferred,
676  skip_build || stmt->concurrent,
677  stmt->concurrent, !check_rights,
678  stmt->if_not_exists);
679 
680  ObjectAddressSet(address, RelationRelationId, indexRelationId);
681 
682  if (!OidIsValid(indexRelationId))
683  {
684  heap_close(rel, NoLock);
685  return address;
686  }
687 
688  /* Add any requested comment */
689  if (stmt->idxcomment != NULL)
690  CreateComments(indexRelationId, RelationRelationId, 0,
691  stmt->idxcomment);
692 
693  if (!stmt->concurrent)
694  {
695  /* Close the heap and we're done, in the non-concurrent case */
696  heap_close(rel, NoLock);
697  return address;
698  }
699 
700  /* save lockrelid and locktag for below, then close rel */
701  heaprelid = rel->rd_lockInfo.lockRelId;
702  SET_LOCKTAG_RELATION(heaplocktag, heaprelid.dbId, heaprelid.relId);
703  heap_close(rel, NoLock);
704 
705  /*
706  * For a concurrent build, it's important to make the catalog entries
707  * visible to other transactions before we start to build the index. That
708  * will prevent them from making incompatible HOT updates. The new index
709  * will be marked not indisready and not indisvalid, so that no one else
710  * tries to either insert into it or use it for queries.
711  *
712  * We must commit our current transaction so that the index becomes
713  * visible; then start another. Note that all the data structures we just
714  * built are lost in the commit. The only data we keep past here are the
715  * relation IDs.
716  *
717  * Before committing, get a session-level lock on the table, to ensure
718  * that neither it nor the index can be dropped before we finish. This
719  * cannot block, even if someone else is waiting for access, because we
720  * already have the same lock within our transaction.
721  *
722  * Note: we don't currently bother with a session lock on the index,
723  * because there are no operations that could change its state while we
724  * hold lock on the parent table. This might need to change later.
725  */
727 
731 
732  /*
733  * Phase 2 of concurrent index build (see comments for validate_index()
734  * for an overview of how this works)
735  *
736  * Now we must wait until no running transaction could have the table open
737  * with the old list of indexes. Use ShareLock to consider running
738  * transactions that hold locks that permit writing to the table. Note we
739  * do not need to worry about xacts that open the table for writing after
740  * this point; they will see the new index when they open it.
741  *
742  * Note: the reason we use actual lock acquisition here, rather than just
743  * checking the ProcArray and sleeping, is that deadlock is possible if
744  * one of the transactions in question is blocked trying to acquire an
745  * exclusive lock on our table. The lock code will detect deadlock and
746  * error out properly.
747  */
748  WaitForLockers(heaplocktag, ShareLock);
749 
750  /*
751  * At this moment we are sure that there are no transactions with the
752  * table open for write that don't have this new index in their list of
753  * indexes. We have waited out all the existing transactions and any new
754  * transaction will have the new index in its list, but the index is still
755  * marked as "not-ready-for-inserts". The index is consulted while
756  * deciding HOT-safety though. This arrangement ensures that no new HOT
757  * chains can be created where the new tuple and the old tuple in the
758  * chain have different index keys.
759  *
760  * We now take a new snapshot, and build the index using all tuples that
761  * are visible in this snapshot. We can be sure that any HOT updates to
762  * these tuples will be compatible with the index, since any updates made
763  * by transactions that didn't know about the index are now committed or
764  * rolled back. Thus, each visible tuple is either the end of its
765  * HOT-chain or the extension of the chain is HOT-safe for this index.
766  */
767 
768  /* Open and lock the parent heap relation */
770 
771  /* And the target index relation */
772  indexRelation = index_open(indexRelationId, RowExclusiveLock);
773 
774  /* Set ActiveSnapshot since functions in the indexes may need it */
776 
777  /* We have to re-build the IndexInfo struct, since it was lost in commit */
778  indexInfo = BuildIndexInfo(indexRelation);
779  Assert(!indexInfo->ii_ReadyForInserts);
780  indexInfo->ii_Concurrent = true;
781  indexInfo->ii_BrokenHotChain = false;
782 
783  /* Now build the index */
784  index_build(rel, indexRelation, indexInfo, stmt->primary, false);
785 
786  /* Close both the relations, but keep the locks */
787  heap_close(rel, NoLock);
788  index_close(indexRelation, NoLock);
789 
790  /*
791  * Update the pg_index row to mark the index as ready for inserts. Once we
792  * commit this transaction, any new transactions that open the table must
793  * insert new entries into the index for insertions and non-HOT updates.
794  */
796 
797  /* we can do away with our snapshot */
799 
800  /*
801  * Commit this transaction to make the indisready update visible.
802  */
805 
806  /*
807  * Phase 3 of concurrent index build
808  *
809  * We once again wait until no transaction can have the table open with
810  * the index marked as read-only for updates.
811  */
812  WaitForLockers(heaplocktag, ShareLock);
813 
814  /*
815  * Now take the "reference snapshot" that will be used by validate_index()
816  * to filter candidate tuples. Beware! There might still be snapshots in
817  * use that treat some transaction as in-progress that our reference
818  * snapshot treats as committed. If such a recently-committed transaction
819  * deleted tuples in the table, we will not include them in the index; yet
820  * those transactions which see the deleting one as still-in-progress will
821  * expect such tuples to be there once we mark the index as valid.
822  *
823  * We solve this by waiting for all endangered transactions to exit before
824  * we mark the index as valid.
825  *
826  * We also set ActiveSnapshot to this snap, since functions in indexes may
827  * need a snapshot.
828  */
830  PushActiveSnapshot(snapshot);
831 
832  /*
833  * Scan the index and the heap, insert any missing index entries.
834  */
835  validate_index(relationId, indexRelationId, snapshot);
836 
837  /*
838  * Drop the reference snapshot. We must do this before waiting out other
839  * snapshot holders, else we will deadlock against other processes also
840  * doing CREATE INDEX CONCURRENTLY, which would see our snapshot as one
841  * they must wait for. But first, save the snapshot's xmin to use as
842  * limitXmin for GetCurrentVirtualXIDs().
843  */
844  limitXmin = snapshot->xmin;
845 
847  UnregisterSnapshot(snapshot);
848 
849  /*
850  * The index is now valid in the sense that it contains all currently
851  * interesting tuples. But since it might not contain tuples deleted just
852  * before the reference snap was taken, we have to wait out any
853  * transactions that might have older snapshots. Obtain a list of VXIDs
854  * of such transactions, and wait for them individually.
855  *
856  * We can exclude any running transactions that have xmin > the xmin of
857  * our reference snapshot; their oldest snapshot must be newer than ours.
858  * We can also exclude any transactions that have xmin = zero, since they
859  * evidently have no live snapshot at all (and any one they might be in
860  * process of taking is certainly newer than ours). Transactions in other
861  * DBs can be ignored too, since they'll never even be able to see this
862  * index.
863  *
864  * We can also exclude autovacuum processes and processes running manual
865  * lazy VACUUMs, because they won't be fazed by missing index entries
866  * either. (Manual ANALYZEs, however, can't be excluded because they
867  * might be within transactions that are going to do arbitrary operations
868  * later.)
869  *
870  * Also, GetCurrentVirtualXIDs never reports our own vxid, so we need not
871  * check for that.
872  *
873  * If a process goes idle-in-transaction with xmin zero, we do not need to
874  * wait for it anymore, per the above argument. We do not have the
875  * infrastructure right now to stop waiting if that happens, but we can at
876  * least avoid the folly of waiting when it is idle at the time we would
877  * begin to wait. We do this by repeatedly rechecking the output of
878  * GetCurrentVirtualXIDs. If, during any iteration, a particular vxid
879  * doesn't show up in the output, we know we can forget about it.
880  */
881  old_snapshots = GetCurrentVirtualXIDs(limitXmin, true, false,
883  &n_old_snapshots);
884 
885  for (i = 0; i < n_old_snapshots; i++)
886  {
887  if (!VirtualTransactionIdIsValid(old_snapshots[i]))
888  continue; /* found uninteresting in previous cycle */
889 
890  if (i > 0)
891  {
892  /* see if anything's changed ... */
893  VirtualTransactionId *newer_snapshots;
894  int n_newer_snapshots;
895  int j;
896  int k;
897 
898  newer_snapshots = GetCurrentVirtualXIDs(limitXmin,
899  true, false,
901  &n_newer_snapshots);
902  for (j = i; j < n_old_snapshots; j++)
903  {
904  if (!VirtualTransactionIdIsValid(old_snapshots[j]))
905  continue; /* found uninteresting in previous cycle */
906  for (k = 0; k < n_newer_snapshots; k++)
907  {
908  if (VirtualTransactionIdEquals(old_snapshots[j],
909  newer_snapshots[k]))
910  break;
911  }
912  if (k >= n_newer_snapshots) /* not there anymore */
913  SetInvalidVirtualTransactionId(old_snapshots[j]);
914  }
915  pfree(newer_snapshots);
916  }
917 
918  if (VirtualTransactionIdIsValid(old_snapshots[i]))
919  VirtualXactLock(old_snapshots[i], true);
920  }
921 
922  /*
923  * Index can now be marked valid -- update its pg_index entry
924  */
926 
927  /*
928  * The pg_index update will cause backends (including this one) to update
929  * relcache entries for the index itself, but we should also send a
930  * relcache inval on the parent table to force replanning of cached plans.
931  * Otherwise existing sessions might fail to use the new index where it
932  * would be useful. (Note that our earlier commits did not create reasons
933  * to replan; so relcache flush on the index itself was sufficient.)
934  */
936 
937  /*
938  * Last thing to do is release the session-level lock on the parent table.
939  */
941 
942  return address;
943 }
bool deferrable
Definition: parsenodes.h:2705
signed short int16
Definition: c.h:255
#define NIL
Definition: pg_list.h:69
bool primary
Definition: parsenodes.h:2703
VirtualTransactionId * GetCurrentVirtualXIDs(TransactionId limitXmin, bool excludeXmin0, bool allDbs, int excludeVacuum, int *nvxids)
Definition: procarray.c:2474
Oid get_tablespace_oid(const char *tablespacename, bool missing_ok)
Definition: tablespace.c:1380
MemoryContext ii_Context
Definition: execnodes.h:151
LockRelId lockRelId
Definition: rel.h:44
bool amcanmulticol
Definition: amapi.h:179
AclResult pg_tablespace_aclcheck(Oid spc_oid, Oid roleid, AclMode mode)
Definition: aclchk.c:4496
#define DEBUG1
Definition: elog.h:25
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
List * ii_Predicate
Definition: execnodes.h:138
List * options
Definition: parsenodes.h:2696
uint32 TransactionId
Definition: c.h:397
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:863
amgettuple_function amgettuple
Definition: amapi.h:210
int LOCKMODE
Definition: lockdefs.h:26
Oid GetUserId(void)
Definition: miscinit.c:284
#define ObjectIdAttributeNumber
Definition: sysattr.h:22
void index_set_state_flags(Oid indexId, IndexStateFlagsAction action)
Definition: index.c:3202
#define PointerGetDatum(X)
Definition: postgres.h:562
char * tableSpace
Definition: parsenodes.h:2694
ExprState * ii_PredicateState
Definition: execnodes.h:139
void CommitTransactionCommand(void)
Definition: xact.c:2750
#define RelationRelationId
Definition: pg_class.h:29
Oid dbId
Definition: rel.h:39
#define RELKIND_MATVIEW
Definition: pg_class.h:165
Node * whereClause
Definition: parsenodes.h:2697
Definition: lock.h:178
#define GLOBALTABLESPACE_OID
Definition: pg_tablespace.h:64
void index_check_primary_key(Relation heapRel, IndexInfo *indexInfo, bool is_alter_table)
Definition: index.c:195
Definition: nodes.h:509
Oid * ii_ExclusionProcs
Definition: execnodes.h:141
Oid index_create(Relation heapRelation, const char *indexRelationName, Oid indexRelationId, Oid relFileNode, IndexInfo *indexInfo, List *indexColNames, Oid accessMethodObjectId, Oid tableSpaceId, Oid *collationObjectId, Oid *classObjectId, int16 *coloptions, Datum reloptions, bool isprimary, bool isconstraint, bool deferrable, bool initdeferred, bool allow_system_table_mods, bool skip_build, bool concurrent, bool is_internal, bool if_not_exists)
Definition: index.c:700
int errcode(int sqlerrcode)
Definition: elog.c:575
void CreateComments(Oid oid, Oid classoid, int32 subid, char *comment)
Definition: comment.c:142
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:28
void PopActiveSnapshot(void)
Definition: snapmgr.c:812
#define heap_close(r, l)
Definition: heapam.h:97
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:1642
static List * ChooseIndexColumnNames(List *indexElems)
Definition: indexcmds.c:1692
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
Snapshot GetTransactionSnapshot(void)
Definition: snapmgr.c:304
#define OidIsValid(objectId)
Definition: c.h:538
AclResult pg_namespace_aclcheck(Oid nsp_oid, Oid roleid, AclMode mode)
Definition: aclchk.c:4484
void pull_varattnos(Node *node, Index varno, Bitmapset **varattnos)
Definition: var.c:219
#define SearchSysCache1(cacheId, key1)
Definition: syscache.h:156
Oid GetDefaultTablespace(char relpersistence)
Definition: tablespace.c:1111
Oid MyDatabaseTableSpace
Definition: globals.c:79
bool VirtualXactLock(VirtualTransactionId vxid, bool wait)
Definition: lock.c:4291
#define VirtualTransactionIdEquals(vxid1, vxid2)
Definition: lock.h:74
RangeVar * relation
Definition: parsenodes.h:2692
List * ii_ExpressionsState
Definition: execnodes.h:137
void pfree(void *pointer)
Definition: mcxt.c:950
#define PROC_IN_VACUUM
Definition: proc.h:53
List * make_ands_implicit(Expr *clause)
Definition: clauses.c:378
void UnlockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:312
#define ERROR
Definition: elog.h:43
Definition: rel.h:36
#define ACL_CREATE
Definition: parsenodes.h:82
void LockRelationIdForSession(LockRelId *relid, LOCKMODE lockmode)
Definition: lmgr.c:299
amoptions_function amoptions
Definition: amapi.h:205
static void ComputeIndexAttrs(IndexInfo *indexInfo, Oid *typeOidP, Oid *collationOidP, Oid *classOidP, int16 *colOptionP, List *attList, List *exclusionOpNames, Oid relId, char *accessMethodName, Oid accessMethodId, bool amcanorder, bool isconstraint)
Definition: indexcmds.c:1007
IndexAmRoutine * GetIndexAmRoutine(Oid amhandler)
Definition: amapi.c:33
bool amcanunique
Definition: amapi.h:177
#define SET_LOCKTAG_RELATION(locktag, dboid, reloid)
Definition: lock.h:193
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3033
#define NoLock
Definition: lockdefs.h:34
LockInfoData rd_lockInfo
Definition: rel.h:117
void PushActiveSnapshot(Snapshot snap)
Definition: snapmgr.c:733
void aclcheck_error(AclResult aclerr, AclObjectKind objectkind, const char *objectname)
Definition: aclchk.c:3399
#define RowExclusiveLock
Definition: lockdefs.h:38
void CacheInvalidateRelcacheByRelid(Oid relid)
Definition: inval.c:1292
#define RelationGetRelationName(relation)
Definition: rel.h:436
bool ii_BrokenHotChain
Definition: execnodes.h:149
#define RELKIND_FOREIGN_TABLE
Definition: pg_class.h:167
TransactionId xmin
Definition: snapshot.h:66
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
void CheckTableNotInUse(Relation rel, const char *stmt)
Definition: tablecmds.c:3018
bool ii_ReadyForInserts
Definition: execnodes.h:147
#define ereport(elevel, rest)
Definition: elog.h:122
void UnregisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:905
void * ii_AmCache
Definition: execnodes.h:150
bytea *(* amoptions_function)(Datum reloptions, bool validate)
Definition: amapi.h:102
char * idxname
Definition: parsenodes.h:2691
void index_build(Relation heapRelation, Relation indexRelation, IndexInfo *indexInfo, bool isprimary, bool isreindex)
Definition: index.c:2006
#define VirtualTransactionIdIsValid(vxid)
Definition: lock.h:71
void validate_index(Oid heapId, Oid indexId, Snapshot snapshot)
Definition: index.c:2805
#define RELKIND_PARTITIONED_TABLE
Definition: pg_class.h:168
bool if_not_exists
Definition: parsenodes.h:2709
AclResult
Definition: acl.h:170
uintptr_t Datum
Definition: postgres.h:372
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1117
int ii_NumIndexAttrs
Definition: execnodes.h:134
bool unique
Definition: parsenodes.h:2702
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
char * accessMethod
Definition: parsenodes.h:2693
Datum transformRelOptions(Datum oldOptions, List *defList, char *namspace, char *validnsps[], bool ignoreOids, bool isReset)
Definition: reloptions.c:745
void WaitForLockers(LOCKTAG heaplocktag, LOCKMODE lockmode)
Definition: lmgr.c:811
Relation heap_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition: heapam.c:1318
bool allowSystemTableMods
Definition: globals.c:112
bytea * index_reloptions(amoptions_function amoptions, Datum reloptions, bool validate)
Definition: reloptions.c:1447
#define NOTICE
Definition: elog.h:37
bool ii_Unique
Definition: execnodes.h:146
#define makeNode(_type_)
Definition: nodes.h:557
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
#define NULL
Definition: c.h:229
List * ii_Expressions
Definition: execnodes.h:136
#define Assert(condition)
Definition: c.h:676
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:533
void StartTransactionCommand(void)
Definition: xact.c:2680
#define SetInvalidVirtualTransactionId(vxid)
Definition: lock.h:77
List * indexParams
Definition: parsenodes.h:2695
static void CheckPredicate(Expr *predicate)
Definition: indexcmds.c:985
#define INDEX_MAX_KEYS
List * excludeOpNames
Definition: parsenodes.h:2698
static int list_length(const List *l)
Definition: pg_list.h:89
AttrNumber ii_KeyAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:135
bool initdeferred
Definition: parsenodes.h:2706
bool amcanorder
Definition: amapi.h:171
char * idxcomment
Definition: parsenodes.h:2699
bool ii_Concurrent
Definition: execnodes.h:148
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
#define IsBootstrapProcessingMode()
Definition: miscadmin.h:368
bool concurrent
Definition: parsenodes.h:2708
bool isconstraint
Definition: parsenodes.h:2704
Oid * ii_ExclusionOps
Definition: execnodes.h:140
FormData_pg_am * Form_pg_am
Definition: pg_am.h:46
void * palloc(Size size)
Definition: mcxt.c:849
int errmsg(const char *fmt,...)
Definition: elog.c:797
char * get_tablespace_name(Oid spc_oid)
Definition: tablespace.c:1426
#define ShareLock
Definition: lockdefs.h:41
int i
static char * ChooseIndexName(const char *tabname, Oid namespaceId, List *colnames, List *exclusionOpNames, bool primary, bool isconstraint)
Definition: indexcmds.c:1610
#define elog
Definition: elog.h:219
#define HeapTupleGetOid(tuple)
Definition: htup_details.h:695
uint16 * ii_ExclusionStrats
Definition: execnodes.h:142
#define RELKIND_RELATION
Definition: pg_class.h:160
Definition: pg_list.h:45
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:420
int16 AttrNumber
Definition: attnum.h:21
#define RelationGetRelid(relation)
Definition: rel.h:416
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:151
#define PROC_IS_AUTOVACUUM
Definition: proc.h:52
Oid relId
Definition: rel.h:38
#define RelationGetNamespace(relation)
Definition: rel.h:443
Oid GetDefaultOpClass ( Oid  type_id,
Oid  am_id 
)

Definition at line 1391 of file indexcmds.c.

References AccessShareLock, Anum_pg_opclass_opcmethod, BTEqualStrategyNumber, ereport, errcode(), ERRCODE_DUPLICATE_OBJECT, errmsg(), ERROR, format_type_be(), getBaseType(), GETSTRUCT, heap_close, heap_open(), HeapTupleGetOid, HeapTupleIsValid, InvalidOid, IsBinaryCoercible(), IsPreferredType(), NULL, ObjectIdGetDatum, OpclassAmNameNspIndexId, OperatorClassRelationId, result, ScanKeyInit(), systable_beginscan(), systable_endscan(), systable_getnext(), and TypeCategory().

Referenced by ComputePartitionAttrs(), findRangeSubOpclass(), get_opclass(), get_opclass_name(), lookup_type_cache(), ResolveOpClass(), and transformIndexConstraint().

1392 {
1393  Oid result = InvalidOid;
1394  int nexact = 0;
1395  int ncompatible = 0;
1396  int ncompatiblepreferred = 0;
1397  Relation rel;
1398  ScanKeyData skey[1];
1399  SysScanDesc scan;
1400  HeapTuple tup;
1401  TYPCATEGORY tcategory;
1402 
1403  /* If it's a domain, look at the base type instead */
1404  type_id = getBaseType(type_id);
1405 
1406  tcategory = TypeCategory(type_id);
1407 
1408  /*
1409  * We scan through all the opclasses available for the access method,
1410  * looking for one that is marked default and matches the target type
1411  * (either exactly or binary-compatibly, but prefer an exact match).
1412  *
1413  * We could find more than one binary-compatible match. If just one is
1414  * for a preferred type, use that one; otherwise we fail, forcing the user
1415  * to specify which one he wants. (The preferred-type special case is a
1416  * kluge for varchar: it's binary-compatible to both text and bpchar, so
1417  * we need a tiebreaker.) If we find more than one exact match, then
1418  * someone put bogus entries in pg_opclass.
1419  */
1421 
1422  ScanKeyInit(&skey[0],
1424  BTEqualStrategyNumber, F_OIDEQ,
1425  ObjectIdGetDatum(am_id));
1426 
1427  scan = systable_beginscan(rel, OpclassAmNameNspIndexId, true,
1428  NULL, 1, skey);
1429 
1430  while (HeapTupleIsValid(tup = systable_getnext(scan)))
1431  {
1432  Form_pg_opclass opclass = (Form_pg_opclass) GETSTRUCT(tup);
1433 
1434  /* ignore altogether if not a default opclass */
1435  if (!opclass->opcdefault)
1436  continue;
1437  if (opclass->opcintype == type_id)
1438  {
1439  nexact++;
1440  result = HeapTupleGetOid(tup);
1441  }
1442  else if (nexact == 0 &&
1443  IsBinaryCoercible(type_id, opclass->opcintype))
1444  {
1445  if (IsPreferredType(tcategory, opclass->opcintype))
1446  {
1447  ncompatiblepreferred++;
1448  result = HeapTupleGetOid(tup);
1449  }
1450  else if (ncompatiblepreferred == 0)
1451  {
1452  ncompatible++;
1453  result = HeapTupleGetOid(tup);
1454  }
1455  }
1456  }
1457 
1458  systable_endscan(scan);
1459 
1461 
1462  /* raise error if pg_opclass contains inconsistent data */
1463  if (nexact > 1)
1464  ereport(ERROR,
1466  errmsg("there are multiple default operator classes for data type %s",
1467  format_type_be(type_id))));
1468 
1469  if (nexact == 1 ||
1470  ncompatiblepreferred == 1 ||
1471  (ncompatiblepreferred == 0 && ncompatible == 1))
1472  return result;
1473 
1474  return InvalidOid;
1475 }
#define Anum_pg_opclass_opcmethod
Definition: pg_opclass.h:75
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:499
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
#define AccessShareLock
Definition: lockdefs.h:36
#define OperatorClassRelationId
Definition: pg_opclass.h:49
int errcode(int sqlerrcode)
Definition: elog.c:575
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
return result
Definition: formatting.c:1633
#define heap_close(r, l)
Definition: heapam.h:97
unsigned int Oid
Definition: postgres_ext.h:31
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:328
#define OpclassAmNameNspIndexId
Definition: indexing.h:198
bool IsPreferredType(TYPCATEGORY category, Oid type)
char TYPCATEGORY
Definition: parse_coerce.h:21
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:416
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
#define ereport(elevel, rest)
Definition: elog.h:122
bool IsBinaryCoercible(Oid srctype, Oid targettype)
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
#define InvalidOid
Definition: postgres_ext.h:36
TYPCATEGORY TypeCategory(Oid type)
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
#define NULL
Definition: c.h:229
int errmsg(const char *fmt,...)
Definition: elog.c:797
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
#define HeapTupleGetOid(tuple)
Definition: htup_details.h:695
Oid getBaseType(Oid typid)
Definition: lsyscache.c:2271
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:68
#define ERRCODE_DUPLICATE_OBJECT
Definition: streamutil.c:32
#define BTEqualStrategyNumber
Definition: stratnum.h:31
char* makeObjectName ( const char *  name1,
const char *  name2,
const char *  label 
)

Definition at line 1499 of file indexcmds.c.

References Assert, name, NAMEDATALEN, palloc(), and pg_mbcliplen().

Referenced by ChooseConstraintName(), and ChooseRelationName().

1500 {
1501  char *name;
1502  int overhead = 0; /* chars needed for label and underscores */
1503  int availchars; /* chars available for name(s) */
1504  int name1chars; /* chars allocated to name1 */
1505  int name2chars; /* chars allocated to name2 */
1506  int ndx;
1507 
1508  name1chars = strlen(name1);
1509  if (name2)
1510  {
1511  name2chars = strlen(name2);
1512  overhead++; /* allow for separating underscore */
1513  }
1514  else
1515  name2chars = 0;
1516  if (label)
1517  overhead += strlen(label) + 1;
1518 
1519  availchars = NAMEDATALEN - 1 - overhead;
1520  Assert(availchars > 0); /* else caller chose a bad label */
1521 
1522  /*
1523  * If we must truncate, preferentially truncate the longer name. This
1524  * logic could be expressed without a loop, but it's simple and obvious as
1525  * a loop.
1526  */
1527  while (name1chars + name2chars > availchars)
1528  {
1529  if (name1chars > name2chars)
1530  name1chars--;
1531  else
1532  name2chars--;
1533  }
1534 
1535  name1chars = pg_mbcliplen(name1, name1chars, name1chars);
1536  if (name2)
1537  name2chars = pg_mbcliplen(name2, name2chars, name2chars);
1538 
1539  /* Now construct the string using the chosen lengths */
1540  name = palloc(name1chars + name2chars + overhead + 1);
1541  memcpy(name, name1, name1chars);
1542  ndx = name1chars;
1543  if (name2)
1544  {
1545  name[ndx++] = '_';
1546  memcpy(name + ndx, name2, name2chars);
1547  ndx += name2chars;
1548  }
1549  if (label)
1550  {
1551  name[ndx++] = '_';
1552  strcpy(name + ndx, label);
1553  }
1554  else
1555  name[ndx] = '\0';
1556 
1557  return name;
1558 }
#define NAMEDATALEN
int pg_mbcliplen(const char *mbstr, int len, int limit)
Definition: mbutils.c:831
static char * label
Definition: pg_basebackup.c:81
#define Assert(condition)
Definition: c.h:676
const char * name
Definition: encode.c:521
void * palloc(Size size)
Definition: mcxt.c:849
static void RangeVarCallbackForReindexIndex ( const RangeVar relation,
Oid  relId,
Oid  oldRelId,
void *  arg 
)
static

Definition at line 1786 of file indexcmds.c.

References ACL_KIND_CLASS, aclcheck_error(), ACLCHECK_NOT_OWNER, ereport, errcode(), errmsg(), ERROR, get_rel_relkind(), GetUserId(), IndexGetRelation(), InvalidOid, LockRelationOid(), OidIsValid, pg_class_ownercheck(), RELKIND_INDEX, RangeVar::relname, ShareLock, and UnlockRelationOid().

Referenced by ReindexIndex().

1788 {
1789  char relkind;
1790  Oid *heapOid = (Oid *) arg;
1791 
1792  /*
1793  * If we previously locked some other index's heap, and the name we're
1794  * looking up no longer refers to that relation, release the now-useless
1795  * lock.
1796  */
1797  if (relId != oldRelId && OidIsValid(oldRelId))
1798  {
1799  /* lock level here should match reindex_index() heap lock */
1800  UnlockRelationOid(*heapOid, ShareLock);
1801  *heapOid = InvalidOid;
1802  }
1803 
1804  /* If the relation does not exist, there's nothing more to do. */
1805  if (!OidIsValid(relId))
1806  return;
1807 
1808  /*
1809  * If the relation does exist, check whether it's an index. But note that
1810  * the relation might have been dropped between the time we did the name
1811  * lookup and now. In that case, there's nothing to do.
1812  */
1813  relkind = get_rel_relkind(relId);
1814  if (!relkind)
1815  return;
1816  if (relkind != RELKIND_INDEX)
1817  ereport(ERROR,
1818  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1819  errmsg("\"%s\" is not an index", relation->relname)));
1820 
1821  /* Check permissions */
1822  if (!pg_class_ownercheck(relId, GetUserId()))
1824 
1825  /* Lock heap before index to avoid deadlock. */
1826  if (relId != oldRelId)
1827  {
1828  /*
1829  * Lock level here should match reindex_index() heap lock. If the OID
1830  * isn't valid, it means the index as concurrently dropped, which is
1831  * not a problem for us; just return normally.
1832  */
1833  *heapOid = IndexGetRelation(relId, true);
1834  if (OidIsValid(*heapOid))
1835  LockRelationOid(*heapOid, ShareLock);
1836  }
1837 }
Oid IndexGetRelation(Oid indexId, bool missing_ok)
Definition: index.c:3281
Oid GetUserId(void)
Definition: miscinit.c:284
void UnlockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:182
char get_rel_relkind(Oid relid)
Definition: lsyscache.c:1801
int errcode(int sqlerrcode)
Definition: elog.c:575
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:538
char * relname
Definition: primnodes.h:68
#define ERROR
Definition: elog.h:43
void aclcheck_error(AclResult aclerr, AclObjectKind objectkind, const char *objectname)
Definition: aclchk.c:3399
#define ereport(elevel, rest)
Definition: elog.h:122
#define InvalidOid
Definition: postgres_ext.h:36
bool pg_class_ownercheck(Oid class_oid, Oid roleid)
Definition: aclchk.c:4546
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define ShareLock
Definition: lockdefs.h:41
#define RELKIND_INDEX
Definition: pg_class.h:161
void * arg
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:105
Oid ReindexIndex ( RangeVar indexRelation,
int  options 
)

Definition at line 1750 of file indexcmds.c.

References AccessExclusiveLock, index_close(), index_open(), InvalidOid, NoLock, RangeVarCallbackForReindexIndex(), RangeVarGetRelidExtended(), RelationData::rd_rel, and reindex_index().

Referenced by standard_ProcessUtility().

1751 {
1752  Oid indOid;
1753  Oid heapOid = InvalidOid;
1754  Relation irel;
1755  char persistence;
1756 
1757  /*
1758  * Find and lock index, and check permissions on table; use callback to
1759  * obtain lock on table first, to avoid deadlock hazard. The lock level
1760  * used here must match the index lock obtained in reindex_index().
1761  */
1762  indOid = RangeVarGetRelidExtended(indexRelation, AccessExclusiveLock,
1763  false, false,
1765  (void *) &heapOid);
1766 
1767  /*
1768  * Obtain the current persistence of the existing index. We already hold
1769  * lock on the index.
1770  */
1771  irel = index_open(indOid, NoLock);
1772  persistence = irel->rd_rel->relpersistence;
1773  index_close(irel, NoLock);
1774 
1775  reindex_index(indOid, false, persistence, options);
1776 
1777  return indOid;
1778 }
Oid RangeVarGetRelidExtended(const RangeVar *relation, LOCKMODE lockmode, bool missing_ok, bool nowait, RangeVarGetRelidCallback callback, void *callback_arg)
Definition: namespace.c:218
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
#define NoLock
Definition: lockdefs.h:34
static void RangeVarCallbackForReindexIndex(const RangeVar *relation, Oid relId, Oid oldRelId, void *arg)
Definition: indexcmds.c:1786
#define InvalidOid
Definition: postgres_ext.h:36
void reindex_index(Oid indexId, bool skip_constraint_checks, char persistence, int options)
Definition: index.c:3306
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
#define AccessExclusiveLock
Definition: lockdefs.h:45
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:151
void ReindexMultipleTables ( const char *  objectName,
ReindexObjectType  objectKind,
int  options 
)

Definition at line 1872 of file indexcmds.c.

References AccessShareLock, ACL_KIND_DATABASE, ACL_KIND_NAMESPACE, aclcheck_error(), ACLCHECK_NOT_OWNER, ALLOCSET_SMALL_SIZES, AllocSetContextCreate(), Anum_pg_class_relnamespace, Assert, AssertArg, BTEqualStrategyNumber, CommitTransactionCommand(), ereport, errcode(), errmsg(), ERROR, ForwardScanDirection, get_database_name(), get_namespace_name(), get_namespace_oid(), get_rel_name(), get_rel_namespace(), GETSTRUCT, GetTransactionSnapshot(), GetUserId(), heap_beginscan_catalog(), heap_close, heap_endscan(), heap_getnext(), heap_open(), HeapTupleGetOid, INFO, IsSystemClass(), isTempNamespace(), lappend_oid(), lcons_oid(), lfirst_oid, MemoryContextDelete(), MemoryContextSwitchTo(), MyDatabaseId, NIL, NULL, ObjectIdGetDatum, pg_database_ownercheck(), pg_namespace_ownercheck(), PopActiveSnapshot(), PortalContext, PushActiveSnapshot(), REINDEX_OBJECT_DATABASE, REINDEX_OBJECT_SCHEMA, REINDEX_OBJECT_SYSTEM, REINDEX_REL_CHECK_CONSTRAINTS, REINDEX_REL_PROCESS_TOAST, reindex_relation(), REINDEXOPT_VERBOSE, RelationRelationId, RELKIND_MATVIEW, RELKIND_RELATION, RELPERSISTENCE_TEMP, ScanKeyInit(), and StartTransactionCommand().

Referenced by standard_ProcessUtility().

1874 {
1875  Oid objectOid;
1876  Relation relationRelation;
1877  HeapScanDesc scan;
1878  ScanKeyData scan_keys[1];
1879  HeapTuple tuple;
1880  MemoryContext private_context;
1881  MemoryContext old;
1882  List *relids = NIL;
1883  ListCell *l;
1884  int num_keys;
1885 
1886  AssertArg(objectName);
1887  Assert(objectKind == REINDEX_OBJECT_SCHEMA ||
1888  objectKind == REINDEX_OBJECT_SYSTEM ||
1889  objectKind == REINDEX_OBJECT_DATABASE);
1890 
1891  /*
1892  * Get OID of object to reindex, being the database currently being used
1893  * by session for a database or for system catalogs, or the schema defined
1894  * by caller. At the same time do permission checks that need different
1895  * processing depending on the object type.
1896  */
1897  if (objectKind == REINDEX_OBJECT_SCHEMA)
1898  {
1899  objectOid = get_namespace_oid(objectName, false);
1900 
1901  if (!pg_namespace_ownercheck(objectOid, GetUserId()))
1903  objectName);
1904  }
1905  else
1906  {
1907  objectOid = MyDatabaseId;
1908 
1909  if (strcmp(objectName, get_database_name(objectOid)) != 0)
1910  ereport(ERROR,
1911  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1912  errmsg("can only reindex the currently open database")));
1913  if (!pg_database_ownercheck(objectOid, GetUserId()))
1915  objectName);
1916  }
1917 
1918  /*
1919  * Create a memory context that will survive forced transaction commits we
1920  * do below. Since it is a child of PortalContext, it will go away
1921  * eventually even if we suffer an error; there's no need for special
1922  * abort cleanup logic.
1923  */
1924  private_context = AllocSetContextCreate(PortalContext,
1925  "ReindexMultipleTables",
1927 
1928  /*
1929  * Define the search keys to find the objects to reindex. For a schema, we
1930  * select target relations using relnamespace, something not necessary for
1931  * a database-wide operation.
1932  */
1933  if (objectKind == REINDEX_OBJECT_SCHEMA)
1934  {
1935  num_keys = 1;
1936  ScanKeyInit(&scan_keys[0],
1938  BTEqualStrategyNumber, F_OIDEQ,
1939  ObjectIdGetDatum(objectOid));
1940  }
1941  else
1942  num_keys = 0;
1943 
1944  /*
1945  * Scan pg_class to build a list of the relations we need to reindex.
1946  *
1947  * We only consider plain relations and materialized views here (toast
1948  * rels will be processed indirectly by reindex_relation).
1949  */
1950  relationRelation = heap_open(RelationRelationId, AccessShareLock);
1951  scan = heap_beginscan_catalog(relationRelation, num_keys, scan_keys);
1952  while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
1953  {
1954  Form_pg_class classtuple = (Form_pg_class) GETSTRUCT(tuple);
1955  Oid relid = HeapTupleGetOid(tuple);
1956 
1957  /*
1958  * Only regular tables and matviews can have indexes, so ignore any
1959  * other kind of relation.
1960  */
1961  if (classtuple->relkind != RELKIND_RELATION &&
1962  classtuple->relkind != RELKIND_MATVIEW)
1963  continue;
1964 
1965  /* Skip temp tables of other backends; we can't reindex them at all */
1966  if (classtuple->relpersistence == RELPERSISTENCE_TEMP &&
1967  !isTempNamespace(classtuple->relnamespace))
1968  continue;
1969 
1970  /* Check user/system classification, and optionally skip */
1971  if (objectKind == REINDEX_OBJECT_SYSTEM &&
1972  !IsSystemClass(relid, classtuple))
1973  continue;
1974 
1975  /* Save the list of relation OIDs in private context */
1976  old = MemoryContextSwitchTo(private_context);
1977 
1978  /*
1979  * We always want to reindex pg_class first if it's selected to be
1980  * reindexed. This ensures that if there is any corruption in
1981  * pg_class' indexes, they will be fixed before we process any other
1982  * tables. This is critical because reindexing itself will try to
1983  * update pg_class.
1984  */
1985  if (relid == RelationRelationId)
1986  relids = lcons_oid(relid, relids);
1987  else
1988  relids = lappend_oid(relids, relid);
1989 
1990  MemoryContextSwitchTo(old);
1991  }
1992  heap_endscan(scan);
1993  heap_close(relationRelation, AccessShareLock);
1994 
1995  /* Now reindex each rel in a separate transaction */
1998  foreach(l, relids)
1999  {
2000  Oid relid = lfirst_oid(l);
2001 
2003  /* functions in indexes may want a snapshot set */
2005  if (reindex_relation(relid,
2008  options))
2009 
2011  ereport(INFO,
2012  (errmsg("table \"%s.%s\" was reindexed",
2014  get_rel_name(relid))));
2017  }
2019 
2020  MemoryContextDelete(private_context);
2021 }
#define NIL
Definition: pg_list.h:69
void MemoryContextDelete(MemoryContext context)
Definition: mcxt.c:200
Oid get_namespace_oid(const char *nspname, bool missing_ok)
Definition: namespace.c:3005
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
void heap_endscan(HeapScanDesc scan)
Definition: heapam.c:1580
Oid GetUserId(void)
Definition: miscinit.c:284
void CommitTransactionCommand(void)
Definition: xact.c:2750
#define RelationRelationId
Definition: pg_class.h:29
#define ALLOCSET_SMALL_SIZES
Definition: memutils.h:175
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1750
#define RELKIND_MATVIEW
Definition: pg_class.h:165
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
#define AccessShareLock
Definition: lockdefs.h:36
int errcode(int sqlerrcode)
Definition: elog.c:575
#define INFO
Definition: elog.h:33
void PopActiveSnapshot(void)
Definition: snapmgr.c:812
bool pg_namespace_ownercheck(Oid nsp_oid, Oid roleid)
Definition: aclchk.c:4722
List * lcons_oid(Oid datum, List *list)
Definition: list.c:295
#define heap_close(r, l)
Definition: heapam.h:97
unsigned int Oid
Definition: postgres_ext.h:31
List * lappend_oid(List *list, Oid datum)
Definition: list.c:164
Snapshot GetTransactionSnapshot(void)
Definition: snapmgr.c:304
#define Anum_pg_class_relnamespace
Definition: pg_class.h:104
#define REINDEXOPT_VERBOSE
Definition: parsenodes.h:3208
bool IsSystemClass(Oid relid, Form_pg_class reltuple)
Definition: catalog.c:75
MemoryContext PortalContext
Definition: mcxt.c:52
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
char * get_database_name(Oid dbid)
Definition: dbcommands.c:2056
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3033
void PushActiveSnapshot(Snapshot snap)
Definition: snapmgr.c:733
void aclcheck_error(AclResult aclerr, AclObjectKind objectkind, const char *objectname)
Definition: aclchk.c:3399
bool isTempNamespace(Oid namespaceId)
Definition: namespace.c:3118
HeapScanDesc heap_beginscan_catalog(Relation relation, int nkeys, ScanKey key)
Definition: heapam.c:1405
#define ereport(elevel, rest)
Definition: elog.h:122
#define AssertArg(condition)
Definition: c.h:678
bool pg_database_ownercheck(Oid db_oid, Oid roleid)
Definition: aclchk.c:4964
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
Oid MyDatabaseId
Definition: globals.c:77
HeapTuple heap_getnext(HeapScanDesc scan, ScanDirection direction)
Definition: heapam.c:1810
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:676
void StartTransactionCommand(void)
Definition: xact.c:2680
#define REINDEX_REL_CHECK_CONSTRAINTS
Definition: index.h:124
FormData_pg_class * Form_pg_class
Definition: pg_class.h:95
int errmsg(const char *fmt,...)
Definition: elog.c:797
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
#define REINDEX_REL_PROCESS_TOAST
Definition: index.h:122
#define HeapTupleGetOid(tuple)
Definition: htup_details.h:695
#define RELPERSISTENCE_TEMP
Definition: pg_class.h:172
#define RELKIND_RELATION
Definition: pg_class.h:160
bool reindex_relation(Oid relid, int flags, int options)
Definition: index.c:3515
Definition: pg_list.h:45
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1726
#define BTEqualStrategyNumber
Definition: stratnum.h:31
#define lfirst_oid(lc)
Definition: pg_list.h:108
Oid ReindexTable ( RangeVar relation,
int  options 
)

Definition at line 1844 of file indexcmds.c.

References ereport, errmsg(), NOTICE, NULL, RangeVarCallbackOwnsTable(), RangeVarGetRelidExtended(), REINDEX_REL_CHECK_CONSTRAINTS, REINDEX_REL_PROCESS_TOAST, reindex_relation(), RangeVar::relname, and ShareLock.

Referenced by standard_ProcessUtility().

1845 {
1846  Oid heapOid;
1847 
1848  /* The lock level used here should match reindex_relation(). */
1849  heapOid = RangeVarGetRelidExtended(relation, ShareLock, false, false,
1851 
1852  if (!reindex_relation(heapOid,
1855  options))
1856  ereport(NOTICE,
1857  (errmsg("table \"%s\" has no indexes",
1858  relation->relname)));
1859 
1860  return heapOid;
1861 }
void RangeVarCallbackOwnsTable(const RangeVar *relation, Oid relId, Oid oldRelId, void *arg)
Definition: tablecmds.c:12985
Oid RangeVarGetRelidExtended(const RangeVar *relation, LOCKMODE lockmode, bool missing_ok, bool nowait, RangeVarGetRelidCallback callback, void *callback_arg)
Definition: namespace.c:218
unsigned int Oid
Definition: postgres_ext.h:31
char * relname
Definition: primnodes.h:68
#define ereport(elevel, rest)
Definition: elog.h:122
#define NOTICE
Definition: elog.h:37
#define NULL
Definition: c.h:229
#define REINDEX_REL_CHECK_CONSTRAINTS
Definition: index.h:124
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define ShareLock
Definition: lockdefs.h:41
#define REINDEX_REL_PROCESS_TOAST
Definition: index.h:122
bool reindex_relation(Oid relid, int flags, int options)
Definition: index.c:3515
Oid ResolveOpClass ( List opclass,
Oid  attrType,
char *  accessMethodName,
Oid  accessMethodId 
)

Definition at line 1280 of file indexcmds.c.

References CLAAMNAMENSP, CLAOID, DeconstructQualifiedName(), ereport, errcode(), errhint(), errmsg(), ERROR, format_type_be(), GetDefaultOpClass(), GETSTRUCT, HeapTupleGetOid, HeapTupleIsValid, IsBinaryCoercible(), linitial, list_length(), LookupExplicitNamespace(), NameListToString(), NIL, ObjectIdGetDatum, OidIsValid, OpclassnameGetOpcid(), PointerGetDatum, ReleaseSysCache(), SearchSysCache1, SearchSysCache3, and strVal.

Referenced by ComputeIndexAttrs(), and ComputePartitionAttrs().

1282 {
1283  char *schemaname;
1284  char *opcname;
1285  HeapTuple tuple;
1286  Oid opClassId,
1287  opInputType;
1288 
1289  /*
1290  * Release 7.0 removed network_ops, timespan_ops, and datetime_ops, so we
1291  * ignore those opclass names so the default *_ops is used. This can be
1292  * removed in some later release. bjm 2000/02/07
1293  *
1294  * Release 7.1 removes lztext_ops, so suppress that too for a while. tgl
1295  * 2000/07/30
1296  *
1297  * Release 7.2 renames timestamp_ops to timestamptz_ops, so suppress that
1298  * too for awhile. I'm starting to think we need a better approach. tgl
1299  * 2000/10/01
1300  *
1301  * Release 8.0 removes bigbox_ops (which was dead code for a long while
1302  * anyway). tgl 2003/11/11
1303  */
1304  if (list_length(opclass) == 1)
1305  {
1306  char *claname = strVal(linitial(opclass));
1307 
1308  if (strcmp(claname, "network_ops") == 0 ||
1309  strcmp(claname, "timespan_ops") == 0 ||
1310  strcmp(claname, "datetime_ops") == 0 ||
1311  strcmp(claname, "lztext_ops") == 0 ||
1312  strcmp(claname, "timestamp_ops") == 0 ||
1313  strcmp(claname, "bigbox_ops") == 0)
1314  opclass = NIL;
1315  }
1316 
1317  if (opclass == NIL)
1318  {
1319  /* no operator class specified, so find the default */
1320  opClassId = GetDefaultOpClass(attrType, accessMethodId);
1321  if (!OidIsValid(opClassId))
1322  ereport(ERROR,
1323  (errcode(ERRCODE_UNDEFINED_OBJECT),
1324  errmsg("data type %s has no default operator class for access method \"%s\"",
1325  format_type_be(attrType), accessMethodName),
1326  errhint("You must specify an operator class for the index or define a default operator class for the data type.")));
1327  return opClassId;
1328  }
1329 
1330  /*
1331  * Specific opclass name given, so look up the opclass.
1332  */
1333 
1334  /* deconstruct the name list */
1335  DeconstructQualifiedName(opclass, &schemaname, &opcname);
1336 
1337  if (schemaname)
1338  {
1339  /* Look in specific schema only */
1340  Oid namespaceId;
1341 
1342  namespaceId = LookupExplicitNamespace(schemaname, false);
1343  tuple = SearchSysCache3(CLAAMNAMENSP,
1344  ObjectIdGetDatum(accessMethodId),
1345  PointerGetDatum(opcname),
1346  ObjectIdGetDatum(namespaceId));
1347  }
1348  else
1349  {
1350  /* Unqualified opclass name, so search the search path */
1351  opClassId = OpclassnameGetOpcid(accessMethodId, opcname);
1352  if (!OidIsValid(opClassId))
1353  ereport(ERROR,
1354  (errcode(ERRCODE_UNDEFINED_OBJECT),
1355  errmsg("operator class \"%s\" does not exist for access method \"%s\"",
1356  opcname, accessMethodName)));
1357  tuple = SearchSysCache1(CLAOID, ObjectIdGetDatum(opClassId));
1358  }
1359 
1360  if (!HeapTupleIsValid(tuple))
1361  ereport(ERROR,
1362  (errcode(ERRCODE_UNDEFINED_OBJECT),
1363  errmsg("operator class \"%s\" does not exist for access method \"%s\"",
1364  NameListToString(opclass), accessMethodName)));
1365 
1366  /*
1367  * Verify that the index operator class accepts this datatype. Note we
1368  * will accept binary compatibility.
1369  */
1370  opClassId = HeapTupleGetOid(tuple);
1371  opInputType = ((Form_pg_opclass) GETSTRUCT(tuple))->opcintype;
1372 
1373  if (!IsBinaryCoercible(attrType, opInputType))
1374  ereport(ERROR,
1375  (errcode(ERRCODE_DATATYPE_MISMATCH),
1376  errmsg("operator class \"%s\" does not accept data type %s",
1377  NameListToString(opclass), format_type_be(attrType))));
1378 
1379  ReleaseSysCache(tuple);
1380 
1381  return opClassId;
1382 }
#define NIL
Definition: pg_list.h:69
Oid LookupExplicitNamespace(const char *nspname, bool missing_ok)
Definition: namespace.c:2853
int errhint(const char *fmt,...)
Definition: elog.c:987
Oid GetDefaultOpClass(Oid type_id, Oid am_id)
Definition: indexcmds.c:1391
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
#define PointerGetDatum(X)
Definition: postgres.h:562
#define strVal(v)
Definition: value.h:54
int errcode(int sqlerrcode)
Definition: elog.c:575
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
void DeconstructQualifiedName(List *names, char **nspname_p, char **objname_p)
Definition: namespace.c:2769
unsigned int Oid
Definition: postgres_ext.h:31
Oid OpclassnameGetOpcid(Oid amid, const char *opcname)
Definition: namespace.c:1760
#define OidIsValid(objectId)
Definition: c.h:538
#define SearchSysCache1(cacheId, key1)
Definition: syscache.h:156
#define linitial(l)
Definition: pg_list.h:111
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
#define ereport(elevel, rest)
Definition: elog.h:122
bool IsBinaryCoercible(Oid srctype, Oid targettype)
char * NameListToString(List *names)
Definition: namespace.c:3063
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1117
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
static int list_length(const List *l)
Definition: pg_list.h:89
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define SearchSysCache3(cacheId, key1, key2, key3)
Definition: syscache.h:160
#define HeapTupleGetOid(tuple)
Definition: htup_details.h:695
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:68