1 /*-------------------------------------------------------------------------
4 * Perform parse analysis work for various utility commands
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.
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.
19 * Portions Copyright (c) 1996-2011, PostgreSQL Global Development Group
20 * Portions Copyright (c) 1994, Regents of the University of California
22 * src/backend/parser/parse_utilcmd.c
24 *-------------------------------------------------------------------------
29 #include "access/genam.h"
30 #include "access/heapam.h"
31 #include "access/reloptions.h"
32 #include "catalog/dependency.h"
33 #include "catalog/heap.h"
34 #include "catalog/index.h"
35 #include "catalog/namespace.h"
36 #include "catalog/pg_collation.h"
37 #include "catalog/pg_constraint.h"
38 #include "catalog/pg_opclass.h"
39 #include "catalog/pg_operator.h"
40 #include "catalog/pg_type.h"
41 #include "commands/comment.h"
42 #include "commands/defrem.h"
43 #include "commands/tablecmds.h"
44 #include "commands/tablespace.h"
45 #include "miscadmin.h"
46 #include "nodes/makefuncs.h"
47 #include "nodes/nodeFuncs.h"
48 #include "parser/analyze.h"
49 #include "parser/parse_clause.h"
50 #include "parser/parse_collate.h"
51 #include "parser/parse_expr.h"
52 #include "parser/parse_relation.h"
53 #include "parser/parse_target.h"
54 #include "parser/parse_type.h"
55 #include "parser/parse_utilcmd.h"
56 #include "parser/parser.h"
57 #include "rewrite/rewriteManip.h"
58 #include "storage/lock.h"
59 #include "utils/acl.h"
60 #include "utils/builtins.h"
61 #include "utils/lsyscache.h"
62 #include "utils/rel.h"
63 #include "utils/syscache.h"
64 #include "utils/typcache.h"
67 /* State shared by transformCreateStmt and its subroutines */
70 ParseState *pstate; /* overall parser state */
71 const char *stmtType; /* "CREATE [FOREIGN] TABLE" or "ALTER TABLE" */
72 RangeVar *relation; /* relation to create */
73 Relation rel; /* opened/locked rel, if ALTER */
74 List *inhRelations; /* relations to inherit from */
75 bool isalter; /* true if altering existing table */
76 bool hasoids; /* does relation have an OID column? */
77 List *columns; /* ColumnDef items */
78 List *ckconstraints; /* CHECK constraints */
79 List *fkconstraints; /* FOREIGN KEY constraints */
80 List *ixconstraints; /* index-creating constraints */
81 List *inh_indexes; /* cloned indexes from INCLUDING INDEXES */
82 List *blist; /* "before list" of things to do before
83 * creating the table */
84 List *alist; /* "after list" of things to do after creating
86 IndexStmt *pkey; /* PRIMARY KEY index, if any */
89 /* State shared by transformCreateSchemaStmt and its subroutines */
92 const char *stmtType; /* "CREATE SCHEMA" or "ALTER SCHEMA" */
93 char *schemaname; /* name of schema */
94 char *authid; /* owner of schema */
95 List *sequences; /* CREATE SEQUENCE items */
96 List *tables; /* CREATE TABLE items */
97 List *views; /* CREATE VIEW items */
98 List *indexes; /* CREATE INDEX items */
99 List *triggers; /* CREATE TRIGGER items */
100 List *grants; /* GRANT items */
101 } CreateSchemaStmtContext;
104 static void transformColumnDefinition(CreateStmtContext *cxt,
106 static void transformTableConstraint(CreateStmtContext *cxt,
107 Constraint *constraint);
108 static void transformInhRelation(CreateStmtContext *cxt,
109 InhRelation *inhrelation);
110 static void transformOfType(CreateStmtContext *cxt,
111 TypeName *ofTypename);
112 static char *chooseIndexName(const RangeVar *relation, IndexStmt *index_stmt);
113 static IndexStmt *generateClonedIndexStmt(CreateStmtContext *cxt,
114 Relation parent_index, AttrNumber *attmap);
115 static List *get_collation(Oid collation, Oid actual_datatype);
116 static List *get_opclass(Oid opclass, Oid actual_datatype);
117 static void transformIndexConstraints(CreateStmtContext *cxt);
118 static IndexStmt *transformIndexConstraint(Constraint *constraint,
119 CreateStmtContext *cxt);
120 static void transformFKConstraints(CreateStmtContext *cxt,
122 bool isAddConstraint);
123 static void transformConstraintAttrs(CreateStmtContext *cxt,
124 List *constraintList);
125 static void transformColumnType(CreateStmtContext *cxt, ColumnDef *column);
126 static void setSchemaName(char *context_schema, char **stmt_schema_name);
130 * transformCreateStmt -
131 * parse analysis for CREATE TABLE
133 * Returns a List of utility commands to be done in sequence. One of these
134 * will be the transformed CreateStmt, but there may be additional actions
135 * to be done before and after the actual DefineRelation() call.
137 * SQL92 allows constraints to be scattered all over, so thumb through
138 * the columns and collect all constraints into one place.
139 * If there are any implied indices (e.g. UNIQUE or PRIMARY KEY)
140 * then expand those into multiple IndexStmt blocks.
141 * - thomas 1997-12-02
144 transformCreateStmt(CreateStmt *stmt, const char *queryString)
147 CreateStmtContext cxt;
154 * We must not scribble on the passed-in CreateStmt, so copy it. (This is
155 * overkill, but easy.)
157 stmt = (CreateStmt *) copyObject(stmt);
160 * Look up the creation namespace. This also checks permissions on the
161 * target namespace, so that we throw any permissions error as early as
164 namespaceid = RangeVarGetAndCheckCreationNamespace(stmt->relation);
165 RangeVarAdjustRelationPersistence(stmt->relation, namespaceid);
168 * If the relation already exists and the user specified "IF NOT EXISTS",
169 * bail out with a NOTICE.
171 if (stmt->if_not_exists)
175 existing_relid = get_relname_relid(stmt->relation->relname,
177 if (existing_relid != InvalidOid)
180 (errcode(ERRCODE_DUPLICATE_TABLE),
181 errmsg("relation \"%s\" already exists, skipping",
182 stmt->relation->relname)));
188 * If the target relation name isn't schema-qualified, make it so. This
189 * prevents some corner cases in which added-on rewritten commands might
190 * think they should apply to other relations that have the same name and
191 * are earlier in the search path. But a local temp table is effectively
192 * specified to be in pg_temp, so no need for anything extra in that case.
194 if (stmt->relation->schemaname == NULL
195 && stmt->relation->relpersistence != RELPERSISTENCE_TEMP)
196 stmt->relation->schemaname = get_namespace_name(namespaceid);
198 /* Set up pstate and CreateStmtContext */
199 pstate = make_parsestate(NULL);
200 pstate->p_sourcetext = queryString;
203 if (IsA(stmt, CreateForeignTableStmt))
204 cxt.stmtType = "CREATE FOREIGN TABLE";
206 cxt.stmtType = "CREATE TABLE";
207 cxt.relation = stmt->relation;
209 cxt.inhRelations = stmt->inhRelations;
212 cxt.ckconstraints = NIL;
213 cxt.fkconstraints = NIL;
214 cxt.ixconstraints = NIL;
215 cxt.inh_indexes = NIL;
219 cxt.hasoids = interpretOidsOption(stmt->options);
221 Assert(!stmt->ofTypename || !stmt->inhRelations); /* grammar enforces */
223 if (stmt->ofTypename)
224 transformOfType(&cxt, stmt->ofTypename);
227 * Run through each primary element in the table creation clause. Separate
228 * column defs from constraints, and do preliminary analysis.
230 foreach(elements, stmt->tableElts)
232 Node *element = lfirst(elements);
234 switch (nodeTag(element))
237 transformColumnDefinition(&cxt, (ColumnDef *) element);
241 transformTableConstraint(&cxt, (Constraint *) element);
245 transformInhRelation(&cxt, (InhRelation *) element);
249 elog(ERROR, "unrecognized node type: %d",
250 (int) nodeTag(element));
256 * transformIndexConstraints wants cxt.alist to contain only index
257 * statements, so transfer anything we already have into save_alist.
259 save_alist = cxt.alist;
262 Assert(stmt->constraints == NIL);
265 * Postprocess constraints that give rise to index definitions.
267 transformIndexConstraints(&cxt);
270 * Postprocess foreign-key constraints.
272 transformFKConstraints(&cxt, true, false);
277 stmt->tableElts = cxt.columns;
278 stmt->constraints = cxt.ckconstraints;
280 result = lappend(cxt.blist, stmt);
281 result = list_concat(result, cxt.alist);
282 result = list_concat(result, save_alist);
288 * transformColumnDefinition -
289 * transform a single ColumnDef within CREATE TABLE
290 * Also used in ALTER TABLE ADD COLUMN
293 transformColumnDefinition(CreateStmtContext *cxt, ColumnDef *column)
298 Constraint *constraint;
301 cxt->columns = lappend(cxt->columns, column);
303 /* Check for SERIAL pseudo-types */
306 && list_length(column->typeName->names) == 1
307 && !column->typeName->pct_type)
309 char *typname = strVal(linitial(column->typeName->names));
311 if (strcmp(typname, "smallserial") == 0 ||
312 strcmp(typname, "serial2") == 0)
315 column->typeName->names = NIL;
316 column->typeName->typeOid = INT2OID;
318 else if (strcmp(typname, "serial") == 0 ||
319 strcmp(typname, "serial4") == 0)
322 column->typeName->names = NIL;
323 column->typeName->typeOid = INT4OID;
325 else if (strcmp(typname, "bigserial") == 0 ||
326 strcmp(typname, "serial8") == 0)
329 column->typeName->names = NIL;
330 column->typeName->typeOid = INT8OID;
334 * We have to reject "serial[]" explicitly, because once we've set
335 * typeid, LookupTypeName won't notice arrayBounds. We don't need any
336 * special coding for serial(typmod) though.
338 if (is_serial && column->typeName->arrayBounds != NIL)
340 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
341 errmsg("array of serial is not implemented"),
342 parser_errposition(cxt->pstate,
343 column->typeName->location)));
346 /* Do necessary work on the column type declaration */
347 if (column->typeName)
348 transformColumnType(cxt, column);
350 /* Special actions for SERIAL pseudo-types */
359 FuncCall *funccallnode;
360 CreateSeqStmt *seqstmt;
361 AlterSeqStmt *altseqstmt;
365 * Determine namespace and name to use for the sequence.
367 * Although we use ChooseRelationName, it's not guaranteed that the
368 * selected sequence name won't conflict; given sufficiently long
369 * field names, two different serial columns in the same table could
370 * be assigned the same sequence name, and we'd not notice since we
371 * aren't creating the sequence quite yet. In practice this seems
372 * quite unlikely to be a problem, especially since few people would
373 * need two serial columns in one table.
376 snamespaceid = RelationGetNamespace(cxt->rel);
379 snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
380 RangeVarAdjustRelationPersistence(cxt->relation, snamespaceid);
382 snamespace = get_namespace_name(snamespaceid);
383 sname = ChooseRelationName(cxt->relation->relname,
389 (errmsg("%s will create implicit sequence \"%s\" for serial column \"%s.%s\"",
390 cxt->stmtType, sname,
391 cxt->relation->relname, column->colname)));
394 * Build a CREATE SEQUENCE command to create the sequence object, and
395 * add it to the list of things to be done before this CREATE/ALTER
398 seqstmt = makeNode(CreateSeqStmt);
399 seqstmt->sequence = makeRangeVar(snamespace, sname, -1);
400 seqstmt->options = NIL;
403 * If this is ALTER ADD COLUMN, make sure the sequence will be owned
404 * by the table's owner. The current user might be someone else
405 * (perhaps a superuser, or someone who's only a member of the owning
406 * role), but the SEQUENCE OWNED BY mechanisms will bleat unless table
407 * and sequence have exactly the same owning role.
410 seqstmt->ownerId = cxt->rel->rd_rel->relowner;
412 seqstmt->ownerId = InvalidOid;
414 cxt->blist = lappend(cxt->blist, seqstmt);
417 * Build an ALTER SEQUENCE ... OWNED BY command to mark the sequence
418 * as owned by this column, and add it to the list of things to be
419 * done after this CREATE/ALTER TABLE.
421 altseqstmt = makeNode(AlterSeqStmt);
422 altseqstmt->sequence = makeRangeVar(snamespace, sname, -1);
423 attnamelist = list_make3(makeString(snamespace),
424 makeString(cxt->relation->relname),
425 makeString(column->colname));
426 altseqstmt->options = list_make1(makeDefElem("owned_by",
427 (Node *) attnamelist));
429 cxt->alist = lappend(cxt->alist, altseqstmt);
432 * Create appropriate constraints for SERIAL. We do this in full,
433 * rather than shortcutting, so that we will detect any conflicting
434 * constraints the user wrote (like a different DEFAULT).
436 * Create an expression tree representing the function call
437 * nextval('sequencename'). We cannot reduce the raw tree to cooked
438 * form until after the sequence is created, but there's no need to do
441 qstring = quote_qualified_identifier(snamespace, sname);
442 snamenode = makeNode(A_Const);
443 snamenode->val.type = T_String;
444 snamenode->val.val.str = qstring;
445 snamenode->location = -1;
446 castnode = makeNode(TypeCast);
447 castnode->typeName = SystemTypeName("regclass");
448 castnode->arg = (Node *) snamenode;
449 castnode->location = -1;
450 funccallnode = makeNode(FuncCall);
451 funccallnode->funcname = SystemFuncName("nextval");
452 funccallnode->args = list_make1(castnode);
453 funccallnode->agg_order = NIL;
454 funccallnode->agg_star = false;
455 funccallnode->agg_distinct = false;
456 funccallnode->func_variadic = false;
457 funccallnode->over = NULL;
458 funccallnode->location = -1;
460 constraint = makeNode(Constraint);
461 constraint->contype = CONSTR_DEFAULT;
462 constraint->location = -1;
463 constraint->raw_expr = (Node *) funccallnode;
464 constraint->cooked_expr = NULL;
465 column->constraints = lappend(column->constraints, constraint);
467 constraint = makeNode(Constraint);
468 constraint->contype = CONSTR_NOTNULL;
469 constraint->location = -1;
470 column->constraints = lappend(column->constraints, constraint);
473 /* Process column constraints, if any... */
474 transformConstraintAttrs(cxt, column->constraints);
476 saw_nullable = false;
479 foreach(clist, column->constraints)
481 constraint = lfirst(clist);
482 Assert(IsA(constraint, Constraint));
484 switch (constraint->contype)
487 if (saw_nullable && column->is_not_null)
489 (errcode(ERRCODE_SYNTAX_ERROR),
490 errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
491 column->colname, cxt->relation->relname),
492 parser_errposition(cxt->pstate,
493 constraint->location)));
494 column->is_not_null = FALSE;
499 if (saw_nullable && !column->is_not_null)
501 (errcode(ERRCODE_SYNTAX_ERROR),
502 errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
503 column->colname, cxt->relation->relname),
504 parser_errposition(cxt->pstate,
505 constraint->location)));
506 column->is_not_null = TRUE;
513 (errcode(ERRCODE_SYNTAX_ERROR),
514 errmsg("multiple default values specified for column \"%s\" of table \"%s\"",
515 column->colname, cxt->relation->relname),
516 parser_errposition(cxt->pstate,
517 constraint->location)));
518 column->raw_default = constraint->raw_expr;
519 Assert(constraint->cooked_expr == NULL);
524 cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
529 if (constraint->keys == NIL)
530 constraint->keys = list_make1(makeString(column->colname));
531 cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
534 case CONSTR_EXCLUSION:
535 /* grammar does not allow EXCLUDE as a column constraint */
536 elog(ERROR, "column exclusion constraints are not supported");
542 * Fill in the current attribute's name and throw it into the
543 * list of FK constraints to be processed later.
545 constraint->fk_attrs = list_make1(makeString(column->colname));
546 cxt->fkconstraints = lappend(cxt->fkconstraints, constraint);
549 case CONSTR_ATTR_DEFERRABLE:
550 case CONSTR_ATTR_NOT_DEFERRABLE:
551 case CONSTR_ATTR_DEFERRED:
552 case CONSTR_ATTR_IMMEDIATE:
553 /* transformConstraintAttrs took care of these */
557 elog(ERROR, "unrecognized constraint type: %d",
558 constraint->contype);
565 * transformTableConstraint
566 * transform a Constraint node within CREATE TABLE or ALTER TABLE
569 transformTableConstraint(CreateStmtContext *cxt, Constraint *constraint)
571 switch (constraint->contype)
575 case CONSTR_EXCLUSION:
576 cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
580 cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
584 cxt->fkconstraints = lappend(cxt->fkconstraints, constraint);
590 case CONSTR_ATTR_DEFERRABLE:
591 case CONSTR_ATTR_NOT_DEFERRABLE:
592 case CONSTR_ATTR_DEFERRED:
593 case CONSTR_ATTR_IMMEDIATE:
594 elog(ERROR, "invalid context for constraint type %d",
595 constraint->contype);
599 elog(ERROR, "unrecognized constraint type: %d",
600 constraint->contype);
606 * transformInhRelation
608 * Change the LIKE <subtable> portion of a CREATE TABLE statement into
609 * column definitions which recreate the user defined column portions of
613 transformInhRelation(CreateStmtContext *cxt, InhRelation *inhRelation)
615 AttrNumber parent_attno;
622 relation = parserOpenTable(cxt->pstate, inhRelation->relation,
625 if (relation->rd_rel->relkind != RELKIND_RELATION)
627 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
628 errmsg("inherited relation \"%s\" is not a table",
629 inhRelation->relation->relname)));
632 * Check for SELECT privilages
634 aclresult = pg_class_aclcheck(RelationGetRelid(relation), GetUserId(),
636 if (aclresult != ACLCHECK_OK)
637 aclcheck_error(aclresult, ACL_KIND_CLASS,
638 RelationGetRelationName(relation));
640 tupleDesc = RelationGetDescr(relation);
641 constr = tupleDesc->constr;
644 * Insert the copied attributes into the cxt for the new table definition.
646 for (parent_attno = 1; parent_attno <= tupleDesc->natts;
649 Form_pg_attribute attribute = tupleDesc->attrs[parent_attno - 1];
650 char *attributeName = NameStr(attribute->attname);
654 * Ignore dropped columns in the parent.
656 if (attribute->attisdropped)
660 * Create a new column, which is marked as NOT inherited.
662 * For constraints, ONLY the NOT NULL constraint is inherited by the
663 * new column definition per SQL99.
665 def = makeNode(ColumnDef);
666 def->colname = pstrdup(attributeName);
667 def->typeName = makeTypeNameFromOid(attribute->atttypid,
668 attribute->atttypmod);
670 def->is_local = true;
671 def->is_not_null = attribute->attnotnull;
672 def->is_from_type = false;
674 def->raw_default = NULL;
675 def->cooked_default = NULL;
676 def->collClause = NULL;
677 def->collOid = attribute->attcollation;
678 def->constraints = NIL;
683 cxt->columns = lappend(cxt->columns, def);
686 * Copy default, if present and the default has been requested
688 if (attribute->atthasdef &&
689 (inhRelation->options & CREATE_TABLE_LIKE_DEFAULTS))
691 Node *this_default = NULL;
692 AttrDefault *attrdef;
695 /* Find default in constraint structure */
696 Assert(constr != NULL);
697 attrdef = constr->defval;
698 for (i = 0; i < constr->num_defval; i++)
700 if (attrdef[i].adnum == parent_attno)
702 this_default = stringToNode(attrdef[i].adbin);
706 Assert(this_default != NULL);
709 * If default expr could contain any vars, we'd need to fix 'em,
710 * but it can't; so default is ready to apply to child.
713 def->cooked_default = this_default;
716 /* Likewise, copy storage if requested */
717 if (inhRelation->options & CREATE_TABLE_LIKE_STORAGE)
718 def->storage = attribute->attstorage;
722 /* Likewise, copy comment if requested */
723 if ((inhRelation->options & CREATE_TABLE_LIKE_COMMENTS) &&
724 (comment = GetComment(attribute->attrelid,
726 attribute->attnum)) != NULL)
728 CommentStmt *stmt = makeNode(CommentStmt);
730 stmt->objtype = OBJECT_COLUMN;
731 stmt->objname = list_make3(makeString(cxt->relation->schemaname),
732 makeString(cxt->relation->relname),
733 makeString(def->colname));
735 stmt->comment = comment;
737 cxt->alist = lappend(cxt->alist, stmt);
742 * Copy CHECK constraints if requested, being careful to adjust attribute
745 if ((inhRelation->options & CREATE_TABLE_LIKE_CONSTRAINTS) &&
748 AttrNumber *attmap = varattnos_map_schema(tupleDesc, cxt->columns);
751 for (ccnum = 0; ccnum < tupleDesc->constr->num_check; ccnum++)
753 char *ccname = tupleDesc->constr->check[ccnum].ccname;
754 char *ccbin = tupleDesc->constr->check[ccnum].ccbin;
755 Node *ccbin_node = stringToNode(ccbin);
756 Constraint *n = makeNode(Constraint);
758 change_varattnos_of_a_node(ccbin_node, attmap);
760 n->contype = CONSTR_CHECK;
762 n->conname = pstrdup(ccname);
764 n->cooked_expr = nodeToString(ccbin_node);
765 cxt->ckconstraints = lappend(cxt->ckconstraints, n);
767 /* Copy comment on constraint */
768 if ((inhRelation->options & CREATE_TABLE_LIKE_COMMENTS) &&
769 (comment = GetComment(get_constraint_oid(RelationGetRelid(relation),
771 ConstraintRelationId,
774 CommentStmt *stmt = makeNode(CommentStmt);
776 stmt->objtype = OBJECT_CONSTRAINT;
777 stmt->objname = list_make3(makeString(cxt->relation->schemaname),
778 makeString(cxt->relation->relname),
779 makeString(n->conname));
781 stmt->comment = comment;
783 cxt->alist = lappend(cxt->alist, stmt);
789 * Likewise, copy indexes if requested
791 if ((inhRelation->options & CREATE_TABLE_LIKE_INDEXES) &&
792 relation->rd_rel->relhasindex)
794 AttrNumber *attmap = varattnos_map_schema(tupleDesc, cxt->columns);
795 List *parent_indexes;
798 parent_indexes = RelationGetIndexList(relation);
800 foreach(l, parent_indexes)
802 Oid parent_index_oid = lfirst_oid(l);
803 Relation parent_index;
804 IndexStmt *index_stmt;
806 parent_index = index_open(parent_index_oid, AccessShareLock);
808 /* Build CREATE INDEX statement to recreate the parent_index */
809 index_stmt = generateClonedIndexStmt(cxt, parent_index, attmap);
811 /* Copy comment on index */
812 if (inhRelation->options & CREATE_TABLE_LIKE_COMMENTS)
814 comment = GetComment(parent_index_oid, RelationRelationId, 0);
821 * We have to assign the index a name now, so that we can
822 * reference it in CommentStmt.
824 if (index_stmt->idxname == NULL)
825 index_stmt->idxname = chooseIndexName(cxt->relation,
828 stmt = makeNode(CommentStmt);
829 stmt->objtype = OBJECT_INDEX;
831 list_make2(makeString(cxt->relation->schemaname),
832 makeString(index_stmt->idxname));
834 stmt->comment = comment;
836 cxt->alist = lappend(cxt->alist, stmt);
840 /* Save it in the inh_indexes list for the time being */
841 cxt->inh_indexes = lappend(cxt->inh_indexes, index_stmt);
843 index_close(parent_index, AccessShareLock);
848 * Close the parent rel, but keep our AccessShareLock on it until xact
849 * commit. That will prevent someone else from deleting or ALTERing the
850 * parent before the child is committed.
852 heap_close(relation, NoLock);
856 transformOfType(CreateStmtContext *cxt, TypeName *ofTypename)
863 AssertArg(ofTypename);
865 tuple = typenameType(NULL, ofTypename, NULL);
866 check_of_type(tuple);
867 ofTypeId = HeapTupleGetOid(tuple);
868 ofTypename->typeOid = ofTypeId; /* cached for later */
870 tupdesc = lookup_rowtype_tupdesc(ofTypeId, -1);
871 for (i = 0; i < tupdesc->natts; i++)
873 Form_pg_attribute attr = tupdesc->attrs[i];
876 if (attr->attisdropped)
879 n = makeNode(ColumnDef);
880 n->colname = pstrdup(NameStr(attr->attname));
881 n->typeName = makeTypeNameFromOid(attr->atttypid, attr->atttypmod);
884 n->is_not_null = false;
885 n->is_from_type = true;
887 n->raw_default = NULL;
888 n->cooked_default = NULL;
889 n->collClause = NULL;
890 n->collOid = attr->attcollation;
891 n->constraints = NIL;
892 cxt->columns = lappend(cxt->columns, n);
894 DecrTupleDescRefCount(tupdesc);
896 ReleaseSysCache(tuple);
902 * Compute name for an index. This must match code in indexcmds.c.
904 * XXX this is inherently broken because the indexes aren't created
905 * immediately, so we fail to resolve conflicts when the same name is
906 * derived for multiple indexes. However, that's a reasonably uncommon
907 * situation, so we'll live with it for now.
910 chooseIndexName(const RangeVar *relation, IndexStmt *index_stmt)
915 namespaceId = RangeVarGetCreationNamespace(relation);
916 colnames = ChooseIndexColumnNames(index_stmt->indexParams);
917 return ChooseIndexName(relation->relname, namespaceId,
918 colnames, index_stmt->excludeOpNames,
919 index_stmt->primary, index_stmt->isconstraint);
923 * Generate an IndexStmt node using information from an already existing index
924 * "source_idx". Attribute numbers should be adjusted according to attmap.
927 generateClonedIndexStmt(CreateStmtContext *cxt, Relation source_idx,
930 Oid source_relid = RelationGetRelid(source_idx);
931 Form_pg_attribute *attrs = RelationGetDescr(source_idx)->attrs;
934 Form_pg_class idxrelrec;
935 Form_pg_index idxrec;
937 oidvector *indcollation;
941 ListCell *indexpr_item;
949 * Fetch pg_class tuple of source index. We can't use the copy in the
950 * relcache entry because it doesn't include optional fields.
952 ht_idxrel = SearchSysCache1(RELOID, ObjectIdGetDatum(source_relid));
953 if (!HeapTupleIsValid(ht_idxrel))
954 elog(ERROR, "cache lookup failed for relation %u", source_relid);
955 idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
957 /* Fetch pg_index tuple for source index from relcache entry */
958 ht_idx = source_idx->rd_indextuple;
959 idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
960 indrelid = idxrec->indrelid;
962 /* Fetch pg_am tuple for source index from relcache entry */
963 amrec = source_idx->rd_am;
965 /* Extract indcollation from the pg_index tuple */
966 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
967 Anum_pg_index_indcollation, &isnull);
969 indcollation = (oidvector *) DatumGetPointer(datum);
971 /* Extract indclass from the pg_index tuple */
972 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
973 Anum_pg_index_indclass, &isnull);
975 indclass = (oidvector *) DatumGetPointer(datum);
977 /* Begin building the IndexStmt */
978 index = makeNode(IndexStmt);
979 index->relation = cxt->relation;
980 index->accessMethod = pstrdup(NameStr(amrec->amname));
981 if (OidIsValid(idxrelrec->reltablespace))
982 index->tableSpace = get_tablespace_name(idxrelrec->reltablespace);
984 index->tableSpace = NULL;
985 index->indexOid = InvalidOid;
986 index->unique = idxrec->indisunique;
987 index->primary = idxrec->indisprimary;
988 index->concurrent = false;
991 * We don't try to preserve the name of the source index; instead, just
992 * let DefineIndex() choose a reasonable name.
994 index->idxname = NULL;
997 * If the index is marked PRIMARY or has an exclusion condition, it's
998 * certainly from a constraint; else, if it's not marked UNIQUE, it
999 * certainly isn't. If it is or might be from a constraint, we have to
1000 * fetch the pg_constraint record.
1002 if (index->primary || index->unique || idxrec->indisexclusion)
1004 Oid constraintId = get_index_constraint(source_relid);
1006 if (OidIsValid(constraintId))
1008 HeapTuple ht_constr;
1009 Form_pg_constraint conrec;
1011 ht_constr = SearchSysCache1(CONSTROID,
1012 ObjectIdGetDatum(constraintId));
1013 if (!HeapTupleIsValid(ht_constr))
1014 elog(ERROR, "cache lookup failed for constraint %u",
1016 conrec = (Form_pg_constraint) GETSTRUCT(ht_constr);
1018 index->isconstraint = true;
1019 index->deferrable = conrec->condeferrable;
1020 index->initdeferred = conrec->condeferred;
1022 /* If it's an exclusion constraint, we need the operator names */
1023 if (idxrec->indisexclusion)
1029 Assert(conrec->contype == CONSTRAINT_EXCLUSION);
1030 /* Extract operator OIDs from the pg_constraint tuple */
1031 datum = SysCacheGetAttr(CONSTROID, ht_constr,
1032 Anum_pg_constraint_conexclop,
1035 elog(ERROR, "null conexclop for constraint %u",
1038 deconstruct_array(DatumGetArrayTypeP(datum),
1039 OIDOID, sizeof(Oid), true, 'i',
1040 &elems, NULL, &nElems);
1042 for (i = 0; i < nElems; i++)
1044 Oid operid = DatumGetObjectId(elems[i]);
1046 Form_pg_operator operform;
1051 opertup = SearchSysCache1(OPEROID,
1052 ObjectIdGetDatum(operid));
1053 if (!HeapTupleIsValid(opertup))
1054 elog(ERROR, "cache lookup failed for operator %u",
1056 operform = (Form_pg_operator) GETSTRUCT(opertup);
1057 oprname = pstrdup(NameStr(operform->oprname));
1058 /* For simplicity we always schema-qualify the op name */
1059 nspname = get_namespace_name(operform->oprnamespace);
1060 namelist = list_make2(makeString(nspname),
1061 makeString(oprname));
1062 index->excludeOpNames = lappend(index->excludeOpNames,
1064 ReleaseSysCache(opertup);
1068 ReleaseSysCache(ht_constr);
1071 index->isconstraint = false;
1074 index->isconstraint = false;
1076 /* Get the index expressions, if any */
1077 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1078 Anum_pg_index_indexprs, &isnull);
1083 exprsString = TextDatumGetCString(datum);
1084 indexprs = (List *) stringToNode(exprsString);
1089 /* Build the list of IndexElem */
1090 index->indexParams = NIL;
1092 indexpr_item = list_head(indexprs);
1093 for (keyno = 0; keyno < idxrec->indnatts; keyno++)
1096 AttrNumber attnum = idxrec->indkey.values[keyno];
1097 int16 opt = source_idx->rd_indoption[keyno];
1099 iparam = makeNode(IndexElem);
1101 if (AttributeNumberIsValid(attnum))
1103 /* Simple index column */
1106 attname = get_relid_attribute_name(indrelid, attnum);
1107 keycoltype = get_atttype(indrelid, attnum);
1109 iparam->name = attname;
1110 iparam->expr = NULL;
1114 /* Expressional index */
1117 if (indexpr_item == NULL)
1118 elog(ERROR, "too few entries in indexprs list");
1119 indexkey = (Node *) lfirst(indexpr_item);
1120 indexpr_item = lnext(indexpr_item);
1122 /* OK to modify indexkey since we are working on a private copy */
1123 change_varattnos_of_a_node(indexkey, attmap);
1125 iparam->name = NULL;
1126 iparam->expr = indexkey;
1128 keycoltype = exprType(indexkey);
1131 /* Copy the original index column name */
1132 iparam->indexcolname = pstrdup(NameStr(attrs[keyno]->attname));
1134 /* Add the collation name, if non-default */
1135 iparam->collation = get_collation(indcollation->values[keyno], keycoltype);
1137 /* Add the operator class name, if non-default */
1138 iparam->opclass = get_opclass(indclass->values[keyno], keycoltype);
1140 iparam->ordering = SORTBY_DEFAULT;
1141 iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1143 /* Adjust options if necessary */
1144 if (amrec->amcanorder)
1147 * If it supports sort ordering, copy DESC and NULLS opts. Don't
1148 * set non-default settings unnecessarily, though, so as to
1149 * improve the chance of recognizing equivalence to constraint
1152 if (opt & INDOPTION_DESC)
1154 iparam->ordering = SORTBY_DESC;
1155 if ((opt & INDOPTION_NULLS_FIRST) == 0)
1156 iparam->nulls_ordering = SORTBY_NULLS_LAST;
1160 if (opt & INDOPTION_NULLS_FIRST)
1161 iparam->nulls_ordering = SORTBY_NULLS_FIRST;
1165 index->indexParams = lappend(index->indexParams, iparam);
1168 /* Copy reloptions if any */
1169 datum = SysCacheGetAttr(RELOID, ht_idxrel,
1170 Anum_pg_class_reloptions, &isnull);
1172 index->options = untransformRelOptions(datum);
1174 /* If it's a partial index, decompile and append the predicate */
1175 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1176 Anum_pg_index_indpred, &isnull);
1181 /* Convert text string to node tree */
1182 pred_str = TextDatumGetCString(datum);
1183 index->whereClause = (Node *) stringToNode(pred_str);
1184 /* Adjust attribute numbers */
1185 change_varattnos_of_a_node(index->whereClause, attmap);
1189 ReleaseSysCache(ht_idxrel);
1195 * get_collation - fetch qualified name of a collation
1197 * If collation is InvalidOid or is the default for the given actual_datatype,
1198 * then the return value is NIL.
1201 get_collation(Oid collation, Oid actual_datatype)
1205 Form_pg_collation coll_rec;
1209 if (!OidIsValid(collation))
1210 return NIL; /* easy case */
1211 if (collation == get_typcollation(actual_datatype))
1212 return NIL; /* just let it default */
1214 ht_coll = SearchSysCache1(COLLOID, ObjectIdGetDatum(collation));
1215 if (!HeapTupleIsValid(ht_coll))
1216 elog(ERROR, "cache lookup failed for collation %u", collation);
1217 coll_rec = (Form_pg_collation) GETSTRUCT(ht_coll);
1219 /* For simplicity, we always schema-qualify the name */
1220 nsp_name = get_namespace_name(coll_rec->collnamespace);
1221 coll_name = pstrdup(NameStr(coll_rec->collname));
1222 result = list_make2(makeString(nsp_name), makeString(coll_name));
1224 ReleaseSysCache(ht_coll);
1229 * get_opclass - fetch qualified name of an index operator class
1231 * If the opclass is the default for the given actual_datatype, then
1232 * the return value is NIL.
1235 get_opclass(Oid opclass, Oid actual_datatype)
1239 Form_pg_opclass opc_rec;
1241 ht_opc = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
1242 if (!HeapTupleIsValid(ht_opc))
1243 elog(ERROR, "cache lookup failed for opclass %u", opclass);
1244 opc_rec = (Form_pg_opclass) GETSTRUCT(ht_opc);
1246 if (GetDefaultOpClass(actual_datatype, opc_rec->opcmethod) != opclass)
1248 /* For simplicity, we always schema-qualify the name */
1249 char *nsp_name = get_namespace_name(opc_rec->opcnamespace);
1250 char *opc_name = pstrdup(NameStr(opc_rec->opcname));
1252 result = list_make2(makeString(nsp_name), makeString(opc_name));
1255 ReleaseSysCache(ht_opc);
1261 * transformIndexConstraints
1262 * Handle UNIQUE, PRIMARY KEY, EXCLUDE constraints, which create indexes.
1263 * We also merge in any index definitions arising from
1264 * LIKE ... INCLUDING INDEXES.
1267 transformIndexConstraints(CreateStmtContext *cxt)
1270 List *indexlist = NIL;
1274 * Run through the constraints that need to generate an index. For PRIMARY
1275 * KEY, mark each column as NOT NULL and create an index. For UNIQUE or
1276 * EXCLUDE, create an index as for PRIMARY KEY, but do not insist on NOT
1279 foreach(lc, cxt->ixconstraints)
1281 Constraint *constraint = (Constraint *) lfirst(lc);
1283 Assert(IsA(constraint, Constraint));
1284 Assert(constraint->contype == CONSTR_PRIMARY ||
1285 constraint->contype == CONSTR_UNIQUE ||
1286 constraint->contype == CONSTR_EXCLUSION);
1288 index = transformIndexConstraint(constraint, cxt);
1290 indexlist = lappend(indexlist, index);
1293 /* Add in any indexes defined by LIKE ... INCLUDING INDEXES */
1294 foreach(lc, cxt->inh_indexes)
1296 index = (IndexStmt *) lfirst(lc);
1300 if (cxt->pkey != NULL)
1302 (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1303 errmsg("multiple primary keys for table \"%s\" are not allowed",
1304 cxt->relation->relname)));
1308 indexlist = lappend(indexlist, index);
1312 * Scan the index list and remove any redundant index specifications. This
1313 * can happen if, for instance, the user writes UNIQUE PRIMARY KEY. A
1314 * strict reading of SQL92 would suggest raising an error instead, but
1315 * that strikes me as too anal-retentive. - tgl 2001-02-14
1317 * XXX in ALTER TABLE case, it'd be nice to look for duplicate
1318 * pre-existing indexes, too.
1320 Assert(cxt->alist == NIL);
1321 if (cxt->pkey != NULL)
1323 /* Make sure we keep the PKEY index in preference to others... */
1324 cxt->alist = list_make1(cxt->pkey);
1327 foreach(lc, indexlist)
1334 /* if it's pkey, it's already in cxt->alist */
1335 if (index == cxt->pkey)
1338 foreach(k, cxt->alist)
1340 IndexStmt *priorindex = lfirst(k);
1342 if (equal(index->indexParams, priorindex->indexParams) &&
1343 equal(index->whereClause, priorindex->whereClause) &&
1344 equal(index->excludeOpNames, priorindex->excludeOpNames) &&
1345 strcmp(index->accessMethod, priorindex->accessMethod) == 0 &&
1346 index->deferrable == priorindex->deferrable &&
1347 index->initdeferred == priorindex->initdeferred)
1349 priorindex->unique |= index->unique;
1352 * If the prior index is as yet unnamed, and this one is
1353 * named, then transfer the name to the prior index. This
1354 * ensures that if we have named and unnamed constraints,
1355 * we'll use (at least one of) the names for the index.
1357 if (priorindex->idxname == NULL)
1358 priorindex->idxname = index->idxname;
1365 cxt->alist = lappend(cxt->alist, index);
1370 * transformIndexConstraint
1371 * Transform one UNIQUE, PRIMARY KEY, or EXCLUDE constraint for
1372 * transformIndexConstraints.
1375 transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
1380 index = makeNode(IndexStmt);
1382 index->unique = (constraint->contype != CONSTR_EXCLUSION);
1383 index->primary = (constraint->contype == CONSTR_PRIMARY);
1386 if (cxt->pkey != NULL)
1388 (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1389 errmsg("multiple primary keys for table \"%s\" are not allowed",
1390 cxt->relation->relname),
1391 parser_errposition(cxt->pstate, constraint->location)));
1395 * In ALTER TABLE case, a primary index might already exist, but
1396 * DefineIndex will check for it.
1399 index->isconstraint = true;
1400 index->deferrable = constraint->deferrable;
1401 index->initdeferred = constraint->initdeferred;
1403 if (constraint->conname != NULL)
1404 index->idxname = pstrdup(constraint->conname);
1406 index->idxname = NULL; /* DefineIndex will choose name */
1408 index->relation = cxt->relation;
1409 index->accessMethod = constraint->access_method ? constraint->access_method : DEFAULT_INDEX_TYPE;
1410 index->options = constraint->options;
1411 index->tableSpace = constraint->indexspace;
1412 index->whereClause = constraint->where_clause;
1413 index->indexParams = NIL;
1414 index->excludeOpNames = NIL;
1415 index->indexOid = InvalidOid;
1416 index->concurrent = false;
1419 * If it's ALTER TABLE ADD CONSTRAINT USING INDEX, look up the index and
1420 * verify it's usable, then extract the implied column name list. (We
1421 * will not actually need the column name list at runtime, but we need it
1422 * now to check for duplicate column entries below.)
1424 if (constraint->indexname != NULL)
1426 char *index_name = constraint->indexname;
1427 Relation heap_rel = cxt->rel;
1430 Form_pg_index index_form;
1431 oidvector *indclass;
1432 Datum indclassDatum;
1436 /* Grammar should not allow this with explicit column list */
1437 Assert(constraint->keys == NIL);
1439 /* Grammar should only allow PRIMARY and UNIQUE constraints */
1440 Assert(constraint->contype == CONSTR_PRIMARY ||
1441 constraint->contype == CONSTR_UNIQUE);
1443 /* Must be ALTER, not CREATE, but grammar doesn't enforce that */
1446 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1447 errmsg("cannot use an existing index in CREATE TABLE"),
1448 parser_errposition(cxt->pstate, constraint->location)));
1450 /* Look for the index in the same schema as the table */
1451 index_oid = get_relname_relid(index_name, RelationGetNamespace(heap_rel));
1453 if (!OidIsValid(index_oid))
1455 (errcode(ERRCODE_UNDEFINED_OBJECT),
1456 errmsg("index \"%s\" does not exist", index_name),
1457 parser_errposition(cxt->pstate, constraint->location)));
1459 /* Open the index (this will throw an error if it is not an index) */
1460 index_rel = index_open(index_oid, AccessShareLock);
1461 index_form = index_rel->rd_index;
1463 /* Check that it does not have an associated constraint already */
1464 if (OidIsValid(get_index_constraint(index_oid)))
1466 (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1467 errmsg("index \"%s\" is already associated with a constraint",
1469 parser_errposition(cxt->pstate, constraint->location)));
1471 /* Perform validity checks on the index */
1472 if (index_form->indrelid != RelationGetRelid(heap_rel))
1474 (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1475 errmsg("index \"%s\" does not belong to table \"%s\"",
1476 index_name, RelationGetRelationName(heap_rel)),
1477 parser_errposition(cxt->pstate, constraint->location)));
1479 if (!index_form->indisvalid)
1481 (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1482 errmsg("index \"%s\" is not valid", index_name),
1483 parser_errposition(cxt->pstate, constraint->location)));
1485 if (!index_form->indisready)
1487 (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1488 errmsg("index \"%s\" is not ready", index_name),
1489 parser_errposition(cxt->pstate, constraint->location)));
1491 if (!index_form->indisunique)
1493 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1494 errmsg("\"%s\" is not a unique index", index_name),
1495 errdetail("Cannot create a primary key or unique constraint using such an index."),
1496 parser_errposition(cxt->pstate, constraint->location)));
1498 if (RelationGetIndexExpressions(index_rel) != NIL)
1500 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1501 errmsg("index \"%s\" contains expressions", index_name),
1502 errdetail("Cannot create a primary key or unique constraint using such an index."),
1503 parser_errposition(cxt->pstate, constraint->location)));
1505 if (RelationGetIndexPredicate(index_rel) != NIL)
1507 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1508 errmsg("\"%s\" is a partial index", index_name),
1509 errdetail("Cannot create a primary key or unique constraint using such an index."),
1510 parser_errposition(cxt->pstate, constraint->location)));
1513 * It's probably unsafe to change a deferred index to non-deferred. (A
1514 * non-constraint index couldn't be deferred anyway, so this case
1515 * should never occur; no need to sweat, but let's check it.)
1517 if (!index_form->indimmediate && !constraint->deferrable)
1519 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1520 errmsg("\"%s\" is a deferrable index", index_name),
1521 errdetail("Cannot create a non-deferrable constraint using a deferrable index."),
1522 parser_errposition(cxt->pstate, constraint->location)));
1525 * Insist on it being a btree. That's the only kind that supports
1526 * uniqueness at the moment anyway; but we must have an index that
1527 * exactly matches what you'd get from plain ADD CONSTRAINT syntax,
1528 * else dump and reload will produce a different index (breaking
1529 * pg_upgrade in particular).
1531 if (index_rel->rd_rel->relam != get_am_oid(DEFAULT_INDEX_TYPE, false))
1533 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1534 errmsg("index \"%s\" is not a b-tree", index_name),
1535 parser_errposition(cxt->pstate, constraint->location)));
1537 /* Must get indclass the hard way */
1538 indclassDatum = SysCacheGetAttr(INDEXRELID, index_rel->rd_indextuple,
1539 Anum_pg_index_indclass, &isnull);
1541 indclass = (oidvector *) DatumGetPointer(indclassDatum);
1543 for (i = 0; i < index_form->indnatts; i++)
1545 int2 attnum = index_form->indkey.values[i];
1546 Form_pg_attribute attform;
1551 * We shouldn't see attnum == 0 here, since we already rejected
1552 * expression indexes. If we do, SystemAttributeDefinition will
1557 Assert(attnum <= heap_rel->rd_att->natts);
1558 attform = heap_rel->rd_att->attrs[attnum - 1];
1561 attform = SystemAttributeDefinition(attnum,
1562 heap_rel->rd_rel->relhasoids);
1563 attname = pstrdup(NameStr(attform->attname));
1566 * Insist on default opclass and sort options. While the index
1567 * would still work as a constraint with non-default settings, it
1568 * might not provide exactly the same uniqueness semantics as
1569 * you'd get from a normally-created constraint; and there's also
1570 * the dump/reload problem mentioned above.
1572 defopclass = GetDefaultOpClass(attform->atttypid,
1573 index_rel->rd_rel->relam);
1574 if (indclass->values[i] != defopclass ||
1575 index_rel->rd_indoption[i] != 0)
1577 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1578 errmsg("index \"%s\" does not have default sorting behavior", index_name),
1579 errdetail("Cannot create a primary key or unique constraint using such an index."),
1580 parser_errposition(cxt->pstate, constraint->location)));
1582 constraint->keys = lappend(constraint->keys, makeString(attname));
1585 /* Close the index relation but keep the lock */
1586 relation_close(index_rel, NoLock);
1588 index->indexOid = index_oid;
1592 * If it's an EXCLUDE constraint, the grammar returns a list of pairs of
1593 * IndexElems and operator names. We have to break that apart into
1596 if (constraint->contype == CONSTR_EXCLUSION)
1598 foreach(lc, constraint->exclusions)
1600 List *pair = (List *) lfirst(lc);
1604 Assert(list_length(pair) == 2);
1605 elem = (IndexElem *) linitial(pair);
1606 Assert(IsA(elem, IndexElem));
1607 opname = (List *) lsecond(pair);
1608 Assert(IsA(opname, List));
1610 index->indexParams = lappend(index->indexParams, elem);
1611 index->excludeOpNames = lappend(index->excludeOpNames, opname);
1618 * For UNIQUE and PRIMARY KEY, we just have a list of column names.
1620 * Make sure referenced keys exist. If we are making a PRIMARY KEY index,
1621 * also make sure they are NOT NULL, if possible. (Although we could leave
1622 * it to DefineIndex to mark the columns NOT NULL, it's more efficient to
1623 * get it right the first time.)
1625 foreach(lc, constraint->keys)
1627 char *key = strVal(lfirst(lc));
1629 ColumnDef *column = NULL;
1633 foreach(columns, cxt->columns)
1635 column = (ColumnDef *) lfirst(columns);
1636 Assert(IsA(column, ColumnDef));
1637 if (strcmp(column->colname, key) == 0)
1645 /* found column in the new table; force it to be NOT NULL */
1646 if (constraint->contype == CONSTR_PRIMARY)
1647 column->is_not_null = TRUE;
1649 else if (SystemAttributeByName(key, cxt->hasoids) != NULL)
1652 * column will be a system column in the new table, so accept it.
1653 * System columns can't ever be null, so no need to worry about
1654 * PRIMARY/NOT NULL constraint.
1658 else if (cxt->inhRelations)
1660 /* try inherited tables */
1663 foreach(inher, cxt->inhRelations)
1665 RangeVar *inh = (RangeVar *) lfirst(inher);
1669 Assert(IsA(inh, RangeVar));
1670 rel = heap_openrv(inh, AccessShareLock);
1671 if (rel->rd_rel->relkind != RELKIND_RELATION)
1673 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1674 errmsg("inherited relation \"%s\" is not a table",
1676 for (count = 0; count < rel->rd_att->natts; count++)
1678 Form_pg_attribute inhattr = rel->rd_att->attrs[count];
1679 char *inhname = NameStr(inhattr->attname);
1681 if (inhattr->attisdropped)
1683 if (strcmp(key, inhname) == 0)
1688 * We currently have no easy way to force an inherited
1689 * column to be NOT NULL at creation, if its parent
1690 * wasn't so already. We leave it to DefineIndex to
1691 * fix things up in this case.
1696 heap_close(rel, NoLock);
1703 * In the ALTER TABLE case, don't complain about index keys not
1704 * created in the command; they may well exist already. DefineIndex
1705 * will complain about them if not, and will also take care of marking
1708 if (!found && !cxt->isalter)
1710 (errcode(ERRCODE_UNDEFINED_COLUMN),
1711 errmsg("column \"%s\" named in key does not exist", key),
1712 parser_errposition(cxt->pstate, constraint->location)));
1714 /* Check for PRIMARY KEY(foo, foo) */
1715 foreach(columns, index->indexParams)
1717 iparam = (IndexElem *) lfirst(columns);
1718 if (iparam->name && strcmp(key, iparam->name) == 0)
1722 (errcode(ERRCODE_DUPLICATE_COLUMN),
1723 errmsg("column \"%s\" appears twice in primary key constraint",
1725 parser_errposition(cxt->pstate, constraint->location)));
1728 (errcode(ERRCODE_DUPLICATE_COLUMN),
1729 errmsg("column \"%s\" appears twice in unique constraint",
1731 parser_errposition(cxt->pstate, constraint->location)));
1735 /* OK, add it to the index definition */
1736 iparam = makeNode(IndexElem);
1737 iparam->name = pstrdup(key);
1738 iparam->expr = NULL;
1739 iparam->indexcolname = NULL;
1740 iparam->collation = NIL;
1741 iparam->opclass = NIL;
1742 iparam->ordering = SORTBY_DEFAULT;
1743 iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1744 index->indexParams = lappend(index->indexParams, iparam);
1751 * transformFKConstraints
1752 * handle FOREIGN KEY constraints
1755 transformFKConstraints(CreateStmtContext *cxt,
1756 bool skipValidation, bool isAddConstraint)
1760 if (cxt->fkconstraints == NIL)
1764 * If CREATE TABLE or adding a column with NULL default, we can safely
1765 * skip validation of FK constraints, and nonetheless mark them valid.
1766 * (This will override any user-supplied NOT VALID flag.)
1770 foreach(fkclist, cxt->fkconstraints)
1772 Constraint *constraint = (Constraint *) lfirst(fkclist);
1774 constraint->skip_validation = true;
1775 constraint->initially_valid = true;
1780 * For CREATE TABLE or ALTER TABLE ADD COLUMN, gin up an ALTER TABLE ADD
1781 * CONSTRAINT command to execute after the basic command is complete. (If
1782 * called from ADD CONSTRAINT, that routine will add the FK constraints to
1783 * its own subcommand list.)
1785 * Note: the ADD CONSTRAINT command must also execute after any index
1786 * creation commands. Thus, this should run after
1787 * transformIndexConstraints, so that the CREATE INDEX commands are
1788 * already in cxt->alist.
1790 if (!isAddConstraint)
1792 AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
1794 alterstmt->relation = cxt->relation;
1795 alterstmt->cmds = NIL;
1796 alterstmt->relkind = OBJECT_TABLE;
1798 foreach(fkclist, cxt->fkconstraints)
1800 Constraint *constraint = (Constraint *) lfirst(fkclist);
1801 AlterTableCmd *altercmd = makeNode(AlterTableCmd);
1803 altercmd->subtype = AT_ProcessedConstraint;
1804 altercmd->name = NULL;
1805 altercmd->def = (Node *) constraint;
1806 alterstmt->cmds = lappend(alterstmt->cmds, altercmd);
1809 cxt->alist = lappend(cxt->alist, alterstmt);
1814 * transformIndexStmt - parse analysis for CREATE INDEX and ALTER TABLE
1816 * Note: this is a no-op for an index not using either index expressions or
1817 * a predicate expression. There are several code paths that create indexes
1818 * without bothering to call this, because they know they don't have any
1819 * such expressions to deal with.
1822 transformIndexStmt(IndexStmt *stmt, const char *queryString)
1830 * We must not scribble on the passed-in IndexStmt, so copy it. (This is
1831 * overkill, but easy.)
1833 stmt = (IndexStmt *) copyObject(stmt);
1836 * Open the parent table with appropriate locking. We must do this
1837 * because addRangeTableEntry() would acquire only AccessShareLock,
1838 * leaving DefineIndex() needing to do a lock upgrade with consequent risk
1839 * of deadlock. Make sure this stays in sync with the type of lock
1840 * DefineIndex() wants. If we are being called by ALTER TABLE, we will
1841 * already hold a higher lock.
1843 rel = heap_openrv(stmt->relation,
1844 (stmt->concurrent ? ShareUpdateExclusiveLock : ShareLock));
1847 pstate = make_parsestate(NULL);
1848 pstate->p_sourcetext = queryString;
1851 * Put the parent table into the rtable so that the expressions can refer
1852 * to its fields without qualification.
1854 rte = addRangeTableEntry(pstate, stmt->relation, NULL, false, true);
1856 /* no to join list, yes to namespaces */
1857 addRTEtoQuery(pstate, rte, false, true, true);
1859 /* take care of the where clause */
1860 if (stmt->whereClause)
1862 stmt->whereClause = transformWhereClause(pstate,
1865 /* we have to fix its collations too */
1866 assign_expr_collations(pstate, stmt->whereClause);
1869 /* take care of any index expressions */
1870 foreach(l, stmt->indexParams)
1872 IndexElem *ielem = (IndexElem *) lfirst(l);
1876 /* Extract preliminary index col name before transforming expr */
1877 if (ielem->indexcolname == NULL)
1878 ielem->indexcolname = FigureIndexColname(ielem->expr);
1880 /* Now do parse transformation of the expression */
1881 ielem->expr = transformExpr(pstate, ielem->expr);
1883 /* We have to fix its collations too */
1884 assign_expr_collations(pstate, ielem->expr);
1887 * We check only that the result type is legitimate; this is for
1888 * consistency with what transformWhereClause() checks for the
1889 * predicate. DefineIndex() will make more checks.
1891 if (expression_returns_set(ielem->expr))
1893 (errcode(ERRCODE_DATATYPE_MISMATCH),
1894 errmsg("index expression cannot return a set")));
1899 * Check that only the base rel is mentioned.
1901 if (list_length(pstate->p_rtable) != 1)
1903 (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1904 errmsg("index expressions and predicates can refer only to the table being indexed")));
1906 free_parsestate(pstate);
1908 /* Close relation, but keep the lock */
1909 heap_close(rel, NoLock);
1916 * transformRuleStmt -
1917 * transform a CREATE RULE Statement. The action is a list of parse
1918 * trees which is transformed into a list of query trees, and we also
1919 * transform the WHERE clause if any.
1921 * actions and whereClause are output parameters that receive the
1922 * transformed results.
1924 * Note that we must not scribble on the passed-in RuleStmt, so we do
1925 * copyObject() on the actions and WHERE clause.
1928 transformRuleStmt(RuleStmt *stmt, const char *queryString,
1929 List **actions, Node **whereClause)
1933 RangeTblEntry *oldrte;
1934 RangeTblEntry *newrte;
1937 * To avoid deadlock, make sure the first thing we do is grab
1938 * AccessExclusiveLock on the target relation. This will be needed by
1939 * DefineQueryRewrite(), and we don't want to grab a lesser lock
1942 rel = heap_openrv(stmt->relation, AccessExclusiveLock);
1945 pstate = make_parsestate(NULL);
1946 pstate->p_sourcetext = queryString;
1949 * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
1950 * Set up their RTEs in the main pstate for use in parsing the rule
1953 oldrte = addRangeTableEntryForRelation(pstate, rel,
1954 makeAlias("old", NIL),
1956 newrte = addRangeTableEntryForRelation(pstate, rel,
1957 makeAlias("new", NIL),
1959 /* Must override addRangeTableEntry's default access-check flags */
1960 oldrte->requiredPerms = 0;
1961 newrte->requiredPerms = 0;
1964 * They must be in the namespace too for lookup purposes, but only add the
1965 * one(s) that are relevant for the current kind of rule. In an UPDATE
1966 * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
1967 * there's no need to be so picky for INSERT & DELETE. We do not add them
1970 switch (stmt->event)
1973 addRTEtoQuery(pstate, oldrte, false, true, true);
1976 addRTEtoQuery(pstate, oldrte, false, true, true);
1977 addRTEtoQuery(pstate, newrte, false, true, true);
1980 addRTEtoQuery(pstate, newrte, false, true, true);
1983 addRTEtoQuery(pstate, oldrte, false, true, true);
1986 elog(ERROR, "unrecognized event type: %d",
1991 /* take care of the where clause */
1992 *whereClause = transformWhereClause(pstate,
1993 (Node *) copyObject(stmt->whereClause),
1995 /* we have to fix its collations too */
1996 assign_expr_collations(pstate, *whereClause);
1998 if (list_length(pstate->p_rtable) != 2) /* naughty, naughty... */
2000 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2001 errmsg("rule WHERE condition cannot contain references to other relations")));
2003 /* aggregates not allowed (but subselects are okay) */
2004 if (pstate->p_hasAggs)
2006 (errcode(ERRCODE_GROUPING_ERROR),
2007 errmsg("cannot use aggregate function in rule WHERE condition")));
2008 if (pstate->p_hasWindowFuncs)
2010 (errcode(ERRCODE_WINDOWING_ERROR),
2011 errmsg("cannot use window function in rule WHERE condition")));
2014 * 'instead nothing' rules with a qualification need a query rangetable so
2015 * the rewrite handler can add the negated rule qualification to the
2016 * original query. We create a query with the new command type CMD_NOTHING
2017 * here that is treated specially by the rewrite system.
2019 if (stmt->actions == NIL)
2021 Query *nothing_qry = makeNode(Query);
2023 nothing_qry->commandType = CMD_NOTHING;
2024 nothing_qry->rtable = pstate->p_rtable;
2025 nothing_qry->jointree = makeFromExpr(NIL, NULL); /* no join wanted */
2027 *actions = list_make1(nothing_qry);
2032 List *newactions = NIL;
2035 * transform each statement, like parse_sub_analyze()
2037 foreach(l, stmt->actions)
2039 Node *action = (Node *) lfirst(l);
2040 ParseState *sub_pstate = make_parsestate(NULL);
2047 * Since outer ParseState isn't parent of inner, have to pass down
2048 * the query text by hand.
2050 sub_pstate->p_sourcetext = queryString;
2053 * Set up OLD/NEW in the rtable for this statement. The entries
2054 * are added only to relnamespace, not varnamespace, because we
2055 * don't want them to be referred to by unqualified field names
2056 * nor "*" in the rule actions. We decide later whether to put
2057 * them in the joinlist.
2059 oldrte = addRangeTableEntryForRelation(sub_pstate, rel,
2060 makeAlias("old", NIL),
2062 newrte = addRangeTableEntryForRelation(sub_pstate, rel,
2063 makeAlias("new", NIL),
2065 oldrte->requiredPerms = 0;
2066 newrte->requiredPerms = 0;
2067 addRTEtoQuery(sub_pstate, oldrte, false, true, false);
2068 addRTEtoQuery(sub_pstate, newrte, false, true, false);
2070 /* Transform the rule action statement */
2071 top_subqry = transformStmt(sub_pstate,
2072 (Node *) copyObject(action));
2075 * We cannot support utility-statement actions (eg NOTIFY) with
2076 * nonempty rule WHERE conditions, because there's no way to make
2077 * the utility action execute conditionally.
2079 if (top_subqry->commandType == CMD_UTILITY &&
2080 *whereClause != NULL)
2082 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2083 errmsg("rules with WHERE conditions can only have SELECT, INSERT, UPDATE, or DELETE actions")));
2086 * If the action is INSERT...SELECT, OLD/NEW have been pushed down
2087 * into the SELECT, and that's what we need to look at. (Ugly
2088 * kluge ... try to fix this when we redesign querytrees.)
2090 sub_qry = getInsertSelectQuery(top_subqry, NULL);
2093 * If the sub_qry is a setop, we cannot attach any qualifications
2094 * to it, because the planner won't notice them. This could
2095 * perhaps be relaxed someday, but for now, we may as well reject
2096 * such a rule immediately.
2098 if (sub_qry->setOperations != NULL && *whereClause != NULL)
2100 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2101 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
2104 * Validate action's use of OLD/NEW, qual too
2107 rangeTableEntry_used((Node *) sub_qry, PRS2_OLD_VARNO, 0) ||
2108 rangeTableEntry_used(*whereClause, PRS2_OLD_VARNO, 0);
2110 rangeTableEntry_used((Node *) sub_qry, PRS2_NEW_VARNO, 0) ||
2111 rangeTableEntry_used(*whereClause, PRS2_NEW_VARNO, 0);
2113 switch (stmt->event)
2118 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2119 errmsg("ON SELECT rule cannot use OLD")));
2122 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2123 errmsg("ON SELECT rule cannot use NEW")));
2131 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2132 errmsg("ON INSERT rule cannot use OLD")));
2137 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2138 errmsg("ON DELETE rule cannot use NEW")));
2141 elog(ERROR, "unrecognized event type: %d",
2147 * OLD/NEW are not allowed in WITH queries, because they would
2148 * amount to outer references for the WITH, which we disallow.
2149 * However, they were already in the outer rangetable when we
2150 * analyzed the query, so we have to check.
2152 * Note that in the INSERT...SELECT case, we need to examine the
2153 * CTE lists of both top_subqry and sub_qry.
2155 * Note that we aren't digging into the body of the query looking
2156 * for WITHs in nested sub-SELECTs. A WITH down there can
2157 * legitimately refer to OLD/NEW, because it'd be an
2158 * indirect-correlated outer reference.
2160 if (rangeTableEntry_used((Node *) top_subqry->cteList,
2161 PRS2_OLD_VARNO, 0) ||
2162 rangeTableEntry_used((Node *) sub_qry->cteList,
2165 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2166 errmsg("cannot refer to OLD within WITH query")));
2167 if (rangeTableEntry_used((Node *) top_subqry->cteList,
2168 PRS2_NEW_VARNO, 0) ||
2169 rangeTableEntry_used((Node *) sub_qry->cteList,
2172 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2173 errmsg("cannot refer to NEW within WITH query")));
2176 * For efficiency's sake, add OLD to the rule action's jointree
2177 * only if it was actually referenced in the statement or qual.
2179 * For INSERT, NEW is not really a relation (only a reference to
2180 * the to-be-inserted tuple) and should never be added to the
2183 * For UPDATE, we treat NEW as being another kind of reference to
2184 * OLD, because it represents references to *transformed* tuples
2185 * of the existing relation. It would be wrong to enter NEW
2186 * separately in the jointree, since that would cause a double
2187 * join of the updated relation. It's also wrong to fail to make
2188 * a jointree entry if only NEW and not OLD is mentioned.
2190 if (has_old || (has_new && stmt->event == CMD_UPDATE))
2193 * If sub_qry is a setop, manipulating its jointree will do no
2194 * good at all, because the jointree is dummy. (This should be
2195 * a can't-happen case because of prior tests.)
2197 if (sub_qry->setOperations != NULL)
2199 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2200 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
2201 /* hack so we can use addRTEtoQuery() */
2202 sub_pstate->p_rtable = sub_qry->rtable;
2203 sub_pstate->p_joinlist = sub_qry->jointree->fromlist;
2204 addRTEtoQuery(sub_pstate, oldrte, true, false, false);
2205 sub_qry->jointree->fromlist = sub_pstate->p_joinlist;
2208 newactions = lappend(newactions, top_subqry);
2210 free_parsestate(sub_pstate);
2213 *actions = newactions;
2216 free_parsestate(pstate);
2218 /* Close relation, but keep the exclusive lock */
2219 heap_close(rel, NoLock);
2224 * transformAlterTableStmt -
2225 * parse analysis for ALTER TABLE
2227 * Returns a List of utility commands to be done in sequence. One of these
2228 * will be the transformed AlterTableStmt, but there may be additional actions
2229 * to be done before and after the actual AlterTable() call.
2232 transformAlterTableStmt(AlterTableStmt *stmt, const char *queryString)
2236 CreateStmtContext cxt;
2241 List *newcmds = NIL;
2242 bool skipValidation = true;
2243 AlterTableCmd *newcmd;
2247 * We must not scribble on the passed-in AlterTableStmt, so copy it. (This
2248 * is overkill, but easy.)
2250 stmt = (AlterTableStmt *) copyObject(stmt);
2253 * Determine the appropriate lock level for this list of subcommands.
2255 lockmode = AlterTableGetLockLevel(stmt->cmds);
2258 * Acquire appropriate lock on the target relation, which will be held
2259 * until end of transaction. This ensures any decisions we make here
2260 * based on the state of the relation will still be good at execution. We
2261 * must get lock now because execution will later require it; taking a
2262 * lower grade lock now and trying to upgrade later risks deadlock. Any
2263 * new commands we add after this must not upgrade the lock level
2266 rel = relation_openrv(stmt->relation, lockmode);
2268 /* Set up pstate and CreateStmtContext */
2269 pstate = make_parsestate(NULL);
2270 pstate->p_sourcetext = queryString;
2272 cxt.pstate = pstate;
2273 cxt.stmtType = "ALTER TABLE";
2274 cxt.relation = stmt->relation;
2276 cxt.inhRelations = NIL;
2278 cxt.hasoids = false; /* need not be right */
2280 cxt.ckconstraints = NIL;
2281 cxt.fkconstraints = NIL;
2282 cxt.ixconstraints = NIL;
2283 cxt.inh_indexes = NIL;
2289 * The only subtypes that currently require parse transformation handling
2290 * are ADD COLUMN and ADD CONSTRAINT. These largely re-use code from
2293 foreach(lcmd, stmt->cmds)
2295 AlterTableCmd *cmd = (AlterTableCmd *) lfirst(lcmd);
2297 switch (cmd->subtype)
2300 case AT_AddColumnToView:
2302 ColumnDef *def = (ColumnDef *) cmd->def;
2304 Assert(IsA(def, ColumnDef));
2305 transformColumnDefinition(&cxt, def);
2308 * If the column has a non-null default, we can't skip
2309 * validation of foreign keys.
2311 if (def->raw_default != NULL)
2312 skipValidation = false;
2315 * All constraints are processed in other ways. Remove the
2318 def->constraints = NIL;
2320 newcmds = lappend(newcmds, cmd);
2323 case AT_AddConstraint:
2326 * The original AddConstraint cmd node doesn't go to newcmds
2328 if (IsA(cmd->def, Constraint))
2330 transformTableConstraint(&cxt, (Constraint *) cmd->def);
2331 if (((Constraint *) cmd->def)->contype == CONSTR_FOREIGN)
2332 skipValidation = false;
2335 elog(ERROR, "unrecognized node type: %d",
2336 (int) nodeTag(cmd->def));
2339 case AT_ProcessedConstraint:
2342 * Already-transformed ADD CONSTRAINT, so just make it look
2343 * like the standard case.
2345 cmd->subtype = AT_AddConstraint;
2346 newcmds = lappend(newcmds, cmd);
2350 newcmds = lappend(newcmds, cmd);
2356 * transformIndexConstraints wants cxt.alist to contain only index
2357 * statements, so transfer anything we already have into save_alist
2360 save_alist = cxt.alist;
2363 /* Postprocess index and FK constraints */
2364 transformIndexConstraints(&cxt);
2366 transformFKConstraints(&cxt, skipValidation, true);
2369 * Push any index-creation commands into the ALTER, so that they can be
2370 * scheduled nicely by tablecmds.c. Note that tablecmds.c assumes that
2371 * the IndexStmt attached to an AT_AddIndex or AT_AddIndexConstraint
2372 * subcommand has already been through transformIndexStmt.
2374 foreach(l, cxt.alist)
2376 IndexStmt *idxstmt = (IndexStmt *) lfirst(l);
2378 Assert(IsA(idxstmt, IndexStmt));
2379 idxstmt = transformIndexStmt(idxstmt, queryString);
2380 newcmd = makeNode(AlterTableCmd);
2381 newcmd->subtype = OidIsValid(idxstmt->indexOid) ? AT_AddIndexConstraint : AT_AddIndex;
2382 newcmd->def = (Node *) idxstmt;
2383 newcmds = lappend(newcmds, newcmd);
2387 /* Append any CHECK or FK constraints to the commands list */
2388 foreach(l, cxt.ckconstraints)
2390 newcmd = makeNode(AlterTableCmd);
2391 newcmd->subtype = AT_AddConstraint;
2392 newcmd->def = (Node *) lfirst(l);
2393 newcmds = lappend(newcmds, newcmd);
2395 foreach(l, cxt.fkconstraints)
2397 newcmd = makeNode(AlterTableCmd);
2398 newcmd->subtype = AT_AddConstraint;
2399 newcmd->def = (Node *) lfirst(l);
2400 newcmds = lappend(newcmds, newcmd);
2403 /* Close rel but keep lock */
2404 relation_close(rel, NoLock);
2409 stmt->cmds = newcmds;
2411 result = lappend(cxt.blist, stmt);
2412 result = list_concat(result, cxt.alist);
2413 result = list_concat(result, save_alist);
2420 * Preprocess a list of column constraint clauses
2421 * to attach constraint attributes to their primary constraint nodes
2422 * and detect inconsistent/misplaced constraint attributes.
2424 * NOTE: currently, attributes are only supported for FOREIGN KEY, UNIQUE,
2425 * EXCLUSION, and PRIMARY KEY constraints, but someday they ought to be
2426 * supported for other constraint types.
2429 transformConstraintAttrs(CreateStmtContext *cxt, List *constraintList)
2431 Constraint *lastprimarycon = NULL;
2432 bool saw_deferrability = false;
2433 bool saw_initially = false;
2436 #define SUPPORTS_ATTRS(node) \
2437 ((node) != NULL && \
2438 ((node)->contype == CONSTR_PRIMARY || \
2439 (node)->contype == CONSTR_UNIQUE || \
2440 (node)->contype == CONSTR_EXCLUSION || \
2441 (node)->contype == CONSTR_FOREIGN))
2443 foreach(clist, constraintList)
2445 Constraint *con = (Constraint *) lfirst(clist);
2447 if (!IsA(con, Constraint))
2448 elog(ERROR, "unrecognized node type: %d",
2449 (int) nodeTag(con));
2450 switch (con->contype)
2452 case CONSTR_ATTR_DEFERRABLE:
2453 if (!SUPPORTS_ATTRS(lastprimarycon))
2455 (errcode(ERRCODE_SYNTAX_ERROR),
2456 errmsg("misplaced DEFERRABLE clause"),
2457 parser_errposition(cxt->pstate, con->location)));
2458 if (saw_deferrability)
2460 (errcode(ERRCODE_SYNTAX_ERROR),
2461 errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
2462 parser_errposition(cxt->pstate, con->location)));
2463 saw_deferrability = true;
2464 lastprimarycon->deferrable = true;
2467 case CONSTR_ATTR_NOT_DEFERRABLE:
2468 if (!SUPPORTS_ATTRS(lastprimarycon))
2470 (errcode(ERRCODE_SYNTAX_ERROR),
2471 errmsg("misplaced NOT DEFERRABLE clause"),
2472 parser_errposition(cxt->pstate, con->location)));
2473 if (saw_deferrability)
2475 (errcode(ERRCODE_SYNTAX_ERROR),
2476 errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
2477 parser_errposition(cxt->pstate, con->location)));
2478 saw_deferrability = true;
2479 lastprimarycon->deferrable = false;
2480 if (saw_initially &&
2481 lastprimarycon->initdeferred)
2483 (errcode(ERRCODE_SYNTAX_ERROR),
2484 errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
2485 parser_errposition(cxt->pstate, con->location)));
2488 case CONSTR_ATTR_DEFERRED:
2489 if (!SUPPORTS_ATTRS(lastprimarycon))
2491 (errcode(ERRCODE_SYNTAX_ERROR),
2492 errmsg("misplaced INITIALLY DEFERRED clause"),
2493 parser_errposition(cxt->pstate, con->location)));
2496 (errcode(ERRCODE_SYNTAX_ERROR),
2497 errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
2498 parser_errposition(cxt->pstate, con->location)));
2499 saw_initially = true;
2500 lastprimarycon->initdeferred = true;
2503 * If only INITIALLY DEFERRED appears, assume DEFERRABLE
2505 if (!saw_deferrability)
2506 lastprimarycon->deferrable = true;
2507 else if (!lastprimarycon->deferrable)
2509 (errcode(ERRCODE_SYNTAX_ERROR),
2510 errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
2511 parser_errposition(cxt->pstate, con->location)));
2514 case CONSTR_ATTR_IMMEDIATE:
2515 if (!SUPPORTS_ATTRS(lastprimarycon))
2517 (errcode(ERRCODE_SYNTAX_ERROR),
2518 errmsg("misplaced INITIALLY IMMEDIATE clause"),
2519 parser_errposition(cxt->pstate, con->location)));
2522 (errcode(ERRCODE_SYNTAX_ERROR),
2523 errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
2524 parser_errposition(cxt->pstate, con->location)));
2525 saw_initially = true;
2526 lastprimarycon->initdeferred = false;
2530 /* Otherwise it's not an attribute */
2531 lastprimarycon = con;
2532 /* reset flags for new primary node */
2533 saw_deferrability = false;
2534 saw_initially = false;
2541 * Special handling of type definition for a column
2544 transformColumnType(CreateStmtContext *cxt, ColumnDef *column)
2547 * All we really need to do here is verify that the type is valid,
2548 * including any collation spec that might be present.
2550 Type ctype = typenameType(cxt->pstate, column->typeName, NULL);
2552 if (column->collClause)
2554 Form_pg_type typtup = (Form_pg_type) GETSTRUCT(ctype);
2556 LookupCollation(cxt->pstate,
2557 column->collClause->collname,
2558 column->collClause->location);
2559 /* Complain if COLLATE is applied to an uncollatable type */
2560 if (!OidIsValid(typtup->typcollation))
2562 (errcode(ERRCODE_DATATYPE_MISMATCH),
2563 errmsg("collations are not supported by type %s",
2564 format_type_be(HeapTupleGetOid(ctype))),
2565 parser_errposition(cxt->pstate,
2566 column->collClause->location)));
2569 ReleaseSysCache(ctype);
2574 * transformCreateSchemaStmt -
2575 * analyzes the CREATE SCHEMA statement
2577 * Split the schema element list into individual commands and place
2578 * them in the result list in an order such that there are no forward
2579 * references (e.g. GRANT to a table created later in the list). Note
2580 * that the logic we use for determining forward references is
2581 * presently quite incomplete.
2583 * SQL92 also allows constraints to make forward references, so thumb through
2584 * the table columns and move forward references to a posterior alter-table
2587 * The result is a list of parse nodes that still need to be analyzed ---
2588 * but we can't analyze the later commands until we've executed the earlier
2589 * ones, because of possible inter-object references.
2591 * Note: this breaks the rules a little bit by modifying schema-name fields
2592 * within passed-in structs. However, the transformation would be the same
2593 * if done over, so it should be all right to scribble on the input to this
2597 transformCreateSchemaStmt(CreateSchemaStmt *stmt)
2599 CreateSchemaStmtContext cxt;
2603 cxt.stmtType = "CREATE SCHEMA";
2604 cxt.schemaname = stmt->schemaname;
2605 cxt.authid = stmt->authid;
2606 cxt.sequences = NIL;
2614 * Run through each schema element in the schema element list. Separate
2615 * statements by type, and do preliminary analysis.
2617 foreach(elements, stmt->schemaElts)
2619 Node *element = lfirst(elements);
2621 switch (nodeTag(element))
2623 case T_CreateSeqStmt:
2625 CreateSeqStmt *elp = (CreateSeqStmt *) element;
2627 setSchemaName(cxt.schemaname, &elp->sequence->schemaname);
2628 cxt.sequences = lappend(cxt.sequences, element);
2634 CreateStmt *elp = (CreateStmt *) element;
2636 setSchemaName(cxt.schemaname, &elp->relation->schemaname);
2639 * XXX todo: deal with constraints
2641 cxt.tables = lappend(cxt.tables, element);
2647 ViewStmt *elp = (ViewStmt *) element;
2649 setSchemaName(cxt.schemaname, &elp->view->schemaname);
2652 * XXX todo: deal with references between views
2654 cxt.views = lappend(cxt.views, element);
2660 IndexStmt *elp = (IndexStmt *) element;
2662 setSchemaName(cxt.schemaname, &elp->relation->schemaname);
2663 cxt.indexes = lappend(cxt.indexes, element);
2667 case T_CreateTrigStmt:
2669 CreateTrigStmt *elp = (CreateTrigStmt *) element;
2671 setSchemaName(cxt.schemaname, &elp->relation->schemaname);
2672 cxt.triggers = lappend(cxt.triggers, element);
2677 cxt.grants = lappend(cxt.grants, element);
2681 elog(ERROR, "unrecognized node type: %d",
2682 (int) nodeTag(element));
2687 result = list_concat(result, cxt.sequences);
2688 result = list_concat(result, cxt.tables);
2689 result = list_concat(result, cxt.views);
2690 result = list_concat(result, cxt.indexes);
2691 result = list_concat(result, cxt.triggers);
2692 result = list_concat(result, cxt.grants);
2699 * Set or check schema name in an element of a CREATE SCHEMA command
2702 setSchemaName(char *context_schema, char **stmt_schema_name)
2704 if (*stmt_schema_name == NULL)
2705 *stmt_schema_name = context_schema;
2706 else if (strcmp(context_schema, *stmt_schema_name) != 0)
2708 (errcode(ERRCODE_INVALID_SCHEMA_DEFINITION),
2709 errmsg("CREATE specifies a schema (%s) "
2710 "different from the one being created (%s)",
2711 *stmt_schema_name, context_schema)));