PostgreSQL Source Code  git master
parse_utilcmd.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * parse_utilcmd.c
4  * Perform parse analysis work for various utility commands
5  *
6  * Formerly we did this work during parse_analyze() in analyze.c. However
7  * that is fairly unsafe in the presence of querytree caching, since any
8  * database state that we depend on in making the transformations might be
9  * obsolete by the time the utility command is executed; and utility commands
10  * have no infrastructure for holding locks or rechecking plan validity.
11  * Hence these functions are now called at the start of execution of their
12  * respective utility commands.
13  *
14  * NOTE: in general we must avoid scribbling on the passed-in raw parse
15  * tree, since it might be in a plan cache. The simplest solution is
16  * a quick copyObject() call before manipulating the query tree.
17  *
18  *
19  * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
20  * Portions Copyright (c) 1994, Regents of the University of California
21  *
22  * src/backend/parser/parse_utilcmd.c
23  *
24  *-------------------------------------------------------------------------
25  */
26 
27 #include "postgres.h"
28 
29 #include "access/amapi.h"
30 #include "access/htup_details.h"
31 #include "access/relation.h"
32 #include "access/reloptions.h"
33 #include "access/table.h"
34 #include "catalog/dependency.h"
35 #include "catalog/heap.h"
36 #include "catalog/index.h"
37 #include "catalog/namespace.h"
38 #include "catalog/pg_am.h"
39 #include "catalog/pg_collation.h"
40 #include "catalog/pg_constraint.h"
41 #include "catalog/pg_opclass.h"
42 #include "catalog/pg_operator.h"
43 #include "catalog/pg_statistic_ext.h"
44 #include "catalog/pg_type.h"
45 #include "commands/comment.h"
46 #include "commands/defrem.h"
47 #include "commands/sequence.h"
48 #include "commands/tablecmds.h"
49 #include "commands/tablespace.h"
50 #include "miscadmin.h"
51 #include "nodes/makefuncs.h"
52 #include "nodes/nodeFuncs.h"
53 #include "optimizer/optimizer.h"
54 #include "parser/analyze.h"
55 #include "parser/parse_clause.h"
56 #include "parser/parse_coerce.h"
57 #include "parser/parse_collate.h"
58 #include "parser/parse_expr.h"
59 #include "parser/parse_relation.h"
60 #include "parser/parse_target.h"
61 #include "parser/parse_type.h"
62 #include "parser/parse_utilcmd.h"
63 #include "parser/parser.h"
64 #include "rewrite/rewriteManip.h"
65 #include "utils/acl.h"
66 #include "utils/builtins.h"
67 #include "utils/lsyscache.h"
68 #include "utils/partcache.h"
69 #include "utils/rel.h"
70 #include "utils/ruleutils.h"
71 #include "utils/syscache.h"
72 #include "utils/typcache.h"
73 
74 
75 /* State shared by transformCreateStmt and its subroutines */
76 typedef struct
77 {
78  ParseState *pstate; /* overall parser state */
79  const char *stmtType; /* "CREATE [FOREIGN] TABLE" or "ALTER TABLE" */
80  RangeVar *relation; /* relation to create */
81  Relation rel; /* opened/locked rel, if ALTER */
82  List *inhRelations; /* relations to inherit from */
83  bool isforeign; /* true if CREATE/ALTER FOREIGN TABLE */
84  bool isalter; /* true if altering existing table */
85  List *columns; /* ColumnDef items */
86  List *ckconstraints; /* CHECK constraints */
87  List *fkconstraints; /* FOREIGN KEY constraints */
88  List *ixconstraints; /* index-creating constraints */
89  List *inh_indexes; /* cloned indexes from INCLUDING INDEXES */
90  List *extstats; /* cloned extended statistics */
91  List *blist; /* "before list" of things to do before
92  * creating the table */
93  List *alist; /* "after list" of things to do after creating
94  * the table */
95  IndexStmt *pkey; /* PRIMARY KEY index, if any */
96  bool ispartitioned; /* true if table is partitioned */
97  PartitionBoundSpec *partbound; /* transformed FOR VALUES */
98  bool ofType; /* true if statement contains OF typename */
99 } CreateStmtContext;
100 
101 /* State shared by transformCreateSchemaStmt and its subroutines */
102 typedef struct
103 {
104  const char *stmtType; /* "CREATE SCHEMA" or "ALTER SCHEMA" */
105  char *schemaname; /* name of schema */
106  RoleSpec *authrole; /* owner of schema */
107  List *sequences; /* CREATE SEQUENCE items */
108  List *tables; /* CREATE TABLE items */
109  List *views; /* CREATE VIEW items */
110  List *indexes; /* CREATE INDEX items */
111  List *triggers; /* CREATE TRIGGER items */
112  List *grants; /* GRANT items */
113 } CreateSchemaStmtContext;
114 
115 
116 static void transformColumnDefinition(CreateStmtContext *cxt,
117  ColumnDef *column);
118 static void transformTableConstraint(CreateStmtContext *cxt,
119  Constraint *constraint);
120 static void transformTableLikeClause(CreateStmtContext *cxt,
121  TableLikeClause *table_like_clause);
122 static void transformOfType(CreateStmtContext *cxt,
123  TypeName *ofTypename);
124 static CreateStatsStmt *generateClonedExtStatsStmt(RangeVar *heapRel,
125  Oid heapRelid, Oid source_statsid);
126 static List *get_collation(Oid collation, Oid actual_datatype);
127 static List *get_opclass(Oid opclass, Oid actual_datatype);
128 static void transformIndexConstraints(CreateStmtContext *cxt);
129 static IndexStmt *transformIndexConstraint(Constraint *constraint,
130  CreateStmtContext *cxt);
131 static void transformExtendedStatistics(CreateStmtContext *cxt);
132 static void transformFKConstraints(CreateStmtContext *cxt,
133  bool skipValidation,
134  bool isAddConstraint);
135 static void transformCheckConstraints(CreateStmtContext *cxt,
136  bool skipValidation);
137 static void transformConstraintAttrs(CreateStmtContext *cxt,
138  List *constraintList);
139 static void transformColumnType(CreateStmtContext *cxt, ColumnDef *column);
140 static void setSchemaName(char *context_schema, char **stmt_schema_name);
141 static void transformPartitionCmd(CreateStmtContext *cxt, PartitionCmd *cmd);
142 static List *transformPartitionRangeBounds(ParseState *pstate, List *blist,
143  Relation parent);
144 static void validateInfiniteBounds(ParseState *pstate, List *blist);
145 static Const *transformPartitionBoundValue(ParseState *pstate, Node *con,
146  const char *colName, Oid colType, int32 colTypmod,
147  Oid partCollation);
148 
149 
150 /*
151  * transformCreateStmt -
152  * parse analysis for CREATE TABLE
153  *
154  * Returns a List of utility commands to be done in sequence. One of these
155  * will be the transformed CreateStmt, but there may be additional actions
156  * to be done before and after the actual DefineRelation() call.
157  *
158  * SQL allows constraints to be scattered all over, so thumb through
159  * the columns and collect all constraints into one place.
160  * If there are any implied indices (e.g. UNIQUE or PRIMARY KEY)
161  * then expand those into multiple IndexStmt blocks.
162  * - thomas 1997-12-02
163  */
164 List *
165 transformCreateStmt(CreateStmt *stmt, const char *queryString)
166 {
167  ParseState *pstate;
168  CreateStmtContext cxt;
169  List *result;
170  List *save_alist;
171  ListCell *elements;
172  Oid namespaceid;
173  Oid existing_relid;
174  ParseCallbackState pcbstate;
175  bool is_foreign_table = IsA(stmt, CreateForeignTableStmt);
176 
177  /*
178  * We must not scribble on the passed-in CreateStmt, so copy it. (This is
179  * overkill, but easy.)
180  */
181  stmt = copyObject(stmt);
182 
183  /* Set up pstate */
184  pstate = make_parsestate(NULL);
185  pstate->p_sourcetext = queryString;
186 
187  /*
188  * Look up the creation namespace. This also checks permissions on the
189  * target namespace, locks it against concurrent drops, checks for a
190  * preexisting relation in that namespace with the same name, and updates
191  * stmt->relation->relpersistence if the selected namespace is temporary.
192  */
193  setup_parser_errposition_callback(&pcbstate, pstate,
194  stmt->relation->location);
195  namespaceid =
196  RangeVarGetAndCheckCreationNamespace(stmt->relation, NoLock,
197  &existing_relid);
198  cancel_parser_errposition_callback(&pcbstate);
199 
200  /*
201  * If the relation already exists and the user specified "IF NOT EXISTS",
202  * bail out with a NOTICE.
203  */
204  if (stmt->if_not_exists && OidIsValid(existing_relid))
205  {
206  ereport(NOTICE,
207  (errcode(ERRCODE_DUPLICATE_TABLE),
208  errmsg("relation \"%s\" already exists, skipping",
209  stmt->relation->relname)));
210  return NIL;
211  }
212 
213  /*
214  * If the target relation name isn't schema-qualified, make it so. This
215  * prevents some corner cases in which added-on rewritten commands might
216  * think they should apply to other relations that have the same name and
217  * are earlier in the search path. But a local temp table is effectively
218  * specified to be in pg_temp, so no need for anything extra in that case.
219  */
220  if (stmt->relation->schemaname == NULL
221  && stmt->relation->relpersistence != RELPERSISTENCE_TEMP)
222  stmt->relation->schemaname = get_namespace_name(namespaceid);
223 
224  /* Set up CreateStmtContext */
225  cxt.pstate = pstate;
226  if (IsA(stmt, CreateForeignTableStmt))
227  {
228  cxt.stmtType = "CREATE FOREIGN TABLE";
229  cxt.isforeign = true;
230  }
231  else
232  {
233  cxt.stmtType = "CREATE TABLE";
234  cxt.isforeign = false;
235  }
236  cxt.relation = stmt->relation;
237  cxt.rel = NULL;
238  cxt.inhRelations = stmt->inhRelations;
239  cxt.isalter = false;
240  cxt.columns = NIL;
241  cxt.ckconstraints = NIL;
242  cxt.fkconstraints = NIL;
243  cxt.ixconstraints = NIL;
244  cxt.inh_indexes = NIL;
245  cxt.extstats = NIL;
246  cxt.blist = NIL;
247  cxt.alist = NIL;
248  cxt.pkey = NULL;
249  cxt.ispartitioned = stmt->partspec != NULL;
250  cxt.partbound = stmt->partbound;
251  cxt.ofType = (stmt->ofTypename != NULL);
252 
253  Assert(!stmt->ofTypename || !stmt->inhRelations); /* grammar enforces */
254 
255  if (stmt->ofTypename)
256  transformOfType(&cxt, stmt->ofTypename);
257 
258  if (stmt->partspec)
259  {
260  if (stmt->inhRelations && !stmt->partbound)
261  ereport(ERROR,
262  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
263  errmsg("cannot create partitioned table as inheritance child")));
264  }
265 
266  /*
267  * Run through each primary element in the table creation clause. Separate
268  * column defs from constraints, and do preliminary analysis.
269  */
270  foreach(elements, stmt->tableElts)
271  {
272  Node *element = lfirst(elements);
273 
274  switch (nodeTag(element))
275  {
276  case T_ColumnDef:
277  transformColumnDefinition(&cxt, (ColumnDef *) element);
278  break;
279 
280  case T_Constraint:
281  transformTableConstraint(&cxt, (Constraint *) element);
282  break;
283 
284  case T_TableLikeClause:
285  transformTableLikeClause(&cxt, (TableLikeClause *) element);
286  break;
287 
288  default:
289  elog(ERROR, "unrecognized node type: %d",
290  (int) nodeTag(element));
291  break;
292  }
293  }
294 
295  /*
296  * Transfer anything we already have in cxt.alist into save_alist, to keep
297  * it separate from the output of transformIndexConstraints. (This may
298  * not be necessary anymore, but we'll keep doing it to preserve the
299  * historical order of execution of the alist commands.)
300  */
301  save_alist = cxt.alist;
302  cxt.alist = NIL;
303 
304  Assert(stmt->constraints == NIL);
305 
306  /*
307  * Postprocess constraints that give rise to index definitions.
308  */
309  transformIndexConstraints(&cxt);
310 
311  /*
312  * Postprocess foreign-key constraints.
313  */
314  transformFKConstraints(&cxt, true, false);
315 
316  /*
317  * Postprocess check constraints.
318  */
319  transformCheckConstraints(&cxt, !is_foreign_table ? true : false);
320 
321  /*
322  * Postprocess extended statistics.
323  */
324  transformExtendedStatistics(&cxt);
325 
326  /*
327  * Output results.
328  */
329  stmt->tableElts = cxt.columns;
330  stmt->constraints = cxt.ckconstraints;
331 
332  result = lappend(cxt.blist, stmt);
333  result = list_concat(result, cxt.alist);
334  result = list_concat(result, save_alist);
335 
336  return result;
337 }
338 
339 /*
340  * generateSerialExtraStmts
341  * Generate CREATE SEQUENCE and ALTER SEQUENCE ... OWNED BY statements
342  * to create the sequence for a serial or identity column.
343  *
344  * This includes determining the name the sequence will have. The caller
345  * can ask to get back the name components by passing non-null pointers
346  * for snamespace_p and sname_p.
347  */
348 static void
349 generateSerialExtraStmts(CreateStmtContext *cxt, ColumnDef *column,
350  Oid seqtypid, List *seqoptions,
351  bool for_identity, bool col_exists,
352  char **snamespace_p, char **sname_p)
353 {
354  ListCell *option;
355  DefElem *nameEl = NULL;
356  Oid snamespaceid;
357  char *snamespace;
358  char *sname;
359  CreateSeqStmt *seqstmt;
360  AlterSeqStmt *altseqstmt;
361  List *attnamelist;
362 
363  /*
364  * Determine namespace and name to use for the sequence.
365  *
366  * First, check if a sequence name was passed in as an option. This is
367  * used by pg_dump. Else, generate a name.
368  *
369  * Although we use ChooseRelationName, it's not guaranteed that the
370  * selected sequence name won't conflict; given sufficiently long field
371  * names, two different serial columns in the same table could be assigned
372  * the same sequence name, and we'd not notice since we aren't creating
373  * the sequence quite yet. In practice this seems quite unlikely to be a
374  * problem, especially since few people would need two serial columns in
375  * one table.
376  */
377  foreach(option, seqoptions)
378  {
379  DefElem *defel = lfirst_node(DefElem, option);
380 
381  if (strcmp(defel->defname, "sequence_name") == 0)
382  {
383  if (nameEl)
384  ereport(ERROR,
385  (errcode(ERRCODE_SYNTAX_ERROR),
386  errmsg("conflicting or redundant options")));
387  nameEl = defel;
388  }
389  }
390 
391  if (nameEl)
392  {
393  RangeVar *rv = makeRangeVarFromNameList(castNode(List, nameEl->arg));
394 
395  snamespace = rv->schemaname;
396  if (!snamespace)
397  {
398  /* Given unqualified SEQUENCE NAME, select namespace */
399  if (cxt->rel)
400  snamespaceid = RelationGetNamespace(cxt->rel);
401  else
402  snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
403  snamespace = get_namespace_name(snamespaceid);
404  }
405  sname = rv->relname;
406  /* Remove the SEQUENCE NAME item from seqoptions */
407  seqoptions = list_delete_ptr(seqoptions, nameEl);
408  }
409  else
410  {
411  if (cxt->rel)
412  snamespaceid = RelationGetNamespace(cxt->rel);
413  else
414  {
415  snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
416  RangeVarAdjustRelationPersistence(cxt->relation, snamespaceid);
417  }
418  snamespace = get_namespace_name(snamespaceid);
419  sname = ChooseRelationName(cxt->relation->relname,
420  column->colname,
421  "seq",
422  snamespaceid,
423  false);
424  }
425 
426  ereport(DEBUG1,
427  (errmsg("%s will create implicit sequence \"%s\" for serial column \"%s.%s\"",
428  cxt->stmtType, sname,
429  cxt->relation->relname, column->colname)));
430 
431  /*
432  * Build a CREATE SEQUENCE command to create the sequence object, and add
433  * it to the list of things to be done before this CREATE/ALTER TABLE.
434  */
435  seqstmt = makeNode(CreateSeqStmt);
436  seqstmt->for_identity = for_identity;
437  seqstmt->sequence = makeRangeVar(snamespace, sname, -1);
438  seqstmt->options = seqoptions;
439 
440  /*
441  * If a sequence data type was specified, add it to the options. Prepend
442  * to the list rather than append; in case a user supplied their own AS
443  * clause, the "redundant options" error will point to their occurrence,
444  * not our synthetic one.
445  */
446  if (seqtypid)
447  seqstmt->options = lcons(makeDefElem("as",
448  (Node *) makeTypeNameFromOid(seqtypid, -1),
449  -1),
450  seqstmt->options);
451 
452  /*
453  * If this is ALTER ADD COLUMN, make sure the sequence will be owned by
454  * the table's owner. The current user might be someone else (perhaps a
455  * superuser, or someone who's only a member of the owning role), but the
456  * SEQUENCE OWNED BY mechanisms will bleat unless table and sequence have
457  * exactly the same owning role.
458  */
459  if (cxt->rel)
460  seqstmt->ownerId = cxt->rel->rd_rel->relowner;
461  else
462  seqstmt->ownerId = InvalidOid;
463 
464  cxt->blist = lappend(cxt->blist, seqstmt);
465 
466  /*
467  * Store the identity sequence name that we decided on. ALTER TABLE ...
468  * ADD COLUMN ... IDENTITY needs this so that it can fill the new column
469  * with values from the sequence, while the association of the sequence
470  * with the table is not set until after the ALTER TABLE.
471  */
472  column->identitySequence = seqstmt->sequence;
473 
474  /*
475  * Build an ALTER SEQUENCE ... OWNED BY command to mark the sequence as
476  * owned by this column, and add it to the appropriate list of things to
477  * be done along with this CREATE/ALTER TABLE. In a CREATE or ALTER ADD
478  * COLUMN, it must be done after the statement because we don't know the
479  * column's attnum yet. But if we do have the attnum (in AT_AddIdentity),
480  * we can do the marking immediately, which improves some ALTER TABLE
481  * behaviors.
482  */
483  altseqstmt = makeNode(AlterSeqStmt);
484  altseqstmt->sequence = makeRangeVar(snamespace, sname, -1);
485  attnamelist = list_make3(makeString(snamespace),
486  makeString(cxt->relation->relname),
487  makeString(column->colname));
488  altseqstmt->options = list_make1(makeDefElem("owned_by",
489  (Node *) attnamelist, -1));
490  altseqstmt->for_identity = for_identity;
491 
492  if (col_exists)
493  cxt->blist = lappend(cxt->blist, altseqstmt);
494  else
495  cxt->alist = lappend(cxt->alist, altseqstmt);
496 
497  if (snamespace_p)
498  *snamespace_p = snamespace;
499  if (sname_p)
500  *sname_p = sname;
501 }
502 
503 /*
504  * transformColumnDefinition -
505  * transform a single ColumnDef within CREATE TABLE
506  * Also used in ALTER TABLE ADD COLUMN
507  */
508 static void
509 transformColumnDefinition(CreateStmtContext *cxt, ColumnDef *column)
510 {
511  bool is_serial;
512  bool saw_nullable;
513  bool saw_default;
514  bool saw_identity;
515  bool saw_generated;
516  ListCell *clist;
517 
518  cxt->columns = lappend(cxt->columns, column);
519 
520  /* Check for SERIAL pseudo-types */
521  is_serial = false;
522  if (column->typeName
523  && list_length(column->typeName->names) == 1
524  && !column->typeName->pct_type)
525  {
526  char *typname = strVal(linitial(column->typeName->names));
527 
528  if (strcmp(typname, "smallserial") == 0 ||
529  strcmp(typname, "serial2") == 0)
530  {
531  is_serial = true;
532  column->typeName->names = NIL;
533  column->typeName->typeOid = INT2OID;
534  }
535  else if (strcmp(typname, "serial") == 0 ||
536  strcmp(typname, "serial4") == 0)
537  {
538  is_serial = true;
539  column->typeName->names = NIL;
540  column->typeName->typeOid = INT4OID;
541  }
542  else if (strcmp(typname, "bigserial") == 0 ||
543  strcmp(typname, "serial8") == 0)
544  {
545  is_serial = true;
546  column->typeName->names = NIL;
547  column->typeName->typeOid = INT8OID;
548  }
549 
550  /*
551  * We have to reject "serial[]" explicitly, because once we've set
552  * typeid, LookupTypeName won't notice arrayBounds. We don't need any
553  * special coding for serial(typmod) though.
554  */
555  if (is_serial && column->typeName->arrayBounds != NIL)
556  ereport(ERROR,
557  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
558  errmsg("array of serial is not implemented"),
559  parser_errposition(cxt->pstate,
560  column->typeName->location)));
561  }
562 
563  /* Do necessary work on the column type declaration */
564  if (column->typeName)
565  transformColumnType(cxt, column);
566 
567  /* Special actions for SERIAL pseudo-types */
568  if (is_serial)
569  {
570  char *snamespace;
571  char *sname;
572  char *qstring;
573  A_Const *snamenode;
574  TypeCast *castnode;
575  FuncCall *funccallnode;
576  Constraint *constraint;
577 
578  generateSerialExtraStmts(cxt, column,
579  column->typeName->typeOid, NIL,
580  false, false,
581  &snamespace, &sname);
582 
583  /*
584  * Create appropriate constraints for SERIAL. We do this in full,
585  * rather than shortcutting, so that we will detect any conflicting
586  * constraints the user wrote (like a different DEFAULT).
587  *
588  * Create an expression tree representing the function call
589  * nextval('sequencename'). We cannot reduce the raw tree to cooked
590  * form until after the sequence is created, but there's no need to do
591  * so.
592  */
593  qstring = quote_qualified_identifier(snamespace, sname);
594  snamenode = makeNode(A_Const);
595  snamenode->val.type = T_String;
596  snamenode->val.val.str = qstring;
597  snamenode->location = -1;
598  castnode = makeNode(TypeCast);
599  castnode->typeName = SystemTypeName("regclass");
600  castnode->arg = (Node *) snamenode;
601  castnode->location = -1;
602  funccallnode = makeFuncCall(SystemFuncName("nextval"),
603  list_make1(castnode),
604  -1);
605  constraint = makeNode(Constraint);
606  constraint->contype = CONSTR_DEFAULT;
607  constraint->location = -1;
608  constraint->raw_expr = (Node *) funccallnode;
609  constraint->cooked_expr = NULL;
610  column->constraints = lappend(column->constraints, constraint);
611 
612  constraint = makeNode(Constraint);
613  constraint->contype = CONSTR_NOTNULL;
614  constraint->location = -1;
615  column->constraints = lappend(column->constraints, constraint);
616  }
617 
618  /* Process column constraints, if any... */
619  transformConstraintAttrs(cxt, column->constraints);
620 
621  saw_nullable = false;
622  saw_default = false;
623  saw_identity = false;
624  saw_generated = false;
625 
626  foreach(clist, column->constraints)
627  {
628  Constraint *constraint = lfirst_node(Constraint, clist);
629 
630  switch (constraint->contype)
631  {
632  case CONSTR_NULL:
633  if (saw_nullable && column->is_not_null)
634  ereport(ERROR,
635  (errcode(ERRCODE_SYNTAX_ERROR),
636  errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
637  column->colname, cxt->relation->relname),
638  parser_errposition(cxt->pstate,
639  constraint->location)));
640  column->is_not_null = false;
641  saw_nullable = true;
642  break;
643 
644  case CONSTR_NOTNULL:
645  if (saw_nullable && !column->is_not_null)
646  ereport(ERROR,
647  (errcode(ERRCODE_SYNTAX_ERROR),
648  errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
649  column->colname, cxt->relation->relname),
650  parser_errposition(cxt->pstate,
651  constraint->location)));
652  column->is_not_null = true;
653  saw_nullable = true;
654  break;
655 
656  case CONSTR_DEFAULT:
657  if (saw_default)
658  ereport(ERROR,
659  (errcode(ERRCODE_SYNTAX_ERROR),
660  errmsg("multiple default values specified for column \"%s\" of table \"%s\"",
661  column->colname, cxt->relation->relname),
662  parser_errposition(cxt->pstate,
663  constraint->location)));
664  column->raw_default = constraint->raw_expr;
665  Assert(constraint->cooked_expr == NULL);
666  saw_default = true;
667  break;
668 
669  case CONSTR_IDENTITY:
670  {
671  Type ctype;
672  Oid typeOid;
673 
674  if (cxt->ofType)
675  ereport(ERROR,
676  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
677  errmsg("identity columns are not supported on typed tables")));
678  if (cxt->partbound)
679  ereport(ERROR,
680  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
681  errmsg("identity columns are not supported on partitions")));
682 
683  ctype = typenameType(cxt->pstate, column->typeName, NULL);
684  typeOid = ((Form_pg_type) GETSTRUCT(ctype))->oid;
685  ReleaseSysCache(ctype);
686 
687  if (saw_identity)
688  ereport(ERROR,
689  (errcode(ERRCODE_SYNTAX_ERROR),
690  errmsg("multiple identity specifications for column \"%s\" of table \"%s\"",
691  column->colname, cxt->relation->relname),
692  parser_errposition(cxt->pstate,
693  constraint->location)));
694 
695  generateSerialExtraStmts(cxt, column,
696  typeOid, constraint->options,
697  true, false,
698  NULL, NULL);
699 
700  column->identity = constraint->generated_when;
701  saw_identity = true;
702  column->is_not_null = true;
703  break;
704  }
705 
706  case CONSTR_GENERATED:
707  if (cxt->ofType)
708  ereport(ERROR,
709  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
710  errmsg("generated columns are not supported on typed tables")));
711  if (cxt->partbound)
712  ereport(ERROR,
713  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
714  errmsg("generated columns are not supported on partitions")));
715 
716  if (saw_generated)
717  ereport(ERROR,
718  (errcode(ERRCODE_SYNTAX_ERROR),
719  errmsg("multiple generation clauses specified for column \"%s\" of table \"%s\"",
720  column->colname, cxt->relation->relname),
721  parser_errposition(cxt->pstate,
722  constraint->location)));
723  column->generated = ATTRIBUTE_GENERATED_STORED;
724  column->raw_default = constraint->raw_expr;
725  Assert(constraint->cooked_expr == NULL);
726  saw_generated = true;
727  break;
728 
729  case CONSTR_CHECK:
730  cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
731  break;
732 
733  case CONSTR_PRIMARY:
734  if (cxt->isforeign)
735  ereport(ERROR,
736  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
737  errmsg("primary key constraints are not supported on foreign tables"),
738  parser_errposition(cxt->pstate,
739  constraint->location)));
740  /* FALL THRU */
741 
742  case CONSTR_UNIQUE:
743  if (cxt->isforeign)
744  ereport(ERROR,
745  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
746  errmsg("unique constraints are not supported on foreign tables"),
747  parser_errposition(cxt->pstate,
748  constraint->location)));
749  if (constraint->keys == NIL)
750  constraint->keys = list_make1(makeString(column->colname));
751  cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
752  break;
753 
754  case CONSTR_EXCLUSION:
755  /* grammar does not allow EXCLUDE as a column constraint */
756  elog(ERROR, "column exclusion constraints are not supported");
757  break;
758 
759  case CONSTR_FOREIGN:
760  if (cxt->isforeign)
761  ereport(ERROR,
762  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
763  errmsg("foreign key constraints are not supported on foreign tables"),
764  parser_errposition(cxt->pstate,
765  constraint->location)));
766 
767  /*
768  * Fill in the current attribute's name and throw it into the
769  * list of FK constraints to be processed later.
770  */
771  constraint->fk_attrs = list_make1(makeString(column->colname));
772  cxt->fkconstraints = lappend(cxt->fkconstraints, constraint);
773  break;
774 
775  case CONSTR_ATTR_DEFERRABLE:
776  case CONSTR_ATTR_NOT_DEFERRABLE:
777  case CONSTR_ATTR_DEFERRED:
778  case CONSTR_ATTR_IMMEDIATE:
779  /* transformConstraintAttrs took care of these */
780  break;
781 
782  default:
783  elog(ERROR, "unrecognized constraint type: %d",
784  constraint->contype);
785  break;
786  }
787 
788  if (saw_default && saw_identity)
789  ereport(ERROR,
790  (errcode(ERRCODE_SYNTAX_ERROR),
791  errmsg("both default and identity specified for column \"%s\" of table \"%s\"",
792  column->colname, cxt->relation->relname),
793  parser_errposition(cxt->pstate,
794  constraint->location)));
795 
796  if (saw_default && saw_generated)
797  ereport(ERROR,
798  (errcode(ERRCODE_SYNTAX_ERROR),
799  errmsg("both default and generation expression specified for column \"%s\" of table \"%s\"",
800  column->colname, cxt->relation->relname),
801  parser_errposition(cxt->pstate,
802  constraint->location)));
803 
804  if (saw_identity && saw_generated)
805  ereport(ERROR,
806  (errcode(ERRCODE_SYNTAX_ERROR),
807  errmsg("both identity and generation expression specified for column \"%s\" of table \"%s\"",
808  column->colname, cxt->relation->relname),
809  parser_errposition(cxt->pstate,
810  constraint->location)));
811  }
812 
813  /*
814  * If needed, generate ALTER FOREIGN TABLE ALTER COLUMN statement to add
815  * per-column foreign data wrapper options to this column after creation.
816  */
817  if (column->fdwoptions != NIL)
818  {
819  AlterTableStmt *stmt;
820  AlterTableCmd *cmd;
821 
822  cmd = makeNode(AlterTableCmd);
823  cmd->subtype = AT_AlterColumnGenericOptions;
824  cmd->name = column->colname;
825  cmd->def = (Node *) column->fdwoptions;
826  cmd->behavior = DROP_RESTRICT;
827  cmd->missing_ok = false;
828 
829  stmt = makeNode(AlterTableStmt);
830  stmt->relation = cxt->relation;
831  stmt->cmds = NIL;
832  stmt->relkind = OBJECT_FOREIGN_TABLE;
833  stmt->cmds = lappend(stmt->cmds, cmd);
834 
835  cxt->alist = lappend(cxt->alist, stmt);
836  }
837 }
838 
839 /*
840  * transformTableConstraint
841  * transform a Constraint node within CREATE TABLE or ALTER TABLE
842  */
843 static void
844 transformTableConstraint(CreateStmtContext *cxt, Constraint *constraint)
845 {
846  switch (constraint->contype)
847  {
848  case CONSTR_PRIMARY:
849  if (cxt->isforeign)
850  ereport(ERROR,
851  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
852  errmsg("primary key constraints are not supported on foreign tables"),
853  parser_errposition(cxt->pstate,
854  constraint->location)));
855  cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
856  break;
857 
858  case CONSTR_UNIQUE:
859  if (cxt->isforeign)
860  ereport(ERROR,
861  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
862  errmsg("unique constraints are not supported on foreign tables"),
863  parser_errposition(cxt->pstate,
864  constraint->location)));
865  cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
866  break;
867 
868  case CONSTR_EXCLUSION:
869  if (cxt->isforeign)
870  ereport(ERROR,
871  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
872  errmsg("exclusion constraints are not supported on foreign tables"),
873  parser_errposition(cxt->pstate,
874  constraint->location)));
875  if (cxt->ispartitioned)
876  ereport(ERROR,
877  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
878  errmsg("exclusion constraints are not supported on partitioned tables"),
879  parser_errposition(cxt->pstate,
880  constraint->location)));
881  cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
882  break;
883 
884  case CONSTR_CHECK:
885  cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
886  break;
887 
888  case CONSTR_FOREIGN:
889  if (cxt->isforeign)
890  ereport(ERROR,
891  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
892  errmsg("foreign key constraints are not supported on foreign tables"),
893  parser_errposition(cxt->pstate,
894  constraint->location)));
895  cxt->fkconstraints = lappend(cxt->fkconstraints, constraint);
896  break;
897 
898  case CONSTR_NULL:
899  case CONSTR_NOTNULL:
900  case CONSTR_DEFAULT:
901  case CONSTR_ATTR_DEFERRABLE:
902  case CONSTR_ATTR_NOT_DEFERRABLE:
903  case CONSTR_ATTR_DEFERRED:
904  case CONSTR_ATTR_IMMEDIATE:
905  elog(ERROR, "invalid context for constraint type %d",
906  constraint->contype);
907  break;
908 
909  default:
910  elog(ERROR, "unrecognized constraint type: %d",
911  constraint->contype);
912  break;
913  }
914 }
915 
916 /*
917  * transformTableLikeClause
918  *
919  * Change the LIKE <srctable> portion of a CREATE TABLE statement into
920  * column definitions which recreate the user defined column portions of
921  * <srctable>.
922  */
923 static void
924 transformTableLikeClause(CreateStmtContext *cxt, TableLikeClause *table_like_clause)
925 {
926  AttrNumber parent_attno;
927  Relation relation;
928  TupleDesc tupleDesc;
929  TupleConstr *constr;
930  AttrMap *attmap;
931  AclResult aclresult;
932  char *comment;
933  ParseCallbackState pcbstate;
934 
935  setup_parser_errposition_callback(&pcbstate, cxt->pstate,
936  table_like_clause->relation->location);
937 
938  /* we could support LIKE in many cases, but worry about it another day */
939  if (cxt->isforeign)
940  ereport(ERROR,
941  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
942  errmsg("LIKE is not supported for creating foreign tables")));
943 
944  relation = relation_openrv(table_like_clause->relation, AccessShareLock);
945 
946  if (relation->rd_rel->relkind != RELKIND_RELATION &&
947  relation->rd_rel->relkind != RELKIND_VIEW &&
948  relation->rd_rel->relkind != RELKIND_MATVIEW &&
949  relation->rd_rel->relkind != RELKIND_COMPOSITE_TYPE &&
950  relation->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
951  relation->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
952  ereport(ERROR,
953  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
954  errmsg("\"%s\" is not a table, view, materialized view, composite type, or foreign table",
955  RelationGetRelationName(relation))));
956 
957  cancel_parser_errposition_callback(&pcbstate);
958 
959  /*
960  * Check for privileges
961  */
962  if (relation->rd_rel->relkind == RELKIND_COMPOSITE_TYPE)
963  {
964  aclresult = pg_type_aclcheck(relation->rd_rel->reltype, GetUserId(),
965  ACL_USAGE);
966  if (aclresult != ACLCHECK_OK)
967  aclcheck_error(aclresult, OBJECT_TYPE,
968  RelationGetRelationName(relation));
969  }
970  else
971  {
972  aclresult = pg_class_aclcheck(RelationGetRelid(relation), GetUserId(),
973  ACL_SELECT);
974  if (aclresult != ACLCHECK_OK)
975  aclcheck_error(aclresult, get_relkind_objtype(relation->rd_rel->relkind),
976  RelationGetRelationName(relation));
977  }
978 
979  tupleDesc = RelationGetDescr(relation);
980  constr = tupleDesc->constr;
981 
982  /*
983  * Initialize column number map for map_variable_attnos(). We need this
984  * since dropped columns in the source table aren't copied, so the new
985  * table can have different column numbers.
986  */
987  attmap = make_attrmap(tupleDesc->natts);
988 
989  /*
990  * Insert the copied attributes into the cxt for the new table definition.
991  */
992  for (parent_attno = 1; parent_attno <= tupleDesc->natts;
993  parent_attno++)
994  {
995  Form_pg_attribute attribute = TupleDescAttr(tupleDesc,
996  parent_attno - 1);
997  char *attributeName = NameStr(attribute->attname);
998  ColumnDef *def;
999 
1000  /*
1001  * Ignore dropped columns in the parent. attmap entry is left zero.
1002  */
1003  if (attribute->attisdropped)
1004  continue;
1005 
1006  /*
1007  * Create a new column, which is marked as NOT inherited.
1008  *
1009  * For constraints, ONLY the NOT NULL constraint is inherited by the
1010  * new column definition per SQL99.
1011  */
1012  def = makeNode(ColumnDef);
1013  def->colname = pstrdup(attributeName);
1014  def->typeName = makeTypeNameFromOid(attribute->atttypid,
1015  attribute->atttypmod);
1016  def->inhcount = 0;
1017  def->is_local = true;
1018  def->is_not_null = attribute->attnotnull;
1019  def->is_from_type = false;
1020  def->storage = 0;
1021  def->raw_default = NULL;
1022  def->cooked_default = NULL;
1023  def->collClause = NULL;
1024  def->collOid = attribute->attcollation;
1025  def->constraints = NIL;
1026  def->location = -1;
1027 
1028  /*
1029  * Add to column list
1030  */
1031  cxt->columns = lappend(cxt->columns, def);
1032 
1033  attmap->attnums[parent_attno - 1] = list_length(cxt->columns);
1034 
1035  /*
1036  * Copy default, if present and it should be copied. We have separate
1037  * options for plain default expressions and GENERATED defaults.
1038  */
1039  if (attribute->atthasdef &&
1040  (attribute->attgenerated ?
1041  (table_like_clause->options & CREATE_TABLE_LIKE_GENERATED) :
1042  (table_like_clause->options & CREATE_TABLE_LIKE_DEFAULTS)))
1043  {
1044  Node *this_default = NULL;
1045  AttrDefault *attrdef;
1046  int i;
1047  bool found_whole_row;
1048 
1049  /* Find default in constraint structure */
1050  Assert(constr != NULL);
1051  attrdef = constr->defval;
1052  for (i = 0; i < constr->num_defval; i++)
1053  {
1054  if (attrdef[i].adnum == parent_attno)
1055  {
1056  this_default = stringToNode(attrdef[i].adbin);
1057  break;
1058  }
1059  }
1060  Assert(this_default != NULL);
1061 
1062  def->cooked_default = map_variable_attnos(this_default,
1063  1, 0,
1064  attmap,
1065  InvalidOid, &found_whole_row);
1066 
1067  /*
1068  * Prevent this for the same reason as for constraints below. Note
1069  * that defaults cannot contain any vars, so it's OK that the
1070  * error message refers to generated columns.
1071  */
1072  if (found_whole_row)
1073  ereport(ERROR,
1074  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1075  errmsg("cannot convert whole-row table reference"),
1076  errdetail("Generation expression for column \"%s\" contains a whole-row reference to table \"%s\".",
1077  attributeName,
1078  RelationGetRelationName(relation))));
1079 
1080  def->generated = attribute->attgenerated;
1081  }
1082 
1083  /*
1084  * Copy identity if requested
1085  */
1086  if (attribute->attidentity &&
1087  (table_like_clause->options & CREATE_TABLE_LIKE_IDENTITY))
1088  {
1089  Oid seq_relid;
1090  List *seq_options;
1091 
1092  /*
1093  * find sequence owned by old column; extract sequence parameters;
1094  * build new create sequence command
1095  */
1096  seq_relid = getIdentitySequence(RelationGetRelid(relation), attribute->attnum, false);
1097  seq_options = sequence_options(seq_relid);
1098  generateSerialExtraStmts(cxt, def,
1099  InvalidOid, seq_options,
1100  true, false,
1101  NULL, NULL);
1102  def->identity = attribute->attidentity;
1103  }
1104 
1105  /* Likewise, copy storage if requested */
1106  if (table_like_clause->options & CREATE_TABLE_LIKE_STORAGE)
1107  def->storage = attribute->attstorage;
1108  else
1109  def->storage = 0;
1110 
1111  /* Likewise, copy comment if requested */
1112  if ((table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS) &&
1113  (comment = GetComment(attribute->attrelid,
1114  RelationRelationId,
1115  attribute->attnum)) != NULL)
1116  {
1117  CommentStmt *stmt = makeNode(CommentStmt);
1118 
1119  stmt->objtype = OBJECT_COLUMN;
1120  stmt->object = (Node *) list_make3(makeString(cxt->relation->schemaname),
1121  makeString(cxt->relation->relname),
1122  makeString(def->colname));
1123  stmt->comment = comment;
1124 
1125  cxt->alist = lappend(cxt->alist, stmt);
1126  }
1127  }
1128 
1129  /*
1130  * Copy CHECK constraints if requested, being careful to adjust attribute
1131  * numbers so they match the child.
1132  */
1133  if ((table_like_clause->options & CREATE_TABLE_LIKE_CONSTRAINTS) &&
1134  tupleDesc->constr)
1135  {
1136  int ccnum;
1137 
1138  for (ccnum = 0; ccnum < tupleDesc->constr->num_check; ccnum++)
1139  {
1140  char *ccname = tupleDesc->constr->check[ccnum].ccname;
1141  char *ccbin = tupleDesc->constr->check[ccnum].ccbin;
1142  Constraint *n = makeNode(Constraint);
1143  Node *ccbin_node;
1144  bool found_whole_row;
1145 
1146  ccbin_node = map_variable_attnos(stringToNode(ccbin),
1147  1, 0,
1148  attmap,
1149  InvalidOid, &found_whole_row);
1150 
1151  /*
1152  * We reject whole-row variables because the whole point of LIKE
1153  * is that the new table's rowtype might later diverge from the
1154  * parent's. So, while translation might be possible right now,
1155  * it wouldn't be possible to guarantee it would work in future.
1156  */
1157  if (found_whole_row)
1158  ereport(ERROR,
1159  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1160  errmsg("cannot convert whole-row table reference"),
1161  errdetail("Constraint \"%s\" contains a whole-row reference to table \"%s\".",
1162  ccname,
1163  RelationGetRelationName(relation))));
1164 
1165  n->contype = CONSTR_CHECK;
1166  n->location = -1;
1167  n->conname = pstrdup(ccname);
1168  n->raw_expr = NULL;
1169  n->cooked_expr = nodeToString(ccbin_node);
1170  cxt->ckconstraints = lappend(cxt->ckconstraints, n);
1171 
1172  /* Copy comment on constraint */
1173  if ((table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS) &&
1174  (comment = GetComment(get_relation_constraint_oid(RelationGetRelid(relation),
1175  n->conname, false),
1176  ConstraintRelationId,
1177  0)) != NULL)
1178  {
1179  CommentStmt *stmt = makeNode(CommentStmt);
1180 
1181  stmt->objtype = OBJECT_TABCONSTRAINT;
1182  stmt->object = (Node *) list_make3(makeString(cxt->relation->schemaname),
1183  makeString(cxt->relation->relname),
1184  makeString(n->conname));
1185  stmt->comment = comment;
1186 
1187  cxt->alist = lappend(cxt->alist, stmt);
1188  }
1189  }
1190  }
1191 
1192  /*
1193  * Likewise, copy indexes if requested
1194  */
1195  if ((table_like_clause->options & CREATE_TABLE_LIKE_INDEXES) &&
1196  relation->rd_rel->relhasindex)
1197  {
1198  List *parent_indexes;
1199  ListCell *l;
1200 
1201  parent_indexes = RelationGetIndexList(relation);
1202 
1203  foreach(l, parent_indexes)
1204  {
1205  Oid parent_index_oid = lfirst_oid(l);
1206  Relation parent_index;
1207  IndexStmt *index_stmt;
1208 
1209  parent_index = index_open(parent_index_oid, AccessShareLock);
1210 
1211  /* Build CREATE INDEX statement to recreate the parent_index */
1212  index_stmt = generateClonedIndexStmt(cxt->relation,
1213  parent_index,
1214  attmap,
1215  NULL);
1216 
1217  /* Copy comment on index, if requested */
1218  if (table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS)
1219  {
1220  comment = GetComment(parent_index_oid, RelationRelationId, 0);
1221 
1222  /*
1223  * We make use of IndexStmt's idxcomment option, so as not to
1224  * need to know now what name the index will have.
1225  */
1226  index_stmt->idxcomment = comment;
1227  }
1228 
1229  /* Save it in the inh_indexes list for the time being */
1230  cxt->inh_indexes = lappend(cxt->inh_indexes, index_stmt);
1231 
1232  index_close(parent_index, AccessShareLock);
1233  }
1234  }
1235 
1236  /*
1237  * Likewise, copy extended statistics if requested
1238  */
1239  if (table_like_clause->options & CREATE_TABLE_LIKE_STATISTICS)
1240  {
1241  List *parent_extstats;
1242  ListCell *l;
1243 
1244  parent_extstats = RelationGetStatExtList(relation);
1245 
1246  foreach(l, parent_extstats)
1247  {
1248  Oid parent_stat_oid = lfirst_oid(l);
1249  CreateStatsStmt *stats_stmt;
1250 
1251  stats_stmt = generateClonedExtStatsStmt(cxt->relation,
1252  RelationGetRelid(relation),
1253  parent_stat_oid);
1254 
1255  /* Copy comment on statistics object, if requested */
1256  if (table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS)
1257  {
1258  comment = GetComment(parent_stat_oid, StatisticExtRelationId, 0);
1259 
1260  /*
1261  * We make use of CreateStatsStmt's stxcomment option, so as
1262  * not to need to know now what name the statistics will have.
1263  */
1264  stats_stmt->stxcomment = comment;
1265  }
1266 
1267  cxt->extstats = lappend(cxt->extstats, stats_stmt);
1268  }
1269 
1270  list_free(parent_extstats);
1271  }
1272 
1273  /*
1274  * Close the parent rel, but keep our AccessShareLock on it until xact
1275  * commit. That will prevent someone else from deleting or ALTERing the
1276  * parent before the child is committed.
1277  */
1278  table_close(relation, NoLock);
1279 }
1280 
1281 static void
1282 transformOfType(CreateStmtContext *cxt, TypeName *ofTypename)
1283 {
1284  HeapTuple tuple;
1285  TupleDesc tupdesc;
1286  int i;
1287  Oid ofTypeId;
1288 
1289  AssertArg(ofTypename);
1290 
1291  tuple = typenameType(NULL, ofTypename, NULL);
1292  check_of_type(tuple);
1293  ofTypeId = ((Form_pg_type) GETSTRUCT(tuple))->oid;
1294  ofTypename->typeOid = ofTypeId; /* cached for later */
1295 
1296  tupdesc = lookup_rowtype_tupdesc(ofTypeId, -1);
1297  for (i = 0; i < tupdesc->natts; i++)
1298  {
1299  Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
1300  ColumnDef *n;
1301 
1302  if (attr->attisdropped)
1303  continue;
1304 
1305  n = makeNode(ColumnDef);
1306  n->colname = pstrdup(NameStr(attr->attname));
1307  n->typeName = makeTypeNameFromOid(attr->atttypid, attr->atttypmod);
1308  n->inhcount = 0;
1309  n->is_local = true;
1310  n->is_not_null = false;
1311  n->is_from_type = true;
1312  n->storage = 0;
1313  n->raw_default = NULL;
1314  n->cooked_default = NULL;
1315  n->collClause = NULL;
1316  n->collOid = attr->attcollation;
1317  n->constraints = NIL;
1318  n->location = -1;
1319  cxt->columns = lappend(cxt->columns, n);
1320  }
1321  DecrTupleDescRefCount(tupdesc);
1322 
1323  ReleaseSysCache(tuple);
1324 }
1325 
1326 /*
1327  * Generate an IndexStmt node using information from an already existing index
1328  * "source_idx".
1329  *
1330  * heapRel is stored into the IndexStmt's relation field, but we don't use it
1331  * otherwise; some callers pass NULL, if they don't need it to be valid.
1332  * (The target relation might not exist yet, so we mustn't try to access it.)
1333  *
1334  * Attribute numbers in expression Vars are adjusted according to attmap.
1335  *
1336  * If constraintOid isn't NULL, we store the OID of any constraint associated
1337  * with the index there.
1338  *
1339  * Unlike transformIndexConstraint, we don't make any effort to force primary
1340  * key columns to be NOT NULL. The larger cloning process this is part of
1341  * should have cloned their NOT NULL status separately (and DefineIndex will
1342  * complain if that fails to happen).
1343  */
1344 IndexStmt *
1345 generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx,
1346  const AttrMap *attmap,
1347  Oid *constraintOid)
1348 {
1349  Oid source_relid = RelationGetRelid(source_idx);
1350  HeapTuple ht_idxrel;
1351  HeapTuple ht_idx;
1352  HeapTuple ht_am;
1353  Form_pg_class idxrelrec;
1354  Form_pg_index idxrec;
1355  Form_pg_am amrec;
1356  oidvector *indcollation;
1357  oidvector *indclass;
1358  IndexStmt *index;
1359  List *indexprs;
1360  ListCell *indexpr_item;
1361  Oid indrelid;
1362  int keyno;
1363  Oid keycoltype;
1364  Datum datum;
1365  bool isnull;
1366 
1367  if (constraintOid)
1368  *constraintOid = InvalidOid;
1369 
1370  /*
1371  * Fetch pg_class tuple of source index. We can't use the copy in the
1372  * relcache entry because it doesn't include optional fields.
1373  */
1374  ht_idxrel = SearchSysCache1(RELOID, ObjectIdGetDatum(source_relid));
1375  if (!HeapTupleIsValid(ht_idxrel))
1376  elog(ERROR, "cache lookup failed for relation %u", source_relid);
1377  idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
1378 
1379  /* Fetch pg_index tuple for source index from relcache entry */
1380  ht_idx = source_idx->rd_indextuple;
1381  idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
1382  indrelid = idxrec->indrelid;
1383 
1384  /* Fetch the pg_am tuple of the index' access method */
1385  ht_am = SearchSysCache1(AMOID, ObjectIdGetDatum(idxrelrec->relam));
1386  if (!HeapTupleIsValid(ht_am))
1387  elog(ERROR, "cache lookup failed for access method %u",
1388  idxrelrec->relam);
1389  amrec = (Form_pg_am) GETSTRUCT(ht_am);
1390 
1391  /* Extract indcollation from the pg_index tuple */
1392  datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1393  Anum_pg_index_indcollation, &isnull);
1394  Assert(!isnull);
1395  indcollation = (oidvector *) DatumGetPointer(datum);
1396 
1397  /* Extract indclass from the pg_index tuple */
1398  datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1399  Anum_pg_index_indclass, &isnull);
1400  Assert(!isnull);
1401  indclass = (oidvector *) DatumGetPointer(datum);
1402 
1403  /* Begin building the IndexStmt */
1404  index = makeNode(IndexStmt);
1405  index->relation = heapRel;
1406  index->accessMethod = pstrdup(NameStr(amrec->amname));
1407  if (OidIsValid(idxrelrec->reltablespace))
1408  index->tableSpace = get_tablespace_name(idxrelrec->reltablespace);
1409  else
1410  index->tableSpace = NULL;
1411  index->excludeOpNames = NIL;
1412  index->idxcomment = NULL;
1413  index->indexOid = InvalidOid;
1414  index->oldNode = InvalidOid;
1415  index->unique = idxrec->indisunique;
1416  index->primary = idxrec->indisprimary;
1417  index->transformed = true; /* don't need transformIndexStmt */
1418  index->concurrent = false;
1419  index->if_not_exists = false;
1420  index->reset_default_tblspc = false;
1421 
1422  /*
1423  * We don't try to preserve the name of the source index; instead, just
1424  * let DefineIndex() choose a reasonable name. (If we tried to preserve
1425  * the name, we'd get duplicate-relation-name failures unless the source
1426  * table was in a different schema.)
1427  */
1428  index->idxname = NULL;
1429 
1430  /*
1431  * If the index is marked PRIMARY or has an exclusion condition, it's
1432  * certainly from a constraint; else, if it's not marked UNIQUE, it
1433  * certainly isn't. If it is or might be from a constraint, we have to
1434  * fetch the pg_constraint record.
1435  */
1436  if (index->primary || index->unique || idxrec->indisexclusion)
1437  {
1438  Oid constraintId = get_index_constraint(source_relid);
1439 
1440  if (OidIsValid(constraintId))
1441  {
1442  HeapTuple ht_constr;
1443  Form_pg_constraint conrec;
1444 
1445  if (constraintOid)
1446  *constraintOid = constraintId;
1447 
1448  ht_constr = SearchSysCache1(CONSTROID,
1449  ObjectIdGetDatum(constraintId));
1450  if (!HeapTupleIsValid(ht_constr))
1451  elog(ERROR, "cache lookup failed for constraint %u",
1452  constraintId);
1453  conrec = (Form_pg_constraint) GETSTRUCT(ht_constr);
1454 
1455  index->isconstraint = true;
1456  index->deferrable = conrec->condeferrable;
1457  index->initdeferred = conrec->condeferred;
1458 
1459  /* If it's an exclusion constraint, we need the operator names */
1460  if (idxrec->indisexclusion)
1461  {
1462  Datum *elems;
1463  int nElems;
1464  int i;
1465 
1466  Assert(conrec->contype == CONSTRAINT_EXCLUSION);
1467  /* Extract operator OIDs from the pg_constraint tuple */
1468  datum = SysCacheGetAttr(CONSTROID, ht_constr,
1469  Anum_pg_constraint_conexclop,
1470  &isnull);
1471  if (isnull)
1472  elog(ERROR, "null conexclop for constraint %u",
1473  constraintId);
1474 
1475  deconstruct_array(DatumGetArrayTypeP(datum),
1476  OIDOID, sizeof(Oid), true, 'i',
1477  &elems, NULL, &nElems);
1478 
1479  for (i = 0; i < nElems; i++)
1480  {
1481  Oid operid = DatumGetObjectId(elems[i]);
1482  HeapTuple opertup;
1483  Form_pg_operator operform;
1484  char *oprname;
1485  char *nspname;
1486  List *namelist;
1487 
1488  opertup = SearchSysCache1(OPEROID,
1489  ObjectIdGetDatum(operid));
1490  if (!HeapTupleIsValid(opertup))
1491  elog(ERROR, "cache lookup failed for operator %u",
1492  operid);
1493  operform = (Form_pg_operator) GETSTRUCT(opertup);
1494  oprname = pstrdup(NameStr(operform->oprname));
1495  /* For simplicity we always schema-qualify the op name */
1496  nspname = get_namespace_name(operform->oprnamespace);
1497  namelist = list_make2(makeString(nspname),
1498  makeString(oprname));
1499  index->excludeOpNames = lappend(index->excludeOpNames,
1500  namelist);
1501  ReleaseSysCache(opertup);
1502  }
1503  }
1504 
1505  ReleaseSysCache(ht_constr);
1506  }
1507  else
1508  index->isconstraint = false;
1509  }
1510  else
1511  index->isconstraint = false;
1512 
1513  /* Get the index expressions, if any */
1514  datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1515  Anum_pg_index_indexprs, &isnull);
1516  if (!isnull)
1517  {
1518  char *exprsString;
1519 
1520  exprsString = TextDatumGetCString(datum);
1521  indexprs = (List *) stringToNode(exprsString);
1522  }
1523  else
1524  indexprs = NIL;
1525 
1526  /* Build the list of IndexElem */
1527  index->indexParams = NIL;
1528  index->indexIncludingParams = NIL;
1529 
1530  indexpr_item = list_head(indexprs);
1531  for (keyno = 0; keyno < idxrec->indnkeyatts; keyno++)
1532  {
1533  IndexElem *iparam;
1534  AttrNumber attnum = idxrec->indkey.values[keyno];
1535  Form_pg_attribute attr = TupleDescAttr(RelationGetDescr(source_idx),
1536  keyno);
1537  int16 opt = source_idx->rd_indoption[keyno];
1538 
1539  iparam = makeNode(IndexElem);
1540 
1541  if (AttributeNumberIsValid(attnum))
1542  {
1543  /* Simple index column */
1544  char *attname;
1545 
1546  attname = get_attname(indrelid, attnum, false);
1547  keycoltype = get_atttype(indrelid, attnum);
1548 
1549  iparam->name = attname;
1550  iparam->expr = NULL;
1551  }
1552  else
1553  {
1554  /* Expressional index */
1555  Node *indexkey;
1556  bool found_whole_row;
1557 
1558  if (indexpr_item == NULL)
1559  elog(ERROR, "too few entries in indexprs list");
1560  indexkey = (Node *) lfirst(indexpr_item);
1561  indexpr_item = lnext(indexprs, indexpr_item);
1562 
1563  /* Adjust Vars to match new table's column numbering */
1564  indexkey = map_variable_attnos(indexkey,
1565  1, 0,
1566  attmap,
1567  InvalidOid, &found_whole_row);
1568 
1569  /* As in transformTableLikeClause, reject whole-row variables */
1570  if (found_whole_row)
1571  ereport(ERROR,
1572  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1573  errmsg("cannot convert whole-row table reference"),
1574  errdetail("Index \"%s\" contains a whole-row table reference.",
1575  RelationGetRelationName(source_idx))));
1576 
1577  iparam->name = NULL;
1578  iparam->expr = indexkey;
1579 
1580  keycoltype = exprType(indexkey);
1581  }
1582 
1583  /* Copy the original index column name */
1584  iparam->indexcolname = pstrdup(NameStr(attr->attname));
1585 
1586  /* Add the collation name, if non-default */
1587  iparam->collation = get_collation(indcollation->values[keyno], keycoltype);
1588 
1589  /* Add the operator class name, if non-default */
1590  iparam->opclass = get_opclass(indclass->values[keyno], keycoltype);
1591 
1592  iparam->ordering = SORTBY_DEFAULT;
1593  iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1594 
1595  /* Adjust options if necessary */
1596  if (source_idx->rd_indam->amcanorder)
1597  {
1598  /*
1599  * If it supports sort ordering, copy DESC and NULLS opts. Don't
1600  * set non-default settings unnecessarily, though, so as to
1601  * improve the chance of recognizing equivalence to constraint
1602  * indexes.
1603  */
1604  if (opt & INDOPTION_DESC)
1605  {
1606  iparam->ordering = SORTBY_DESC;
1607  if ((opt & INDOPTION_NULLS_FIRST) == 0)
1608  iparam->nulls_ordering = SORTBY_NULLS_LAST;
1609  }
1610  else
1611  {
1612  if (opt & INDOPTION_NULLS_FIRST)
1613  iparam->nulls_ordering = SORTBY_NULLS_FIRST;
1614  }
1615  }
1616 
1617  index->indexParams = lappend(index->indexParams, iparam);
1618  }
1619 
1620  /* Handle included columns separately */
1621  for (keyno = idxrec->indnkeyatts; keyno < idxrec->indnatts; keyno++)
1622  {
1623  IndexElem *iparam;
1624  AttrNumber attnum = idxrec->indkey.values[keyno];
1625  Form_pg_attribute attr = TupleDescAttr(RelationGetDescr(source_idx),
1626  keyno);
1627 
1628  iparam = makeNode(IndexElem);
1629 
1630  if (AttributeNumberIsValid(attnum))
1631  {
1632  /* Simple index column */
1633  char *attname;
1634 
1635  attname = get_attname(indrelid, attnum, false);
1636  keycoltype = get_atttype(indrelid, attnum);
1637 
1638  iparam->name = attname;
1639  iparam->expr = NULL;
1640  }
1641  else
1642  ereport(ERROR,
1643  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1644  errmsg("expressions are not supported in included columns")));
1645 
1646  /* Copy the original index column name */
1647  iparam->indexcolname = pstrdup(NameStr(attr->attname));
1648 
1649  index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
1650  }
1651  /* Copy reloptions if any */
1652  datum = SysCacheGetAttr(RELOID, ht_idxrel,
1653  Anum_pg_class_reloptions, &isnull);
1654  if (!isnull)
1655  index->options = untransformRelOptions(datum);
1656 
1657  /* If it's a partial index, decompile and append the predicate */
1658  datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1659  Anum_pg_index_indpred, &isnull);
1660  if (!isnull)
1661  {
1662  char *pred_str;
1663  Node *pred_tree;
1664  bool found_whole_row;
1665 
1666  /* Convert text string to node tree */
1667  pred_str = TextDatumGetCString(datum);
1668  pred_tree = (Node *) stringToNode(pred_str);
1669 
1670  /* Adjust Vars to match new table's column numbering */
1671  pred_tree = map_variable_attnos(pred_tree,
1672  1, 0,
1673  attmap,
1674  InvalidOid, &found_whole_row);
1675 
1676  /* As in transformTableLikeClause, reject whole-row variables */
1677  if (found_whole_row)
1678  ereport(ERROR,
1679  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1680  errmsg("cannot convert whole-row table reference"),
1681  errdetail("Index \"%s\" contains a whole-row table reference.",
1682  RelationGetRelationName(source_idx))));
1683 
1684  index->whereClause = pred_tree;
1685  }
1686 
1687  /* Clean up */
1688  ReleaseSysCache(ht_idxrel);
1689  ReleaseSysCache(ht_am);
1690 
1691  return index;
1692 }
1693 
1694 /*
1695  * Generate a CreateStatsStmt node using information from an already existing
1696  * extended statistic "source_statsid", for the rel identified by heapRel and
1697  * heapRelid.
1698  */
1699 static CreateStatsStmt *
1700 generateClonedExtStatsStmt(RangeVar *heapRel, Oid heapRelid,
1701  Oid source_statsid)
1702 {
1703  HeapTuple ht_stats;
1704  Form_pg_statistic_ext statsrec;
1705  CreateStatsStmt *stats;
1706  List *stat_types = NIL;
1707  List *def_names = NIL;
1708  bool isnull;
1709  Datum datum;
1710  ArrayType *arr;
1711  char *enabled;
1712  int i;
1713 
1714  Assert(OidIsValid(heapRelid));
1715  Assert(heapRel != NULL);
1716 
1717  /*
1718  * Fetch pg_statistic_ext tuple of source statistics object.
1719  */
1720  ht_stats = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(source_statsid));
1721  if (!HeapTupleIsValid(ht_stats))
1722  elog(ERROR, "cache lookup failed for statistics object %u", source_statsid);
1723  statsrec = (Form_pg_statistic_ext) GETSTRUCT(ht_stats);
1724 
1725  /* Determine which statistics types exist */
1726  datum = SysCacheGetAttr(STATEXTOID, ht_stats,
1727  Anum_pg_statistic_ext_stxkind, &isnull);
1728  Assert(!isnull);
1729  arr = DatumGetArrayTypeP(datum);
1730  if (ARR_NDIM(arr) != 1 ||
1731  ARR_HASNULL(arr) ||
1732  ARR_ELEMTYPE(arr) != CHAROID)
1733  elog(ERROR, "stxkind is not a 1-D char array");
1734  enabled = (char *) ARR_DATA_PTR(arr);
1735  for (i = 0; i < ARR_DIMS(arr)[0]; i++)
1736  {
1737  if (enabled[i] == STATS_EXT_NDISTINCT)
1738  stat_types = lappend(stat_types, makeString("ndistinct"));
1739  else if (enabled[i] == STATS_EXT_DEPENDENCIES)
1740  stat_types = lappend(stat_types, makeString("dependencies"));
1741  else if (enabled[i] == STATS_EXT_MCV)
1742  stat_types = lappend(stat_types, makeString("mcv"));
1743  else
1744  elog(ERROR, "unrecognized statistics kind %c", enabled[i]);
1745  }
1746 
1747  /* Determine which columns the statistics are on */
1748  for (i = 0; i < statsrec->stxkeys.dim1; i++)
1749  {
1750  ColumnRef *cref = makeNode(ColumnRef);
1751  AttrNumber attnum = statsrec->stxkeys.values[i];
1752 
1753  cref->fields = list_make1(makeString(get_attname(heapRelid,
1754  attnum, false)));
1755  cref->location = -1;
1756 
1757  def_names = lappend(def_names, cref);
1758  }
1759 
1760  /* finally, build the output node */
1761  stats = makeNode(CreateStatsStmt);
1762  stats->defnames = NULL;
1763  stats->stat_types = stat_types;
1764  stats->exprs = def_names;
1765  stats->relations = list_make1(heapRel);
1766  stats->stxcomment = NULL;
1767  stats->if_not_exists = false;
1768 
1769  /* Clean up */
1770  ReleaseSysCache(ht_stats);
1771 
1772  return stats;
1773 }
1774 
1775 /*
1776  * get_collation - fetch qualified name of a collation
1777  *
1778  * If collation is InvalidOid or is the default for the given actual_datatype,
1779  * then the return value is NIL.
1780  */
1781 static List *
1782 get_collation(Oid collation, Oid actual_datatype)
1783 {
1784  List *result;
1785  HeapTuple ht_coll;
1786  Form_pg_collation coll_rec;
1787  char *nsp_name;
1788  char *coll_name;
1789 
1790  if (!OidIsValid(collation))
1791  return NIL; /* easy case */
1792  if (collation == get_typcollation(actual_datatype))
1793  return NIL; /* just let it default */
1794 
1795  ht_coll = SearchSysCache1(COLLOID, ObjectIdGetDatum(collation));
1796  if (!HeapTupleIsValid(ht_coll))
1797  elog(ERROR, "cache lookup failed for collation %u", collation);
1798  coll_rec = (Form_pg_collation) GETSTRUCT(ht_coll);
1799 
1800  /* For simplicity, we always schema-qualify the name */
1801  nsp_name = get_namespace_name(coll_rec->collnamespace);
1802  coll_name = pstrdup(NameStr(coll_rec->collname));
1803  result = list_make2(makeString(nsp_name), makeString(coll_name));
1804 
1805  ReleaseSysCache(ht_coll);
1806  return result;
1807 }
1808 
1809 /*
1810  * get_opclass - fetch qualified name of an index operator class
1811  *
1812  * If the opclass is the default for the given actual_datatype, then
1813  * the return value is NIL.
1814  */
1815 static List *
1816 get_opclass(Oid opclass, Oid actual_datatype)
1817 {
1818  List *result = NIL;
1819  HeapTuple ht_opc;
1820  Form_pg_opclass opc_rec;
1821 
1822  ht_opc = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
1823  if (!HeapTupleIsValid(ht_opc))
1824  elog(ERROR, "cache lookup failed for opclass %u", opclass);
1825  opc_rec = (Form_pg_opclass) GETSTRUCT(ht_opc);
1826 
1827  if (GetDefaultOpClass(actual_datatype, opc_rec->opcmethod) != opclass)
1828  {
1829  /* For simplicity, we always schema-qualify the name */
1830  char *nsp_name = get_namespace_name(opc_rec->opcnamespace);
1831  char *opc_name = pstrdup(NameStr(opc_rec->opcname));
1832 
1833  result = list_make2(makeString(nsp_name), makeString(opc_name));
1834  }
1835 
1836  ReleaseSysCache(ht_opc);
1837  return result;
1838 }
1839 
1840 
1841 /*
1842  * transformIndexConstraints
1843  * Handle UNIQUE, PRIMARY KEY, EXCLUDE constraints, which create indexes.
1844  * We also merge in any index definitions arising from
1845  * LIKE ... INCLUDING INDEXES.
1846  */
1847 static void
1848 transformIndexConstraints(CreateStmtContext *cxt)
1849 {
1850  IndexStmt *index;
1851  List *indexlist = NIL;
1852  List *finalindexlist = NIL;
1853  ListCell *lc;
1854 
1855  /*
1856  * Run through the constraints that need to generate an index. For PRIMARY
1857  * KEY, mark each column as NOT NULL and create an index. For UNIQUE or
1858  * EXCLUDE, create an index as for PRIMARY KEY, but do not insist on NOT
1859  * NULL.
1860  */
1861  foreach(lc, cxt->ixconstraints)
1862  {
1863  Constraint *constraint = lfirst_node(Constraint, lc);
1864 
1865  Assert(constraint->contype == CONSTR_PRIMARY ||
1866  constraint->contype == CONSTR_UNIQUE ||
1867  constraint->contype == CONSTR_EXCLUSION);
1868 
1869  index = transformIndexConstraint(constraint, cxt);
1870 
1871  indexlist = lappend(indexlist, index);
1872  }
1873 
1874  /* Add in any indexes defined by LIKE ... INCLUDING INDEXES */
1875  foreach(lc, cxt->inh_indexes)
1876  {
1877  index = (IndexStmt *) lfirst(lc);
1878 
1879  if (index->primary)
1880  {
1881  if (cxt->pkey != NULL)
1882  ereport(ERROR,
1883  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1884  errmsg("multiple primary keys for table \"%s\" are not allowed",
1885  cxt->relation->relname)));
1886  cxt->pkey = index;
1887  }
1888 
1889  indexlist = lappend(indexlist, index);
1890  }
1891 
1892  /*
1893  * Scan the index list and remove any redundant index specifications. This
1894  * can happen if, for instance, the user writes UNIQUE PRIMARY KEY. A
1895  * strict reading of SQL would suggest raising an error instead, but that
1896  * strikes me as too anal-retentive. - tgl 2001-02-14
1897  *
1898  * XXX in ALTER TABLE case, it'd be nice to look for duplicate
1899  * pre-existing indexes, too.
1900  */
1901  if (cxt->pkey != NULL)
1902  {
1903  /* Make sure we keep the PKEY index in preference to others... */
1904  finalindexlist = list_make1(cxt->pkey);
1905  }
1906 
1907  foreach(lc, indexlist)
1908  {
1909  bool keep = true;
1910  ListCell *k;
1911 
1912  index = lfirst(lc);
1913 
1914  /* if it's pkey, it's already in finalindexlist */
1915  if (index == cxt->pkey)
1916  continue;
1917 
1918  foreach(k, finalindexlist)
1919  {
1920  IndexStmt *priorindex = lfirst(k);
1921 
1922  if (equal(index->indexParams, priorindex->indexParams) &&
1923  equal(index->indexIncludingParams, priorindex->indexIncludingParams) &&
1924  equal(index->whereClause, priorindex->whereClause) &&
1925  equal(index->excludeOpNames, priorindex->excludeOpNames) &&
1926  strcmp(index->accessMethod, priorindex->accessMethod) == 0 &&
1927  index->deferrable == priorindex->deferrable &&
1928  index->initdeferred == priorindex->initdeferred)
1929  {
1930  priorindex->unique |= index->unique;
1931 
1932  /*
1933  * If the prior index is as yet unnamed, and this one is
1934  * named, then transfer the name to the prior index. This
1935  * ensures that if we have named and unnamed constraints,
1936  * we'll use (at least one of) the names for the index.
1937  */
1938  if (priorindex->idxname == NULL)
1939  priorindex->idxname = index->idxname;
1940  keep = false;
1941  break;
1942  }
1943  }
1944 
1945  if (keep)
1946  finalindexlist = lappend(finalindexlist, index);
1947  }
1948 
1949  /*
1950  * Now append all the IndexStmts to cxt->alist. If we generated an ALTER
1951  * TABLE SET NOT NULL statement to support a primary key, it's already in
1952  * cxt->alist.
1953  */
1954  cxt->alist = list_concat(cxt->alist, finalindexlist);
1955 }
1956 
1957 /*
1958  * transformIndexConstraint
1959  * Transform one UNIQUE, PRIMARY KEY, or EXCLUDE constraint for
1960  * transformIndexConstraints.
1961  *
1962  * We return an IndexStmt. For a PRIMARY KEY constraint, we additionally
1963  * produce NOT NULL constraints, either by marking ColumnDefs in cxt->columns
1964  * as is_not_null or by adding an ALTER TABLE SET NOT NULL command to
1965  * cxt->alist.
1966  */
1967 static IndexStmt *
1968 transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
1969 {
1970  IndexStmt *index;
1971  List *notnullcmds = NIL;
1972  ListCell *lc;
1973 
1974  index = makeNode(IndexStmt);
1975 
1976  index->unique = (constraint->contype != CONSTR_EXCLUSION);
1977  index->primary = (constraint->contype == CONSTR_PRIMARY);
1978  if (index->primary)
1979  {
1980  if (cxt->pkey != NULL)
1981  ereport(ERROR,
1982  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1983  errmsg("multiple primary keys for table \"%s\" are not allowed",
1984  cxt->relation->relname),
1985  parser_errposition(cxt->pstate, constraint->location)));
1986  cxt->pkey = index;
1987 
1988  /*
1989  * In ALTER TABLE case, a primary index might already exist, but
1990  * DefineIndex will check for it.
1991  */
1992  }
1993  index->isconstraint = true;
1994  index->deferrable = constraint->deferrable;
1995  index->initdeferred = constraint->initdeferred;
1996 
1997  if (constraint->conname != NULL)
1998  index->idxname = pstrdup(constraint->conname);
1999  else
2000  index->idxname = NULL; /* DefineIndex will choose name */
2001 
2002  index->relation = cxt->relation;
2003  index->accessMethod = constraint->access_method ? constraint->access_method : DEFAULT_INDEX_TYPE;
2004  index->options = constraint->options;
2005  index->tableSpace = constraint->indexspace;
2006  index->whereClause = constraint->where_clause;
2007  index->indexParams = NIL;
2008  index->indexIncludingParams = NIL;
2009  index->excludeOpNames = NIL;
2010  index->idxcomment = NULL;
2011  index->indexOid = InvalidOid;
2012  index->oldNode = InvalidOid;
2013  index->transformed = false;
2014  index->concurrent = false;
2015  index->if_not_exists = false;
2016  index->reset_default_tblspc = constraint->reset_default_tblspc;
2017 
2018  /*
2019  * If it's ALTER TABLE ADD CONSTRAINT USING INDEX, look up the index and
2020  * verify it's usable, then extract the implied column name list. (We
2021  * will not actually need the column name list at runtime, but we need it
2022  * now to check for duplicate column entries below.)
2023  */
2024  if (constraint->indexname != NULL)
2025  {
2026  char *index_name = constraint->indexname;
2027  Relation heap_rel = cxt->rel;
2028  Oid index_oid;
2029  Relation index_rel;
2030  Form_pg_index index_form;
2031  oidvector *indclass;
2032  Datum indclassDatum;
2033  bool isnull;
2034  int i;
2035 
2036  /* Grammar should not allow this with explicit column list */
2037  Assert(constraint->keys == NIL);
2038 
2039  /* Grammar should only allow PRIMARY and UNIQUE constraints */
2040  Assert(constraint->contype == CONSTR_PRIMARY ||
2041  constraint->contype == CONSTR_UNIQUE);
2042 
2043  /* Must be ALTER, not CREATE, but grammar doesn't enforce that */
2044  if (!cxt->isalter)
2045  ereport(ERROR,
2046  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2047  errmsg("cannot use an existing index in CREATE TABLE"),
2048  parser_errposition(cxt->pstate, constraint->location)));
2049 
2050  /* Look for the index in the same schema as the table */
2051  index_oid = get_relname_relid(index_name, RelationGetNamespace(heap_rel));
2052 
2053  if (!OidIsValid(index_oid))
2054  ereport(ERROR,
2055  (errcode(ERRCODE_UNDEFINED_OBJECT),
2056  errmsg("index \"%s\" does not exist", index_name),
2057  parser_errposition(cxt->pstate, constraint->location)));
2058 
2059  /* Open the index (this will throw an error if it is not an index) */
2060  index_rel = index_open(index_oid, AccessShareLock);
2061  index_form = index_rel->rd_index;
2062 
2063  /* Check that it does not have an associated constraint already */
2064  if (OidIsValid(get_index_constraint(index_oid)))
2065  ereport(ERROR,
2066  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2067  errmsg("index \"%s\" is already associated with a constraint",
2068  index_name),
2069  parser_errposition(cxt->pstate, constraint->location)));
2070 
2071  /* Perform validity checks on the index */
2072  if (index_form->indrelid != RelationGetRelid(heap_rel))
2073  ereport(ERROR,
2074  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2075  errmsg("index \"%s\" does not belong to table \"%s\"",
2076  index_name, RelationGetRelationName(heap_rel)),
2077  parser_errposition(cxt->pstate, constraint->location)));
2078 
2079  if (!index_form->indisvalid)
2080  ereport(ERROR,
2081  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2082  errmsg("index \"%s\" is not valid", index_name),
2083  parser_errposition(cxt->pstate, constraint->location)));
2084 
2085  if (!index_form->indisunique)
2086  ereport(ERROR,
2087  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2088  errmsg("\"%s\" is not a unique index", index_name),
2089  errdetail("Cannot create a primary key or unique constraint using such an index."),
2090  parser_errposition(cxt->pstate, constraint->location)));
2091 
2092  if (RelationGetIndexExpressions(index_rel) != NIL)
2093  ereport(ERROR,
2094  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2095  errmsg("index \"%s\" contains expressions", index_name),
2096  errdetail("Cannot create a primary key or unique constraint using such an index."),
2097  parser_errposition(cxt->pstate, constraint->location)));
2098 
2099  if (RelationGetIndexPredicate(index_rel) != NIL)
2100  ereport(ERROR,
2101  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2102  errmsg("\"%s\" is a partial index", index_name),
2103  errdetail("Cannot create a primary key or unique constraint using such an index."),
2104  parser_errposition(cxt->pstate, constraint->location)));
2105 
2106  /*
2107  * It's probably unsafe to change a deferred index to non-deferred. (A
2108  * non-constraint index couldn't be deferred anyway, so this case
2109  * should never occur; no need to sweat, but let's check it.)
2110  */
2111  if (!index_form->indimmediate && !constraint->deferrable)
2112  ereport(ERROR,
2113  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2114  errmsg("\"%s\" is a deferrable index", index_name),
2115  errdetail("Cannot create a non-deferrable constraint using a deferrable index."),
2116  parser_errposition(cxt->pstate, constraint->location)));
2117 
2118  /*
2119  * Insist on it being a btree. That's the only kind that supports
2120  * uniqueness at the moment anyway; but we must have an index that
2121  * exactly matches what you'd get from plain ADD CONSTRAINT syntax,
2122  * else dump and reload will produce a different index (breaking
2123  * pg_upgrade in particular).
2124  */
2125  if (index_rel->rd_rel->relam != get_index_am_oid(DEFAULT_INDEX_TYPE, false))
2126  ereport(ERROR,
2127  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2128  errmsg("index \"%s\" is not a btree", index_name),
2129  parser_errposition(cxt->pstate, constraint->location)));
2130 
2131  /* Must get indclass the hard way */
2132  indclassDatum = SysCacheGetAttr(INDEXRELID, index_rel->rd_indextuple,
2133  Anum_pg_index_indclass, &isnull);
2134  Assert(!isnull);
2135  indclass = (oidvector *) DatumGetPointer(indclassDatum);
2136 
2137  for (i = 0; i < index_form->indnatts; i++)
2138  {
2139  int16 attnum = index_form->indkey.values[i];
2140  const FormData_pg_attribute *attform;
2141  char *attname;
2142  Oid defopclass;
2143 
2144  /*
2145  * We shouldn't see attnum == 0 here, since we already rejected
2146  * expression indexes. If we do, SystemAttributeDefinition will
2147  * throw an error.
2148  */
2149  if (attnum > 0)
2150  {
2151  Assert(attnum <= heap_rel->rd_att->natts);
2152  attform = TupleDescAttr(heap_rel->rd_att, attnum - 1);
2153  }
2154  else
2155  attform = SystemAttributeDefinition(attnum);
2156  attname = pstrdup(NameStr(attform->attname));
2157 
2158  if (i < index_form->indnkeyatts)
2159  {
2160  /*
2161  * Insist on default opclass, collation, and sort options.
2162  * While the index would still work as a constraint with
2163  * non-default settings, it might not provide exactly the same
2164  * uniqueness semantics as you'd get from a normally-created
2165  * constraint; and there's also the dump/reload problem
2166  * mentioned above.
2167  */
2168  defopclass = GetDefaultOpClass(attform->atttypid,
2169  index_rel->rd_rel->relam);
2170  if (indclass->values[i] != defopclass ||
2171  attform->attcollation != index_rel->rd_indcollation[i] ||
2172  index_rel->rd_indoption[i] != 0)
2173  ereport(ERROR,
2174  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2175  errmsg("index \"%s\" column number %d does not have default sorting behavior", index_name, i + 1),
2176  errdetail("Cannot create a primary key or unique constraint using such an index."),
2177  parser_errposition(cxt->pstate, constraint->location)));
2178 
2179  constraint->keys = lappend(constraint->keys, makeString(attname));
2180  }
2181  else
2182  constraint->including = lappend(constraint->including, makeString(attname));
2183  }
2184 
2185  /* Close the index relation but keep the lock */
2186  relation_close(index_rel, NoLock);
2187 
2188  index->indexOid = index_oid;
2189  }
2190 
2191  /*
2192  * If it's an EXCLUDE constraint, the grammar returns a list of pairs of
2193  * IndexElems and operator names. We have to break that apart into
2194  * separate lists.
2195  */
2196  if (constraint->contype == CONSTR_EXCLUSION)
2197  {
2198  foreach(lc, constraint->exclusions)
2199  {
2200  List *pair = (List *) lfirst(lc);
2201  IndexElem *elem;
2202  List *opname;
2203 
2204  Assert(list_length(pair) == 2);
2205  elem = linitial_node(IndexElem, pair);
2206  opname = lsecond_node(List, pair);
2207 
2208  index->indexParams = lappend(index->indexParams, elem);
2209  index->excludeOpNames = lappend(index->excludeOpNames, opname);
2210  }
2211  }
2212 
2213  /*
2214  * For UNIQUE and PRIMARY KEY, we just have a list of column names.
2215  *
2216  * Make sure referenced keys exist. If we are making a PRIMARY KEY index,
2217  * also make sure they are NOT NULL.
2218  */
2219  else
2220  {
2221  foreach(lc, constraint->keys)
2222  {
2223  char *key = strVal(lfirst(lc));
2224  bool found = false;
2225  bool forced_not_null = false;
2226  ColumnDef *column = NULL;
2227  ListCell *columns;
2228  IndexElem *iparam;
2229 
2230  /* Make sure referenced column exists. */
2231  foreach(columns, cxt->columns)
2232  {
2233  column = castNode(ColumnDef, lfirst(columns));
2234  if (strcmp(column->colname, key) == 0)
2235  {
2236  found = true;
2237  break;
2238  }
2239  }
2240  if (found)
2241  {
2242  /*
2243  * column is defined in the new table. For PRIMARY KEY, we
2244  * can apply the NOT NULL constraint cheaply here ... unless
2245  * the column is marked is_from_type, in which case marking it
2246  * here would be ineffective (see MergeAttributes).
2247  */
2248  if (constraint->contype == CONSTR_PRIMARY &&
2249  !column->is_from_type)
2250  {
2251  column->is_not_null = true;
2252  forced_not_null = true;
2253  }
2254  }
2255  else if (SystemAttributeByName(key) != NULL)
2256  {
2257  /*
2258  * column will be a system column in the new table, so accept
2259  * it. System columns can't ever be null, so no need to worry
2260  * about PRIMARY/NOT NULL constraint.
2261  */
2262  found = true;
2263  }
2264  else if (cxt->inhRelations)
2265  {
2266  /* try inherited tables */
2267  ListCell *inher;
2268 
2269  foreach(inher, cxt->inhRelations)
2270  {
2271  RangeVar *inh = castNode(RangeVar, lfirst(inher));
2272  Relation rel;
2273  int count;
2274 
2275  rel = table_openrv(inh, AccessShareLock);
2276  /* check user requested inheritance from valid relkind */
2277  if (rel->rd_rel->relkind != RELKIND_RELATION &&
2278  rel->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
2279  rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
2280  ereport(ERROR,
2281  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2282  errmsg("inherited relation \"%s\" is not a table or foreign table",
2283  inh->relname)));
2284  for (count = 0; count < rel->rd_att->natts; count++)
2285  {
2286  Form_pg_attribute inhattr = TupleDescAttr(rel->rd_att,
2287  count);
2288  char *inhname = NameStr(inhattr->attname);
2289 
2290  if (inhattr->attisdropped)
2291  continue;
2292  if (strcmp(key, inhname) == 0)
2293  {
2294  found = true;
2295 
2296  /*
2297  * It's tempting to set forced_not_null if the
2298  * parent column is already NOT NULL, but that
2299  * seems unsafe because the column's NOT NULL
2300  * marking might disappear between now and
2301  * execution. Do the runtime check to be safe.
2302  */
2303  break;
2304  }
2305  }
2306  table_close(rel, NoLock);
2307  if (found)
2308  break;
2309  }
2310  }
2311 
2312  /*
2313  * In the ALTER TABLE case, don't complain about index keys not
2314  * created in the command; they may well exist already.
2315  * DefineIndex will complain about them if not.
2316  */
2317  if (!found && !cxt->isalter)
2318  ereport(ERROR,
2319  (errcode(ERRCODE_UNDEFINED_COLUMN),
2320  errmsg("column \"%s\" named in key does not exist", key),
2321  parser_errposition(cxt->pstate, constraint->location)));
2322 
2323  /* Check for PRIMARY KEY(foo, foo) */
2324  foreach(columns, index->indexParams)
2325  {
2326  iparam = (IndexElem *) lfirst(columns);
2327  if (iparam->name && strcmp(key, iparam->name) == 0)
2328  {
2329  if (index->primary)
2330  ereport(ERROR,
2331  (errcode(ERRCODE_DUPLICATE_COLUMN),
2332  errmsg("column \"%s\" appears twice in primary key constraint",
2333  key),
2334  parser_errposition(cxt->pstate, constraint->location)));
2335  else
2336  ereport(ERROR,
2337  (errcode(ERRCODE_DUPLICATE_COLUMN),
2338  errmsg("column \"%s\" appears twice in unique constraint",
2339  key),
2340  parser_errposition(cxt->pstate, constraint->location)));
2341  }
2342  }
2343 
2344  /* OK, add it to the index definition */
2345  iparam = makeNode(IndexElem);
2346  iparam->name = pstrdup(key);
2347  iparam->expr = NULL;
2348  iparam->indexcolname = NULL;
2349  iparam->collation = NIL;
2350  iparam->opclass = NIL;
2351  iparam->ordering = SORTBY_DEFAULT;
2352  iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
2353  index->indexParams = lappend(index->indexParams, iparam);
2354 
2355  /*
2356  * For a primary-key column, also create an item for ALTER TABLE
2357  * SET NOT NULL if we couldn't ensure it via is_not_null above.
2358  */
2359  if (constraint->contype == CONSTR_PRIMARY && !forced_not_null)
2360  {
2361  AlterTableCmd *notnullcmd = makeNode(AlterTableCmd);
2362 
2363  notnullcmd->subtype = AT_SetNotNull;
2364  notnullcmd->name = pstrdup(key);
2365  notnullcmds = lappend(notnullcmds, notnullcmd);
2366  }
2367  }
2368  }
2369 
2370  /*
2371  * Add included columns to index definition. This is much like the
2372  * simple-column-name-list code above, except that we don't worry about
2373  * NOT NULL marking; included columns in a primary key should not be
2374  * forced NOT NULL. We don't complain about duplicate columns, either,
2375  * though maybe we should?
2376  */
2377  foreach(lc, constraint->including)
2378  {
2379  char *key = strVal(lfirst(lc));
2380  bool found = false;
2381  ColumnDef *column = NULL;
2382  ListCell *columns;
2383  IndexElem *iparam;
2384 
2385  foreach(columns, cxt->columns)
2386  {
2387  column = lfirst_node(ColumnDef, columns);
2388  if (strcmp(column->colname, key) == 0)
2389  {
2390  found = true;
2391  break;
2392  }
2393  }
2394 
2395  if (!found)
2396  {
2397  if (SystemAttributeByName(key) != NULL)
2398  {
2399  /*
2400  * column will be a system column in the new table, so accept
2401  * it.
2402  */
2403  found = true;
2404  }
2405  else if (cxt->inhRelations)
2406  {
2407  /* try inherited tables */
2408  ListCell *inher;
2409 
2410  foreach(inher, cxt->inhRelations)
2411  {
2412  RangeVar *inh = lfirst_node(RangeVar, inher);
2413  Relation rel;
2414  int count;
2415 
2416  rel = table_openrv(inh, AccessShareLock);
2417  /* check user requested inheritance from valid relkind */
2418  if (rel->rd_rel->relkind != RELKIND_RELATION &&
2419  rel->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
2420  rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
2421  ereport(ERROR,
2422  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2423  errmsg("inherited relation \"%s\" is not a table or foreign table",
2424  inh->relname)));
2425  for (count = 0; count < rel->rd_att->natts; count++)
2426  {
2427  Form_pg_attribute inhattr = TupleDescAttr(rel->rd_att,
2428  count);
2429  char *inhname = NameStr(inhattr->attname);
2430 
2431  if (inhattr->attisdropped)
2432  continue;
2433  if (strcmp(key, inhname) == 0)
2434  {
2435  found = true;
2436  break;
2437  }
2438  }
2439  table_close(rel, NoLock);
2440  if (found)
2441  break;
2442  }
2443  }
2444  }
2445 
2446  /*
2447  * In the ALTER TABLE case, don't complain about index keys not
2448  * created in the command; they may well exist already. DefineIndex
2449  * will complain about them if not.
2450  */
2451  if (!found && !cxt->isalter)
2452  ereport(ERROR,
2453  (errcode(ERRCODE_UNDEFINED_COLUMN),
2454  errmsg("column \"%s\" named in key does not exist", key),
2455  parser_errposition(cxt->pstate, constraint->location)));
2456 
2457  /* OK, add it to the index definition */
2458  iparam = makeNode(IndexElem);
2459  iparam->name = pstrdup(key);
2460  iparam->expr = NULL;
2461  iparam->indexcolname = NULL;
2462  iparam->collation = NIL;
2463  iparam->opclass = NIL;
2464  index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
2465  }
2466 
2467  /*
2468  * If we found anything that requires run-time SET NOT NULL, build a full
2469  * ALTER TABLE command for that and add it to cxt->alist.
2470  */
2471  if (notnullcmds)
2472  {
2473  AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
2474 
2475  alterstmt->relation = copyObject(cxt->relation);
2476  alterstmt->cmds = notnullcmds;
2477  alterstmt->relkind = OBJECT_TABLE;
2478  alterstmt->missing_ok = false;
2479 
2480  cxt->alist = lappend(cxt->alist, alterstmt);
2481  }
2482 
2483  return index;
2484 }
2485 
2486 /*
2487  * transformExtendedStatistics
2488  * Handle extended statistic objects
2489  *
2490  * Right now, there's nothing to do here, so we just append the list to
2491  * the existing "after" list.
2492  */
2493 static void
2494 transformExtendedStatistics(CreateStmtContext *cxt)
2495 {
2496  cxt->alist = list_concat(cxt->alist, cxt->extstats);
2497 }
2498 
2499 /*
2500  * transformCheckConstraints
2501  * handle CHECK constraints
2502  *
2503  * Right now, there's nothing to do here when called from ALTER TABLE,
2504  * but the other constraint-transformation functions are called in both
2505  * the CREATE TABLE and ALTER TABLE paths, so do the same here, and just
2506  * don't do anything if we're not authorized to skip validation.
2507  */
2508 static void
2509 transformCheckConstraints(CreateStmtContext *cxt, bool skipValidation)
2510 {
2511  ListCell *ckclist;
2512 
2513  if (cxt->ckconstraints == NIL)
2514  return;
2515 
2516  /*
2517  * If creating a new table (but not a foreign table), we can safely skip
2518  * validation of check constraints, and nonetheless mark them valid. (This
2519  * will override any user-supplied NOT VALID flag.)
2520  */
2521  if (skipValidation)
2522  {
2523  foreach(ckclist, cxt->ckconstraints)
2524  {
2525  Constraint *constraint = (Constraint *) lfirst(ckclist);
2526 
2527  constraint->skip_validation = true;
2528  constraint->initially_valid = true;
2529  }
2530  }
2531 }
2532 
2533 /*
2534  * transformFKConstraints
2535  * handle FOREIGN KEY constraints
2536  */
2537 static void
2538 transformFKConstraints(CreateStmtContext *cxt,
2539  bool skipValidation, bool isAddConstraint)
2540 {
2541  ListCell *fkclist;
2542 
2543  if (cxt->fkconstraints == NIL)
2544  return;
2545 
2546  /*
2547  * If CREATE TABLE or adding a column with NULL default, we can safely
2548  * skip validation of FK constraints, and nonetheless mark them valid.
2549  * (This will override any user-supplied NOT VALID flag.)
2550  */
2551  if (skipValidation)
2552  {
2553  foreach(fkclist, cxt->fkconstraints)
2554  {
2555  Constraint *constraint = (Constraint *) lfirst(fkclist);
2556 
2557  constraint->skip_validation = true;
2558  constraint->initially_valid = true;
2559  }
2560  }
2561 
2562  /*
2563  * For CREATE TABLE or ALTER TABLE ADD COLUMN, gin up an ALTER TABLE ADD
2564  * CONSTRAINT command to execute after the basic command is complete. (If
2565  * called from ADD CONSTRAINT, that routine will add the FK constraints to
2566  * its own subcommand list.)
2567  *
2568  * Note: the ADD CONSTRAINT command must also execute after any index
2569  * creation commands. Thus, this should run after
2570  * transformIndexConstraints, so that the CREATE INDEX commands are
2571  * already in cxt->alist.
2572  */
2573  if (!isAddConstraint)
2574  {
2575  AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
2576 
2577  alterstmt->relation = cxt->relation;
2578  alterstmt->cmds = NIL;
2579  alterstmt->relkind = OBJECT_TABLE;
2580 
2581  foreach(fkclist, cxt->fkconstraints)
2582  {
2583  Constraint *constraint = (Constraint *) lfirst(fkclist);
2584  AlterTableCmd *altercmd = makeNode(AlterTableCmd);
2585 
2586  altercmd->subtype = AT_AddConstraint;
2587  altercmd->name = NULL;
2588  altercmd->def = (Node *) constraint;
2589  alterstmt->cmds = lappend(alterstmt->cmds, altercmd);
2590  }
2591 
2592  cxt->alist = lappend(cxt->alist, alterstmt);
2593  }
2594 }
2595 
2596 /*
2597  * transformIndexStmt - parse analysis for CREATE INDEX and ALTER TABLE
2598  *
2599  * Note: this is a no-op for an index not using either index expressions or
2600  * a predicate expression. There are several code paths that create indexes
2601  * without bothering to call this, because they know they don't have any
2602  * such expressions to deal with.
2603  *
2604  * To avoid race conditions, it's important that this function rely only on
2605  * the passed-in relid (and not on stmt->relation) to determine the target
2606  * relation.
2607  */
2608 IndexStmt *
2609 transformIndexStmt(Oid relid, IndexStmt *stmt, const char *queryString)
2610 {
2611  ParseState *pstate;
2612  ParseNamespaceItem *nsitem;
2613  ListCell *l;
2614  Relation rel;
2615 
2616  /* Nothing to do if statement already transformed. */
2617  if (stmt->transformed)
2618  return stmt;
2619 
2620  /*
2621  * We must not scribble on the passed-in IndexStmt, so copy it. (This is
2622  * overkill, but easy.)
2623  */
2624  stmt = copyObject(stmt);
2625 
2626  /* Set up pstate */
2627  pstate = make_parsestate(NULL);
2628  pstate->p_sourcetext = queryString;
2629 
2630  /*
2631  * Put the parent table into the rtable so that the expressions can refer
2632  * to its fields without qualification. Caller is responsible for locking
2633  * relation, but we still need to open it.
2634  */
2635  rel = relation_open(relid, NoLock);
2636  nsitem = addRangeTableEntryForRelation(pstate, rel,
2637  AccessShareLock,
2638  NULL, false, true);
2639 
2640  /* no to join list, yes to namespaces */
2641  addNSItemToQuery(pstate, nsitem, false, true, true);
2642 
2643  /* take care of the where clause */
2644  if (stmt->whereClause)
2645  {
2646  stmt->whereClause = transformWhereClause(pstate,
2647  stmt->whereClause,
2648  EXPR_KIND_INDEX_PREDICATE,
2649  "WHERE");
2650  /* we have to fix its collations too */
2651  assign_expr_collations(pstate, stmt->whereClause);
2652  }
2653 
2654  /* take care of any index expressions */
2655  foreach(l, stmt->indexParams)
2656  {
2657  IndexElem *ielem = (IndexElem *) lfirst(l);
2658 
2659  if (ielem->expr)
2660  {
2661  /* Extract preliminary index col name before transforming expr */
2662  if (ielem->indexcolname == NULL)
2663  ielem->indexcolname = FigureIndexColname(ielem->expr);
2664 
2665  /* Now do parse transformation of the expression */
2666  ielem->expr = transformExpr(pstate, ielem->expr,
2667  EXPR_KIND_INDEX_EXPRESSION);
2668 
2669  /* We have to fix its collations too */
2670  assign_expr_collations(pstate, ielem->expr);
2671 
2672  /*
2673  * transformExpr() should have already rejected subqueries,
2674  * aggregates, window functions, and SRFs, based on the EXPR_KIND_
2675  * for an index expression.
2676  *
2677  * DefineIndex() will make more checks.
2678  */
2679  }
2680  }
2681 
2682  /*
2683  * Check that only the base rel is mentioned. (This should be dead code
2684  * now that add_missing_from is history.)
2685  */
2686  if (list_length(pstate->p_rtable) != 1)
2687  ereport(ERROR,
2688  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
2689  errmsg("index expressions and predicates can refer only to the table being indexed")));
2690 
2691  free_parsestate(pstate);
2692 
2693  /* Close relation */
2694  table_close(rel, NoLock);
2695 
2696  /* Mark statement as successfully transformed */
2697  stmt->transformed = true;
2698 
2699  return stmt;
2700 }
2701 
2702 
2703 /*
2704  * transformRuleStmt -
2705  * transform a CREATE RULE Statement. The action is a list of parse
2706  * trees which is transformed into a list of query trees, and we also
2707  * transform the WHERE clause if any.
2708  *
2709  * actions and whereClause are output parameters that receive the
2710  * transformed results.
2711  *
2712  * Note that we must not scribble on the passed-in RuleStmt, so we do
2713  * copyObject() on the actions and WHERE clause.
2714  */
2715 void
2716 transformRuleStmt(RuleStmt *stmt, const char *queryString,
2717  List **actions, Node **whereClause)
2718 {
2719  Relation rel;
2720  ParseState *pstate;
2721  ParseNamespaceItem *oldnsitem;
2722  ParseNamespaceItem *newnsitem;
2723 
2724  /*
2725  * To avoid deadlock, make sure the first thing we do is grab
2726  * AccessExclusiveLock on the target relation. This will be needed by
2727  * DefineQueryRewrite(), and we don't want to grab a lesser lock
2728  * beforehand.
2729  */
2730  rel = table_openrv(stmt->relation, AccessExclusiveLock);
2731 
2732  if (rel->rd_rel->relkind == RELKIND_MATVIEW)
2733  ereport(ERROR,
2734  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2735  errmsg("rules on materialized views are not supported")));
2736 
2737  /* Set up pstate */
2738  pstate = make_parsestate(NULL);
2739  pstate->p_sourcetext = queryString;
2740 
2741  /*
2742  * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
2743  * Set up their ParseNamespaceItems in the main pstate for use in parsing
2744  * the rule qualification.
2745  */
2746  oldnsitem = addRangeTableEntryForRelation(pstate, rel,
2747  AccessShareLock,
2748  makeAlias("old", NIL),
2749  false, false);
2750  newnsitem = addRangeTableEntryForRelation(pstate, rel,
2751  AccessShareLock,
2752  makeAlias("new", NIL),
2753  false, false);
2754  /* Must override addRangeTableEntry's default access-check flags */
2755  oldnsitem->p_rte->requiredPerms = 0;
2756  newnsitem->p_rte->requiredPerms = 0;
2757 
2758  /*
2759  * They must be in the namespace too for lookup purposes, but only add the
2760  * one(s) that are relevant for the current kind of rule. In an UPDATE
2761  * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
2762  * there's no need to be so picky for INSERT & DELETE. We do not add them
2763  * to the joinlist.
2764  */
2765  switch (stmt->event)
2766  {
2767  case CMD_SELECT:
2768  addNSItemToQuery(pstate, oldnsitem, false, true, true);
2769  break;
2770  case CMD_UPDATE:
2771  addNSItemToQuery(pstate, oldnsitem, false, true, true);
2772  addNSItemToQuery(pstate, newnsitem, false, true, true);
2773  break;
2774  case CMD_INSERT:
2775  addNSItemToQuery(pstate, newnsitem, false, true, true);
2776  break;
2777  case CMD_DELETE:
2778  addNSItemToQuery(pstate, oldnsitem, false, true, true);
2779  break;
2780  default:
2781  elog(ERROR, "unrecognized event type: %d",
2782  (int) stmt->event);
2783  break;
2784  }
2785 
2786  /* take care of the where clause */
2787  *whereClause = transformWhereClause(pstate,
2788  (Node *) copyObject(stmt->whereClause),
2789  EXPR_KIND_WHERE,
2790  "WHERE");
2791  /* we have to fix its collations too */
2792  assign_expr_collations(pstate, *whereClause);
2793 
2794  /* this is probably dead code without add_missing_from: */
2795  if (list_length(pstate->p_rtable) != 2) /* naughty, naughty... */
2796  ereport(ERROR,
2797  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2798  errmsg("rule WHERE condition cannot contain references to other relations")));
2799 
2800  /*
2801  * 'instead nothing' rules with a qualification need a query rangetable so
2802  * the rewrite handler can add the negated rule qualification to the
2803  * original query. We create a query with the new command type CMD_NOTHING
2804  * here that is treated specially by the rewrite system.
2805  */
2806  if (stmt->actions == NIL)
2807  {
2808  Query *nothing_qry = makeNode(Query);
2809 
2810  nothing_qry->commandType = CMD_NOTHING;
2811  nothing_qry->rtable = pstate->p_rtable;
2812  nothing_qry->jointree = makeFromExpr(NIL, NULL); /* no join wanted */
2813 
2814  *actions = list_make1(nothing_qry);
2815  }
2816  else
2817  {
2818  ListCell *l;
2819  List *newactions = NIL;
2820 
2821  /*
2822  * transform each statement, like parse_sub_analyze()
2823  */
2824  foreach(l, stmt->actions)
2825  {
2826  Node *action = (Node *) lfirst(l);
2827  ParseState *sub_pstate = make_parsestate(NULL);
2828  Query *sub_qry,
2829  *top_subqry;
2830  bool has_old,
2831  has_new;
2832 
2833  /*
2834  * Since outer ParseState isn't parent of inner, have to pass down
2835  * the query text by hand.
2836  */
2837  sub_pstate->p_sourcetext = queryString;
2838 
2839  /*
2840  * Set up OLD/NEW in the rtable for this statement. The entries
2841  * are added only to relnamespace, not varnamespace, because we
2842  * don't want them to be referred to by unqualified field names
2843  * nor "*" in the rule actions. We decide later whether to put
2844  * them in the joinlist.
2845  */
2846  oldnsitem = addRangeTableEntryForRelation(sub_pstate, rel,
2847  AccessShareLock,
2848  makeAlias("old", NIL),
2849  false, false);
2850  newnsitem = addRangeTableEntryForRelation(sub_pstate, rel,
2851  AccessShareLock,
2852  makeAlias("new", NIL),
2853  false, false);
2854  oldnsitem->p_rte->requiredPerms = 0;
2855  newnsitem->p_rte->requiredPerms = 0;
2856  addNSItemToQuery(sub_pstate, oldnsitem, false, true, false);
2857  addNSItemToQuery(sub_pstate, newnsitem, false, true, false);
2858 
2859  /* Transform the rule action statement */
2860  top_subqry = transformStmt(sub_pstate,
2861  (Node *) copyObject(action));
2862 
2863  /*
2864  * We cannot support utility-statement actions (eg NOTIFY) with
2865  * nonempty rule WHERE conditions, because there's no way to make
2866  * the utility action execute conditionally.
2867  */
2868  if (top_subqry->commandType == CMD_UTILITY &&
2869  *whereClause != NULL)
2870  ereport(ERROR,
2871  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2872  errmsg("rules with WHERE conditions can only have SELECT, INSERT, UPDATE, or DELETE actions")));
2873 
2874  /*
2875  * If the action is INSERT...SELECT, OLD/NEW have been pushed down
2876  * into the SELECT, and that's what we need to look at. (Ugly
2877  * kluge ... try to fix this when we redesign querytrees.)
2878  */
2879  sub_qry = getInsertSelectQuery(top_subqry, NULL);
2880 
2881  /*
2882  * If the sub_qry is a setop, we cannot attach any qualifications
2883  * to it, because the planner won't notice them. This could
2884  * perhaps be relaxed someday, but for now, we may as well reject
2885  * such a rule immediately.
2886  */
2887  if (sub_qry->setOperations != NULL && *whereClause != NULL)
2888  ereport(ERROR,
2889  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2890  errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
2891 
2892  /*
2893  * Validate action's use of OLD/NEW, qual too
2894  */
2895  has_old =
2896  rangeTableEntry_used((Node *) sub_qry, PRS2_OLD_VARNO, 0) ||
2897  rangeTableEntry_used(*whereClause, PRS2_OLD_VARNO, 0);
2898  has_new =
2899  rangeTableEntry_used((Node *) sub_qry, PRS2_NEW_VARNO, 0) ||
2900  rangeTableEntry_used(*whereClause, PRS2_NEW_VARNO, 0);
2901 
2902  switch (stmt->event)
2903  {
2904  case CMD_SELECT:
2905  if (has_old)
2906  ereport(ERROR,
2907  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2908  errmsg("ON SELECT rule cannot use OLD")));
2909  if (has_new)
2910  ereport(ERROR,
2911  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2912  errmsg("ON SELECT rule cannot use NEW")));
2913  break;
2914  case CMD_UPDATE:
2915  /* both are OK */
2916  break;
2917  case CMD_INSERT:
2918  if (has_old)
2919  ereport(ERROR,
2920  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2921  errmsg("ON INSERT rule cannot use OLD")));
2922  break;
2923  case CMD_DELETE:
2924  if (has_new)
2925  ereport(ERROR,
2926  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2927  errmsg("ON DELETE rule cannot use NEW")));
2928  break;
2929  default:
2930  elog(ERROR, "unrecognized event type: %d",
2931  (int) stmt->event);
2932  break;
2933  }
2934 
2935  /*
2936  * OLD/NEW are not allowed in WITH queries, because they would
2937  * amount to outer references for the WITH, which we disallow.
2938  * However, they were already in the outer rangetable when we
2939  * analyzed the query, so we have to check.
2940  *
2941  * Note that in the INSERT...SELECT case, we need to examine the
2942  * CTE lists of both top_subqry and sub_qry.
2943  *
2944  * Note that we aren't digging into the body of the query looking
2945  * for WITHs in nested sub-SELECTs. A WITH down there can
2946  * legitimately refer to OLD/NEW, because it'd be an
2947  * indirect-correlated outer reference.
2948  */
2949  if (rangeTableEntry_used((Node *) top_subqry->cteList,
2950  PRS2_OLD_VARNO, 0) ||
2951  rangeTableEntry_used((Node *) sub_qry->cteList,
2952  PRS2_OLD_VARNO, 0))
2953  ereport(ERROR,
2954  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2955  errmsg("cannot refer to OLD within WITH query")));
2956  if (rangeTableEntry_used((Node *) top_subqry->cteList,
2957  PRS2_NEW_VARNO, 0) ||
2958  rangeTableEntry_used((Node *) sub_qry->cteList,
2959  PRS2_NEW_VARNO, 0))
2960  ereport(ERROR,
2961  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2962  errmsg("cannot refer to NEW within WITH query")));
2963 
2964  /*
2965  * For efficiency's sake, add OLD to the rule action's jointree
2966  * only if it was actually referenced in the statement or qual.
2967  *
2968  * For INSERT, NEW is not really a relation (only a reference to
2969  * the to-be-inserted tuple) and should never be added to the
2970  * jointree.
2971  *
2972  * For UPDATE, we treat NEW as being another kind of reference to
2973  * OLD, because it represents references to *transformed* tuples
2974  * of the existing relation. It would be wrong to enter NEW
2975  * separately in the jointree, since that would cause a double
2976  * join of the updated relation. It's also wrong to fail to make
2977  * a jointree entry if only NEW and not OLD is mentioned.
2978  */
2979  if (has_old || (has_new && stmt->event == CMD_UPDATE))
2980  {
2981  RangeTblRef *rtr;
2982 
2983  /*
2984  * If sub_qry is a setop, manipulating its jointree will do no
2985  * good at all, because the jointree is dummy. (This should be
2986  * a can't-happen case because of prior tests.)
2987  */
2988  if (sub_qry->setOperations != NULL)
2989  ereport(ERROR,
2990  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2991  errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
2992  /* hackishly add OLD to the already-built FROM clause */
2993  rtr = makeNode(RangeTblRef);
2994  rtr->rtindex = oldnsitem->p_rtindex;
2995  sub_qry->jointree->fromlist =
2996  lappend(sub_qry->jointree->fromlist, rtr);
2997  }
2998 
2999  newactions = lappend(newactions, top_subqry);
3000 
3001  free_parsestate(sub_pstate);
3002  }
3003 
3004  *actions = newactions;
3005  }
3006 
3007  free_parsestate(pstate);
3008 
3009  /* Close relation, but keep the exclusive lock */
3010  table_close(rel, NoLock);
3011 }
3012 
3013 
3014 /*
3015  * transformAlterTableStmt -
3016  * parse analysis for ALTER TABLE
3017  *
3018  * Returns the transformed AlterTableStmt. There may be additional actions
3019  * to be done before and after the transformed statement, which are returned
3020  * in *beforeStmts and *afterStmts as lists of utility command parsetrees.
3021  *
3022  * To avoid race conditions, it's important that this function rely only on
3023  * the passed-in relid (and not on stmt->relation) to determine the target
3024  * relation.
3025  */
3026 AlterTableStmt *
3027 transformAlterTableStmt(Oid relid, AlterTableStmt *stmt,
3028  const char *queryString,
3029  List **beforeStmts, List **afterStmts)
3030 {
3031  Relation rel;
3032  TupleDesc tupdesc;
3033  ParseState *pstate;
3034  CreateStmtContext cxt;
3035  List *save_alist;
3036  ListCell *lcmd,
3037  *l;
3038  List *newcmds = NIL;
3039  bool skipValidation = true;
3040  AlterTableCmd *newcmd;
3041  ParseNamespaceItem *nsitem;
3042 
3043  /*
3044  * We must not scribble on the passed-in AlterTableStmt, so copy it. (This
3045  * is overkill, but easy.)
3046  */
3047  stmt = copyObject(stmt);
3048 
3049  /* Caller is responsible for locking the relation */
3050  rel = relation_open(relid, NoLock);
3051  tupdesc = RelationGetDescr(rel);
3052 
3053  /* Set up pstate */
3054  pstate = make_parsestate(NULL);
3055  pstate->p_sourcetext = queryString;
3056  nsitem = addRangeTableEntryForRelation(pstate,
3057  rel,
3058  AccessShareLock,
3059  NULL,
3060  false,
3061  true);
3062  addNSItemToQuery(pstate, nsitem, false, true, true);
3063 
3064  /* Set up CreateStmtContext */
3065  cxt.pstate = pstate;
3066  if (rel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
3067  {
3068  cxt.stmtType = "ALTER FOREIGN TABLE";
3069  cxt.isforeign = true;
3070  }
3071  else
3072  {
3073  cxt.stmtType = "ALTER TABLE";
3074  cxt.isforeign = false;
3075  }
3076  cxt.relation = stmt->relation;
3077  cxt.rel = rel;
3078  cxt.inhRelations = NIL;
3079  cxt.isalter = true;
3080  cxt.columns = NIL;
3081  cxt.ckconstraints = NIL;
3082  cxt.fkconstraints = NIL;
3083  cxt.ixconstraints = NIL;
3084  cxt.inh_indexes = NIL;
3085  cxt.extstats = NIL;
3086  cxt.blist = NIL;
3087  cxt.alist = NIL;
3088  cxt.pkey = NULL;
3089  cxt.ispartitioned = (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
3090  cxt.partbound = NULL;
3091  cxt.ofType = false;
3092 
3093  /*
3094  * Transform ALTER subcommands that need it (most don't). These largely
3095  * re-use code from CREATE TABLE.
3096  */
3097  foreach(lcmd, stmt->cmds)
3098  {
3099  AlterTableCmd *cmd = (AlterTableCmd *) lfirst(lcmd);
3100 
3101  switch (cmd->subtype)
3102  {
3103  case AT_AddColumn:
3104  case AT_AddColumnRecurse:
3105  {
3106  ColumnDef *def = castNode(ColumnDef, cmd->def);
3107 
3108  transformColumnDefinition(&cxt, def);
3109 
3110  /*
3111  * If the column has a non-null default, we can't skip
3112  * validation of foreign keys.
3113  */
3114  if (def->raw_default != NULL)
3115  skipValidation = false;
3116 
3117  /*
3118  * All constraints are processed in other ways. Remove the
3119  * original list
3120  */
3121  def->constraints = NIL;
3122 
3123  newcmds = lappend(newcmds, cmd);
3124  break;
3125  }
3126 
3127  case AT_AddConstraint:
3128  case AT_AddConstraintRecurse:
3129 
3130  /*
3131  * The original AddConstraint cmd node doesn't go to newcmds
3132  */
3133  if (IsA(cmd->def, Constraint))
3134  {
3135  transformTableConstraint(&cxt, (Constraint *) cmd->def);
3136  if (((Constraint *) cmd->def)->contype == CONSTR_FOREIGN)
3137  skipValidation = false;
3138  }
3139  else
3140  elog(ERROR, "unrecognized node type: %d",
3141  (int) nodeTag(cmd->def));
3142  break;
3143 
3144  case AT_AlterColumnType:
3145  {
3146  ColumnDef *def = castNode(ColumnDef, cmd->def);
3147  AttrNumber attnum;
3148 
3149  /*
3150  * For ALTER COLUMN TYPE, transform the USING clause if
3151  * one was specified.
3152  */
3153  if (def->raw_default)
3154  {
3155  def->cooked_default =
3156  transformExpr(pstate, def->raw_default,
3157  EXPR_KIND_ALTER_COL_TRANSFORM);
3158  }
3159 
3160  /*
3161  * For identity column, create ALTER SEQUENCE command to
3162  * change the data type of the sequence.
3163  */
3164  attnum = get_attnum(relid, cmd->name);
3165  if (attnum == InvalidAttrNumber)
3166  ereport(ERROR,
3167  (errcode(ERRCODE_UNDEFINED_COLUMN),
3168  errmsg("column \"%s\" of relation \"%s\" does not exist",
3169  cmd->name, RelationGetRelationName(rel))));
3170 
3171  if (TupleDescAttr(tupdesc, attnum - 1)->attidentity)
3172  {
3173  Oid seq_relid = getIdentitySequence(relid, attnum, false);
3174  Oid typeOid = typenameTypeId(pstate, def->typeName);
3175  AlterSeqStmt *altseqstmt = makeNode(AlterSeqStmt);
3176 
3177  altseqstmt->sequence = makeRangeVar(get_namespace_name(get_rel_namespace(seq_relid)),
3178  get_rel_name(seq_relid),
3179  -1);
3180  altseqstmt->options = list_make1(makeDefElem("as", (Node *) makeTypeNameFromOid(typeOid, -1), -1));
3181  altseqstmt->for_identity = true;
3182  cxt.blist = lappend(cxt.blist, altseqstmt);
3183  }
3184 
3185  newcmds = lappend(newcmds, cmd);
3186  break;
3187  }
3188 
3189  case AT_AddIdentity:
3190  {
3191  Constraint *def = castNode(Constraint, cmd->def);
3192  ColumnDef *newdef = makeNode(ColumnDef);
3193  AttrNumber attnum;
3194 
3195  newdef->colname = cmd->name;
3196  newdef->identity = def->generated_when;
3197  cmd->def = (Node *) newdef;
3198 
3199  attnum = get_attnum(relid, cmd->name);
3200  if (attnum == InvalidAttrNumber)
3201  ereport(ERROR,
3202  (errcode(ERRCODE_UNDEFINED_COLUMN),
3203  errmsg("column \"%s\" of relation \"%s\" does not exist",
3204  cmd->name, RelationGetRelationName(rel))));
3205 
3206  generateSerialExtraStmts(&cxt, newdef,
3207  get_atttype(relid, attnum),
3208  def->options, true, true,
3209  NULL, NULL);
3210 
3211  newcmds = lappend(newcmds, cmd);
3212  break;
3213  }
3214 
3215  case AT_SetIdentity:
3216  {
3217  /*
3218  * Create an ALTER SEQUENCE statement for the internal
3219  * sequence of the identity column.
3220  */
3221  ListCell *lc;
3222  List *newseqopts = NIL;
3223  List *newdef = NIL;
3224  AttrNumber attnum;
3225  Oid seq_relid;
3226 
3227  /*
3228  * Split options into those handled by ALTER SEQUENCE and
3229  * those for ALTER TABLE proper.
3230  */
3231  foreach(lc, castNode(List, cmd->def))
3232  {
3233  DefElem *def = lfirst_node(DefElem, lc);
3234 
3235  if (strcmp(def->defname, "generated") == 0)
3236  newdef = lappend(newdef, def);
3237  else
3238  newseqopts = lappend(newseqopts, def);
3239  }
3240 
3241  attnum = get_attnum(relid, cmd->name);
3242  if (attnum == InvalidAttrNumber)
3243  ereport(ERROR,
3244  (errcode(ERRCODE_UNDEFINED_COLUMN),
3245  errmsg("column \"%s\" of relation \"%s\" does not exist",
3246  cmd->name, RelationGetRelationName(rel))));
3247 
3248  seq_relid = getIdentitySequence(relid, attnum, true);
3249 
3250  if (seq_relid)
3251  {
3252  AlterSeqStmt *seqstmt;
3253 
3254  seqstmt = makeNode(AlterSeqStmt);
3255  seqstmt->sequence = makeRangeVar(get_namespace_name(get_rel_namespace(seq_relid)),
3256  get_rel_name(seq_relid), -1);
3257  seqstmt->options = newseqopts;
3258  seqstmt->for_identity = true;
3259  seqstmt->missing_ok = false;
3260 
3261  cxt.blist = lappend(cxt.blist, seqstmt);
3262  }
3263 
3264  /*
3265  * If column was not an identity column, we just let the
3266  * ALTER TABLE command error out later. (There are cases
3267  * this fails to cover, but we'll need to restructure
3268  * where creation of the sequence dependency linkage
3269  * happens before we can fix it.)
3270  */
3271 
3272  cmd->def = (Node *) newdef;
3273  newcmds = lappend(newcmds, cmd);
3274  break;
3275  }
3276 
3277  case AT_AttachPartition:
3278  case AT_DetachPartition:
3279  {
3280  PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
3281 
3282  transformPartitionCmd(&cxt, partcmd);
3283  /* assign transformed value of the partition bound */
3284  partcmd->bound = cxt.partbound;
3285  }
3286 
3287  newcmds = lappend(newcmds, cmd);
3288  break;
3289 
3290  default:
3291 
3292  /*
3293  * Currently, we shouldn't actually get here for subcommand
3294  * types that don't require transformation; but if we do, just
3295  * emit them unchanged.
3296  */
3297  newcmds = lappend(newcmds, cmd);
3298  break;
3299  }
3300  }
3301 
3302  /*
3303  * Transfer anything we already have in cxt.alist into save_alist, to keep
3304  * it separate from the output of transformIndexConstraints.
3305  */
3306  save_alist = cxt.alist;
3307  cxt.alist = NIL;
3308 
3309  /* Postprocess constraints */
3310  transformIndexConstraints(&cxt);
3311  transformFKConstraints(&cxt, skipValidation, true);
3312  transformCheckConstraints(&cxt, false);
3313 
3314  /*
3315  * Push any index-creation commands into the ALTER, so that they can be
3316  * scheduled nicely by tablecmds.c. Note that tablecmds.c assumes that
3317  * the IndexStmt attached to an AT_AddIndex or AT_AddIndexConstraint
3318  * subcommand has already been through transformIndexStmt.
3319  */
3320  foreach(l, cxt.alist)
3321  {
3322  Node *istmt = (Node *) lfirst(l);
3323 
3324  /*
3325  * We assume here that cxt.alist contains only IndexStmts and possibly
3326  * ALTER TABLE SET NOT NULL statements generated from primary key
3327  * constraints. We absorb the subcommands of the latter directly.
3328  */
3329  if (IsA(istmt, IndexStmt))
3330  {
3331  IndexStmt *idxstmt = (IndexStmt *) istmt;
3332 
3333  idxstmt = transformIndexStmt(relid, idxstmt, queryString);
3334  newcmd = makeNode(AlterTableCmd);
3335  newcmd->subtype = OidIsValid(idxstmt->indexOid) ? AT_AddIndexConstraint : AT_AddIndex;
3336  newcmd->def = (Node *) idxstmt;
3337  newcmds = lappend(newcmds, newcmd);
3338  }
3339  else if (IsA(istmt, AlterTableStmt))
3340  {
3341  AlterTableStmt *alterstmt = (AlterTableStmt *) istmt;
3342 
3343  newcmds = list_concat(newcmds, alterstmt->cmds);
3344  }
3345  else
3346  elog(ERROR, "unexpected stmt type %d", (int) nodeTag(istmt));
3347  }
3348  cxt.alist = NIL;
3349 
3350  /* Append any CHECK or FK constraints to the commands list */
3351  foreach(l, cxt.ckconstraints)
3352  {
3353  newcmd = makeNode(AlterTableCmd);
3354  newcmd->subtype = AT_AddConstraint;
3355  newcmd->def = (Node *) lfirst(l);
3356  newcmds = lappend(newcmds, newcmd);
3357  }
3358  foreach(l, cxt.fkconstraints)
3359  {
3360  newcmd = makeNode(AlterTableCmd);
3361  newcmd->subtype = AT_AddConstraint;
3362  newcmd->def = (Node *) lfirst(l);
3363  newcmds = lappend(newcmds, newcmd);
3364  }
3365 
3366  /* Append extended statistic objects */
3367  transformExtendedStatistics(&cxt);
3368 
3369  /* Close rel */
3370  relation_close(rel, NoLock);
3371 
3372  /*
3373  * Output results.
3374  */
3375  stmt->cmds = newcmds;
3376 
3377  *beforeStmts = cxt.blist;
3378  *afterStmts = list_concat(cxt.alist, save_alist);
3379 
3380  return stmt;
3381 }
3382 
3383 
3384 /*
3385  * Preprocess a list of column constraint clauses
3386  * to attach constraint attributes to their primary constraint nodes
3387  * and detect inconsistent/misplaced constraint attributes.
3388  *
3389  * NOTE: currently, attributes are only supported for FOREIGN KEY, UNIQUE,
3390  * EXCLUSION, and PRIMARY KEY constraints, but someday they ought to be
3391  * supported for other constraint types.
3392  */
3393 static void
3394 transformConstraintAttrs(CreateStmtContext *cxt, List *constraintList)
3395 {
3396  Constraint *lastprimarycon = NULL;
3397  bool saw_deferrability = false;
3398  bool saw_initially = false;
3399  ListCell *clist;
3400 
3401 #define SUPPORTS_ATTRS(node) \
3402  ((node) != NULL && \
3403  ((node)->contype == CONSTR_PRIMARY || \
3404  (node)->contype == CONSTR_UNIQUE || \
3405  (node)->contype == CONSTR_EXCLUSION || \
3406  (node)->contype == CONSTR_FOREIGN))
3407 
3408  foreach(clist, constraintList)
3409  {
3410  Constraint *con = (Constraint *) lfirst(clist);
3411 
3412  if (!IsA(con, Constraint))
3413  elog(ERROR, "unrecognized node type: %d",
3414  (int) nodeTag(con));
3415  switch (con->contype)
3416  {
3417  case CONSTR_ATTR_DEFERRABLE:
3418  if (!SUPPORTS_ATTRS(lastprimarycon))
3419  ereport(ERROR,
3420  (errcode(ERRCODE_SYNTAX_ERROR),
3421  errmsg("misplaced DEFERRABLE clause"),
3422  parser_errposition(cxt->pstate, con->location)));
3423  if (saw_deferrability)
3424  ereport(ERROR,
3425  (errcode(ERRCODE_SYNTAX_ERROR),
3426  errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
3427  parser_errposition(cxt->pstate, con->location)));
3428  saw_deferrability = true;
3429  lastprimarycon->deferrable = true;
3430  break;
3431 
3432  case CONSTR_ATTR_NOT_DEFERRABLE:
3433  if (!SUPPORTS_ATTRS(lastprimarycon))
3434  ereport(ERROR,
3435  (errcode(ERRCODE_SYNTAX_ERROR),
3436  errmsg("misplaced NOT DEFERRABLE clause"),
3437  parser_errposition(cxt->pstate, con->location)));
3438  if (saw_deferrability)
3439  ereport(ERROR,
3440  (errcode(ERRCODE_SYNTAX_ERROR),
3441  errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
3442  parser_errposition(cxt->pstate, con->location)));
3443  saw_deferrability = true;
3444  lastprimarycon->deferrable = false;
3445  if (saw_initially &&
3446  lastprimarycon->initdeferred)
3447  ereport(ERROR,
3448  (errcode(ERRCODE_SYNTAX_ERROR),
3449  errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
3450  parser_errposition(cxt->pstate, con->location)));
3451  break;
3452 
3453  case CONSTR_ATTR_DEFERRED:
3454  if (!SUPPORTS_ATTRS(lastprimarycon))
3455  ereport(ERROR,
3456  (errcode(ERRCODE_SYNTAX_ERROR),
3457  errmsg("misplaced INITIALLY DEFERRED clause"),
3458  parser_errposition(cxt->pstate, con->location)));
3459  if (saw_initially)
3460  ereport(ERROR,
3461  (errcode(ERRCODE_SYNTAX_ERROR),
3462  errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
3463  parser_errposition(cxt->pstate, con->location)));
3464  saw_initially = true;
3465  lastprimarycon->initdeferred = true;
3466 
3467  /*
3468  * If only INITIALLY DEFERRED appears, assume DEFERRABLE
3469  */
3470  if (!saw_deferrability)
3471  lastprimarycon->deferrable = true;
3472  else if (!lastprimarycon->deferrable)
3473  ereport(ERROR,
3474  (errcode(ERRCODE_SYNTAX_ERROR),
3475  errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
3476  parser_errposition(cxt->pstate, con->location)));
3477  break;
3478 
3479  case CONSTR_ATTR_IMMEDIATE:
3480  if (!SUPPORTS_ATTRS(lastprimarycon))
3481  ereport(ERROR,
3482  (errcode(ERRCODE_SYNTAX_ERROR),
3483  errmsg("misplaced INITIALLY IMMEDIATE clause"),
3484  parser_errposition(cxt->pstate, con->location)));
3485  if (saw_initially)
3486  ereport(ERROR,
3487  (errcode(ERRCODE_SYNTAX_ERROR),
3488  errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
3489  parser_errposition(cxt->pstate, con->location)));
3490  saw_initially = true;
3491  lastprimarycon->initdeferred = false;
3492  break;
3493 
3494  default:
3495  /* Otherwise it's not an attribute */
3496  lastprimarycon = con;
3497  /* reset flags for new primary node */
3498  saw_deferrability = false;
3499  saw_initially = false;
3500  break;
3501  }
3502  }
3503 }
3504 
3505 /*
3506  * Special handling of type definition for a column
3507  */
3508 static void
3509 transformColumnType(CreateStmtContext *cxt, ColumnDef *column)
3510 {
3511  /*
3512  * All we really need to do here is verify that the type is valid,
3513  * including any collation spec that might be present.
3514  */
3515  Type ctype = typenameType(cxt->pstate, column->typeName, NULL);
3516 
3517  if (column->collClause)
3518  {
3519  Form_pg_type typtup = (Form_pg_type) GETSTRUCT(ctype);
3520 
3521  LookupCollation(cxt->pstate,
3522  column->collClause->collname,
3523  column->collClause->location);
3524  /* Complain if COLLATE is applied to an uncollatable type */
3525  if (!OidIsValid(typtup->typcollation))
3526  ereport(ERROR,
3527  (errcode(ERRCODE_DATATYPE_MISMATCH),
3528  errmsg("collations are not supported by type %s",
3529  format_type_be(typtup->oid)),
3530  parser_errposition(cxt->pstate,
3531  column->collClause->location)));
3532  }
3533 
3534  ReleaseSysCache(ctype);
3535 }
3536 
3537 
3538 /*
3539  * transformCreateSchemaStmt -
3540  * analyzes the CREATE SCHEMA statement
3541  *
3542  * Split the schema element list into individual commands and place
3543  * them in the result list in an order such that there are no forward
3544  * references (e.g. GRANT to a table created later in the list). Note
3545  * that the logic we use for determining forward references is
3546  * presently quite incomplete.
3547  *
3548  * SQL also allows constraints to make forward references, so thumb through
3549  * the table columns and move forward references to a posterior alter-table
3550  * command.
3551  *
3552  * The result is a list of parse nodes that still need to be analyzed ---
3553  * but we can't analyze the later commands until we've executed the earlier
3554  * ones, because of possible inter-object references.
3555  *
3556  * Note: this breaks the rules a little bit by modifying schema-name fields
3557  * within passed-in structs. However, the transformation would be the same
3558  * if done over, so it should be all right to scribble on the input to this
3559  * extent.
3560  */
3561 List *
3562 transformCreateSchemaStmt(CreateSchemaStmt *stmt)
3563 {
3564  CreateSchemaStmtContext cxt;
3565  List *result;
3566  ListCell *elements;
3567 
3568  cxt.stmtType = "CREATE SCHEMA";
3569  cxt.schemaname = stmt->schemaname;
3570  cxt.authrole = (RoleSpec *) stmt->authrole;
3571  cxt.sequences = NIL;
3572  cxt.tables = NIL;
3573  cxt.views = NIL;
3574  cxt.indexes = NIL;
3575  cxt.triggers = NIL;
3576  cxt.grants = NIL;
3577 
3578  /*
3579  * Run through each schema element in the schema element list. Separate
3580  * statements by type, and do preliminary analysis.
3581  */
3582  foreach(elements, stmt->schemaElts)
3583  {
3584  Node *element = lfirst(elements);
3585 
3586  switch (nodeTag(element))
3587  {
3588  case T_CreateSeqStmt:
3589  {
3590  CreateSeqStmt *elp = (CreateSeqStmt *) element;
3591 
3592  setSchemaName(cxt.schemaname, &elp->sequence->schemaname);
3593  cxt.sequences = lappend(cxt.sequences, element);
3594  }
3595  break;
3596 
3597  case T_CreateStmt:
3598  {
3599  CreateStmt *elp = (CreateStmt *) element;
3600 
3601  setSchemaName(cxt.schemaname, &elp->relation->schemaname);
3602 
3603  /*
3604  * XXX todo: deal with constraints
3605  */
3606  cxt.tables = lappend(cxt.tables, element);
3607  }
3608  break;
3609 
3610  case T_ViewStmt:
3611  {
3612  ViewStmt *elp = (ViewStmt *) element;
3613 
3614  setSchemaName(cxt.schemaname, &elp->view->schemaname);
3615 
3616  /*
3617  * XXX todo: deal with references between views
3618  */
3619  cxt.views = lappend(cxt.views, element);
3620  }
3621  break;
3622 
3623  case T_IndexStmt:
3624  {
3625  IndexStmt *elp = (IndexStmt *) element;
3626 
3627  setSchemaName(cxt.schemaname, &elp->relation->schemaname);
3628  cxt.indexes = lappend(cxt.indexes, element);
3629  }
3630  break;
3631 
3632  case T_CreateTrigStmt:
3633  {
3634  CreateTrigStmt *elp = (CreateTrigStmt *) element;
3635 
3636  setSchemaName(cxt.schemaname, &elp->relation->schemaname);
3637  cxt.triggers = lappend(cxt.triggers, element);
3638  }
3639  break;
3640 
3641  case T_GrantStmt:
3642  cxt.grants = lappend(cxt.grants, element);
3643  break;
3644 
3645  default:
3646  elog(ERROR, "unrecognized node type: %d",
3647  (int) nodeTag(element));
3648  }
3649  }
3650 
3651  result = NIL;
3652  result = list_concat(result, cxt.sequences);
3653  result = list_concat(result, cxt.tables);
3654  result = list_concat(result, cxt.views);
3655  result = list_concat(result, cxt.indexes);
3656  result = list_concat(result, cxt.triggers);
3657  result = list_concat(result, cxt.grants);
3658 
3659  return result;
3660 }
3661 
3662 /*
3663  * setSchemaName
3664  * Set or check schema name in an element of a CREATE SCHEMA command
3665  */
3666 static void
3667 setSchemaName(char *context_schema, char **stmt_schema_name)
3668 {
3669  if (*stmt_schema_name == NULL)
3670  *stmt_schema_name = context_schema;
3671  else if (strcmp(context_schema, *stmt_schema_name) != 0)
3672  ereport(ERROR,
3673  (errcode(ERRCODE_INVALID_SCHEMA_DEFINITION),
3674  errmsg("CREATE specifies a schema (%s) "
3675  "different from the one being created (%s)",
3676  *stmt_schema_name, context_schema)));
3677 }
3678 
3679 /*
3680  * transformPartitionCmd
3681  * Analyze the ATTACH/DETACH PARTITION command
3682  *
3683  * In case of the ATTACH PARTITION command, cxt->partbound is set to the
3684  * transformed value of cmd->bound.
3685  */
3686 static void
3687 transformPartitionCmd(CreateStmtContext *cxt, PartitionCmd *cmd)
3688 {
3689  Relation parentRel = cxt->rel;
3690 
3691  switch (parentRel->rd_rel->relkind)
3692  {
3693  case RELKIND_PARTITIONED_TABLE:
3694  /* transform the partition bound, if any */
3695  Assert(RelationGetPartitionKey(parentRel) != NULL);
3696  if (cmd->bound != NULL)
3697  cxt->partbound = transformPartitionBound(cxt->pstate, parentRel,
3698  cmd->bound);
3699  break;
3700  case RELKIND_PARTITIONED_INDEX:
3701  /* nothing to check */
3702  Assert(cmd->bound == NULL);
3703  break;
3704  case RELKIND_RELATION:
3705  /* the table must be partitioned */
3706  ereport(ERROR,
3707  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3708  errmsg("table \"%s\" is not partitioned",
3709  RelationGetRelationName(parentRel))));
3710  break;
3711  case RELKIND_INDEX:
3712  /* the index must be partitioned */
3713  ereport(ERROR,
3714  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3715  errmsg("index \"%s\" is not partitioned",
3716  RelationGetRelationName(parentRel))));
3717  break;
3718  default:
3719  /* parser shouldn't let this case through */
3720  elog(ERROR, "\"%s\" is not a partitioned table or index",
3721  RelationGetRelationName(parentRel));
3722  break;
3723  }
3724 }
3725 
3726 /*
3727  * transformPartitionBound
3728  *
3729  * Transform a partition bound specification
3730  */
3731 PartitionBoundSpec *
3732 transformPartitionBound(ParseState *pstate, Relation parent,
3733  PartitionBoundSpec *spec)
3734 {
3735  PartitionBoundSpec *result_spec;
3736  PartitionKey key = RelationGetPartitionKey(parent);
3737  char strategy = get_partition_strategy(key);
3738  int partnatts = get_partition_natts(key);
3739  List *partexprs = get_partition_exprs(key);
3740 
3741  /* Avoid scribbling on input */
3742  result_spec = copyObject(spec);
3743 
3744  if (spec->is_default)
3745  {
3746  /*
3747  * Hash partitioning does not support a default partition; there's no
3748  * use case for it (since the set of partitions to create is perfectly
3749  * defined), and if users do get into it accidentally, it's hard to
3750  * back out from it afterwards.
3751  */
3752  if (strategy == PARTITION_STRATEGY_HASH)
3753  ereport(ERROR,
3754  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3755  errmsg("a hash-partitioned table may not have a default partition")));
3756 
3757  /*
3758  * In case of the default partition, parser had no way to identify the
3759  * partition strategy. Assign the parent's strategy to the default
3760  * partition bound spec.
3761  */
3762  result_spec->strategy = strategy;
3763 
3764  return result_spec;
3765  }
3766 
3767  if (strategy == PARTITION_STRATEGY_HASH)
3768  {
3769  if (spec->strategy != PARTITION_STRATEGY_HASH)
3770  ereport(ERROR,
3771  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3772  errmsg("invalid bound specification for a hash partition"),
3773  parser_errposition(pstate, exprLocation((Node *) spec))));
3774 
3775  if (spec->modulus <= 0)
3776  ereport(ERROR,
3777  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3778  errmsg("modulus for hash partition must be a positive integer")));
3779 
3780  Assert(spec->remainder >= 0);
3781 
3782  if (spec->remainder >= spec->modulus)
3783  ereport(ERROR,
3784  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3785  errmsg("remainder for hash partition must be less than modulus")));
3786  }
3787  else if (strategy == PARTITION_STRATEGY_LIST)
3788  {
3789  ListCell *cell;
3790  char *colname;
3791  Oid coltype;
3792  int32 coltypmod;
3793  Oid partcollation;
3794 
3795  if (spec->strategy != PARTITION_STRATEGY_LIST)
3796  ereport(ERROR,
3797  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3798  errmsg("invalid bound specification for a list partition"),
3799  parser_errposition(pstate, exprLocation((Node *) spec))));
3800 
3801  /* Get the only column's name in case we need to output an error */
3802  if (key->partattrs[0] != 0)
3803  colname = get_attname(RelationGetRelid(parent),
3804  key->partattrs[0], false);
3805  else
3806  colname = deparse_expression((Node *) linitial(partexprs),
3807  deparse_context_for(RelationGetRelationName(parent),
3808  RelationGetRelid(parent)),
3809  false, false);
3810  /* Need its type data too */
3811  coltype = get_partition_col_typid(key, 0);
3812  coltypmod = get_partition_col_typmod(key, 0);
3813  partcollation = get_partition_col_collation(key, 0);
3814 
3815  result_spec->listdatums = NIL;
3816  foreach(cell, spec->listdatums)
3817  {
3818  Node *expr = lfirst(cell);
3819  Const *value;
3820  ListCell *cell2;
3821  bool duplicate;
3822 
3823  value = transformPartitionBoundValue(pstate, expr,
3824  colname, coltype, coltypmod,
3825  partcollation);
3826 
3827  /* Don't add to the result if the value is a duplicate */
3828  duplicate = false;
3829  foreach(cell2, result_spec->listdatums)
3830  {
3831  Const *value2 = castNode(Const, lfirst(cell2));
3832 
3833  if (equal(value, value2))
3834  {
3835  duplicate = true;
3836  break;
3837  }
3838  }
3839  if (duplicate)
3840  continue;
3841 
3842  result_spec->listdatums = lappend(result_spec->listdatums,
3843  value);
3844  }
3845  }
3846  else if (strategy == PARTITION_STRATEGY_RANGE)
3847  {
3848  if (spec->strategy != PARTITION_STRATEGY_RANGE)
3849  ereport(ERROR,
3850  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3851  errmsg("invalid bound specification for a range partition"),
3852  parser_errposition(pstate, exprLocation((Node *) spec))));
3853 
3854  if (list_length(spec->lowerdatums) != partnatts)
3855  ereport(ERROR,
3856  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3857  errmsg("FROM must specify exactly one value per partitioning column")));
3858  if (list_length(spec->upperdatums) != partnatts)
3859  ereport(ERROR,
3860  (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
3861  errmsg("TO must specify exactly one value per partitioning column")));
3862 
3863  /*
3864  * Convert raw parse nodes into PartitionRangeDatum nodes and perform
3865  * any necessary validation.
3866  */
3867  result_spec->lowerdatums =
3868  transformPartitionRangeBounds(pstate, spec->lowerdatums,
3869  parent);
3870  result_spec->upperdatums =
3871  transformPartitionRangeBounds(pstate, spec->upperdatums,
3872  parent);
3873  }
3874  else
3875  elog(ERROR, "unexpected partition strategy: %d", (int) strategy);
3876 
3877  return result_spec;
3878 }
3879 
3880 /*
3881  * transformPartitionRangeBounds
3882  * This converts the expressions for range partition bounds from the raw
3883  * grammar representation to PartitionRangeDatum structs
3884  */
3885 static List *
3886 transformPartitionRangeBounds(ParseState *pstate, List *blist,
3887  Relation parent)
3888 {
3889  List *result = NIL;
3890  PartitionKey key = RelationGetPartitionKey(parent);
3891  List *partexprs = get_partition_exprs(key);
3892  ListCell *lc;
3893  int i,
3894  j;
3895 
3896  i = j = 0;
3897  foreach(lc, blist)
3898  {
3899  Node *expr = lfirst(lc);
3900  PartitionRangeDatum *prd = NULL;
3901 
3902  /*
3903  * Infinite range bounds -- "minvalue" and "maxvalue" -- get passed in
3904  * as ColumnRefs.
3905  */
3906  if (IsA(expr, ColumnRef))
3907  {
3908  ColumnRef *cref = (ColumnRef *) expr;
3909  char *cname = NULL;
3910 
3911  /*
3912  * There should be a single field named either "minvalue" or
3913  * "maxvalue".
3914  */
3915  if (list_length(cref->fields) == 1 &&
3916  IsA(linitial(cref->fields), String))
3917  cname = strVal(linitial(cref->fields));
3918 
3919  if (cname == NULL)
3920  {
3921  /*
3922  * ColumnRef is not in the desired single-field-name form. For
3923  * consistency between all partition strategies, let the
3924  * expression transformation report any errors rather than
3925  * doing it ourselves.
3926  */
3927  }
3928  else if (strcmp("minvalue", cname) == 0)
3929  {
3930  prd = makeNode(PartitionRangeDatum);
3931  prd->kind = PARTITION_RANGE_DATUM_MINVALUE;
3932  prd->value = NULL;
3933  }
3934  else if (strcmp("maxvalue", cname) == 0)
3935  {
3936  prd = makeNode(PartitionRangeDatum);
3937  prd->kind = PARTITION_RANGE_DATUM_MAXVALUE;
3938  prd->value = NULL;
3939  }
3940  }
3941 
3942  if (prd == NULL)
3943  {
3944  char *colname;
3945  Oid coltype;
3946  int32 coltypmod;
3947  Oid partcollation;
3948  Const *value;
3949 
3950  /* Get the column's name in case we need to output an error */
3951  if (key->partattrs[i] != 0)
3952  colname = get_attname(RelationGetRelid(parent),
3953  key->partattrs[i], false);
3954  else
3955  {
3956  colname = deparse_expression((Node *) list_nth(partexprs, j),
3957  deparse_context_for(RelationGetRelationName(parent),
3958  RelationGetRelid(parent)),
3959  false, false);
3960  ++j;
3961  }
3962 
3963  /* Need its type data too */
3964  coltype = get_partition_col_typid(key, i);
3965  coltypmod = get_partition_col_typmod(key, i);
3966  partcollation = get_partition_col_collation(key, i);
3967 
3968  value = transformPartitionBoundValue(pstate, expr,
3969  colname,
3970  coltype, coltypmod,
3971  partcollation);
3972  if (value->constisnull)
3973  ereport(ERROR,
3974  (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3975  errmsg("cannot specify NULL in range bound")));
3976  prd = makeNode(PartitionRangeDatum);
3977  prd->kind = PARTITION_RANGE_DATUM_VALUE;
3978  prd->value = (Node *) value;
3979  ++i;
3980  }
3981 
3982  prd->location = exprLocation(expr);
3983 
3984  result = lappend(result, prd);
3985  }
3986 
3987  /*
3988  * Once we see MINVALUE or MAXVALUE for one column, the remaining columns
3989  * must be the same.
3990  */
3991  validateInfiniteBounds(pstate, result);
3992 
3993  return result;
3994 }
3995 
3996 /*
3997  * validateInfiniteBounds
3998  *
3999  * Check that a MAXVALUE or MINVALUE specification in a partition bound is
4000  * followed only by more of the same.
4001  */
4002 static void
4003 validateInfiniteBounds(ParseState *pstate, List *blist)
4004 {
4005  ListCell *lc;
4006  PartitionRangeDatumKind kind = PARTITION_RANGE_DATUM_VALUE;
4007 
4008  foreach(lc, blist)
4009  {
4010  PartitionRangeDatum *prd = castNode(PartitionRangeDatum, lfirst(lc));
4011 
4012  if (kind == prd->kind)
4013  continue;
4014 
4015  switch (kind)
4016  {
4017  case PARTITION_RANGE_DATUM_VALUE:
4018  kind = prd->kind;
4019  break;
4020 
4021  case PARTITION_RANGE_DATUM_MAXVALUE:
4022  ereport(ERROR,
4023  (errcode(ERRCODE_DATATYPE_MISMATCH),
4024  errmsg("every bound following MAXVALUE must also be MAXVALUE"),
4025  parser_errposition(pstate, exprLocation((Node *) prd))));
4026  break;
4027 
4028  case PARTITION_RANGE_DATUM_MINVALUE:
4029  ereport(ERROR,
4030  (errcode(ERRCODE_DATATYPE_MISMATCH),
4031  errmsg("every bound following MINVALUE must also be MINVALUE"),
4032  parser_errposition(pstate, exprLocation((Node *) prd))));
4033  break;
4034  }
4035  }
4036 }
4037 
4038 /*
4039  * Transform one constant in a partition bound spec
4040  */
4041 static Const *
4042 transformPartitionBoundValue(ParseState *pstate, Node *val,
4043  const char *colName, Oid colType, int32 colTypmod,
4044  Oid partCollation)
4045 {
4046  Node *value;
4047 
4048  /* Transform raw parsetree */
4049  value = transformExpr(pstate, val, EXPR_KIND_PARTITION_BOUND);
4050 
4051  /*
4052  * Check that the input expression's collation is compatible with one
4053  * specified for the parent's partition key (partcollation). Don't throw
4054  * an error if it's the default collation which we'll replace with the
4055  * parent's collation anyway.
4056  */
4057  if (IsA(value, CollateExpr))
4058  {
4059  Oid exprCollOid = exprCollation(value);
4060 
4061  if (OidIsValid(exprCollOid) &&
4062  exprCollOid != DEFAULT_COLLATION_OID &&
4063  exprCollOid != partCollation)
4064  ereport(ERROR,
4065  (errcode(ERRCODE_DATATYPE_MISMATCH),
4066  errmsg("collation of partition bound value for column \"%s\" does not match partition key collation \"%s\"",
4067  colName, get_collation_name(partCollation)),
4068  parser_errposition(pstate, exprLocation(value))));
4069  }
4070 
4071  /* Coerce to correct type */
4072  value = coerce_to_target_type(pstate,
4073  value, exprType(value),
4074  colType,
4075  colTypmod,
4076  COERCION_ASSIGNMENT,
4077  COERCE_IMPLICIT_CAST,
4078  -1);
4079 
4080  if (value == NULL)
4081  ereport(ERROR,
4082  (errcode(ERRCODE_DATATYPE_MISMATCH),
4083  errmsg("specified value cannot be cast to type %s for column \"%s\"",
4084  format_type_be(colType), colName),
4085  parser_errposition(pstate, exprLocation(val))));
4086 
4087  /* Simplify the expression, in case we had a coercion */
4088  if (!IsA(value, Const))
4089  value = (Node *) expression_planner((Expr *) value);
4090 
4091  /*
4092  * transformExpr() should have already rejected column references,
4093  * subqueries, aggregates, window functions, and SRFs, based on the
4094  * EXPR_KIND_ for a default expression.
4095  */
4096  Assert(!contain_var_clause(value));
4097 
4098  /*
4099  * Evaluate the expression, assigning the partition key's collation to the
4100  * resulting Const expression.
4101  */
4102  value = (Node *) evaluate_expr((Expr *) value, colType, colTypmod,
4103  partCollation);
4104  if (!IsA(value, Const))
4105  elog(ERROR, "could not evaluate partition bound expression");
4106 
4107  return (Const *) value;
4108 }
list_make2
#define list_make2(x1, x2)
Definition: pg_list.h:229
IndexStmt::deferrable
bool deferrable
Definition: parsenodes.h:2788
CreateStmt::relation
RangeVar * relation
Definition: parsenodes.h:2069
CommentStmt::objtype
ObjectType objtype
Definition: parsenodes.h:2677
makeString
Value * makeString(char *str)
Definition: value.c:53
list_make3
#define list_make3(x1, x2, x3)
Definition: pg_list.h:231
evaluate_expr
Expr * evaluate_expr(Expr *expr, Oid result_type, int32 result_typmod, Oid result_collation)
Definition: clauses.c:4788
int16
signed short int16
Definition: c.h:346
EXPR_KIND_ALTER_COL_TRANSFORM
Definition: parse_node.h:72
NIL
#define NIL
Definition: pg_list.h:65
get_opclass
static List * get_opclass(Oid opclass, Oid actual_datatype)
Definition: parse_utilcmd.c:1816
oidvector
Definition: c.h:595
IndexStmt::primary
bool primary
Definition: parsenodes.h:2786
RelationData::rd_indam
struct IndexAmRoutine * rd_indam
Definition: rel.h:163
getInsertSelectQuery
Query * getInsertSelectQuery(Query *parsetree, Query ***subquery_ptr)
Definition: rewriteManip.c:924
CreateStmt::inhRelations
List * inhRelations
Definition: parsenodes.h:2071
SystemFuncName
List * SystemFuncName(char *name)
makeFromExpr
FromExpr * makeFromExpr(List *fromlist, Node *quals)
Definition: makefuncs.c:283
TypeName::typeOid
Oid typeOid
Definition: parsenodes.h:210
IsA
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
Constraint::keys
List * keys
Definition: parsenodes.h:2164
Constraint::exclusions
List * exclusions
Definition: parsenodes.h:2170
RelationData::rd_indoption
int16 * rd_indoption
Definition: rel.h:168
DEBUG1
#define DEBUG1
Definition: elog.h:25
table_close
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
A_Const
Definition: parsenodes.h:285
GetDefaultOpClass
Oid GetDefaultOpClass(Oid type_id, Oid am_id)
Definition: indexcmds.c:1937
IndexElem::ordering
SortByDir ordering
Definition: parsenodes.h:704
Constraint::generated_when
char generated_when
Definition: parsenodes.h:2161
GETSTRUCT
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
typenameType
Type typenameType(ParseState *pstate, const TypeName *typeName, int32 *typmod_p)
Definition: parse_type.c:264
TypeName::names
List * names
Definition: parsenodes.h:209
AMOID
Definition: syscache.h:36
generateSerialExtraStmts
static void generateSerialExtraStmts(CreateStmtContext *cxt, ColumnDef *column, Oid seqtypid, List *seqoptions, bool for_identity, bool col_exists, char **snamespace_p, char **sname_p)
Definition: parse_utilcmd.c:349
IndexStmt::options
List * options
Definition: parsenodes.h:2779
ColumnDef::storage
char storage
Definition: parsenodes.h:652
exprLocation
int exprLocation(const Node *expr)
Definition: nodeFuncs.c:1191
lookup_rowtype_tupdesc
TupleDesc lookup_rowtype_tupdesc(Oid type_id, int32 typmod)
Definition: typcache.c:1652
lnext
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:321
ColumnDef::is_local
bool is_local
Definition: parsenodes.h:649
Query::jointree
FromExpr * jointree
Definition: parsenodes.h:138
equal
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3018
RelationGetDescr
#define RelationGetDescr(relation)
Definition: rel.h:454
GetUserId
Oid GetUserId(void)
Definition: miscinit.c:380
castNode
#define castNode(_type_, nodeptr)
Definition: nodes.h:594
get_relation_constraint_oid
Oid get_relation_constraint_oid(Oid relid, const char *conname, bool missing_ok)
Definition: pg_constraint.c:838
ColumnDef::identity
char identity
Definition: parsenodes.h:655
PartitionRangeDatumKind
PartitionRangeDatumKind
Definition: parsenodes.h:834
IndexStmt::tableSpace
char * tableSpace
Definition: parsenodes.h:2775
get_partition_col_typmod
static int32 get_partition_col_typmod(PartitionKey key, int col)
Definition: partcache.h:91
TupleDescAttr
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
ColumnDef::constraints
List * constraints
Definition: parsenodes.h:661
get_collation_name
char * get_collation_name(Oid colloid)
Definition: lsyscache.c:923
DatumGetObjectId
#define DatumGetObjectId(X)
Definition: postgres.h:500
pstrdup
char * pstrdup(const char *in)
Definition: mcxt.c:1186
Constraint::raw_expr
Node * raw_expr
Definition: parsenodes.h:2159
get_partition_col_typid
static Oid get_partition_col_typid(PartitionKey key, int col)
Definition: partcache.h:85
get_rel_namespace
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1754
expression_planner
Expr * expression_planner(Expr *expr)
Definition: planner.c:6051
transformExpr
Node * transformExpr(ParseState *pstate, Node *expr, ParseExprKind exprKind)
Definition: parse_expr.c:145
PartitionRangeDatum::kind
PartitionRangeDatumKind kind
Definition: parsenodes.h:845
IndexStmt::whereClause
Node * whereClause
Definition: parsenodes.h:2780
EXPR_KIND_WHERE
Definition: parse_node.h:46
AccessShareLock
#define AccessShareLock
Definition: lockdefs.h:36
value
static struct @145 value
addNSItemToQuery
void addNSItemToQuery(ParseState *pstate, ParseNamespaceItem *nsitem, bool addToJoinList, bool addToRelNameSpace, bool addToVarNameSpace)
Definition: parse_relation.c:2466
Node
Definition: nodes.h:525
get_partition_natts
static int get_partition_natts(PartitionKey key)
Definition: partcache.h:64
strVal
#define strVal(v)
Definition: value.h:54
list_concat
List * list_concat(List *list1, const List *list2)
Definition: list.c:516
errcode
int errcode(int sqlerrcode)
Definition: elog.c:608
FigureIndexColname
char * FigureIndexColname(Node *node)
Definition: parse_target.c:1677
stringToNode
void * stringToNode(const char *str)
Definition: read.c:89
parse_relation.h
Constraint::initdeferred
bool initdeferred
Definition: parsenodes.h:2154
AlterTableCmd::subtype
AlterTableType subtype
Definition: parsenodes.h:1860
RuleStmt::actions
List * actions
Definition: parsenodes.h:2987
format_type_be
char * format_type_be(Oid type_oid)
Definition: format_type.c:326
parse_expr.h
CommentStmt::comment
char * comment
Definition: parsenodes.h:2679
generateClonedExtStatsStmt
static CreateStatsStmt * generateClonedExtStatsStmt(RangeVar *heapRel, Oid heapRelid, Oid source_statsid)
Definition: parse_utilcmd.c:1700
makeRangeVarFromNameList
RangeVar * makeRangeVarFromNameList(List *names)
Definition: namespace.c:3054
RangeTblEntry::requiredPerms
AclMode requiredPerms
Definition: parsenodes.h:1117
ColumnDef::generated
char generated
Definition: parsenodes.h:658
contain_var_clause
bool contain_var_clause(Node *node)
Definition: var.c:331
Constraint::conname
char * conname
Definition: parsenodes.h:2152
ColumnDef::is_not_null
bool is_not_null
Definition: parsenodes.h:650
list_delete_ptr
List * list_delete_ptr(List *list, void *datum)
Definition: list.c:797
ChooseRelationName
char * ChooseRelationName(const char *name1, const char *name2, const char *label, Oid namespaceid, bool isconstraint)
Definition: indexcmds.c:2132
CommentStmt::object
Node * object
Definition: parsenodes.h:2678
map_variable_attnos
Node * map_variable_attnos(Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
Definition: rewriteManip.c:1356
RelationGetPartitionKey
PartitionKey RelationGetPartitionKey(Relation rel)
Definition: partcache.c:54
RelationData::rd_rel
Form_pg_class rd_rel
Definition: rel.h:84
Oid
unsigned int Oid
Definition: postgres_ext.h:31
pg_type.h
linitial_node
#define linitial_node(type, l)
Definition: pg_list.h:198
getIdentitySequence
Oid getIdentitySequence(Oid relid, AttrNumber attnum, bool missing_ok)
Definition: pg_depend.c:780
OidIsValid
#define OidIsValid(objectId)
Definition: c.h:645
makeDefElem
DefElem * makeDefElem(char *name, Node *arg, int location)
Definition: makefuncs.c:544
RangeVarAdjustRelationPersistence
void RangeVarAdjustRelationPersistence(RangeVar *newRelation, Oid nspid)
Definition: namespace.c:633
parse_coerce.h
pg_collation.h
AlterSeqStmt::options
List * options
Definition: parsenodes.h:2553
ViewStmt::view
RangeVar * view
Definition: parsenodes.h:3112
int32
signed int int32
Definition: c.h:347
AttrMap
Definition: attmap.h:34
Constraint::options
List * options
Definition: parsenodes.h:2173
RelationGetIndexPredicate
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4677
TypeCast::location
int location
Definition: parsenodes.h:300
RelationData::rd_indextuple
struct HeapTupleData * rd_indextuple
Definition: rel.h:151
addRangeTableEntryForRelation
ParseNamespaceItem * addRangeTableEntryForRelation(ParseState *pstate, Relation rel, int lockmode, Alias *alias, bool inh, bool inFromCl)
Definition: parse_relation.c:1497
RangeVar::schemaname
char * schemaname
Definition: primnodes.h:67
make_parsestate
ParseState * make_parsestate(ParseState *parentParseState)
Definition: parse_node.c:43
IndexStmt::indexIncludingParams
List * indexIncludingParams
Definition: parsenodes.h:2777
TupleConstr::defval
AttrDefault * defval
Definition: tupdesc.h:39
ColumnRef::location
int location
Definition: parsenodes.h:236
index
Definition: type.h:89
parse_type.h
CreateStmt::constraints
List * constraints
Definition: parsenodes.h:2076
SystemAttributeDefinition
const FormData_pg_attribute * SystemAttributeDefinition(AttrNumber attno)
Definition: heap.c:249
transformPartitionBound
PartitionBoundSpec * transformPartitionBound(ParseState *pstate, Relation parent, PartitionBoundSpec *spec)
Definition: parse_utilcmd.c:3732
list_make1
#define list_make1(x1)
Definition: pg_list.h:227
CreateStmt::if_not_exists
bool if_not_exists
Definition: parsenodes.h:2081
RangeVar::location
int location
Definition: primnodes.h:73
ColumnDef::identitySequence
RangeVar * identitySequence
Definition: parsenodes.h:656
assign_expr_collations
void assign_expr_collations(ParseState *pstate, Node *expr)
Definition: parse_collate.c:177
CreateStmtContext::pstate
ParseState * pstate
Definition: parse_utilcmd.c:78
CreateStmt::partbound
PartitionBoundSpec * partbound
Definition: parsenodes.h:2073
ColumnDef::cooked_default
Node * cooked_default
Definition: parsenodes.h:654
makeAlias
Alias * makeAlias(const char *aliasname, List *colnames)
Definition: makefuncs.c:385
RangeVar::relname
char * relname
Definition: primnodes.h:68
EXPR_KIND_INDEX_PREDICATE
Definition: parse_node.h:71
IndexStmt::indexOid
Oid indexOid
Definition: parsenodes.h:2783
IndexElem::expr
Node * expr
Definition: parsenodes.h:700
CreateStmtContext::relation
RangeVar * relation
Definition: parse_utilcmd.c:80
IndexStmt::relation
RangeVar * relation
Definition: parsenodes.h:2773
CreateStmtContext::pkey
IndexStmt * pkey
Definition: parse_utilcmd.c:95
get_partition_exprs
static List * get_partition_exprs(PartitionKey key)
Definition: partcache.h:70
aclcheck_error
void aclcheck_error(AclResult aclerr, ObjectType objtype, const char *objectname)
Definition: aclchk.c:3352
ParseNamespaceItem::p_rte
RangeTblEntry * p_rte
Definition: parse_node.h:257
RelationData::rd_index
Form_pg_index rd_index
Definition: rel.h:149
CreateSchemaStmt::authrole
RoleSpec * authrole
Definition: parsenodes.h:1756
cancel_parser_errposition_callback
void cancel_parser_errposition_callback(ParseCallbackState *pcbstate)
Definition: parse_node.c:160
linitial
#define linitial(l)
Definition: pg_list.h:195
Query::rtable
List * rtable
Definition: parsenodes.h:137
RelationData::rd_indcollation
Oid * rd_indcollation
Definition: rel.h:174
IndexElem::nulls_ordering
SortByNulls nulls_ordering
Definition: parsenodes.h:705
ObjectIdGetDatum
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
ERROR
#define ERROR
Definition: elog.h:43
transformPartitionBoundValue
static Const * transformPartitionBoundValue(ParseState *pstate, Node *con, const char *colName, Oid colType, int32 colTypmod, Oid partCollation)
Definition: parse_utilcmd.c:4042
attname
NameData attname
Definition: pg_attribute.h:40
EXPR_KIND_INDEX_EXPRESSION
Definition: parse_node.h:70
transformConstraintAttrs
static void transformConstraintAttrs(CreateStmtContext *cxt, List *constraintList)
Definition: parse_utilcmd.c:3394
list_nth
static void * list_nth(const List *list, int n)
Definition: pg_list.h:277
transformPartitionRangeBounds
static List * transformPartitionRangeBounds(ParseState *pstate, List *blist, Relation parent)
Definition: parse_utilcmd.c:3886
Constraint::deferrable
bool deferrable
Definition: parsenodes.h:2153
coerce_to_target_type
Node * coerce_to_target_type(ParseState *pstate, Node *expr, Oid exprtype, Oid targettype, int32 targettypmod, CoercionContext ccontext, CoercionForm cformat, int location)
Definition: parse_coerce.c:78
relation_open
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: relation.c:48
ARR_DIMS
#define ARR_DIMS(a)
Definition: array.h:282
check_of_type
void check_of_type(HeapTuple typetuple)
Definition: tablecmds.c:5798
get_relname_relid
Oid get_relname_relid(const char *relname, Oid relnamespace)
Definition: lsyscache.c:1687
lfirst_node
#define lfirst_node(type, lc)
Definition: pg_list.h:193
SystemAttributeByName
const FormData_pg_attribute * SystemAttributeByName(const char *attname)
Definition: heap.c:261
ARR_DATA_PTR
#define ARR_DATA_PTR(a)
Definition: array.h:310
validateInfiniteBounds
static void validateInfiniteBounds(ParseState *pstate, List *blist)
Definition: parse_utilcmd.c:4003
get_namespace_name
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3094
get_index_am_oid
Oid get_index_am_oid(const char *amname, bool missing_ok)
Definition: amcmds.c:187
NoLock
#define NoLock
Definition: lockdefs.h:34
get_attnum
AttrNumber get_attnum(Oid relid, const char *attname)
Definition: lsyscache.c:806
RelationGetIndexExpressions
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4564
oidvector::values
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:603
TupleDescData::constr
TupleConstr * constr
Definition: tupdesc.h:85
IndexStmt::transformed
bool transformed
Definition: parsenodes.h:2790
ColumnDef::collOid
Oid collOid
Definition: parsenodes.h:660
Value::val
union Value::ValUnion val
ColumnDef::fdwoptions
List * fdwoptions
Definition: parsenodes.h:662
deparse_context_for
List * deparse_context_for(const char *aliasname, Oid relid)
Definition: ruleutils.c:3272
errdetail
int errdetail(const char *fmt,...)
Definition: elog.c:955
ConstrCheck::ccname
char * ccname
Definition: tupdesc.h:30
IndexElem::indexcolname
char * indexcolname
Definition: parsenodes.h:701
DEFAULT_INDEX_TYPE
#define DEFAULT_INDEX_TYPE
Definition: index.h:21
RelationGetRelationName
#define RelationGetRelationName(relation)
Definition: rel.h:462
list_head
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
Form_pg_attribute
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
transformColumnType
static void transformColumnType(CreateStmtContext *cxt, ColumnDef *column)
Definition: parse_utilcmd.c:3509
ARR_HASNULL
#define ARR_HASNULL(a)
Definition: array.h:279
ACL_USAGE
#define ACL_USAGE
Definition: parsenodes.h:82
get_index_constraint
Oid get_index_constraint(Oid indexId)
Definition: pg_depend.c:873
GetComment
char * GetComment(Oid oid, Oid classoid, int32 subid)
Definition: comment.c:409
ColumnDef::location
int location
Definition: parsenodes.h:663
Constraint::reset_default_tblspc
bool reset_default_tblspc
Definition: parsenodes.h:2176
ParseState::p_sourcetext
const char * p_sourcetext
Definition: parse_node.h:179
parse_collate.h
get_atttype
Oid get_atttype(Oid relid, AttrNumber attnum)
Definition: lsyscache.c:861
htup_details.h
ereport
#define ereport(elevel, rest)
Definition: elog.h:141
AlterTableStmt::relkind
ObjectType relkind
Definition: parsenodes.h:1776
AssertArg
#define AssertArg(condition)
Definition: c.h:741
setup_parser_errposition_callback
void setup_parser_errposition_callback(ParseCallbackState *pcbstate, ParseState *pstate, int location)
Definition: parse_node.c:144
pg_statistic_ext.h
CreateStmtContext::partbound
PartitionBoundSpec * partbound
Definition: parse_utilcmd.c:97
transformStmt
Query * transformStmt(ParseState *pstate, Node *parseTree)
Definition: analyze.c:254
DefElem::arg
Node * arg
Definition: parsenodes.h:731
ColumnDef::raw_default
Node * raw_default
Definition: parsenodes.h:653
lappend
List * lappend(List *list, void *datum)
Definition: list.c:322
typname
NameData typname
Definition: pg_type.h:41
element
static chr element(struct vars *v, const chr *startp, const chr *endp)
Definition: regc_locale.c:380
PRS2_OLD_VARNO
#define PRS2_OLD_VARNO
Definition: primnodes.h:178
IndexStmt::idxname
char * idxname
Definition: parsenodes.h:2772
quote_qualified_identifier
char * quote_qualified_identifier(const char *qualifier, const char *ident)
Definition: ruleutils.c:10781
Form_pg_index
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
SearchSysCache1
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
AttributeNumberIsValid
#define AttributeNumberIsValid(attributeNumber)
Definition: attnum.h:34
RangeVarGetAndCheckCreationNamespace
Oid RangeVarGetAndCheckCreationNamespace(RangeVar *relation, LOCKMODE lockmode, Oid *existing_relation_id)
Definition: namespace.c:526
makeFuncCall
FuncCall * makeFuncCall(List *name, List *args, int location)
Definition: makefuncs.c:583
SystemTypeName
TypeName * SystemTypeName(char *name)
TextDatumGetCString
#define TextDatumGetCString(d)
Definition: builtins.h:84
IndexStmt::reset_default_tblspc
bool reset_default_tblspc
Definition: parsenodes.h:2793
IndexStmt::if_not_exists
bool if_not_exists
Definition: parsenodes.h:2792
lsecond_node
#define lsecond_node(type, l)
Definition: pg_list.h:203
AclResult
AclResult
Definition: acl.h:177
PartitionKeyData::partattrs
AttrNumber * partattrs
Definition: partcache.h:28
Datum
uintptr_t Datum
Definition: postgres.h:367
ReleaseSysCache
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
ACL_SELECT
#define ACL_SELECT
Definition: parsenodes.h:75
SysCacheGetAttr
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:1377
transformIndexConstraint
static IndexStmt * transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
Definition: parse_utilcmd.c:1968
relation_openrv
Relation relation_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition: relation.c:138
IndexStmt::unique
bool unique
Definition: parsenodes.h:2785
TypeCast::typeName
TypeName * typeName
Definition: parsenodes.h:299
untransformRelOptions
List * untransformRelOptions(Datum options)
Definition: reloptions.c:1039
RelationData::rd_att
TupleDesc rd_att
Definition: rel.h:85
PARTITION_STRATEGY_HASH
#define PARTITION_STRATEGY_HASH
Definition: parsenodes.h:798
TupleConstr::num_check
uint16 num_check
Definition: tupdesc.h:43
EXPR_KIND_PARTITION_BOUND
Definition: parse_node.h:76
LookupCollation
Oid LookupCollation(ParseState *pstate, List *collnames, int location)
Definition: parse_type.c:513
IndexStmt::accessMethod
char * accessMethod
Definition: parsenodes.h:2774
makeTypeNameFromOid
TypeName * makeTypeNameFromOid(Oid typeOid, int32 typmod)
Definition: makefuncs.c:470
table_openrv
Relation table_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition: table.c:68
InvalidOid
#define InvalidOid
Definition: postgres_ext.h:36
AlterSeqStmt::sequence
RangeVar * sequence
Definition: parsenodes.h:2552
FormData_pg_attribute
FormData_pg_attribute
Definition: pg_attribute.h:184
attnum
int16 attnum
Definition: pg_attribute.h:79
Constraint::initially_valid
bool initially_valid
Definition: parsenodes.h:2195
get_typcollation
Oid get_typcollation(Oid typid)
Definition: lsyscache.c:2823
pg_constraint.h
CreateSeqStmt::sequence
RangeVar * sequence
Definition: parsenodes.h:2542
IndexElem::opclass
List * opclass
Definition: parsenodes.h:703
ColumnDef::is_from_type
bool is_from_type
Definition: parsenodes.h:651
NOTICE
#define NOTICE
Definition: elog.h:37
Query::commandType
CmdType commandType
Definition: parsenodes.h:112
CreateStmt::tableElts
List * tableElts
Definition: parsenodes.h:2070
lcons
List * lcons(void *datum, List *list)
Definition: list.c:454
Constraint::where_clause
Node * where_clause
Definition: parsenodes.h:2180
transformOfType
static void transformOfType(CreateStmtContext *cxt, TypeName *ofTypename)
Definition: parse_utilcmd.c:1282
makeNode
#define makeNode(_type_)
Definition: nodes.h:573
RuleStmt::event
CmdType event
Definition: parsenodes.h:2985
Form_pg_constraint
FormData_pg_constraint * Form_pg_constraint
Definition: pg_constraint.h:154
HeapTupleIsValid
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
relation_close
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: relation.c:206
Assert
#define Assert(condition)
Definition: c.h:739
lfirst
#define lfirst(lc)
Definition: pg_list.h:190
setSchemaName
static void setSchemaName(char *context_schema, char **stmt_schema_name)
Definition: parse_utilcmd.c:3667
pg_operator.h
A_Const::location
int location
Definition: parsenodes.h:289
transformColumnDefinition
static void transformColumnDefinition(CreateStmtContext *cxt, ColumnDef *column)
Definition: parse_utilcmd.c:509
DecrTupleDescRefCount
void DecrTupleDescRefCount(TupleDesc tupdesc)
Definition: tupdesc.c:393
generateClonedIndexStmt
IndexStmt * generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx, const AttrMap *attmap, Oid *constraintOid)
Definition: parse_utilcmd.c:1345
transformWhereClause
Node * transformWhereClause(ParseState *pstate, Node *clause, ParseExprKind exprKind, const char *constructName)
Definition: parse_clause.c:1720
AttrMap::attnums
AttrNumber * attnums
Definition: attmap.h:36
PartitionCmd::bound
PartitionBoundSpec * bound
Definition: parsenodes.h:859
IndexStmt::indexParams
List * indexParams
Definition: parsenodes.h:2776
deparse_expression
char * deparse_expression(Node *expr, List *dpcontext, bool forceprefix, bool showimplicit)
Definition: ruleutils.c:3212
TypeName::location
int location
Definition: parsenodes.h:216
RuleStmt::whereClause
Node * whereClause
Definition: parsenodes.h:2984
exprType
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
Form_pg_type
FormData_pg_type * Form_pg_type
Definition: pg_type.h:250
IndexStmt::excludeOpNames
List * excludeOpNames
Definition: parsenodes.h:2781
list_length
static int list_length(const List *l)
Definition: pg_list.h:169
transformCreateStmt
List * transformCreateStmt(CreateStmt *stmt, const char *queryString)
Definition: parse_utilcmd.c:165
parser_errposition
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:110
transformAlterTableStmt
AlterTableStmt * transformAlterTableStmt(Oid relid, AlterTableStmt *stmt, const char *queryString, List **beforeStmts, List **afterStmts)
Definition: parse_utilcmd.c:3027
exprCollation
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:719
ColumnDef::typeName
TypeName * typeName
Definition: parsenodes.h:647
ColumnDef::collClause
CollateClause * collClause
Definition: parsenodes.h:659
IndexStmt::initdeferred
bool initdeferred
Definition: parsenodes.h:2789
IndexAmRoutine::amcanorder
bool amcanorder
Definition: amapi.h:175
IndexElem::name
char * name
Definition: parsenodes.h:699
IndexStmt::idxcomment
char * idxcomment
Definition: parsenodes.h:2782
transformPartitionCmd
static void transformPartitionCmd(CreateStmtContext *cxt, PartitionCmd *cmd)
Definition: parse_utilcmd.c:3687
ARR_NDIM
#define ARR_NDIM(a)
Definition: array.h:278
PARTITION_STRATEGY_LIST
#define PARTITION_STRATEGY_LIST
Definition: parsenodes.h:799
RelationGetIndexList
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4330
make_attrmap
AttrMap * make_attrmap(int maplen)
Definition: attmap.c:41
Form_pg_operator
FormData_pg_operator * Form_pg_operator
Definition: pg_operator.h:83
transformFKConstraints
static void transformFKConstraints(CreateStmtContext *cxt, bool skipValidation, bool isAddConstraint)
Definition: parse_utilcmd.c:2538
InvalidAttrNumber
#define InvalidAttrNumber
Definition: attnum.h:23
Form_pg_collation
FormData_pg_collation * Form_pg_collation
Definition: pg_collation.h:51
nodeTag
#define nodeTag(nodeptr)
Definition: nodes.h:530
RelationGetStatExtList
List * RelationGetStatExtList(Relation relation)
Definition: relcache.c:4449
CreateStmtContext::stmtType
const char * stmtType
Definition: parse_utilcmd.c:79
transformExtendedStatistics
static void transformExtendedStatistics(CreateStmtContext *cxt)
Definition: parse_utilcmd.c:2494
index_close
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:152
pg_class_aclcheck
AclResult pg_class_aclcheck(Oid table_oid, Oid roleid, AclMode mode)
Definition: aclchk.c:4629
RangeVar::relpersistence
char relpersistence
Definition: primnodes.h:71
pg_opclass.h
DatumGetPointer
#define DatumGetPointer(X)
Definition: postgres.h:549
TableLikeClause::relation
RangeVar * relation
Definition: parsenodes.h:672
deconstruct_array
void deconstruct_array(ArrayType *array, Oid elmtype, int elmlen, bool elmbyval, char elmalign, Datum **elemsp, bool **nullsp, int *nelemsp)
Definition: arrayfuncs.c:3461
get_partition_col_collation
static Oid get_partition_col_collation(PartitionKey key, int col)
Definition: partcache.h:97
TupleConstr::num_defval
uint16 num_defval
Definition: tupdesc.h:42
Form_pg_class
FormData_pg_class * Form_pg_class
Definition: pg_class.h:150
PARTITION_STRATEGY_RANGE
#define PARTITION_STRATEGY_RANGE
Definition: parsenodes.h:800
transformCreateSchemaStmt
List * transformCreateSchemaStmt(CreateSchemaStmt *stmt)
Definition: parse_utilcmd.c:3562
IndexStmt::concurrent
bool concurrent
Definition: parsenodes.h:2791
AccessExclusiveLock
#define AccessExclusiveLock
Definition: lockdefs.h:45
CollateClause::collname
List * collname
Definition: parsenodes.h:310
Query::cteList
List * cteList
Definition: parsenodes.h:135
TypeName::arrayBounds
List * arrayBounds
Definition: parsenodes.h:215
Query::setOperations
Node * setOperations
Definition: parsenodes.h:165
IndexStmt::isconstraint
bool isconstraint
Definition: parsenodes.h:2787
Constraint::indexname
char * indexname
Definition: parsenodes.h:2174
Form_pg_am
FormData_pg_am * Form_pg_am
Definition: pg_am.h:48
errmsg
int errmsg(const char *fmt,...)
Definition: elog.c:822
generate_unaccent_rules.action
action
Definition: generate_unaccent_rules.py:284
AlterTableStmt::relation
RangeVar * relation
Definition: parsenodes.h:1774
get_tablespace_name
char * get_tablespace_name(Oid spc_oid)
Definition: tablespace.c:1462
list_free
void list_free(List *list)
Definition: list.c:1377
SUPPORTS_ATTRS
#define SUPPORTS_ATTRS(node)
Value::ValUnion::str
char * str
Definition: value.h:48
elog
#define elog(elevel,...)
Definition: elog.h:228
i
int i
Definition: preproc-comment.c:23
ColumnDef::inhcount
int inhcount
Definition: parsenodes.h:648
CreateTrigStmt::relation
RangeVar * relation
Definition: parsenodes.h:2428
get_relkind_objtype
ObjectType get_relkind_objtype(char relkind)
Definition: objectaddress.c:5354
NameStr
#define NameStr(name)
Definition: c.h:616
nodeToString
char * nodeToString(const void *obj)
Definition: outfuncs.c:4325
Constraint::contype
ConstrType contype
Definition: parsenodes.h:2149
parse_clause.h
IndexElem::collation
List * collation
Definition: parsenodes.h:702
get_attname
char * get_attname(Oid relid, AttrNumber attnum, bool missing_ok)
Definition: lsyscache.c:775
AlterSeqStmt::for_identity
bool for_identity
Definition: parsenodes.h:2554
rangeTableEntry_used
bool rangeTableEntry_used(Node *node, int rt_index, int sublevels_up)
Definition: rewriteManip.c:892
AlterTableCmd::behavior
DropBehavior behavior
Definition: parsenodes.h:1868
DefElem::defname
char * defname
Definition: parsenodes.h:730
ColumnDef::colname
char * colname
Definition: parsenodes.h:646
TupleConstr::check
ConstrCheck * check
Definition: tupdesc.h:40
Constraint::including
List * including
Definition: parsenodes.h:2166
Constraint::cooked_expr
char * cooked_expr
Definition: parsenodes.h:2160
pg_am.h
copyObject
#define copyObject(obj)
Definition: nodes.h:641
get_partition_strategy
static int get_partition_strategy(PartitionKey key)
Definition: partcache.h:58
pg_type_aclcheck
AclResult pg_type_aclcheck(Oid type_oid, Oid roleid, AclMode mode)
Definition: aclchk.c:4741
RuleStmt::relation
RangeVar * relation
Definition: parsenodes.h:2982
transformTableConstraint
static void transformTableConstraint(CreateStmtContext *cxt, Constraint *constraint)
Definition: parse_utilcmd.c:844
free_parsestate
void free_parsestate(ParseState *pstate)
Definition: parse_node.c:76
transformIndexConstraints
static void transformIndexConstraints(CreateStmtContext *cxt)
Definition: parse_utilcmd.c:1848
transformIndexStmt
IndexStmt * transformIndexStmt(Oid relid, IndexStmt *stmt, const char *queryString)
Definition: parse_utilcmd.c:2609
CreateStmt::partspec
PartitionSpec * partspec
Definition: parsenodes.h:2074
sequence_options
List * sequence_options(Oid relid)
Definition: sequence.c:1754
get_collation
static List * get_collation(Oid collation, Oid actual_datatype)
Definition: parse_utilcmd.c:1782
Form_pg_opclass
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
parse_utilcmd.h
A_Const::val
Value val
Definition: parsenodes.h:288
List
Definition: pg_list.h:50
get_rel_name
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1730
transformTableLikeClause
static void transformTableLikeClause(CreateStmtContext *cxt, TableLikeClause *table_like_clause)
Definition: parse_utilcmd.c:924
ConstrCheck::ccbin
char * ccbin
Definition: tupdesc.h:31
ARR_ELEMTYPE
#define ARR_ELEMTYPE(a)
Definition: array.h:280
AttrNumber
int16 AttrNumber
Definition: attnum.h:21
Constraint::skip_validation
bool skip_validation
Definition: parsenodes.h:2194
RelationGetRelid
#define RelationGetRelid(relation)
Definition: rel.h:428
transformRuleStmt
void transformRuleStmt(RuleStmt *stmt, const char *queryString, List **actions, Node **whereClause)
Definition: parse_utilcmd.c:2716
val
long val
Definition: informix.c:664
Constraint::access_method
char * access_method
Definition: parsenodes.h:2179
index_open
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:126
Constraint::fk_attrs
List * fk_attrs
Definition: parsenodes.h:2184
makeRangeVar
RangeVar * makeRangeVar(char *schemaname, char *relname, int location)
Definition: makefuncs.c:420
parse_target.h
PRS2_NEW_VARNO
#define PRS2_NEW_VARNO
Definition: primnodes.h:179
Const::constisnull
bool constisnull
Definition: primnodes.h:215
CreateStmt::ofTypename
TypeName * ofTypename
Definition: parsenodes.h:2075
transformCheckConstraints
static void transformCheckConstraints(CreateStmtContext *cxt, bool skipValidation)
Definition: parse_utilcmd.c:2509
RangeVarGetCreationNamespace
Oid RangeVarGetCreationNamespace(const RangeVar *newRelation)
Definition: namespace.c:441
Constraint::indexspace
char * indexspace
Definition: parsenodes.h:2175
ColumnRef::fields
List * fields
Definition: parsenodes.h:235
Form_pg_statistic_ext
FormData_pg_statistic_ext * Form_pg_statistic_ext
Definition: pg_statistic_ext.h:64
lfirst_oid
#define lfirst_oid(lc)
Definition: pg_list.h:192
CreateSeqStmt::options
List * options
Definition: parsenodes.h:2543
Value::type
NodeTag type
Definition: value.h:44
typenameTypeId
Oid typenameTypeId(ParseState *pstate, const TypeName *typeName)
Definition: parse_type.c:291
TypeName::pct_type
bool pct_type
Definition: parsenodes.h:212
TypeCast::arg
Node * arg
Definition: parsenodes.h:298
RelationGetNamespace
#define RelationGetNamespace(relation)
Definition: rel.h:469
ParseState::p_rtable
List * p_rtable
Definition: parse_node.h:180
DatumGetArrayTypeP
#define DatumGetArrayTypeP(X)
Definition: array.h:249