granicus.if.org Git - postgresql/blob - src/backend/parser/analyze.c

   1 /*-------------------------------------------------------------------------
   2  *
   3  * analyze.c
   4  *        transform the parse tree into a query tree
   5  *
   6  * Portions Copyright (c) 1996-2006, PostgreSQL Global Development Group
   7  * Portions Copyright (c) 1994, Regents of the University of California
   8  *
   9  *      $PostgreSQL: pgsql/src/backend/parser/analyze.c,v 1.352 2006/10/04 00:29:55 momjian Exp $
  10  *
  11  *-------------------------------------------------------------------------
  12  */
  13
  14 #include "postgres.h"
  15
  16 #include "access/heapam.h"
  17 #include "catalog/heap.h"
  18 #include "catalog/index.h"
  19 #include "catalog/namespace.h"
  20 #include "catalog/pg_type.h"
  21 #include "commands/defrem.h"
  22 #include "commands/prepare.h"
  23 #include "commands/tablecmds.h"
  24 #include "miscadmin.h"
  25 #include "nodes/makefuncs.h"
  26 #include "optimizer/clauses.h"
  27 #include "optimizer/var.h"
  28 #include "parser/analyze.h"
  29 #include "parser/gramparse.h"
  30 #include "parser/parse_agg.h"
  31 #include "parser/parse_clause.h"
  32 #include "parser/parse_coerce.h"
  33 #include "parser/parse_expr.h"
  34 #include "parser/parse_expr.h"
  35 #include "parser/parse_relation.h"
  36 #include "parser/parse_target.h"
  37 #include "parser/parse_type.h"
  38 #include "parser/parsetree.h"
  39 #include "rewrite/rewriteManip.h"
  40 #include "utils/acl.h"
  41 #include "utils/builtins.h"
  42 #include "utils/lsyscache.h"
  43 #include "utils/syscache.h"
  44
  45
  46 /* State shared by transformCreateSchemaStmt and its subroutines */
  47 typedef struct
  48 {
  49         const char *stmtType;           /* "CREATE SCHEMA" or "ALTER SCHEMA" */
  50         char       *schemaname;         /* name of schema */
  51         char       *authid;                     /* owner of schema */
  52         List       *sequences;          /* CREATE SEQUENCE items */
  53         List       *tables;                     /* CREATE TABLE items */
  54         List       *views;                      /* CREATE VIEW items */
  55         List       *indexes;            /* CREATE INDEX items */
  56         List       *triggers;           /* CREATE TRIGGER items */
  57         List       *grants;                     /* GRANT items */
  58         List       *fwconstraints;      /* Forward referencing FOREIGN KEY constraints */
  59         List       *alters;                     /* Generated ALTER items (from the above) */
  60         List       *ixconstraints;      /* index-creating constraints */
  61         List       *blist;                      /* "before list" of things to do before
  62                                                                  * creating the schema */
  63         List       *alist;                      /* "after list" of things to do after creating
  64                                                                  * the schema */
  65 } CreateSchemaStmtContext;
  66
  67 /* State shared by transformCreateStmt and its subroutines */
  68 typedef struct
  69 {
  70         const char *stmtType;           /* "CREATE TABLE" or "ALTER TABLE" */
  71         RangeVar   *relation;           /* relation to create */
  72         List       *inhRelations;       /* relations to inherit from */
  73         bool            hasoids;                /* does relation have an OID column? */
  74         bool            isalter;                /* true if altering existing table */
  75         List       *columns;            /* ColumnDef items */
  76         List       *ckconstraints;      /* CHECK constraints */
  77         List       *fkconstraints;      /* FOREIGN KEY constraints */
  78         List       *ixconstraints;      /* index-creating constraints */
  79         List       *blist;                      /* "before list" of things to do before
  80                                                                  * creating the table */
  81         List       *alist;                      /* "after list" of things to do after creating
  82                                                                  * the table */
  83         IndexStmt  *pkey;                       /* PRIMARY KEY index, if any */
  84 } CreateStmtContext;
  85
  86 typedef struct
  87 {
  88         Oid                *paramTypes;
  89         int                     numParams;
  90 } check_parameter_resolution_context;
  91
  92
  93 static List *do_parse_analyze(Node *parseTree, ParseState *pstate);
  94 static Query *transformStmt(ParseState *pstate, Node *stmt,
  95                           List **extras_before, List **extras_after);
  96 static Query *transformViewStmt(ParseState *pstate, ViewStmt *stmt,
  97                                   List **extras_before, List **extras_after);
  98 static Query *transformDeleteStmt(ParseState *pstate, DeleteStmt *stmt);
  99 static Query *transformInsertStmt(ParseState *pstate, InsertStmt *stmt,
 100                                         List **extras_before, List **extras_after);
 101 static List *transformInsertRow(ParseState *pstate, List *exprlist,
 102                                    List *stmtcols, List *icolumns, List *attrnos);
 103 static List *transformReturningList(ParseState *pstate, List *returningList);
 104 static Query *transformIndexStmt(ParseState *pstate, IndexStmt *stmt);
 105 static Query *transformRuleStmt(ParseState *query, RuleStmt *stmt,
 106                                   List **extras_before, List **extras_after);
 107 static Query *transformSelectStmt(ParseState *pstate, SelectStmt *stmt);
 108 static Query *transformValuesClause(ParseState *pstate, SelectStmt *stmt);
 109 static Query *transformSetOperationStmt(ParseState *pstate, SelectStmt *stmt);
 110 static Node *transformSetOperationTree(ParseState *pstate, SelectStmt *stmt);
 111 static Query *transformUpdateStmt(ParseState *pstate, UpdateStmt *stmt);
 112 static Query *transformDeclareCursorStmt(ParseState *pstate,
 113                                                    DeclareCursorStmt *stmt);
 114 static Query *transformPrepareStmt(ParseState *pstate, PrepareStmt *stmt);
 115 static Query *transformExecuteStmt(ParseState *pstate, ExecuteStmt *stmt);
 116 static Query *transformCreateStmt(ParseState *pstate, CreateStmt *stmt,
 117                                         List **extras_before, List **extras_after);
 118 static Query *transformAlterTableStmt(ParseState *pstate, AlterTableStmt *stmt,
 119                                                 List **extras_before, List **extras_after);
 120 static void transformColumnDefinition(ParseState *pstate,
 121                                                   CreateStmtContext *cxt,
 122                                                   ColumnDef *column);
 123 static void transformTableConstraint(ParseState *pstate,
 124                                                  CreateStmtContext *cxt,
 125                                                  Constraint *constraint);
 126 static void transformInhRelation(ParseState *pstate, CreateStmtContext *cxt,
 127                                          InhRelation *inhrelation);
 128 static void transformIndexConstraints(ParseState *pstate,
 129                                                   CreateStmtContext *cxt);
 130 static void transformFKConstraints(ParseState *pstate,
 131                                            CreateStmtContext *cxt,
 132                                            bool skipValidation,
 133                                            bool isAddConstraint);
 134 static void applyColumnNames(List *dst, List *src);
 135 static void getSetColTypes(ParseState *pstate, Node *node,
 136                            List **colTypes, List **colTypmods);
 137 static void transformLockingClause(Query *qry, LockingClause *lc);
 138 static void transformConstraintAttrs(List *constraintList);
 139 static void transformColumnType(ParseState *pstate, ColumnDef *column);
 140 static void release_pstate_resources(ParseState *pstate);
 141 static FromExpr *makeFromExpr(List *fromlist, Node *quals);
 142 static bool check_parameter_resolution_walker(Node *node,
 143                                                                 check_parameter_resolution_context *context);
 144
 145
 146 /*
 147  * parse_analyze
 148  *              Analyze a raw parse tree and transform it to Query form.
 149  *
 150  * If available, pass the source text from which the raw parse tree was
 151  * generated; it's OK to pass NULL if this is not available.
 152  *
 153  * Optionally, information about $n parameter types can be supplied.
 154  * References to $n indexes not defined by paramTypes[] are disallowed.
 155  *
 156  * The result is a List of Query nodes (we need a list since some commands
 157  * produce multiple Queries).  Optimizable statements require considerable
 158  * transformation, while many utility-type statements are simply hung off
 159  * a dummy CMD_UTILITY Query node.
 160  */
 161 List *
 162 parse_analyze(Node *parseTree, const char *sourceText,
 163                           Oid *paramTypes, int numParams)
 164 {
 165         ParseState *pstate = make_parsestate(NULL);
 166         List       *result;
 167
 168         pstate->p_sourcetext = sourceText;
 169         pstate->p_paramtypes = paramTypes;
 170         pstate->p_numparams = numParams;
 171         pstate->p_variableparams = false;
 172
 173         result = do_parse_analyze(parseTree, pstate);
 174
 175         pfree(pstate);
 176
 177         return result;
 178 }
 179
 180 /*
 181  * parse_analyze_varparams
 182  *
 183  * This variant is used when it's okay to deduce information about $n
 184  * symbol datatypes from context.  The passed-in paramTypes[] array can
 185  * be modified or enlarged (via repalloc).
 186  */
 187 List *
 188 parse_analyze_varparams(Node *parseTree, const char *sourceText,
 189                                                 Oid **paramTypes, int *numParams)
 190 {
 191         ParseState *pstate = make_parsestate(NULL);
 192         List       *result;
 193
 194         pstate->p_sourcetext = sourceText;
 195         pstate->p_paramtypes = *paramTypes;
 196         pstate->p_numparams = *numParams;
 197         pstate->p_variableparams = true;
 198
 199         result = do_parse_analyze(parseTree, pstate);
 200
 201         *paramTypes = pstate->p_paramtypes;
 202         *numParams = pstate->p_numparams;
 203
 204         pfree(pstate);
 205
 206         /* make sure all is well with parameter types */
 207         if (*numParams > 0)
 208         {
 209                 check_parameter_resolution_context context;
 210
 211                 context.paramTypes = *paramTypes;
 212                 context.numParams = *numParams;
 213                 check_parameter_resolution_walker((Node *) result, &context);
 214         }
 215
 216         return result;
 217 }
 218
 219 /*
 220  * parse_sub_analyze
 221  *              Entry point for recursively analyzing a sub-statement.
 222  */
 223 List *
 224 parse_sub_analyze(Node *parseTree, ParseState *parentParseState)
 225 {
 226         ParseState *pstate = make_parsestate(parentParseState);
 227         List       *result;
 228
 229         result = do_parse_analyze(parseTree, pstate);
 230
 231         pfree(pstate);
 232
 233         return result;
 234 }
 235
 236 /*
 237  * do_parse_analyze
 238  *              Workhorse code shared by the above variants of parse_analyze.
 239  */
 240 static List *
 241 do_parse_analyze(Node *parseTree, ParseState *pstate)
 242 {
 243         List       *result = NIL;
 244
 245         /* Lists to return extra commands from transformation */
 246         List       *extras_before = NIL;
 247         List       *extras_after = NIL;
 248         Query      *query;
 249         ListCell   *l;
 250
 251         query = transformStmt(pstate, parseTree, &extras_before, &extras_after);
 252
 253         /* don't need to access result relation any more */
 254         release_pstate_resources(pstate);
 255
 256         foreach(l, extras_before)
 257                 result = list_concat(result, parse_sub_analyze(lfirst(l), pstate));
 258
 259         result = lappend(result, query);
 260
 261         foreach(l, extras_after)
 262                 result = list_concat(result, parse_sub_analyze(lfirst(l), pstate));
 263
 264         /*
 265          * Make sure that only the original query is marked original. We have to
 266          * do this explicitly since recursive calls of do_parse_analyze will have
 267          * marked some of the added-on queries as "original".  Also mark only the
 268          * original query as allowed to set the command-result tag.
 269          */
 270         foreach(l, result)
 271         {
 272                 Query      *q = lfirst(l);
 273
 274                 if (q == query)
 275                 {
 276                         q->querySource = QSRC_ORIGINAL;
 277                         q->canSetTag = true;
 278                 }
 279                 else
 280                 {
 281                         q->querySource = QSRC_PARSER;
 282                         q->canSetTag = false;
 283                 }
 284         }
 285
 286         return result;
 287 }
 288
 289 static void
 290 release_pstate_resources(ParseState *pstate)
 291 {
 292         if (pstate->p_target_relation != NULL)
 293                 heap_close(pstate->p_target_relation, NoLock);
 294         pstate->p_target_relation = NULL;
 295         pstate->p_target_rangetblentry = NULL;
 296 }
 297
 298 /*
 299  * transformStmt -
 300  *        transform a Parse tree into a Query tree.
 301  */
 302 static Query *
 303 transformStmt(ParseState *pstate, Node *parseTree,
 304                           List **extras_before, List **extras_after)
 305 {
 306         Query      *result = NULL;
 307
 308         switch (nodeTag(parseTree))
 309         {
 310                         /*
 311                          * Non-optimizable statements
 312                          */
 313                 case T_CreateStmt:
 314                         result = transformCreateStmt(pstate, (CreateStmt *) parseTree,
 315                                                                                  extras_before, extras_after);
 316                         break;
 317
 318                 case T_IndexStmt:
 319                         result = transformIndexStmt(pstate, (IndexStmt *) parseTree);
 320                         break;
 321
 322                 case T_RuleStmt:
 323                         result = transformRuleStmt(pstate, (RuleStmt *) parseTree,
 324                                                                            extras_before, extras_after);
 325                         break;
 326
 327                 case T_ViewStmt:
 328                         result = transformViewStmt(pstate, (ViewStmt *) parseTree,
 329                                                                            extras_before, extras_after);
 330                         break;
 331
 332                 case T_ExplainStmt:
 333                         {
 334                                 ExplainStmt *n = (ExplainStmt *) parseTree;
 335
 336                                 result = makeNode(Query);
 337                                 result->commandType = CMD_UTILITY;
 338                                 n->query = transformStmt(pstate, (Node *) n->query,
 339                                                                                  extras_before, extras_after);
 340                                 result->utilityStmt = (Node *) parseTree;
 341                         }
 342                         break;
 343
 344                 case T_CopyStmt:
 345                         {
 346                                 CopyStmt   *n = (CopyStmt *) parseTree;
 347
 348                                 result = makeNode(Query);
 349                                 result->commandType = CMD_UTILITY;
 350                                 if (n->query)
 351                                         n->query = transformStmt(pstate, (Node *) n->query,
 352                                                                                          extras_before, extras_after);
 353                                 result->utilityStmt = (Node *) parseTree;
 354                         }
 355                         break;
 356
 357                 case T_AlterTableStmt:
 358                         result = transformAlterTableStmt(pstate,
 359                                                                                          (AlterTableStmt *) parseTree,
 360                                                                                          extras_before, extras_after);
 361                         break;
 362
 363                 case T_PrepareStmt:
 364                         result = transformPrepareStmt(pstate, (PrepareStmt *) parseTree);
 365                         break;
 366
 367                 case T_ExecuteStmt:
 368                         result = transformExecuteStmt(pstate, (ExecuteStmt *) parseTree);
 369                         break;
 370
 371                         /*
 372                          * Optimizable statements
 373                          */
 374                 case T_InsertStmt:
 375                         result = transformInsertStmt(pstate, (InsertStmt *) parseTree,
 376                                                                                  extras_before, extras_after);
 377                         break;
 378
 379                 case T_DeleteStmt:
 380                         result = transformDeleteStmt(pstate, (DeleteStmt *) parseTree);
 381                         break;
 382
 383                 case T_UpdateStmt:
 384                         result = transformUpdateStmt(pstate, (UpdateStmt *) parseTree);
 385                         break;
 386
 387                 case T_SelectStmt:
 388                         {
 389                                 SelectStmt *n = (SelectStmt *) parseTree;
 390
 391                                 if (n->valuesLists)
 392                                         result = transformValuesClause(pstate, n);
 393                                 else if (n->op == SETOP_NONE)
 394                                         result = transformSelectStmt(pstate, n);
 395                                 else
 396                                         result = transformSetOperationStmt(pstate, n);
 397                         }
 398                         break;
 399
 400                 case T_DeclareCursorStmt:
 401                         result = transformDeclareCursorStmt(pstate,
 402                                                                                         (DeclareCursorStmt *) parseTree);
 403                         break;
 404
 405                 default:
 406
 407                         /*
 408                          * other statements don't require any transformation-- just return
 409                          * the original parsetree, yea!
 410                          */
 411                         result = makeNode(Query);
 412                         result->commandType = CMD_UTILITY;
 413                         result->utilityStmt = (Node *) parseTree;
 414                         break;
 415         }
 416
 417         /* Mark as original query until we learn differently */
 418         result->querySource = QSRC_ORIGINAL;
 419         result->canSetTag = true;
 420
 421         /*
 422          * Check that we did not produce too many resnos; at the very least we
 423          * cannot allow more than 2^16, since that would exceed the range of a
 424          * AttrNumber. It seems safest to use MaxTupleAttributeNumber.
 425          */
 426         if (pstate->p_next_resno - 1 > MaxTupleAttributeNumber)
 427                 ereport(ERROR,
 428                                 (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
 429                                  errmsg("target lists can have at most %d entries",
 430                                                 MaxTupleAttributeNumber)));
 431
 432         return result;
 433 }
 434
 435 static Query *
 436 transformViewStmt(ParseState *pstate, ViewStmt *stmt,
 437                                   List **extras_before, List **extras_after)
 438 {
 439         Query      *result = makeNode(Query);
 440
 441         result->commandType = CMD_UTILITY;
 442         result->utilityStmt = (Node *) stmt;
 443
 444         stmt->query = transformStmt(pstate, (Node *) stmt->query,
 445                                                                 extras_before, extras_after);
 446
 447         /*
 448          * If a list of column names was given, run through and insert these into
 449          * the actual query tree. - thomas 2000-03-08
 450          *
 451          * Outer loop is over targetlist to make it easier to skip junk targetlist
 452          * entries.
 453          */
 454         if (stmt->aliases != NIL)
 455         {
 456                 ListCell   *alist_item = list_head(stmt->aliases);
 457                 ListCell   *targetList;
 458
 459                 foreach(targetList, stmt->query->targetList)
 460                 {
 461                         TargetEntry *te = (TargetEntry *) lfirst(targetList);
 462
 463                         Assert(IsA(te, TargetEntry));
 464                         /* junk columns don't get aliases */
 465                         if (te->resjunk)
 466                                 continue;
 467                         te->resname = pstrdup(strVal(lfirst(alist_item)));
 468                         alist_item = lnext(alist_item);
 469                         if (alist_item == NULL)
 470                                 break;                  /* done assigning aliases */
 471                 }
 472
 473                 if (alist_item != NULL)
 474                         ereport(ERROR,
 475                                         (errcode(ERRCODE_SYNTAX_ERROR),
 476                                          errmsg("CREATE VIEW specifies more column "
 477                                                         "names than columns")));
 478         }
 479
 480         return result;
 481 }
 482
 483 /*
 484  * transformDeleteStmt -
 485  *        transforms a Delete Statement
 486  */
 487 static Query *
 488 transformDeleteStmt(ParseState *pstate, DeleteStmt *stmt)
 489 {
 490         Query      *qry = makeNode(Query);
 491         Node       *qual;
 492
 493         qry->commandType = CMD_DELETE;
 494
 495         /* set up range table with just the result rel */
 496         qry->resultRelation = setTargetTable(pstate, stmt->relation,
 497                                                                   interpretInhOption(stmt->relation->inhOpt),
 498                                                                                  true,
 499                                                                                  ACL_DELETE);
 500
 501         qry->distinctClause = NIL;
 502
 503         /*
 504          * The USING clause is non-standard SQL syntax, and is equivalent in
 505          * functionality to the FROM list that can be specified for UPDATE. The
 506          * USING keyword is used rather than FROM because FROM is already a
 507          * keyword in the DELETE syntax.
 508          */
 509         transformFromClause(pstate, stmt->usingClause);
 510
 511         qual = transformWhereClause(pstate, stmt->whereClause, "WHERE");
 512
 513         qry->returningList = transformReturningList(pstate, stmt->returningList);
 514
 515         /* done building the range table and jointree */
 516         qry->rtable = pstate->p_rtable;
 517         qry->jointree = makeFromExpr(pstate->p_joinlist, qual);
 518
 519         qry->hasSubLinks = pstate->p_hasSubLinks;
 520         qry->hasAggs = pstate->p_hasAggs;
 521         if (pstate->p_hasAggs)
 522                 parseCheckAggregates(pstate, qry);
 523
 524         return qry;
 525 }
 526
 527 /*
 528  * transformInsertStmt -
 529  *        transform an Insert Statement
 530  */
 531 static Query *
 532 transformInsertStmt(ParseState *pstate, InsertStmt *stmt,
 533                                         List **extras_before, List **extras_after)
 534 {
 535         Query      *qry = makeNode(Query);
 536         SelectStmt *selectStmt = (SelectStmt *) stmt->selectStmt;
 537         List       *exprList = NIL;
 538         bool            isGeneralSelect;
 539         List       *sub_rtable;
 540         List       *sub_relnamespace;
 541         List       *sub_varnamespace;
 542         List       *icolumns;
 543         List       *attrnos;
 544         RangeTblEntry *rte;
 545         RangeTblRef *rtr;
 546         ListCell   *icols;
 547         ListCell   *attnos;
 548         ListCell   *lc;
 549
 550         qry->commandType = CMD_INSERT;
 551         pstate->p_is_insert = true;
 552
 553         /*
 554          * We have three cases to deal with: DEFAULT VALUES (selectStmt == NULL),
 555          * VALUES list, or general SELECT input.  We special-case VALUES, both for
 556          * efficiency and so we can handle DEFAULT specifications.
 557          */
 558         isGeneralSelect = (selectStmt && selectStmt->valuesLists == NIL);
 559
 560         /*
 561          * If a non-nil rangetable/namespace was passed in, and we are doing
 562          * INSERT/SELECT, arrange to pass the rangetable/namespace down to the
 563          * SELECT.      This can only happen if we are inside a CREATE RULE, and in
 564          * that case we want the rule's OLD and NEW rtable entries to appear as
 565          * part of the SELECT's rtable, not as outer references for it.  (Kluge!)
 566          * The SELECT's joinlist is not affected however.  We must do this before
 567          * adding the target table to the INSERT's rtable.
 568          */
 569         if (isGeneralSelect)
 570         {
 571                 sub_rtable = pstate->p_rtable;
 572                 pstate->p_rtable = NIL;
 573                 sub_relnamespace = pstate->p_relnamespace;
 574                 pstate->p_relnamespace = NIL;
 575                 sub_varnamespace = pstate->p_varnamespace;
 576                 pstate->p_varnamespace = NIL;
 577         }
 578         else
 579         {
 580                 sub_rtable = NIL;               /* not used, but keep compiler quiet */
 581                 sub_relnamespace = NIL;
 582                 sub_varnamespace = NIL;
 583         }
 584
 585         /*
 586          * Must get write lock on INSERT target table before scanning SELECT, else
 587          * we will grab the wrong kind of initial lock if the target table is also
 588          * mentioned in the SELECT part.  Note that the target table is not added
 589          * to the joinlist or namespace.
 590          */
 591         qry->resultRelation = setTargetTable(pstate, stmt->relation,
 592                                                                                  false, false, ACL_INSERT);
 593
 594         /* Validate stmt->cols list, or build default list if no list given */
 595         icolumns = checkInsertTargets(pstate, stmt->cols, &attrnos);
 596         Assert(list_length(icolumns) == list_length(attrnos));
 597
 598         /*
 599          * Determine which variant of INSERT we have.
 600          */
 601         if (selectStmt == NULL)
 602         {
 603                 /*
 604                  * We have INSERT ... DEFAULT VALUES.  We can handle this case by
 605                  * emitting an empty targetlist --- all columns will be defaulted when
 606                  * the planner expands the targetlist.
 607                  */
 608                 exprList = NIL;
 609         }
 610         else if (isGeneralSelect)
 611         {
 612                 /*
 613                  * We make the sub-pstate a child of the outer pstate so that it can
 614                  * see any Param definitions supplied from above.  Since the outer
 615                  * pstate's rtable and namespace are presently empty, there are no
 616                  * side-effects of exposing names the sub-SELECT shouldn't be able to
 617                  * see.
 618                  */
 619                 ParseState *sub_pstate = make_parsestate(pstate);
 620                 Query      *selectQuery;
 621
 622                 /*
 623                  * Process the source SELECT.
 624                  *
 625                  * It is important that this be handled just like a standalone SELECT;
 626                  * otherwise the behavior of SELECT within INSERT might be different
 627                  * from a stand-alone SELECT. (Indeed, Postgres up through 6.5 had
 628                  * bugs of just that nature...)
 629                  */
 630                 sub_pstate->p_rtable = sub_rtable;
 631                 sub_pstate->p_relnamespace = sub_relnamespace;
 632                 sub_pstate->p_varnamespace = sub_varnamespace;
 633
 634                 /*
 635                  * Note: we are not expecting that extras_before and extras_after are
 636                  * going to be used by the transformation of the SELECT statement.
 637                  */
 638                 selectQuery = transformStmt(sub_pstate, stmt->selectStmt,
 639                                                                         extras_before, extras_after);
 640
 641                 release_pstate_resources(sub_pstate);
 642                 pfree(sub_pstate);
 643
 644                 Assert(IsA(selectQuery, Query));
 645                 Assert(selectQuery->commandType == CMD_SELECT);
 646                 if (selectQuery->into)
 647                         ereport(ERROR,
 648                                         (errcode(ERRCODE_SYNTAX_ERROR),
 649                                          errmsg("INSERT ... SELECT may not specify INTO")));
 650
 651                 /*
 652                  * Make the source be a subquery in the INSERT's rangetable, and add
 653                  * it to the INSERT's joinlist.
 654                  */
 655                 rte = addRangeTableEntryForSubquery(pstate,
 656                                                                                         selectQuery,
 657                                                                                         makeAlias("*SELECT*", NIL),
 658                                                                                         false);
 659                 rtr = makeNode(RangeTblRef);
 660                 /* assume new rte is at end */
 661                 rtr->rtindex = list_length(pstate->p_rtable);
 662                 Assert(rte == rt_fetch(rtr->rtindex, pstate->p_rtable));
 663                 pstate->p_joinlist = lappend(pstate->p_joinlist, rtr);
 664
 665                 /*----------
 666                  * Generate an expression list for the INSERT that selects all the
 667                  * non-resjunk columns from the subquery.  (INSERT's tlist must be
 668                  * separate from the subquery's tlist because we may add columns,
 669                  * insert datatype coercions, etc.)
 670                  *
 671                  * HACK: unknown-type constants and params in the SELECT's targetlist
 672                  * are copied up as-is rather than being referenced as subquery
 673                  * outputs.  This is to ensure that when we try to coerce them to
 674                  * the target column's datatype, the right things happen (see
 675                  * special cases in coerce_type).  Otherwise, this fails:
 676                  *              INSERT INTO foo SELECT 'bar', ... FROM baz
 677                  *----------
 678                  */
 679                 exprList = NIL;
 680                 foreach(lc, selectQuery->targetList)
 681                 {
 682                         TargetEntry *tle = (TargetEntry *) lfirst(lc);
 683                         Expr       *expr;
 684
 685                         if (tle->resjunk)
 686                                 continue;
 687                         if (tle->expr &&
 688                                 (IsA(tle->expr, Const) ||IsA(tle->expr, Param)) &&
 689                                 exprType((Node *) tle->expr) == UNKNOWNOID)
 690                                 expr = tle->expr;
 691                         else
 692                                 expr = (Expr *) makeVar(rtr->rtindex,
 693                                                                                 tle->resno,
 694                                                                                 exprType((Node *) tle->expr),
 695                                                                                 exprTypmod((Node *) tle->expr),
 696                                                                                 0);
 697                         exprList = lappend(exprList, expr);
 698                 }
 699
 700                 /* Prepare row for assignment to target table */
 701                 exprList = transformInsertRow(pstate, exprList,
 702                                                                           stmt->cols,
 703                                                                           icolumns, attrnos);
 704         }
 705         else if (list_length(selectStmt->valuesLists) > 1)
 706         {
 707                 /*
 708                  * Process INSERT ... VALUES with multiple VALUES sublists. We
 709                  * generate a VALUES RTE holding the transformed expression lists, and
 710                  * build up a targetlist containing Vars that reference the VALUES
 711                  * RTE.
 712                  */
 713                 List       *exprsLists = NIL;
 714                 int                     sublist_length = -1;
 715
 716                 foreach(lc, selectStmt->valuesLists)
 717                 {
 718                         List       *sublist = (List *) lfirst(lc);
 719
 720                         /* Do basic expression transformation (same as a ROW() expr) */
 721                         sublist = transformExpressionList(pstate, sublist);
 722
 723                         /*
 724                          * All the sublists must be the same length, *after*
 725                          * transformation (which might expand '*' into multiple items).
 726                          * The VALUES RTE can't handle anything different.
 727                          */
 728                         if (sublist_length < 0)
 729                         {
 730                                 /* Remember post-transformation length of first sublist */
 731                                 sublist_length = list_length(sublist);
 732                         }
 733                         else if (sublist_length != list_length(sublist))
 734                         {
 735                                 ereport(ERROR,
 736                                                 (errcode(ERRCODE_SYNTAX_ERROR),
 737                                                  errmsg("VALUES lists must all be the same length")));
 738                         }
 739
 740                         /* Prepare row for assignment to target table */
 741                         sublist = transformInsertRow(pstate, sublist,
 742                                                                                  stmt->cols,
 743                                                                                  icolumns, attrnos);
 744
 745                         exprsLists = lappend(exprsLists, sublist);
 746                 }
 747
 748                 /*
 749                  * There mustn't have been any table references in the expressions,
 750                  * else strange things would happen, like Cartesian products of those
 751                  * tables with the VALUES list ...
 752                  */
 753                 if (pstate->p_joinlist != NIL)
 754                         ereport(ERROR,
 755                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
 756                                          errmsg("VALUES must not contain table references")));
 757
 758                 /*
 759                  * Another thing we can't currently support is NEW/OLD references in
 760                  * rules --- seems we'd need something like SQL99's LATERAL construct
 761                  * to ensure that the values would be available while evaluating the
 762                  * VALUES RTE.  This is a shame.  FIXME
 763                  */
 764                 if (list_length(pstate->p_rtable) != 1 &&
 765                         contain_vars_of_level((Node *) exprsLists, 0))
 766                         ereport(ERROR,
 767                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
 768                                          errmsg("VALUES must not contain OLD or NEW references"),
 769                                          errhint("Use SELECT ... UNION ALL ... instead.")));
 770
 771                 /*
 772                  * Generate the VALUES RTE
 773                  */
 774                 rte = addRangeTableEntryForValues(pstate, exprsLists, NULL, true);
 775                 rtr = makeNode(RangeTblRef);
 776                 /* assume new rte is at end */
 777                 rtr->rtindex = list_length(pstate->p_rtable);
 778                 Assert(rte == rt_fetch(rtr->rtindex, pstate->p_rtable));
 779                 pstate->p_joinlist = lappend(pstate->p_joinlist, rtr);
 780
 781                 /*
 782                  * Generate list of Vars referencing the RTE
 783                  */
 784                 expandRTE(rte, rtr->rtindex, 0, false, NULL, &exprList);
 785         }
 786         else
 787         {
 788                 /*----------
 789                  * Process INSERT ... VALUES with a single VALUES sublist.
 790                  * We treat this separately for efficiency and for historical
 791                  * compatibility --- specifically, allowing table references,
 792                  * such as
 793                  *                      INSERT INTO foo VALUES(bar.*)
 794                  *
 795                  * The sublist is just computed directly as the Query's targetlist,
 796                  * with no VALUES RTE.  So it works just like SELECT without FROM.
 797                  *----------
 798                  */
 799                 List       *valuesLists = selectStmt->valuesLists;
 800
 801                 Assert(list_length(valuesLists) == 1);
 802
 803                 /* Do basic expression transformation (same as a ROW() expr) */
 804                 exprList = transformExpressionList(pstate,
 805                                                                                    (List *) linitial(valuesLists));
 806
 807                 /* Prepare row for assignment to target table */
 808                 exprList = transformInsertRow(pstate, exprList,
 809                                                                           stmt->cols,
 810                                                                           icolumns, attrnos);
 811         }
 812
 813         /*
 814          * Generate query's target list using the computed list of expressions.
 815          */
 816         qry->targetList = NIL;
 817         icols = list_head(icolumns);
 818         attnos = list_head(attrnos);
 819         foreach(lc, exprList)
 820         {
 821                 Expr       *expr = (Expr *) lfirst(lc);
 822                 ResTarget  *col;
 823                 TargetEntry *tle;
 824
 825                 col = (ResTarget *) lfirst(icols);
 826                 Assert(IsA(col, ResTarget));
 827
 828                 tle = makeTargetEntry(expr,
 829                                                           (AttrNumber) lfirst_int(attnos),
 830                                                           col->name,
 831                                                           false);
 832                 qry->targetList = lappend(qry->targetList, tle);
 833
 834                 icols = lnext(icols);
 835                 attnos = lnext(attnos);
 836         }
 837
 838         /*
 839          * If we have a RETURNING clause, we need to add the target relation to
 840          * the query namespace before processing it, so that Var references in
 841          * RETURNING will work.  Also, remove any namespace entries added in a
 842          * sub-SELECT or VALUES list.
 843          */
 844         if (stmt->returningList)
 845         {
 846                 pstate->p_relnamespace = NIL;
 847                 pstate->p_varnamespace = NIL;
 848                 addRTEtoQuery(pstate, pstate->p_target_rangetblentry,
 849                                           false, true, true);
 850                 qry->returningList = transformReturningList(pstate,
 851                                                                                                         stmt->returningList);
 852         }
 853
 854         /* done building the range table and jointree */
 855         qry->rtable = pstate->p_rtable;
 856         qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
 857
 858         qry->hasSubLinks = pstate->p_hasSubLinks;
 859         /* aggregates not allowed (but subselects are okay) */
 860         if (pstate->p_hasAggs)
 861                 ereport(ERROR,
 862                                 (errcode(ERRCODE_GROUPING_ERROR),
 863                                  errmsg("cannot use aggregate function in VALUES")));
 864
 865         return qry;
 866 }
 867
 868 /*
 869  * Prepare an INSERT row for assignment to the target table.
 870  *
 871  * The row might be either a VALUES row, or variables referencing a
 872  * sub-SELECT output.
 873  */
 874 static List *
 875 transformInsertRow(ParseState *pstate, List *exprlist,
 876                                    List *stmtcols, List *icolumns, List *attrnos)
 877 {
 878         List       *result;
 879         ListCell   *lc;
 880         ListCell   *icols;
 881         ListCell   *attnos;
 882
 883         /*
 884          * Check length of expr list.  It must not have more expressions than
 885          * there are target columns.  We allow fewer, but only if no explicit
 886          * columns list was given (the remaining columns are implicitly
 887          * defaulted).  Note we must check this *after* transformation because
 888          * that could expand '*' into multiple items.
 889          */
 890         if (list_length(exprlist) > list_length(icolumns))
 891                 ereport(ERROR,
 892                                 (errcode(ERRCODE_SYNTAX_ERROR),
 893                                  errmsg("INSERT has more expressions than target columns")));
 894         if (stmtcols != NIL &&
 895                 list_length(exprlist) < list_length(icolumns))
 896                 ereport(ERROR,
 897                                 (errcode(ERRCODE_SYNTAX_ERROR),
 898                                  errmsg("INSERT has more target columns than expressions")));
 899
 900         /*
 901          * Prepare columns for assignment to target table.
 902          */
 903         result = NIL;
 904         icols = list_head(icolumns);
 905         attnos = list_head(attrnos);
 906         foreach(lc, exprlist)
 907         {
 908                 Expr       *expr = (Expr *) lfirst(lc);
 909                 ResTarget  *col;
 910
 911                 col = (ResTarget *) lfirst(icols);
 912                 Assert(IsA(col, ResTarget));
 913
 914                 expr = transformAssignedExpr(pstate, expr,
 915                                                                          col->name,
 916                                                                          lfirst_int(attnos),
 917                                                                          col->indirection,
 918                                                                          col->location);
 919
 920                 result = lappend(result, expr);
 921
 922                 icols = lnext(icols);
 923                 attnos = lnext(attnos);
 924         }
 925
 926         return result;
 927 }
 928
 929 /*
 930  * transformCreateStmt -
 931  *        transforms the "create table" statement
 932  *        SQL92 allows constraints to be scattered all over, so thumb through
 933  *         the columns and collect all constraints into one place.
 934  *        If there are any implied indices (e.g. UNIQUE or PRIMARY KEY)
 935  *         then expand those into multiple IndexStmt blocks.
 936  *        - thomas 1997-12-02
 937  */
 938 static Query *
 939 transformCreateStmt(ParseState *pstate, CreateStmt *stmt,
 940                                         List **extras_before, List **extras_after)
 941 {
 942         CreateStmtContext cxt;
 943         Query      *q;
 944         ListCell   *elements;
 945
 946         cxt.stmtType = "CREATE TABLE";
 947         cxt.relation = stmt->relation;
 948         cxt.inhRelations = stmt->inhRelations;
 949         cxt.isalter = false;
 950         cxt.columns = NIL;
 951         cxt.ckconstraints = NIL;
 952         cxt.fkconstraints = NIL;
 953         cxt.ixconstraints = NIL;
 954         cxt.blist = NIL;
 955         cxt.alist = NIL;
 956         cxt.pkey = NULL;
 957         cxt.hasoids = interpretOidsOption(stmt->options);
 958
 959         /*
 960          * Run through each primary element in the table creation clause. Separate
 961          * column defs from constraints, and do preliminary analysis.
 962          */
 963         foreach(elements, stmt->tableElts)
 964         {
 965                 Node       *element = lfirst(elements);
 966
 967                 switch (nodeTag(element))
 968                 {
 969                         case T_ColumnDef:
 970                                 transformColumnDefinition(pstate, &cxt,
 971                                                                                   (ColumnDef *) element);
 972                                 break;
 973
 974                         case T_Constraint:
 975                                 transformTableConstraint(pstate, &cxt,
 976                                                                                  (Constraint *) element);
 977                                 break;
 978
 979                         case T_FkConstraint:
 980                                 /* No pre-transformation needed */
 981                                 cxt.fkconstraints = lappend(cxt.fkconstraints, element);
 982                                 break;
 983
 984                         case T_InhRelation:
 985                                 transformInhRelation(pstate, &cxt,
 986                                                                          (InhRelation *) element);
 987                                 break;
 988
 989                         default:
 990                                 elog(ERROR, "unrecognized node type: %d",
 991                                          (int) nodeTag(element));
 992                                 break;
 993                 }
 994         }
 995
 996         /*
 997          * transformIndexConstraints wants cxt.alist to contain only index
 998          * statements, so transfer anything we already have into extras_after
 999          * immediately.
1000          */
1001         *extras_after = list_concat(cxt.alist, *extras_after);
1002         cxt.alist = NIL;
1003
1004         Assert(stmt->constraints == NIL);
1005
1006         /*
1007          * Postprocess constraints that give rise to index definitions.
1008          */
1009         transformIndexConstraints(pstate, &cxt);
1010
1011         /*
1012          * Postprocess foreign-key constraints.
1013          */
1014         transformFKConstraints(pstate, &cxt, true, false);
1015
1016         /*
1017          * Output results.
1018          */
1019         q = makeNode(Query);
1020         q->commandType = CMD_UTILITY;
1021         q->utilityStmt = (Node *) stmt;
1022         stmt->tableElts = cxt.columns;
1023         stmt->constraints = cxt.ckconstraints;
1024         *extras_before = list_concat(*extras_before, cxt.blist);
1025         *extras_after = list_concat(cxt.alist, *extras_after);
1026
1027         return q;
1028 }
1029
1030 static void
1031 transformColumnDefinition(ParseState *pstate, CreateStmtContext *cxt,
1032                                                   ColumnDef *column)
1033 {
1034         bool            is_serial;
1035         bool            saw_nullable;
1036         Constraint *constraint;
1037         ListCell   *clist;
1038
1039         cxt->columns = lappend(cxt->columns, column);
1040
1041         /* Check for SERIAL pseudo-types */
1042         is_serial = false;
1043         if (list_length(column->typename->names) == 1)
1044         {
1045                 char       *typname = strVal(linitial(column->typename->names));
1046
1047                 if (strcmp(typname, "serial") == 0 ||
1048                         strcmp(typname, "serial4") == 0)
1049                 {
1050                         is_serial = true;
1051                         column->typename->names = NIL;
1052                         column->typename->typeid = INT4OID;
1053                 }
1054                 else if (strcmp(typname, "bigserial") == 0 ||
1055                                  strcmp(typname, "serial8") == 0)
1056                 {
1057                         is_serial = true;
1058                         column->typename->names = NIL;
1059                         column->typename->typeid = INT8OID;
1060                 }
1061         }
1062
1063         /* Do necessary work on the column type declaration */
1064         transformColumnType(pstate, column);
1065
1066         /* Special actions for SERIAL pseudo-types */
1067         if (is_serial)
1068         {
1069                 Oid                     snamespaceid;
1070                 char       *snamespace;
1071                 char       *sname;
1072                 char       *qstring;
1073                 A_Const    *snamenode;
1074                 FuncCall   *funccallnode;
1075                 CreateSeqStmt *seqstmt;
1076                 AlterSeqStmt *altseqstmt;
1077                 List       *attnamelist;
1078
1079                 /*
1080                  * Determine namespace and name to use for the sequence.
1081                  *
1082                  * Although we use ChooseRelationName, it's not guaranteed that the
1083                  * selected sequence name won't conflict; given sufficiently long
1084                  * field names, two different serial columns in the same table could
1085                  * be assigned the same sequence name, and we'd not notice since we
1086                  * aren't creating the sequence quite yet.  In practice this seems
1087                  * quite unlikely to be a problem, especially since few people would
1088                  * need two serial columns in one table.
1089                  */
1090                 snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
1091                 snamespace = get_namespace_name(snamespaceid);
1092                 sname = ChooseRelationName(cxt->relation->relname,
1093                                                                    column->colname,
1094                                                                    "seq",
1095                                                                    snamespaceid);
1096
1097                 ereport(NOTICE,
1098                                 (errmsg("%s will create implicit sequence \"%s\" for serial column \"%s.%s\"",
1099                                                 cxt->stmtType, sname,
1100                                                 cxt->relation->relname, column->colname)));
1101
1102                 /*
1103                  * Build a CREATE SEQUENCE command to create the sequence object, and
1104                  * add it to the list of things to be done before this CREATE/ALTER
1105                  * TABLE.
1106                  */
1107                 seqstmt = makeNode(CreateSeqStmt);
1108                 seqstmt->sequence = makeRangeVar(snamespace, sname);
1109                 seqstmt->options = NIL;
1110
1111                 cxt->blist = lappend(cxt->blist, seqstmt);
1112
1113                 /*
1114                  * Build an ALTER SEQUENCE ... OWNED BY command to mark the sequence
1115                  * as owned by this column, and add it to the list of things to be
1116                  * done after this CREATE/ALTER TABLE.
1117                  */
1118                 altseqstmt = makeNode(AlterSeqStmt);
1119                 altseqstmt->sequence = makeRangeVar(snamespace, sname);
1120                 attnamelist = list_make3(makeString(snamespace),
1121                                                                  makeString(cxt->relation->relname),
1122                                                                  makeString(column->colname));
1123                 altseqstmt->options = list_make1(makeDefElem("owned_by",
1124                                                                                                          (Node *) attnamelist));
1125
1126                 cxt->alist = lappend(cxt->alist, altseqstmt);
1127
1128                 /*
1129                  * Create appropriate constraints for SERIAL.  We do this in full,
1130                  * rather than shortcutting, so that we will detect any conflicting
1131                  * constraints the user wrote (like a different DEFAULT).
1132                  *
1133                  * Create an expression tree representing the function call
1134                  * nextval('sequencename').  We cannot reduce the raw tree to cooked
1135                  * form until after the sequence is created, but there's no need to do
1136                  * so.
1137                  */
1138                 qstring = quote_qualified_identifier(snamespace, sname);
1139                 snamenode = makeNode(A_Const);
1140                 snamenode->val.type = T_String;
1141                 snamenode->val.val.str = qstring;
1142                 snamenode->typename = SystemTypeName("regclass");
1143                 funccallnode = makeNode(FuncCall);
1144                 funccallnode->funcname = SystemFuncName("nextval");
1145                 funccallnode->args = list_make1(snamenode);
1146                 funccallnode->agg_star = false;
1147                 funccallnode->agg_distinct = false;
1148                 funccallnode->location = -1;
1149
1150                 constraint = makeNode(Constraint);
1151                 constraint->contype = CONSTR_DEFAULT;
1152                 constraint->raw_expr = (Node *) funccallnode;
1153                 constraint->cooked_expr = NULL;
1154                 constraint->keys = NIL;
1155                 column->constraints = lappend(column->constraints, constraint);
1156
1157                 constraint = makeNode(Constraint);
1158                 constraint->contype = CONSTR_NOTNULL;
1159                 column->constraints = lappend(column->constraints, constraint);
1160         }
1161
1162         /* Process column constraints, if any... */
1163         transformConstraintAttrs(column->constraints);
1164
1165         saw_nullable = false;
1166
1167         foreach(clist, column->constraints)
1168         {
1169                 constraint = lfirst(clist);
1170
1171                 /*
1172                  * If this column constraint is a FOREIGN KEY constraint, then we fill
1173                  * in the current attribute's name and throw it into the list of FK
1174                  * constraints to be processed later.
1175                  */
1176                 if (IsA(constraint, FkConstraint))
1177                 {
1178                         FkConstraint *fkconstraint = (FkConstraint *) constraint;
1179
1180                         fkconstraint->fk_attrs = list_make1(makeString(column->colname));
1181                         cxt->fkconstraints = lappend(cxt->fkconstraints, fkconstraint);
1182                         continue;
1183                 }
1184
1185                 Assert(IsA(constraint, Constraint));
1186
1187                 switch (constraint->contype)
1188                 {
1189                         case CONSTR_NULL:
1190                                 if (saw_nullable && column->is_not_null)
1191                                         ereport(ERROR,
1192                                                         (errcode(ERRCODE_SYNTAX_ERROR),
1193                                                          errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
1194                                                                   column->colname, cxt->relation->relname)));
1195                                 column->is_not_null = FALSE;
1196                                 saw_nullable = true;
1197                                 break;
1198
1199                         case CONSTR_NOTNULL:
1200                                 if (saw_nullable && !column->is_not_null)
1201                                         ereport(ERROR,
1202                                                         (errcode(ERRCODE_SYNTAX_ERROR),
1203                                                          errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
1204                                                                   column->colname, cxt->relation->relname)));
1205                                 column->is_not_null = TRUE;
1206                                 saw_nullable = true;
1207                                 break;
1208
1209                         case CONSTR_DEFAULT:
1210                                 if (column->raw_default != NULL)
1211                                         ereport(ERROR,
1212                                                         (errcode(ERRCODE_SYNTAX_ERROR),
1213                                                          errmsg("multiple default values specified for column \"%s\" of table \"%s\"",
1214                                                                   column->colname, cxt->relation->relname)));
1215                                 column->raw_default = constraint->raw_expr;
1216                                 Assert(constraint->cooked_expr == NULL);
1217                                 break;
1218
1219                         case CONSTR_PRIMARY:
1220                         case CONSTR_UNIQUE:
1221                                 if (constraint->keys == NIL)
1222                                         constraint->keys = list_make1(makeString(column->colname));
1223                                 cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
1224                                 break;
1225
1226                         case CONSTR_CHECK:
1227                                 cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
1228                                 break;
1229
1230                         case CONSTR_ATTR_DEFERRABLE:
1231                         case CONSTR_ATTR_NOT_DEFERRABLE:
1232                         case CONSTR_ATTR_DEFERRED:
1233                         case CONSTR_ATTR_IMMEDIATE:
1234                                 /* transformConstraintAttrs took care of these */
1235                                 break;
1236
1237                         default:
1238                                 elog(ERROR, "unrecognized constraint type: %d",
1239                                          constraint->contype);
1240                                 break;
1241                 }
1242         }
1243 }
1244
1245 static void
1246 transformTableConstraint(ParseState *pstate, CreateStmtContext *cxt,
1247                                                  Constraint *constraint)
1248 {
1249         switch (constraint->contype)
1250         {
1251                 case CONSTR_PRIMARY:
1252                 case CONSTR_UNIQUE:
1253                         cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
1254                         break;
1255
1256                 case CONSTR_CHECK:
1257                         cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
1258                         break;
1259
1260                 case CONSTR_NULL:
1261                 case CONSTR_NOTNULL:
1262                 case CONSTR_DEFAULT:
1263                 case CONSTR_ATTR_DEFERRABLE:
1264                 case CONSTR_ATTR_NOT_DEFERRABLE:
1265                 case CONSTR_ATTR_DEFERRED:
1266                 case CONSTR_ATTR_IMMEDIATE:
1267                         elog(ERROR, "invalid context for constraint type %d",
1268                                  constraint->contype);
1269                         break;
1270
1271                 default:
1272                         elog(ERROR, "unrecognized constraint type: %d",
1273                                  constraint->contype);
1274                         break;
1275         }
1276 }
1277
1278 /*
1279  * transformInhRelation
1280  *
1281  * Change the LIKE <subtable> portion of a CREATE TABLE statement into the
1282  * column definitions which recreate the user defined column portions of <subtable>.
1283  */
1284 static void
1285 transformInhRelation(ParseState *pstate, CreateStmtContext *cxt,
1286                                          InhRelation *inhRelation)
1287 {
1288         AttrNumber      parent_attno;
1289
1290         Relation        relation;
1291         TupleDesc       tupleDesc;
1292         TupleConstr *constr;
1293         AclResult       aclresult;
1294
1295         bool            including_defaults = false;
1296         bool            including_constraints = false;
1297         bool            including_indexes = false;
1298         ListCell   *elem;
1299
1300         relation = heap_openrv(inhRelation->relation, AccessShareLock);
1301
1302         if (relation->rd_rel->relkind != RELKIND_RELATION)
1303                 ereport(ERROR,
1304                                 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1305                                  errmsg("inherited relation \"%s\" is not a table",
1306                                                 inhRelation->relation->relname)));
1307
1308         /*
1309          * Check for SELECT privilages
1310          */
1311         aclresult = pg_class_aclcheck(RelationGetRelid(relation), GetUserId(),
1312                                                                   ACL_SELECT);
1313         if (aclresult != ACLCHECK_OK)
1314                 aclcheck_error(aclresult, ACL_KIND_CLASS,
1315                                            RelationGetRelationName(relation));
1316
1317         tupleDesc = RelationGetDescr(relation);
1318         constr = tupleDesc->constr;
1319
1320         foreach(elem, inhRelation->options)
1321         {
1322                 int                     option = lfirst_int(elem);
1323
1324                 switch (option)
1325                 {
1326                         case CREATE_TABLE_LIKE_INCLUDING_DEFAULTS:
1327                                 including_defaults = true;
1328                                 break;
1329                         case CREATE_TABLE_LIKE_EXCLUDING_DEFAULTS:
1330                                 including_defaults = false;
1331                                 break;
1332                         case CREATE_TABLE_LIKE_INCLUDING_CONSTRAINTS:
1333                                 including_constraints = true;
1334                                 break;
1335                         case CREATE_TABLE_LIKE_EXCLUDING_CONSTRAINTS:
1336                                 including_constraints = false;
1337                                 break;
1338                         case CREATE_TABLE_LIKE_INCLUDING_INDEXES:
1339                                 including_indexes = true;
1340                                 break;
1341                         case CREATE_TABLE_LIKE_EXCLUDING_INDEXES:
1342                                 including_indexes = false;
1343                                 break;
1344                         default:
1345                                 elog(ERROR, "unrecognized CREATE TABLE LIKE option: %d", option);
1346                 }
1347         }
1348
1349         if (including_indexes)
1350                 elog(ERROR, "TODO");
1351
1352         /*
1353          * Insert the inherited attributes into the cxt for the new table
1354          * definition.
1355          */
1356         for (parent_attno = 1; parent_attno <= tupleDesc->natts;
1357                  parent_attno++)
1358         {
1359                 Form_pg_attribute attribute = tupleDesc->attrs[parent_attno - 1];
1360                 char       *attributeName = NameStr(attribute->attname);
1361                 ColumnDef  *def;
1362
1363                 /*
1364                  * Ignore dropped columns in the parent.
1365                  */
1366                 if (attribute->attisdropped)
1367                         continue;
1368
1369                 /*
1370                  * Create a new inherited column.
1371                  *
1372                  * For constraints, ONLY the NOT NULL constraint is inherited by the
1373                  * new column definition per SQL99.
1374                  */
1375                 def = makeNode(ColumnDef);
1376                 def->colname = pstrdup(attributeName);
1377                 def->typename = makeTypeNameFromOid(attribute->atttypid,
1378                                                                                         attribute->atttypmod);
1379                 def->inhcount = 0;
1380                 def->is_local = true;
1381                 def->is_not_null = attribute->attnotnull;
1382                 def->raw_default = NULL;
1383                 def->cooked_default = NULL;
1384                 def->constraints = NIL;
1385
1386                 /*
1387                  * Add to column list
1388                  */
1389                 cxt->columns = lappend(cxt->columns, def);
1390
1391                 /*
1392                  * Copy default if any, and the default has been requested
1393                  */
1394                 if (attribute->atthasdef && including_defaults)
1395                 {
1396                         char       *this_default = NULL;
1397                         AttrDefault *attrdef;
1398                         int                     i;
1399
1400                         /* Find default in constraint structure */
1401                         Assert(constr != NULL);
1402                         attrdef = constr->defval;
1403                         for (i = 0; i < constr->num_defval; i++)
1404                         {
1405                                 if (attrdef[i].adnum == parent_attno)
1406                                 {
1407                                         this_default = attrdef[i].adbin;
1408                                         break;
1409                                 }
1410                         }
1411                         Assert(this_default != NULL);
1412
1413                         /*
1414                          * If default expr could contain any vars, we'd need to fix 'em,
1415                          * but it can't; so default is ready to apply to child.
1416                          */
1417
1418                         def->cooked_default = pstrdup(this_default);
1419                 }
1420         }
1421
1422         if (including_constraints && tupleDesc->constr)
1423         {
1424                 int                     ccnum;
1425                 AttrNumber *attmap = varattnos_map_schema(tupleDesc, cxt->columns);
1426
1427                 for (ccnum = 0; ccnum < tupleDesc->constr->num_check; ccnum++)
1428                 {
1429                         char       *ccname = tupleDesc->constr->check[ccnum].ccname;
1430                         char       *ccbin = tupleDesc->constr->check[ccnum].ccbin;
1431                         Node       *ccbin_node = stringToNode(ccbin);
1432                         Constraint *n = makeNode(Constraint);
1433
1434                         change_varattnos_of_a_node(ccbin_node, attmap);
1435
1436                         n->contype = CONSTR_CHECK;
1437                         n->name = pstrdup(ccname);
1438                         n->raw_expr = ccbin_node;
1439                         n->cooked_expr = NULL;
1440                         n->indexspace = NULL;
1441                         cxt->ckconstraints = lappend(cxt->ckconstraints, (Node *) n);
1442                 }
1443         }
1444
1445         /*
1446          * Close the parent rel, but keep our AccessShareLock on it until xact
1447          * commit.      That will prevent someone else from deleting or ALTERing the
1448          * parent before the child is committed.
1449          */
1450         heap_close(relation, NoLock);
1451 }
1452
1453 static void
1454 transformIndexConstraints(ParseState *pstate, CreateStmtContext *cxt)
1455 {
1456         IndexStmt  *index;
1457         List       *indexlist = NIL;
1458         ListCell   *listptr;
1459         ListCell   *l;
1460
1461         /*
1462          * Run through the constraints that need to generate an index. For PRIMARY
1463          * KEY, mark each column as NOT NULL and create an index. For UNIQUE,
1464          * create an index as for PRIMARY KEY, but do not insist on NOT NULL.
1465          */
1466         foreach(listptr, cxt->ixconstraints)
1467         {
1468                 Constraint *constraint = lfirst(listptr);
1469                 ListCell   *keys;
1470                 IndexElem  *iparam;
1471
1472                 Assert(IsA(constraint, Constraint));
1473                 Assert((constraint->contype == CONSTR_PRIMARY)
1474                            || (constraint->contype == CONSTR_UNIQUE));
1475
1476                 index = makeNode(IndexStmt);
1477
1478                 index->unique = true;
1479                 index->primary = (constraint->contype == CONSTR_PRIMARY);
1480                 if (index->primary)
1481                 {
1482                         if (cxt->pkey != NULL)
1483                                 ereport(ERROR,
1484                                                 (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
1485                                                  errmsg("multiple primary keys for table \"%s\" are not allowed",
1486                                                                 cxt->relation->relname)));
1487                         cxt->pkey = index;
1488
1489                         /*
1490                          * In ALTER TABLE case, a primary index might already exist, but
1491                          * DefineIndex will check for it.
1492                          */
1493                 }
1494                 index->isconstraint = true;
1495
1496                 if (constraint->name != NULL)
1497                         index->idxname = pstrdup(constraint->name);
1498                 else
1499                         index->idxname = NULL;          /* DefineIndex will choose name */
1500
1501                 index->relation = cxt->relation;
1502                 index->accessMethod = DEFAULT_INDEX_TYPE;
1503                 index->options = constraint->options;
1504                 index->tableSpace = constraint->indexspace;
1505                 index->indexParams = NIL;
1506                 index->whereClause = NULL;
1507                 index->concurrent = false;
1508
1509                 /*
1510                  * Make sure referenced keys exist.  If we are making a PRIMARY KEY
1511                  * index, also make sure they are NOT NULL, if possible. (Although we
1512                  * could leave it to DefineIndex to mark the columns NOT NULL, it's
1513                  * more efficient to get it right the first time.)
1514                  */
1515                 foreach(keys, constraint->keys)
1516                 {
1517                         char       *key = strVal(lfirst(keys));
1518                         bool            found = false;
1519                         ColumnDef  *column = NULL;
1520                         ListCell   *columns;
1521
1522                         foreach(columns, cxt->columns)
1523                         {
1524                                 column = (ColumnDef *) lfirst(columns);
1525                                 Assert(IsA(column, ColumnDef));
1526                                 if (strcmp(column->colname, key) == 0)
1527                                 {
1528                                         found = true;
1529                                         break;
1530                                 }
1531                         }
1532                         if (found)
1533                         {
1534                                 /* found column in the new table; force it to be NOT NULL */
1535                                 if (constraint->contype == CONSTR_PRIMARY)
1536                                         column->is_not_null = TRUE;
1537                         }
1538                         else if (SystemAttributeByName(key, cxt->hasoids) != NULL)
1539                         {
1540                                 /*
1541                                  * column will be a system column in the new table, so accept
1542                                  * it.  System columns can't ever be null, so no need to worry
1543                                  * about PRIMARY/NOT NULL constraint.
1544                                  */
1545                                 found = true;
1546                         }
1547                         else if (cxt->inhRelations)
1548                         {
1549                                 /* try inherited tables */
1550                                 ListCell   *inher;
1551
1552                                 foreach(inher, cxt->inhRelations)
1553                                 {
1554                                         RangeVar   *inh = (RangeVar *) lfirst(inher);
1555                                         Relation        rel;
1556                                         int                     count;
1557
1558                                         Assert(IsA(inh, RangeVar));
1559                                         rel = heap_openrv(inh, AccessShareLock);
1560                                         if (rel->rd_rel->relkind != RELKIND_RELATION)
1561                                                 ereport(ERROR,
1562                                                                 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1563                                                    errmsg("inherited relation \"%s\" is not a table",
1564                                                                   inh->relname)));
1565                                         for (count = 0; count < rel->rd_att->natts; count++)
1566                                         {
1567                                                 Form_pg_attribute inhattr = rel->rd_att->attrs[count];
1568                                                 char       *inhname = NameStr(inhattr->attname);
1569
1570                                                 if (inhattr->attisdropped)
1571                                                         continue;
1572                                                 if (strcmp(key, inhname) == 0)
1573                                                 {
1574                                                         found = true;
1575
1576                                                         /*
1577                                                          * We currently have no easy way to force an
1578                                                          * inherited column to be NOT NULL at creation, if
1579                                                          * its parent wasn't so already. We leave it to
1580                                                          * DefineIndex to fix things up in this case.
1581                                                          */
1582                                                         break;
1583                                                 }
1584                                         }
1585                                         heap_close(rel, NoLock);
1586                                         if (found)
1587                                                 break;
1588                                 }
1589                         }
1590
1591                         /*
1592                          * In the ALTER TABLE case, don't complain about index keys not
1593                          * created in the command; they may well exist already.
1594                          * DefineIndex will complain about them if not, and will also take
1595                          * care of marking them NOT NULL.
1596                          */
1597                         if (!found && !cxt->isalter)
1598                                 ereport(ERROR,
1599                                                 (errcode(ERRCODE_UNDEFINED_COLUMN),
1600                                                  errmsg("column \"%s\" named in key does not exist",
1601                                                                 key)));
1602
1603                         /* Check for PRIMARY KEY(foo, foo) */
1604                         foreach(columns, index->indexParams)
1605                         {
1606                                 iparam = (IndexElem *) lfirst(columns);
1607                                 if (iparam->name && strcmp(key, iparam->name) == 0)
1608                                 {
1609                                         if (index->primary)
1610                                                 ereport(ERROR,
1611                                                                 (errcode(ERRCODE_DUPLICATE_COLUMN),
1612                                                                  errmsg("column \"%s\" appears twice in primary key constraint",
1613                                                                                 key)));
1614                                         else
1615                                                 ereport(ERROR,
1616                                                                 (errcode(ERRCODE_DUPLICATE_COLUMN),
1617                                                                  errmsg("column \"%s\" appears twice in unique constraint",
1618                                                                                 key)));
1619                                 }
1620                         }
1621
1622                         /* OK, add it to the index definition */
1623                         iparam = makeNode(IndexElem);
1624                         iparam->name = pstrdup(key);
1625                         iparam->expr = NULL;
1626                         iparam->opclass = NIL;
1627                         index->indexParams = lappend(index->indexParams, iparam);
1628                 }
1629
1630                 indexlist = lappend(indexlist, index);
1631         }
1632
1633         /*
1634          * Scan the index list and remove any redundant index specifications. This
1635          * can happen if, for instance, the user writes UNIQUE PRIMARY KEY. A
1636          * strict reading of SQL92 would suggest raising an error instead, but
1637          * that strikes me as too anal-retentive. - tgl 2001-02-14
1638          *
1639          * XXX in ALTER TABLE case, it'd be nice to look for duplicate
1640          * pre-existing indexes, too.
1641          */
1642         Assert(cxt->alist == NIL);
1643         if (cxt->pkey != NULL)
1644         {
1645                 /* Make sure we keep the PKEY index in preference to others... */
1646                 cxt->alist = list_make1(cxt->pkey);
1647         }
1648
1649         foreach(l, indexlist)
1650         {
1651                 bool            keep = true;
1652                 ListCell   *k;
1653
1654                 index = lfirst(l);
1655
1656                 /* if it's pkey, it's already in cxt->alist */
1657                 if (index == cxt->pkey)
1658                         continue;
1659
1660                 foreach(k, cxt->alist)
1661                 {
1662                         IndexStmt  *priorindex = lfirst(k);
1663
1664                         if (equal(index->indexParams, priorindex->indexParams))
1665                         {
1666                                 /*
1667                                  * If the prior index is as yet unnamed, and this one is
1668                                  * named, then transfer the name to the prior index. This
1669                                  * ensures that if we have named and unnamed constraints,
1670                                  * we'll use (at least one of) the names for the index.
1671                                  */
1672                                 if (priorindex->idxname == NULL)
1673                                         priorindex->idxname = index->idxname;
1674                                 keep = false;
1675                                 break;
1676                         }
1677                 }
1678
1679                 if (keep)
1680                         cxt->alist = lappend(cxt->alist, index);
1681         }
1682 }
1683
1684 static void
1685 transformFKConstraints(ParseState *pstate, CreateStmtContext *cxt,
1686                                            bool skipValidation, bool isAddConstraint)
1687 {
1688         ListCell   *fkclist;
1689
1690         if (cxt->fkconstraints == NIL)
1691                 return;
1692
1693         /*
1694          * If CREATE TABLE or adding a column with NULL default, we can safely
1695          * skip validation of the constraint.
1696          */
1697         if (skipValidation)
1698         {
1699                 foreach(fkclist, cxt->fkconstraints)
1700                 {
1701                         FkConstraint *fkconstraint = (FkConstraint *) lfirst(fkclist);
1702
1703                         fkconstraint->skip_validation = true;
1704                 }
1705         }
1706
1707         /*
1708          * For CREATE TABLE or ALTER TABLE ADD COLUMN, gin up an ALTER TABLE ADD
1709          * CONSTRAINT command to execute after the basic command is complete. (If
1710          * called from ADD CONSTRAINT, that routine will add the FK constraints to
1711          * its own subcommand list.)
1712          *
1713          * Note: the ADD CONSTRAINT command must also execute after any index
1714          * creation commands.  Thus, this should run after
1715          * transformIndexConstraints, so that the CREATE INDEX commands are
1716          * already in cxt->alist.
1717          */
1718         if (!isAddConstraint)
1719         {
1720                 AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
1721
1722                 alterstmt->relation = cxt->relation;
1723                 alterstmt->cmds = NIL;
1724                 alterstmt->relkind = OBJECT_TABLE;
1725
1726                 foreach(fkclist, cxt->fkconstraints)
1727                 {
1728                         FkConstraint *fkconstraint = (FkConstraint *) lfirst(fkclist);
1729                         AlterTableCmd *altercmd = makeNode(AlterTableCmd);
1730
1731                         altercmd->subtype = AT_ProcessedConstraint;
1732                         altercmd->name = NULL;
1733                         altercmd->def = (Node *) fkconstraint;
1734                         alterstmt->cmds = lappend(alterstmt->cmds, altercmd);
1735                 }
1736
1737                 cxt->alist = lappend(cxt->alist, alterstmt);
1738         }
1739 }
1740
1741 /*
1742  * transformIndexStmt -
1743  *        transforms the qualification of the index statement
1744  */
1745 static Query *
1746 transformIndexStmt(ParseState *pstate, IndexStmt *stmt)
1747 {
1748         Query      *qry;
1749         RangeTblEntry *rte = NULL;
1750         ListCell   *l;
1751
1752         qry = makeNode(Query);
1753         qry->commandType = CMD_UTILITY;
1754
1755         /* take care of the where clause */
1756         if (stmt->whereClause)
1757         {
1758                 /*
1759                  * Put the parent table into the rtable so that the WHERE clause can
1760                  * refer to its fields without qualification.  Note that this only
1761                  * works if the parent table already exists --- so we can't easily
1762                  * support predicates on indexes created implicitly by CREATE TABLE.
1763                  * Fortunately, that's not necessary.
1764                  */
1765                 rte = addRangeTableEntry(pstate, stmt->relation, NULL, false, true);
1766
1767                 /* no to join list, yes to namespaces */
1768                 addRTEtoQuery(pstate, rte, false, true, true);
1769
1770                 stmt->whereClause = transformWhereClause(pstate, stmt->whereClause,
1771                                                                                                  "WHERE");
1772         }
1773
1774         /* take care of any index expressions */
1775         foreach(l, stmt->indexParams)
1776         {
1777                 IndexElem  *ielem = (IndexElem *) lfirst(l);
1778
1779                 if (ielem->expr)
1780                 {
1781                         /* Set up rtable as for predicate, see notes above */
1782                         if (rte == NULL)
1783                         {
1784                                 rte = addRangeTableEntry(pstate, stmt->relation, NULL,
1785                                                                                  false, true);
1786                                 /* no to join list, yes to namespaces */
1787                                 addRTEtoQuery(pstate, rte, false, true, true);
1788                         }
1789                         ielem->expr = transformExpr(pstate, ielem->expr);
1790
1791                         /*
1792                          * We check only that the result type is legitimate; this is for
1793                          * consistency with what transformWhereClause() checks for the
1794                          * predicate.  DefineIndex() will make more checks.
1795                          */
1796                         if (expression_returns_set(ielem->expr))
1797                                 ereport(ERROR,
1798                                                 (errcode(ERRCODE_DATATYPE_MISMATCH),
1799                                                  errmsg("index expression may not return a set")));
1800                 }
1801         }
1802
1803         qry->hasSubLinks = pstate->p_hasSubLinks;
1804         stmt->rangetable = pstate->p_rtable;
1805
1806         qry->utilityStmt = (Node *) stmt;
1807
1808         return qry;
1809 }
1810
1811 /*
1812  * transformRuleStmt -
1813  *        transform a Create Rule Statement. The actions is a list of parse
1814  *        trees which is transformed into a list of query trees.
1815  */
1816 static Query *
1817 transformRuleStmt(ParseState *pstate, RuleStmt *stmt,
1818                                   List **extras_before, List **extras_after)
1819 {
1820         Query      *qry;
1821         Relation        rel;
1822         RangeTblEntry *oldrte;
1823         RangeTblEntry *newrte;
1824
1825         qry = makeNode(Query);
1826         qry->commandType = CMD_UTILITY;
1827         qry->utilityStmt = (Node *) stmt;
1828
1829         /*
1830          * To avoid deadlock, make sure the first thing we do is grab
1831          * AccessExclusiveLock on the target relation.  This will be needed by
1832          * DefineQueryRewrite(), and we don't want to grab a lesser lock
1833          * beforehand.
1834          */
1835         rel = heap_openrv(stmt->relation, AccessExclusiveLock);
1836
1837         /*
1838          * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
1839          * Set up their RTEs in the main pstate for use in parsing the rule
1840          * qualification.
1841          */
1842         Assert(pstate->p_rtable == NIL);
1843         oldrte = addRangeTableEntryForRelation(pstate, rel,
1844                                                                                    makeAlias("*OLD*", NIL),
1845                                                                                    false, false);
1846         newrte = addRangeTableEntryForRelation(pstate, rel,
1847                                                                                    makeAlias("*NEW*", NIL),
1848                                                                                    false, false);
1849         /* Must override addRangeTableEntry's default access-check flags */
1850         oldrte->requiredPerms = 0;
1851         newrte->requiredPerms = 0;
1852
1853         /*
1854          * They must be in the namespace too for lookup purposes, but only add the
1855          * one(s) that are relevant for the current kind of rule.  In an UPDATE
1856          * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
1857          * there's no need to be so picky for INSERT & DELETE.  We do not add them
1858          * to the joinlist.
1859          */
1860         switch (stmt->event)
1861         {
1862                 case CMD_SELECT:
1863                         addRTEtoQuery(pstate, oldrte, false, true, true);
1864                         break;
1865                 case CMD_UPDATE:
1866                         addRTEtoQuery(pstate, oldrte, false, true, true);
1867                         addRTEtoQuery(pstate, newrte, false, true, true);
1868                         break;
1869                 case CMD_INSERT:
1870                         addRTEtoQuery(pstate, newrte, false, true, true);
1871                         break;
1872                 case CMD_DELETE:
1873                         addRTEtoQuery(pstate, oldrte, false, true, true);
1874                         break;
1875                 default:
1876                         elog(ERROR, "unrecognized event type: %d",
1877                                  (int) stmt->event);
1878                         break;
1879         }
1880
1881         /* take care of the where clause */
1882         stmt->whereClause = transformWhereClause(pstate, stmt->whereClause,
1883                                                                                          "WHERE");
1884
1885         if (list_length(pstate->p_rtable) != 2)         /* naughty, naughty... */
1886                 ereport(ERROR,
1887                                 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1888                                  errmsg("rule WHERE condition may not contain references to other relations")));
1889
1890         /* aggregates not allowed (but subselects are okay) */
1891         if (pstate->p_hasAggs)
1892                 ereport(ERROR,
1893                                 (errcode(ERRCODE_GROUPING_ERROR),
1894                    errmsg("cannot use aggregate function in rule WHERE condition")));
1895
1896         /* save info about sublinks in where clause */
1897         qry->hasSubLinks = pstate->p_hasSubLinks;
1898
1899         /*
1900          * 'instead nothing' rules with a qualification need a query rangetable so
1901          * the rewrite handler can add the negated rule qualification to the
1902          * original query. We create a query with the new command type CMD_NOTHING
1903          * here that is treated specially by the rewrite system.
1904          */
1905         if (stmt->actions == NIL)
1906         {
1907                 Query      *nothing_qry = makeNode(Query);
1908
1909                 nothing_qry->commandType = CMD_NOTHING;
1910                 nothing_qry->rtable = pstate->p_rtable;
1911                 nothing_qry->jointree = makeFromExpr(NIL, NULL);                /* no join wanted */
1912
1913                 stmt->actions = list_make1(nothing_qry);
1914         }
1915         else
1916         {
1917                 ListCell   *l;
1918                 List       *newactions = NIL;
1919
1920                 /*
1921                  * transform each statement, like parse_sub_analyze()
1922                  */
1923                 foreach(l, stmt->actions)
1924                 {
1925                         Node       *action = (Node *) lfirst(l);
1926                         ParseState *sub_pstate = make_parsestate(pstate->parentParseState);
1927                         Query      *sub_qry,
1928                                            *top_subqry;
1929                         bool            has_old,
1930                                                 has_new;
1931
1932                         /*
1933                          * Set up OLD/NEW in the rtable for this statement.  The entries
1934                          * are added only to relnamespace, not varnamespace, because we
1935                          * don't want them to be referred to by unqualified field names
1936                          * nor "*" in the rule actions.  We decide later whether to put
1937                          * them in the joinlist.
1938                          */
1939                         oldrte = addRangeTableEntryForRelation(sub_pstate, rel,
1940                                                                                                    makeAlias("*OLD*", NIL),
1941                                                                                                    false, false);
1942                         newrte = addRangeTableEntryForRelation(sub_pstate, rel,
1943                                                                                                    makeAlias("*NEW*", NIL),
1944                                                                                                    false, false);
1945                         oldrte->requiredPerms = 0;
1946                         newrte->requiredPerms = 0;
1947                         addRTEtoQuery(sub_pstate, oldrte, false, true, false);
1948                         addRTEtoQuery(sub_pstate, newrte, false, true, false);
1949
1950                         /* Transform the rule action statement */
1951                         top_subqry = transformStmt(sub_pstate, action,
1952                                                                            extras_before, extras_after);
1953
1954                         /*
1955                          * We cannot support utility-statement actions (eg NOTIFY) with
1956                          * nonempty rule WHERE conditions, because there's no way to make
1957                          * the utility action execute conditionally.
1958                          */
1959                         if (top_subqry->commandType == CMD_UTILITY &&
1960                                 stmt->whereClause != NULL)
1961                                 ereport(ERROR,
1962                                                 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1963                                                  errmsg("rules with WHERE conditions may only have SELECT, INSERT, UPDATE, or DELETE actions")));
1964
1965                         /*
1966                          * If the action is INSERT...SELECT, OLD/NEW have been pushed down
1967                          * into the SELECT, and that's what we need to look at. (Ugly
1968                          * kluge ... try to fix this when we redesign querytrees.)
1969                          */
1970                         sub_qry = getInsertSelectQuery(top_subqry, NULL);
1971
1972                         /*
1973                          * If the sub_qry is a setop, we cannot attach any qualifications
1974                          * to it, because the planner won't notice them.  This could
1975                          * perhaps be relaxed someday, but for now, we may as well reject
1976                          * such a rule immediately.
1977                          */
1978                         if (sub_qry->setOperations != NULL && stmt->whereClause != NULL)
1979                                 ereport(ERROR,
1980                                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1981                                                  errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
1982
1983                         /*
1984                          * Validate action's use of OLD/NEW, qual too
1985                          */
1986                         has_old =
1987                                 rangeTableEntry_used((Node *) sub_qry, PRS2_OLD_VARNO, 0) ||
1988                                 rangeTableEntry_used(stmt->whereClause, PRS2_OLD_VARNO, 0);
1989                         has_new =
1990                                 rangeTableEntry_used((Node *) sub_qry, PRS2_NEW_VARNO, 0) ||
1991                                 rangeTableEntry_used(stmt->whereClause, PRS2_NEW_VARNO, 0);
1992
1993                         switch (stmt->event)
1994                         {
1995                                 case CMD_SELECT:
1996                                         if (has_old)
1997                                                 ereport(ERROR,
1998                                                                 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
1999                                                                  errmsg("ON SELECT rule may not use OLD")));
2000                                         if (has_new)
2001                                                 ereport(ERROR,
2002                                                                 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2003                                                                  errmsg("ON SELECT rule may not use NEW")));
2004                                         break;
2005                                 case CMD_UPDATE:
2006                                         /* both are OK */
2007                                         break;
2008                                 case CMD_INSERT:
2009                                         if (has_old)
2010                                                 ereport(ERROR,
2011                                                                 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2012                                                                  errmsg("ON INSERT rule may not use OLD")));
2013                                         break;
2014                                 case CMD_DELETE:
2015                                         if (has_new)
2016                                                 ereport(ERROR,
2017                                                                 (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2018                                                                  errmsg("ON DELETE rule may not use NEW")));
2019                                         break;
2020                                 default:
2021                                         elog(ERROR, "unrecognized event type: %d",
2022                                                  (int) stmt->event);
2023                                         break;
2024                         }
2025
2026                         /*
2027                          * For efficiency's sake, add OLD to the rule action's jointree
2028                          * only if it was actually referenced in the statement or qual.
2029                          *
2030                          * For INSERT, NEW is not really a relation (only a reference to
2031                          * the to-be-inserted tuple) and should never be added to the
2032                          * jointree.
2033                          *
2034                          * For UPDATE, we treat NEW as being another kind of reference to
2035                          * OLD, because it represents references to *transformed* tuples
2036                          * of the existing relation.  It would be wrong to enter NEW
2037                          * separately in the jointree, since that would cause a double
2038                          * join of the updated relation.  It's also wrong to fail to make
2039                          * a jointree entry if only NEW and not OLD is mentioned.
2040                          */
2041                         if (has_old || (has_new && stmt->event == CMD_UPDATE))
2042                         {
2043                                 /*
2044                                  * If sub_qry is a setop, manipulating its jointree will do no
2045                                  * good at all, because the jointree is dummy. (This should be
2046                                  * a can't-happen case because of prior tests.)
2047                                  */
2048                                 if (sub_qry->setOperations != NULL)
2049                                         ereport(ERROR,
2050                                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2051                                                          errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
2052                                 /* hack so we can use addRTEtoQuery() */
2053                                 sub_pstate->p_rtable = sub_qry->rtable;
2054                                 sub_pstate->p_joinlist = sub_qry->jointree->fromlist;
2055                                 addRTEtoQuery(sub_pstate, oldrte, true, false, false);
2056                                 sub_qry->jointree->fromlist = sub_pstate->p_joinlist;
2057                         }
2058
2059                         newactions = lappend(newactions, top_subqry);
2060
2061                         release_pstate_resources(sub_pstate);
2062                         pfree(sub_pstate);
2063                 }
2064
2065                 stmt->actions = newactions;
2066         }
2067
2068         /* Close relation, but keep the exclusive lock */
2069         heap_close(rel, NoLock);
2070
2071         return qry;
2072 }
2073
2074
2075 /*
2076  * transformSelectStmt -
2077  *        transforms a Select Statement
2078  *
2079  * Note: this is also used for DECLARE CURSOR statements.
2080  */
2081 static Query *
2082 transformSelectStmt(ParseState *pstate, SelectStmt *stmt)
2083 {
2084         Query      *qry = makeNode(Query);
2085         Node       *qual;
2086         ListCell   *l;
2087
2088         qry->commandType = CMD_SELECT;
2089
2090         /* make FOR UPDATE/FOR SHARE info available to addRangeTableEntry */
2091         pstate->p_locking_clause = stmt->lockingClause;
2092
2093         /* process the FROM clause */
2094         transformFromClause(pstate, stmt->fromClause);
2095
2096         /* transform targetlist */
2097         qry->targetList = transformTargetList(pstate, stmt->targetList);
2098
2099         /* mark column origins */
2100         markTargetListOrigins(pstate, qry->targetList);
2101
2102         /* transform WHERE */
2103         qual = transformWhereClause(pstate, stmt->whereClause, "WHERE");
2104
2105         /*
2106          * Initial processing of HAVING clause is just like WHERE clause.
2107          */
2108         qry->havingQual = transformWhereClause(pstate, stmt->havingClause,
2109                                                                                    "HAVING");
2110
2111         /*
2112          * Transform sorting/grouping stuff.  Do ORDER BY first because both
2113          * transformGroupClause and transformDistinctClause need the results.
2114          */
2115         qry->sortClause = transformSortClause(pstate,
2116                                                                                   stmt->sortClause,
2117                                                                                   &qry->targetList,
2118                                                                                   true /* fix unknowns */ );
2119
2120         qry->groupClause = transformGroupClause(pstate,
2121                                                                                         stmt->groupClause,
2122                                                                                         &qry->targetList,
2123                                                                                         qry->sortClause);
2124
2125         qry->distinctClause = transformDistinctClause(pstate,
2126                                                                                                   stmt->distinctClause,
2127                                                                                                   &qry->targetList,
2128                                                                                                   &qry->sortClause);
2129
2130         qry->limitOffset = transformLimitClause(pstate, stmt->limitOffset,
2131                                                                                         "OFFSET");
2132         qry->limitCount = transformLimitClause(pstate, stmt->limitCount,
2133                                                                                    "LIMIT");
2134
2135         /* handle any SELECT INTO/CREATE TABLE AS spec */
2136         if (stmt->into)
2137         {
2138                 qry->into = stmt->into;
2139                 if (stmt->intoColNames)
2140                         applyColumnNames(qry->targetList, stmt->intoColNames);
2141                 qry->intoOptions = copyObject(stmt->intoOptions);
2142                 qry->intoOnCommit = stmt->intoOnCommit;
2143                 qry->intoTableSpaceName = stmt->intoTableSpaceName;
2144         }
2145
2146         qry->rtable = pstate->p_rtable;
2147         qry->jointree = makeFromExpr(pstate->p_joinlist, qual);
2148
2149         qry->hasSubLinks = pstate->p_hasSubLinks;
2150         qry->hasAggs = pstate->p_hasAggs;
2151         if (pstate->p_hasAggs || qry->groupClause || qry->havingQual)
2152                 parseCheckAggregates(pstate, qry);
2153
2154         foreach(l, stmt->lockingClause)
2155         {
2156                 transformLockingClause(qry, (LockingClause *) lfirst(l));
2157         }
2158
2159         return qry;
2160 }
2161
2162 /*
2163  * transformValuesClause -
2164  *        transforms a VALUES clause that's being used as a standalone SELECT
2165  *
2166  * We build a Query containing a VALUES RTE, rather as if one had written
2167  *                      SELECT * FROM (VALUES ...)
2168  */
2169 static Query *
2170 transformValuesClause(ParseState *pstate, SelectStmt *stmt)
2171 {
2172         Query      *qry = makeNode(Query);
2173         List       *exprsLists = NIL;
2174         List      **coltype_lists = NULL;
2175         Oid                *coltypes = NULL;
2176         int                     sublist_length = -1;
2177         List       *newExprsLists;
2178         RangeTblEntry *rte;
2179         RangeTblRef *rtr;
2180         ListCell   *lc;
2181         ListCell   *lc2;
2182         int                     i;
2183
2184         qry->commandType = CMD_SELECT;
2185
2186         /* Most SELECT stuff doesn't apply in a VALUES clause */
2187         Assert(stmt->distinctClause == NIL);
2188         Assert(stmt->targetList == NIL);
2189         Assert(stmt->fromClause == NIL);
2190         Assert(stmt->whereClause == NULL);
2191         Assert(stmt->groupClause == NIL);
2192         Assert(stmt->havingClause == NULL);
2193         Assert(stmt->op == SETOP_NONE);
2194
2195         /*
2196          * For each row of VALUES, transform the raw expressions and gather type
2197          * information.  This is also a handy place to reject DEFAULT nodes, which
2198          * the grammar allows for simplicity.
2199          */
2200         foreach(lc, stmt->valuesLists)
2201         {
2202                 List       *sublist = (List *) lfirst(lc);
2203
2204                 /* Do basic expression transformation (same as a ROW() expr) */
2205                 sublist = transformExpressionList(pstate, sublist);
2206
2207                 /*
2208                  * All the sublists must be the same length, *after* transformation
2209                  * (which might expand '*' into multiple items).  The VALUES RTE can't
2210                  * handle anything different.
2211                  */
2212                 if (sublist_length < 0)
2213                 {
2214                         /* Remember post-transformation length of first sublist */
2215                         sublist_length = list_length(sublist);
2216                         /* and allocate arrays for column-type info */
2217                         coltype_lists = (List **) palloc0(sublist_length * sizeof(List *));
2218                         coltypes = (Oid *) palloc0(sublist_length * sizeof(Oid));
2219                 }
2220                 else if (sublist_length != list_length(sublist))
2221                 {
2222                         ereport(ERROR,
2223                                         (errcode(ERRCODE_SYNTAX_ERROR),
2224                                          errmsg("VALUES lists must all be the same length")));
2225                 }
2226
2227                 exprsLists = lappend(exprsLists, sublist);
2228
2229                 i = 0;
2230                 foreach(lc2, sublist)
2231                 {
2232                         Node       *col = (Node *) lfirst(lc2);
2233
2234                         if (IsA(col, SetToDefault))
2235                                 ereport(ERROR,
2236                                                 (errcode(ERRCODE_SYNTAX_ERROR),
2237                                                  errmsg("DEFAULT can only appear in a VALUES list within INSERT")));
2238                         coltype_lists[i] = lappend_oid(coltype_lists[i], exprType(col));
2239                         i++;
2240                 }
2241         }
2242
2243         /*
2244          * Now resolve the common types of the columns, and coerce everything to
2245          * those types.
2246          */
2247         for (i = 0; i < sublist_length; i++)
2248         {
2249                 coltypes[i] = select_common_type(coltype_lists[i], "VALUES");
2250         }
2251
2252         newExprsLists = NIL;
2253         foreach(lc, exprsLists)
2254         {
2255                 List       *sublist = (List *) lfirst(lc);
2256                 List       *newsublist = NIL;
2257
2258                 i = 0;
2259                 foreach(lc2, sublist)
2260                 {
2261                         Node       *col = (Node *) lfirst(lc2);
2262
2263                         col = coerce_to_common_type(pstate, col, coltypes[i], "VALUES");
2264                         newsublist = lappend(newsublist, col);
2265                         i++;
2266                 }
2267
2268                 newExprsLists = lappend(newExprsLists, newsublist);
2269         }
2270
2271         /*
2272          * Generate the VALUES RTE
2273          */
2274         rte = addRangeTableEntryForValues(pstate, newExprsLists, NULL, true);
2275         rtr = makeNode(RangeTblRef);
2276         /* assume new rte is at end */
2277         rtr->rtindex = list_length(pstate->p_rtable);
2278         Assert(rte == rt_fetch(rtr->rtindex, pstate->p_rtable));
2279         pstate->p_joinlist = lappend(pstate->p_joinlist, rtr);
2280         pstate->p_varnamespace = lappend(pstate->p_varnamespace, rte);
2281
2282         /*
2283          * Generate a targetlist as though expanding "*"
2284          */
2285         Assert(pstate->p_next_resno == 1);
2286         qry->targetList = expandRelAttrs(pstate, rte, rtr->rtindex, 0);
2287
2288         /*
2289          * The grammar allows attaching ORDER BY, LIMIT, and FOR UPDATE to a
2290          * VALUES, so cope.
2291          */
2292         qry->sortClause = transformSortClause(pstate,
2293                                                                                   stmt->sortClause,
2294                                                                                   &qry->targetList,
2295                                                                                   true /* fix unknowns */ );
2296
2297         qry->limitOffset = transformLimitClause(pstate, stmt->limitOffset,
2298                                                                                         "OFFSET");
2299         qry->limitCount = transformLimitClause(pstate, stmt->limitCount,
2300                                                                                    "LIMIT");
2301
2302         if (stmt->lockingClause)
2303                 ereport(ERROR,
2304                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2305                          errmsg("SELECT FOR UPDATE/SHARE cannot be applied to VALUES")));
2306
2307         /* handle any CREATE TABLE AS spec */
2308         if (stmt->into)
2309         {
2310                 qry->into = stmt->into;
2311                 if (stmt->intoColNames)
2312                         applyColumnNames(qry->targetList, stmt->intoColNames);
2313                 qry->intoOptions = copyObject(stmt->intoOptions);
2314                 qry->intoOnCommit = stmt->intoOnCommit;
2315                 qry->intoTableSpaceName = stmt->intoTableSpaceName;
2316         }
2317
2318         /*
2319          * There mustn't have been any table references in the expressions, else
2320          * strange things would happen, like Cartesian products of those tables
2321          * with the VALUES list.  We have to check this after parsing ORDER BY et
2322          * al since those could insert more junk.
2323          */
2324         if (list_length(pstate->p_joinlist) != 1)
2325                 ereport(ERROR,
2326                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2327                                  errmsg("VALUES must not contain table references")));
2328
2329         /*
2330          * Another thing we can't currently support is NEW/OLD references in rules
2331          * --- seems we'd need something like SQL99's LATERAL construct to ensure
2332          * that the values would be available while evaluating the VALUES RTE.
2333          * This is a shame.  FIXME
2334          */
2335         if (list_length(pstate->p_rtable) != 1 &&
2336                 contain_vars_of_level((Node *) newExprsLists, 0))
2337                 ereport(ERROR,
2338                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2339                                  errmsg("VALUES must not contain OLD or NEW references"),
2340                                  errhint("Use SELECT ... UNION ALL ... instead.")));
2341
2342         qry->rtable = pstate->p_rtable;
2343         qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
2344
2345         qry->hasSubLinks = pstate->p_hasSubLinks;
2346         /* aggregates not allowed (but subselects are okay) */
2347         if (pstate->p_hasAggs)
2348                 ereport(ERROR,
2349                                 (errcode(ERRCODE_GROUPING_ERROR),
2350                                  errmsg("cannot use aggregate function in VALUES")));
2351
2352         return qry;
2353 }
2354
2355 /*
2356  * transformSetOperationsStmt -
2357  *        transforms a set-operations tree
2358  *
2359  * A set-operation tree is just a SELECT, but with UNION/INTERSECT/EXCEPT
2360  * structure to it.  We must transform each leaf SELECT and build up a top-
2361  * level Query that contains the leaf SELECTs as subqueries in its rangetable.
2362  * The tree of set operations is converted into the setOperations field of
2363  * the top-level Query.
2364  */
2365 static Query *
2366 transformSetOperationStmt(ParseState *pstate, SelectStmt *stmt)
2367 {
2368         Query      *qry = makeNode(Query);
2369         SelectStmt *leftmostSelect;
2370         int                     leftmostRTI;
2371         Query      *leftmostQuery;
2372         SetOperationStmt *sostmt;
2373         List       *intoColNames = NIL;
2374         List       *sortClause;
2375         Node       *limitOffset;
2376         Node       *limitCount;
2377         List       *lockingClause;
2378         Node       *node;
2379         ListCell   *left_tlist,
2380                            *lct,
2381                            *lcm,
2382                            *l;
2383         List       *targetvars,
2384                            *targetnames,
2385                            *sv_relnamespace,
2386                            *sv_varnamespace,
2387                            *sv_rtable;
2388         RangeTblEntry *jrte;
2389         int                     tllen;
2390
2391         qry->commandType = CMD_SELECT;
2392
2393         /*
2394          * Find leftmost leaf SelectStmt; extract the one-time-only items from it
2395          * and from the top-level node.  (Most of the INTO options can be
2396          * transferred to the Query immediately, but intoColNames has to be saved
2397          * to apply below.)
2398          */
2399         leftmostSelect = stmt->larg;
2400         while (leftmostSelect && leftmostSelect->op != SETOP_NONE)
2401                 leftmostSelect = leftmostSelect->larg;
2402         Assert(leftmostSelect && IsA(leftmostSelect, SelectStmt) &&
2403                    leftmostSelect->larg == NULL);
2404         if (leftmostSelect->into)
2405         {
2406                 qry->into = leftmostSelect->into;
2407                 intoColNames = leftmostSelect->intoColNames;
2408                 qry->intoOptions = copyObject(leftmostSelect->intoOptions);
2409                 qry->intoOnCommit = leftmostSelect->intoOnCommit;
2410                 qry->intoTableSpaceName = leftmostSelect->intoTableSpaceName;
2411         }
2412
2413         /* clear this to prevent complaints in transformSetOperationTree() */
2414         leftmostSelect->into = NULL;
2415
2416         /*
2417          * These are not one-time, exactly, but we want to process them here and
2418          * not let transformSetOperationTree() see them --- else it'll just
2419          * recurse right back here!
2420          */
2421         sortClause = stmt->sortClause;
2422         limitOffset = stmt->limitOffset;
2423         limitCount = stmt->limitCount;
2424         lockingClause = stmt->lockingClause;
2425
2426         stmt->sortClause = NIL;
2427         stmt->limitOffset = NULL;
2428         stmt->limitCount = NULL;
2429         stmt->lockingClause = NIL;
2430
2431         /* We don't support FOR UPDATE/SHARE with set ops at the moment. */
2432         if (lockingClause)
2433                 ereport(ERROR,
2434                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2435                                  errmsg("SELECT FOR UPDATE/SHARE is not allowed with UNION/INTERSECT/EXCEPT")));
2436
2437         /*
2438          * Recursively transform the components of the tree.
2439          */
2440         sostmt = (SetOperationStmt *) transformSetOperationTree(pstate, stmt);
2441         Assert(sostmt && IsA(sostmt, SetOperationStmt));
2442         qry->setOperations = (Node *) sostmt;
2443
2444         /*
2445          * Re-find leftmost SELECT (now it's a sub-query in rangetable)
2446          */
2447         node = sostmt->larg;
2448         while (node && IsA(node, SetOperationStmt))
2449                 node = ((SetOperationStmt *) node)->larg;
2450         Assert(node && IsA(node, RangeTblRef));
2451         leftmostRTI = ((RangeTblRef *) node)->rtindex;
2452         leftmostQuery = rt_fetch(leftmostRTI, pstate->p_rtable)->subquery;
2453         Assert(leftmostQuery != NULL);
2454
2455         /*
2456          * Generate dummy targetlist for outer query using column names of
2457          * leftmost select and common datatypes of topmost set operation. Also
2458          * make lists of the dummy vars and their names for use in parsing ORDER
2459          * BY.
2460          *
2461          * Note: we use leftmostRTI as the varno of the dummy variables. It
2462          * shouldn't matter too much which RT index they have, as long as they
2463          * have one that corresponds to a real RT entry; else funny things may
2464          * happen when the tree is mashed by rule rewriting.
2465          */
2466         qry->targetList = NIL;
2467         targetvars = NIL;
2468         targetnames = NIL;
2469         left_tlist = list_head(leftmostQuery->targetList);
2470
2471         forboth(lct, sostmt->colTypes, lcm, sostmt->colTypmods)
2472         {
2473                 Oid                     colType = lfirst_oid(lct);
2474                 int32           colTypmod = lfirst_int(lcm);
2475                 TargetEntry *lefttle = (TargetEntry *) lfirst(left_tlist);
2476                 char       *colName;
2477                 TargetEntry *tle;
2478                 Expr       *expr;
2479
2480                 Assert(!lefttle->resjunk);
2481                 colName = pstrdup(lefttle->resname);
2482                 expr = (Expr *) makeVar(leftmostRTI,
2483                                                                 lefttle->resno,
2484                                                                 colType,
2485                                                                 colTypmod,
2486                                                                 0);
2487                 tle = makeTargetEntry(expr,
2488                                                           (AttrNumber) pstate->p_next_resno++,
2489                                                           colName,
2490                                                           false);
2491                 qry->targetList = lappend(qry->targetList, tle);
2492                 targetvars = lappend(targetvars, expr);
2493                 targetnames = lappend(targetnames, makeString(colName));
2494                 left_tlist = lnext(left_tlist);
2495         }
2496
2497         /*
2498          * As a first step towards supporting sort clauses that are expressions
2499          * using the output columns, generate a varnamespace entry that makes the
2500          * output columns visible.      A Join RTE node is handy for this, since we
2501          * can easily control the Vars generated upon matches.
2502          *
2503          * Note: we don't yet do anything useful with such cases, but at least
2504          * "ORDER BY upper(foo)" will draw the right error message rather than
2505          * "foo not found".
2506          */
2507         jrte = addRangeTableEntryForJoin(NULL,
2508                                                                          targetnames,
2509                                                                          JOIN_INNER,
2510                                                                          targetvars,
2511                                                                          NULL,
2512                                                                          false);
2513
2514         sv_rtable = pstate->p_rtable;
2515         pstate->p_rtable = list_make1(jrte);
2516
2517         sv_relnamespace = pstate->p_relnamespace;
2518         pstate->p_relnamespace = NIL;           /* no qualified names allowed */
2519
2520         sv_varnamespace = pstate->p_varnamespace;
2521         pstate->p_varnamespace = list_make1(jrte);
2522
2523         /*
2524          * For now, we don't support resjunk sort clauses on the output of a
2525          * setOperation tree --- you can only use the SQL92-spec options of
2526          * selecting an output column by name or number.  Enforce by checking that
2527          * transformSortClause doesn't add any items to tlist.
2528          */
2529         tllen = list_length(qry->targetList);
2530
2531         qry->sortClause = transformSortClause(pstate,
2532                                                                                   sortClause,
2533                                                                                   &qry->targetList,
2534                                                                                   false /* no unknowns expected */ );
2535
2536         pstate->p_rtable = sv_rtable;
2537         pstate->p_relnamespace = sv_relnamespace;
2538         pstate->p_varnamespace = sv_varnamespace;
2539
2540         if (tllen != list_length(qry->targetList))
2541                 ereport(ERROR,
2542                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2543                                  errmsg("ORDER BY on a UNION/INTERSECT/EXCEPT result must be on one of the result columns")));
2544
2545         qry->limitOffset = transformLimitClause(pstate, limitOffset,
2546                                                                                         "OFFSET");
2547         qry->limitCount = transformLimitClause(pstate, limitCount,
2548                                                                                    "LIMIT");
2549
2550         /*
2551          * Handle SELECT INTO/CREATE TABLE AS.
2552          *
2553          * Any column names from CREATE TABLE AS need to be attached to both the
2554          * top level and the leftmost subquery.  We do not do this earlier because
2555          * we do *not* want sortClause processing to be affected.
2556          */
2557         if (intoColNames)
2558         {
2559                 applyColumnNames(qry->targetList, intoColNames);
2560                 applyColumnNames(leftmostQuery->targetList, intoColNames);
2561         }
2562
2563         qry->rtable = pstate->p_rtable;
2564         qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
2565
2566         qry->hasSubLinks = pstate->p_hasSubLinks;
2567         qry->hasAggs = pstate->p_hasAggs;
2568         if (pstate->p_hasAggs || qry->groupClause || qry->havingQual)
2569                 parseCheckAggregates(pstate, qry);
2570
2571         foreach(l, lockingClause)
2572         {
2573                 transformLockingClause(qry, (LockingClause *) lfirst(l));
2574         }
2575
2576         return qry;
2577 }
2578
2579 /*
2580  * transformSetOperationTree
2581  *              Recursively transform leaves and internal nodes of a set-op tree
2582  */
2583 static Node *
2584 transformSetOperationTree(ParseState *pstate, SelectStmt *stmt)
2585 {
2586         bool            isLeaf;
2587
2588         Assert(stmt && IsA(stmt, SelectStmt));
2589
2590         /*
2591          * Validity-check both leaf and internal SELECTs for disallowed ops.
2592          */
2593         if (stmt->into)
2594                 ereport(ERROR,
2595                                 (errcode(ERRCODE_SYNTAX_ERROR),
2596                                  errmsg("INTO is only allowed on first SELECT of UNION/INTERSECT/EXCEPT")));
2597         /* We don't support FOR UPDATE/SHARE with set ops at the moment. */
2598         if (stmt->lockingClause)
2599                 ereport(ERROR,
2600                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2601                                  errmsg("SELECT FOR UPDATE/SHARE is not allowed with UNION/INTERSECT/EXCEPT")));
2602
2603         /*
2604          * If an internal node of a set-op tree has ORDER BY, UPDATE, or LIMIT
2605          * clauses attached, we need to treat it like a leaf node to generate an
2606          * independent sub-Query tree.  Otherwise, it can be represented by a
2607          * SetOperationStmt node underneath the parent Query.
2608          */
2609         if (stmt->op == SETOP_NONE)
2610         {
2611                 Assert(stmt->larg == NULL && stmt->rarg == NULL);
2612                 isLeaf = true;
2613         }
2614         else
2615         {
2616                 Assert(stmt->larg != NULL && stmt->rarg != NULL);
2617                 if (stmt->sortClause || stmt->limitOffset || stmt->limitCount ||
2618                         stmt->lockingClause)
2619                         isLeaf = true;
2620                 else
2621                         isLeaf = false;
2622         }
2623
2624         if (isLeaf)
2625         {
2626                 /* Process leaf SELECT */
2627                 List       *selectList;
2628                 Query      *selectQuery;
2629                 char            selectName[32];
2630                 RangeTblEntry *rte;
2631                 RangeTblRef *rtr;
2632
2633                 /*
2634                  * Transform SelectStmt into a Query.
2635                  *
2636                  * Note: previously transformed sub-queries don't affect the parsing
2637                  * of this sub-query, because they are not in the toplevel pstate's
2638                  * namespace list.
2639                  */
2640                 selectList = parse_sub_analyze((Node *) stmt, pstate);
2641
2642                 Assert(list_length(selectList) == 1);
2643                 selectQuery = (Query *) linitial(selectList);
2644                 Assert(IsA(selectQuery, Query));
2645
2646                 /*
2647                  * Check for bogus references to Vars on the current query level (but
2648                  * upper-level references are okay). Normally this can't happen
2649                  * because the namespace will be empty, but it could happen if we are
2650                  * inside a rule.
2651                  */
2652                 if (pstate->p_relnamespace || pstate->p_varnamespace)
2653                 {
2654                         if (contain_vars_of_level((Node *) selectQuery, 1))
2655                                 ereport(ERROR,
2656                                                 (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
2657                                                  errmsg("UNION/INTERSECT/EXCEPT member statement may not refer to other relations of same query level")));
2658                 }
2659
2660                 /*
2661                  * Make the leaf query be a subquery in the top-level rangetable.
2662                  */
2663                 snprintf(selectName, sizeof(selectName), "*SELECT* %d",
2664                                  list_length(pstate->p_rtable) + 1);
2665                 rte = addRangeTableEntryForSubquery(pstate,
2666                                                                                         selectQuery,
2667                                                                                         makeAlias(selectName, NIL),
2668                                                                                         false);
2669
2670                 /*
2671                  * Return a RangeTblRef to replace the SelectStmt in the set-op tree.
2672                  */
2673                 rtr = makeNode(RangeTblRef);
2674                 /* assume new rte is at end */
2675                 rtr->rtindex = list_length(pstate->p_rtable);
2676                 Assert(rte == rt_fetch(rtr->rtindex, pstate->p_rtable));
2677                 return (Node *) rtr;
2678         }
2679         else
2680         {
2681                 /* Process an internal node (set operation node) */
2682                 SetOperationStmt *op = makeNode(SetOperationStmt);
2683                 List       *lcoltypes;
2684                 List       *rcoltypes;
2685                 List       *lcoltypmods;
2686                 List       *rcoltypmods;
2687                 ListCell   *lct;
2688                 ListCell   *rct;
2689                 ListCell   *lcm;
2690                 ListCell   *rcm;
2691                 const char *context;
2692
2693                 context = (stmt->op == SETOP_UNION ? "UNION" :
2694                                    (stmt->op == SETOP_INTERSECT ? "INTERSECT" :
2695                                         "EXCEPT"));
2696
2697                 op->op = stmt->op;
2698                 op->all = stmt->all;
2699
2700                 /*
2701                  * Recursively transform the child nodes.
2702                  */
2703                 op->larg = transformSetOperationTree(pstate, stmt->larg);
2704                 op->rarg = transformSetOperationTree(pstate, stmt->rarg);
2705
2706                 /*
2707                  * Verify that the two children have the same number of non-junk
2708                  * columns, and determine the types of the merged output columns.
2709                  */
2710                 getSetColTypes(pstate, op->larg, &lcoltypes, &lcoltypmods);
2711                 getSetColTypes(pstate, op->rarg, &rcoltypes, &rcoltypmods);
2712                 if (list_length(lcoltypes) != list_length(rcoltypes))
2713                         ereport(ERROR,
2714                                         (errcode(ERRCODE_SYNTAX_ERROR),
2715                                  errmsg("each %s query must have the same number of columns",
2716                                                 context)));
2717                 Assert(list_length(lcoltypes) == list_length(lcoltypmods));
2718                 Assert(list_length(rcoltypes) == list_length(rcoltypmods));
2719
2720                 op->colTypes = NIL;
2721                 op->colTypmods = NIL;
2722                 /* don't have a "foreach4", so chase two of the lists by hand */
2723                 lcm = list_head(lcoltypmods);
2724                 rcm = list_head(rcoltypmods);
2725                 forboth(lct, lcoltypes, rct, rcoltypes)
2726                 {
2727                         Oid                     lcoltype = lfirst_oid(lct);
2728                         Oid                     rcoltype = lfirst_oid(rct);
2729                         int32           lcoltypmod = lfirst_int(lcm);
2730                         int32           rcoltypmod = lfirst_int(rcm);
2731                         Oid                     rescoltype;
2732                         int32           rescoltypmod;
2733
2734                         /* select common type, same as CASE et al */
2735                         rescoltype = select_common_type(list_make2_oid(lcoltype, rcoltype),
2736                                                                                         context);
2737                         /* if same type and same typmod, use typmod; else default */
2738                         if (lcoltype == rcoltype && lcoltypmod == rcoltypmod)
2739                                 rescoltypmod = lcoltypmod;
2740                         else
2741                                 rescoltypmod = -1;
2742                         op->colTypes = lappend_oid(op->colTypes, rescoltype);
2743                         op->colTypmods = lappend_int(op->colTypmods, rescoltypmod);
2744
2745                         lcm = lnext(lcm);
2746                         rcm = lnext(rcm);
2747                 }
2748
2749                 return (Node *) op;
2750         }
2751 }
2752
2753 /*
2754  * getSetColTypes
2755  *        Get output column types/typmods of an (already transformed) set-op node
2756  */
2757 static void
2758 getSetColTypes(ParseState *pstate, Node *node,
2759                            List **colTypes, List **colTypmods)
2760 {
2761         *colTypes = NIL;
2762         *colTypmods = NIL;
2763         if (IsA(node, RangeTblRef))
2764         {
2765                 RangeTblRef *rtr = (RangeTblRef *) node;
2766                 RangeTblEntry *rte = rt_fetch(rtr->rtindex, pstate->p_rtable);
2767                 Query      *selectQuery = rte->subquery;
2768                 ListCell   *tl;
2769
2770                 Assert(selectQuery != NULL);
2771                 /* Get types of non-junk columns */
2772                 foreach(tl, selectQuery->targetList)
2773                 {
2774                         TargetEntry *tle = (TargetEntry *) lfirst(tl);
2775
2776                         if (tle->resjunk)
2777                                 continue;
2778                         *colTypes = lappend_oid(*colTypes,
2779                                                                         exprType((Node *) tle->expr));
2780                         *colTypmods = lappend_int(*colTypmods,
2781                                                                           exprTypmod((Node *) tle->expr));
2782                 }
2783         }
2784         else if (IsA(node, SetOperationStmt))
2785         {
2786                 SetOperationStmt *op = (SetOperationStmt *) node;
2787
2788                 /* Result already computed during transformation of node */
2789                 Assert(op->colTypes != NIL);
2790                 *colTypes = op->colTypes;
2791                 *colTypmods = op->colTypmods;
2792         }
2793         else
2794                 elog(ERROR, "unrecognized node type: %d", (int) nodeTag(node));
2795 }
2796
2797 /* Attach column names from a ColumnDef list to a TargetEntry list */
2798 static void
2799 applyColumnNames(List *dst, List *src)
2800 {
2801         ListCell   *dst_item;
2802         ListCell   *src_item;
2803
2804         src_item = list_head(src);
2805
2806         foreach(dst_item, dst)
2807         {
2808                 TargetEntry *d = (TargetEntry *) lfirst(dst_item);
2809                 ColumnDef  *s;
2810
2811                 /* junk targets don't count */
2812                 if (d->resjunk)
2813                         continue;
2814
2815                 /* fewer ColumnDefs than target entries is OK */
2816                 if (src_item == NULL)
2817                         break;
2818
2819                 s = (ColumnDef *) lfirst(src_item);
2820                 src_item = lnext(src_item);
2821
2822                 d->resname = pstrdup(s->colname);
2823         }
2824
2825         /* more ColumnDefs than target entries is not OK */
2826         if (src_item != NULL)
2827                 ereport(ERROR,
2828                                 (errcode(ERRCODE_SYNTAX_ERROR),
2829                                  errmsg("CREATE TABLE AS specifies too many column names")));
2830 }
2831
2832
2833 /*
2834  * transformUpdateStmt -
2835  *        transforms an update statement
2836  */
2837 static Query *
2838 transformUpdateStmt(ParseState *pstate, UpdateStmt *stmt)
2839 {
2840         Query      *qry = makeNode(Query);
2841         Node       *qual;
2842         ListCell   *origTargetList;
2843         ListCell   *tl;
2844
2845         qry->commandType = CMD_UPDATE;
2846         pstate->p_is_update = true;
2847
2848         qry->resultRelation = setTargetTable(pstate, stmt->relation,
2849                                                                   interpretInhOption(stmt->relation->inhOpt),
2850                                                                                  true,
2851                                                                                  ACL_UPDATE);
2852
2853         /*
2854          * the FROM clause is non-standard SQL syntax. We used to be able to do
2855          * this with REPLACE in POSTQUEL so we keep the feature.
2856          */
2857         transformFromClause(pstate, stmt->fromClause);
2858
2859         qry->targetList = transformTargetList(pstate, stmt->targetList);
2860
2861         qual = transformWhereClause(pstate, stmt->whereClause, "WHERE");
2862
2863         qry->returningList = transformReturningList(pstate, stmt->returningList);
2864
2865         qry->rtable = pstate->p_rtable;
2866         qry->jointree = makeFromExpr(pstate->p_joinlist, qual);
2867
2868         qry->hasSubLinks = pstate->p_hasSubLinks;
2869
2870         /*
2871          * Top-level aggregates are simply disallowed in UPDATE, per spec. (From
2872          * an implementation point of view, this is forced because the implicit
2873          * ctid reference would otherwise be an ungrouped variable.)
2874          */
2875         if (pstate->p_hasAggs)
2876                 ereport(ERROR,
2877                                 (errcode(ERRCODE_GROUPING_ERROR),
2878                                  errmsg("cannot use aggregate function in UPDATE")));
2879
2880         /*
2881          * Now we are done with SELECT-like processing, and can get on with
2882          * transforming the target list to match the UPDATE target columns.
2883          */
2884
2885         /* Prepare to assign non-conflicting resnos to resjunk attributes */
2886         if (pstate->p_next_resno <= pstate->p_target_relation->rd_rel->relnatts)
2887                 pstate->p_next_resno = pstate->p_target_relation->rd_rel->relnatts + 1;
2888
2889         /* Prepare non-junk columns for assignment to target table */
2890         origTargetList = list_head(stmt->targetList);
2891
2892         foreach(tl, qry->targetList)
2893         {
2894                 TargetEntry *tle = (TargetEntry *) lfirst(tl);
2895                 ResTarget  *origTarget;
2896                 int                     attrno;
2897
2898                 if (tle->resjunk)
2899                 {
2900                         /*
2901                          * Resjunk nodes need no additional processing, but be sure they
2902                          * have resnos that do not match any target columns; else rewriter
2903                          * or planner might get confused.  They don't need a resname
2904                          * either.
2905                          */
2906                         tle->resno = (AttrNumber) pstate->p_next_resno++;
2907                         tle->resname = NULL;
2908                         continue;
2909                 }
2910                 if (origTargetList == NULL)
2911                         elog(ERROR, "UPDATE target count mismatch --- internal error");
2912                 origTarget = (ResTarget *) lfirst(origTargetList);
2913                 Assert(IsA(origTarget, ResTarget));
2914
2915                 attrno = attnameAttNum(pstate->p_target_relation,
2916                                                            origTarget->name, true);
2917                 if (attrno == InvalidAttrNumber)
2918                         ereport(ERROR,
2919                                         (errcode(ERRCODE_UNDEFINED_COLUMN),
2920                                          errmsg("column \"%s\" of relation \"%s\" does not exist",
2921                                                         origTarget->name,
2922                                                  RelationGetRelationName(pstate->p_target_relation)),
2923                                          parser_errposition(pstate, origTarget->location)));
2924
2925                 updateTargetListEntry(pstate, tle, origTarget->name,
2926                                                           attrno,
2927                                                           origTarget->indirection,
2928                                                           origTarget->location);
2929
2930                 origTargetList = lnext(origTargetList);
2931         }
2932         if (origTargetList != NULL)
2933                 elog(ERROR, "UPDATE target count mismatch --- internal error");
2934
2935         return qry;
2936 }
2937
2938 /*
2939  * transformReturningList -
2940  *      handle a RETURNING clause in INSERT/UPDATE/DELETE
2941  */
2942 static List *
2943 transformReturningList(ParseState *pstate, List *returningList)
2944 {
2945         List       *rlist;
2946         int                     save_next_resno;
2947         bool            save_hasAggs;
2948         int                     length_rtable;
2949
2950         if (returningList == NIL)
2951                 return NIL;                             /* nothing to do */
2952
2953         /*
2954          * We need to assign resnos starting at one in the RETURNING list. Save
2955          * and restore the main tlist's value of p_next_resno, just in case
2956          * someone looks at it later (probably won't happen).
2957          */
2958         save_next_resno = pstate->p_next_resno;
2959         pstate->p_next_resno = 1;
2960
2961         /* save other state so that we can detect disallowed stuff */
2962         save_hasAggs = pstate->p_hasAggs;
2963         pstate->p_hasAggs = false;
2964         length_rtable = list_length(pstate->p_rtable);
2965
2966         /* transform RETURNING identically to a SELECT targetlist */
2967         rlist = transformTargetList(pstate, returningList);
2968
2969         /* check for disallowed stuff */
2970
2971         /* aggregates not allowed (but subselects are okay) */
2972         if (pstate->p_hasAggs)
2973                 ereport(ERROR,
2974                                 (errcode(ERRCODE_GROUPING_ERROR),
2975                                  errmsg("cannot use aggregate function in RETURNING")));
2976
2977         /* no new relation references please */
2978         if (list_length(pstate->p_rtable) != length_rtable)
2979                 ereport(ERROR,
2980                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2981                  errmsg("RETURNING may not contain references to other relations")));
2982
2983         /* mark column origins */
2984         markTargetListOrigins(pstate, rlist);
2985
2986         /* restore state */
2987         pstate->p_next_resno = save_next_resno;
2988         pstate->p_hasAggs = save_hasAggs;
2989
2990         return rlist;
2991 }
2992
2993 /*
2994  * transformAlterTableStmt -
2995  *      transform an Alter Table Statement
2996  */
2997 static Query *
2998 transformAlterTableStmt(ParseState *pstate, AlterTableStmt *stmt,
2999                                                 List **extras_before, List **extras_after)
3000 {
3001         CreateStmtContext cxt;
3002         Query      *qry;
3003         ListCell   *lcmd,
3004                            *l;
3005         List       *newcmds = NIL;
3006         bool            skipValidation = true;
3007         AlterTableCmd *newcmd;
3008
3009         cxt.stmtType = "ALTER TABLE";
3010         cxt.relation = stmt->relation;
3011         cxt.inhRelations = NIL;
3012         cxt.isalter = true;
3013         cxt.hasoids = false;            /* need not be right */
3014         cxt.columns = NIL;
3015         cxt.ckconstraints = NIL;
3016         cxt.fkconstraints = NIL;
3017         cxt.ixconstraints = NIL;
3018         cxt.blist = NIL;
3019         cxt.alist = NIL;
3020         cxt.pkey = NULL;
3021
3022         /*
3023          * The only subtypes that currently require parse transformation handling
3024          * are ADD COLUMN and ADD CONSTRAINT.  These largely re-use code from
3025          * CREATE TABLE.
3026          */
3027         foreach(lcmd, stmt->cmds)
3028         {
3029                 AlterTableCmd *cmd = (AlterTableCmd *) lfirst(lcmd);
3030
3031                 switch (cmd->subtype)
3032                 {
3033                         case AT_AddColumn:
3034                                 {
3035                                         ColumnDef  *def = (ColumnDef *) cmd->def;
3036
3037                                         Assert(IsA(cmd->def, ColumnDef));
3038                                         transformColumnDefinition(pstate, &cxt,
3039                                                                                           (ColumnDef *) cmd->def);
3040
3041                                         /*
3042                                          * If the column has a non-null default, we can't skip
3043                                          * validation of foreign keys.
3044                                          */
3045                                         if (((ColumnDef *) cmd->def)->raw_default != NULL)
3046                                                 skipValidation = false;
3047
3048                                         newcmds = lappend(newcmds, cmd);
3049
3050                                         /*
3051                                          * Convert an ADD COLUMN ... NOT NULL constraint to a
3052                                          * separate command
3053                                          */
3054                                         if (def->is_not_null)
3055                                         {
3056                                                 /* Remove NOT NULL from AddColumn */
3057                                                 def->is_not_null = false;
3058
3059                                                 /* Add as a separate AlterTableCmd */
3060                                                 newcmd = makeNode(AlterTableCmd);
3061                                                 newcmd->subtype = AT_SetNotNull;
3062                                                 newcmd->name = pstrdup(def->colname);
3063                                                 newcmds = lappend(newcmds, newcmd);
3064                                         }
3065
3066                                         /*
3067                                          * All constraints are processed in other ways. Remove the
3068                                          * original list
3069                                          */
3070                                         def->constraints = NIL;
3071
3072                                         break;
3073                                 }
3074                         case AT_AddConstraint:
3075
3076                                 /*
3077                                  * The original AddConstraint cmd node doesn't go to newcmds
3078                                  */
3079
3080                                 if (IsA(cmd->def, Constraint))
3081                                         transformTableConstraint(pstate, &cxt,
3082                                                                                          (Constraint *) cmd->def);
3083                                 else if (IsA(cmd->def, FkConstraint))
3084                                 {
3085                                         cxt.fkconstraints = lappend(cxt.fkconstraints, cmd->def);
3086                                         skipValidation = false;
3087                                 }
3088                                 else
3089                                         elog(ERROR, "unrecognized node type: %d",
3090                                                  (int) nodeTag(cmd->def));
3091                                 break;
3092
3093                         case AT_ProcessedConstraint:
3094
3095                                 /*
3096                                  * Already-transformed ADD CONSTRAINT, so just make it look
3097                                  * like the standard case.
3098                                  */
3099                                 cmd->subtype = AT_AddConstraint;
3100                                 newcmds = lappend(newcmds, cmd);
3101                                 break;
3102
3103                         default:
3104                                 newcmds = lappend(newcmds, cmd);
3105                                 break;
3106                 }
3107         }
3108
3109         /*
3110          * transformIndexConstraints wants cxt.alist to contain only index
3111          * statements, so transfer anything we already have into extras_after
3112          * immediately.
3113          */
3114         *extras_after = list_concat(cxt.alist, *extras_after);
3115         cxt.alist = NIL;
3116
3117         /* Postprocess index and FK constraints */
3118         transformIndexConstraints(pstate, &cxt);
3119
3120         transformFKConstraints(pstate, &cxt, skipValidation, true);
3121
3122         /*
3123          * Push any index-creation commands into the ALTER, so that they can be
3124          * scheduled nicely by tablecmds.c.
3125          */
3126         foreach(l, cxt.alist)
3127         {
3128                 Node       *idxstmt = (Node *) lfirst(l);
3129
3130                 Assert(IsA(idxstmt, IndexStmt));
3131                 newcmd = makeNode(AlterTableCmd);
3132                 newcmd->subtype = AT_AddIndex;
3133                 newcmd->def = idxstmt;
3134                 newcmds = lappend(newcmds, newcmd);
3135         }
3136         cxt.alist = NIL;
3137
3138         /* Append any CHECK or FK constraints to the commands list */
3139         foreach(l, cxt.ckconstraints)
3140         {
3141                 newcmd = makeNode(AlterTableCmd);
3142                 newcmd->subtype = AT_AddConstraint;
3143                 newcmd->def = (Node *) lfirst(l);
3144                 newcmds = lappend(newcmds, newcmd);
3145         }
3146         foreach(l, cxt.fkconstraints)
3147         {
3148                 newcmd = makeNode(AlterTableCmd);
3149                 newcmd->subtype = AT_AddConstraint;
3150                 newcmd->def = (Node *) lfirst(l);
3151                 newcmds = lappend(newcmds, newcmd);
3152         }
3153
3154         /* Update statement's commands list */
3155         stmt->cmds = newcmds;
3156
3157         qry = makeNode(Query);
3158         qry->commandType = CMD_UTILITY;
3159         qry->utilityStmt = (Node *) stmt;
3160
3161         *extras_before = list_concat(*extras_before, cxt.blist);
3162         *extras_after = list_concat(cxt.alist, *extras_after);
3163
3164         return qry;
3165 }
3166
3167 static Query *
3168 transformDeclareCursorStmt(ParseState *pstate, DeclareCursorStmt *stmt)
3169 {
3170         Query      *result = makeNode(Query);
3171         List       *extras_before = NIL,
3172                            *extras_after = NIL;
3173
3174         result->commandType = CMD_UTILITY;
3175         result->utilityStmt = (Node *) stmt;
3176
3177         /*
3178          * Don't allow both SCROLL and NO SCROLL to be specified
3179          */
3180         if ((stmt->options & CURSOR_OPT_SCROLL) &&
3181                 (stmt->options & CURSOR_OPT_NO_SCROLL))
3182                 ereport(ERROR,
3183                                 (errcode(ERRCODE_INVALID_CURSOR_DEFINITION),
3184                                  errmsg("cannot specify both SCROLL and NO SCROLL")));
3185
3186         stmt->query = (Node *) transformStmt(pstate, stmt->query,
3187                                                                                  &extras_before, &extras_after);
3188
3189         /* Shouldn't get any extras, since grammar only allows SelectStmt */
3190         if (extras_before || extras_after)
3191                 elog(ERROR, "unexpected extra stuff in cursor statement");
3192         if (!IsA(stmt->query, Query) ||
3193                 ((Query *) stmt->query)->commandType != CMD_SELECT)
3194                 elog(ERROR, "unexpected non-SELECT command in cursor statement");
3195
3196         /* But we must explicitly disallow DECLARE CURSOR ... SELECT INTO */
3197         if (((Query *) stmt->query)->into)
3198                 ereport(ERROR,
3199                                 (errcode(ERRCODE_INVALID_CURSOR_DEFINITION),
3200                                  errmsg("DECLARE CURSOR may not specify INTO")));
3201
3202         return result;
3203 }
3204
3205
3206 static Query *
3207 transformPrepareStmt(ParseState *pstate, PrepareStmt *stmt)
3208 {
3209         Query      *result = makeNode(Query);
3210         List       *argtype_oids;       /* argtype OIDs in a list */
3211         Oid                *argtoids = NULL;    /* and as an array */
3212         int                     nargs;
3213         List       *queries;
3214         int                     i;
3215
3216         result->commandType = CMD_UTILITY;
3217         result->utilityStmt = (Node *) stmt;
3218
3219         /* Transform list of TypeNames to list (and array) of type OIDs */
3220         nargs = list_length(stmt->argtypes);
3221
3222         if (nargs)
3223         {
3224                 ListCell   *l;
3225
3226                 argtoids = (Oid *) palloc(nargs * sizeof(Oid));
3227                 i = 0;
3228
3229                 foreach(l, stmt->argtypes)
3230                 {
3231                         TypeName   *tn = lfirst(l);
3232                         Oid                     toid = typenameTypeId(pstate, tn);
3233
3234                         argtoids[i++] = toid;
3235                 }
3236         }
3237
3238         /*
3239          * Analyze the statement using these parameter types (any parameters
3240          * passed in from above us will not be visible to it), allowing
3241          * information about unknown parameters to be deduced from context.
3242          */
3243         queries = parse_analyze_varparams((Node *) stmt->query,
3244                                                                           pstate->p_sourcetext,
3245                                                                           &argtoids, &nargs);
3246
3247         /*
3248          * Shouldn't get any extra statements, since grammar only allows
3249          * OptimizableStmt
3250          */
3251         if (list_length(queries) != 1)
3252                 elog(ERROR, "unexpected extra stuff in prepared statement");
3253
3254         /*
3255          * Check that all parameter types were determined, and convert the array
3256          * of OIDs into a list for storage.
3257          */
3258         argtype_oids = NIL;
3259         for (i = 0; i < nargs; i++)
3260         {
3261                 Oid                     argtype = argtoids[i];
3262
3263                 if (argtype == InvalidOid || argtype == UNKNOWNOID)
3264                         ereport(ERROR,
3265                                         (errcode(ERRCODE_INDETERMINATE_DATATYPE),
3266                                          errmsg("could not determine data type of parameter $%d",
3267                                                         i + 1)));
3268
3269                 argtype_oids = lappend_oid(argtype_oids, argtype);
3270         }
3271
3272         stmt->argtype_oids = argtype_oids;
3273         stmt->query = linitial(queries);
3274         return result;
3275 }
3276
3277 static Query *
3278 transformExecuteStmt(ParseState *pstate, ExecuteStmt *stmt)
3279 {
3280         Query      *result = makeNode(Query);
3281         List       *paramtypes;
3282
3283         result->commandType = CMD_UTILITY;
3284         result->utilityStmt = (Node *) stmt;
3285
3286         paramtypes = FetchPreparedStatementParams(stmt->name);
3287
3288         if (stmt->params || paramtypes)
3289         {
3290                 int                     nparams = list_length(stmt->params);
3291                 int                     nexpected = list_length(paramtypes);
3292                 ListCell   *l,
3293                                    *l2;
3294                 int                     i = 1;
3295
3296                 if (nparams != nexpected)
3297                         ereport(ERROR,
3298                                         (errcode(ERRCODE_SYNTAX_ERROR),
3299                         errmsg("wrong number of parameters for prepared statement \"%s\"",
3300                                    stmt->name),
3301                                          errdetail("Expected %d parameters but got %d.",
3302                                                            nexpected, nparams)));
3303
3304                 forboth(l, stmt->params, l2, paramtypes)
3305                 {
3306                         Node       *expr = lfirst(l);
3307                         Oid                     expected_type_id = lfirst_oid(l2);
3308                         Oid                     given_type_id;
3309
3310                         expr = transformExpr(pstate, expr);
3311
3312                         /* Cannot contain subselects or aggregates */
3313                         if (pstate->p_hasSubLinks)
3314                                 ereport(ERROR,
3315                                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3316                                                  errmsg("cannot use subquery in EXECUTE parameter")));
3317                         if (pstate->p_hasAggs)
3318                                 ereport(ERROR,
3319                                                 (errcode(ERRCODE_GROUPING_ERROR),
3320                                                  errmsg("cannot use aggregate function in EXECUTE parameter")));
3321
3322                         given_type_id = exprType(expr);
3323
3324                         expr = coerce_to_target_type(pstate, expr, given_type_id,
3325                                                                                  expected_type_id, -1,
3326                                                                                  COERCION_ASSIGNMENT,
3327                                                                                  COERCE_IMPLICIT_CAST);
3328
3329                         if (expr == NULL)
3330                                 ereport(ERROR,
3331                                                 (errcode(ERRCODE_DATATYPE_MISMATCH),
3332                                                  errmsg("parameter $%d of type %s cannot be coerced to the expected type %s",
3333                                                                 i,
3334                                                                 format_type_be(given_type_id),
3335                                                                 format_type_be(expected_type_id)),
3336                                 errhint("You will need to rewrite or cast the expression.")));
3337
3338                         lfirst(l) = expr;
3339                         i++;
3340                 }
3341         }
3342
3343         return result;
3344 }
3345
3346 /* exported so planner can check again after rewriting, query pullup, etc */
3347 void
3348 CheckSelectLocking(Query *qry)
3349 {
3350         if (qry->setOperations)
3351                 ereport(ERROR,
3352                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3353                                  errmsg("SELECT FOR UPDATE/SHARE is not allowed with UNION/INTERSECT/EXCEPT")));
3354         if (qry->distinctClause != NIL)
3355                 ereport(ERROR,
3356                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3357                                  errmsg("SELECT FOR UPDATE/SHARE is not allowed with DISTINCT clause")));
3358         if (qry->groupClause != NIL)
3359                 ereport(ERROR,
3360                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3361                                  errmsg("SELECT FOR UPDATE/SHARE is not allowed with GROUP BY clause")));
3362         if (qry->havingQual != NULL)
3363                 ereport(ERROR,
3364                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3365                 errmsg("SELECT FOR UPDATE/SHARE is not allowed with HAVING clause")));
3366         if (qry->hasAggs)
3367                 ereport(ERROR,
3368                                 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3369                                  errmsg("SELECT FOR UPDATE/SHARE is not allowed with aggregate functions")));
3370 }
3371
3372 /*
3373  * Transform a FOR UPDATE/SHARE clause
3374  *
3375  * This basically involves replacing names by integer relids.
3376  *
3377  * NB: if you need to change this, see also markQueryForLocking()
3378  * in rewriteHandler.c.
3379  */
3380 static void
3381 transformLockingClause(Query *qry, LockingClause *lc)
3382 {
3383         List       *lockedRels = lc->lockedRels;
3384         ListCell   *l;
3385         ListCell   *rt;
3386         Index           i;
3387         LockingClause *allrels;
3388
3389         CheckSelectLocking(qry);
3390
3391         /* make a clause we can pass down to subqueries to select all rels */
3392         allrels = makeNode(LockingClause);
3393         allrels->lockedRels = NIL;      /* indicates all rels */
3394         allrels->forUpdate = lc->forUpdate;
3395         allrels->noWait = lc->noWait;
3396
3397         if (lockedRels == NIL)
3398         {
3399                 /* all regular tables used in query */
3400                 i = 0;
3401                 foreach(rt, qry->rtable)
3402                 {
3403                         RangeTblEntry *rte = (RangeTblEntry *) lfirst(rt);
3404
3405                         ++i;
3406                         switch (rte->rtekind)
3407                         {
3408                                 case RTE_RELATION:
3409                                         applyLockingClause(qry, i, lc->forUpdate, lc->noWait);
3410                                         rte->requiredPerms |= ACL_SELECT_FOR_UPDATE;
3411                                         break;
3412                                 case RTE_SUBQUERY:
3413
3414                                         /*
3415                                          * FOR UPDATE/SHARE of subquery is propagated to all of
3416                                          * subquery's rels
3417                                          */
3418                                         transformLockingClause(rte->subquery, allrels);
3419                                         break;
3420                                 default:
3421                                         /* ignore JOIN, SPECIAL, FUNCTION RTEs */
3422                                         break;
3423                         }
3424                 }
3425         }
3426         else
3427         {
3428                 /* just the named tables */
3429                 foreach(l, lockedRels)
3430                 {
3431                         char       *relname = strVal(lfirst(l));
3432
3433                         i = 0;
3434                         foreach(rt, qry->rtable)
3435                         {
3436                                 RangeTblEntry *rte = (RangeTblEntry *) lfirst(rt);
3437
3438                                 ++i;
3439                                 if (strcmp(rte->eref->aliasname, relname) == 0)
3440                                 {
3441                                         switch (rte->rtekind)
3442                                         {
3443                                                 case RTE_RELATION:
3444                                                         applyLockingClause(qry, i,
3445                                                                                            lc->forUpdate, lc->noWait);
3446                                                         rte->requiredPerms |= ACL_SELECT_FOR_UPDATE;
3447                                                         break;
3448                                                 case RTE_SUBQUERY:
3449
3450                                                         /*
3451                                                          * FOR UPDATE/SHARE of subquery is propagated to
3452                                                          * all of subquery's rels
3453                                                          */
3454                                                         transformLockingClause(rte->subquery, allrels);
3455                                                         break;
3456                                                 case RTE_JOIN:
3457                                                         ereport(ERROR,
3458                                                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3459                                                                          errmsg("SELECT FOR UPDATE/SHARE cannot be applied to a join")));
3460                                                         break;
3461                                                 case RTE_SPECIAL:
3462                                                         ereport(ERROR,
3463                                                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3464                                                                          errmsg("SELECT FOR UPDATE/SHARE cannot be applied to NEW or OLD")));
3465                                                         break;
3466                                                 case RTE_FUNCTION:
3467                                                         ereport(ERROR,
3468                                                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3469                                                                          errmsg("SELECT FOR UPDATE/SHARE cannot be applied to a function")));
3470                                                         break;
3471                                                 case RTE_VALUES:
3472                                                         ereport(ERROR,
3473                                                                         (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3474                                                                          errmsg("SELECT FOR UPDATE/SHARE cannot be applied to VALUES")));
3475                                                         break;
3476                                                 default:
3477                                                         elog(ERROR, "unrecognized RTE type: %d",
3478                                                                  (int) rte->rtekind);
3479                                                         break;
3480                                         }
3481                                         break;          /* out of foreach loop */
3482                                 }
3483                         }
3484                         if (rt == NULL)
3485                                 ereport(ERROR,
3486                                                 (errcode(ERRCODE_UNDEFINED_TABLE),
3487                                                  errmsg("relation \"%s\" in FOR UPDATE/SHARE clause not found in FROM clause",
3488                                                                 relname)));
3489                 }
3490         }
3491 }
3492
3493 /*
3494  * Record locking info for a single rangetable item
3495  */
3496 void
3497 applyLockingClause(Query *qry, Index rtindex, bool forUpdate, bool noWait)
3498 {
3499         RowMarkClause *rc;
3500
3501         /* Check for pre-existing entry for same rtindex */
3502         if ((rc = get_rowmark(qry, rtindex)) != NULL)
3503         {
3504                 /*
3505                  * If the same RTE is specified both FOR UPDATE and FOR SHARE, treat
3506                  * it as FOR UPDATE.  (Reasonable, since you can't take both a shared
3507                  * and exclusive lock at the same time; it'll end up being exclusive
3508                  * anyway.)
3509                  *
3510                  * We also consider that NOWAIT wins if it's specified both ways. This
3511                  * is a bit more debatable but raising an error doesn't seem helpful.
3512                  * (Consider for instance SELECT FOR UPDATE NOWAIT from a view that
3513                  * internally contains a plain FOR UPDATE spec.)
3514                  */
3515                 rc->forUpdate |= forUpdate;
3516                 rc->noWait |= noWait;
3517                 return;
3518         }
3519
3520         /* Make a new RowMarkClause */
3521         rc = makeNode(RowMarkClause);
3522         rc->rti = rtindex;
3523         rc->forUpdate = forUpdate;
3524         rc->noWait = noWait;
3525         qry->rowMarks = lappend(qry->rowMarks, rc);
3526 }
3527
3528
3529 /*
3530  * Preprocess a list of column constraint clauses
3531  * to attach constraint attributes to their primary constraint nodes
3532  * and detect inconsistent/misplaced constraint attributes.
3533  *
3534  * NOTE: currently, attributes are only supported for FOREIGN KEY primary
3535  * constraints, but someday they ought to be supported for other constraints.
3536  */
3537 static void
3538 transformConstraintAttrs(List *constraintList)
3539 {
3540         Node       *lastprimarynode = NULL;
3541         bool            saw_deferrability = false;
3542         bool            saw_initially = false;
3543         ListCell   *clist;
3544
3545         foreach(clist, constraintList)
3546         {
3547                 Node       *node = lfirst(clist);
3548
3549                 if (!IsA(node, Constraint))
3550                 {
3551                         lastprimarynode = node;
3552                         /* reset flags for new primary node */
3553                         saw_deferrability = false;
3554                         saw_initially = false;
3555                 }
3556                 else
3557                 {
3558                         Constraint *con = (Constraint *) node;
3559
3560                         switch (con->contype)
3561                         {
3562                                 case CONSTR_ATTR_DEFERRABLE:
3563                                         if (lastprimarynode == NULL ||
3564                                                 !IsA(lastprimarynode, FkConstraint))
3565                                                 ereport(ERROR,
3566                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3567                                                                  errmsg("misplaced DEFERRABLE clause")));
3568                                         if (saw_deferrability)
3569                                                 ereport(ERROR,
3570                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3571                                                                  errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed")));
3572                                         saw_deferrability = true;
3573                                         ((FkConstraint *) lastprimarynode)->deferrable = true;
3574                                         break;
3575                                 case CONSTR_ATTR_NOT_DEFERRABLE:
3576                                         if (lastprimarynode == NULL ||
3577                                                 !IsA(lastprimarynode, FkConstraint))
3578                                                 ereport(ERROR,
3579                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3580                                                                  errmsg("misplaced NOT DEFERRABLE clause")));
3581                                         if (saw_deferrability)
3582                                                 ereport(ERROR,
3583                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3584                                                                  errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed")));
3585                                         saw_deferrability = true;
3586                                         ((FkConstraint *) lastprimarynode)->deferrable = false;
3587                                         if (saw_initially &&
3588                                                 ((FkConstraint *) lastprimarynode)->initdeferred)
3589                                                 ereport(ERROR,
3590                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3591                                                                  errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE")));
3592                                         break;
3593                                 case CONSTR_ATTR_DEFERRED:
3594                                         if (lastprimarynode == NULL ||
3595                                                 !IsA(lastprimarynode, FkConstraint))
3596                                                 ereport(ERROR,
3597                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3598                                                          errmsg("misplaced INITIALLY DEFERRED clause")));
3599                                         if (saw_initially)
3600                                                 ereport(ERROR,
3601                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3602                                                                  errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed")));
3603                                         saw_initially = true;
3604                                         ((FkConstraint *) lastprimarynode)->initdeferred = true;
3605
3606                                         /*
3607                                          * If only INITIALLY DEFERRED appears, assume DEFERRABLE
3608                                          */
3609                                         if (!saw_deferrability)
3610                                                 ((FkConstraint *) lastprimarynode)->deferrable = true;
3611                                         else if (!((FkConstraint *) lastprimarynode)->deferrable)
3612                                                 ereport(ERROR,
3613                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3614                                                                  errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE")));
3615                                         break;
3616                                 case CONSTR_ATTR_IMMEDIATE:
3617                                         if (lastprimarynode == NULL ||
3618                                                 !IsA(lastprimarynode, FkConstraint))
3619                                                 ereport(ERROR,
3620                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3621                                                         errmsg("misplaced INITIALLY IMMEDIATE clause")));
3622                                         if (saw_initially)
3623                                                 ereport(ERROR,
3624                                                                 (errcode(ERRCODE_SYNTAX_ERROR),
3625                                                                  errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed")));
3626                                         saw_initially = true;
3627                                         ((FkConstraint *) lastprimarynode)->initdeferred = false;
3628                                         break;
3629                                 default:
3630                                         /* Otherwise it's not an attribute */
3631                                         lastprimarynode = node;
3632                                         /* reset flags for new primary node */
3633                                         saw_deferrability = false;
3634                                         saw_initially = false;
3635                                         break;
3636                         }
3637                 }
3638         }
3639 }
3640
3641 /* Build a FromExpr node */
3642 static FromExpr *
3643 makeFromExpr(List *fromlist, Node *quals)
3644 {
3645         FromExpr   *f = makeNode(FromExpr);
3646
3647         f->fromlist = fromlist;
3648         f->quals = quals;
3649         return f;
3650 }
3651
3652 /*
3653  * Special handling of type definition for a column
3654  */
3655 static void
3656 transformColumnType(ParseState *pstate, ColumnDef *column)
3657 {
3658         /*
3659          * All we really need to do here is verify that the type is valid.
3660          */
3661         Type            ctype = typenameType(pstate, column->typename);
3662
3663         ReleaseSysCache(ctype);
3664 }
3665
3666 static void
3667 setSchemaName(char *context_schema, char **stmt_schema_name)
3668 {
3669         if (*stmt_schema_name == NULL)
3670                 *stmt_schema_name = context_schema;
3671         else if (strcmp(context_schema, *stmt_schema_name) != 0)
3672                 ereport(ERROR,
3673                                 (errcode(ERRCODE_INVALID_SCHEMA_DEFINITION),
3674                                  errmsg("CREATE specifies a schema (%s) "
3675                                                 "different from the one being created (%s)",
3676                                                 *stmt_schema_name, context_schema)));
3677 }
3678
3679 /*
3680  * analyzeCreateSchemaStmt -
3681  *        analyzes the "create schema" statement
3682  *
3683  * Split the schema element list into individual commands and place
3684  * them in the result list in an order such that there are no forward
3685  * references (e.g. GRANT to a table created later in the list). Note
3686  * that the logic we use for determining forward references is
3687  * presently quite incomplete.
3688  *
3689  * SQL92 also allows constraints to make forward references, so thumb through
3690  * the table columns and move forward references to a posterior alter-table
3691  * command.
3692  *
3693  * The result is a list of parse nodes that still need to be analyzed ---
3694  * but we can't analyze the later commands until we've executed the earlier
3695  * ones, because of possible inter-object references.
3696  *
3697  * Note: Called from commands/schemacmds.c
3698  */
3699 List *
3700 analyzeCreateSchemaStmt(CreateSchemaStmt *stmt)
3701 {
3702         CreateSchemaStmtContext cxt;
3703         List       *result;
3704         ListCell   *elements;
3705
3706         cxt.stmtType = "CREATE SCHEMA";
3707         cxt.schemaname = stmt->schemaname;
3708         cxt.authid = stmt->authid;
3709         cxt.sequences = NIL;
3710         cxt.tables = NIL;
3711         cxt.views = NIL;
3712         cxt.indexes = NIL;
3713         cxt.grants = NIL;
3714         cxt.triggers = NIL;
3715         cxt.fwconstraints = NIL;
3716         cxt.alters = NIL;
3717         cxt.blist = NIL;
3718         cxt.alist = NIL;
3719
3720         /*
3721          * Run through each schema element in the schema element list. Separate
3722          * statements by type, and do preliminary analysis.
3723          */
3724         foreach(elements, stmt->schemaElts)
3725         {
3726                 Node       *element = lfirst(elements);
3727
3728                 switch (nodeTag(element))
3729                 {
3730                         case T_CreateSeqStmt:
3731                                 {
3732                                         CreateSeqStmt *elp = (CreateSeqStmt *) element;
3733
3734                                         setSchemaName(cxt.schemaname, &elp->sequence->schemaname);
3735                                         cxt.sequences = lappend(cxt.sequences, element);
3736                                 }
3737                                 break;
3738
3739                         case T_CreateStmt:
3740                                 {
3741                                         CreateStmt *elp = (CreateStmt *) element;
3742
3743                                         setSchemaName(cxt.schemaname, &elp->relation->schemaname);
3744
3745                                         /*
3746                                          * XXX todo: deal with constraints
3747                                          */
3748                                         cxt.tables = lappend(cxt.tables, element);
3749                                 }
3750                                 break;
3751
3752                         case T_ViewStmt:
3753                                 {
3754                                         ViewStmt   *elp = (ViewStmt *) element;
3755
3756                                         setSchemaName(cxt.schemaname, &elp->view->schemaname);
3757
3758                                         /*
3759                                          * XXX todo: deal with references between views
3760                                          */
3761                                         cxt.views = lappend(cxt.views, element);
3762                                 }
3763                                 break;
3764
3765                         case T_IndexStmt:
3766                                 {
3767                                         IndexStmt  *elp = (IndexStmt *) element;
3768
3769                                         setSchemaName(cxt.schemaname, &elp->relation->schemaname);
3770                                         cxt.indexes = lappend(cxt.indexes, element);
3771                                 }
3772                                 break;
3773
3774                         case T_CreateTrigStmt:
3775                                 {
3776                                         CreateTrigStmt *elp = (CreateTrigStmt *) element;
3777
3778                                         setSchemaName(cxt.schemaname, &elp->relation->schemaname);
3779                                         cxt.triggers = lappend(cxt.triggers, element);
3780                                 }
3781                                 break;
3782
3783                         case T_GrantStmt:
3784                                 cxt.grants = lappend(cxt.grants, element);
3785                                 break;
3786
3787                         default:
3788                                 elog(ERROR, "unrecognized node type: %d",
3789                                          (int) nodeTag(element));
3790                 }
3791         }
3792
3793         result = NIL;
3794         result = list_concat(result, cxt.sequences);
3795         result = list_concat(result, cxt.tables);
3796         result = list_concat(result, cxt.views);
3797         result = list_concat(result, cxt.indexes);
3798         result = list_concat(result, cxt.triggers);
3799         result = list_concat(result, cxt.grants);
3800
3801         return result;
3802 }
3803
3804 /*
3805  * Traverse a fully-analyzed tree to verify that parameter symbols
3806  * match their types.  We need this because some Params might still
3807  * be UNKNOWN, if there wasn't anything to force their coercion,
3808  * and yet other instances seen later might have gotten coerced.
3809  */
3810 static bool
3811 check_parameter_resolution_walker(Node *node,
3812                                                                   check_parameter_resolution_context *context)
3813 {
3814         if (node == NULL)
3815                 return false;
3816         if (IsA(node, Param))
3817         {
3818                 Param      *param = (Param *) node;
3819
3820                 if (param->paramkind == PARAM_EXTERN)
3821                 {
3822                         int                     paramno = param->paramid;
3823
3824                         if (paramno <= 0 || /* shouldn't happen, but... */
3825                                 paramno > context->numParams)
3826                                 ereport(ERROR,
3827                                                 (errcode(ERRCODE_UNDEFINED_PARAMETER),
3828                                                  errmsg("there is no parameter $%d", paramno)));
3829
3830                         if (param->paramtype != context->paramTypes[paramno - 1])
3831                                 ereport(ERROR,
3832                                                 (errcode(ERRCODE_AMBIGUOUS_PARAMETER),
3833                                          errmsg("could not determine data type of parameter $%d",
3834                                                         paramno)));
3835                 }
3836                 return false;
3837         }
3838         if (IsA(node, Query))
3839         {
3840                 /* Recurse into RTE subquery or not-yet-planned sublink subquery */
3841                 return query_tree_walker((Query *) node,
3842                                                                  check_parameter_resolution_walker,
3843                                                                  (void *) context, 0);
3844         }
3845         return expression_tree_walker(node, check_parameter_resolution_walker,
3846                                                                   (void *) context);
3847 }