Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * parse_utilcmd.c
4 : * Perform parse analysis work for various utility commands
5 : *
6 : * Formerly we did this work during parse_analyze_*() in analyze.c. However
7 : * that is fairly unsafe in the presence of querytree caching, since any
8 : * database state that we depend on in making the transformations might be
9 : * obsolete by the time the utility command is executed; and utility commands
10 : * have no infrastructure for holding locks or rechecking plan validity.
11 : * Hence these functions are now called at the start of execution of their
12 : * respective utility commands.
13 : *
14 : *
15 : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
16 : * Portions Copyright (c) 1994, Regents of the University of California
17 : *
18 : * src/backend/parser/parse_utilcmd.c
19 : *
20 : *-------------------------------------------------------------------------
21 : */
22 :
23 : #include "postgres.h"
24 :
25 : #include "access/amapi.h"
26 : #include "access/htup_details.h"
27 : #include "access/relation.h"
28 : #include "access/reloptions.h"
29 : #include "access/table.h"
30 : #include "access/toast_compression.h"
31 : #include "catalog/dependency.h"
32 : #include "catalog/heap.h"
33 : #include "catalog/index.h"
34 : #include "catalog/namespace.h"
35 : #include "catalog/partition.h"
36 : #include "catalog/pg_am.h"
37 : #include "catalog/pg_collation.h"
38 : #include "catalog/pg_constraint.h"
39 : #include "catalog/pg_opclass.h"
40 : #include "catalog/pg_operator.h"
41 : #include "catalog/pg_statistic_ext.h"
42 : #include "catalog/pg_type.h"
43 : #include "commands/comment.h"
44 : #include "commands/defrem.h"
45 : #include "commands/sequence.h"
46 : #include "commands/tablecmds.h"
47 : #include "commands/tablespace.h"
48 : #include "miscadmin.h"
49 : #include "nodes/makefuncs.h"
50 : #include "nodes/nodeFuncs.h"
51 : #include "optimizer/optimizer.h"
52 : #include "parser/analyze.h"
53 : #include "parser/parse_clause.h"
54 : #include "parser/parse_coerce.h"
55 : #include "parser/parse_collate.h"
56 : #include "parser/parse_expr.h"
57 : #include "parser/parse_relation.h"
58 : #include "parser/parse_target.h"
59 : #include "parser/parse_type.h"
60 : #include "parser/parse_utilcmd.h"
61 : #include "parser/parser.h"
62 : #include "partitioning/partbounds.h"
63 : #include "partitioning/partdesc.h"
64 : #include "rewrite/rewriteManip.h"
65 : #include "utils/acl.h"
66 : #include "utils/builtins.h"
67 : #include "utils/lsyscache.h"
68 : #include "utils/partcache.h"
69 : #include "utils/rel.h"
70 : #include "utils/ruleutils.h"
71 : #include "utils/syscache.h"
72 : #include "utils/typcache.h"
73 :
74 :
75 : /* State shared by transformCreateStmt and its subroutines */
76 : typedef struct
77 : {
78 : ParseState *pstate; /* overall parser state */
79 : const char *stmtType; /* "CREATE [FOREIGN] TABLE" or "ALTER TABLE" */
80 : RangeVar *relation; /* relation to create */
81 : Relation rel; /* opened/locked rel, if ALTER */
82 : List *inhRelations; /* relations to inherit from */
83 : bool isforeign; /* true if CREATE/ALTER FOREIGN TABLE */
84 : bool isalter; /* true if altering existing table */
85 : List *columns; /* ColumnDef items */
86 : List *ckconstraints; /* CHECK constraints */
87 : List *nnconstraints; /* NOT NULL constraints */
88 : List *fkconstraints; /* FOREIGN KEY constraints */
89 : List *ixconstraints; /* index-creating constraints */
90 : List *likeclauses; /* LIKE clauses that need post-processing */
91 : List *blist; /* "before list" of things to do before
92 : * creating the table */
93 : List *alist; /* "after list" of things to do after creating
94 : * the table */
95 : IndexStmt *pkey; /* PRIMARY KEY index, if any */
96 : bool ispartitioned; /* true if table is partitioned */
97 : PartitionBoundSpec *partbound; /* transformed FOR VALUES */
98 : bool ofType; /* true if statement contains OF typename */
99 : } CreateStmtContext;
100 :
101 : /* State shared by transformCreateSchemaStmtElements and its subroutines */
102 : typedef struct
103 : {
104 : const char *schemaname; /* name of schema */
105 : List *sequences; /* CREATE SEQUENCE items */
106 : List *tables; /* CREATE TABLE items */
107 : List *views; /* CREATE VIEW items */
108 : List *indexes; /* CREATE INDEX items */
109 : List *triggers; /* CREATE TRIGGER items */
110 : List *grants; /* GRANT items */
111 : } CreateSchemaStmtContext;
112 :
113 :
114 : static void transformColumnDefinition(CreateStmtContext *cxt,
115 : ColumnDef *column);
116 : static void transformTableConstraint(CreateStmtContext *cxt,
117 : Constraint *constraint);
118 : static void transformTableLikeClause(CreateStmtContext *cxt,
119 : TableLikeClause *table_like_clause);
120 : static void transformOfType(CreateStmtContext *cxt,
121 : TypeName *ofTypename);
122 : static CreateStatsStmt *generateClonedExtStatsStmt(RangeVar *heapRel,
123 : Oid heapRelid,
124 : Oid source_statsid,
125 : const AttrMap *attmap);
126 : static List *get_collation(Oid collation, Oid actual_datatype);
127 : static List *get_opclass(Oid opclass, Oid actual_datatype);
128 : static void transformIndexConstraints(CreateStmtContext *cxt);
129 : static IndexStmt *transformIndexConstraint(Constraint *constraint,
130 : CreateStmtContext *cxt);
131 : static void transformFKConstraints(CreateStmtContext *cxt,
132 : bool skipValidation,
133 : bool isAddConstraint);
134 : static void transformCheckConstraints(CreateStmtContext *cxt,
135 : bool skipValidation);
136 : static void transformConstraintAttrs(CreateStmtContext *cxt,
137 : List *constraintList);
138 : static void transformColumnType(CreateStmtContext *cxt, ColumnDef *column);
139 : static void setSchemaName(const char *context_schema, char **stmt_schema_name);
140 : static void transformPartitionCmd(CreateStmtContext *cxt, PartitionBoundSpec *bound);
141 : static List *transformPartitionRangeBounds(ParseState *pstate, List *blist,
142 : Relation parent);
143 : static void validateInfiniteBounds(ParseState *pstate, List *blist);
144 : static Const *transformPartitionBoundValue(ParseState *pstate, Node *val,
145 : const char *colName, Oid colType, int32 colTypmod,
146 : Oid partCollation);
147 :
148 :
149 : /*
150 : * transformCreateStmt -
151 : * parse analysis for CREATE TABLE
152 : *
153 : * Returns a List of utility commands to be done in sequence. One of these
154 : * will be the transformed CreateStmt, but there may be additional actions
155 : * to be done before and after the actual DefineRelation() call.
156 : * In addition to normal utility commands such as AlterTableStmt and
157 : * IndexStmt, the result list may contain TableLikeClause(s), representing
158 : * the need to perform additional parse analysis after DefineRelation().
159 : *
160 : * SQL allows constraints to be scattered all over, so thumb through
161 : * the columns and collect all constraints into one place.
162 : * If there are any implied indices (e.g. UNIQUE or PRIMARY KEY)
163 : * then expand those into multiple IndexStmt blocks.
164 : * - thomas 1997-12-02
165 : */
166 : List *
167 40530 : transformCreateStmt(CreateStmt *stmt, const char *queryString)
168 : {
169 : ParseState *pstate;
170 : CreateStmtContext cxt;
171 : List *result;
172 : List *save_alist;
173 : ListCell *elements;
174 : Oid namespaceid;
175 : Oid existing_relid;
176 : ParseCallbackState pcbstate;
177 :
178 : /* Set up pstate */
179 40530 : pstate = make_parsestate(NULL);
180 40530 : pstate->p_sourcetext = queryString;
181 :
182 : /*
183 : * Look up the creation namespace. This also checks permissions on the
184 : * target namespace, locks it against concurrent drops, checks for a
185 : * preexisting relation in that namespace with the same name, and updates
186 : * stmt->relation->relpersistence if the selected namespace is temporary.
187 : */
188 40530 : setup_parser_errposition_callback(&pcbstate, pstate,
189 40530 : stmt->relation->location);
190 : namespaceid =
191 40530 : RangeVarGetAndCheckCreationNamespace(stmt->relation, NoLock,
192 : &existing_relid);
193 40518 : cancel_parser_errposition_callback(&pcbstate);
194 :
195 : /*
196 : * If the relation already exists and the user specified "IF NOT EXISTS",
197 : * bail out with a NOTICE.
198 : */
199 40518 : if (stmt->if_not_exists && OidIsValid(existing_relid))
200 : {
201 : /*
202 : * If we are in an extension script, insist that the pre-existing
203 : * object be a member of the extension, to avoid security risks.
204 : */
205 : ObjectAddress address;
206 :
207 10 : ObjectAddressSet(address, RelationRelationId, existing_relid);
208 10 : checkMembershipInCurrentExtension(&address);
209 :
210 : /* OK to skip */
211 8 : ereport(NOTICE,
212 : (errcode(ERRCODE_DUPLICATE_TABLE),
213 : errmsg("relation \"%s\" already exists, skipping",
214 : stmt->relation->relname)));
215 8 : return NIL;
216 : }
217 :
218 : /*
219 : * If the target relation name isn't schema-qualified, make it so. This
220 : * prevents some corner cases in which added-on rewritten commands might
221 : * think they should apply to other relations that have the same name and
222 : * are earlier in the search path. But a local temp table is effectively
223 : * specified to be in pg_temp, so no need for anything extra in that case.
224 : */
225 40508 : if (stmt->relation->schemaname == NULL
226 37162 : && stmt->relation->relpersistence != RELPERSISTENCE_TEMP)
227 34656 : stmt->relation->schemaname = get_namespace_name(namespaceid);
228 :
229 : /* Set up CreateStmtContext */
230 40508 : cxt.pstate = pstate;
231 40508 : if (IsA(stmt, CreateForeignTableStmt))
232 : {
233 510 : cxt.stmtType = "CREATE FOREIGN TABLE";
234 510 : cxt.isforeign = true;
235 : }
236 : else
237 : {
238 39998 : cxt.stmtType = "CREATE TABLE";
239 39998 : cxt.isforeign = false;
240 : }
241 40508 : cxt.relation = stmt->relation;
242 40508 : cxt.rel = NULL;
243 40508 : cxt.inhRelations = stmt->inhRelations;
244 40508 : cxt.isalter = false;
245 40508 : cxt.columns = NIL;
246 40508 : cxt.ckconstraints = NIL;
247 40508 : cxt.nnconstraints = NIL;
248 40508 : cxt.fkconstraints = NIL;
249 40508 : cxt.ixconstraints = NIL;
250 40508 : cxt.likeclauses = NIL;
251 40508 : cxt.blist = NIL;
252 40508 : cxt.alist = NIL;
253 40508 : cxt.pkey = NULL;
254 40508 : cxt.ispartitioned = stmt->partspec != NULL;
255 40508 : cxt.partbound = stmt->partbound;
256 40508 : cxt.ofType = (stmt->ofTypename != NULL);
257 :
258 : Assert(!stmt->ofTypename || !stmt->inhRelations); /* grammar enforces */
259 :
260 40508 : if (stmt->ofTypename)
261 122 : transformOfType(&cxt, stmt->ofTypename);
262 :
263 40490 : if (stmt->partspec)
264 : {
265 5594 : if (stmt->inhRelations && !stmt->partbound)
266 6 : ereport(ERROR,
267 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
268 : errmsg("cannot create partitioned table as inheritance child")));
269 : }
270 :
271 : /*
272 : * Run through each primary element in the table creation clause. Separate
273 : * column defs from constraints, and do preliminary analysis.
274 : */
275 112020 : foreach(elements, stmt->tableElts)
276 : {
277 71778 : Node *element = lfirst(elements);
278 :
279 71778 : switch (nodeTag(element))
280 : {
281 68152 : case T_ColumnDef:
282 68152 : transformColumnDefinition(&cxt, (ColumnDef *) element);
283 67934 : break;
284 :
285 2840 : case T_Constraint:
286 2840 : transformTableConstraint(&cxt, (Constraint *) element);
287 2828 : break;
288 :
289 786 : case T_TableLikeClause:
290 786 : transformTableLikeClause(&cxt, (TableLikeClause *) element);
291 774 : break;
292 :
293 0 : default:
294 0 : elog(ERROR, "unrecognized node type: %d",
295 : (int) nodeTag(element));
296 : break;
297 : }
298 : }
299 :
300 : /*
301 : * Transfer anything we already have in cxt.alist into save_alist, to keep
302 : * it separate from the output of transformIndexConstraints. (This may
303 : * not be necessary anymore, but we'll keep doing it to preserve the
304 : * historical order of execution of the alist commands.)
305 : */
306 40242 : save_alist = cxt.alist;
307 40242 : cxt.alist = NIL;
308 :
309 : Assert(stmt->constraints == NIL);
310 :
311 : /*
312 : * Before processing index constraints, which could include a primary key,
313 : * we must scan all not-null constraints to propagate the is_not_null flag
314 : * to each corresponding ColumnDef. This is necessary because table-level
315 : * not-null constraints have not been marked in each ColumnDef, and the PK
316 : * processing code needs to know whether one constraint has already been
317 : * declared in order not to declare a redundant one.
318 : */
319 92824 : foreach_node(Constraint, nn, cxt.nnconstraints)
320 : {
321 12340 : char *colname = strVal(linitial(nn->keys));
322 :
323 29014 : foreach_node(ColumnDef, cd, cxt.columns)
324 : {
325 : /* not our column? */
326 16650 : if (strcmp(cd->colname, colname) != 0)
327 4334 : continue;
328 : /* Already marked not-null? Nothing to do */
329 12316 : if (cd->is_not_null)
330 11816 : break;
331 : /* Bingo, we're done for this constraint */
332 500 : cd->is_not_null = true;
333 500 : break;
334 : }
335 : }
336 :
337 : /*
338 : * Postprocess constraints that give rise to index definitions.
339 : */
340 40242 : transformIndexConstraints(&cxt);
341 :
342 : /*
343 : * Re-consideration of LIKE clauses should happen after creation of
344 : * indexes, but before creation of foreign keys. This order is critical
345 : * because a LIKE clause may attempt to create a primary key. If there's
346 : * also a pkey in the main CREATE TABLE list, creation of that will not
347 : * check for a duplicate at runtime (since index_check_primary_key()
348 : * expects that we rejected dups here). Creation of the LIKE-generated
349 : * pkey behaves like ALTER TABLE ADD, so it will check, but obviously that
350 : * only works if it happens second. On the other hand, we want to make
351 : * pkeys before foreign key constraints, in case the user tries to make a
352 : * self-referential FK.
353 : */
354 40200 : cxt.alist = list_concat(cxt.alist, cxt.likeclauses);
355 :
356 : /*
357 : * Postprocess foreign-key constraints.
358 : */
359 40200 : transformFKConstraints(&cxt, true, false);
360 :
361 : /*
362 : * Postprocess check constraints.
363 : *
364 : * For regular tables all constraints can be marked valid immediately,
365 : * because the table is new therefore empty. Not so for foreign tables.
366 : */
367 40200 : transformCheckConstraints(&cxt, !cxt.isforeign);
368 :
369 : /*
370 : * Output results.
371 : */
372 40200 : stmt->tableElts = cxt.columns;
373 40200 : stmt->constraints = cxt.ckconstraints;
374 40200 : stmt->nnconstraints = cxt.nnconstraints;
375 :
376 40200 : result = lappend(cxt.blist, stmt);
377 40200 : result = list_concat(result, cxt.alist);
378 40200 : result = list_concat(result, save_alist);
379 :
380 40200 : return result;
381 : }
382 :
383 : /*
384 : * generateSerialExtraStmts
385 : * Generate CREATE SEQUENCE and ALTER SEQUENCE ... OWNED BY statements
386 : * to create the sequence for a serial or identity column.
387 : *
388 : * This includes determining the name the sequence will have. The caller
389 : * can ask to get back the name components by passing non-null pointers
390 : * for snamespace_p and sname_p.
391 : */
392 : static void
393 1376 : generateSerialExtraStmts(CreateStmtContext *cxt, ColumnDef *column,
394 : Oid seqtypid, List *seqoptions,
395 : bool for_identity, bool col_exists,
396 : char **snamespace_p, char **sname_p)
397 : {
398 : ListCell *option;
399 1376 : DefElem *nameEl = NULL;
400 1376 : DefElem *loggedEl = NULL;
401 : Oid snamespaceid;
402 : char *snamespace;
403 : char *sname;
404 : char seqpersistence;
405 : CreateSeqStmt *seqstmt;
406 : AlterSeqStmt *altseqstmt;
407 : List *attnamelist;
408 :
409 : /* Make a copy of this as we may end up modifying it in the code below */
410 1376 : seqoptions = list_copy(seqoptions);
411 :
412 : /*
413 : * Check for non-SQL-standard options (not supported within CREATE
414 : * SEQUENCE, because they'd be redundant), and remove them from the
415 : * seqoptions list if found.
416 : */
417 1752 : foreach(option, seqoptions)
418 : {
419 376 : DefElem *defel = lfirst_node(DefElem, option);
420 :
421 376 : if (strcmp(defel->defname, "sequence_name") == 0)
422 : {
423 44 : if (nameEl)
424 0 : errorConflictingDefElem(defel, cxt->pstate);
425 44 : nameEl = defel;
426 44 : seqoptions = foreach_delete_current(seqoptions, option);
427 : }
428 332 : else if (strcmp(defel->defname, "logged") == 0 ||
429 330 : strcmp(defel->defname, "unlogged") == 0)
430 : {
431 4 : if (loggedEl)
432 0 : errorConflictingDefElem(defel, cxt->pstate);
433 4 : loggedEl = defel;
434 4 : seqoptions = foreach_delete_current(seqoptions, option);
435 : }
436 : }
437 :
438 : /*
439 : * Determine namespace and name to use for the sequence.
440 : */
441 1376 : if (nameEl)
442 : {
443 : /* Use specified name */
444 44 : RangeVar *rv = makeRangeVarFromNameList(castNode(List, nameEl->arg));
445 :
446 44 : snamespace = rv->schemaname;
447 44 : if (!snamespace)
448 : {
449 : /* Given unqualified SEQUENCE NAME, select namespace */
450 0 : if (cxt->rel)
451 0 : snamespaceid = RelationGetNamespace(cxt->rel);
452 : else
453 0 : snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
454 0 : snamespace = get_namespace_name(snamespaceid);
455 : }
456 44 : sname = rv->relname;
457 : }
458 : else
459 : {
460 : /*
461 : * Generate a name.
462 : *
463 : * Although we use ChooseRelationName, it's not guaranteed that the
464 : * selected sequence name won't conflict; given sufficiently long
465 : * field names, two different serial columns in the same table could
466 : * be assigned the same sequence name, and we'd not notice since we
467 : * aren't creating the sequence quite yet. In practice this seems
468 : * quite unlikely to be a problem, especially since few people would
469 : * need two serial columns in one table.
470 : */
471 1332 : if (cxt->rel)
472 208 : snamespaceid = RelationGetNamespace(cxt->rel);
473 : else
474 : {
475 1124 : snamespaceid = RangeVarGetCreationNamespace(cxt->relation);
476 1124 : RangeVarAdjustRelationPersistence(cxt->relation, snamespaceid);
477 : }
478 1332 : snamespace = get_namespace_name(snamespaceid);
479 1332 : sname = ChooseRelationName(cxt->relation->relname,
480 1332 : column->colname,
481 : "seq",
482 : snamespaceid,
483 : false);
484 : }
485 :
486 1376 : ereport(DEBUG1,
487 : (errmsg_internal("%s will create implicit sequence \"%s\" for serial column \"%s.%s\"",
488 : cxt->stmtType, sname,
489 : cxt->relation->relname, column->colname)));
490 :
491 : /*
492 : * Determine the persistence of the sequence. By default we copy the
493 : * persistence of the table, but if LOGGED or UNLOGGED was specified, use
494 : * that (as long as the table isn't TEMP).
495 : *
496 : * For CREATE TABLE, we get the persistence from cxt->relation, which
497 : * comes from the CreateStmt in progress. For ALTER TABLE, the parser
498 : * won't set cxt->relation->relpersistence, but we have cxt->rel as the
499 : * existing table, so we copy the persistence from there.
500 : */
501 1376 : seqpersistence = cxt->rel ? cxt->rel->rd_rel->relpersistence : cxt->relation->relpersistence;
502 1376 : if (loggedEl)
503 : {
504 4 : if (seqpersistence == RELPERSISTENCE_TEMP)
505 0 : ereport(ERROR,
506 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
507 : errmsg("cannot set logged status of a temporary sequence"),
508 : parser_errposition(cxt->pstate, loggedEl->location)));
509 4 : else if (strcmp(loggedEl->defname, "logged") == 0)
510 2 : seqpersistence = RELPERSISTENCE_PERMANENT;
511 : else
512 2 : seqpersistence = RELPERSISTENCE_UNLOGGED;
513 : }
514 :
515 : /*
516 : * Build a CREATE SEQUENCE command to create the sequence object, and add
517 : * it to the list of things to be done before this CREATE/ALTER TABLE.
518 : */
519 1376 : seqstmt = makeNode(CreateSeqStmt);
520 1376 : seqstmt->for_identity = for_identity;
521 1376 : seqstmt->sequence = makeRangeVar(snamespace, sname, -1);
522 1376 : seqstmt->sequence->relpersistence = seqpersistence;
523 1376 : seqstmt->options = seqoptions;
524 :
525 : /*
526 : * If a sequence data type was specified, add it to the options. Prepend
527 : * to the list rather than append; in case a user supplied their own AS
528 : * clause, the "redundant options" error will point to their occurrence,
529 : * not our synthetic one.
530 : */
531 1376 : if (seqtypid)
532 1364 : seqstmt->options = lcons(makeDefElem("as",
533 1364 : (Node *) makeTypeNameFromOid(seqtypid, -1),
534 : -1),
535 : seqstmt->options);
536 :
537 : /*
538 : * If this is ALTER ADD COLUMN, make sure the sequence will be owned by
539 : * the table's owner. The current user might be someone else (perhaps a
540 : * superuser, or someone who's only a member of the owning role), but the
541 : * SEQUENCE OWNED BY mechanisms will bleat unless table and sequence have
542 : * exactly the same owning role.
543 : */
544 1376 : if (cxt->rel)
545 252 : seqstmt->ownerId = cxt->rel->rd_rel->relowner;
546 : else
547 1124 : seqstmt->ownerId = InvalidOid;
548 :
549 1376 : cxt->blist = lappend(cxt->blist, seqstmt);
550 :
551 : /*
552 : * Store the identity sequence name that we decided on. ALTER TABLE ...
553 : * ADD COLUMN ... IDENTITY needs this so that it can fill the new column
554 : * with values from the sequence, while the association of the sequence
555 : * with the table is not set until after the ALTER TABLE.
556 : */
557 1376 : column->identitySequence = seqstmt->sequence;
558 :
559 : /*
560 : * Build an ALTER SEQUENCE ... OWNED BY command to mark the sequence as
561 : * owned by this column, and add it to the appropriate list of things to
562 : * be done along with this CREATE/ALTER TABLE. In a CREATE or ALTER ADD
563 : * COLUMN, it must be done after the statement because we don't know the
564 : * column's attnum yet. But if we do have the attnum (in AT_AddIdentity),
565 : * we can do the marking immediately, which improves some ALTER TABLE
566 : * behaviors.
567 : */
568 1376 : altseqstmt = makeNode(AlterSeqStmt);
569 1376 : altseqstmt->sequence = makeRangeVar(snamespace, sname, -1);
570 1376 : attnamelist = list_make3(makeString(snamespace),
571 : makeString(cxt->relation->relname),
572 : makeString(column->colname));
573 1376 : altseqstmt->options = list_make1(makeDefElem("owned_by",
574 : (Node *) attnamelist, -1));
575 1376 : altseqstmt->for_identity = for_identity;
576 :
577 1376 : if (col_exists)
578 166 : cxt->blist = lappend(cxt->blist, altseqstmt);
579 : else
580 1210 : cxt->alist = lappend(cxt->alist, altseqstmt);
581 :
582 1376 : if (snamespace_p)
583 866 : *snamespace_p = snamespace;
584 1376 : if (sname_p)
585 866 : *sname_p = sname;
586 1376 : }
587 :
588 : /*
589 : * transformColumnDefinition -
590 : * transform a single ColumnDef within CREATE TABLE
591 : * Also used in ALTER TABLE ADD COLUMN
592 : */
593 : static void
594 70228 : transformColumnDefinition(CreateStmtContext *cxt, ColumnDef *column)
595 : {
596 : bool is_serial;
597 : bool saw_nullable;
598 : bool saw_default;
599 : bool saw_identity;
600 : bool saw_generated;
601 70228 : bool need_notnull = false;
602 70228 : bool disallow_noinherit_notnull = false;
603 70228 : Constraint *notnull_constraint = NULL;
604 :
605 70228 : cxt->columns = lappend(cxt->columns, column);
606 :
607 : /* Check for SERIAL pseudo-types */
608 70228 : is_serial = false;
609 70228 : if (column->typeName
610 69870 : && list_length(column->typeName->names) == 1
611 29416 : && !column->typeName->pct_type)
612 : {
613 29416 : char *typname = strVal(linitial(column->typeName->names));
614 :
615 29416 : if (strcmp(typname, "smallserial") == 0 ||
616 29408 : strcmp(typname, "serial2") == 0)
617 : {
618 14 : is_serial = true;
619 14 : column->typeName->names = NIL;
620 14 : column->typeName->typeOid = INT2OID;
621 : }
622 29402 : else if (strcmp(typname, "serial") == 0 ||
623 28572 : strcmp(typname, "serial4") == 0)
624 : {
625 830 : is_serial = true;
626 830 : column->typeName->names = NIL;
627 830 : column->typeName->typeOid = INT4OID;
628 : }
629 28572 : else if (strcmp(typname, "bigserial") == 0 ||
630 28562 : strcmp(typname, "serial8") == 0)
631 : {
632 22 : is_serial = true;
633 22 : column->typeName->names = NIL;
634 22 : column->typeName->typeOid = INT8OID;
635 : }
636 :
637 : /*
638 : * We have to reject "serial[]" explicitly, because once we've set
639 : * typeid, LookupTypeName won't notice arrayBounds. We don't need any
640 : * special coding for serial(typmod) though.
641 : */
642 29416 : if (is_serial && column->typeName->arrayBounds != NIL)
643 0 : ereport(ERROR,
644 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
645 : errmsg("array of serial is not implemented"),
646 : parser_errposition(cxt->pstate,
647 : column->typeName->location)));
648 : }
649 :
650 : /* Do necessary work on the column type declaration */
651 70228 : if (column->typeName)
652 69870 : transformColumnType(cxt, column);
653 :
654 : /* Special actions for SERIAL pseudo-types */
655 70190 : if (is_serial)
656 : {
657 : char *snamespace;
658 : char *sname;
659 : char *qstring;
660 : A_Const *snamenode;
661 : TypeCast *castnode;
662 : FuncCall *funccallnode;
663 : Constraint *constraint;
664 :
665 866 : generateSerialExtraStmts(cxt, column,
666 866 : column->typeName->typeOid, NIL,
667 : false, false,
668 : &snamespace, &sname);
669 :
670 : /*
671 : * Create appropriate constraints for SERIAL. We do this in full,
672 : * rather than shortcutting, so that we will detect any conflicting
673 : * constraints the user wrote (like a different DEFAULT).
674 : *
675 : * Create an expression tree representing the function call
676 : * nextval('sequencename'). We cannot reduce the raw tree to cooked
677 : * form until after the sequence is created, but there's no need to do
678 : * so.
679 : */
680 866 : qstring = quote_qualified_identifier(snamespace, sname);
681 866 : snamenode = makeNode(A_Const);
682 866 : snamenode->val.node.type = T_String;
683 866 : snamenode->val.sval.sval = qstring;
684 866 : snamenode->location = -1;
685 866 : castnode = makeNode(TypeCast);
686 866 : castnode->typeName = SystemTypeName("regclass");
687 866 : castnode->arg = (Node *) snamenode;
688 866 : castnode->location = -1;
689 866 : funccallnode = makeFuncCall(SystemFuncName("nextval"),
690 866 : list_make1(castnode),
691 : COERCE_EXPLICIT_CALL,
692 : -1);
693 866 : constraint = makeNode(Constraint);
694 866 : constraint->contype = CONSTR_DEFAULT;
695 866 : constraint->location = -1;
696 866 : constraint->raw_expr = (Node *) funccallnode;
697 866 : constraint->cooked_expr = NULL;
698 866 : column->constraints = lappend(column->constraints, constraint);
699 :
700 : /* have a not-null constraint added later */
701 866 : need_notnull = true;
702 866 : disallow_noinherit_notnull = true;
703 : }
704 :
705 : /* Process column constraints, if any... */
706 70190 : transformConstraintAttrs(cxt, column->constraints);
707 :
708 : /*
709 : * First, scan the column's constraints to see if a not-null constraint
710 : * that we add must be prevented from being NO INHERIT. This should be
711 : * enforced only for PRIMARY KEY, not IDENTITY or SERIAL. However, if the
712 : * not-null constraint is specified as a table constraint rather than as a
713 : * column constraint, AddRelationNotNullConstraints would raise an error
714 : * if a NO INHERIT mismatch is found. To avoid inconsistently disallowing
715 : * it in the table constraint case but not the column constraint case, we
716 : * disallow it here as well. Maybe AddRelationNotNullConstraints can be
717 : * improved someday, so that it doesn't complain, and then we can remove
718 : * the restriction for SERIAL and IDENTITY here as well.
719 : */
720 70166 : if (!disallow_noinherit_notnull)
721 : {
722 156634 : foreach_node(Constraint, constraint, column->constraints)
723 : {
724 18034 : switch (constraint->contype)
725 : {
726 5836 : case CONSTR_IDENTITY:
727 : case CONSTR_PRIMARY:
728 5836 : disallow_noinherit_notnull = true;
729 5836 : break;
730 12198 : default:
731 12198 : break;
732 : }
733 : }
734 : }
735 :
736 : /* Now scan them again to do full processing */
737 70166 : saw_nullable = false;
738 70166 : saw_default = false;
739 70166 : saw_identity = false;
740 70166 : saw_generated = false;
741 :
742 159500 : foreach_node(Constraint, constraint, column->constraints)
743 : {
744 19492 : switch (constraint->contype)
745 : {
746 24 : case CONSTR_NULL:
747 24 : if ((saw_nullable && column->is_not_null) || need_notnull)
748 6 : ereport(ERROR,
749 : (errcode(ERRCODE_SYNTAX_ERROR),
750 : errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
751 : column->colname, cxt->relation->relname),
752 : parser_errposition(cxt->pstate,
753 : constraint->location)));
754 18 : column->is_not_null = false;
755 18 : saw_nullable = true;
756 18 : break;
757 :
758 6792 : case CONSTR_NOTNULL:
759 6792 : if (cxt->ispartitioned && constraint->is_no_inherit)
760 6 : ereport(ERROR,
761 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
762 : errmsg("not-null constraints on partitioned tables cannot be NO INHERIT"));
763 :
764 : /* Disallow conflicting [NOT] NULL markings */
765 6786 : if (saw_nullable && !column->is_not_null)
766 0 : ereport(ERROR,
767 : (errcode(ERRCODE_SYNTAX_ERROR),
768 : errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
769 : column->colname, cxt->relation->relname),
770 : parser_errposition(cxt->pstate,
771 : constraint->location)));
772 :
773 6786 : if (disallow_noinherit_notnull && constraint->is_no_inherit)
774 30 : ereport(ERROR,
775 : errcode(ERRCODE_SYNTAX_ERROR),
776 : errmsg("conflicting NO INHERIT declarations for not-null constraints on column \"%s\"",
777 : column->colname));
778 :
779 : /*
780 : * If this is the first time we see this column being marked
781 : * not-null, add the constraint entry and keep track of it.
782 : * Also, remove previous markings that we need one.
783 : *
784 : * If this is a redundant not-null specification, just check
785 : * that it doesn't conflict with what was specified earlier.
786 : *
787 : * Any conflicts with table constraints will be further
788 : * checked in AddRelationNotNullConstraints().
789 : */
790 6756 : if (!column->is_not_null)
791 : {
792 6732 : column->is_not_null = true;
793 6732 : saw_nullable = true;
794 6732 : need_notnull = false;
795 :
796 6732 : constraint->keys = list_make1(makeString(column->colname));
797 6732 : notnull_constraint = constraint;
798 6732 : cxt->nnconstraints = lappend(cxt->nnconstraints, constraint);
799 : }
800 24 : else if (notnull_constraint)
801 : {
802 24 : if (constraint->conname &&
803 18 : notnull_constraint->conname &&
804 12 : strcmp(notnull_constraint->conname, constraint->conname) != 0)
805 6 : elog(ERROR, "conflicting not-null constraint names \"%s\" and \"%s\"",
806 : notnull_constraint->conname, constraint->conname);
807 :
808 18 : if (notnull_constraint->is_no_inherit != constraint->is_no_inherit)
809 0 : ereport(ERROR,
810 : errcode(ERRCODE_SYNTAX_ERROR),
811 : errmsg("conflicting NO INHERIT declarations for not-null constraints on column \"%s\"",
812 : column->colname));
813 :
814 18 : if (!notnull_constraint->conname && constraint->conname)
815 6 : notnull_constraint->conname = constraint->conname;
816 : }
817 :
818 6750 : break;
819 :
820 2566 : case CONSTR_DEFAULT:
821 2566 : if (saw_default)
822 0 : ereport(ERROR,
823 : (errcode(ERRCODE_SYNTAX_ERROR),
824 : errmsg("multiple default values specified for column \"%s\" of table \"%s\"",
825 : column->colname, cxt->relation->relname),
826 : parser_errposition(cxt->pstate,
827 : constraint->location)));
828 2566 : column->raw_default = constraint->raw_expr;
829 : Assert(constraint->cooked_expr == NULL);
830 2566 : saw_default = true;
831 2566 : break;
832 :
833 368 : case CONSTR_IDENTITY:
834 : {
835 : Type ctype;
836 : Oid typeOid;
837 :
838 368 : if (cxt->ofType)
839 6 : ereport(ERROR,
840 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
841 : errmsg("identity columns are not supported on typed tables")));
842 362 : if (cxt->partbound)
843 24 : ereport(ERROR,
844 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
845 : errmsg("identity columns are not supported on partitions")));
846 :
847 338 : ctype = typenameType(cxt->pstate, column->typeName, NULL);
848 338 : typeOid = ((Form_pg_type) GETSTRUCT(ctype))->oid;
849 338 : ReleaseSysCache(ctype);
850 :
851 338 : if (saw_identity)
852 6 : ereport(ERROR,
853 : (errcode(ERRCODE_SYNTAX_ERROR),
854 : errmsg("multiple identity specifications for column \"%s\" of table \"%s\"",
855 : column->colname, cxt->relation->relname),
856 : parser_errposition(cxt->pstate,
857 : constraint->location)));
858 :
859 332 : generateSerialExtraStmts(cxt, column,
860 : typeOid, constraint->options,
861 : true, false,
862 : NULL, NULL);
863 :
864 332 : column->identity = constraint->generated_when;
865 332 : saw_identity = true;
866 :
867 : /*
868 : * Identity columns are always NOT NULL, but we may have a
869 : * constraint already.
870 : */
871 332 : if (!saw_nullable)
872 308 : need_notnull = true;
873 24 : else if (!column->is_not_null)
874 6 : ereport(ERROR,
875 : (errcode(ERRCODE_SYNTAX_ERROR),
876 : errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
877 : column->colname, cxt->relation->relname),
878 : parser_errposition(cxt->pstate,
879 : constraint->location)));
880 326 : break;
881 : }
882 :
883 1860 : case CONSTR_GENERATED:
884 1860 : if (cxt->ofType)
885 12 : ereport(ERROR,
886 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
887 : errmsg("generated columns are not supported on typed tables")));
888 1848 : if (saw_generated)
889 12 : ereport(ERROR,
890 : (errcode(ERRCODE_SYNTAX_ERROR),
891 : errmsg("multiple generation clauses specified for column \"%s\" of table \"%s\"",
892 : column->colname, cxt->relation->relname),
893 : parser_errposition(cxt->pstate,
894 : constraint->location)));
895 1836 : column->generated = constraint->generated_kind;
896 1836 : column->raw_default = constraint->raw_expr;
897 : Assert(constraint->cooked_expr == NULL);
898 1836 : saw_generated = true;
899 1836 : break;
900 :
901 514 : case CONSTR_CHECK:
902 514 : cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
903 514 : break;
904 :
905 5924 : case CONSTR_PRIMARY:
906 5924 : if (saw_nullable && !column->is_not_null)
907 0 : ereport(ERROR,
908 : (errcode(ERRCODE_SYNTAX_ERROR),
909 : errmsg("conflicting NULL/NOT NULL declarations for column \"%s\" of table \"%s\"",
910 : column->colname, cxt->relation->relname),
911 : parser_errposition(cxt->pstate,
912 : constraint->location)));
913 5924 : need_notnull = true;
914 :
915 5924 : if (cxt->isforeign)
916 6 : ereport(ERROR,
917 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
918 : errmsg("primary key constraints are not supported on foreign tables"),
919 : parser_errposition(cxt->pstate,
920 : constraint->location)));
921 : /* FALL THRU */
922 :
923 : case CONSTR_UNIQUE:
924 6292 : if (cxt->isforeign)
925 0 : ereport(ERROR,
926 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
927 : errmsg("unique constraints are not supported on foreign tables"),
928 : parser_errposition(cxt->pstate,
929 : constraint->location)));
930 6292 : if (constraint->keys == NIL)
931 6292 : constraint->keys = list_make1(makeString(column->colname));
932 6292 : cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
933 6292 : break;
934 :
935 0 : case CONSTR_EXCLUSION:
936 : /* grammar does not allow EXCLUDE as a column constraint */
937 0 : elog(ERROR, "column exclusion constraints are not supported");
938 : break;
939 :
940 834 : case CONSTR_FOREIGN:
941 834 : if (cxt->isforeign)
942 6 : ereport(ERROR,
943 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
944 : errmsg("foreign key constraints are not supported on foreign tables"),
945 : parser_errposition(cxt->pstate,
946 : constraint->location)));
947 :
948 : /*
949 : * Fill in the current attribute's name and throw it into the
950 : * list of FK constraints to be processed later.
951 : */
952 828 : constraint->fk_attrs = list_make1(makeString(column->colname));
953 828 : cxt->fkconstraints = lappend(cxt->fkconstraints, constraint);
954 828 : break;
955 :
956 236 : case CONSTR_ATTR_DEFERRABLE:
957 : case CONSTR_ATTR_NOT_DEFERRABLE:
958 : case CONSTR_ATTR_DEFERRED:
959 : case CONSTR_ATTR_IMMEDIATE:
960 : case CONSTR_ATTR_ENFORCED:
961 : case CONSTR_ATTR_NOT_ENFORCED:
962 : /* transformConstraintAttrs took care of these */
963 236 : break;
964 :
965 0 : default:
966 0 : elog(ERROR, "unrecognized constraint type: %d",
967 : constraint->contype);
968 : break;
969 : }
970 :
971 19366 : if (saw_default && saw_identity)
972 12 : ereport(ERROR,
973 : (errcode(ERRCODE_SYNTAX_ERROR),
974 : errmsg("both default and identity specified for column \"%s\" of table \"%s\"",
975 : column->colname, cxt->relation->relname),
976 : parser_errposition(cxt->pstate,
977 : constraint->location)));
978 :
979 19354 : if (saw_default && saw_generated)
980 12 : ereport(ERROR,
981 : (errcode(ERRCODE_SYNTAX_ERROR),
982 : errmsg("both default and generation expression specified for column \"%s\" of table \"%s\"",
983 : column->colname, cxt->relation->relname),
984 : parser_errposition(cxt->pstate,
985 : constraint->location)));
986 :
987 19342 : if (saw_identity && saw_generated)
988 12 : ereport(ERROR,
989 : (errcode(ERRCODE_SYNTAX_ERROR),
990 : errmsg("both identity and generation expression specified for column \"%s\" of table \"%s\"",
991 : column->colname, cxt->relation->relname),
992 : parser_errposition(cxt->pstate,
993 : constraint->location)));
994 : }
995 :
996 : /*
997 : * If we need a not-null constraint for PRIMARY KEY, SERIAL or IDENTITY,
998 : * and one was not explicitly specified, add one now.
999 : */
1000 70004 : if (need_notnull && !(saw_nullable && column->is_not_null))
1001 : {
1002 5366 : column->is_not_null = true;
1003 5366 : notnull_constraint = makeNotNullConstraint(makeString(column->colname));
1004 5366 : cxt->nnconstraints = lappend(cxt->nnconstraints, notnull_constraint);
1005 : }
1006 :
1007 : /*
1008 : * If needed, generate ALTER FOREIGN TABLE ALTER COLUMN statement to add
1009 : * per-column foreign data wrapper options to this column after creation.
1010 : */
1011 70004 : if (column->fdwoptions != NIL)
1012 : {
1013 : AlterTableStmt *stmt;
1014 : AlterTableCmd *cmd;
1015 :
1016 160 : cmd = makeNode(AlterTableCmd);
1017 160 : cmd->subtype = AT_AlterColumnGenericOptions;
1018 160 : cmd->name = column->colname;
1019 160 : cmd->def = (Node *) column->fdwoptions;
1020 160 : cmd->behavior = DROP_RESTRICT;
1021 160 : cmd->missing_ok = false;
1022 :
1023 160 : stmt = makeNode(AlterTableStmt);
1024 160 : stmt->relation = cxt->relation;
1025 160 : stmt->cmds = NIL;
1026 160 : stmt->objtype = OBJECT_FOREIGN_TABLE;
1027 160 : stmt->cmds = lappend(stmt->cmds, cmd);
1028 :
1029 160 : cxt->alist = lappend(cxt->alist, stmt);
1030 : }
1031 70004 : }
1032 :
1033 : /*
1034 : * transformTableConstraint
1035 : * transform a Constraint node within CREATE TABLE or ALTER TABLE
1036 : */
1037 : static void
1038 19778 : transformTableConstraint(CreateStmtContext *cxt, Constraint *constraint)
1039 : {
1040 19778 : switch (constraint->contype)
1041 : {
1042 8280 : case CONSTR_PRIMARY:
1043 8280 : if (cxt->isforeign)
1044 6 : ereport(ERROR,
1045 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1046 : errmsg("primary key constraints are not supported on foreign tables"),
1047 : parser_errposition(cxt->pstate,
1048 : constraint->location)));
1049 8274 : cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
1050 8274 : break;
1051 :
1052 5334 : case CONSTR_UNIQUE:
1053 5334 : if (cxt->isforeign)
1054 6 : ereport(ERROR,
1055 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1056 : errmsg("unique constraints are not supported on foreign tables"),
1057 : parser_errposition(cxt->pstate,
1058 : constraint->location)));
1059 5328 : cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
1060 5328 : break;
1061 :
1062 234 : case CONSTR_EXCLUSION:
1063 234 : if (cxt->isforeign)
1064 0 : ereport(ERROR,
1065 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1066 : errmsg("exclusion constraints are not supported on foreign tables"),
1067 : parser_errposition(cxt->pstate,
1068 : constraint->location)));
1069 234 : cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
1070 234 : break;
1071 :
1072 1472 : case CONSTR_CHECK:
1073 1472 : cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
1074 1472 : break;
1075 :
1076 1102 : case CONSTR_NOTNULL:
1077 1102 : if (cxt->ispartitioned && constraint->is_no_inherit)
1078 6 : ereport(ERROR,
1079 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1080 : errmsg("not-null constraints on partitioned tables cannot be NO INHERIT"));
1081 :
1082 1096 : cxt->nnconstraints = lappend(cxt->nnconstraints, constraint);
1083 1096 : break;
1084 :
1085 3356 : case CONSTR_FOREIGN:
1086 3356 : if (cxt->isforeign)
1087 0 : ereport(ERROR,
1088 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1089 : errmsg("foreign key constraints are not supported on foreign tables"),
1090 : parser_errposition(cxt->pstate,
1091 : constraint->location)));
1092 3356 : cxt->fkconstraints = lappend(cxt->fkconstraints, constraint);
1093 3356 : break;
1094 :
1095 0 : case CONSTR_NULL:
1096 : case CONSTR_DEFAULT:
1097 : case CONSTR_ATTR_DEFERRABLE:
1098 : case CONSTR_ATTR_NOT_DEFERRABLE:
1099 : case CONSTR_ATTR_DEFERRED:
1100 : case CONSTR_ATTR_IMMEDIATE:
1101 : case CONSTR_ATTR_ENFORCED:
1102 : case CONSTR_ATTR_NOT_ENFORCED:
1103 0 : elog(ERROR, "invalid context for constraint type %d",
1104 : constraint->contype);
1105 : break;
1106 :
1107 0 : default:
1108 0 : elog(ERROR, "unrecognized constraint type: %d",
1109 : constraint->contype);
1110 : break;
1111 : }
1112 19760 : }
1113 :
1114 : /*
1115 : * transformTableLikeClause
1116 : *
1117 : * Change the LIKE <srctable> portion of a CREATE TABLE statement into
1118 : * column definitions that recreate the user defined column portions of
1119 : * <srctable>. Also, if there are any LIKE options that we can't fully
1120 : * process at this point, add the TableLikeClause to cxt->likeclauses, which
1121 : * will cause utility.c to call expandTableLikeClause() after the new
1122 : * table has been created.
1123 : *
1124 : * Some options are ignored. For example, as foreign tables have no storage,
1125 : * these INCLUDING options have no effect: STORAGE, COMPRESSION, IDENTITY
1126 : * and INDEXES. Similarly, INCLUDING INDEXES is ignored from a view.
1127 : */
1128 : static void
1129 786 : transformTableLikeClause(CreateStmtContext *cxt, TableLikeClause *table_like_clause)
1130 : {
1131 : AttrNumber parent_attno;
1132 : Relation relation;
1133 : TupleDesc tupleDesc;
1134 : AclResult aclresult;
1135 : char *comment;
1136 : ParseCallbackState pcbstate;
1137 :
1138 786 : setup_parser_errposition_callback(&pcbstate, cxt->pstate,
1139 786 : table_like_clause->relation->location);
1140 :
1141 : /* Open the relation referenced by the LIKE clause */
1142 786 : relation = relation_openrv(table_like_clause->relation, AccessShareLock);
1143 :
1144 780 : if (relation->rd_rel->relkind != RELKIND_RELATION &&
1145 398 : relation->rd_rel->relkind != RELKIND_VIEW &&
1146 386 : relation->rd_rel->relkind != RELKIND_MATVIEW &&
1147 386 : relation->rd_rel->relkind != RELKIND_COMPOSITE_TYPE &&
1148 380 : relation->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
1149 380 : relation->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
1150 6 : ereport(ERROR,
1151 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1152 : errmsg("relation \"%s\" is invalid in LIKE clause",
1153 : RelationGetRelationName(relation)),
1154 : errdetail_relkind_not_supported(relation->rd_rel->relkind)));
1155 :
1156 774 : cancel_parser_errposition_callback(&pcbstate);
1157 :
1158 : /*
1159 : * Check for privileges
1160 : */
1161 774 : if (relation->rd_rel->relkind == RELKIND_COMPOSITE_TYPE)
1162 : {
1163 6 : aclresult = object_aclcheck(TypeRelationId, relation->rd_rel->reltype, GetUserId(),
1164 : ACL_USAGE);
1165 6 : if (aclresult != ACLCHECK_OK)
1166 0 : aclcheck_error(aclresult, OBJECT_TYPE,
1167 0 : RelationGetRelationName(relation));
1168 : }
1169 : else
1170 : {
1171 768 : aclresult = pg_class_aclcheck(RelationGetRelid(relation), GetUserId(),
1172 : ACL_SELECT);
1173 768 : if (aclresult != ACLCHECK_OK)
1174 0 : aclcheck_error(aclresult, get_relkind_objtype(relation->rd_rel->relkind),
1175 0 : RelationGetRelationName(relation));
1176 : }
1177 :
1178 774 : tupleDesc = RelationGetDescr(relation);
1179 :
1180 : /*
1181 : * Insert the copied attributes into the cxt for the new table definition.
1182 : * We must do this now so that they appear in the table in the relative
1183 : * position where the LIKE clause is, as required by SQL99.
1184 : */
1185 2516 : for (parent_attno = 1; parent_attno <= tupleDesc->natts;
1186 1742 : parent_attno++)
1187 : {
1188 1742 : Form_pg_attribute attribute = TupleDescAttr(tupleDesc,
1189 : parent_attno - 1);
1190 : ColumnDef *def;
1191 :
1192 : /*
1193 : * Ignore dropped columns in the parent.
1194 : */
1195 1742 : if (attribute->attisdropped)
1196 24 : continue;
1197 :
1198 : /*
1199 : * Create a new column definition
1200 : */
1201 1718 : def = makeColumnDef(NameStr(attribute->attname), attribute->atttypid,
1202 : attribute->atttypmod, attribute->attcollation);
1203 :
1204 : /*
1205 : * Add to column list
1206 : */
1207 1718 : cxt->columns = lappend(cxt->columns, def);
1208 :
1209 : /*
1210 : * Although we don't transfer the column's default/generation
1211 : * expression now, we need to mark it GENERATED if appropriate.
1212 : */
1213 1718 : if (attribute->atthasdef && attribute->attgenerated &&
1214 78 : (table_like_clause->options & CREATE_TABLE_LIKE_GENERATED))
1215 48 : def->generated = attribute->attgenerated;
1216 :
1217 : /*
1218 : * Copy identity if requested
1219 : */
1220 1718 : if (attribute->attidentity &&
1221 42 : (table_like_clause->options & CREATE_TABLE_LIKE_IDENTITY) &&
1222 18 : !cxt->isforeign)
1223 : {
1224 : Oid seq_relid;
1225 : List *seq_options;
1226 :
1227 : /*
1228 : * find sequence owned by old column; extract sequence parameters;
1229 : * build new create sequence command
1230 : */
1231 12 : seq_relid = getIdentitySequence(relation, attribute->attnum, false);
1232 12 : seq_options = sequence_options(seq_relid);
1233 12 : generateSerialExtraStmts(cxt, def,
1234 : InvalidOid, seq_options,
1235 : true, false,
1236 : NULL, NULL);
1237 12 : def->identity = attribute->attidentity;
1238 : }
1239 :
1240 : /* Likewise, copy storage if requested */
1241 1718 : if ((table_like_clause->options & CREATE_TABLE_LIKE_STORAGE) &&
1242 198 : !cxt->isforeign)
1243 168 : def->storage = attribute->attstorage;
1244 : else
1245 1550 : def->storage = 0;
1246 :
1247 : /* Likewise, copy compression if requested */
1248 1718 : if ((table_like_clause->options & CREATE_TABLE_LIKE_COMPRESSION) != 0 &&
1249 150 : CompressionMethodIsValid(attribute->attcompression) &&
1250 12 : !cxt->isforeign)
1251 6 : def->compression =
1252 6 : pstrdup(GetCompressionMethodName(attribute->attcompression));
1253 : else
1254 1712 : def->compression = NULL;
1255 :
1256 : /* Likewise, copy comment if requested */
1257 1922 : if ((table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS) &&
1258 204 : (comment = GetComment(attribute->attrelid,
1259 : RelationRelationId,
1260 204 : attribute->attnum)) != NULL)
1261 : {
1262 84 : CommentStmt *stmt = makeNode(CommentStmt);
1263 :
1264 84 : stmt->objtype = OBJECT_COLUMN;
1265 84 : stmt->object = (Node *) list_make3(makeString(cxt->relation->schemaname),
1266 : makeString(cxt->relation->relname),
1267 : makeString(def->colname));
1268 84 : stmt->comment = comment;
1269 :
1270 84 : cxt->alist = lappend(cxt->alist, stmt);
1271 : }
1272 : }
1273 :
1274 : /*
1275 : * Reproduce not-null constraints, if any, by copying them. We do this
1276 : * regardless of options given.
1277 : */
1278 774 : if (tupleDesc->constr && tupleDesc->constr->has_not_null)
1279 : {
1280 : List *lst;
1281 :
1282 338 : lst = RelationGetNotNullConstraints(RelationGetRelid(relation), false,
1283 : true);
1284 338 : cxt->nnconstraints = list_concat(cxt->nnconstraints, lst);
1285 :
1286 : /* Copy comments on not-null constraints */
1287 338 : if (table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS)
1288 : {
1289 222 : foreach_node(Constraint, nnconstr, lst)
1290 : {
1291 90 : if ((comment = GetComment(get_relation_constraint_oid(RelationGetRelid(relation),
1292 90 : nnconstr->conname, false),
1293 : ConstraintRelationId,
1294 : 0)) != NULL)
1295 : {
1296 30 : CommentStmt *stmt = makeNode(CommentStmt);
1297 :
1298 30 : stmt->objtype = OBJECT_TABCONSTRAINT;
1299 30 : stmt->object = (Node *) list_make3(makeString(cxt->relation->schemaname),
1300 : makeString(cxt->relation->relname),
1301 : makeString(nnconstr->conname));
1302 30 : stmt->comment = comment;
1303 30 : cxt->alist = lappend(cxt->alist, stmt);
1304 : }
1305 : }
1306 : }
1307 : }
1308 :
1309 : /*
1310 : * We cannot yet deal with defaults, CHECK constraints, indexes, or
1311 : * statistics, since we don't yet know what column numbers the copied
1312 : * columns will have in the finished table. If any of those options are
1313 : * specified, add the LIKE clause to cxt->likeclauses so that
1314 : * expandTableLikeClause will be called after we do know that.
1315 : *
1316 : * In order for this to work, we remember the relation OID so that
1317 : * expandTableLikeClause is certain to open the same table.
1318 : */
1319 774 : if (table_like_clause->options &
1320 : (CREATE_TABLE_LIKE_DEFAULTS |
1321 : CREATE_TABLE_LIKE_GENERATED |
1322 : CREATE_TABLE_LIKE_CONSTRAINTS |
1323 : CREATE_TABLE_LIKE_INDEXES |
1324 : CREATE_TABLE_LIKE_STATISTICS))
1325 : {
1326 194 : table_like_clause->relationOid = RelationGetRelid(relation);
1327 194 : cxt->likeclauses = lappend(cxt->likeclauses, table_like_clause);
1328 : }
1329 :
1330 : /*
1331 : * Close the parent rel, but keep our AccessShareLock on it until xact
1332 : * commit. That will prevent someone else from deleting or ALTERing the
1333 : * parent before we can run expandTableLikeClause.
1334 : */
1335 774 : table_close(relation, NoLock);
1336 774 : }
1337 :
1338 : /*
1339 : * expandTableLikeClause
1340 : *
1341 : * Process LIKE options that require knowing the final column numbers
1342 : * assigned to the new table's columns. This executes after we have
1343 : * run DefineRelation for the new table. It returns a list of utility
1344 : * commands that should be run to generate indexes etc.
1345 : */
1346 : List *
1347 194 : expandTableLikeClause(RangeVar *heapRel, TableLikeClause *table_like_clause)
1348 : {
1349 194 : List *result = NIL;
1350 194 : List *atsubcmds = NIL;
1351 : AttrNumber parent_attno;
1352 : Relation relation;
1353 : Relation childrel;
1354 : TupleDesc tupleDesc;
1355 : TupleConstr *constr;
1356 : AttrMap *attmap;
1357 : char *comment;
1358 :
1359 : /*
1360 : * Open the relation referenced by the LIKE clause. We should still have
1361 : * the table lock obtained by transformTableLikeClause (and this'll throw
1362 : * an assertion failure if not). Hence, no need to recheck privileges
1363 : * etc. We must open the rel by OID not name, to be sure we get the same
1364 : * table.
1365 : */
1366 194 : if (!OidIsValid(table_like_clause->relationOid))
1367 0 : elog(ERROR, "expandTableLikeClause called on untransformed LIKE clause");
1368 :
1369 194 : relation = relation_open(table_like_clause->relationOid, NoLock);
1370 :
1371 194 : tupleDesc = RelationGetDescr(relation);
1372 194 : constr = tupleDesc->constr;
1373 :
1374 : /*
1375 : * Open the newly-created child relation; we have lock on that too.
1376 : */
1377 194 : childrel = relation_openrv(heapRel, NoLock);
1378 :
1379 : /*
1380 : * Construct a map from the LIKE relation's attnos to the child rel's.
1381 : * This re-checks type match etc, although it shouldn't be possible to
1382 : * have a failure since both tables are locked.
1383 : */
1384 194 : attmap = build_attrmap_by_name(RelationGetDescr(childrel),
1385 : tupleDesc,
1386 : false);
1387 :
1388 : /*
1389 : * Process defaults, if required.
1390 : */
1391 194 : if ((table_like_clause->options &
1392 104 : (CREATE_TABLE_LIKE_DEFAULTS | CREATE_TABLE_LIKE_GENERATED)) &&
1393 : constr != NULL)
1394 : {
1395 350 : for (parent_attno = 1; parent_attno <= tupleDesc->natts;
1396 258 : parent_attno++)
1397 : {
1398 258 : Form_pg_attribute attribute = TupleDescAttr(tupleDesc,
1399 : parent_attno - 1);
1400 :
1401 : /*
1402 : * Ignore dropped columns in the parent.
1403 : */
1404 258 : if (attribute->attisdropped)
1405 12 : continue;
1406 :
1407 : /*
1408 : * Copy default, if present and it should be copied. We have
1409 : * separate options for plain default expressions and GENERATED
1410 : * defaults.
1411 : */
1412 338 : if (attribute->atthasdef &&
1413 92 : (attribute->attgenerated ?
1414 54 : (table_like_clause->options & CREATE_TABLE_LIKE_GENERATED) :
1415 38 : (table_like_clause->options & CREATE_TABLE_LIKE_DEFAULTS)))
1416 : {
1417 : Node *this_default;
1418 : AlterTableCmd *atsubcmd;
1419 : bool found_whole_row;
1420 :
1421 80 : this_default = TupleDescGetDefault(tupleDesc, parent_attno);
1422 80 : if (this_default == NULL)
1423 0 : elog(ERROR, "default expression not found for attribute %d of relation \"%s\"",
1424 : parent_attno, RelationGetRelationName(relation));
1425 :
1426 80 : atsubcmd = makeNode(AlterTableCmd);
1427 80 : atsubcmd->subtype = AT_CookedColumnDefault;
1428 80 : atsubcmd->num = attmap->attnums[parent_attno - 1];
1429 80 : atsubcmd->def = map_variable_attnos(this_default,
1430 : 1, 0,
1431 : attmap,
1432 : InvalidOid,
1433 : &found_whole_row);
1434 :
1435 : /*
1436 : * Prevent this for the same reason as for constraints below.
1437 : * Note that defaults cannot contain any vars, so it's OK that
1438 : * the error message refers to generated columns.
1439 : */
1440 80 : if (found_whole_row)
1441 0 : ereport(ERROR,
1442 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1443 : errmsg("cannot convert whole-row table reference"),
1444 : errdetail("Generation expression for column \"%s\" contains a whole-row reference to table \"%s\".",
1445 : NameStr(attribute->attname),
1446 : RelationGetRelationName(relation))));
1447 :
1448 80 : atsubcmds = lappend(atsubcmds, atsubcmd);
1449 : }
1450 : }
1451 : }
1452 :
1453 : /*
1454 : * Copy CHECK constraints if requested, being careful to adjust attribute
1455 : * numbers so they match the child.
1456 : */
1457 194 : if ((table_like_clause->options & CREATE_TABLE_LIKE_CONSTRAINTS) &&
1458 : constr != NULL)
1459 : {
1460 : int ccnum;
1461 :
1462 252 : for (ccnum = 0; ccnum < constr->num_check; ccnum++)
1463 : {
1464 150 : char *ccname = constr->check[ccnum].ccname;
1465 150 : char *ccbin = constr->check[ccnum].ccbin;
1466 150 : bool ccenforced = constr->check[ccnum].ccenforced;
1467 150 : bool ccnoinherit = constr->check[ccnum].ccnoinherit;
1468 : Node *ccbin_node;
1469 : bool found_whole_row;
1470 : Constraint *n;
1471 : AlterTableCmd *atsubcmd;
1472 :
1473 150 : ccbin_node = map_variable_attnos(stringToNode(ccbin),
1474 : 1, 0,
1475 : attmap,
1476 : InvalidOid, &found_whole_row);
1477 :
1478 : /*
1479 : * We reject whole-row variables because the whole point of LIKE
1480 : * is that the new table's rowtype might later diverge from the
1481 : * parent's. So, while translation might be possible right now,
1482 : * it wouldn't be possible to guarantee it would work in future.
1483 : */
1484 150 : if (found_whole_row)
1485 0 : ereport(ERROR,
1486 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1487 : errmsg("cannot convert whole-row table reference"),
1488 : errdetail("Constraint \"%s\" contains a whole-row reference to table \"%s\".",
1489 : ccname,
1490 : RelationGetRelationName(relation))));
1491 :
1492 150 : n = makeNode(Constraint);
1493 150 : n->contype = CONSTR_CHECK;
1494 150 : n->conname = pstrdup(ccname);
1495 150 : n->location = -1;
1496 150 : n->is_enforced = ccenforced;
1497 150 : n->initially_valid = ccenforced; /* sic */
1498 150 : n->is_no_inherit = ccnoinherit;
1499 150 : n->raw_expr = NULL;
1500 150 : n->cooked_expr = nodeToString(ccbin_node);
1501 :
1502 : /* We can skip validation, since the new table should be empty. */
1503 150 : n->skip_validation = true;
1504 :
1505 150 : atsubcmd = makeNode(AlterTableCmd);
1506 150 : atsubcmd->subtype = AT_AddConstraint;
1507 150 : atsubcmd->def = (Node *) n;
1508 150 : atsubcmds = lappend(atsubcmds, atsubcmd);
1509 :
1510 : /* Copy comment on constraint */
1511 264 : if ((table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS) &&
1512 114 : (comment = GetComment(get_relation_constraint_oid(RelationGetRelid(relation),
1513 114 : n->conname, false),
1514 : ConstraintRelationId,
1515 : 0)) != NULL)
1516 : {
1517 30 : CommentStmt *stmt = makeNode(CommentStmt);
1518 :
1519 30 : stmt->objtype = OBJECT_TABCONSTRAINT;
1520 30 : stmt->object = (Node *) list_make3(makeString(heapRel->schemaname),
1521 : makeString(heapRel->relname),
1522 : makeString(n->conname));
1523 30 : stmt->comment = comment;
1524 :
1525 30 : result = lappend(result, stmt);
1526 : }
1527 : }
1528 : }
1529 :
1530 : /*
1531 : * If we generated any ALTER TABLE actions above, wrap them into a single
1532 : * ALTER TABLE command. Stick it at the front of the result, so it runs
1533 : * before any CommentStmts we made above.
1534 : */
1535 194 : if (atsubcmds)
1536 : {
1537 134 : AlterTableStmt *atcmd = makeNode(AlterTableStmt);
1538 :
1539 134 : atcmd->relation = copyObject(heapRel);
1540 134 : atcmd->cmds = atsubcmds;
1541 134 : atcmd->objtype = OBJECT_TABLE;
1542 134 : atcmd->missing_ok = false;
1543 134 : result = lcons(atcmd, result);
1544 : }
1545 :
1546 : /*
1547 : * Process indexes if required.
1548 : */
1549 194 : if ((table_like_clause->options & CREATE_TABLE_LIKE_INDEXES) &&
1550 110 : relation->rd_rel->relhasindex &&
1551 86 : childrel->rd_rel->relkind != RELKIND_FOREIGN_TABLE)
1552 : {
1553 : List *parent_indexes;
1554 : ListCell *l;
1555 :
1556 80 : parent_indexes = RelationGetIndexList(relation);
1557 :
1558 210 : foreach(l, parent_indexes)
1559 : {
1560 130 : Oid parent_index_oid = lfirst_oid(l);
1561 : Relation parent_index;
1562 : IndexStmt *index_stmt;
1563 :
1564 130 : parent_index = index_open(parent_index_oid, AccessShareLock);
1565 :
1566 : /* Build CREATE INDEX statement to recreate the parent_index */
1567 130 : index_stmt = generateClonedIndexStmt(heapRel,
1568 : parent_index,
1569 : attmap,
1570 : NULL);
1571 :
1572 : /* Copy comment on index, if requested */
1573 130 : if (table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS)
1574 : {
1575 72 : comment = GetComment(parent_index_oid, RelationRelationId, 0);
1576 :
1577 : /*
1578 : * We make use of IndexStmt's idxcomment option, so as not to
1579 : * need to know now what name the index will have.
1580 : */
1581 72 : index_stmt->idxcomment = comment;
1582 : }
1583 :
1584 130 : result = lappend(result, index_stmt);
1585 :
1586 130 : index_close(parent_index, AccessShareLock);
1587 : }
1588 : }
1589 :
1590 : /*
1591 : * Process extended statistics if required.
1592 : */
1593 194 : if (table_like_clause->options & CREATE_TABLE_LIKE_STATISTICS)
1594 : {
1595 : List *parent_extstats;
1596 : ListCell *l;
1597 :
1598 60 : parent_extstats = RelationGetStatExtList(relation);
1599 :
1600 108 : foreach(l, parent_extstats)
1601 : {
1602 48 : Oid parent_stat_oid = lfirst_oid(l);
1603 : CreateStatsStmt *stats_stmt;
1604 :
1605 48 : stats_stmt = generateClonedExtStatsStmt(heapRel,
1606 : RelationGetRelid(childrel),
1607 : parent_stat_oid,
1608 : attmap);
1609 :
1610 : /* Copy comment on statistics object, if requested */
1611 48 : if (table_like_clause->options & CREATE_TABLE_LIKE_COMMENTS)
1612 : {
1613 48 : comment = GetComment(parent_stat_oid, StatisticExtRelationId, 0);
1614 :
1615 : /*
1616 : * We make use of CreateStatsStmt's stxcomment option, so as
1617 : * not to need to know now what name the statistics will have.
1618 : */
1619 48 : stats_stmt->stxcomment = comment;
1620 : }
1621 :
1622 48 : result = lappend(result, stats_stmt);
1623 : }
1624 :
1625 60 : list_free(parent_extstats);
1626 : }
1627 :
1628 : /* Done with child rel */
1629 194 : table_close(childrel, NoLock);
1630 :
1631 : /*
1632 : * Close the parent rel, but keep our AccessShareLock on it until xact
1633 : * commit. That will prevent someone else from deleting or ALTERing the
1634 : * parent before the child is committed.
1635 : */
1636 194 : table_close(relation, NoLock);
1637 :
1638 194 : return result;
1639 : }
1640 :
1641 : static void
1642 122 : transformOfType(CreateStmtContext *cxt, TypeName *ofTypename)
1643 : {
1644 : HeapTuple tuple;
1645 : TupleDesc tupdesc;
1646 : int i;
1647 : Oid ofTypeId;
1648 :
1649 : Assert(ofTypename);
1650 :
1651 122 : tuple = typenameType(cxt->pstate, ofTypename, NULL);
1652 116 : check_of_type(tuple);
1653 104 : ofTypeId = ((Form_pg_type) GETSTRUCT(tuple))->oid;
1654 104 : ofTypename->typeOid = ofTypeId; /* cached for later */
1655 :
1656 104 : tupdesc = lookup_rowtype_tupdesc(ofTypeId, -1);
1657 312 : for (i = 0; i < tupdesc->natts; i++)
1658 : {
1659 208 : Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
1660 : ColumnDef *n;
1661 :
1662 208 : if (attr->attisdropped)
1663 0 : continue;
1664 :
1665 208 : n = makeColumnDef(NameStr(attr->attname), attr->atttypid,
1666 : attr->atttypmod, attr->attcollation);
1667 208 : n->is_from_type = true;
1668 :
1669 208 : cxt->columns = lappend(cxt->columns, n);
1670 : }
1671 104 : ReleaseTupleDesc(tupdesc);
1672 :
1673 104 : ReleaseSysCache(tuple);
1674 104 : }
1675 :
1676 : /*
1677 : * Generate an IndexStmt node using information from an already existing index
1678 : * "source_idx".
1679 : *
1680 : * heapRel is stored into the IndexStmt's relation field, but we don't use it
1681 : * otherwise; some callers pass NULL, if they don't need it to be valid.
1682 : * (The target relation might not exist yet, so we mustn't try to access it.)
1683 : *
1684 : * Attribute numbers in expression Vars are adjusted according to attmap.
1685 : *
1686 : * If constraintOid isn't NULL, we store the OID of any constraint associated
1687 : * with the index there.
1688 : *
1689 : * Unlike transformIndexConstraint, we don't make any effort to force primary
1690 : * key columns to be not-null. The larger cloning process this is part of
1691 : * should have cloned their not-null status separately (and DefineIndex will
1692 : * complain if that fails to happen).
1693 : */
1694 : IndexStmt *
1695 3266 : generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx,
1696 : const AttrMap *attmap,
1697 : Oid *constraintOid)
1698 : {
1699 3266 : Oid source_relid = RelationGetRelid(source_idx);
1700 : HeapTuple ht_idxrel;
1701 : HeapTuple ht_idx;
1702 : HeapTuple ht_am;
1703 : Form_pg_class idxrelrec;
1704 : Form_pg_index idxrec;
1705 : Form_pg_am amrec;
1706 : oidvector *indcollation;
1707 : oidvector *indclass;
1708 : IndexStmt *index;
1709 : List *indexprs;
1710 : ListCell *indexpr_item;
1711 : Oid indrelid;
1712 : int keyno;
1713 : Oid keycoltype;
1714 : Datum datum;
1715 : bool isnull;
1716 :
1717 3266 : if (constraintOid)
1718 2126 : *constraintOid = InvalidOid;
1719 :
1720 : /*
1721 : * Fetch pg_class tuple of source index. We can't use the copy in the
1722 : * relcache entry because it doesn't include optional fields.
1723 : */
1724 3266 : ht_idxrel = SearchSysCache1(RELOID, ObjectIdGetDatum(source_relid));
1725 3266 : if (!HeapTupleIsValid(ht_idxrel))
1726 0 : elog(ERROR, "cache lookup failed for relation %u", source_relid);
1727 3266 : idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
1728 :
1729 : /* Fetch pg_index tuple for source index from relcache entry */
1730 3266 : ht_idx = source_idx->rd_indextuple;
1731 3266 : idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
1732 3266 : indrelid = idxrec->indrelid;
1733 :
1734 : /* Fetch the pg_am tuple of the index' access method */
1735 3266 : ht_am = SearchSysCache1(AMOID, ObjectIdGetDatum(idxrelrec->relam));
1736 3266 : if (!HeapTupleIsValid(ht_am))
1737 0 : elog(ERROR, "cache lookup failed for access method %u",
1738 : idxrelrec->relam);
1739 3266 : amrec = (Form_pg_am) GETSTRUCT(ht_am);
1740 :
1741 : /* Extract indcollation from the pg_index tuple */
1742 3266 : datum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1743 : Anum_pg_index_indcollation);
1744 3266 : indcollation = (oidvector *) DatumGetPointer(datum);
1745 :
1746 : /* Extract indclass from the pg_index tuple */
1747 3266 : datum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx, Anum_pg_index_indclass);
1748 3266 : indclass = (oidvector *) DatumGetPointer(datum);
1749 :
1750 : /* Begin building the IndexStmt */
1751 3266 : index = makeNode(IndexStmt);
1752 3266 : index->relation = heapRel;
1753 3266 : index->accessMethod = pstrdup(NameStr(amrec->amname));
1754 3266 : if (OidIsValid(idxrelrec->reltablespace))
1755 88 : index->tableSpace = get_tablespace_name(idxrelrec->reltablespace);
1756 : else
1757 3178 : index->tableSpace = NULL;
1758 3266 : index->excludeOpNames = NIL;
1759 3266 : index->idxcomment = NULL;
1760 3266 : index->indexOid = InvalidOid;
1761 3266 : index->oldNumber = InvalidRelFileNumber;
1762 3266 : index->oldCreateSubid = InvalidSubTransactionId;
1763 3266 : index->oldFirstRelfilelocatorSubid = InvalidSubTransactionId;
1764 3266 : index->unique = idxrec->indisunique;
1765 3266 : index->nulls_not_distinct = idxrec->indnullsnotdistinct;
1766 3266 : index->primary = idxrec->indisprimary;
1767 3266 : index->iswithoutoverlaps = (idxrec->indisprimary || idxrec->indisunique) && idxrec->indisexclusion;
1768 3266 : index->transformed = true; /* don't need transformIndexStmt */
1769 3266 : index->concurrent = false;
1770 3266 : index->if_not_exists = false;
1771 3266 : index->reset_default_tblspc = false;
1772 :
1773 : /*
1774 : * We don't try to preserve the name of the source index; instead, just
1775 : * let DefineIndex() choose a reasonable name. (If we tried to preserve
1776 : * the name, we'd get duplicate-relation-name failures unless the source
1777 : * table was in a different schema.)
1778 : */
1779 3266 : index->idxname = NULL;
1780 :
1781 : /*
1782 : * If the index is marked PRIMARY or has an exclusion condition, it's
1783 : * certainly from a constraint; else, if it's not marked UNIQUE, it
1784 : * certainly isn't. If it is or might be from a constraint, we have to
1785 : * fetch the pg_constraint record.
1786 : */
1787 3266 : if (index->primary || index->unique || idxrec->indisexclusion)
1788 1754 : {
1789 1754 : Oid constraintId = get_index_constraint(source_relid);
1790 :
1791 1754 : if (OidIsValid(constraintId))
1792 : {
1793 : HeapTuple ht_constr;
1794 : Form_pg_constraint conrec;
1795 :
1796 1704 : if (constraintOid)
1797 1522 : *constraintOid = constraintId;
1798 :
1799 1704 : ht_constr = SearchSysCache1(CONSTROID,
1800 : ObjectIdGetDatum(constraintId));
1801 1704 : if (!HeapTupleIsValid(ht_constr))
1802 0 : elog(ERROR, "cache lookup failed for constraint %u",
1803 : constraintId);
1804 1704 : conrec = (Form_pg_constraint) GETSTRUCT(ht_constr);
1805 :
1806 1704 : index->isconstraint = true;
1807 1704 : index->deferrable = conrec->condeferrable;
1808 1704 : index->initdeferred = conrec->condeferred;
1809 :
1810 : /* If it's an exclusion constraint, we need the operator names */
1811 1704 : if (idxrec->indisexclusion)
1812 : {
1813 : Datum *elems;
1814 : int nElems;
1815 : int i;
1816 :
1817 : Assert(conrec->contype == CONSTRAINT_EXCLUSION ||
1818 : (index->iswithoutoverlaps &&
1819 : (conrec->contype == CONSTRAINT_PRIMARY || conrec->contype == CONSTRAINT_UNIQUE)));
1820 : /* Extract operator OIDs from the pg_constraint tuple */
1821 84 : datum = SysCacheGetAttrNotNull(CONSTROID, ht_constr,
1822 : Anum_pg_constraint_conexclop);
1823 84 : deconstruct_array_builtin(DatumGetArrayTypeP(datum), OIDOID, &elems, NULL, &nElems);
1824 :
1825 250 : for (i = 0; i < nElems; i++)
1826 : {
1827 166 : Oid operid = DatumGetObjectId(elems[i]);
1828 : HeapTuple opertup;
1829 : Form_pg_operator operform;
1830 : char *oprname;
1831 : char *nspname;
1832 : List *namelist;
1833 :
1834 166 : opertup = SearchSysCache1(OPEROID,
1835 : ObjectIdGetDatum(operid));
1836 166 : if (!HeapTupleIsValid(opertup))
1837 0 : elog(ERROR, "cache lookup failed for operator %u",
1838 : operid);
1839 166 : operform = (Form_pg_operator) GETSTRUCT(opertup);
1840 166 : oprname = pstrdup(NameStr(operform->oprname));
1841 : /* For simplicity we always schema-qualify the op name */
1842 166 : nspname = get_namespace_name(operform->oprnamespace);
1843 166 : namelist = list_make2(makeString(nspname),
1844 : makeString(oprname));
1845 166 : index->excludeOpNames = lappend(index->excludeOpNames,
1846 : namelist);
1847 166 : ReleaseSysCache(opertup);
1848 : }
1849 : }
1850 :
1851 1704 : ReleaseSysCache(ht_constr);
1852 : }
1853 : else
1854 50 : index->isconstraint = false;
1855 : }
1856 : else
1857 1512 : index->isconstraint = false;
1858 :
1859 : /* Get the index expressions, if any */
1860 3266 : datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1861 : Anum_pg_index_indexprs, &isnull);
1862 3266 : if (!isnull)
1863 : {
1864 : char *exprsString;
1865 :
1866 184 : exprsString = TextDatumGetCString(datum);
1867 184 : indexprs = (List *) stringToNode(exprsString);
1868 : }
1869 : else
1870 3082 : indexprs = NIL;
1871 :
1872 : /* Build the list of IndexElem */
1873 3266 : index->indexParams = NIL;
1874 3266 : index->indexIncludingParams = NIL;
1875 :
1876 3266 : indexpr_item = list_head(indexprs);
1877 7074 : for (keyno = 0; keyno < idxrec->indnkeyatts; keyno++)
1878 : {
1879 : IndexElem *iparam;
1880 3808 : AttrNumber attnum = idxrec->indkey.values[keyno];
1881 3808 : Form_pg_attribute attr = TupleDescAttr(RelationGetDescr(source_idx),
1882 : keyno);
1883 3808 : int16 opt = source_idx->rd_indoption[keyno];
1884 :
1885 3808 : iparam = makeNode(IndexElem);
1886 :
1887 3808 : if (AttributeNumberIsValid(attnum))
1888 : {
1889 : /* Simple index column */
1890 : char *attname;
1891 :
1892 3624 : attname = get_attname(indrelid, attnum, false);
1893 3624 : keycoltype = get_atttype(indrelid, attnum);
1894 :
1895 3624 : iparam->name = attname;
1896 3624 : iparam->expr = NULL;
1897 : }
1898 : else
1899 : {
1900 : /* Expressional index */
1901 : Node *indexkey;
1902 : bool found_whole_row;
1903 :
1904 184 : if (indexpr_item == NULL)
1905 0 : elog(ERROR, "too few entries in indexprs list");
1906 184 : indexkey = (Node *) lfirst(indexpr_item);
1907 184 : indexpr_item = lnext(indexprs, indexpr_item);
1908 :
1909 : /* Adjust Vars to match new table's column numbering */
1910 184 : indexkey = map_variable_attnos(indexkey,
1911 : 1, 0,
1912 : attmap,
1913 : InvalidOid, &found_whole_row);
1914 :
1915 : /* As in expandTableLikeClause, reject whole-row variables */
1916 184 : if (found_whole_row)
1917 0 : ereport(ERROR,
1918 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1919 : errmsg("cannot convert whole-row table reference"),
1920 : errdetail("Index \"%s\" contains a whole-row table reference.",
1921 : RelationGetRelationName(source_idx))));
1922 :
1923 184 : iparam->name = NULL;
1924 184 : iparam->expr = indexkey;
1925 :
1926 184 : keycoltype = exprType(indexkey);
1927 : }
1928 :
1929 : /* Copy the original index column name */
1930 3808 : iparam->indexcolname = pstrdup(NameStr(attr->attname));
1931 :
1932 : /* Add the collation name, if non-default */
1933 3808 : iparam->collation = get_collation(indcollation->values[keyno], keycoltype);
1934 :
1935 : /* Add the operator class name, if non-default */
1936 3808 : iparam->opclass = get_opclass(indclass->values[keyno], keycoltype);
1937 3808 : iparam->opclassopts =
1938 3808 : untransformRelOptions(get_attoptions(source_relid, keyno + 1));
1939 :
1940 3808 : iparam->ordering = SORTBY_DEFAULT;
1941 3808 : iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1942 :
1943 : /* Adjust options if necessary */
1944 3808 : if (source_idx->rd_indam->amcanorder)
1945 : {
1946 : /*
1947 : * If it supports sort ordering, copy DESC and NULLS opts. Don't
1948 : * set non-default settings unnecessarily, though, so as to
1949 : * improve the chance of recognizing equivalence to constraint
1950 : * indexes.
1951 : */
1952 3614 : if (opt & INDOPTION_DESC)
1953 : {
1954 0 : iparam->ordering = SORTBY_DESC;
1955 0 : if ((opt & INDOPTION_NULLS_FIRST) == 0)
1956 0 : iparam->nulls_ordering = SORTBY_NULLS_LAST;
1957 : }
1958 : else
1959 : {
1960 3614 : if (opt & INDOPTION_NULLS_FIRST)
1961 0 : iparam->nulls_ordering = SORTBY_NULLS_FIRST;
1962 : }
1963 : }
1964 :
1965 3808 : iparam->location = -1;
1966 :
1967 3808 : index->indexParams = lappend(index->indexParams, iparam);
1968 : }
1969 :
1970 : /* Handle included columns separately */
1971 3284 : for (keyno = idxrec->indnkeyatts; keyno < idxrec->indnatts; keyno++)
1972 : {
1973 : IndexElem *iparam;
1974 18 : AttrNumber attnum = idxrec->indkey.values[keyno];
1975 18 : Form_pg_attribute attr = TupleDescAttr(RelationGetDescr(source_idx),
1976 : keyno);
1977 :
1978 18 : iparam = makeNode(IndexElem);
1979 :
1980 18 : if (AttributeNumberIsValid(attnum))
1981 : {
1982 : /* Simple index column */
1983 : char *attname;
1984 :
1985 18 : attname = get_attname(indrelid, attnum, false);
1986 :
1987 18 : iparam->name = attname;
1988 18 : iparam->expr = NULL;
1989 : }
1990 : else
1991 0 : ereport(ERROR,
1992 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1993 : errmsg("expressions are not supported in included columns")));
1994 :
1995 : /* Copy the original index column name */
1996 18 : iparam->indexcolname = pstrdup(NameStr(attr->attname));
1997 :
1998 18 : iparam->location = -1;
1999 :
2000 18 : index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
2001 : }
2002 : /* Copy reloptions if any */
2003 3266 : datum = SysCacheGetAttr(RELOID, ht_idxrel,
2004 : Anum_pg_class_reloptions, &isnull);
2005 3266 : if (!isnull)
2006 0 : index->options = untransformRelOptions(datum);
2007 :
2008 : /* If it's a partial index, decompile and append the predicate */
2009 3266 : datum = SysCacheGetAttr(INDEXRELID, ht_idx,
2010 : Anum_pg_index_indpred, &isnull);
2011 3266 : if (!isnull)
2012 : {
2013 : char *pred_str;
2014 : Node *pred_tree;
2015 : bool found_whole_row;
2016 :
2017 : /* Convert text string to node tree */
2018 30 : pred_str = TextDatumGetCString(datum);
2019 30 : pred_tree = (Node *) stringToNode(pred_str);
2020 :
2021 : /* Adjust Vars to match new table's column numbering */
2022 30 : pred_tree = map_variable_attnos(pred_tree,
2023 : 1, 0,
2024 : attmap,
2025 : InvalidOid, &found_whole_row);
2026 :
2027 : /* As in expandTableLikeClause, reject whole-row variables */
2028 30 : if (found_whole_row)
2029 0 : ereport(ERROR,
2030 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2031 : errmsg("cannot convert whole-row table reference"),
2032 : errdetail("Index \"%s\" contains a whole-row table reference.",
2033 : RelationGetRelationName(source_idx))));
2034 :
2035 30 : index->whereClause = pred_tree;
2036 : }
2037 :
2038 : /* Clean up */
2039 3266 : ReleaseSysCache(ht_idxrel);
2040 3266 : ReleaseSysCache(ht_am);
2041 :
2042 3266 : return index;
2043 : }
2044 :
2045 : /*
2046 : * Generate a CreateStatsStmt node using information from an already existing
2047 : * extended statistic "source_statsid", for the rel identified by heapRel and
2048 : * heapRelid.
2049 : *
2050 : * Attribute numbers in expression Vars are adjusted according to attmap.
2051 : */
2052 : static CreateStatsStmt *
2053 48 : generateClonedExtStatsStmt(RangeVar *heapRel, Oid heapRelid,
2054 : Oid source_statsid, const AttrMap *attmap)
2055 : {
2056 : HeapTuple ht_stats;
2057 : Form_pg_statistic_ext statsrec;
2058 : CreateStatsStmt *stats;
2059 48 : List *stat_types = NIL;
2060 48 : List *def_names = NIL;
2061 : bool isnull;
2062 : Datum datum;
2063 : ArrayType *arr;
2064 : char *enabled;
2065 : int i;
2066 :
2067 : Assert(OidIsValid(heapRelid));
2068 : Assert(heapRel != NULL);
2069 :
2070 : /*
2071 : * Fetch pg_statistic_ext tuple of source statistics object.
2072 : */
2073 48 : ht_stats = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(source_statsid));
2074 48 : if (!HeapTupleIsValid(ht_stats))
2075 0 : elog(ERROR, "cache lookup failed for statistics object %u", source_statsid);
2076 48 : statsrec = (Form_pg_statistic_ext) GETSTRUCT(ht_stats);
2077 :
2078 : /* Determine which statistics types exist */
2079 48 : datum = SysCacheGetAttrNotNull(STATEXTOID, ht_stats,
2080 : Anum_pg_statistic_ext_stxkind);
2081 48 : arr = DatumGetArrayTypeP(datum);
2082 48 : if (ARR_NDIM(arr) != 1 ||
2083 48 : ARR_HASNULL(arr) ||
2084 48 : ARR_ELEMTYPE(arr) != CHAROID)
2085 0 : elog(ERROR, "stxkind is not a 1-D char array");
2086 48 : enabled = (char *) ARR_DATA_PTR(arr);
2087 144 : for (i = 0; i < ARR_DIMS(arr)[0]; i++)
2088 : {
2089 96 : if (enabled[i] == STATS_EXT_NDISTINCT)
2090 24 : stat_types = lappend(stat_types, makeString("ndistinct"));
2091 72 : else if (enabled[i] == STATS_EXT_DEPENDENCIES)
2092 24 : stat_types = lappend(stat_types, makeString("dependencies"));
2093 48 : else if (enabled[i] == STATS_EXT_MCV)
2094 24 : stat_types = lappend(stat_types, makeString("mcv"));
2095 24 : else if (enabled[i] == STATS_EXT_EXPRESSIONS)
2096 : /* expression stats are not exposed to users */
2097 24 : continue;
2098 : else
2099 0 : elog(ERROR, "unrecognized statistics kind %c", enabled[i]);
2100 : }
2101 :
2102 : /* Determine which columns the statistics are on */
2103 96 : for (i = 0; i < statsrec->stxkeys.dim1; i++)
2104 : {
2105 48 : StatsElem *selem = makeNode(StatsElem);
2106 48 : AttrNumber attnum = statsrec->stxkeys.values[i];
2107 :
2108 48 : selem->name = get_attname(heapRelid, attnum, false);
2109 48 : selem->expr = NULL;
2110 :
2111 48 : def_names = lappend(def_names, selem);
2112 : }
2113 :
2114 : /*
2115 : * Now handle expressions, if there are any. The order (with respect to
2116 : * regular attributes) does not really matter for extended stats, so we
2117 : * simply append them after simple column references.
2118 : *
2119 : * XXX Some places during build/estimation treat expressions as if they
2120 : * are before attributes, but for the CREATE command that's entirely
2121 : * irrelevant.
2122 : */
2123 48 : datum = SysCacheGetAttr(STATEXTOID, ht_stats,
2124 : Anum_pg_statistic_ext_stxexprs, &isnull);
2125 :
2126 48 : if (!isnull)
2127 : {
2128 : ListCell *lc;
2129 24 : List *exprs = NIL;
2130 : char *exprsString;
2131 :
2132 24 : exprsString = TextDatumGetCString(datum);
2133 24 : exprs = (List *) stringToNode(exprsString);
2134 :
2135 48 : foreach(lc, exprs)
2136 : {
2137 24 : Node *expr = (Node *) lfirst(lc);
2138 24 : StatsElem *selem = makeNode(StatsElem);
2139 : bool found_whole_row;
2140 :
2141 : /* Adjust Vars to match new table's column numbering */
2142 24 : expr = map_variable_attnos(expr,
2143 : 1, 0,
2144 : attmap,
2145 : InvalidOid,
2146 : &found_whole_row);
2147 :
2148 24 : selem->name = NULL;
2149 24 : selem->expr = expr;
2150 :
2151 24 : def_names = lappend(def_names, selem);
2152 : }
2153 :
2154 24 : pfree(exprsString);
2155 : }
2156 :
2157 : /* finally, build the output node */
2158 48 : stats = makeNode(CreateStatsStmt);
2159 48 : stats->defnames = NULL;
2160 48 : stats->stat_types = stat_types;
2161 48 : stats->exprs = def_names;
2162 48 : stats->relations = list_make1(heapRel);
2163 48 : stats->stxcomment = NULL;
2164 48 : stats->transformed = true; /* don't need transformStatsStmt again */
2165 48 : stats->if_not_exists = false;
2166 :
2167 : /* Clean up */
2168 48 : ReleaseSysCache(ht_stats);
2169 :
2170 48 : return stats;
2171 : }
2172 :
2173 : /*
2174 : * get_collation - fetch qualified name of a collation
2175 : *
2176 : * If collation is InvalidOid or is the default for the given actual_datatype,
2177 : * then the return value is NIL.
2178 : */
2179 : static List *
2180 3808 : get_collation(Oid collation, Oid actual_datatype)
2181 : {
2182 : List *result;
2183 : HeapTuple ht_coll;
2184 : Form_pg_collation coll_rec;
2185 : char *nsp_name;
2186 : char *coll_name;
2187 :
2188 3808 : if (!OidIsValid(collation))
2189 3398 : return NIL; /* easy case */
2190 410 : if (collation == get_typcollation(actual_datatype))
2191 388 : return NIL; /* just let it default */
2192 :
2193 22 : ht_coll = SearchSysCache1(COLLOID, ObjectIdGetDatum(collation));
2194 22 : if (!HeapTupleIsValid(ht_coll))
2195 0 : elog(ERROR, "cache lookup failed for collation %u", collation);
2196 22 : coll_rec = (Form_pg_collation) GETSTRUCT(ht_coll);
2197 :
2198 : /* For simplicity, we always schema-qualify the name */
2199 22 : nsp_name = get_namespace_name(coll_rec->collnamespace);
2200 22 : coll_name = pstrdup(NameStr(coll_rec->collname));
2201 22 : result = list_make2(makeString(nsp_name), makeString(coll_name));
2202 :
2203 22 : ReleaseSysCache(ht_coll);
2204 22 : return result;
2205 : }
2206 :
2207 : /*
2208 : * get_opclass - fetch qualified name of an index operator class
2209 : *
2210 : * If the opclass is the default for the given actual_datatype, then
2211 : * the return value is NIL.
2212 : */
2213 : static List *
2214 3808 : get_opclass(Oid opclass, Oid actual_datatype)
2215 : {
2216 3808 : List *result = NIL;
2217 : HeapTuple ht_opc;
2218 : Form_pg_opclass opc_rec;
2219 :
2220 3808 : ht_opc = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
2221 3808 : if (!HeapTupleIsValid(ht_opc))
2222 0 : elog(ERROR, "cache lookup failed for opclass %u", opclass);
2223 3808 : opc_rec = (Form_pg_opclass) GETSTRUCT(ht_opc);
2224 :
2225 3808 : if (GetDefaultOpClass(actual_datatype, opc_rec->opcmethod) != opclass)
2226 : {
2227 : /* For simplicity, we always schema-qualify the name */
2228 24 : char *nsp_name = get_namespace_name(opc_rec->opcnamespace);
2229 24 : char *opc_name = pstrdup(NameStr(opc_rec->opcname));
2230 :
2231 24 : result = list_make2(makeString(nsp_name), makeString(opc_name));
2232 : }
2233 :
2234 3808 : ReleaseSysCache(ht_opc);
2235 3808 : return result;
2236 : }
2237 :
2238 :
2239 : /*
2240 : * transformIndexConstraints
2241 : * Handle UNIQUE, PRIMARY KEY, EXCLUDE constraints, which create indexes.
2242 : * We also merge in any index definitions arising from
2243 : * LIKE ... INCLUDING INDEXES.
2244 : */
2245 : static void
2246 64774 : transformIndexConstraints(CreateStmtContext *cxt)
2247 : {
2248 : IndexStmt *index;
2249 64774 : List *indexlist = NIL;
2250 64774 : List *finalindexlist = NIL;
2251 : ListCell *lc;
2252 :
2253 : /*
2254 : * Run through the constraints that need to generate an index, and do so.
2255 : *
2256 : * For PRIMARY KEY, this queues not-null constraints for each column, if
2257 : * needed.
2258 : */
2259 84794 : foreach(lc, cxt->ixconstraints)
2260 : {
2261 20086 : Constraint *constraint = lfirst_node(Constraint, lc);
2262 :
2263 : Assert(constraint->contype == CONSTR_PRIMARY ||
2264 : constraint->contype == CONSTR_UNIQUE ||
2265 : constraint->contype == CONSTR_EXCLUSION);
2266 :
2267 20086 : index = transformIndexConstraint(constraint, cxt);
2268 :
2269 20020 : indexlist = lappend(indexlist, index);
2270 : }
2271 :
2272 : /*
2273 : * Scan the index list and remove any redundant index specifications. This
2274 : * can happen if, for instance, the user writes UNIQUE PRIMARY KEY. A
2275 : * strict reading of SQL would suggest raising an error instead, but that
2276 : * strikes me as too anal-retentive. - tgl 2001-02-14
2277 : *
2278 : * XXX in ALTER TABLE case, it'd be nice to look for duplicate
2279 : * pre-existing indexes, too.
2280 : */
2281 64708 : if (cxt->pkey != NULL)
2282 : {
2283 : /* Make sure we keep the PKEY index in preference to others... */
2284 14120 : finalindexlist = list_make1(cxt->pkey);
2285 : }
2286 :
2287 84728 : foreach(lc, indexlist)
2288 : {
2289 20020 : bool keep = true;
2290 : ListCell *k;
2291 :
2292 20020 : index = lfirst(lc);
2293 :
2294 : /* if it's pkey, it's already in finalindexlist */
2295 20020 : if (index == cxt->pkey)
2296 14120 : continue;
2297 :
2298 6094 : foreach(k, finalindexlist)
2299 : {
2300 194 : IndexStmt *priorindex = lfirst(k);
2301 :
2302 200 : if (equal(index->indexParams, priorindex->indexParams) &&
2303 12 : equal(index->indexIncludingParams, priorindex->indexIncludingParams) &&
2304 12 : equal(index->whereClause, priorindex->whereClause) &&
2305 6 : equal(index->excludeOpNames, priorindex->excludeOpNames) &&
2306 6 : strcmp(index->accessMethod, priorindex->accessMethod) == 0 &&
2307 6 : index->nulls_not_distinct == priorindex->nulls_not_distinct &&
2308 6 : index->deferrable == priorindex->deferrable &&
2309 0 : index->initdeferred == priorindex->initdeferred)
2310 : {
2311 0 : priorindex->unique |= index->unique;
2312 :
2313 : /*
2314 : * If the prior index is as yet unnamed, and this one is
2315 : * named, then transfer the name to the prior index. This
2316 : * ensures that if we have named and unnamed constraints,
2317 : * we'll use (at least one of) the names for the index.
2318 : */
2319 0 : if (priorindex->idxname == NULL)
2320 0 : priorindex->idxname = index->idxname;
2321 0 : keep = false;
2322 0 : break;
2323 : }
2324 : }
2325 :
2326 5900 : if (keep)
2327 5900 : finalindexlist = lappend(finalindexlist, index);
2328 : }
2329 :
2330 : /*
2331 : * Now append all the IndexStmts to cxt->alist.
2332 : */
2333 64708 : cxt->alist = list_concat(cxt->alist, finalindexlist);
2334 64708 : }
2335 :
2336 : /*
2337 : * transformIndexConstraint
2338 : * Transform one UNIQUE, PRIMARY KEY, or EXCLUDE constraint for
2339 : * transformIndexConstraints. An IndexStmt is returned.
2340 : *
2341 : * For a PRIMARY KEY constraint, we additionally create not-null constraints
2342 : * for columns that don't already have them.
2343 : */
2344 : static IndexStmt *
2345 20086 : transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
2346 : {
2347 : IndexStmt *index;
2348 : ListCell *lc;
2349 :
2350 20086 : index = makeNode(IndexStmt);
2351 :
2352 20086 : index->unique = (constraint->contype != CONSTR_EXCLUSION);
2353 20086 : index->primary = (constraint->contype == CONSTR_PRIMARY);
2354 20086 : if (index->primary)
2355 : {
2356 14150 : if (cxt->pkey != NULL)
2357 0 : ereport(ERROR,
2358 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
2359 : errmsg("multiple primary keys for table \"%s\" are not allowed",
2360 : cxt->relation->relname),
2361 : parser_errposition(cxt->pstate, constraint->location)));
2362 14150 : cxt->pkey = index;
2363 :
2364 : /*
2365 : * In ALTER TABLE case, a primary index might already exist, but
2366 : * DefineIndex will check for it.
2367 : */
2368 : }
2369 20086 : index->nulls_not_distinct = constraint->nulls_not_distinct;
2370 20086 : index->isconstraint = true;
2371 20086 : index->iswithoutoverlaps = constraint->without_overlaps;
2372 20086 : index->deferrable = constraint->deferrable;
2373 20086 : index->initdeferred = constraint->initdeferred;
2374 :
2375 20086 : if (constraint->conname != NULL)
2376 1480 : index->idxname = pstrdup(constraint->conname);
2377 : else
2378 18606 : index->idxname = NULL; /* DefineIndex will choose name */
2379 :
2380 20086 : index->relation = cxt->relation;
2381 20086 : index->accessMethod = constraint->access_method ? constraint->access_method : DEFAULT_INDEX_TYPE;
2382 20086 : index->options = constraint->options;
2383 20086 : index->tableSpace = constraint->indexspace;
2384 20086 : index->whereClause = constraint->where_clause;
2385 20086 : index->indexParams = NIL;
2386 20086 : index->indexIncludingParams = NIL;
2387 20086 : index->excludeOpNames = NIL;
2388 20086 : index->idxcomment = NULL;
2389 20086 : index->indexOid = InvalidOid;
2390 20086 : index->oldNumber = InvalidRelFileNumber;
2391 20086 : index->oldCreateSubid = InvalidSubTransactionId;
2392 20086 : index->oldFirstRelfilelocatorSubid = InvalidSubTransactionId;
2393 20086 : index->transformed = false;
2394 20086 : index->concurrent = false;
2395 20086 : index->if_not_exists = false;
2396 20086 : index->reset_default_tblspc = constraint->reset_default_tblspc;
2397 :
2398 : /*
2399 : * If it's ALTER TABLE ADD CONSTRAINT USING INDEX, look up the index and
2400 : * verify it's usable, then extract the implied column name list. (We
2401 : * will not actually need the column name list at runtime, but we need it
2402 : * now to check for duplicate column entries below.)
2403 : */
2404 20086 : if (constraint->indexname != NULL)
2405 : {
2406 10884 : char *index_name = constraint->indexname;
2407 10884 : Relation heap_rel = cxt->rel;
2408 : Oid index_oid;
2409 : Relation index_rel;
2410 : Form_pg_index index_form;
2411 : oidvector *indclass;
2412 : Datum indclassDatum;
2413 : int i;
2414 :
2415 : /* Grammar should not allow this with explicit column list */
2416 : Assert(constraint->keys == NIL);
2417 :
2418 : /* Grammar should only allow PRIMARY and UNIQUE constraints */
2419 : Assert(constraint->contype == CONSTR_PRIMARY ||
2420 : constraint->contype == CONSTR_UNIQUE);
2421 :
2422 : /* Must be ALTER, not CREATE, but grammar doesn't enforce that */
2423 10884 : if (!cxt->isalter)
2424 0 : ereport(ERROR,
2425 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2426 : errmsg("cannot use an existing index in CREATE TABLE"),
2427 : parser_errposition(cxt->pstate, constraint->location)));
2428 :
2429 : /* Look for the index in the same schema as the table */
2430 10884 : index_oid = get_relname_relid(index_name, RelationGetNamespace(heap_rel));
2431 :
2432 10884 : if (!OidIsValid(index_oid))
2433 0 : ereport(ERROR,
2434 : (errcode(ERRCODE_UNDEFINED_OBJECT),
2435 : errmsg("index \"%s\" does not exist", index_name),
2436 : parser_errposition(cxt->pstate, constraint->location)));
2437 :
2438 : /* Open the index (this will throw an error if it is not an index) */
2439 10884 : index_rel = index_open(index_oid, AccessShareLock);
2440 10884 : index_form = index_rel->rd_index;
2441 :
2442 : /* Check that it does not have an associated constraint already */
2443 10884 : if (OidIsValid(get_index_constraint(index_oid)))
2444 0 : ereport(ERROR,
2445 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2446 : errmsg("index \"%s\" is already associated with a constraint",
2447 : index_name),
2448 : parser_errposition(cxt->pstate, constraint->location)));
2449 :
2450 : /* Perform validity checks on the index */
2451 10884 : if (index_form->indrelid != RelationGetRelid(heap_rel))
2452 0 : ereport(ERROR,
2453 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2454 : errmsg("index \"%s\" does not belong to table \"%s\"",
2455 : index_name, RelationGetRelationName(heap_rel)),
2456 : parser_errposition(cxt->pstate, constraint->location)));
2457 :
2458 10884 : if (!index_form->indisvalid)
2459 0 : ereport(ERROR,
2460 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2461 : errmsg("index \"%s\" is not valid", index_name),
2462 : parser_errposition(cxt->pstate, constraint->location)));
2463 :
2464 : /*
2465 : * Today we forbid non-unique indexes, but we could permit GiST
2466 : * indexes whose last entry is a range type and use that to create a
2467 : * WITHOUT OVERLAPS constraint (i.e. a temporal constraint).
2468 : */
2469 10884 : if (!index_form->indisunique)
2470 12 : ereport(ERROR,
2471 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2472 : errmsg("\"%s\" is not a unique index", index_name),
2473 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2474 : parser_errposition(cxt->pstate, constraint->location)));
2475 :
2476 10872 : if (RelationGetIndexExpressions(index_rel) != NIL)
2477 0 : ereport(ERROR,
2478 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2479 : errmsg("index \"%s\" contains expressions", index_name),
2480 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2481 : parser_errposition(cxt->pstate, constraint->location)));
2482 :
2483 10872 : if (RelationGetIndexPredicate(index_rel) != NIL)
2484 0 : ereport(ERROR,
2485 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2486 : errmsg("\"%s\" is a partial index", index_name),
2487 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2488 : parser_errposition(cxt->pstate, constraint->location)));
2489 :
2490 : /*
2491 : * It's probably unsafe to change a deferred index to non-deferred. (A
2492 : * non-constraint index couldn't be deferred anyway, so this case
2493 : * should never occur; no need to sweat, but let's check it.)
2494 : */
2495 10872 : if (!index_form->indimmediate && !constraint->deferrable)
2496 0 : ereport(ERROR,
2497 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2498 : errmsg("\"%s\" is a deferrable index", index_name),
2499 : errdetail("Cannot create a non-deferrable constraint using a deferrable index."),
2500 : parser_errposition(cxt->pstate, constraint->location)));
2501 :
2502 : /*
2503 : * Insist on it being a btree. We must have an index that exactly
2504 : * matches what you'd get from plain ADD CONSTRAINT syntax, else dump
2505 : * and reload will produce a different index (breaking pg_upgrade in
2506 : * particular).
2507 : */
2508 10872 : if (index_rel->rd_rel->relam != get_index_am_oid(DEFAULT_INDEX_TYPE, false))
2509 0 : ereport(ERROR,
2510 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2511 : errmsg("index \"%s\" is not a btree", index_name),
2512 : parser_errposition(cxt->pstate, constraint->location)));
2513 :
2514 : /* Must get indclass the hard way */
2515 10872 : indclassDatum = SysCacheGetAttrNotNull(INDEXRELID,
2516 10872 : index_rel->rd_indextuple,
2517 : Anum_pg_index_indclass);
2518 10872 : indclass = (oidvector *) DatumGetPointer(indclassDatum);
2519 :
2520 28756 : for (i = 0; i < index_form->indnatts; i++)
2521 : {
2522 17896 : int16 attnum = index_form->indkey.values[i];
2523 : const FormData_pg_attribute *attform;
2524 : char *attname;
2525 : Oid defopclass;
2526 :
2527 : /*
2528 : * We shouldn't see attnum == 0 here, since we already rejected
2529 : * expression indexes. If we do, SystemAttributeDefinition will
2530 : * throw an error.
2531 : */
2532 17896 : if (attnum > 0)
2533 : {
2534 : Assert(attnum <= heap_rel->rd_att->natts);
2535 17896 : attform = TupleDescAttr(heap_rel->rd_att, attnum - 1);
2536 : }
2537 : else
2538 0 : attform = SystemAttributeDefinition(attnum);
2539 17896 : attname = pstrdup(NameStr(attform->attname));
2540 :
2541 17896 : if (i < index_form->indnkeyatts)
2542 : {
2543 : /*
2544 : * Insist on default opclass, collation, and sort options.
2545 : * While the index would still work as a constraint with
2546 : * non-default settings, it might not provide exactly the same
2547 : * uniqueness semantics as you'd get from a normally-created
2548 : * constraint; and there's also the dump/reload problem
2549 : * mentioned above.
2550 : */
2551 : Datum attoptions =
2552 17866 : get_attoptions(RelationGetRelid(index_rel), i + 1);
2553 :
2554 17866 : defopclass = GetDefaultOpClass(attform->atttypid,
2555 17866 : index_rel->rd_rel->relam);
2556 17866 : if (indclass->values[i] != defopclass ||
2557 17866 : attform->attcollation != index_rel->rd_indcollation[i] ||
2558 17860 : attoptions != (Datum) 0 ||
2559 17860 : index_rel->rd_indoption[i] != 0)
2560 12 : ereport(ERROR,
2561 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2562 : errmsg("index \"%s\" column number %d does not have default sorting behavior", index_name, i + 1),
2563 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2564 : parser_errposition(cxt->pstate, constraint->location)));
2565 :
2566 : /* If a PK, ensure the columns get not null constraints */
2567 17854 : if (constraint->contype == CONSTR_PRIMARY)
2568 8120 : cxt->nnconstraints =
2569 8120 : lappend(cxt->nnconstraints,
2570 8120 : makeNotNullConstraint(makeString(attname)));
2571 :
2572 17854 : constraint->keys = lappend(constraint->keys, makeString(attname));
2573 : }
2574 : else
2575 30 : constraint->including = lappend(constraint->including, makeString(attname));
2576 : }
2577 :
2578 : /* Close the index relation but keep the lock */
2579 10860 : index_close(index_rel, NoLock);
2580 :
2581 10860 : index->indexOid = index_oid;
2582 : }
2583 :
2584 : /*
2585 : * If it's an EXCLUDE constraint, the grammar returns a list of pairs of
2586 : * IndexElems and operator names. We have to break that apart into
2587 : * separate lists.
2588 : */
2589 20062 : if (constraint->contype == CONSTR_EXCLUSION)
2590 : {
2591 574 : foreach(lc, constraint->exclusions)
2592 : {
2593 340 : List *pair = (List *) lfirst(lc);
2594 : IndexElem *elem;
2595 : List *opname;
2596 :
2597 : Assert(list_length(pair) == 2);
2598 340 : elem = linitial_node(IndexElem, pair);
2599 340 : opname = lsecond_node(List, pair);
2600 :
2601 340 : index->indexParams = lappend(index->indexParams, elem);
2602 340 : index->excludeOpNames = lappend(index->excludeOpNames, opname);
2603 : }
2604 : }
2605 :
2606 : /*
2607 : * For UNIQUE and PRIMARY KEY, we just have a list of column names.
2608 : *
2609 : * Make sure referenced keys exist. If we are making a PRIMARY KEY index,
2610 : * also make sure they are not-null. For WITHOUT OVERLAPS constraints, we
2611 : * make sure the last part is a range or multirange.
2612 : */
2613 : else
2614 : {
2615 48120 : foreach(lc, constraint->keys)
2616 : {
2617 28322 : char *key = strVal(lfirst(lc));
2618 28322 : bool found = false;
2619 28322 : ColumnDef *column = NULL;
2620 : ListCell *columns;
2621 : IndexElem *iparam;
2622 28322 : Oid typid = InvalidOid;
2623 :
2624 : /* Make sure referenced column exists. */
2625 30038 : foreach(columns, cxt->columns)
2626 : {
2627 10424 : column = lfirst_node(ColumnDef, columns);
2628 10424 : if (strcmp(column->colname, key) == 0)
2629 : {
2630 8708 : found = true;
2631 8708 : break;
2632 : }
2633 : }
2634 28322 : if (!found)
2635 19614 : column = NULL;
2636 :
2637 28322 : if (found)
2638 : {
2639 : /*
2640 : * column is defined in the new table. For CREATE TABLE with
2641 : * a PRIMARY KEY, we can apply the not-null constraint cheaply
2642 : * here. If the not-null constraint already exists, we can
2643 : * (albeit not so cheaply) verify that it's not a NO INHERIT
2644 : * constraint.
2645 : *
2646 : * Note that ALTER TABLE never needs either check, because
2647 : * those constraints have already been added by
2648 : * ATPrepAddPrimaryKey.
2649 : */
2650 8708 : if (constraint->contype == CONSTR_PRIMARY &&
2651 7906 : !cxt->isalter)
2652 : {
2653 7882 : if (column->is_not_null)
2654 : {
2655 12758 : foreach_node(Constraint, nn, cxt->nnconstraints)
2656 : {
2657 6472 : if (strcmp(strVal(linitial(nn->keys)), key) == 0)
2658 : {
2659 6292 : if (nn->is_no_inherit)
2660 6 : ereport(ERROR,
2661 : errcode(ERRCODE_SYNTAX_ERROR),
2662 : errmsg("conflicting NO INHERIT declaration for not-null constraint on column \"%s\"",
2663 : key));
2664 6286 : break;
2665 : }
2666 : }
2667 : }
2668 : else
2669 : {
2670 1590 : column->is_not_null = true;
2671 1590 : cxt->nnconstraints =
2672 1590 : lappend(cxt->nnconstraints,
2673 1590 : makeNotNullConstraint(makeString(key)));
2674 : }
2675 : }
2676 24 : else if (constraint->contype == CONSTR_PRIMARY)
2677 : Assert(column->is_not_null);
2678 : }
2679 19614 : else if (SystemAttributeByName(key) != NULL)
2680 : {
2681 : /*
2682 : * column will be a system column in the new table, so accept
2683 : * it. System columns can't ever be null, so no need to worry
2684 : * about PRIMARY/NOT NULL constraint.
2685 : */
2686 0 : found = true;
2687 : }
2688 19614 : else if (cxt->inhRelations)
2689 : {
2690 : /* try inherited tables */
2691 : ListCell *inher;
2692 :
2693 96 : foreach(inher, cxt->inhRelations)
2694 : {
2695 96 : RangeVar *inh = lfirst_node(RangeVar, inher);
2696 : Relation rel;
2697 : int count;
2698 :
2699 96 : rel = table_openrv(inh, AccessShareLock);
2700 : /* check user requested inheritance from valid relkind */
2701 96 : if (rel->rd_rel->relkind != RELKIND_RELATION &&
2702 0 : rel->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
2703 0 : rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
2704 0 : ereport(ERROR,
2705 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2706 : errmsg("inherited relation \"%s\" is not a table or foreign table",
2707 : inh->relname)));
2708 102 : for (count = 0; count < rel->rd_att->natts; count++)
2709 : {
2710 102 : Form_pg_attribute inhattr = TupleDescAttr(rel->rd_att,
2711 : count);
2712 102 : char *inhname = NameStr(inhattr->attname);
2713 :
2714 102 : if (inhattr->attisdropped)
2715 0 : continue;
2716 102 : if (strcmp(key, inhname) == 0)
2717 : {
2718 96 : found = true;
2719 96 : typid = inhattr->atttypid;
2720 :
2721 96 : if (constraint->contype == CONSTR_PRIMARY)
2722 84 : cxt->nnconstraints =
2723 84 : lappend(cxt->nnconstraints,
2724 84 : makeNotNullConstraint(makeString(pstrdup(inhname))));
2725 96 : break;
2726 : }
2727 : }
2728 96 : table_close(rel, NoLock);
2729 96 : if (found)
2730 96 : break;
2731 : }
2732 : }
2733 :
2734 : /*
2735 : * In the ALTER TABLE case, don't complain about index keys not
2736 : * created in the command; they may well exist already.
2737 : * DefineIndex will complain about them if not.
2738 : */
2739 28316 : if (!found && !cxt->isalter)
2740 12 : ereport(ERROR,
2741 : (errcode(ERRCODE_UNDEFINED_COLUMN),
2742 : errmsg("column \"%s\" named in key does not exist", key),
2743 : parser_errposition(cxt->pstate, constraint->location)));
2744 :
2745 : /* Check for PRIMARY KEY(foo, foo) */
2746 39742 : foreach(columns, index->indexParams)
2747 : {
2748 11438 : iparam = (IndexElem *) lfirst(columns);
2749 11438 : if (iparam->name && strcmp(key, iparam->name) == 0)
2750 : {
2751 0 : if (index->primary)
2752 0 : ereport(ERROR,
2753 : (errcode(ERRCODE_DUPLICATE_COLUMN),
2754 : errmsg("column \"%s\" appears twice in primary key constraint",
2755 : key),
2756 : parser_errposition(cxt->pstate, constraint->location)));
2757 : else
2758 0 : ereport(ERROR,
2759 : (errcode(ERRCODE_DUPLICATE_COLUMN),
2760 : errmsg("column \"%s\" appears twice in unique constraint",
2761 : key),
2762 : parser_errposition(cxt->pstate, constraint->location)));
2763 : }
2764 : }
2765 :
2766 : /*
2767 : * The WITHOUT OVERLAPS part (if any) must be a range or
2768 : * multirange type.
2769 : */
2770 28304 : if (constraint->without_overlaps && lc == list_last_cell(constraint->keys))
2771 : {
2772 578 : if (!found && cxt->isalter)
2773 : {
2774 : /*
2775 : * Look up the column type on existing table. If we can't
2776 : * find it, let things fail in DefineIndex.
2777 : */
2778 166 : Relation rel = cxt->rel;
2779 :
2780 336 : for (int i = 0; i < rel->rd_att->natts; i++)
2781 : {
2782 336 : Form_pg_attribute attr = TupleDescAttr(rel->rd_att, i);
2783 : const char *attname;
2784 :
2785 336 : if (attr->attisdropped)
2786 0 : break;
2787 :
2788 336 : attname = NameStr(attr->attname);
2789 336 : if (strcmp(attname, key) == 0)
2790 : {
2791 166 : found = true;
2792 166 : typid = attr->atttypid;
2793 166 : break;
2794 : }
2795 : }
2796 : }
2797 578 : if (found)
2798 : {
2799 578 : if (!OidIsValid(typid) && column)
2800 406 : typid = typenameTypeId(NULL, column->typeName);
2801 :
2802 578 : if (!OidIsValid(typid) || !(type_is_range(typid) || type_is_multirange(typid)))
2803 12 : ereport(ERROR,
2804 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2805 : errmsg("column \"%s\" in WITHOUT OVERLAPS is not a range or multirange type", key),
2806 : parser_errposition(cxt->pstate, constraint->location)));
2807 : }
2808 : }
2809 :
2810 : /* OK, add it to the index definition */
2811 28292 : iparam = makeNode(IndexElem);
2812 28292 : iparam->name = pstrdup(key);
2813 28292 : iparam->expr = NULL;
2814 28292 : iparam->indexcolname = NULL;
2815 28292 : iparam->collation = NIL;
2816 28292 : iparam->opclass = NIL;
2817 28292 : iparam->opclassopts = NIL;
2818 28292 : iparam->ordering = SORTBY_DEFAULT;
2819 28292 : iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
2820 28292 : iparam->location = -1;
2821 28292 : index->indexParams = lappend(index->indexParams, iparam);
2822 : }
2823 :
2824 19798 : if (constraint->without_overlaps)
2825 : {
2826 : /*
2827 : * This enforces that there is at least one equality column
2828 : * besides the WITHOUT OVERLAPS columns. This is per SQL
2829 : * standard. XXX Do we need this?
2830 : */
2831 566 : if (list_length(constraint->keys) < 2)
2832 12 : ereport(ERROR,
2833 : errcode(ERRCODE_SYNTAX_ERROR),
2834 : errmsg("constraint using WITHOUT OVERLAPS needs at least two columns"));
2835 :
2836 : /* WITHOUT OVERLAPS requires a GiST index */
2837 554 : index->accessMethod = "gist";
2838 : }
2839 :
2840 : }
2841 :
2842 : /*
2843 : * Add included columns to index definition. This is much like the
2844 : * simple-column-name-list code above, except that we don't worry about
2845 : * NOT NULL marking; included columns in a primary key should not be
2846 : * forced NOT NULL. We don't complain about duplicate columns, either,
2847 : * though maybe we should?
2848 : */
2849 20328 : foreach(lc, constraint->including)
2850 : {
2851 308 : char *key = strVal(lfirst(lc));
2852 308 : bool found = false;
2853 308 : ColumnDef *column = NULL;
2854 : ListCell *columns;
2855 : IndexElem *iparam;
2856 :
2857 662 : foreach(columns, cxt->columns)
2858 : {
2859 544 : column = lfirst_node(ColumnDef, columns);
2860 544 : if (strcmp(column->colname, key) == 0)
2861 : {
2862 190 : found = true;
2863 190 : break;
2864 : }
2865 : }
2866 :
2867 308 : if (!found)
2868 : {
2869 118 : if (SystemAttributeByName(key) != NULL)
2870 : {
2871 : /*
2872 : * column will be a system column in the new table, so accept
2873 : * it.
2874 : */
2875 0 : found = true;
2876 : }
2877 118 : else if (cxt->inhRelations)
2878 : {
2879 : /* try inherited tables */
2880 : ListCell *inher;
2881 :
2882 0 : foreach(inher, cxt->inhRelations)
2883 : {
2884 0 : RangeVar *inh = lfirst_node(RangeVar, inher);
2885 : Relation rel;
2886 : int count;
2887 :
2888 0 : rel = table_openrv(inh, AccessShareLock);
2889 : /* check user requested inheritance from valid relkind */
2890 0 : if (rel->rd_rel->relkind != RELKIND_RELATION &&
2891 0 : rel->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
2892 0 : rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
2893 0 : ereport(ERROR,
2894 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2895 : errmsg("inherited relation \"%s\" is not a table or foreign table",
2896 : inh->relname)));
2897 0 : for (count = 0; count < rel->rd_att->natts; count++)
2898 : {
2899 0 : Form_pg_attribute inhattr = TupleDescAttr(rel->rd_att,
2900 : count);
2901 0 : char *inhname = NameStr(inhattr->attname);
2902 :
2903 0 : if (inhattr->attisdropped)
2904 0 : continue;
2905 0 : if (strcmp(key, inhname) == 0)
2906 : {
2907 0 : found = true;
2908 0 : break;
2909 : }
2910 : }
2911 0 : table_close(rel, NoLock);
2912 0 : if (found)
2913 0 : break;
2914 : }
2915 : }
2916 : }
2917 :
2918 : /*
2919 : * In the ALTER TABLE case, don't complain about index keys not
2920 : * created in the command; they may well exist already. DefineIndex
2921 : * will complain about them if not.
2922 : */
2923 308 : if (!found && !cxt->isalter)
2924 0 : ereport(ERROR,
2925 : (errcode(ERRCODE_UNDEFINED_COLUMN),
2926 : errmsg("column \"%s\" named in key does not exist", key),
2927 : parser_errposition(cxt->pstate, constraint->location)));
2928 :
2929 : /* OK, add it to the index definition */
2930 308 : iparam = makeNode(IndexElem);
2931 308 : iparam->name = pstrdup(key);
2932 308 : iparam->expr = NULL;
2933 308 : iparam->indexcolname = NULL;
2934 308 : iparam->collation = NIL;
2935 308 : iparam->opclass = NIL;
2936 308 : iparam->opclassopts = NIL;
2937 308 : iparam->location = -1;
2938 308 : index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
2939 : }
2940 :
2941 20020 : return index;
2942 : }
2943 :
2944 : /*
2945 : * transformCheckConstraints
2946 : * handle CHECK constraints
2947 : *
2948 : * Right now, there's nothing to do here when called from ALTER TABLE,
2949 : * but the other constraint-transformation functions are called in both
2950 : * the CREATE TABLE and ALTER TABLE paths, so do the same here, and just
2951 : * don't do anything if we're not authorized to skip validation.
2952 : */
2953 : static void
2954 64708 : transformCheckConstraints(CreateStmtContext *cxt, bool skipValidation)
2955 : {
2956 : ListCell *ckclist;
2957 :
2958 64708 : if (cxt->ckconstraints == NIL)
2959 62870 : return;
2960 :
2961 : /*
2962 : * When creating a new table (but not a foreign table), we can safely skip
2963 : * the validation of check constraints and mark them as valid based on the
2964 : * constraint enforcement flag, since NOT ENFORCED constraints must always
2965 : * be marked as NOT VALID. (This will override any user-supplied NOT VALID
2966 : * flag.)
2967 : */
2968 1838 : if (skipValidation)
2969 : {
2970 1608 : foreach(ckclist, cxt->ckconstraints)
2971 : {
2972 874 : Constraint *constraint = (Constraint *) lfirst(ckclist);
2973 :
2974 874 : constraint->skip_validation = true;
2975 874 : constraint->initially_valid = constraint->is_enforced;
2976 : }
2977 : }
2978 : }
2979 :
2980 : /*
2981 : * transformFKConstraints
2982 : * handle FOREIGN KEY constraints
2983 : */
2984 : static void
2985 64708 : transformFKConstraints(CreateStmtContext *cxt,
2986 : bool skipValidation, bool isAddConstraint)
2987 : {
2988 : ListCell *fkclist;
2989 :
2990 64708 : if (cxt->fkconstraints == NIL)
2991 60592 : return;
2992 :
2993 : /*
2994 : * If CREATE TABLE or adding a column with NULL default, we can safely
2995 : * skip validation of FK constraints, and mark them as valid based on the
2996 : * constraint enforcement flag, since NOT ENFORCED constraints must always
2997 : * be marked as NOT VALID. (This will override any user-supplied NOT VALID
2998 : * flag.)
2999 : */
3000 4116 : if (skipValidation)
3001 : {
3002 2920 : foreach(fkclist, cxt->fkconstraints)
3003 : {
3004 1494 : Constraint *constraint = (Constraint *) lfirst(fkclist);
3005 :
3006 1494 : constraint->skip_validation = true;
3007 1494 : constraint->initially_valid = constraint->is_enforced;
3008 : }
3009 : }
3010 :
3011 : /*
3012 : * For CREATE TABLE or ALTER TABLE ADD COLUMN, gin up an ALTER TABLE ADD
3013 : * CONSTRAINT command to execute after the basic command is complete. (If
3014 : * called from ADD CONSTRAINT, that routine will add the FK constraints to
3015 : * its own subcommand list.)
3016 : *
3017 : * Note: the ADD CONSTRAINT command must also execute after any index
3018 : * creation commands. Thus, this should run after
3019 : * transformIndexConstraints, so that the CREATE INDEX commands are
3020 : * already in cxt->alist. See also the handling of cxt->likeclauses.
3021 : */
3022 4116 : if (!isAddConstraint)
3023 : {
3024 1420 : AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
3025 :
3026 1420 : alterstmt->relation = cxt->relation;
3027 1420 : alterstmt->cmds = NIL;
3028 1420 : alterstmt->objtype = OBJECT_TABLE;
3029 :
3030 2908 : foreach(fkclist, cxt->fkconstraints)
3031 : {
3032 1488 : Constraint *constraint = (Constraint *) lfirst(fkclist);
3033 1488 : AlterTableCmd *altercmd = makeNode(AlterTableCmd);
3034 :
3035 1488 : altercmd->subtype = AT_AddConstraint;
3036 1488 : altercmd->name = NULL;
3037 1488 : altercmd->def = (Node *) constraint;
3038 1488 : alterstmt->cmds = lappend(alterstmt->cmds, altercmd);
3039 : }
3040 :
3041 1420 : cxt->alist = lappend(cxt->alist, alterstmt);
3042 : }
3043 : }
3044 :
3045 : /*
3046 : * transformIndexStmt - parse analysis for CREATE INDEX and ALTER TABLE
3047 : *
3048 : * Note: this is a no-op for an index not using either index expressions or
3049 : * a predicate expression. There are several code paths that create indexes
3050 : * without bothering to call this, because they know they don't have any
3051 : * such expressions to deal with.
3052 : *
3053 : * To avoid race conditions, it's important that this function rely only on
3054 : * the passed-in relid (and not on stmt->relation) to determine the target
3055 : * relation.
3056 : */
3057 : IndexStmt *
3058 26804 : transformIndexStmt(Oid relid, IndexStmt *stmt, const char *queryString)
3059 : {
3060 : ParseState *pstate;
3061 : ParseNamespaceItem *nsitem;
3062 : ListCell *l;
3063 : Relation rel;
3064 :
3065 : /* Nothing to do if statement already transformed. */
3066 26804 : if (stmt->transformed)
3067 130 : return stmt;
3068 :
3069 : /* Set up pstate */
3070 26674 : pstate = make_parsestate(NULL);
3071 26674 : pstate->p_sourcetext = queryString;
3072 :
3073 : /*
3074 : * Put the parent table into the rtable so that the expressions can refer
3075 : * to its fields without qualification. Caller is responsible for locking
3076 : * relation, but we still need to open it.
3077 : */
3078 26674 : rel = relation_open(relid, NoLock);
3079 26674 : nsitem = addRangeTableEntryForRelation(pstate, rel,
3080 : AccessShareLock,
3081 : NULL, false, true);
3082 :
3083 : /* no to join list, yes to namespaces */
3084 26674 : addNSItemToQuery(pstate, nsitem, false, true, true);
3085 :
3086 : /* take care of the where clause */
3087 26674 : if (stmt->whereClause)
3088 : {
3089 416 : stmt->whereClause = transformWhereClause(pstate,
3090 : stmt->whereClause,
3091 : EXPR_KIND_INDEX_PREDICATE,
3092 : "WHERE");
3093 : /* we have to fix its collations too */
3094 416 : assign_expr_collations(pstate, stmt->whereClause);
3095 : }
3096 :
3097 : /* take care of any index expressions */
3098 63616 : foreach(l, stmt->indexParams)
3099 : {
3100 36954 : IndexElem *ielem = (IndexElem *) lfirst(l);
3101 :
3102 36954 : if (ielem->expr)
3103 : {
3104 : /* Extract preliminary index col name before transforming expr */
3105 968 : if (ielem->indexcolname == NULL)
3106 968 : ielem->indexcolname = FigureIndexColname(ielem->expr);
3107 :
3108 : /* Now do parse transformation of the expression */
3109 968 : ielem->expr = transformExpr(pstate, ielem->expr,
3110 : EXPR_KIND_INDEX_EXPRESSION);
3111 :
3112 : /* We have to fix its collations too */
3113 956 : assign_expr_collations(pstate, ielem->expr);
3114 :
3115 : /*
3116 : * transformExpr() should have already rejected subqueries,
3117 : * aggregates, window functions, and SRFs, based on the EXPR_KIND_
3118 : * for an index expression.
3119 : *
3120 : * DefineIndex() will make more checks.
3121 : */
3122 : }
3123 : }
3124 :
3125 : /*
3126 : * Check that only the base rel is mentioned. (This should be dead code
3127 : * now that add_missing_from is history.)
3128 : */
3129 26662 : if (list_length(pstate->p_rtable) != 1)
3130 0 : ereport(ERROR,
3131 : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
3132 : errmsg("index expressions and predicates can refer only to the table being indexed")));
3133 :
3134 26662 : free_parsestate(pstate);
3135 :
3136 : /* Close relation */
3137 26662 : table_close(rel, NoLock);
3138 :
3139 : /* Mark statement as successfully transformed */
3140 26662 : stmt->transformed = true;
3141 :
3142 26662 : return stmt;
3143 : }
3144 :
3145 : /*
3146 : * transformStatsStmt - parse analysis for CREATE STATISTICS
3147 : *
3148 : * To avoid race conditions, it's important that this function relies only on
3149 : * the passed-in relid (and not on stmt->relation) to determine the target
3150 : * relation.
3151 : */
3152 : CreateStatsStmt *
3153 874 : transformStatsStmt(Oid relid, CreateStatsStmt *stmt, const char *queryString)
3154 : {
3155 : ParseState *pstate;
3156 : ParseNamespaceItem *nsitem;
3157 : ListCell *l;
3158 : Relation rel;
3159 :
3160 : /* Nothing to do if statement already transformed. */
3161 874 : if (stmt->transformed)
3162 48 : return stmt;
3163 :
3164 : /* Set up pstate */
3165 826 : pstate = make_parsestate(NULL);
3166 826 : pstate->p_sourcetext = queryString;
3167 :
3168 : /*
3169 : * Put the parent table into the rtable so that the expressions can refer
3170 : * to its fields without qualification. Caller is responsible for locking
3171 : * relation, but we still need to open it.
3172 : */
3173 826 : rel = relation_open(relid, NoLock);
3174 826 : nsitem = addRangeTableEntryForRelation(pstate, rel,
3175 : AccessShareLock,
3176 : NULL, false, true);
3177 :
3178 : /* no to join list, yes to namespaces */
3179 826 : addNSItemToQuery(pstate, nsitem, false, true, true);
3180 :
3181 : /* take care of any expressions */
3182 2840 : foreach(l, stmt->exprs)
3183 : {
3184 2014 : StatsElem *selem = (StatsElem *) lfirst(l);
3185 :
3186 2014 : if (selem->expr)
3187 : {
3188 : /* Now do parse transformation of the expression */
3189 510 : selem->expr = transformExpr(pstate, selem->expr,
3190 : EXPR_KIND_STATS_EXPRESSION);
3191 :
3192 : /* We have to fix its collations too */
3193 510 : assign_expr_collations(pstate, selem->expr);
3194 : }
3195 : }
3196 :
3197 : /*
3198 : * Check that only the base rel is mentioned. (This should be dead code
3199 : * now that add_missing_from is history.)
3200 : */
3201 826 : if (list_length(pstate->p_rtable) != 1)
3202 0 : ereport(ERROR,
3203 : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
3204 : errmsg("statistics expressions can refer only to the table being referenced")));
3205 :
3206 826 : free_parsestate(pstate);
3207 :
3208 : /* Close relation */
3209 826 : table_close(rel, NoLock);
3210 :
3211 : /* Mark statement as successfully transformed */
3212 826 : stmt->transformed = true;
3213 :
3214 826 : return stmt;
3215 : }
3216 :
3217 :
3218 : /*
3219 : * transformRuleStmt -
3220 : * transform a CREATE RULE Statement. The action is a list of parse
3221 : * trees which is transformed into a list of query trees, and we also
3222 : * transform the WHERE clause if any.
3223 : *
3224 : * actions and whereClause are output parameters that receive the
3225 : * transformed results.
3226 : */
3227 : void
3228 1102 : transformRuleStmt(RuleStmt *stmt, const char *queryString,
3229 : List **actions, Node **whereClause)
3230 : {
3231 : Relation rel;
3232 : ParseState *pstate;
3233 : ParseNamespaceItem *oldnsitem;
3234 : ParseNamespaceItem *newnsitem;
3235 :
3236 : /*
3237 : * To avoid deadlock, make sure the first thing we do is grab
3238 : * AccessExclusiveLock on the target relation. This will be needed by
3239 : * DefineQueryRewrite(), and we don't want to grab a lesser lock
3240 : * beforehand.
3241 : */
3242 1102 : rel = table_openrv(stmt->relation, AccessExclusiveLock);
3243 :
3244 1102 : if (rel->rd_rel->relkind == RELKIND_MATVIEW)
3245 0 : ereport(ERROR,
3246 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3247 : errmsg("rules on materialized views are not supported")));
3248 :
3249 : /* Set up pstate */
3250 1102 : pstate = make_parsestate(NULL);
3251 1102 : pstate->p_sourcetext = queryString;
3252 :
3253 : /*
3254 : * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
3255 : * Set up their ParseNamespaceItems in the main pstate for use in parsing
3256 : * the rule qualification.
3257 : */
3258 1102 : oldnsitem = addRangeTableEntryForRelation(pstate, rel,
3259 : AccessShareLock,
3260 : makeAlias("old", NIL),
3261 : false, false);
3262 1102 : newnsitem = addRangeTableEntryForRelation(pstate, rel,
3263 : AccessShareLock,
3264 : makeAlias("new", NIL),
3265 : false, false);
3266 :
3267 : /*
3268 : * They must be in the namespace too for lookup purposes, but only add the
3269 : * one(s) that are relevant for the current kind of rule. In an UPDATE
3270 : * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
3271 : * there's no need to be so picky for INSERT & DELETE. We do not add them
3272 : * to the joinlist.
3273 : */
3274 1102 : switch (stmt->event)
3275 : {
3276 18 : case CMD_SELECT:
3277 18 : addNSItemToQuery(pstate, oldnsitem, false, true, true);
3278 18 : break;
3279 436 : case CMD_UPDATE:
3280 436 : addNSItemToQuery(pstate, oldnsitem, false, true, true);
3281 436 : addNSItemToQuery(pstate, newnsitem, false, true, true);
3282 436 : break;
3283 484 : case CMD_INSERT:
3284 484 : addNSItemToQuery(pstate, newnsitem, false, true, true);
3285 484 : break;
3286 164 : case CMD_DELETE:
3287 164 : addNSItemToQuery(pstate, oldnsitem, false, true, true);
3288 164 : break;
3289 0 : default:
3290 0 : elog(ERROR, "unrecognized event type: %d",
3291 : (int) stmt->event);
3292 : break;
3293 : }
3294 :
3295 : /* take care of the where clause */
3296 1102 : *whereClause = transformWhereClause(pstate,
3297 : stmt->whereClause,
3298 : EXPR_KIND_WHERE,
3299 : "WHERE");
3300 : /* we have to fix its collations too */
3301 1102 : assign_expr_collations(pstate, *whereClause);
3302 :
3303 : /* this is probably dead code without add_missing_from: */
3304 1102 : if (list_length(pstate->p_rtable) != 2) /* naughty, naughty... */
3305 0 : ereport(ERROR,
3306 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3307 : errmsg("rule WHERE condition cannot contain references to other relations")));
3308 :
3309 : /*
3310 : * 'instead nothing' rules with a qualification need a query rangetable so
3311 : * the rewrite handler can add the negated rule qualification to the
3312 : * original query. We create a query with the new command type CMD_NOTHING
3313 : * here that is treated specially by the rewrite system.
3314 : */
3315 1102 : if (stmt->actions == NIL)
3316 : {
3317 164 : Query *nothing_qry = makeNode(Query);
3318 :
3319 164 : nothing_qry->commandType = CMD_NOTHING;
3320 164 : nothing_qry->rtable = pstate->p_rtable;
3321 164 : nothing_qry->rteperminfos = pstate->p_rteperminfos;
3322 164 : nothing_qry->jointree = makeFromExpr(NIL, NULL); /* no join wanted */
3323 :
3324 164 : *actions = list_make1(nothing_qry);
3325 : }
3326 : else
3327 : {
3328 : ListCell *l;
3329 938 : List *newactions = NIL;
3330 :
3331 : /*
3332 : * transform each statement, like parse_sub_analyze()
3333 : */
3334 1904 : foreach(l, stmt->actions)
3335 : {
3336 984 : Node *action = (Node *) lfirst(l);
3337 984 : ParseState *sub_pstate = make_parsestate(NULL);
3338 : Query *sub_qry,
3339 : *top_subqry;
3340 : bool has_old,
3341 : has_new;
3342 :
3343 : /*
3344 : * Since outer ParseState isn't parent of inner, have to pass down
3345 : * the query text by hand.
3346 : */
3347 984 : sub_pstate->p_sourcetext = queryString;
3348 :
3349 : /*
3350 : * Set up OLD/NEW in the rtable for this statement. The entries
3351 : * are added only to relnamespace, not varnamespace, because we
3352 : * don't want them to be referred to by unqualified field names
3353 : * nor "*" in the rule actions. We decide later whether to put
3354 : * them in the joinlist.
3355 : */
3356 984 : oldnsitem = addRangeTableEntryForRelation(sub_pstate, rel,
3357 : AccessShareLock,
3358 : makeAlias("old", NIL),
3359 : false, false);
3360 984 : newnsitem = addRangeTableEntryForRelation(sub_pstate, rel,
3361 : AccessShareLock,
3362 : makeAlias("new", NIL),
3363 : false, false);
3364 984 : addNSItemToQuery(sub_pstate, oldnsitem, false, true, false);
3365 984 : addNSItemToQuery(sub_pstate, newnsitem, false, true, false);
3366 :
3367 : /* Transform the rule action statement */
3368 984 : top_subqry = transformStmt(sub_pstate, action);
3369 :
3370 : /*
3371 : * We cannot support utility-statement actions (eg NOTIFY) with
3372 : * nonempty rule WHERE conditions, because there's no way to make
3373 : * the utility action execute conditionally.
3374 : */
3375 972 : if (top_subqry->commandType == CMD_UTILITY &&
3376 40 : *whereClause != NULL)
3377 0 : ereport(ERROR,
3378 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3379 : errmsg("rules with WHERE conditions can only have SELECT, INSERT, UPDATE, or DELETE actions")));
3380 :
3381 : /*
3382 : * If the action is INSERT...SELECT, OLD/NEW have been pushed down
3383 : * into the SELECT, and that's what we need to look at. (Ugly
3384 : * kluge ... try to fix this when we redesign querytrees.)
3385 : */
3386 972 : sub_qry = getInsertSelectQuery(top_subqry, NULL);
3387 :
3388 : /*
3389 : * If the sub_qry is a setop, we cannot attach any qualifications
3390 : * to it, because the planner won't notice them. This could
3391 : * perhaps be relaxed someday, but for now, we may as well reject
3392 : * such a rule immediately.
3393 : */
3394 972 : if (sub_qry->setOperations != NULL && *whereClause != NULL)
3395 0 : ereport(ERROR,
3396 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3397 : errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
3398 :
3399 : /*
3400 : * Validate action's use of OLD/NEW, qual too
3401 : */
3402 972 : has_old =
3403 1554 : rangeTableEntry_used((Node *) sub_qry, PRS2_OLD_VARNO, 0) ||
3404 582 : rangeTableEntry_used(*whereClause, PRS2_OLD_VARNO, 0);
3405 972 : has_new =
3406 1300 : rangeTableEntry_used((Node *) sub_qry, PRS2_NEW_VARNO, 0) ||
3407 328 : rangeTableEntry_used(*whereClause, PRS2_NEW_VARNO, 0);
3408 :
3409 972 : switch (stmt->event)
3410 : {
3411 18 : case CMD_SELECT:
3412 18 : if (has_old)
3413 0 : ereport(ERROR,
3414 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3415 : errmsg("ON SELECT rule cannot use OLD")));
3416 18 : if (has_new)
3417 0 : ereport(ERROR,
3418 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3419 : errmsg("ON SELECT rule cannot use NEW")));
3420 18 : break;
3421 346 : case CMD_UPDATE:
3422 : /* both are OK */
3423 346 : break;
3424 440 : case CMD_INSERT:
3425 440 : if (has_old)
3426 0 : ereport(ERROR,
3427 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3428 : errmsg("ON INSERT rule cannot use OLD")));
3429 440 : break;
3430 168 : case CMD_DELETE:
3431 168 : if (has_new)
3432 0 : ereport(ERROR,
3433 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3434 : errmsg("ON DELETE rule cannot use NEW")));
3435 168 : break;
3436 0 : default:
3437 0 : elog(ERROR, "unrecognized event type: %d",
3438 : (int) stmt->event);
3439 : break;
3440 : }
3441 :
3442 : /*
3443 : * OLD/NEW are not allowed in WITH queries, because they would
3444 : * amount to outer references for the WITH, which we disallow.
3445 : * However, they were already in the outer rangetable when we
3446 : * analyzed the query, so we have to check.
3447 : *
3448 : * Note that in the INSERT...SELECT case, we need to examine the
3449 : * CTE lists of both top_subqry and sub_qry.
3450 : *
3451 : * Note that we aren't digging into the body of the query looking
3452 : * for WITHs in nested sub-SELECTs. A WITH down there can
3453 : * legitimately refer to OLD/NEW, because it'd be an
3454 : * indirect-correlated outer reference.
3455 : */
3456 972 : if (rangeTableEntry_used((Node *) top_subqry->cteList,
3457 966 : PRS2_OLD_VARNO, 0) ||
3458 966 : rangeTableEntry_used((Node *) sub_qry->cteList,
3459 : PRS2_OLD_VARNO, 0))
3460 6 : ereport(ERROR,
3461 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3462 : errmsg("cannot refer to OLD within WITH query")));
3463 966 : if (rangeTableEntry_used((Node *) top_subqry->cteList,
3464 966 : PRS2_NEW_VARNO, 0) ||
3465 966 : rangeTableEntry_used((Node *) sub_qry->cteList,
3466 : PRS2_NEW_VARNO, 0))
3467 0 : ereport(ERROR,
3468 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3469 : errmsg("cannot refer to NEW within WITH query")));
3470 :
3471 : /*
3472 : * For efficiency's sake, add OLD to the rule action's jointree
3473 : * only if it was actually referenced in the statement or qual.
3474 : *
3475 : * For INSERT, NEW is not really a relation (only a reference to
3476 : * the to-be-inserted tuple) and should never be added to the
3477 : * jointree.
3478 : *
3479 : * For UPDATE, we treat NEW as being another kind of reference to
3480 : * OLD, because it represents references to *transformed* tuples
3481 : * of the existing relation. It would be wrong to enter NEW
3482 : * separately in the jointree, since that would cause a double
3483 : * join of the updated relation. It's also wrong to fail to make
3484 : * a jointree entry if only NEW and not OLD is mentioned.
3485 : */
3486 966 : if (has_old || (has_new && stmt->event == CMD_UPDATE))
3487 : {
3488 : RangeTblRef *rtr;
3489 :
3490 : /*
3491 : * If sub_qry is a setop, manipulating its jointree will do no
3492 : * good at all, because the jointree is dummy. (This should be
3493 : * a can't-happen case because of prior tests.)
3494 : */
3495 432 : if (sub_qry->setOperations != NULL)
3496 0 : ereport(ERROR,
3497 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3498 : errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
3499 : /* hackishly add OLD to the already-built FROM clause */
3500 432 : rtr = makeNode(RangeTblRef);
3501 432 : rtr->rtindex = oldnsitem->p_rtindex;
3502 432 : sub_qry->jointree->fromlist =
3503 432 : lappend(sub_qry->jointree->fromlist, rtr);
3504 : }
3505 :
3506 966 : newactions = lappend(newactions, top_subqry);
3507 :
3508 966 : free_parsestate(sub_pstate);
3509 : }
3510 :
3511 920 : *actions = newactions;
3512 : }
3513 :
3514 1084 : free_parsestate(pstate);
3515 :
3516 : /* Close relation, but keep the exclusive lock */
3517 1084 : table_close(rel, NoLock);
3518 1084 : }
3519 :
3520 :
3521 : /*
3522 : * checkPartition
3523 : * Check whether partRelOid is a leaf partition of the parent table (rel).
3524 : * isMerge: true indicates the operation is "ALTER TABLE ... MERGE PARTITIONS";
3525 : * false indicates the operation is "ALTER TABLE ... SPLIT PARTITION".
3526 : */
3527 : static void
3528 888 : checkPartition(Relation rel, Oid partRelOid, bool isMerge)
3529 : {
3530 : Relation partRel;
3531 :
3532 888 : partRel = table_open(partRelOid, NoLock);
3533 :
3534 888 : if (partRel->rd_rel->relkind != RELKIND_RELATION)
3535 6 : ereport(ERROR,
3536 : errcode(ERRCODE_WRONG_OBJECT_TYPE),
3537 : errmsg("\"%s\" is not a table", RelationGetRelationName(partRel)),
3538 : isMerge
3539 : ? errhint("ALTER TABLE ... MERGE PARTITIONS can only merge partitions don't have sub-partitions")
3540 : : errhint("ALTER TABLE ... SPLIT PARTITION can only split partitions don't have sub-partitions"));
3541 :
3542 882 : if (!partRel->rd_rel->relispartition)
3543 18 : ereport(ERROR,
3544 : errcode(ERRCODE_WRONG_OBJECT_TYPE),
3545 : errmsg("\"%s\" is not a partition of partitioned table \"%s\"",
3546 : RelationGetRelationName(partRel), RelationGetRelationName(rel)),
3547 : isMerge
3548 : ? errhint("ALTER TABLE ... MERGE PARTITIONS can only merge partitions don't have sub-partitions")
3549 : : errhint("ALTER TABLE ... SPLIT PARTITION can only split partitions don't have sub-partitions"));
3550 :
3551 864 : if (get_partition_parent(partRelOid, false) != RelationGetRelid(rel))
3552 18 : ereport(ERROR,
3553 : errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
3554 : errmsg("relation \"%s\" is not a partition of relation \"%s\"",
3555 : RelationGetRelationName(partRel), RelationGetRelationName(rel)),
3556 : isMerge
3557 : ? errhint("ALTER TABLE ... MERGE PARTITIONS can only merge partitions don't have sub-partitions")
3558 : : errhint("ALTER TABLE ... SPLIT PARTITION can only split partitions don't have sub-partitions"));
3559 :
3560 846 : table_close(partRel, NoLock);
3561 846 : }
3562 :
3563 : /*
3564 : * transformPartitionCmdForSplit -
3565 : * analyze the ALTER TABLE ... SPLIT PARTITION command
3566 : *
3567 : * For each new partition, sps->bound is set to the transformed value of bound.
3568 : * Does checks for bounds of new partitions.
3569 : */
3570 : static void
3571 366 : transformPartitionCmdForSplit(CreateStmtContext *cxt, PartitionCmd *partcmd)
3572 : {
3573 366 : Relation parent = cxt->rel;
3574 : PartitionKey key;
3575 : char strategy;
3576 : Oid splitPartOid;
3577 : Oid defaultPartOid;
3578 366 : int default_index = -1;
3579 : bool isSplitPartDefault;
3580 : ListCell *listptr,
3581 : *listptr2;
3582 : List *splitlist;
3583 :
3584 366 : splitlist = partcmd->partlist;
3585 366 : key = RelationGetPartitionKey(parent);
3586 366 : strategy = get_partition_strategy(key);
3587 366 : defaultPartOid = get_default_oid_from_partdesc(RelationGetPartitionDesc(parent, true));
3588 :
3589 : /* Transform partition bounds for all partitions in the list: */
3590 1770 : foreach_node(SinglePartitionSpec, sps, splitlist)
3591 : {
3592 1050 : cxt->partbound = NULL;
3593 1050 : transformPartitionCmd(cxt, sps->bound);
3594 : /* Assign the transformed value of the partition bound. */
3595 1044 : sps->bound = cxt->partbound;
3596 : }
3597 :
3598 : /*
3599 : * Open and lock the partition, check ownership along the way. We need to
3600 : * use AccessExclusiveLock here because this split partition will be
3601 : * detached, then dropped in ATExecSplitPartition.
3602 : */
3603 360 : splitPartOid = RangeVarGetRelidExtended(partcmd->name, AccessExclusiveLock,
3604 : 0, RangeVarCallbackOwnsRelation,
3605 : NULL);
3606 :
3607 348 : checkPartition(parent, splitPartOid, false);
3608 :
3609 342 : switch (strategy)
3610 : {
3611 336 : case PARTITION_STRATEGY_LIST:
3612 : case PARTITION_STRATEGY_RANGE:
3613 : {
3614 1650 : foreach_node(SinglePartitionSpec, sps, splitlist)
3615 : {
3616 990 : if (sps->bound->is_default)
3617 : {
3618 84 : if (default_index != -1)
3619 6 : ereport(ERROR,
3620 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3621 : errmsg("DEFAULT partition should be one"),
3622 : parser_errposition(cxt->pstate, sps->name->location));
3623 :
3624 78 : default_index = foreach_current_index(sps);
3625 : }
3626 : }
3627 : }
3628 330 : break;
3629 :
3630 6 : case PARTITION_STRATEGY_HASH:
3631 6 : ereport(ERROR,
3632 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3633 : errmsg("partition of hash-partitioned table cannot be split"));
3634 : break;
3635 :
3636 0 : default:
3637 0 : elog(ERROR, "unexpected partition strategy: %d",
3638 : (int) key->strategy);
3639 : break;
3640 : }
3641 :
3642 : /* isSplitPartDefault: is the being split partition a DEFAULT partition? */
3643 330 : isSplitPartDefault = (defaultPartOid == splitPartOid);
3644 :
3645 330 : if (isSplitPartDefault && default_index == -1)
3646 6 : ereport(ERROR,
3647 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3648 : errmsg("can not split DEFAULT partition \"%s\"",
3649 : get_rel_name(splitPartOid)),
3650 : errhint("To split DEFAULT partition one of the new partition msut be DEFAULT"),
3651 : parser_errposition(cxt->pstate, ((SinglePartitionSpec *) linitial(splitlist))->name->location));
3652 :
3653 : /*
3654 : * If the partition being split is not the DEFAULT partition, but the
3655 : * DEFAULT partition exists, then none of the resulting split partitions
3656 : * can be the DEFAULT.
3657 : */
3658 324 : if (!isSplitPartDefault && (default_index != -1) && OidIsValid(defaultPartOid))
3659 : {
3660 : SinglePartitionSpec *spsDef =
3661 6 : (SinglePartitionSpec *) list_nth(splitlist, default_index);
3662 :
3663 6 : ereport(ERROR,
3664 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3665 : errmsg("can not split non-DEFAULT partition \"%s\"",
3666 : get_rel_name(splitPartOid)),
3667 : errmsg("new partition cannot be DEFAULT because DEFAULT partition \"%s\" already exists",
3668 : get_rel_name(defaultPartOid)),
3669 : parser_errposition(cxt->pstate, spsDef->name->location));
3670 : }
3671 :
3672 1182 : foreach(listptr, splitlist)
3673 : {
3674 : Oid nspid;
3675 882 : SinglePartitionSpec *sps = (SinglePartitionSpec *) lfirst(listptr);
3676 882 : RangeVar *name = sps->name;
3677 :
3678 882 : nspid = RangeVarGetCreationNamespace(sps->name);
3679 :
3680 : /* Partitions in the list should have different names. */
3681 1788 : for_each_cell(listptr2, splitlist, lnext(splitlist, listptr))
3682 : {
3683 : Oid nspid2;
3684 924 : SinglePartitionSpec *sps2 = (SinglePartitionSpec *) lfirst(listptr2);
3685 924 : RangeVar *name2 = sps2->name;
3686 :
3687 924 : if (equal(name, name2))
3688 12 : ereport(ERROR,
3689 : errcode(ERRCODE_DUPLICATE_TABLE),
3690 : errmsg("partition with name \"%s\" is already used", name->relname),
3691 : parser_errposition(cxt->pstate, name2->location));
3692 :
3693 912 : nspid2 = RangeVarGetCreationNamespace(sps2->name);
3694 :
3695 912 : if (nspid2 == nspid && strcmp(name->relname, name2->relname) == 0)
3696 6 : ereport(ERROR,
3697 : errcode(ERRCODE_DUPLICATE_TABLE),
3698 : errmsg("partition with name \"%s\" is already used", name->relname),
3699 : parser_errposition(cxt->pstate, name2->location));
3700 : }
3701 : }
3702 :
3703 : /* Then we should check partitions with transformed bounds. */
3704 300 : check_partitions_for_split(parent, splitPartOid, splitlist, cxt->pstate);
3705 198 : }
3706 :
3707 :
3708 : /*
3709 : * transformPartitionCmdForMerge -
3710 : * analyze the ALTER TABLE ... MERGE PARTITIONS command
3711 : *
3712 : * Does simple checks for merged partitions. Calculates bound of the resulting
3713 : * partition.
3714 : */
3715 : static void
3716 258 : transformPartitionCmdForMerge(CreateStmtContext *cxt, PartitionCmd *partcmd)
3717 : {
3718 : Oid defaultPartOid;
3719 : Oid partOid;
3720 258 : Relation parent = cxt->rel;
3721 : PartitionKey key;
3722 : char strategy;
3723 : ListCell *listptr,
3724 : *listptr2;
3725 258 : bool isDefaultPart = false;
3726 258 : List *partOids = NIL;
3727 :
3728 258 : key = RelationGetPartitionKey(parent);
3729 258 : strategy = get_partition_strategy(key);
3730 :
3731 258 : if (strategy == PARTITION_STRATEGY_HASH)
3732 6 : ereport(ERROR,
3733 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3734 : errmsg("partition of hash-partitioned table cannot be merged"));
3735 :
3736 : /* Does the partitioned table (parent) have a default partition? */
3737 252 : defaultPartOid = get_default_oid_from_partdesc(RelationGetPartitionDesc(parent, true));
3738 :
3739 756 : foreach(listptr, partcmd->partlist)
3740 : {
3741 564 : RangeVar *name = (RangeVar *) lfirst(listptr);
3742 :
3743 : /* Partitions in the list should have different names. */
3744 984 : for_each_cell(listptr2, partcmd->partlist, lnext(partcmd->partlist, listptr))
3745 : {
3746 426 : RangeVar *name2 = (RangeVar *) lfirst(listptr2);
3747 :
3748 426 : if (equal(name, name2))
3749 6 : ereport(ERROR,
3750 : errcode(ERRCODE_DUPLICATE_TABLE),
3751 : errmsg("partition with name \"%s\" is already used", name->relname),
3752 : parser_errposition(cxt->pstate, name2->location));
3753 : }
3754 :
3755 : /*
3756 : * Search the DEFAULT partition in the list. Open and lock partitions
3757 : * before calculating the boundary for resulting partition, we also
3758 : * check for ownership along the way. We need to use
3759 : * AccessExclusiveLock here, because these merged partitions will be
3760 : * detached and then dropped in ATExecMergePartitions.
3761 : */
3762 558 : partOid = RangeVarGetRelidExtended(name, AccessExclusiveLock, 0,
3763 : RangeVarCallbackOwnsRelation,
3764 : NULL);
3765 : /* Is the current partition a DEFAULT partition? */
3766 546 : if (partOid == defaultPartOid)
3767 6 : isDefaultPart = true;
3768 :
3769 : /*
3770 : * Extended check because the same partition can have different names
3771 : * (for example, "part_name" and "public.part_name").
3772 : */
3773 918 : foreach(listptr2, partOids)
3774 : {
3775 378 : Oid curOid = lfirst_oid(listptr2);
3776 :
3777 378 : if (curOid == partOid)
3778 6 : ereport(ERROR,
3779 : errcode(ERRCODE_DUPLICATE_TABLE),
3780 : errmsg("partition with name \"%s\" is already used", name->relname),
3781 : parser_errposition(cxt->pstate, name->location));
3782 : }
3783 :
3784 540 : checkPartition(parent, partOid, true);
3785 :
3786 504 : partOids = lappend_oid(partOids, partOid);
3787 : }
3788 :
3789 : /* Allocate the bound of the resulting partition. */
3790 : Assert(partcmd->bound == NULL);
3791 192 : partcmd->bound = makeNode(PartitionBoundSpec);
3792 :
3793 : /* Fill the partition bound. */
3794 192 : partcmd->bound->strategy = strategy;
3795 192 : partcmd->bound->location = -1;
3796 192 : partcmd->bound->is_default = isDefaultPart;
3797 192 : if (!isDefaultPart)
3798 186 : calculate_partition_bound_for_merge(parent, partcmd->partlist,
3799 : partOids, partcmd->bound,
3800 : cxt->pstate);
3801 180 : }
3802 :
3803 : /*
3804 : * transformAlterTableStmt -
3805 : * parse analysis for ALTER TABLE
3806 : *
3807 : * Returns the transformed AlterTableStmt. There may be additional actions
3808 : * to be done before and after the transformed statement, which are returned
3809 : * in *beforeStmts and *afterStmts as lists of utility command parsetrees.
3810 : *
3811 : * To avoid race conditions, it's important that this function rely only on
3812 : * the passed-in relid (and not on stmt->relation) to determine the target
3813 : * relation.
3814 : */
3815 : AlterTableStmt *
3816 24838 : transformAlterTableStmt(Oid relid, AlterTableStmt *stmt,
3817 : const char *queryString,
3818 : List **beforeStmts, List **afterStmts)
3819 : {
3820 : Relation rel;
3821 : TupleDesc tupdesc;
3822 : ParseState *pstate;
3823 : CreateStmtContext cxt;
3824 : List *save_alist;
3825 : ListCell *lcmd,
3826 : *l;
3827 24838 : List *newcmds = NIL;
3828 24838 : bool skipValidation = true;
3829 : AlterTableCmd *newcmd;
3830 : ParseNamespaceItem *nsitem;
3831 :
3832 : /* Caller is responsible for locking the relation */
3833 24838 : rel = relation_open(relid, NoLock);
3834 24838 : tupdesc = RelationGetDescr(rel);
3835 :
3836 : /* Set up pstate */
3837 24838 : pstate = make_parsestate(NULL);
3838 24838 : pstate->p_sourcetext = queryString;
3839 24838 : nsitem = addRangeTableEntryForRelation(pstate,
3840 : rel,
3841 : AccessShareLock,
3842 : NULL,
3843 : false,
3844 : true);
3845 24838 : addNSItemToQuery(pstate, nsitem, false, true, true);
3846 :
3847 : /* Set up CreateStmtContext */
3848 24838 : cxt.pstate = pstate;
3849 24838 : if (rel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
3850 : {
3851 180 : cxt.stmtType = "ALTER FOREIGN TABLE";
3852 180 : cxt.isforeign = true;
3853 : }
3854 : else
3855 : {
3856 24658 : cxt.stmtType = "ALTER TABLE";
3857 24658 : cxt.isforeign = false;
3858 : }
3859 24838 : cxt.relation = stmt->relation;
3860 24838 : cxt.rel = rel;
3861 24838 : cxt.inhRelations = NIL;
3862 24838 : cxt.isalter = true;
3863 24838 : cxt.columns = NIL;
3864 24838 : cxt.ckconstraints = NIL;
3865 24838 : cxt.nnconstraints = NIL;
3866 24838 : cxt.fkconstraints = NIL;
3867 24838 : cxt.ixconstraints = NIL;
3868 24838 : cxt.likeclauses = NIL;
3869 24838 : cxt.blist = NIL;
3870 24838 : cxt.alist = NIL;
3871 24838 : cxt.pkey = NULL;
3872 24838 : cxt.ispartitioned = (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
3873 24838 : cxt.partbound = NULL;
3874 24838 : cxt.ofType = false;
3875 :
3876 : /*
3877 : * Transform ALTER subcommands that need it (most don't). These largely
3878 : * re-use code from CREATE TABLE.
3879 : */
3880 49370 : foreach(lcmd, stmt->cmds)
3881 : {
3882 24838 : AlterTableCmd *cmd = (AlterTableCmd *) lfirst(lcmd);
3883 :
3884 24838 : switch (cmd->subtype)
3885 : {
3886 2076 : case AT_AddColumn:
3887 : {
3888 2076 : ColumnDef *def = castNode(ColumnDef, cmd->def);
3889 :
3890 2076 : transformColumnDefinition(&cxt, def);
3891 :
3892 : /*
3893 : * If the column has a non-null default, we can't skip
3894 : * validation of foreign keys.
3895 : */
3896 2070 : if (def->raw_default != NULL)
3897 858 : skipValidation = false;
3898 :
3899 : /*
3900 : * All constraints are processed in other ways. Remove the
3901 : * original list
3902 : */
3903 2070 : def->constraints = NIL;
3904 :
3905 2070 : newcmds = lappend(newcmds, cmd);
3906 2070 : break;
3907 : }
3908 :
3909 16938 : case AT_AddConstraint:
3910 :
3911 : /*
3912 : * The original AddConstraint cmd node doesn't go to newcmds
3913 : */
3914 16938 : if (IsA(cmd->def, Constraint))
3915 : {
3916 16938 : transformTableConstraint(&cxt, (Constraint *) cmd->def);
3917 16932 : if (((Constraint *) cmd->def)->contype == CONSTR_FOREIGN)
3918 2690 : skipValidation = false;
3919 : }
3920 : else
3921 0 : elog(ERROR, "unrecognized node type: %d",
3922 : (int) nodeTag(cmd->def));
3923 16932 : break;
3924 :
3925 1432 : case AT_AlterColumnType:
3926 : {
3927 1432 : ColumnDef *def = castNode(ColumnDef, cmd->def);
3928 : AttrNumber attnum;
3929 :
3930 : /*
3931 : * For ALTER COLUMN TYPE, transform the USING clause if
3932 : * one was specified.
3933 : */
3934 1432 : if (def->raw_default)
3935 : {
3936 252 : def->cooked_default =
3937 252 : transformExpr(pstate, def->raw_default,
3938 : EXPR_KIND_ALTER_COL_TRANSFORM);
3939 : }
3940 :
3941 : /*
3942 : * For identity column, create ALTER SEQUENCE command to
3943 : * change the data type of the sequence. Identity sequence
3944 : * is associated with the top level partitioned table.
3945 : * Hence ignore partitions.
3946 : */
3947 1432 : if (!RelationGetForm(rel)->relispartition)
3948 : {
3949 1330 : attnum = get_attnum(relid, cmd->name);
3950 1330 : if (attnum == InvalidAttrNumber)
3951 0 : ereport(ERROR,
3952 : (errcode(ERRCODE_UNDEFINED_COLUMN),
3953 : errmsg("column \"%s\" of relation \"%s\" does not exist",
3954 : cmd->name, RelationGetRelationName(rel))));
3955 :
3956 1330 : if (attnum > 0 &&
3957 1324 : TupleDescAttr(tupdesc, attnum - 1)->attidentity)
3958 : {
3959 36 : Oid seq_relid = getIdentitySequence(rel, attnum, false);
3960 36 : Oid typeOid = typenameTypeId(pstate, def->typeName);
3961 36 : AlterSeqStmt *altseqstmt = makeNode(AlterSeqStmt);
3962 :
3963 : altseqstmt->sequence
3964 36 : = makeRangeVar(get_namespace_name(get_rel_namespace(seq_relid)),
3965 : get_rel_name(seq_relid),
3966 : -1);
3967 36 : altseqstmt->options = list_make1(makeDefElem("as",
3968 : (Node *) makeTypeNameFromOid(typeOid, -1),
3969 : -1));
3970 36 : altseqstmt->for_identity = true;
3971 36 : cxt.blist = lappend(cxt.blist, altseqstmt);
3972 : }
3973 : }
3974 :
3975 1432 : newcmds = lappend(newcmds, cmd);
3976 1432 : break;
3977 : }
3978 :
3979 172 : case AT_AddIdentity:
3980 : {
3981 172 : Constraint *def = castNode(Constraint, cmd->def);
3982 172 : ColumnDef *newdef = makeNode(ColumnDef);
3983 : AttrNumber attnum;
3984 :
3985 172 : newdef->colname = cmd->name;
3986 172 : newdef->identity = def->generated_when;
3987 172 : cmd->def = (Node *) newdef;
3988 :
3989 172 : attnum = get_attnum(relid, cmd->name);
3990 172 : if (attnum == InvalidAttrNumber)
3991 6 : ereport(ERROR,
3992 : (errcode(ERRCODE_UNDEFINED_COLUMN),
3993 : errmsg("column \"%s\" of relation \"%s\" does not exist",
3994 : cmd->name, RelationGetRelationName(rel))));
3995 :
3996 166 : generateSerialExtraStmts(&cxt, newdef,
3997 : get_atttype(relid, attnum),
3998 : def->options, true, true,
3999 : NULL, NULL);
4000 :
4001 166 : newcmds = lappend(newcmds, cmd);
4002 166 : break;
4003 : }
4004 :
4005 62 : case AT_SetIdentity:
4006 : {
4007 : /*
4008 : * Create an ALTER SEQUENCE statement for the internal
4009 : * sequence of the identity column.
4010 : */
4011 : ListCell *lc;
4012 62 : List *newseqopts = NIL;
4013 62 : List *newdef = NIL;
4014 : AttrNumber attnum;
4015 : Oid seq_relid;
4016 :
4017 : /*
4018 : * Split options into those handled by ALTER SEQUENCE and
4019 : * those for ALTER TABLE proper.
4020 : */
4021 184 : foreach(lc, castNode(List, cmd->def))
4022 : {
4023 122 : DefElem *def = lfirst_node(DefElem, lc);
4024 :
4025 122 : if (strcmp(def->defname, "generated") == 0)
4026 44 : newdef = lappend(newdef, def);
4027 : else
4028 78 : newseqopts = lappend(newseqopts, def);
4029 : }
4030 :
4031 62 : attnum = get_attnum(relid, cmd->name);
4032 62 : if (attnum == InvalidAttrNumber)
4033 0 : ereport(ERROR,
4034 : (errcode(ERRCODE_UNDEFINED_COLUMN),
4035 : errmsg("column \"%s\" of relation \"%s\" does not exist",
4036 : cmd->name, RelationGetRelationName(rel))));
4037 :
4038 62 : seq_relid = getIdentitySequence(rel, attnum, true);
4039 :
4040 62 : if (seq_relid)
4041 : {
4042 : AlterSeqStmt *seqstmt;
4043 :
4044 50 : seqstmt = makeNode(AlterSeqStmt);
4045 50 : seqstmt->sequence = makeRangeVar(get_namespace_name(get_rel_namespace(seq_relid)),
4046 : get_rel_name(seq_relid), -1);
4047 50 : seqstmt->options = newseqopts;
4048 50 : seqstmt->for_identity = true;
4049 50 : seqstmt->missing_ok = false;
4050 :
4051 50 : cxt.blist = lappend(cxt.blist, seqstmt);
4052 : }
4053 :
4054 : /*
4055 : * If column was not an identity column, we just let the
4056 : * ALTER TABLE command error out later. (There are cases
4057 : * this fails to cover, but we'll need to restructure
4058 : * where creation of the sequence dependency linkage
4059 : * happens before we can fix it.)
4060 : */
4061 :
4062 62 : cmd->def = (Node *) newdef;
4063 62 : newcmds = lappend(newcmds, cmd);
4064 62 : break;
4065 : }
4066 :
4067 3516 : case AT_AttachPartition:
4068 : case AT_DetachPartition:
4069 : {
4070 3516 : PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
4071 :
4072 3516 : transformPartitionCmd(&cxt, partcmd->bound);
4073 : /* assign the transformed value of the partition bound */
4074 3492 : partcmd->bound = cxt.partbound;
4075 : }
4076 :
4077 3492 : newcmds = lappend(newcmds, cmd);
4078 3492 : break;
4079 :
4080 264 : case AT_MergePartitions:
4081 : {
4082 264 : PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
4083 :
4084 264 : if (list_length(partcmd->partlist) < 2)
4085 6 : ereport(ERROR,
4086 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4087 : errmsg("list of partitions to be merged should include at least two partitions"));
4088 :
4089 258 : transformPartitionCmdForMerge(&cxt, partcmd);
4090 180 : newcmds = lappend(newcmds, cmd);
4091 180 : break;
4092 : }
4093 :
4094 378 : case AT_SplitPartition:
4095 : {
4096 378 : PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
4097 :
4098 378 : if (list_length(partcmd->partlist) < 2)
4099 12 : ereport(ERROR,
4100 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4101 : errmsg("list of new partitions should contain at least two partitions"));
4102 :
4103 366 : transformPartitionCmdForSplit(&cxt, partcmd);
4104 198 : newcmds = lappend(newcmds, cmd);
4105 198 : break;
4106 : }
4107 :
4108 0 : default:
4109 :
4110 : /*
4111 : * Currently, we shouldn't actually get here for the
4112 : * subcommand types that don't require transformation; but if
4113 : * we do, just emit them unchanged.
4114 : */
4115 0 : newcmds = lappend(newcmds, cmd);
4116 0 : break;
4117 : }
4118 : }
4119 :
4120 : /*
4121 : * Transfer anything we already have in cxt.alist into save_alist, to keep
4122 : * it separate from the output of transformIndexConstraints.
4123 : */
4124 24532 : save_alist = cxt.alist;
4125 24532 : cxt.alist = NIL;
4126 :
4127 : /* Postprocess constraints */
4128 24532 : transformIndexConstraints(&cxt);
4129 24508 : transformFKConstraints(&cxt, skipValidation, true);
4130 24508 : transformCheckConstraints(&cxt, false);
4131 :
4132 : /*
4133 : * Push any index-creation commands into the ALTER, so that they can be
4134 : * scheduled nicely by tablecmds.c. Note that tablecmds.c assumes that
4135 : * the IndexStmt attached to an AT_AddIndex or AT_AddIndexConstraint
4136 : * subcommand has already been through transformIndexStmt.
4137 : */
4138 36806 : foreach(l, cxt.alist)
4139 : {
4140 12298 : Node *istmt = (Node *) lfirst(l);
4141 :
4142 : /*
4143 : * We assume here that cxt.alist contains only IndexStmts generated
4144 : * from primary key constraints.
4145 : */
4146 12298 : if (IsA(istmt, IndexStmt))
4147 : {
4148 12298 : IndexStmt *idxstmt = (IndexStmt *) istmt;
4149 :
4150 12298 : idxstmt = transformIndexStmt(relid, idxstmt, queryString);
4151 12298 : newcmd = makeNode(AlterTableCmd);
4152 12298 : newcmd->subtype = OidIsValid(idxstmt->indexOid) ? AT_AddIndexConstraint : AT_AddIndex;
4153 12298 : newcmd->def = (Node *) idxstmt;
4154 12298 : newcmds = lappend(newcmds, newcmd);
4155 : }
4156 : else
4157 0 : elog(ERROR, "unexpected stmt type %d", (int) nodeTag(istmt));
4158 : }
4159 24508 : cxt.alist = NIL;
4160 :
4161 : /* Append any CHECK, NOT NULL or FK constraints to the commands list */
4162 50098 : foreach_node(Constraint, def, cxt.ckconstraints)
4163 : {
4164 1082 : newcmd = makeNode(AlterTableCmd);
4165 1082 : newcmd->subtype = AT_AddConstraint;
4166 1082 : newcmd->def = (Node *) def;
4167 1082 : newcmds = lappend(newcmds, newcmd);
4168 : }
4169 58358 : foreach_node(Constraint, def, cxt.nnconstraints)
4170 : {
4171 9342 : newcmd = makeNode(AlterTableCmd);
4172 9342 : newcmd->subtype = AT_AddConstraint;
4173 9342 : newcmd->def = (Node *) def;
4174 9342 : newcmds = lappend(newcmds, newcmd);
4175 : }
4176 51712 : foreach_node(Constraint, def, cxt.fkconstraints)
4177 : {
4178 2696 : newcmd = makeNode(AlterTableCmd);
4179 2696 : newcmd->subtype = AT_AddConstraint;
4180 2696 : newcmd->def = (Node *) def;
4181 2696 : newcmds = lappend(newcmds, newcmd);
4182 : }
4183 :
4184 : /* Close rel */
4185 24508 : relation_close(rel, NoLock);
4186 :
4187 : /*
4188 : * Output results.
4189 : */
4190 24508 : stmt->cmds = newcmds;
4191 :
4192 24508 : *beforeStmts = cxt.blist;
4193 24508 : *afterStmts = list_concat(cxt.alist, save_alist);
4194 :
4195 24508 : return stmt;
4196 : }
4197 :
4198 :
4199 : /*
4200 : * Preprocess a list of column constraint clauses
4201 : * to attach constraint attributes to their primary constraint nodes
4202 : * and detect inconsistent/misplaced constraint attributes.
4203 : *
4204 : * NOTE: currently, attributes are only supported for FOREIGN KEY, UNIQUE,
4205 : * EXCLUSION, and PRIMARY KEY constraints, but someday they ought to be
4206 : * supported for other constraint types.
4207 : */
4208 : static void
4209 70190 : transformConstraintAttrs(CreateStmtContext *cxt, List *constraintList)
4210 : {
4211 70190 : Constraint *lastprimarycon = NULL;
4212 70190 : bool saw_deferrability = false;
4213 70190 : bool saw_initially = false;
4214 70190 : bool saw_enforced = false;
4215 : ListCell *clist;
4216 :
4217 : #define SUPPORTS_ATTRS(node) \
4218 : ((node) != NULL && \
4219 : ((node)->contype == CONSTR_PRIMARY || \
4220 : (node)->contype == CONSTR_UNIQUE || \
4221 : (node)->contype == CONSTR_EXCLUSION || \
4222 : (node)->contype == CONSTR_FOREIGN))
4223 :
4224 89748 : foreach(clist, constraintList)
4225 : {
4226 19582 : Constraint *con = (Constraint *) lfirst(clist);
4227 :
4228 19582 : if (!IsA(con, Constraint))
4229 0 : elog(ERROR, "unrecognized node type: %d",
4230 : (int) nodeTag(con));
4231 19582 : switch (con->contype)
4232 : {
4233 94 : case CONSTR_ATTR_DEFERRABLE:
4234 94 : if (!SUPPORTS_ATTRS(lastprimarycon))
4235 0 : ereport(ERROR,
4236 : (errcode(ERRCODE_SYNTAX_ERROR),
4237 : errmsg("misplaced DEFERRABLE clause"),
4238 : parser_errposition(cxt->pstate, con->location)));
4239 94 : if (saw_deferrability)
4240 0 : ereport(ERROR,
4241 : (errcode(ERRCODE_SYNTAX_ERROR),
4242 : errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
4243 : parser_errposition(cxt->pstate, con->location)));
4244 94 : saw_deferrability = true;
4245 94 : lastprimarycon->deferrable = true;
4246 94 : break;
4247 :
4248 0 : case CONSTR_ATTR_NOT_DEFERRABLE:
4249 0 : if (!SUPPORTS_ATTRS(lastprimarycon))
4250 0 : ereport(ERROR,
4251 : (errcode(ERRCODE_SYNTAX_ERROR),
4252 : errmsg("misplaced NOT DEFERRABLE clause"),
4253 : parser_errposition(cxt->pstate, con->location)));
4254 0 : if (saw_deferrability)
4255 0 : ereport(ERROR,
4256 : (errcode(ERRCODE_SYNTAX_ERROR),
4257 : errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
4258 : parser_errposition(cxt->pstate, con->location)));
4259 0 : saw_deferrability = true;
4260 0 : lastprimarycon->deferrable = false;
4261 0 : if (saw_initially &&
4262 0 : lastprimarycon->initdeferred)
4263 0 : ereport(ERROR,
4264 : (errcode(ERRCODE_SYNTAX_ERROR),
4265 : errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
4266 : parser_errposition(cxt->pstate, con->location)));
4267 0 : break;
4268 :
4269 76 : case CONSTR_ATTR_DEFERRED:
4270 76 : if (!SUPPORTS_ATTRS(lastprimarycon))
4271 0 : ereport(ERROR,
4272 : (errcode(ERRCODE_SYNTAX_ERROR),
4273 : errmsg("misplaced INITIALLY DEFERRED clause"),
4274 : parser_errposition(cxt->pstate, con->location)));
4275 76 : if (saw_initially)
4276 0 : ereport(ERROR,
4277 : (errcode(ERRCODE_SYNTAX_ERROR),
4278 : errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
4279 : parser_errposition(cxt->pstate, con->location)));
4280 76 : saw_initially = true;
4281 76 : lastprimarycon->initdeferred = true;
4282 :
4283 : /*
4284 : * If only INITIALLY DEFERRED appears, assume DEFERRABLE
4285 : */
4286 76 : if (!saw_deferrability)
4287 26 : lastprimarycon->deferrable = true;
4288 50 : else if (!lastprimarycon->deferrable)
4289 0 : ereport(ERROR,
4290 : (errcode(ERRCODE_SYNTAX_ERROR),
4291 : errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
4292 : parser_errposition(cxt->pstate, con->location)));
4293 76 : break;
4294 :
4295 6 : case CONSTR_ATTR_IMMEDIATE:
4296 6 : if (!SUPPORTS_ATTRS(lastprimarycon))
4297 0 : ereport(ERROR,
4298 : (errcode(ERRCODE_SYNTAX_ERROR),
4299 : errmsg("misplaced INITIALLY IMMEDIATE clause"),
4300 : parser_errposition(cxt->pstate, con->location)));
4301 6 : if (saw_initially)
4302 0 : ereport(ERROR,
4303 : (errcode(ERRCODE_SYNTAX_ERROR),
4304 : errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
4305 : parser_errposition(cxt->pstate, con->location)));
4306 6 : saw_initially = true;
4307 6 : lastprimarycon->initdeferred = false;
4308 6 : break;
4309 :
4310 36 : case CONSTR_ATTR_ENFORCED:
4311 36 : if (lastprimarycon == NULL ||
4312 36 : (lastprimarycon->contype != CONSTR_CHECK &&
4313 12 : lastprimarycon->contype != CONSTR_FOREIGN))
4314 6 : ereport(ERROR,
4315 : (errcode(ERRCODE_SYNTAX_ERROR),
4316 : errmsg("misplaced ENFORCED clause"),
4317 : parser_errposition(cxt->pstate, con->location)));
4318 30 : if (saw_enforced)
4319 6 : ereport(ERROR,
4320 : (errcode(ERRCODE_SYNTAX_ERROR),
4321 : errmsg("multiple ENFORCED/NOT ENFORCED clauses not allowed"),
4322 : parser_errposition(cxt->pstate, con->location)));
4323 24 : saw_enforced = true;
4324 24 : lastprimarycon->is_enforced = true;
4325 24 : break;
4326 :
4327 60 : case CONSTR_ATTR_NOT_ENFORCED:
4328 60 : if (lastprimarycon == NULL ||
4329 60 : (lastprimarycon->contype != CONSTR_CHECK &&
4330 18 : lastprimarycon->contype != CONSTR_FOREIGN))
4331 6 : ereport(ERROR,
4332 : (errcode(ERRCODE_SYNTAX_ERROR),
4333 : errmsg("misplaced NOT ENFORCED clause"),
4334 : parser_errposition(cxt->pstate, con->location)));
4335 54 : if (saw_enforced)
4336 6 : ereport(ERROR,
4337 : (errcode(ERRCODE_SYNTAX_ERROR),
4338 : errmsg("multiple ENFORCED/NOT ENFORCED clauses not allowed"),
4339 : parser_errposition(cxt->pstate, con->location)));
4340 48 : saw_enforced = true;
4341 48 : lastprimarycon->is_enforced = false;
4342 :
4343 : /* A NOT ENFORCED constraint must be marked as invalid. */
4344 48 : lastprimarycon->skip_validation = true;
4345 48 : lastprimarycon->initially_valid = false;
4346 48 : break;
4347 :
4348 19310 : default:
4349 : /* Otherwise it's not an attribute */
4350 19310 : lastprimarycon = con;
4351 : /* reset flags for new primary node */
4352 19310 : saw_deferrability = false;
4353 19310 : saw_initially = false;
4354 19310 : saw_enforced = false;
4355 19310 : break;
4356 : }
4357 : }
4358 70166 : }
4359 :
4360 : /*
4361 : * Special handling of type definition for a column
4362 : */
4363 : static void
4364 69870 : transformColumnType(CreateStmtContext *cxt, ColumnDef *column)
4365 : {
4366 : /*
4367 : * All we really need to do here is verify that the type is valid,
4368 : * including any collation spec that might be present.
4369 : */
4370 69870 : Type ctype = typenameType(cxt->pstate, column->typeName, NULL);
4371 :
4372 69856 : if (column->collClause)
4373 : {
4374 520 : Form_pg_type typtup = (Form_pg_type) GETSTRUCT(ctype);
4375 :
4376 520 : LookupCollation(cxt->pstate,
4377 520 : column->collClause->collname,
4378 520 : column->collClause->location);
4379 : /* Complain if COLLATE is applied to an uncollatable type */
4380 508 : if (!OidIsValid(typtup->typcollation))
4381 12 : ereport(ERROR,
4382 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4383 : errmsg("collations are not supported by type %s",
4384 : format_type_be(typtup->oid)),
4385 : parser_errposition(cxt->pstate,
4386 : column->collClause->location)));
4387 : }
4388 :
4389 69832 : ReleaseSysCache(ctype);
4390 69832 : }
4391 :
4392 :
4393 : /*
4394 : * transformCreateSchemaStmtElements -
4395 : * analyzes the elements of a CREATE SCHEMA statement
4396 : *
4397 : * Split the schema element list from a CREATE SCHEMA statement into
4398 : * individual commands and place them in the result list in an order
4399 : * such that there are no forward references (e.g. GRANT to a table
4400 : * created later in the list). Note that the logic we use for determining
4401 : * forward references is presently quite incomplete.
4402 : *
4403 : * "schemaName" is the name of the schema that will be used for the creation
4404 : * of the objects listed, that may be compiled from the schema name defined
4405 : * in the statement or a role specification.
4406 : *
4407 : * SQL also allows constraints to make forward references, so thumb through
4408 : * the table columns and move forward references to a posterior alter-table
4409 : * command.
4410 : *
4411 : * The result is a list of parse nodes that still need to be analyzed ---
4412 : * but we can't analyze the later commands until we've executed the earlier
4413 : * ones, because of possible inter-object references.
4414 : *
4415 : * Note: this breaks the rules a little bit by modifying schema-name fields
4416 : * within passed-in structs. However, the transformation would be the same
4417 : * if done over, so it should be all right to scribble on the input to this
4418 : * extent.
4419 : */
4420 : List *
4421 1082 : transformCreateSchemaStmtElements(List *schemaElts, const char *schemaName)
4422 : {
4423 : CreateSchemaStmtContext cxt;
4424 : List *result;
4425 : ListCell *elements;
4426 :
4427 1082 : cxt.schemaname = schemaName;
4428 1082 : cxt.sequences = NIL;
4429 1082 : cxt.tables = NIL;
4430 1082 : cxt.views = NIL;
4431 1082 : cxt.indexes = NIL;
4432 1082 : cxt.triggers = NIL;
4433 1082 : cxt.grants = NIL;
4434 :
4435 : /*
4436 : * Run through each schema element in the schema element list. Separate
4437 : * statements by type, and do preliminary analysis.
4438 : */
4439 1572 : foreach(elements, schemaElts)
4440 : {
4441 580 : Node *element = lfirst(elements);
4442 :
4443 580 : switch (nodeTag(element))
4444 : {
4445 18 : case T_CreateSeqStmt:
4446 : {
4447 18 : CreateSeqStmt *elp = (CreateSeqStmt *) element;
4448 :
4449 18 : setSchemaName(cxt.schemaname, &elp->sequence->schemaname);
4450 0 : cxt.sequences = lappend(cxt.sequences, element);
4451 : }
4452 0 : break;
4453 :
4454 460 : case T_CreateStmt:
4455 : {
4456 460 : CreateStmt *elp = (CreateStmt *) element;
4457 :
4458 460 : setSchemaName(cxt.schemaname, &elp->relation->schemaname);
4459 :
4460 : /*
4461 : * XXX todo: deal with constraints
4462 : */
4463 442 : cxt.tables = lappend(cxt.tables, element);
4464 : }
4465 442 : break;
4466 :
4467 44 : case T_ViewStmt:
4468 : {
4469 44 : ViewStmt *elp = (ViewStmt *) element;
4470 :
4471 44 : setSchemaName(cxt.schemaname, &elp->view->schemaname);
4472 :
4473 : /*
4474 : * XXX todo: deal with references between views
4475 : */
4476 26 : cxt.views = lappend(cxt.views, element);
4477 : }
4478 26 : break;
4479 :
4480 40 : case T_IndexStmt:
4481 : {
4482 40 : IndexStmt *elp = (IndexStmt *) element;
4483 :
4484 40 : setSchemaName(cxt.schemaname, &elp->relation->schemaname);
4485 22 : cxt.indexes = lappend(cxt.indexes, element);
4486 : }
4487 22 : break;
4488 :
4489 18 : case T_CreateTrigStmt:
4490 : {
4491 18 : CreateTrigStmt *elp = (CreateTrigStmt *) element;
4492 :
4493 18 : setSchemaName(cxt.schemaname, &elp->relation->schemaname);
4494 0 : cxt.triggers = lappend(cxt.triggers, element);
4495 : }
4496 0 : break;
4497 :
4498 0 : case T_GrantStmt:
4499 0 : cxt.grants = lappend(cxt.grants, element);
4500 0 : break;
4501 :
4502 0 : default:
4503 0 : elog(ERROR, "unrecognized node type: %d",
4504 : (int) nodeTag(element));
4505 : }
4506 : }
4507 :
4508 992 : result = NIL;
4509 992 : result = list_concat(result, cxt.sequences);
4510 992 : result = list_concat(result, cxt.tables);
4511 992 : result = list_concat(result, cxt.views);
4512 992 : result = list_concat(result, cxt.indexes);
4513 992 : result = list_concat(result, cxt.triggers);
4514 992 : result = list_concat(result, cxt.grants);
4515 :
4516 992 : return result;
4517 : }
4518 :
4519 : /*
4520 : * setSchemaName
4521 : * Set or check schema name in an element of a CREATE SCHEMA command
4522 : */
4523 : static void
4524 580 : setSchemaName(const char *context_schema, char **stmt_schema_name)
4525 : {
4526 580 : if (*stmt_schema_name == NULL)
4527 466 : *stmt_schema_name = unconstify(char *, context_schema);
4528 114 : else if (strcmp(context_schema, *stmt_schema_name) != 0)
4529 90 : ereport(ERROR,
4530 : (errcode(ERRCODE_INVALID_SCHEMA_DEFINITION),
4531 : errmsg("CREATE specifies a schema (%s) "
4532 : "different from the one being created (%s)",
4533 : *stmt_schema_name, context_schema)));
4534 490 : }
4535 :
4536 : /*
4537 : * transformPartitionCmd
4538 : * Analyze the ATTACH/DETACH/SPLIT PARTITION command
4539 : *
4540 : * In case of the ATTACH/SPLIT PARTITION command, cxt->partbound is set to the
4541 : * transformed value of bound.
4542 : */
4543 : static void
4544 4566 : transformPartitionCmd(CreateStmtContext *cxt, PartitionBoundSpec *bound)
4545 : {
4546 4566 : Relation parentRel = cxt->rel;
4547 :
4548 4566 : switch (parentRel->rd_rel->relkind)
4549 : {
4550 4176 : case RELKIND_PARTITIONED_TABLE:
4551 : /* transform the partition bound, if any */
4552 : Assert(RelationGetPartitionKey(parentRel) != NULL);
4553 4176 : if (bound != NULL)
4554 3592 : cxt->partbound = transformPartitionBound(cxt->pstate, parentRel,
4555 : bound);
4556 4152 : break;
4557 390 : case RELKIND_PARTITIONED_INDEX:
4558 :
4559 : /*
4560 : * A partitioned index cannot have a partition bound set. ALTER
4561 : * INDEX prevents that with its grammar, but not ALTER TABLE.
4562 : */
4563 390 : if (bound != NULL)
4564 6 : ereport(ERROR,
4565 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4566 : errmsg("\"%s\" is not a partitioned table",
4567 : RelationGetRelationName(parentRel))));
4568 384 : break;
4569 0 : case RELKIND_RELATION:
4570 : /* the table must be partitioned */
4571 0 : ereport(ERROR,
4572 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4573 : errmsg("table \"%s\" is not partitioned",
4574 : RelationGetRelationName(parentRel))));
4575 : break;
4576 0 : case RELKIND_INDEX:
4577 : /* the index must be partitioned */
4578 0 : ereport(ERROR,
4579 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4580 : errmsg("index \"%s\" is not partitioned",
4581 : RelationGetRelationName(parentRel))));
4582 : break;
4583 0 : default:
4584 : /* parser shouldn't let this case through */
4585 0 : elog(ERROR, "\"%s\" is not a partitioned table or index",
4586 : RelationGetRelationName(parentRel));
4587 : break;
4588 : }
4589 4536 : }
4590 :
4591 : /*
4592 : * transformPartitionBound
4593 : *
4594 : * Transform a partition bound specification
4595 : */
4596 : PartitionBoundSpec *
4597 12630 : transformPartitionBound(ParseState *pstate, Relation parent,
4598 : PartitionBoundSpec *spec)
4599 : {
4600 : PartitionBoundSpec *result_spec;
4601 12630 : PartitionKey key = RelationGetPartitionKey(parent);
4602 12630 : char strategy = get_partition_strategy(key);
4603 12630 : int partnatts = get_partition_natts(key);
4604 12630 : List *partexprs = get_partition_exprs(key);
4605 :
4606 : /* Avoid scribbling on input */
4607 12630 : result_spec = copyObject(spec);
4608 :
4609 12630 : if (spec->is_default)
4610 : {
4611 : /*
4612 : * Hash partitioning does not support a default partition; there's no
4613 : * use case for it (since the set of partitions to create is perfectly
4614 : * defined), and if users do get into it accidentally, it's hard to
4615 : * back out from it afterwards.
4616 : */
4617 822 : if (strategy == PARTITION_STRATEGY_HASH)
4618 6 : ereport(ERROR,
4619 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4620 : errmsg("a hash-partitioned table may not have a default partition")));
4621 :
4622 : /*
4623 : * In case of the default partition, parser had no way to identify the
4624 : * partition strategy. Assign the parent's strategy to the default
4625 : * partition bound spec.
4626 : */
4627 816 : result_spec->strategy = strategy;
4628 :
4629 816 : return result_spec;
4630 : }
4631 :
4632 11808 : if (strategy == PARTITION_STRATEGY_HASH)
4633 : {
4634 756 : if (spec->strategy != PARTITION_STRATEGY_HASH)
4635 12 : ereport(ERROR,
4636 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4637 : errmsg("invalid bound specification for a hash partition"),
4638 : parser_errposition(pstate, exprLocation((Node *) spec))));
4639 :
4640 744 : if (spec->modulus <= 0)
4641 12 : ereport(ERROR,
4642 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4643 : errmsg("modulus for hash partition must be an integer value greater than zero")));
4644 :
4645 : Assert(spec->remainder >= 0);
4646 :
4647 732 : if (spec->remainder >= spec->modulus)
4648 12 : ereport(ERROR,
4649 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4650 : errmsg("remainder for hash partition must be less than modulus")));
4651 : }
4652 11052 : else if (strategy == PARTITION_STRATEGY_LIST)
4653 : {
4654 : ListCell *cell;
4655 : char *colname;
4656 : Oid coltype;
4657 : int32 coltypmod;
4658 : Oid partcollation;
4659 :
4660 5246 : if (spec->strategy != PARTITION_STRATEGY_LIST)
4661 18 : ereport(ERROR,
4662 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4663 : errmsg("invalid bound specification for a list partition"),
4664 : parser_errposition(pstate, exprLocation((Node *) spec))));
4665 :
4666 : /* Get the only column's name in case we need to output an error */
4667 5228 : if (key->partattrs[0] != 0)
4668 5096 : colname = get_attname(RelationGetRelid(parent),
4669 5096 : key->partattrs[0], false);
4670 : else
4671 132 : colname = deparse_expression((Node *) linitial(partexprs),
4672 132 : deparse_context_for(RelationGetRelationName(parent),
4673 : RelationGetRelid(parent)),
4674 : false, false);
4675 : /* Need its type data too */
4676 5228 : coltype = get_partition_col_typid(key, 0);
4677 5228 : coltypmod = get_partition_col_typmod(key, 0);
4678 5228 : partcollation = get_partition_col_collation(key, 0);
4679 :
4680 5228 : result_spec->listdatums = NIL;
4681 13422 : foreach(cell, spec->listdatums)
4682 : {
4683 8254 : Node *expr = lfirst(cell);
4684 : Const *value;
4685 : ListCell *cell2;
4686 : bool duplicate;
4687 :
4688 8254 : value = transformPartitionBoundValue(pstate, expr,
4689 : colname, coltype, coltypmod,
4690 : partcollation);
4691 :
4692 : /* Don't add to the result if the value is a duplicate */
4693 8194 : duplicate = false;
4694 14944 : foreach(cell2, result_spec->listdatums)
4695 : {
4696 6750 : Const *value2 = lfirst_node(Const, cell2);
4697 :
4698 6750 : if (equal(value, value2))
4699 : {
4700 0 : duplicate = true;
4701 0 : break;
4702 : }
4703 : }
4704 8194 : if (duplicate)
4705 0 : continue;
4706 :
4707 8194 : result_spec->listdatums = lappend(result_spec->listdatums,
4708 : value);
4709 : }
4710 : }
4711 5806 : else if (strategy == PARTITION_STRATEGY_RANGE)
4712 : {
4713 5806 : if (spec->strategy != PARTITION_STRATEGY_RANGE)
4714 24 : ereport(ERROR,
4715 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4716 : errmsg("invalid bound specification for a range partition"),
4717 : parser_errposition(pstate, exprLocation((Node *) spec))));
4718 :
4719 5782 : if (list_length(spec->lowerdatums) != partnatts)
4720 6 : ereport(ERROR,
4721 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4722 : errmsg("FROM must specify exactly one value per partitioning column")));
4723 5776 : if (list_length(spec->upperdatums) != partnatts)
4724 6 : ereport(ERROR,
4725 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4726 : errmsg("TO must specify exactly one value per partitioning column")));
4727 :
4728 : /*
4729 : * Convert raw parse nodes into PartitionRangeDatum nodes and perform
4730 : * any necessary validation.
4731 : */
4732 5704 : result_spec->lowerdatums =
4733 5770 : transformPartitionRangeBounds(pstate, spec->lowerdatums,
4734 : parent);
4735 5698 : result_spec->upperdatums =
4736 5704 : transformPartitionRangeBounds(pstate, spec->upperdatums,
4737 : parent);
4738 : }
4739 : else
4740 0 : elog(ERROR, "unexpected partition strategy: %d", (int) strategy);
4741 :
4742 11586 : return result_spec;
4743 : }
4744 :
4745 : /*
4746 : * transformPartitionRangeBounds
4747 : * This converts the expressions for range partition bounds from the raw
4748 : * grammar representation to PartitionRangeDatum structs
4749 : */
4750 : static List *
4751 11474 : transformPartitionRangeBounds(ParseState *pstate, List *blist,
4752 : Relation parent)
4753 : {
4754 11474 : List *result = NIL;
4755 11474 : PartitionKey key = RelationGetPartitionKey(parent);
4756 11474 : List *partexprs = get_partition_exprs(key);
4757 : ListCell *lc;
4758 : int i,
4759 : j;
4760 :
4761 11474 : j = 0;
4762 25134 : foreach(lc, blist)
4763 : {
4764 13714 : Node *expr = lfirst(lc);
4765 13714 : PartitionRangeDatum *prd = NULL;
4766 :
4767 13714 : i = foreach_current_index(lc);
4768 :
4769 : /*
4770 : * Infinite range bounds -- "minvalue" and "maxvalue" -- get passed in
4771 : * as ColumnRefs.
4772 : */
4773 13714 : if (IsA(expr, ColumnRef))
4774 : {
4775 788 : ColumnRef *cref = (ColumnRef *) expr;
4776 788 : char *cname = NULL;
4777 :
4778 : /*
4779 : * There should be a single field named either "minvalue" or
4780 : * "maxvalue".
4781 : */
4782 788 : if (list_length(cref->fields) == 1 &&
4783 782 : IsA(linitial(cref->fields), String))
4784 782 : cname = strVal(linitial(cref->fields));
4785 :
4786 788 : if (cname == NULL)
4787 : {
4788 : /*
4789 : * ColumnRef is not in the desired single-field-name form. For
4790 : * consistency between all partition strategies, let the
4791 : * expression transformation report any errors rather than
4792 : * doing it ourselves.
4793 : */
4794 : }
4795 782 : else if (strcmp("minvalue", cname) == 0)
4796 : {
4797 380 : prd = makeNode(PartitionRangeDatum);
4798 380 : prd->kind = PARTITION_RANGE_DATUM_MINVALUE;
4799 380 : prd->value = NULL;
4800 : }
4801 402 : else if (strcmp("maxvalue", cname) == 0)
4802 : {
4803 390 : prd = makeNode(PartitionRangeDatum);
4804 390 : prd->kind = PARTITION_RANGE_DATUM_MAXVALUE;
4805 390 : prd->value = NULL;
4806 : }
4807 : }
4808 :
4809 13714 : if (prd == NULL)
4810 : {
4811 : char *colname;
4812 : Oid coltype;
4813 : int32 coltypmod;
4814 : Oid partcollation;
4815 : Const *value;
4816 :
4817 : /* Get the column's name in case we need to output an error */
4818 12944 : if (key->partattrs[i] != 0)
4819 12072 : colname = get_attname(RelationGetRelid(parent),
4820 12072 : key->partattrs[i], false);
4821 : else
4822 : {
4823 872 : colname = deparse_expression((Node *) list_nth(partexprs, j),
4824 872 : deparse_context_for(RelationGetRelationName(parent),
4825 : RelationGetRelid(parent)),
4826 : false, false);
4827 872 : ++j;
4828 : }
4829 :
4830 : /* Need its type data too */
4831 12944 : coltype = get_partition_col_typid(key, i);
4832 12944 : coltypmod = get_partition_col_typmod(key, i);
4833 12944 : partcollation = get_partition_col_collation(key, i);
4834 :
4835 12944 : value = transformPartitionBoundValue(pstate, expr,
4836 : colname,
4837 : coltype, coltypmod,
4838 : partcollation);
4839 12896 : if (value->constisnull)
4840 6 : ereport(ERROR,
4841 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4842 : errmsg("cannot specify NULL in range bound")));
4843 12890 : prd = makeNode(PartitionRangeDatum);
4844 12890 : prd->kind = PARTITION_RANGE_DATUM_VALUE;
4845 12890 : prd->value = (Node *) value;
4846 : }
4847 :
4848 13660 : prd->location = exprLocation(expr);
4849 :
4850 13660 : result = lappend(result, prd);
4851 : }
4852 :
4853 : /*
4854 : * Once we see MINVALUE or MAXVALUE for one column, the remaining columns
4855 : * must be the same.
4856 : */
4857 11420 : validateInfiniteBounds(pstate, result);
4858 :
4859 11402 : return result;
4860 : }
4861 :
4862 : /*
4863 : * validateInfiniteBounds
4864 : *
4865 : * Check that a MAXVALUE or MINVALUE specification in a partition bound is
4866 : * followed only by more of the same.
4867 : */
4868 : static void
4869 11420 : validateInfiniteBounds(ParseState *pstate, List *blist)
4870 : {
4871 : ListCell *lc;
4872 11420 : PartitionRangeDatumKind kind = PARTITION_RANGE_DATUM_VALUE;
4873 :
4874 25056 : foreach(lc, blist)
4875 : {
4876 13654 : PartitionRangeDatum *prd = lfirst_node(PartitionRangeDatum, lc);
4877 :
4878 13654 : if (kind == prd->kind)
4879 13100 : continue;
4880 :
4881 554 : switch (kind)
4882 : {
4883 536 : case PARTITION_RANGE_DATUM_VALUE:
4884 536 : kind = prd->kind;
4885 536 : break;
4886 :
4887 6 : case PARTITION_RANGE_DATUM_MAXVALUE:
4888 6 : ereport(ERROR,
4889 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4890 : errmsg("every bound following MAXVALUE must also be MAXVALUE"),
4891 : parser_errposition(pstate, exprLocation((Node *) prd))));
4892 : break;
4893 :
4894 12 : case PARTITION_RANGE_DATUM_MINVALUE:
4895 12 : ereport(ERROR,
4896 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4897 : errmsg("every bound following MINVALUE must also be MINVALUE"),
4898 : parser_errposition(pstate, exprLocation((Node *) prd))));
4899 : break;
4900 : }
4901 : }
4902 11402 : }
4903 :
4904 : /*
4905 : * Transform one entry in a partition bound spec, producing a constant.
4906 : */
4907 : static Const *
4908 21198 : transformPartitionBoundValue(ParseState *pstate, Node *val,
4909 : const char *colName, Oid colType, int32 colTypmod,
4910 : Oid partCollation)
4911 : {
4912 : Node *value;
4913 :
4914 : /* Transform raw parsetree */
4915 21198 : value = transformExpr(pstate, val, EXPR_KIND_PARTITION_BOUND);
4916 :
4917 : /*
4918 : * transformExpr() should have already rejected column references,
4919 : * subqueries, aggregates, window functions, and SRFs, based on the
4920 : * EXPR_KIND_ of a partition bound expression.
4921 : */
4922 : Assert(!contain_var_clause(value));
4923 :
4924 : /*
4925 : * Coerce to the correct type. This might cause an explicit coercion step
4926 : * to be added on top of the expression, which must be evaluated before
4927 : * returning the result to the caller.
4928 : */
4929 21096 : value = coerce_to_target_type(pstate,
4930 : value, exprType(value),
4931 : colType,
4932 : colTypmod,
4933 : COERCION_ASSIGNMENT,
4934 : COERCE_IMPLICIT_CAST,
4935 : -1);
4936 :
4937 21096 : if (value == NULL)
4938 6 : ereport(ERROR,
4939 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4940 : errmsg("specified value cannot be cast to type %s for column \"%s\"",
4941 : format_type_be(colType), colName),
4942 : parser_errposition(pstate, exprLocation(val))));
4943 :
4944 : /*
4945 : * Evaluate the expression, if needed, assigning the partition key's data
4946 : * type and collation to the resulting Const node.
4947 : */
4948 21090 : if (!IsA(value, Const))
4949 : {
4950 1458 : assign_expr_collations(pstate, value);
4951 1458 : value = (Node *) expression_planner((Expr *) value);
4952 1458 : value = (Node *) evaluate_expr((Expr *) value, colType, colTypmod,
4953 : partCollation);
4954 1458 : if (!IsA(value, Const))
4955 0 : elog(ERROR, "could not evaluate partition bound expression");
4956 : }
4957 : else
4958 : {
4959 : /*
4960 : * If the expression is already a Const, as is often the case, we can
4961 : * skip the rather expensive steps above. But we still have to insert
4962 : * the right collation, since coerce_to_target_type doesn't handle
4963 : * that.
4964 : */
4965 19632 : ((Const *) value)->constcollid = partCollation;
4966 : }
4967 :
4968 : /*
4969 : * Attach original expression's parse location to the Const, so that
4970 : * that's what will be reported for any later errors related to this
4971 : * partition bound.
4972 : */
4973 21090 : ((Const *) value)->location = exprLocation(val);
4974 :
4975 21090 : return (Const *) value;
4976 : }
|
