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-2009, PostgreSQL Global Development Group
20 * Portions Copyright (c) 1994, Regents of the University of California
22 * $PostgreSQL: pgsql/src/backend/parser/parse_utilcmd.c,v 2.20 2009/01/01 17:23:46 momjian Exp $
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_opclass.h"
37 #include "catalog/pg_type.h"
38 #include "commands/defrem.h"
39 #include "commands/tablecmds.h"
40 #include "commands/tablespace.h"
41 #include "miscadmin.h"
42 #include "nodes/makefuncs.h"
43 #include "nodes/nodeFuncs.h"
44 #include "parser/analyze.h"
45 #include "parser/gramparse.h"
46 #include "parser/parse_clause.h"
47 #include "parser/parse_expr.h"
48 #include "parser/parse_relation.h"
49 #include "parser/parse_type.h"
50 #include "parser/parse_utilcmd.h"
51 #include "rewrite/rewriteManip.h"
52 #include "utils/acl.h"
53 #include "utils/builtins.h"
54 #include "utils/lsyscache.h"
55 #include "utils/relcache.h"
56 #include "utils/syscache.h"
59 /* State shared by transformCreateStmt and its subroutines */
62 const char *stmtType; /* "CREATE TABLE" or "ALTER TABLE" */
63 RangeVar *relation; /* relation to create */
64 Relation rel; /* opened/locked rel, if ALTER */
65 List *inhRelations; /* relations to inherit from */
66 bool isalter; /* true if altering existing table */
67 bool hasoids; /* does relation have an OID column? */
68 List *columns; /* ColumnDef items */
69 List *ckconstraints; /* CHECK constraints */
70 List *fkconstraints; /* FOREIGN KEY constraints */
71 List *ixconstraints; /* index-creating constraints */
72 List *inh_indexes; /* cloned indexes from INCLUDING INDEXES */
73 List *blist; /* "before list" of things to do before
74 * creating the table */
75 List *alist; /* "after list" of things to do after creating
77 IndexStmt *pkey; /* PRIMARY KEY index, if any */
80 /* State shared by transformCreateSchemaStmt and its subroutines */
83 const char *stmtType; /* "CREATE SCHEMA" or "ALTER SCHEMA" */
84 char *schemaname; /* name of schema */
85 char *authid; /* owner of schema */
86 List *sequences; /* CREATE SEQUENCE items */
87 List *tables; /* CREATE TABLE items */
88 List *views; /* CREATE VIEW items */
89 List *indexes; /* CREATE INDEX items */
90 List *triggers; /* CREATE TRIGGER items */
91 List *grants; /* GRANT items */
92 } CreateSchemaStmtContext;
95 static void transformColumnDefinition(ParseState *pstate,
96 CreateStmtContext *cxt,
98 static void transformTableConstraint(ParseState *pstate,
99 CreateStmtContext *cxt,
100 Constraint *constraint);
101 static void transformInhRelation(ParseState *pstate, CreateStmtContext *cxt,
102 InhRelation *inhrelation);
103 static IndexStmt *generateClonedIndexStmt(CreateStmtContext *cxt,
104 Relation parent_index, AttrNumber *attmap);
105 static List *get_opclass(Oid opclass, Oid actual_datatype);
106 static void transformIndexConstraints(ParseState *pstate,
107 CreateStmtContext *cxt);
108 static IndexStmt *transformIndexConstraint(Constraint *constraint,
109 CreateStmtContext *cxt);
110 static void transformFKConstraints(ParseState *pstate,
111 CreateStmtContext *cxt,
113 bool isAddConstraint);
114 static void transformConstraintAttrs(List *constraintList);
115 static void transformColumnType(ParseState *pstate, ColumnDef *column);
116 static void setSchemaName(char *context_schema, char **stmt_schema_name);
120 * transformCreateStmt -
121 * parse analysis for CREATE TABLE
123 * Returns a List of utility commands to be done in sequence. One of these
124 * will be the transformed CreateStmt, but there may be additional actions
125 * to be done before and after the actual DefineRelation() call.
127 * SQL92 allows constraints to be scattered all over, so thumb through
128 * the columns and collect all constraints into one place.
129 * If there are any implied indices (e.g. UNIQUE or PRIMARY KEY)
130 * then expand those into multiple IndexStmt blocks.
131 * - thomas 1997-12-02
134 transformCreateStmt(CreateStmt *stmt, const char *queryString)
137 CreateStmtContext cxt;
143 * We must not scribble on the passed-in CreateStmt, so copy it. (This is
144 * overkill, but easy.)
146 stmt = (CreateStmt *) copyObject(stmt);
149 * If the target relation name isn't schema-qualified, make it so. This
150 * prevents some corner cases in which added-on rewritten commands might
151 * think they should apply to other relations that have the same name and
152 * are earlier in the search path. "istemp" is equivalent to a
153 * specification of pg_temp, so no need for anything extra in that case.
155 if (stmt->relation->schemaname == NULL && !stmt->relation->istemp)
157 Oid namespaceid = RangeVarGetCreationNamespace(stmt->relation);
159 stmt->relation->schemaname = get_namespace_name(namespaceid);
163 pstate = make_parsestate(NULL);
164 pstate->p_sourcetext = queryString;
166 cxt.stmtType = "CREATE TABLE";
167 cxt.relation = stmt->relation;
169 cxt.inhRelations = stmt->inhRelations;
172 cxt.ckconstraints = NIL;
173 cxt.fkconstraints = NIL;
174 cxt.ixconstraints = NIL;
175 cxt.inh_indexes = NIL;
179 cxt.hasoids = interpretOidsOption(stmt->options);
182 * Run through each primary element in the table creation clause. Separate
183 * column defs from constraints, and do preliminary analysis.
185 foreach(elements, stmt->tableElts)
187 Node *element = lfirst(elements);
189 switch (nodeTag(element))
192 transformColumnDefinition(pstate, &cxt,
193 (ColumnDef *) element);
197 transformTableConstraint(pstate, &cxt,
198 (Constraint *) element);
202 /* No pre-transformation needed */
203 cxt.fkconstraints = lappend(cxt.fkconstraints, element);
207 transformInhRelation(pstate, &cxt,
208 (InhRelation *) element);
212 elog(ERROR, "unrecognized node type: %d",
213 (int) nodeTag(element));
219 * transformIndexConstraints wants cxt.alist to contain only index
220 * statements, so transfer anything we already have into save_alist.
222 save_alist = cxt.alist;
225 Assert(stmt->constraints == NIL);
228 * Postprocess constraints that give rise to index definitions.
230 transformIndexConstraints(pstate, &cxt);
233 * Postprocess foreign-key constraints.
235 transformFKConstraints(pstate, &cxt, true, false);
240 stmt->tableElts = cxt.columns;
241 stmt->constraints = cxt.ckconstraints;
243 result = lappend(cxt.blist, stmt);
244 result = list_concat(result, cxt.alist);
245 result = list_concat(result, save_alist);
251 * transformColumnDefinition -
252 * transform a single ColumnDef within CREATE TABLE
253 * Also used in ALTER TABLE ADD COLUMN
256 transformColumnDefinition(ParseState *pstate, CreateStmtContext *cxt,
262 Constraint *constraint;
265 cxt->columns = lappend(cxt->columns, column);
267 /* Check for SERIAL pseudo-types */
269 if (list_length(column->typename->names) == 1 &&
270 !column->typename->pct_type)
272 char *typname = strVal(linitial(column->typename->names));
274 if (strcmp(typname, "serial") == 0 ||
275 strcmp(typname, "serial4") == 0)
278 column->typename->names = NIL;
279 column->typename->typeid = INT4OID;
281 else if (strcmp(typname, "bigserial") == 0 ||
282 strcmp(typname, "serial8") == 0)
285 column->typename->names = NIL;
286 column->typename->typeid = INT8OID;
290 * We have to reject "serial[]" explicitly, because once we've
291 * set typeid, LookupTypeName won't notice arrayBounds. We don't
292 * need any special coding for serial(typmod) though.
294 if (is_serial && column->typename->arrayBounds != NIL)
296 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
297 errmsg("array of serial is not implemented")));
300 /* Do necessary work on the column type declaration */
301 transformColumnType(pstate, column);
303 /* Special actions for SERIAL pseudo-types */
312 FuncCall *funccallnode;
313 CreateSeqStmt *seqstmt;
314 AlterSeqStmt *altseqstmt;
318 * Determine namespace and name to use for the sequence.
320 * Although we use ChooseRelationName, it's not guaranteed that the
321 * selected sequence name won't conflict; given sufficiently long
322 * field names, two different serial columns in the same table could
323 * be assigned the same sequence name, and we'd not notice since we
324 * aren't creating the sequence quite yet. In practice this seems
325 * quite unlikely to be a problem, especially since few people would
326 * need two serial columns in one table.
329 snamespaceid = RelationGetNamespace(cxt->rel);
331 snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
332 snamespace = get_namespace_name(snamespaceid);
333 sname = ChooseRelationName(cxt->relation->relname,
339 (errmsg("%s will create implicit sequence \"%s\" for serial column \"%s.%s\"",
340 cxt->stmtType, sname,
341 cxt->relation->relname, column->colname)));
344 * Build a CREATE SEQUENCE command to create the sequence object, and
345 * add it to the list of things to be done before this CREATE/ALTER
348 seqstmt = makeNode(CreateSeqStmt);
349 seqstmt->sequence = makeRangeVar(snamespace, sname, -1);
350 seqstmt->options = NIL;
352 cxt->blist = lappend(cxt->blist, seqstmt);
355 * Build an ALTER SEQUENCE ... OWNED BY command to mark the sequence
356 * as owned by this column, and add it to the list of things to be
357 * done after this CREATE/ALTER TABLE.
359 altseqstmt = makeNode(AlterSeqStmt);
360 altseqstmt->sequence = makeRangeVar(snamespace, sname, -1);
361 attnamelist = list_make3(makeString(snamespace),
362 makeString(cxt->relation->relname),
363 makeString(column->colname));
364 altseqstmt->options = list_make1(makeDefElem("owned_by",
365 (Node *) attnamelist));
367 cxt->alist = lappend(cxt->alist, altseqstmt);
370 * Create appropriate constraints for SERIAL. We do this in full,
371 * rather than shortcutting, so that we will detect any conflicting
372 * constraints the user wrote (like a different DEFAULT).
374 * Create an expression tree representing the function call
375 * nextval('sequencename'). We cannot reduce the raw tree to cooked
376 * form until after the sequence is created, but there's no need to do
379 qstring = quote_qualified_identifier(snamespace, sname);
380 snamenode = makeNode(A_Const);
381 snamenode->val.type = T_String;
382 snamenode->val.val.str = qstring;
383 snamenode->location = -1;
384 castnode = makeNode(TypeCast);
385 castnode->typename = SystemTypeName("regclass");
386 castnode->arg = (Node *) snamenode;
387 castnode->location = -1;
388 funccallnode = makeNode(FuncCall);
389 funccallnode->funcname = SystemFuncName("nextval");
390 funccallnode->args = list_make1(castnode);
391 funccallnode->agg_star = false;
392 funccallnode->agg_distinct = false;
393 funccallnode->func_variadic = false;
394 funccallnode->over = NULL;
395 funccallnode->location = -1;
397 constraint = makeNode(Constraint);
398 constraint->contype = CONSTR_DEFAULT;
399 constraint->raw_expr = (Node *) funccallnode;
400 constraint->cooked_expr = NULL;
401 constraint->keys = NIL;
402 column->constraints = lappend(column->constraints, constraint);
404 constraint = makeNode(Constraint);
405 constraint->contype = CONSTR_NOTNULL;
406 column->constraints = lappend(column->constraints, constraint);
409 /* Process column constraints, if any... */
410 transformConstraintAttrs(column->constraints);
412 saw_nullable = false;
415 foreach(clist, column->constraints)
417 constraint = lfirst(clist);
420 * If this column constraint is a FOREIGN KEY constraint, then we fill
421 * in the current attribute's name and throw it into the list of FK
422 * constraints to be processed later.
424 if (IsA(constraint, FkConstraint))
426 FkConstraint *fkconstraint = (FkConstraint *) constraint;
428 fkconstraint->fk_attrs = list_make1(makeString(column->colname));
429 cxt->fkconstraints = lappend(cxt->fkconstraints, fkconstraint);
433 Assert(IsA(constraint, Constraint));
435 switch (constraint->contype)
438 if (saw_nullable && column->is_not_null)
440 (errcode(ERRCODE_SYNTAX_ERROR),
441 errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
442 column->colname, cxt->relation->relname)));
443 column->is_not_null = FALSE;
448 if (saw_nullable && !column->is_not_null)
450 (errcode(ERRCODE_SYNTAX_ERROR),
451 errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
452 column->colname, cxt->relation->relname)));
453 column->is_not_null = TRUE;
460 (errcode(ERRCODE_SYNTAX_ERROR),
461 errmsg("multiple default values specified for column \"%s\" of table \"%s\"",
462 column->colname, cxt->relation->relname)));
463 column->raw_default = constraint->raw_expr;
464 Assert(constraint->cooked_expr == NULL);
470 if (constraint->keys == NIL)
471 constraint->keys = list_make1(makeString(column->colname));
472 cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
476 cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
479 case CONSTR_ATTR_DEFERRABLE:
480 case CONSTR_ATTR_NOT_DEFERRABLE:
481 case CONSTR_ATTR_DEFERRED:
482 case CONSTR_ATTR_IMMEDIATE:
483 /* transformConstraintAttrs took care of these */
487 elog(ERROR, "unrecognized constraint type: %d",
488 constraint->contype);
495 * transformTableConstraint
496 * transform a Constraint node within CREATE TABLE or ALTER TABLE
499 transformTableConstraint(ParseState *pstate, CreateStmtContext *cxt,
500 Constraint *constraint)
502 switch (constraint->contype)
506 cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
510 cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
516 case CONSTR_ATTR_DEFERRABLE:
517 case CONSTR_ATTR_NOT_DEFERRABLE:
518 case CONSTR_ATTR_DEFERRED:
519 case CONSTR_ATTR_IMMEDIATE:
520 elog(ERROR, "invalid context for constraint type %d",
521 constraint->contype);
525 elog(ERROR, "unrecognized constraint type: %d",
526 constraint->contype);
532 * transformInhRelation
534 * Change the LIKE <subtable> portion of a CREATE TABLE statement into
535 * column definitions which recreate the user defined column portions of
539 transformInhRelation(ParseState *pstate, CreateStmtContext *cxt,
540 InhRelation *inhRelation)
542 AttrNumber parent_attno;
547 bool including_defaults = false;
548 bool including_constraints = false;
549 bool including_indexes = false;
552 relation = parserOpenTable(pstate, inhRelation->relation, AccessShareLock);
554 if (relation->rd_rel->relkind != RELKIND_RELATION)
556 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
557 errmsg("inherited relation \"%s\" is not a table",
558 inhRelation->relation->relname)));
561 * Check for SELECT privilages
563 aclresult = pg_class_aclcheck(RelationGetRelid(relation), GetUserId(),
565 if (aclresult != ACLCHECK_OK)
566 aclcheck_error(aclresult, ACL_KIND_CLASS,
567 RelationGetRelationName(relation));
569 tupleDesc = RelationGetDescr(relation);
570 constr = tupleDesc->constr;
572 foreach(elem, inhRelation->options)
574 int option = lfirst_int(elem);
578 case CREATE_TABLE_LIKE_INCLUDING_DEFAULTS:
579 including_defaults = true;
581 case CREATE_TABLE_LIKE_EXCLUDING_DEFAULTS:
582 including_defaults = false;
584 case CREATE_TABLE_LIKE_INCLUDING_CONSTRAINTS:
585 including_constraints = true;
587 case CREATE_TABLE_LIKE_EXCLUDING_CONSTRAINTS:
588 including_constraints = false;
590 case CREATE_TABLE_LIKE_INCLUDING_INDEXES:
591 including_indexes = true;
593 case CREATE_TABLE_LIKE_EXCLUDING_INDEXES:
594 including_indexes = false;
597 elog(ERROR, "unrecognized CREATE TABLE LIKE option: %d",
603 * Insert the copied attributes into the cxt for the new table definition.
605 for (parent_attno = 1; parent_attno <= tupleDesc->natts;
608 Form_pg_attribute attribute = tupleDesc->attrs[parent_attno - 1];
609 char *attributeName = NameStr(attribute->attname);
613 * Ignore dropped columns in the parent.
615 if (attribute->attisdropped)
619 * Create a new column, which is marked as NOT inherited.
621 * For constraints, ONLY the NOT NULL constraint is inherited by the
622 * new column definition per SQL99.
624 def = makeNode(ColumnDef);
625 def->colname = pstrdup(attributeName);
626 def->typename = makeTypeNameFromOid(attribute->atttypid,
627 attribute->atttypmod);
629 def->is_local = true;
630 def->is_not_null = attribute->attnotnull;
631 def->raw_default = NULL;
632 def->cooked_default = NULL;
633 def->constraints = NIL;
638 cxt->columns = lappend(cxt->columns, def);
641 * Copy default, if present and the default has been requested
643 if (attribute->atthasdef && including_defaults)
645 char *this_default = NULL;
646 AttrDefault *attrdef;
649 /* Find default in constraint structure */
650 Assert(constr != NULL);
651 attrdef = constr->defval;
652 for (i = 0; i < constr->num_defval; i++)
654 if (attrdef[i].adnum == parent_attno)
656 this_default = attrdef[i].adbin;
660 Assert(this_default != NULL);
663 * If default expr could contain any vars, we'd need to fix 'em,
664 * but it can't; so default is ready to apply to child.
667 def->cooked_default = pstrdup(this_default);
672 * Copy CHECK constraints if requested, being careful to adjust attribute
675 if (including_constraints && tupleDesc->constr)
677 AttrNumber *attmap = varattnos_map_schema(tupleDesc, cxt->columns);
680 for (ccnum = 0; ccnum < tupleDesc->constr->num_check; ccnum++)
682 char *ccname = tupleDesc->constr->check[ccnum].ccname;
683 char *ccbin = tupleDesc->constr->check[ccnum].ccbin;
684 Node *ccbin_node = stringToNode(ccbin);
685 Constraint *n = makeNode(Constraint);
687 change_varattnos_of_a_node(ccbin_node, attmap);
689 n->contype = CONSTR_CHECK;
690 n->name = pstrdup(ccname);
692 n->cooked_expr = nodeToString(ccbin_node);
693 n->indexspace = NULL;
694 cxt->ckconstraints = lappend(cxt->ckconstraints, (Node *) n);
699 * Likewise, copy indexes if requested
701 if (including_indexes && relation->rd_rel->relhasindex)
703 AttrNumber *attmap = varattnos_map_schema(tupleDesc, cxt->columns);
704 List *parent_indexes;
707 parent_indexes = RelationGetIndexList(relation);
709 foreach(l, parent_indexes)
711 Oid parent_index_oid = lfirst_oid(l);
712 Relation parent_index;
713 IndexStmt *index_stmt;
715 parent_index = index_open(parent_index_oid, AccessShareLock);
717 /* Build CREATE INDEX statement to recreate the parent_index */
718 index_stmt = generateClonedIndexStmt(cxt, parent_index, attmap);
720 /* Save it in the inh_indexes list for the time being */
721 cxt->inh_indexes = lappend(cxt->inh_indexes, index_stmt);
723 index_close(parent_index, AccessShareLock);
728 * Close the parent rel, but keep our AccessShareLock on it until xact
729 * commit. That will prevent someone else from deleting or ALTERing the
730 * parent before the child is committed.
732 heap_close(relation, NoLock);
736 * Generate an IndexStmt node using information from an already existing index
737 * "source_idx". Attribute numbers should be adjusted according to attmap.
740 generateClonedIndexStmt(CreateStmtContext *cxt, Relation source_idx,
743 Oid source_relid = RelationGetRelid(source_idx);
746 Form_pg_class idxrelrec;
747 Form_pg_index idxrec;
752 ListCell *indexpr_item;
760 * Fetch pg_class tuple of source index. We can't use the copy in the
761 * relcache entry because it doesn't include optional fields.
763 ht_idxrel = SearchSysCache(RELOID,
764 ObjectIdGetDatum(source_relid),
766 if (!HeapTupleIsValid(ht_idxrel))
767 elog(ERROR, "cache lookup failed for relation %u", source_relid);
768 idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
770 /* Fetch pg_index tuple for source index from relcache entry */
771 ht_idx = source_idx->rd_indextuple;
772 idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
773 indrelid = idxrec->indrelid;
775 /* Fetch pg_am tuple for source index from relcache entry */
776 amrec = source_idx->rd_am;
778 /* Must get indclass the hard way, since it's not stored in relcache */
779 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
780 Anum_pg_index_indclass, &isnull);
782 indclass = (oidvector *) DatumGetPointer(datum);
784 /* Begin building the IndexStmt */
785 index = makeNode(IndexStmt);
786 index->relation = cxt->relation;
787 index->accessMethod = pstrdup(NameStr(amrec->amname));
788 if (OidIsValid(idxrelrec->reltablespace))
789 index->tableSpace = get_tablespace_name(idxrelrec->reltablespace);
791 index->tableSpace = NULL;
792 index->unique = idxrec->indisunique;
793 index->primary = idxrec->indisprimary;
794 index->concurrent = false;
797 * We don't try to preserve the name of the source index; instead, just
798 * let DefineIndex() choose a reasonable name.
800 index->idxname = NULL;
803 * If the index is marked PRIMARY, it's certainly from a constraint;
804 * else, if it's not marked UNIQUE, it certainly isn't; else, we have
805 * to search pg_depend to see if there's an associated unique constraint.
808 index->isconstraint = true;
809 else if (!index->unique)
810 index->isconstraint = false;
812 index->isconstraint = OidIsValid(get_index_constraint(source_relid));
814 /* Get the index expressions, if any */
815 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
816 Anum_pg_index_indexprs, &isnull);
821 exprsString = TextDatumGetCString(datum);
822 indexprs = (List *) stringToNode(exprsString);
827 /* Build the list of IndexElem */
828 index->indexParams = NIL;
830 indexpr_item = list_head(indexprs);
831 for (keyno = 0; keyno < idxrec->indnatts; keyno++)
834 AttrNumber attnum = idxrec->indkey.values[keyno];
835 int16 opt = source_idx->rd_indoption[keyno];
837 iparam = makeNode(IndexElem);
839 if (AttributeNumberIsValid(attnum))
841 /* Simple index column */
844 attname = get_relid_attribute_name(indrelid, attnum);
845 keycoltype = get_atttype(indrelid, attnum);
847 iparam->name = attname;
852 /* Expressional index */
855 if (indexpr_item == NULL)
856 elog(ERROR, "too few entries in indexprs list");
857 indexkey = (Node *) lfirst(indexpr_item);
858 indexpr_item = lnext(indexpr_item);
860 /* OK to modify indexkey since we are working on a private copy */
861 change_varattnos_of_a_node(indexkey, attmap);
864 iparam->expr = indexkey;
866 keycoltype = exprType(indexkey);
869 /* Add the operator class name, if non-default */
870 iparam->opclass = get_opclass(indclass->values[keyno], keycoltype);
872 iparam->ordering = SORTBY_DEFAULT;
873 iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
875 /* Adjust options if necessary */
876 if (amrec->amcanorder)
879 * If it supports sort ordering, copy DESC and NULLS opts.
880 * Don't set non-default settings unnecessarily, though,
881 * so as to improve the chance of recognizing equivalence
882 * to constraint indexes.
884 if (opt & INDOPTION_DESC)
886 iparam->ordering = SORTBY_DESC;
887 if ((opt & INDOPTION_NULLS_FIRST) == 0)
888 iparam->nulls_ordering = SORTBY_NULLS_LAST;
892 if (opt & INDOPTION_NULLS_FIRST)
893 iparam->nulls_ordering = SORTBY_NULLS_FIRST;
897 index->indexParams = lappend(index->indexParams, iparam);
900 /* Copy reloptions if any */
901 datum = SysCacheGetAttr(RELOID, ht_idxrel,
902 Anum_pg_class_reloptions, &isnull);
904 index->options = untransformRelOptions(datum);
906 /* If it's a partial index, decompile and append the predicate */
907 datum = SysCacheGetAttr(INDEXRELID, ht_idx,
908 Anum_pg_index_indpred, &isnull);
913 /* Convert text string to node tree */
914 pred_str = TextDatumGetCString(datum);
915 index->whereClause = (Node *) stringToNode(pred_str);
916 /* Adjust attribute numbers */
917 change_varattnos_of_a_node(index->whereClause, attmap);
921 ReleaseSysCache(ht_idxrel);
927 * get_opclass - fetch name of an index operator class
929 * If the opclass is the default for the given actual_datatype, then
930 * the return value is NIL.
933 get_opclass(Oid opclass, Oid actual_datatype)
936 Form_pg_opclass opc_rec;
939 ht_opc = SearchSysCache(CLAOID,
940 ObjectIdGetDatum(opclass),
942 if (!HeapTupleIsValid(ht_opc))
943 elog(ERROR, "cache lookup failed for opclass %u", opclass);
944 opc_rec = (Form_pg_opclass) GETSTRUCT(ht_opc);
946 if (GetDefaultOpClass(actual_datatype, opc_rec->opcmethod) != opclass)
948 /* For simplicity, we always schema-qualify the name */
949 char *nsp_name = get_namespace_name(opc_rec->opcnamespace);
950 char *opc_name = pstrdup(NameStr(opc_rec->opcname));
952 result = list_make2(makeString(nsp_name), makeString(opc_name));
955 ReleaseSysCache(ht_opc);
961 * transformIndexConstraints
962 * Handle UNIQUE and PRIMARY KEY constraints, which create indexes.
963 * We also merge in any index definitions arising from
964 * LIKE ... INCLUDING INDEXES.
967 transformIndexConstraints(ParseState *pstate, CreateStmtContext *cxt)
970 List *indexlist = NIL;
974 * Run through the constraints that need to generate an index. For PRIMARY
975 * KEY, mark each column as NOT NULL and create an index. For UNIQUE,
976 * create an index as for PRIMARY KEY, but do not insist on NOT NULL.
978 foreach(lc, cxt->ixconstraints)
980 Constraint *constraint = (Constraint *) lfirst(lc);
982 Assert(IsA(constraint, Constraint));
983 Assert(constraint->contype == CONSTR_PRIMARY ||
984 constraint->contype == CONSTR_UNIQUE);
986 index = transformIndexConstraint(constraint, cxt);
988 indexlist = lappend(indexlist, index);
991 /* Add in any indexes defined by LIKE ... INCLUDING INDEXES */
992 foreach(lc, cxt->inh_indexes)
994 index = (IndexStmt *) lfirst(lc);
998 if (cxt->pkey != NULL)
1000 (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1001 errmsg("multiple primary keys for table \"%s\" are not allowed",
1002 cxt->relation->relname)));
1006 indexlist = lappend(indexlist, index);
1010 * Scan the index list and remove any redundant index specifications. This
1011 * can happen if, for instance, the user writes UNIQUE PRIMARY KEY. A
1012 * strict reading of SQL92 would suggest raising an error instead, but
1013 * that strikes me as too anal-retentive. - tgl 2001-02-14
1015 * XXX in ALTER TABLE case, it'd be nice to look for duplicate
1016 * pre-existing indexes, too.
1018 Assert(cxt->alist == NIL);
1019 if (cxt->pkey != NULL)
1021 /* Make sure we keep the PKEY index in preference to others... */
1022 cxt->alist = list_make1(cxt->pkey);
1025 foreach(lc, indexlist)
1032 /* if it's pkey, it's already in cxt->alist */
1033 if (index == cxt->pkey)
1036 foreach(k, cxt->alist)
1038 IndexStmt *priorindex = lfirst(k);
1040 if (equal(index->indexParams, priorindex->indexParams) &&
1041 equal(index->whereClause, priorindex->whereClause) &&
1042 strcmp(index->accessMethod, priorindex->accessMethod) == 0)
1044 priorindex->unique |= index->unique;
1046 * If the prior index is as yet unnamed, and this one is
1047 * named, then transfer the name to the prior index. This
1048 * ensures that if we have named and unnamed constraints,
1049 * we'll use (at least one of) the names for the index.
1051 if (priorindex->idxname == NULL)
1052 priorindex->idxname = index->idxname;
1059 cxt->alist = lappend(cxt->alist, index);
1064 * transformIndexConstraint
1065 * Transform one UNIQUE or PRIMARY KEY constraint for
1066 * transformIndexConstraints.
1069 transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
1075 index = makeNode(IndexStmt);
1077 index->unique = true;
1078 index->primary = (constraint->contype == CONSTR_PRIMARY);
1081 if (cxt->pkey != NULL)
1083 (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1084 errmsg("multiple primary keys for table \"%s\" are not allowed",
1085 cxt->relation->relname)));
1089 * In ALTER TABLE case, a primary index might already exist, but
1090 * DefineIndex will check for it.
1093 index->isconstraint = true;
1095 if (constraint->name != NULL)
1096 index->idxname = pstrdup(constraint->name);
1098 index->idxname = NULL; /* DefineIndex will choose name */
1100 index->relation = cxt->relation;
1101 index->accessMethod = DEFAULT_INDEX_TYPE;
1102 index->options = constraint->options;
1103 index->tableSpace = constraint->indexspace;
1104 index->indexParams = NIL;
1105 index->whereClause = NULL;
1106 index->concurrent = false;
1109 * Make sure referenced keys exist. If we are making a PRIMARY KEY index,
1110 * also make sure they are NOT NULL, if possible. (Although we could leave
1111 * it to DefineIndex to mark the columns NOT NULL, it's more efficient to
1112 * get it right the first time.)
1114 foreach(keys, constraint->keys)
1116 char *key = strVal(lfirst(keys));
1118 ColumnDef *column = NULL;
1121 foreach(columns, cxt->columns)
1123 column = (ColumnDef *) lfirst(columns);
1124 Assert(IsA(column, ColumnDef));
1125 if (strcmp(column->colname, key) == 0)
1133 /* found column in the new table; force it to be NOT NULL */
1134 if (constraint->contype == CONSTR_PRIMARY)
1135 column->is_not_null = TRUE;
1137 else if (SystemAttributeByName(key, cxt->hasoids) != NULL)
1140 * column will be a system column in the new table, so accept it.
1141 * System columns can't ever be null, so no need to worry about
1142 * PRIMARY/NOT NULL constraint.
1146 else if (cxt->inhRelations)
1148 /* try inherited tables */
1151 foreach(inher, cxt->inhRelations)
1153 RangeVar *inh = (RangeVar *) lfirst(inher);
1157 Assert(IsA(inh, RangeVar));
1158 rel = heap_openrv(inh, AccessShareLock);
1159 if (rel->rd_rel->relkind != RELKIND_RELATION)
1161 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1162 errmsg("inherited relation \"%s\" is not a table",
1164 for (count = 0; count < rel->rd_att->natts; count++)
1166 Form_pg_attribute inhattr = rel->rd_att->attrs[count];
1167 char *inhname = NameStr(inhattr->attname);
1169 if (inhattr->attisdropped)
1171 if (strcmp(key, inhname) == 0)
1176 * We currently have no easy way to force an inherited
1177 * column to be NOT NULL at creation, if its parent
1178 * wasn't so already. We leave it to DefineIndex to
1179 * fix things up in this case.
1184 heap_close(rel, NoLock);
1191 * In the ALTER TABLE case, don't complain about index keys not
1192 * created in the command; they may well exist already. DefineIndex
1193 * will complain about them if not, and will also take care of marking
1196 if (!found && !cxt->isalter)
1198 (errcode(ERRCODE_UNDEFINED_COLUMN),
1199 errmsg("column \"%s\" named in key does not exist",
1202 /* Check for PRIMARY KEY(foo, foo) */
1203 foreach(columns, index->indexParams)
1205 iparam = (IndexElem *) lfirst(columns);
1206 if (iparam->name && strcmp(key, iparam->name) == 0)
1210 (errcode(ERRCODE_DUPLICATE_COLUMN),
1211 errmsg("column \"%s\" appears twice in primary key constraint",
1215 (errcode(ERRCODE_DUPLICATE_COLUMN),
1216 errmsg("column \"%s\" appears twice in unique constraint",
1221 /* OK, add it to the index definition */
1222 iparam = makeNode(IndexElem);
1223 iparam->name = pstrdup(key);
1224 iparam->expr = NULL;
1225 iparam->opclass = NIL;
1226 iparam->ordering = SORTBY_DEFAULT;
1227 iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1228 index->indexParams = lappend(index->indexParams, iparam);
1235 * transformFKConstraints
1236 * handle FOREIGN KEY constraints
1239 transformFKConstraints(ParseState *pstate, CreateStmtContext *cxt,
1240 bool skipValidation, bool isAddConstraint)
1244 if (cxt->fkconstraints == NIL)
1248 * If CREATE TABLE or adding a column with NULL default, we can safely
1249 * skip validation of the constraint.
1253 foreach(fkclist, cxt->fkconstraints)
1255 FkConstraint *fkconstraint = (FkConstraint *) lfirst(fkclist);
1257 fkconstraint->skip_validation = true;
1262 * For CREATE TABLE or ALTER TABLE ADD COLUMN, gin up an ALTER TABLE ADD
1263 * CONSTRAINT command to execute after the basic command is complete. (If
1264 * called from ADD CONSTRAINT, that routine will add the FK constraints to
1265 * its own subcommand list.)
1267 * Note: the ADD CONSTRAINT command must also execute after any index
1268 * creation commands. Thus, this should run after
1269 * transformIndexConstraints, so that the CREATE INDEX commands are
1270 * already in cxt->alist.
1272 if (!isAddConstraint)
1274 AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
1276 alterstmt->relation = cxt->relation;
1277 alterstmt->cmds = NIL;
1278 alterstmt->relkind = OBJECT_TABLE;
1280 foreach(fkclist, cxt->fkconstraints)
1282 FkConstraint *fkconstraint = (FkConstraint *) lfirst(fkclist);
1283 AlterTableCmd *altercmd = makeNode(AlterTableCmd);
1285 altercmd->subtype = AT_ProcessedConstraint;
1286 altercmd->name = NULL;
1287 altercmd->def = (Node *) fkconstraint;
1288 alterstmt->cmds = lappend(alterstmt->cmds, altercmd);
1291 cxt->alist = lappend(cxt->alist, alterstmt);
1296 * transformIndexStmt - parse analysis for CREATE INDEX
1298 * Note: this is a no-op for an index not using either index expressions or
1299 * a predicate expression. There are several code paths that create indexes
1300 * without bothering to call this, because they know they don't have any
1301 * such expressions to deal with.
1304 transformIndexStmt(IndexStmt *stmt, const char *queryString)
1312 * We must not scribble on the passed-in IndexStmt, so copy it. (This is
1313 * overkill, but easy.)
1315 stmt = (IndexStmt *) copyObject(stmt);
1318 * Open the parent table with appropriate locking. We must do this
1319 * because addRangeTableEntry() would acquire only AccessShareLock,
1320 * leaving DefineIndex() needing to do a lock upgrade with consequent risk
1321 * of deadlock. Make sure this stays in sync with the type of lock
1322 * DefineIndex() wants.
1324 rel = heap_openrv(stmt->relation,
1325 (stmt->concurrent ? ShareUpdateExclusiveLock : ShareLock));
1328 pstate = make_parsestate(NULL);
1329 pstate->p_sourcetext = queryString;
1332 * Put the parent table into the rtable so that the expressions can refer
1333 * to its fields without qualification.
1335 rte = addRangeTableEntry(pstate, stmt->relation, NULL, false, true);
1337 /* no to join list, yes to namespaces */
1338 addRTEtoQuery(pstate, rte, false, true, true);
1340 /* take care of the where clause */
1341 if (stmt->whereClause)
1342 stmt->whereClause = transformWhereClause(pstate,
1346 /* take care of any index expressions */
1347 foreach(l, stmt->indexParams)
1349 IndexElem *ielem = (IndexElem *) lfirst(l);
1353 ielem->expr = transformExpr(pstate, ielem->expr);
1356 * We check only that the result type is legitimate; this is for
1357 * consistency with what transformWhereClause() checks for the
1358 * predicate. DefineIndex() will make more checks.
1360 if (expression_returns_set(ielem->expr))
1362 (errcode(ERRCODE_DATATYPE_MISMATCH),
1363 errmsg("index expression cannot return a set")));
1368 * Check that only the base rel is mentioned.
1370 if (list_length(pstate->p_rtable) != 1)
1372 (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1373 errmsg("index expressions and predicates can refer only to the table being indexed")));
1375 free_parsestate(pstate);
1377 /* Close relation, but keep the lock */
1378 heap_close(rel, NoLock);
1385 * transformRuleStmt -
1386 * transform a CREATE RULE Statement. The action is a list of parse
1387 * trees which is transformed into a list of query trees, and we also
1388 * transform the WHERE clause if any.
1390 * actions and whereClause are output parameters that receive the
1391 * transformed results.
1393 * Note that we must not scribble on the passed-in RuleStmt, so we do
1394 * copyObject() on the actions and WHERE clause.
1397 transformRuleStmt(RuleStmt *stmt, const char *queryString,
1398 List **actions, Node **whereClause)
1402 RangeTblEntry *oldrte;
1403 RangeTblEntry *newrte;
1406 * To avoid deadlock, make sure the first thing we do is grab
1407 * AccessExclusiveLock on the target relation. This will be needed by
1408 * DefineQueryRewrite(), and we don't want to grab a lesser lock
1411 rel = heap_openrv(stmt->relation, AccessExclusiveLock);
1414 pstate = make_parsestate(NULL);
1415 pstate->p_sourcetext = queryString;
1418 * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
1419 * Set up their RTEs in the main pstate for use in parsing the rule
1422 oldrte = addRangeTableEntryForRelation(pstate, rel,
1423 makeAlias("*OLD*", NIL),
1425 newrte = addRangeTableEntryForRelation(pstate, rel,
1426 makeAlias("*NEW*", NIL),
1428 /* Must override addRangeTableEntry's default access-check flags */
1429 oldrte->requiredPerms = 0;
1430 newrte->requiredPerms = 0;
1433 * They must be in the namespace too for lookup purposes, but only add the
1434 * one(s) that are relevant for the current kind of rule. In an UPDATE
1435 * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
1436 * there's no need to be so picky for INSERT & DELETE. We do not add them
1439 switch (stmt->event)
1442 addRTEtoQuery(pstate, oldrte, false, true, true);
1445 addRTEtoQuery(pstate, oldrte, false, true, true);
1446 addRTEtoQuery(pstate, newrte, false, true, true);
1449 addRTEtoQuery(pstate, newrte, false, true, true);
1452 addRTEtoQuery(pstate, oldrte, false, true, true);
1455 elog(ERROR, "unrecognized event type: %d",
1460 /* take care of the where clause */
1461 *whereClause = transformWhereClause(pstate,
1462 (Node *) copyObject(stmt->whereClause),
1465 if (list_length(pstate->p_rtable) != 2) /* naughty, naughty... */
1467 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1468 errmsg("rule WHERE condition cannot contain references to other relations")));
1470 /* aggregates not allowed (but subselects are okay) */
1471 if (pstate->p_hasAggs)
1473 (errcode(ERRCODE_GROUPING_ERROR),
1474 errmsg("cannot use aggregate function in rule WHERE condition")));
1475 if (pstate->p_hasWindowFuncs)
1477 (errcode(ERRCODE_WINDOWING_ERROR),
1478 errmsg("cannot use window function in rule WHERE condition")));
1481 * 'instead nothing' rules with a qualification need a query rangetable so
1482 * the rewrite handler can add the negated rule qualification to the
1483 * original query. We create a query with the new command type CMD_NOTHING
1484 * here that is treated specially by the rewrite system.
1486 if (stmt->actions == NIL)
1488 Query *nothing_qry = makeNode(Query);
1490 nothing_qry->commandType = CMD_NOTHING;
1491 nothing_qry->rtable = pstate->p_rtable;
1492 nothing_qry->jointree = makeFromExpr(NIL, NULL); /* no join wanted */
1494 *actions = list_make1(nothing_qry);
1499 List *newactions = NIL;
1502 * transform each statement, like parse_sub_analyze()
1504 foreach(l, stmt->actions)
1506 Node *action = (Node *) lfirst(l);
1507 ParseState *sub_pstate = make_parsestate(NULL);
1514 * Since outer ParseState isn't parent of inner, have to pass down
1515 * the query text by hand.
1517 sub_pstate->p_sourcetext = queryString;
1520 * Set up OLD/NEW in the rtable for this statement. The entries
1521 * are added only to relnamespace, not varnamespace, because we
1522 * don't want them to be referred to by unqualified field names
1523 * nor "*" in the rule actions. We decide later whether to put
1524 * them in the joinlist.
1526 oldrte = addRangeTableEntryForRelation(sub_pstate, rel,
1527 makeAlias("*OLD*", NIL),
1529 newrte = addRangeTableEntryForRelation(sub_pstate, rel,
1530 makeAlias("*NEW*", NIL),
1532 oldrte->requiredPerms = 0;
1533 newrte->requiredPerms = 0;
1534 addRTEtoQuery(sub_pstate, oldrte, false, true, false);
1535 addRTEtoQuery(sub_pstate, newrte, false, true, false);
1537 /* Transform the rule action statement */
1538 top_subqry = transformStmt(sub_pstate,
1539 (Node *) copyObject(action));
1542 * We cannot support utility-statement actions (eg NOTIFY) with
1543 * nonempty rule WHERE conditions, because there's no way to make
1544 * the utility action execute conditionally.
1546 if (top_subqry->commandType == CMD_UTILITY &&
1547 *whereClause != NULL)
1549 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1550 errmsg("rules with WHERE conditions can only have SELECT, INSERT, UPDATE, or DELETE actions")));
1553 * If the action is INSERT...SELECT, OLD/NEW have been pushed down
1554 * into the SELECT, and that's what we need to look at. (Ugly
1555 * kluge ... try to fix this when we redesign querytrees.)
1557 sub_qry = getInsertSelectQuery(top_subqry, NULL);
1560 * If the sub_qry is a setop, we cannot attach any qualifications
1561 * to it, because the planner won't notice them. This could
1562 * perhaps be relaxed someday, but for now, we may as well reject
1563 * such a rule immediately.
1565 if (sub_qry->setOperations != NULL && *whereClause != NULL)
1567 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1568 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
1571 * Validate action's use of OLD/NEW, qual too
1574 rangeTableEntry_used((Node *) sub_qry, PRS2_OLD_VARNO, 0) ||
1575 rangeTableEntry_used(*whereClause, PRS2_OLD_VARNO, 0);
1577 rangeTableEntry_used((Node *) sub_qry, PRS2_NEW_VARNO, 0) ||
1578 rangeTableEntry_used(*whereClause, PRS2_NEW_VARNO, 0);
1580 switch (stmt->event)
1585 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1586 errmsg("ON SELECT rule cannot use OLD")));
1589 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1590 errmsg("ON SELECT rule cannot use NEW")));
1598 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1599 errmsg("ON INSERT rule cannot use OLD")));
1604 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1605 errmsg("ON DELETE rule cannot use NEW")));
1608 elog(ERROR, "unrecognized event type: %d",
1614 * For efficiency's sake, add OLD to the rule action's jointree
1615 * only if it was actually referenced in the statement or qual.
1617 * For INSERT, NEW is not really a relation (only a reference to
1618 * the to-be-inserted tuple) and should never be added to the
1621 * For UPDATE, we treat NEW as being another kind of reference to
1622 * OLD, because it represents references to *transformed* tuples
1623 * of the existing relation. It would be wrong to enter NEW
1624 * separately in the jointree, since that would cause a double
1625 * join of the updated relation. It's also wrong to fail to make
1626 * a jointree entry if only NEW and not OLD is mentioned.
1628 if (has_old || (has_new && stmt->event == CMD_UPDATE))
1631 * If sub_qry is a setop, manipulating its jointree will do no
1632 * good at all, because the jointree is dummy. (This should be
1633 * a can't-happen case because of prior tests.)
1635 if (sub_qry->setOperations != NULL)
1637 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1638 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
1639 /* hack so we can use addRTEtoQuery() */
1640 sub_pstate->p_rtable = sub_qry->rtable;
1641 sub_pstate->p_joinlist = sub_qry->jointree->fromlist;
1642 addRTEtoQuery(sub_pstate, oldrte, true, false, false);
1643 sub_qry->jointree->fromlist = sub_pstate->p_joinlist;
1646 newactions = lappend(newactions, top_subqry);
1648 free_parsestate(sub_pstate);
1651 *actions = newactions;
1654 free_parsestate(pstate);
1656 /* Close relation, but keep the exclusive lock */
1657 heap_close(rel, NoLock);
1662 * transformAlterTableStmt -
1663 * parse analysis for ALTER TABLE
1665 * Returns a List of utility commands to be done in sequence. One of these
1666 * will be the transformed AlterTableStmt, but there may be additional actions
1667 * to be done before and after the actual AlterTable() call.
1670 transformAlterTableStmt(AlterTableStmt *stmt, const char *queryString)
1674 CreateStmtContext cxt;
1679 List *newcmds = NIL;
1680 bool skipValidation = true;
1681 AlterTableCmd *newcmd;
1684 * We must not scribble on the passed-in AlterTableStmt, so copy it. (This
1685 * is overkill, but easy.)
1687 stmt = (AlterTableStmt *) copyObject(stmt);
1690 * Acquire exclusive lock on the target relation, which will be held until
1691 * end of transaction. This ensures any decisions we make here based on
1692 * the state of the relation will still be good at execution. We must get
1693 * exclusive lock now because execution will; taking a lower grade lock
1694 * now and trying to upgrade later risks deadlock.
1696 rel = relation_openrv(stmt->relation, AccessExclusiveLock);
1699 pstate = make_parsestate(NULL);
1700 pstate->p_sourcetext = queryString;
1702 cxt.stmtType = "ALTER TABLE";
1703 cxt.relation = stmt->relation;
1705 cxt.inhRelations = NIL;
1707 cxt.hasoids = false; /* need not be right */
1709 cxt.ckconstraints = NIL;
1710 cxt.fkconstraints = NIL;
1711 cxt.ixconstraints = NIL;
1712 cxt.inh_indexes = NIL;
1718 * The only subtypes that currently require parse transformation handling
1719 * are ADD COLUMN and ADD CONSTRAINT. These largely re-use code from
1722 foreach(lcmd, stmt->cmds)
1724 AlterTableCmd *cmd = (AlterTableCmd *) lfirst(lcmd);
1726 switch (cmd->subtype)
1729 case AT_AddColumnToView:
1731 ColumnDef *def = (ColumnDef *) cmd->def;
1733 Assert(IsA(def, ColumnDef));
1734 transformColumnDefinition(pstate, &cxt, def);
1737 * If the column has a non-null default, we can't skip
1738 * validation of foreign keys.
1740 if (def->raw_default != NULL)
1741 skipValidation = false;
1744 * All constraints are processed in other ways. Remove the
1747 def->constraints = NIL;
1749 newcmds = lappend(newcmds, cmd);
1752 case AT_AddConstraint:
1755 * The original AddConstraint cmd node doesn't go to newcmds
1757 if (IsA(cmd->def, Constraint))
1758 transformTableConstraint(pstate, &cxt,
1759 (Constraint *) cmd->def);
1760 else if (IsA(cmd->def, FkConstraint))
1762 cxt.fkconstraints = lappend(cxt.fkconstraints, cmd->def);
1763 skipValidation = false;
1766 elog(ERROR, "unrecognized node type: %d",
1767 (int) nodeTag(cmd->def));
1770 case AT_ProcessedConstraint:
1773 * Already-transformed ADD CONSTRAINT, so just make it look
1774 * like the standard case.
1776 cmd->subtype = AT_AddConstraint;
1777 newcmds = lappend(newcmds, cmd);
1781 newcmds = lappend(newcmds, cmd);
1787 * transformIndexConstraints wants cxt.alist to contain only index
1788 * statements, so transfer anything we already have into save_alist
1791 save_alist = cxt.alist;
1794 /* Postprocess index and FK constraints */
1795 transformIndexConstraints(pstate, &cxt);
1797 transformFKConstraints(pstate, &cxt, skipValidation, true);
1800 * Push any index-creation commands into the ALTER, so that they can be
1801 * scheduled nicely by tablecmds.c. Note that tablecmds.c assumes that
1802 * the IndexStmt attached to an AT_AddIndex subcommand has already been
1803 * through transformIndexStmt.
1805 foreach(l, cxt.alist)
1807 Node *idxstmt = (Node *) lfirst(l);
1809 Assert(IsA(idxstmt, IndexStmt));
1810 newcmd = makeNode(AlterTableCmd);
1811 newcmd->subtype = AT_AddIndex;
1812 newcmd->def = (Node *) transformIndexStmt((IndexStmt *) idxstmt,
1814 newcmds = lappend(newcmds, newcmd);
1818 /* Append any CHECK or FK constraints to the commands list */
1819 foreach(l, cxt.ckconstraints)
1821 newcmd = makeNode(AlterTableCmd);
1822 newcmd->subtype = AT_AddConstraint;
1823 newcmd->def = (Node *) lfirst(l);
1824 newcmds = lappend(newcmds, newcmd);
1826 foreach(l, cxt.fkconstraints)
1828 newcmd = makeNode(AlterTableCmd);
1829 newcmd->subtype = AT_AddConstraint;
1830 newcmd->def = (Node *) lfirst(l);
1831 newcmds = lappend(newcmds, newcmd);
1834 /* Close rel but keep lock */
1835 relation_close(rel, NoLock);
1840 stmt->cmds = newcmds;
1842 result = lappend(cxt.blist, stmt);
1843 result = list_concat(result, cxt.alist);
1844 result = list_concat(result, save_alist);
1851 * Preprocess a list of column constraint clauses
1852 * to attach constraint attributes to their primary constraint nodes
1853 * and detect inconsistent/misplaced constraint attributes.
1855 * NOTE: currently, attributes are only supported for FOREIGN KEY primary
1856 * constraints, but someday they ought to be supported for other constraints.
1859 transformConstraintAttrs(List *constraintList)
1861 Node *lastprimarynode = NULL;
1862 bool saw_deferrability = false;
1863 bool saw_initially = false;
1866 foreach(clist, constraintList)
1868 Node *node = lfirst(clist);
1870 if (!IsA(node, Constraint))
1872 lastprimarynode = node;
1873 /* reset flags for new primary node */
1874 saw_deferrability = false;
1875 saw_initially = false;
1879 Constraint *con = (Constraint *) node;
1881 switch (con->contype)
1883 case CONSTR_ATTR_DEFERRABLE:
1884 if (lastprimarynode == NULL ||
1885 !IsA(lastprimarynode, FkConstraint))
1887 (errcode(ERRCODE_SYNTAX_ERROR),
1888 errmsg("misplaced DEFERRABLE clause")));
1889 if (saw_deferrability)
1891 (errcode(ERRCODE_SYNTAX_ERROR),
1892 errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed")));
1893 saw_deferrability = true;
1894 ((FkConstraint *) lastprimarynode)->deferrable = true;
1896 case CONSTR_ATTR_NOT_DEFERRABLE:
1897 if (lastprimarynode == NULL ||
1898 !IsA(lastprimarynode, FkConstraint))
1900 (errcode(ERRCODE_SYNTAX_ERROR),
1901 errmsg("misplaced NOT DEFERRABLE clause")));
1902 if (saw_deferrability)
1904 (errcode(ERRCODE_SYNTAX_ERROR),
1905 errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed")));
1906 saw_deferrability = true;
1907 ((FkConstraint *) lastprimarynode)->deferrable = false;
1908 if (saw_initially &&
1909 ((FkConstraint *) lastprimarynode)->initdeferred)
1911 (errcode(ERRCODE_SYNTAX_ERROR),
1912 errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE")));
1914 case CONSTR_ATTR_DEFERRED:
1915 if (lastprimarynode == NULL ||
1916 !IsA(lastprimarynode, FkConstraint))
1918 (errcode(ERRCODE_SYNTAX_ERROR),
1919 errmsg("misplaced INITIALLY DEFERRED clause")));
1922 (errcode(ERRCODE_SYNTAX_ERROR),
1923 errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed")));
1924 saw_initially = true;
1925 ((FkConstraint *) lastprimarynode)->initdeferred = true;
1928 * If only INITIALLY DEFERRED appears, assume DEFERRABLE
1930 if (!saw_deferrability)
1931 ((FkConstraint *) lastprimarynode)->deferrable = true;
1932 else if (!((FkConstraint *) lastprimarynode)->deferrable)
1934 (errcode(ERRCODE_SYNTAX_ERROR),
1935 errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE")));
1937 case CONSTR_ATTR_IMMEDIATE:
1938 if (lastprimarynode == NULL ||
1939 !IsA(lastprimarynode, FkConstraint))
1941 (errcode(ERRCODE_SYNTAX_ERROR),
1942 errmsg("misplaced INITIALLY IMMEDIATE clause")));
1945 (errcode(ERRCODE_SYNTAX_ERROR),
1946 errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed")));
1947 saw_initially = true;
1948 ((FkConstraint *) lastprimarynode)->initdeferred = false;
1951 /* Otherwise it's not an attribute */
1952 lastprimarynode = node;
1953 /* reset flags for new primary node */
1954 saw_deferrability = false;
1955 saw_initially = false;
1963 * Special handling of type definition for a column
1966 transformColumnType(ParseState *pstate, ColumnDef *column)
1969 * All we really need to do here is verify that the type is valid.
1971 Type ctype = typenameType(pstate, column->typename, NULL);
1973 ReleaseSysCache(ctype);
1978 * transformCreateSchemaStmt -
1979 * analyzes the CREATE SCHEMA statement
1981 * Split the schema element list into individual commands and place
1982 * them in the result list in an order such that there are no forward
1983 * references (e.g. GRANT to a table created later in the list). Note
1984 * that the logic we use for determining forward references is
1985 * presently quite incomplete.
1987 * SQL92 also allows constraints to make forward references, so thumb through
1988 * the table columns and move forward references to a posterior alter-table
1991 * The result is a list of parse nodes that still need to be analyzed ---
1992 * but we can't analyze the later commands until we've executed the earlier
1993 * ones, because of possible inter-object references.
1995 * Note: this breaks the rules a little bit by modifying schema-name fields
1996 * within passed-in structs. However, the transformation would be the same
1997 * if done over, so it should be all right to scribble on the input to this
2001 transformCreateSchemaStmt(CreateSchemaStmt *stmt)
2003 CreateSchemaStmtContext cxt;
2007 cxt.stmtType = "CREATE SCHEMA";
2008 cxt.schemaname = stmt->schemaname;
2009 cxt.authid = stmt->authid;
2010 cxt.sequences = NIL;
2018 * Run through each schema element in the schema element list. Separate
2019 * statements by type, and do preliminary analysis.
2021 foreach(elements, stmt->schemaElts)
2023 Node *element = lfirst(elements);
2025 switch (nodeTag(element))
2027 case T_CreateSeqStmt:
2029 CreateSeqStmt *elp = (CreateSeqStmt *) element;
2031 setSchemaName(cxt.schemaname, &elp->sequence->schemaname);
2032 cxt.sequences = lappend(cxt.sequences, element);
2038 CreateStmt *elp = (CreateStmt *) element;
2040 setSchemaName(cxt.schemaname, &elp->relation->schemaname);
2043 * XXX todo: deal with constraints
2045 cxt.tables = lappend(cxt.tables, element);
2051 ViewStmt *elp = (ViewStmt *) element;
2053 setSchemaName(cxt.schemaname, &elp->view->schemaname);
2056 * XXX todo: deal with references between views
2058 cxt.views = lappend(cxt.views, element);
2064 IndexStmt *elp = (IndexStmt *) element;
2066 setSchemaName(cxt.schemaname, &elp->relation->schemaname);
2067 cxt.indexes = lappend(cxt.indexes, element);
2071 case T_CreateTrigStmt:
2073 CreateTrigStmt *elp = (CreateTrigStmt *) element;
2075 setSchemaName(cxt.schemaname, &elp->relation->schemaname);
2076 cxt.triggers = lappend(cxt.triggers, element);
2081 cxt.grants = lappend(cxt.grants, element);
2085 elog(ERROR, "unrecognized node type: %d",
2086 (int) nodeTag(element));
2091 result = list_concat(result, cxt.sequences);
2092 result = list_concat(result, cxt.tables);
2093 result = list_concat(result, cxt.views);
2094 result = list_concat(result, cxt.indexes);
2095 result = list_concat(result, cxt.triggers);
2096 result = list_concat(result, cxt.grants);
2103 * Set or check schema name in an element of a CREATE SCHEMA command
2106 setSchemaName(char *context_schema, char **stmt_schema_name)
2108 if (*stmt_schema_name == NULL)
2109 *stmt_schema_name = context_schema;
2110 else if (strcmp(context_schema, *stmt_schema_name) != 0)
2112 (errcode(ERRCODE_INVALID_SCHEMA_DEFINITION),
2113 errmsg("CREATE specifies a schema (%s) "
2114 "different from the one being created (%s)",
2115 *stmt_schema_name, context_schema)));