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-2025, 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 40506 : 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 40506 : pstate = make_parsestate(NULL);
180 40506 : 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 40506 : setup_parser_errposition_callback(&pcbstate, pstate,
189 40506 : stmt->relation->location);
190 : namespaceid =
191 40506 : RangeVarGetAndCheckCreationNamespace(stmt->relation, NoLock,
192 : &existing_relid);
193 40494 : 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 40494 : 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 40484 : if (stmt->relation->schemaname == NULL
226 37154 : && stmt->relation->relpersistence != RELPERSISTENCE_TEMP)
227 34648 : stmt->relation->schemaname = get_namespace_name(namespaceid);
228 :
229 : /* Set up CreateStmtContext */
230 40484 : cxt.pstate = pstate;
231 40484 : if (IsA(stmt, CreateForeignTableStmt))
232 : {
233 510 : cxt.stmtType = "CREATE FOREIGN TABLE";
234 510 : cxt.isforeign = true;
235 : }
236 : else
237 : {
238 39974 : cxt.stmtType = "CREATE TABLE";
239 39974 : cxt.isforeign = false;
240 : }
241 40484 : cxt.relation = stmt->relation;
242 40484 : cxt.rel = NULL;
243 40484 : cxt.inhRelations = stmt->inhRelations;
244 40484 : cxt.isalter = false;
245 40484 : cxt.columns = NIL;
246 40484 : cxt.ckconstraints = NIL;
247 40484 : cxt.nnconstraints = NIL;
248 40484 : cxt.fkconstraints = NIL;
249 40484 : cxt.ixconstraints = NIL;
250 40484 : cxt.likeclauses = NIL;
251 40484 : cxt.blist = NIL;
252 40484 : cxt.alist = NIL;
253 40484 : cxt.pkey = NULL;
254 40484 : cxt.ispartitioned = stmt->partspec != NULL;
255 40484 : cxt.partbound = stmt->partbound;
256 40484 : cxt.ofType = (stmt->ofTypename != NULL);
257 :
258 : Assert(!stmt->ofTypename || !stmt->inhRelations); /* grammar enforces */
259 :
260 40484 : if (stmt->ofTypename)
261 122 : transformOfType(&cxt, stmt->ofTypename);
262 :
263 40466 : if (stmt->partspec)
264 : {
265 5592 : 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 111956 : foreach(elements, stmt->tableElts)
276 : {
277 71738 : Node *element = lfirst(elements);
278 :
279 71738 : switch (nodeTag(element))
280 : {
281 68112 : case T_ColumnDef:
282 68112 : transformColumnDefinition(&cxt, (ColumnDef *) element);
283 67894 : 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 40218 : save_alist = cxt.alist;
307 40218 : 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 92770 : foreach_node(Constraint, nn, cxt.nnconstraints)
320 : {
321 12334 : char *colname = strVal(linitial(nn->keys));
322 :
323 29002 : foreach_node(ColumnDef, cd, cxt.columns)
324 : {
325 : /* not our column? */
326 16644 : if (strcmp(cd->colname, colname) != 0)
327 4334 : continue;
328 : /* Already marked not-null? Nothing to do */
329 12310 : if (cd->is_not_null)
330 11810 : 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 40218 : 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 40176 : cxt.alist = list_concat(cxt.alist, cxt.likeclauses);
355 :
356 : /*
357 : * Postprocess foreign-key constraints.
358 : */
359 40176 : 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 40176 : transformCheckConstraints(&cxt, !cxt.isforeign);
368 :
369 : /*
370 : * Output results.
371 : */
372 40176 : stmt->tableElts = cxt.columns;
373 40176 : stmt->constraints = cxt.ckconstraints;
374 40176 : stmt->nnconstraints = cxt.nnconstraints;
375 :
376 40176 : result = lappend(cxt.blist, stmt);
377 40176 : result = list_concat(result, cxt.alist);
378 40176 : result = list_concat(result, save_alist);
379 :
380 40176 : 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 70188 : 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 70188 : bool need_notnull = false;
602 70188 : bool disallow_noinherit_notnull = false;
603 70188 : Constraint *notnull_constraint = NULL;
604 :
605 70188 : cxt->columns = lappend(cxt->columns, column);
606 :
607 : /* Check for SERIAL pseudo-types */
608 70188 : is_serial = false;
609 70188 : if (column->typeName
610 69830 : && list_length(column->typeName->names) == 1
611 29400 : && !column->typeName->pct_type)
612 : {
613 29400 : char *typname = strVal(linitial(column->typeName->names));
614 :
615 29400 : if (strcmp(typname, "smallserial") == 0 ||
616 29392 : strcmp(typname, "serial2") == 0)
617 : {
618 14 : is_serial = true;
619 14 : column->typeName->names = NIL;
620 14 : column->typeName->typeOid = INT2OID;
621 : }
622 29386 : else if (strcmp(typname, "serial") == 0 ||
623 28556 : strcmp(typname, "serial4") == 0)
624 : {
625 830 : is_serial = true;
626 830 : column->typeName->names = NIL;
627 830 : column->typeName->typeOid = INT4OID;
628 : }
629 28556 : else if (strcmp(typname, "bigserial") == 0 ||
630 28546 : 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 29400 : 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 70188 : if (column->typeName)
652 69830 : transformColumnType(cxt, column);
653 :
654 : /* Special actions for SERIAL pseudo-types */
655 70150 : 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 70150 : 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 70126 : if (!disallow_noinherit_notnull)
721 : {
722 156540 : foreach_node(Constraint, constraint, column->constraints)
723 : {
724 18020 : switch (constraint->contype)
725 : {
726 5830 : case CONSTR_IDENTITY:
727 : case CONSTR_PRIMARY:
728 5830 : disallow_noinherit_notnull = true;
729 5830 : break;
730 12190 : default:
731 12190 : break;
732 : }
733 : }
734 : }
735 :
736 : /* Now scan them again to do full processing */
737 70126 : saw_nullable = false;
738 70126 : saw_default = false;
739 70126 : saw_identity = false;
740 70126 : saw_generated = false;
741 :
742 159406 : foreach_node(Constraint, constraint, column->constraints)
743 : {
744 19478 : 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 506 : case CONSTR_CHECK:
902 506 : cxt->ckconstraints = lappend(cxt->ckconstraints, constraint);
903 506 : break;
904 :
905 5918 : case CONSTR_PRIMARY:
906 5918 : 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 5918 : need_notnull = true;
914 :
915 5918 : 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 6286 : 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 6286 : if (constraint->keys == NIL)
931 6286 : constraint->keys = list_make1(makeString(column->colname));
932 6286 : cxt->ixconstraints = lappend(cxt->ixconstraints, constraint);
933 6286 : 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 19352 : 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 19340 : 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 19328 : 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 69964 : if (need_notnull && !(saw_nullable && column->is_not_null))
1001 : {
1002 5360 : column->is_not_null = true;
1003 5360 : notnull_constraint = makeNotNullConstraint(makeString(column->colname));
1004 5360 : 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 69964 : 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 69964 : }
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 3264 : generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx,
1696 : const AttrMap *attmap,
1697 : Oid *constraintOid)
1698 : {
1699 3264 : 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 3264 : if (constraintOid)
1718 2124 : *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 3264 : ht_idxrel = SearchSysCache1(RELOID, ObjectIdGetDatum(source_relid));
1725 3264 : if (!HeapTupleIsValid(ht_idxrel))
1726 0 : elog(ERROR, "cache lookup failed for relation %u", source_relid);
1727 3264 : idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
1728 :
1729 : /* Fetch pg_index tuple for source index from relcache entry */
1730 3264 : ht_idx = source_idx->rd_indextuple;
1731 3264 : idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
1732 3264 : indrelid = idxrec->indrelid;
1733 :
1734 : /* Fetch the pg_am tuple of the index' access method */
1735 3264 : ht_am = SearchSysCache1(AMOID, ObjectIdGetDatum(idxrelrec->relam));
1736 3264 : if (!HeapTupleIsValid(ht_am))
1737 0 : elog(ERROR, "cache lookup failed for access method %u",
1738 : idxrelrec->relam);
1739 3264 : amrec = (Form_pg_am) GETSTRUCT(ht_am);
1740 :
1741 : /* Extract indcollation from the pg_index tuple */
1742 3264 : datum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1743 : Anum_pg_index_indcollation);
1744 3264 : indcollation = (oidvector *) DatumGetPointer(datum);
1745 :
1746 : /* Extract indclass from the pg_index tuple */
1747 3264 : datum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx, Anum_pg_index_indclass);
1748 3264 : indclass = (oidvector *) DatumGetPointer(datum);
1749 :
1750 : /* Begin building the IndexStmt */
1751 3264 : index = makeNode(IndexStmt);
1752 3264 : index->relation = heapRel;
1753 3264 : index->accessMethod = pstrdup(NameStr(amrec->amname));
1754 3264 : if (OidIsValid(idxrelrec->reltablespace))
1755 88 : index->tableSpace = get_tablespace_name(idxrelrec->reltablespace);
1756 : else
1757 3176 : index->tableSpace = NULL;
1758 3264 : index->excludeOpNames = NIL;
1759 3264 : index->idxcomment = NULL;
1760 3264 : index->indexOid = InvalidOid;
1761 3264 : index->oldNumber = InvalidRelFileNumber;
1762 3264 : index->oldCreateSubid = InvalidSubTransactionId;
1763 3264 : index->oldFirstRelfilelocatorSubid = InvalidSubTransactionId;
1764 3264 : index->unique = idxrec->indisunique;
1765 3264 : index->nulls_not_distinct = idxrec->indnullsnotdistinct;
1766 3264 : index->primary = idxrec->indisprimary;
1767 3264 : index->iswithoutoverlaps = (idxrec->indisprimary || idxrec->indisunique) && idxrec->indisexclusion;
1768 3264 : index->transformed = true; /* don't need transformIndexStmt */
1769 3264 : index->concurrent = false;
1770 3264 : index->if_not_exists = false;
1771 3264 : 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 3264 : 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 3264 : if (index->primary || index->unique || idxrec->indisexclusion)
1788 1752 : {
1789 1752 : Oid constraintId = get_index_constraint(source_relid);
1790 :
1791 1752 : if (OidIsValid(constraintId))
1792 : {
1793 : HeapTuple ht_constr;
1794 : Form_pg_constraint conrec;
1795 :
1796 1702 : if (constraintOid)
1797 1520 : *constraintOid = constraintId;
1798 :
1799 1702 : ht_constr = SearchSysCache1(CONSTROID,
1800 : ObjectIdGetDatum(constraintId));
1801 1702 : if (!HeapTupleIsValid(ht_constr))
1802 0 : elog(ERROR, "cache lookup failed for constraint %u",
1803 : constraintId);
1804 1702 : conrec = (Form_pg_constraint) GETSTRUCT(ht_constr);
1805 :
1806 1702 : index->isconstraint = true;
1807 1702 : index->deferrable = conrec->condeferrable;
1808 1702 : index->initdeferred = conrec->condeferred;
1809 :
1810 : /* If it's an exclusion constraint, we need the operator names */
1811 1702 : 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 1702 : 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 3264 : datum = SysCacheGetAttr(INDEXRELID, ht_idx,
1861 : Anum_pg_index_indexprs, &isnull);
1862 3264 : if (!isnull)
1863 : {
1864 : char *exprsString;
1865 :
1866 184 : exprsString = TextDatumGetCString(datum);
1867 184 : indexprs = (List *) stringToNode(exprsString);
1868 : }
1869 : else
1870 3080 : indexprs = NIL;
1871 :
1872 : /* Build the list of IndexElem */
1873 3264 : index->indexParams = NIL;
1874 3264 : index->indexIncludingParams = NIL;
1875 :
1876 3264 : indexpr_item = list_head(indexprs);
1877 7070 : for (keyno = 0; keyno < idxrec->indnkeyatts; keyno++)
1878 : {
1879 : IndexElem *iparam;
1880 3806 : AttrNumber attnum = idxrec->indkey.values[keyno];
1881 3806 : Form_pg_attribute attr = TupleDescAttr(RelationGetDescr(source_idx),
1882 : keyno);
1883 3806 : int16 opt = source_idx->rd_indoption[keyno];
1884 :
1885 3806 : iparam = makeNode(IndexElem);
1886 :
1887 3806 : if (AttributeNumberIsValid(attnum))
1888 : {
1889 : /* Simple index column */
1890 : char *attname;
1891 :
1892 3622 : attname = get_attname(indrelid, attnum, false);
1893 3622 : keycoltype = get_atttype(indrelid, attnum);
1894 :
1895 3622 : iparam->name = attname;
1896 3622 : 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 3806 : iparam->indexcolname = pstrdup(NameStr(attr->attname));
1931 :
1932 : /* Add the collation name, if non-default */
1933 3806 : iparam->collation = get_collation(indcollation->values[keyno], keycoltype);
1934 :
1935 : /* Add the operator class name, if non-default */
1936 3806 : iparam->opclass = get_opclass(indclass->values[keyno], keycoltype);
1937 3806 : iparam->opclassopts =
1938 3806 : untransformRelOptions(get_attoptions(source_relid, keyno + 1));
1939 :
1940 3806 : iparam->ordering = SORTBY_DEFAULT;
1941 3806 : iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1942 :
1943 : /* Adjust options if necessary */
1944 3806 : 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 3612 : 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 3612 : if (opt & INDOPTION_NULLS_FIRST)
1961 0 : iparam->nulls_ordering = SORTBY_NULLS_FIRST;
1962 : }
1963 : }
1964 :
1965 3806 : index->indexParams = lappend(index->indexParams, iparam);
1966 : }
1967 :
1968 : /* Handle included columns separately */
1969 3282 : for (keyno = idxrec->indnkeyatts; keyno < idxrec->indnatts; keyno++)
1970 : {
1971 : IndexElem *iparam;
1972 18 : AttrNumber attnum = idxrec->indkey.values[keyno];
1973 18 : Form_pg_attribute attr = TupleDescAttr(RelationGetDescr(source_idx),
1974 : keyno);
1975 :
1976 18 : iparam = makeNode(IndexElem);
1977 :
1978 18 : if (AttributeNumberIsValid(attnum))
1979 : {
1980 : /* Simple index column */
1981 : char *attname;
1982 :
1983 18 : attname = get_attname(indrelid, attnum, false);
1984 :
1985 18 : iparam->name = attname;
1986 18 : iparam->expr = NULL;
1987 : }
1988 : else
1989 0 : ereport(ERROR,
1990 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1991 : errmsg("expressions are not supported in included columns")));
1992 :
1993 : /* Copy the original index column name */
1994 18 : iparam->indexcolname = pstrdup(NameStr(attr->attname));
1995 :
1996 18 : index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
1997 : }
1998 : /* Copy reloptions if any */
1999 3264 : datum = SysCacheGetAttr(RELOID, ht_idxrel,
2000 : Anum_pg_class_reloptions, &isnull);
2001 3264 : if (!isnull)
2002 0 : index->options = untransformRelOptions(datum);
2003 :
2004 : /* If it's a partial index, decompile and append the predicate */
2005 3264 : datum = SysCacheGetAttr(INDEXRELID, ht_idx,
2006 : Anum_pg_index_indpred, &isnull);
2007 3264 : if (!isnull)
2008 : {
2009 : char *pred_str;
2010 : Node *pred_tree;
2011 : bool found_whole_row;
2012 :
2013 : /* Convert text string to node tree */
2014 30 : pred_str = TextDatumGetCString(datum);
2015 30 : pred_tree = (Node *) stringToNode(pred_str);
2016 :
2017 : /* Adjust Vars to match new table's column numbering */
2018 30 : pred_tree = map_variable_attnos(pred_tree,
2019 : 1, 0,
2020 : attmap,
2021 : InvalidOid, &found_whole_row);
2022 :
2023 : /* As in expandTableLikeClause, reject whole-row variables */
2024 30 : if (found_whole_row)
2025 0 : ereport(ERROR,
2026 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2027 : errmsg("cannot convert whole-row table reference"),
2028 : errdetail("Index \"%s\" contains a whole-row table reference.",
2029 : RelationGetRelationName(source_idx))));
2030 :
2031 30 : index->whereClause = pred_tree;
2032 : }
2033 :
2034 : /* Clean up */
2035 3264 : ReleaseSysCache(ht_idxrel);
2036 3264 : ReleaseSysCache(ht_am);
2037 :
2038 3264 : return index;
2039 : }
2040 :
2041 : /*
2042 : * Generate a CreateStatsStmt node using information from an already existing
2043 : * extended statistic "source_statsid", for the rel identified by heapRel and
2044 : * heapRelid.
2045 : *
2046 : * Attribute numbers in expression Vars are adjusted according to attmap.
2047 : */
2048 : static CreateStatsStmt *
2049 48 : generateClonedExtStatsStmt(RangeVar *heapRel, Oid heapRelid,
2050 : Oid source_statsid, const AttrMap *attmap)
2051 : {
2052 : HeapTuple ht_stats;
2053 : Form_pg_statistic_ext statsrec;
2054 : CreateStatsStmt *stats;
2055 48 : List *stat_types = NIL;
2056 48 : List *def_names = NIL;
2057 : bool isnull;
2058 : Datum datum;
2059 : ArrayType *arr;
2060 : char *enabled;
2061 : int i;
2062 :
2063 : Assert(OidIsValid(heapRelid));
2064 : Assert(heapRel != NULL);
2065 :
2066 : /*
2067 : * Fetch pg_statistic_ext tuple of source statistics object.
2068 : */
2069 48 : ht_stats = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(source_statsid));
2070 48 : if (!HeapTupleIsValid(ht_stats))
2071 0 : elog(ERROR, "cache lookup failed for statistics object %u", source_statsid);
2072 48 : statsrec = (Form_pg_statistic_ext) GETSTRUCT(ht_stats);
2073 :
2074 : /* Determine which statistics types exist */
2075 48 : datum = SysCacheGetAttrNotNull(STATEXTOID, ht_stats,
2076 : Anum_pg_statistic_ext_stxkind);
2077 48 : arr = DatumGetArrayTypeP(datum);
2078 48 : if (ARR_NDIM(arr) != 1 ||
2079 48 : ARR_HASNULL(arr) ||
2080 48 : ARR_ELEMTYPE(arr) != CHAROID)
2081 0 : elog(ERROR, "stxkind is not a 1-D char array");
2082 48 : enabled = (char *) ARR_DATA_PTR(arr);
2083 144 : for (i = 0; i < ARR_DIMS(arr)[0]; i++)
2084 : {
2085 96 : if (enabled[i] == STATS_EXT_NDISTINCT)
2086 24 : stat_types = lappend(stat_types, makeString("ndistinct"));
2087 72 : else if (enabled[i] == STATS_EXT_DEPENDENCIES)
2088 24 : stat_types = lappend(stat_types, makeString("dependencies"));
2089 48 : else if (enabled[i] == STATS_EXT_MCV)
2090 24 : stat_types = lappend(stat_types, makeString("mcv"));
2091 24 : else if (enabled[i] == STATS_EXT_EXPRESSIONS)
2092 : /* expression stats are not exposed to users */
2093 24 : continue;
2094 : else
2095 0 : elog(ERROR, "unrecognized statistics kind %c", enabled[i]);
2096 : }
2097 :
2098 : /* Determine which columns the statistics are on */
2099 96 : for (i = 0; i < statsrec->stxkeys.dim1; i++)
2100 : {
2101 48 : StatsElem *selem = makeNode(StatsElem);
2102 48 : AttrNumber attnum = statsrec->stxkeys.values[i];
2103 :
2104 48 : selem->name = get_attname(heapRelid, attnum, false);
2105 48 : selem->expr = NULL;
2106 :
2107 48 : def_names = lappend(def_names, selem);
2108 : }
2109 :
2110 : /*
2111 : * Now handle expressions, if there are any. The order (with respect to
2112 : * regular attributes) does not really matter for extended stats, so we
2113 : * simply append them after simple column references.
2114 : *
2115 : * XXX Some places during build/estimation treat expressions as if they
2116 : * are before attributes, but for the CREATE command that's entirely
2117 : * irrelevant.
2118 : */
2119 48 : datum = SysCacheGetAttr(STATEXTOID, ht_stats,
2120 : Anum_pg_statistic_ext_stxexprs, &isnull);
2121 :
2122 48 : if (!isnull)
2123 : {
2124 : ListCell *lc;
2125 24 : List *exprs = NIL;
2126 : char *exprsString;
2127 :
2128 24 : exprsString = TextDatumGetCString(datum);
2129 24 : exprs = (List *) stringToNode(exprsString);
2130 :
2131 48 : foreach(lc, exprs)
2132 : {
2133 24 : Node *expr = (Node *) lfirst(lc);
2134 24 : StatsElem *selem = makeNode(StatsElem);
2135 : bool found_whole_row;
2136 :
2137 : /* Adjust Vars to match new table's column numbering */
2138 24 : expr = map_variable_attnos(expr,
2139 : 1, 0,
2140 : attmap,
2141 : InvalidOid,
2142 : &found_whole_row);
2143 :
2144 24 : selem->name = NULL;
2145 24 : selem->expr = expr;
2146 :
2147 24 : def_names = lappend(def_names, selem);
2148 : }
2149 :
2150 24 : pfree(exprsString);
2151 : }
2152 :
2153 : /* finally, build the output node */
2154 48 : stats = makeNode(CreateStatsStmt);
2155 48 : stats->defnames = NULL;
2156 48 : stats->stat_types = stat_types;
2157 48 : stats->exprs = def_names;
2158 48 : stats->relations = list_make1(heapRel);
2159 48 : stats->stxcomment = NULL;
2160 48 : stats->transformed = true; /* don't need transformStatsStmt again */
2161 48 : stats->if_not_exists = false;
2162 :
2163 : /* Clean up */
2164 48 : ReleaseSysCache(ht_stats);
2165 :
2166 48 : return stats;
2167 : }
2168 :
2169 : /*
2170 : * get_collation - fetch qualified name of a collation
2171 : *
2172 : * If collation is InvalidOid or is the default for the given actual_datatype,
2173 : * then the return value is NIL.
2174 : */
2175 : static List *
2176 3806 : get_collation(Oid collation, Oid actual_datatype)
2177 : {
2178 : List *result;
2179 : HeapTuple ht_coll;
2180 : Form_pg_collation coll_rec;
2181 : char *nsp_name;
2182 : char *coll_name;
2183 :
2184 3806 : if (!OidIsValid(collation))
2185 3396 : return NIL; /* easy case */
2186 410 : if (collation == get_typcollation(actual_datatype))
2187 388 : return NIL; /* just let it default */
2188 :
2189 22 : ht_coll = SearchSysCache1(COLLOID, ObjectIdGetDatum(collation));
2190 22 : if (!HeapTupleIsValid(ht_coll))
2191 0 : elog(ERROR, "cache lookup failed for collation %u", collation);
2192 22 : coll_rec = (Form_pg_collation) GETSTRUCT(ht_coll);
2193 :
2194 : /* For simplicity, we always schema-qualify the name */
2195 22 : nsp_name = get_namespace_name(coll_rec->collnamespace);
2196 22 : coll_name = pstrdup(NameStr(coll_rec->collname));
2197 22 : result = list_make2(makeString(nsp_name), makeString(coll_name));
2198 :
2199 22 : ReleaseSysCache(ht_coll);
2200 22 : return result;
2201 : }
2202 :
2203 : /*
2204 : * get_opclass - fetch qualified name of an index operator class
2205 : *
2206 : * If the opclass is the default for the given actual_datatype, then
2207 : * the return value is NIL.
2208 : */
2209 : static List *
2210 3806 : get_opclass(Oid opclass, Oid actual_datatype)
2211 : {
2212 3806 : List *result = NIL;
2213 : HeapTuple ht_opc;
2214 : Form_pg_opclass opc_rec;
2215 :
2216 3806 : ht_opc = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
2217 3806 : if (!HeapTupleIsValid(ht_opc))
2218 0 : elog(ERROR, "cache lookup failed for opclass %u", opclass);
2219 3806 : opc_rec = (Form_pg_opclass) GETSTRUCT(ht_opc);
2220 :
2221 3806 : if (GetDefaultOpClass(actual_datatype, opc_rec->opcmethod) != opclass)
2222 : {
2223 : /* For simplicity, we always schema-qualify the name */
2224 24 : char *nsp_name = get_namespace_name(opc_rec->opcnamespace);
2225 24 : char *opc_name = pstrdup(NameStr(opc_rec->opcname));
2226 :
2227 24 : result = list_make2(makeString(nsp_name), makeString(opc_name));
2228 : }
2229 :
2230 3806 : ReleaseSysCache(ht_opc);
2231 3806 : return result;
2232 : }
2233 :
2234 :
2235 : /*
2236 : * transformIndexConstraints
2237 : * Handle UNIQUE, PRIMARY KEY, EXCLUDE constraints, which create indexes.
2238 : * We also merge in any index definitions arising from
2239 : * LIKE ... INCLUDING INDEXES.
2240 : */
2241 : static void
2242 64750 : transformIndexConstraints(CreateStmtContext *cxt)
2243 : {
2244 : IndexStmt *index;
2245 64750 : List *indexlist = NIL;
2246 64750 : List *finalindexlist = NIL;
2247 : ListCell *lc;
2248 :
2249 : /*
2250 : * Run through the constraints that need to generate an index, and do so.
2251 : *
2252 : * For PRIMARY KEY, this queues not-null constraints for each column, if
2253 : * needed.
2254 : */
2255 84764 : foreach(lc, cxt->ixconstraints)
2256 : {
2257 20080 : Constraint *constraint = lfirst_node(Constraint, lc);
2258 :
2259 : Assert(constraint->contype == CONSTR_PRIMARY ||
2260 : constraint->contype == CONSTR_UNIQUE ||
2261 : constraint->contype == CONSTR_EXCLUSION);
2262 :
2263 20080 : index = transformIndexConstraint(constraint, cxt);
2264 :
2265 20014 : indexlist = lappend(indexlist, index);
2266 : }
2267 :
2268 : /*
2269 : * Scan the index list and remove any redundant index specifications. This
2270 : * can happen if, for instance, the user writes UNIQUE PRIMARY KEY. A
2271 : * strict reading of SQL would suggest raising an error instead, but that
2272 : * strikes me as too anal-retentive. - tgl 2001-02-14
2273 : *
2274 : * XXX in ALTER TABLE case, it'd be nice to look for duplicate
2275 : * pre-existing indexes, too.
2276 : */
2277 64684 : if (cxt->pkey != NULL)
2278 : {
2279 : /* Make sure we keep the PKEY index in preference to others... */
2280 14114 : finalindexlist = list_make1(cxt->pkey);
2281 : }
2282 :
2283 84698 : foreach(lc, indexlist)
2284 : {
2285 20014 : bool keep = true;
2286 : ListCell *k;
2287 :
2288 20014 : index = lfirst(lc);
2289 :
2290 : /* if it's pkey, it's already in finalindexlist */
2291 20014 : if (index == cxt->pkey)
2292 14114 : continue;
2293 :
2294 6094 : foreach(k, finalindexlist)
2295 : {
2296 194 : IndexStmt *priorindex = lfirst(k);
2297 :
2298 200 : if (equal(index->indexParams, priorindex->indexParams) &&
2299 12 : equal(index->indexIncludingParams, priorindex->indexIncludingParams) &&
2300 12 : equal(index->whereClause, priorindex->whereClause) &&
2301 6 : equal(index->excludeOpNames, priorindex->excludeOpNames) &&
2302 6 : strcmp(index->accessMethod, priorindex->accessMethod) == 0 &&
2303 6 : index->nulls_not_distinct == priorindex->nulls_not_distinct &&
2304 6 : index->deferrable == priorindex->deferrable &&
2305 0 : index->initdeferred == priorindex->initdeferred)
2306 : {
2307 0 : priorindex->unique |= index->unique;
2308 :
2309 : /*
2310 : * If the prior index is as yet unnamed, and this one is
2311 : * named, then transfer the name to the prior index. This
2312 : * ensures that if we have named and unnamed constraints,
2313 : * we'll use (at least one of) the names for the index.
2314 : */
2315 0 : if (priorindex->idxname == NULL)
2316 0 : priorindex->idxname = index->idxname;
2317 0 : keep = false;
2318 0 : break;
2319 : }
2320 : }
2321 :
2322 5900 : if (keep)
2323 5900 : finalindexlist = lappend(finalindexlist, index);
2324 : }
2325 :
2326 : /*
2327 : * Now append all the IndexStmts to cxt->alist.
2328 : */
2329 64684 : cxt->alist = list_concat(cxt->alist, finalindexlist);
2330 64684 : }
2331 :
2332 : /*
2333 : * transformIndexConstraint
2334 : * Transform one UNIQUE, PRIMARY KEY, or EXCLUDE constraint for
2335 : * transformIndexConstraints. An IndexStmt is returned.
2336 : *
2337 : * For a PRIMARY KEY constraint, we additionally create not-null constraints
2338 : * for columns that don't already have them.
2339 : */
2340 : static IndexStmt *
2341 20080 : transformIndexConstraint(Constraint *constraint, CreateStmtContext *cxt)
2342 : {
2343 : IndexStmt *index;
2344 : ListCell *lc;
2345 :
2346 20080 : index = makeNode(IndexStmt);
2347 :
2348 20080 : index->unique = (constraint->contype != CONSTR_EXCLUSION);
2349 20080 : index->primary = (constraint->contype == CONSTR_PRIMARY);
2350 20080 : if (index->primary)
2351 : {
2352 14144 : if (cxt->pkey != NULL)
2353 0 : ereport(ERROR,
2354 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
2355 : errmsg("multiple primary keys for table \"%s\" are not allowed",
2356 : cxt->relation->relname),
2357 : parser_errposition(cxt->pstate, constraint->location)));
2358 14144 : cxt->pkey = index;
2359 :
2360 : /*
2361 : * In ALTER TABLE case, a primary index might already exist, but
2362 : * DefineIndex will check for it.
2363 : */
2364 : }
2365 20080 : index->nulls_not_distinct = constraint->nulls_not_distinct;
2366 20080 : index->isconstraint = true;
2367 20080 : index->iswithoutoverlaps = constraint->without_overlaps;
2368 20080 : index->deferrable = constraint->deferrable;
2369 20080 : index->initdeferred = constraint->initdeferred;
2370 :
2371 20080 : if (constraint->conname != NULL)
2372 1480 : index->idxname = pstrdup(constraint->conname);
2373 : else
2374 18600 : index->idxname = NULL; /* DefineIndex will choose name */
2375 :
2376 20080 : index->relation = cxt->relation;
2377 20080 : index->accessMethod = constraint->access_method ? constraint->access_method : DEFAULT_INDEX_TYPE;
2378 20080 : index->options = constraint->options;
2379 20080 : index->tableSpace = constraint->indexspace;
2380 20080 : index->whereClause = constraint->where_clause;
2381 20080 : index->indexParams = NIL;
2382 20080 : index->indexIncludingParams = NIL;
2383 20080 : index->excludeOpNames = NIL;
2384 20080 : index->idxcomment = NULL;
2385 20080 : index->indexOid = InvalidOid;
2386 20080 : index->oldNumber = InvalidRelFileNumber;
2387 20080 : index->oldCreateSubid = InvalidSubTransactionId;
2388 20080 : index->oldFirstRelfilelocatorSubid = InvalidSubTransactionId;
2389 20080 : index->transformed = false;
2390 20080 : index->concurrent = false;
2391 20080 : index->if_not_exists = false;
2392 20080 : index->reset_default_tblspc = constraint->reset_default_tblspc;
2393 :
2394 : /*
2395 : * If it's ALTER TABLE ADD CONSTRAINT USING INDEX, look up the index and
2396 : * verify it's usable, then extract the implied column name list. (We
2397 : * will not actually need the column name list at runtime, but we need it
2398 : * now to check for duplicate column entries below.)
2399 : */
2400 20080 : if (constraint->indexname != NULL)
2401 : {
2402 10884 : char *index_name = constraint->indexname;
2403 10884 : Relation heap_rel = cxt->rel;
2404 : Oid index_oid;
2405 : Relation index_rel;
2406 : Form_pg_index index_form;
2407 : oidvector *indclass;
2408 : Datum indclassDatum;
2409 : int i;
2410 :
2411 : /* Grammar should not allow this with explicit column list */
2412 : Assert(constraint->keys == NIL);
2413 :
2414 : /* Grammar should only allow PRIMARY and UNIQUE constraints */
2415 : Assert(constraint->contype == CONSTR_PRIMARY ||
2416 : constraint->contype == CONSTR_UNIQUE);
2417 :
2418 : /* Must be ALTER, not CREATE, but grammar doesn't enforce that */
2419 10884 : if (!cxt->isalter)
2420 0 : ereport(ERROR,
2421 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2422 : errmsg("cannot use an existing index in CREATE TABLE"),
2423 : parser_errposition(cxt->pstate, constraint->location)));
2424 :
2425 : /* Look for the index in the same schema as the table */
2426 10884 : index_oid = get_relname_relid(index_name, RelationGetNamespace(heap_rel));
2427 :
2428 10884 : if (!OidIsValid(index_oid))
2429 0 : ereport(ERROR,
2430 : (errcode(ERRCODE_UNDEFINED_OBJECT),
2431 : errmsg("index \"%s\" does not exist", index_name),
2432 : parser_errposition(cxt->pstate, constraint->location)));
2433 :
2434 : /* Open the index (this will throw an error if it is not an index) */
2435 10884 : index_rel = index_open(index_oid, AccessShareLock);
2436 10884 : index_form = index_rel->rd_index;
2437 :
2438 : /* Check that it does not have an associated constraint already */
2439 10884 : if (OidIsValid(get_index_constraint(index_oid)))
2440 0 : ereport(ERROR,
2441 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2442 : errmsg("index \"%s\" is already associated with a constraint",
2443 : index_name),
2444 : parser_errposition(cxt->pstate, constraint->location)));
2445 :
2446 : /* Perform validity checks on the index */
2447 10884 : if (index_form->indrelid != RelationGetRelid(heap_rel))
2448 0 : ereport(ERROR,
2449 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2450 : errmsg("index \"%s\" does not belong to table \"%s\"",
2451 : index_name, RelationGetRelationName(heap_rel)),
2452 : parser_errposition(cxt->pstate, constraint->location)));
2453 :
2454 10884 : if (!index_form->indisvalid)
2455 0 : ereport(ERROR,
2456 : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
2457 : errmsg("index \"%s\" is not valid", index_name),
2458 : parser_errposition(cxt->pstate, constraint->location)));
2459 :
2460 : /*
2461 : * Today we forbid non-unique indexes, but we could permit GiST
2462 : * indexes whose last entry is a range type and use that to create a
2463 : * WITHOUT OVERLAPS constraint (i.e. a temporal constraint).
2464 : */
2465 10884 : if (!index_form->indisunique)
2466 12 : ereport(ERROR,
2467 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2468 : errmsg("\"%s\" is not a unique index", index_name),
2469 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2470 : parser_errposition(cxt->pstate, constraint->location)));
2471 :
2472 10872 : if (RelationGetIndexExpressions(index_rel) != NIL)
2473 0 : ereport(ERROR,
2474 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2475 : errmsg("index \"%s\" contains expressions", index_name),
2476 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2477 : parser_errposition(cxt->pstate, constraint->location)));
2478 :
2479 10872 : if (RelationGetIndexPredicate(index_rel) != NIL)
2480 0 : ereport(ERROR,
2481 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2482 : errmsg("\"%s\" is a partial index", index_name),
2483 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2484 : parser_errposition(cxt->pstate, constraint->location)));
2485 :
2486 : /*
2487 : * It's probably unsafe to change a deferred index to non-deferred. (A
2488 : * non-constraint index couldn't be deferred anyway, so this case
2489 : * should never occur; no need to sweat, but let's check it.)
2490 : */
2491 10872 : if (!index_form->indimmediate && !constraint->deferrable)
2492 0 : ereport(ERROR,
2493 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2494 : errmsg("\"%s\" is a deferrable index", index_name),
2495 : errdetail("Cannot create a non-deferrable constraint using a deferrable index."),
2496 : parser_errposition(cxt->pstate, constraint->location)));
2497 :
2498 : /*
2499 : * Insist on it being a btree. We must have an index that exactly
2500 : * matches what you'd get from plain ADD CONSTRAINT syntax, else dump
2501 : * and reload will produce a different index (breaking pg_upgrade in
2502 : * particular).
2503 : */
2504 10872 : if (index_rel->rd_rel->relam != get_index_am_oid(DEFAULT_INDEX_TYPE, false))
2505 0 : ereport(ERROR,
2506 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2507 : errmsg("index \"%s\" is not a btree", index_name),
2508 : parser_errposition(cxt->pstate, constraint->location)));
2509 :
2510 : /* Must get indclass the hard way */
2511 10872 : indclassDatum = SysCacheGetAttrNotNull(INDEXRELID,
2512 10872 : index_rel->rd_indextuple,
2513 : Anum_pg_index_indclass);
2514 10872 : indclass = (oidvector *) DatumGetPointer(indclassDatum);
2515 :
2516 28756 : for (i = 0; i < index_form->indnatts; i++)
2517 : {
2518 17896 : int16 attnum = index_form->indkey.values[i];
2519 : const FormData_pg_attribute *attform;
2520 : char *attname;
2521 : Oid defopclass;
2522 :
2523 : /*
2524 : * We shouldn't see attnum == 0 here, since we already rejected
2525 : * expression indexes. If we do, SystemAttributeDefinition will
2526 : * throw an error.
2527 : */
2528 17896 : if (attnum > 0)
2529 : {
2530 : Assert(attnum <= heap_rel->rd_att->natts);
2531 17896 : attform = TupleDescAttr(heap_rel->rd_att, attnum - 1);
2532 : }
2533 : else
2534 0 : attform = SystemAttributeDefinition(attnum);
2535 17896 : attname = pstrdup(NameStr(attform->attname));
2536 :
2537 17896 : if (i < index_form->indnkeyatts)
2538 : {
2539 : /*
2540 : * Insist on default opclass, collation, and sort options.
2541 : * While the index would still work as a constraint with
2542 : * non-default settings, it might not provide exactly the same
2543 : * uniqueness semantics as you'd get from a normally-created
2544 : * constraint; and there's also the dump/reload problem
2545 : * mentioned above.
2546 : */
2547 : Datum attoptions =
2548 17866 : get_attoptions(RelationGetRelid(index_rel), i + 1);
2549 :
2550 17866 : defopclass = GetDefaultOpClass(attform->atttypid,
2551 17866 : index_rel->rd_rel->relam);
2552 17866 : if (indclass->values[i] != defopclass ||
2553 17866 : attform->attcollation != index_rel->rd_indcollation[i] ||
2554 17860 : attoptions != (Datum) 0 ||
2555 17860 : index_rel->rd_indoption[i] != 0)
2556 12 : ereport(ERROR,
2557 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2558 : errmsg("index \"%s\" column number %d does not have default sorting behavior", index_name, i + 1),
2559 : errdetail("Cannot create a primary key or unique constraint using such an index."),
2560 : parser_errposition(cxt->pstate, constraint->location)));
2561 :
2562 : /* If a PK, ensure the columns get not null constraints */
2563 17854 : if (constraint->contype == CONSTR_PRIMARY)
2564 8120 : cxt->nnconstraints =
2565 8120 : lappend(cxt->nnconstraints,
2566 8120 : makeNotNullConstraint(makeString(attname)));
2567 :
2568 17854 : constraint->keys = lappend(constraint->keys, makeString(attname));
2569 : }
2570 : else
2571 30 : constraint->including = lappend(constraint->including, makeString(attname));
2572 : }
2573 :
2574 : /* Close the index relation but keep the lock */
2575 10860 : index_close(index_rel, NoLock);
2576 :
2577 10860 : index->indexOid = index_oid;
2578 : }
2579 :
2580 : /*
2581 : * If it's an EXCLUDE constraint, the grammar returns a list of pairs of
2582 : * IndexElems and operator names. We have to break that apart into
2583 : * separate lists.
2584 : */
2585 20056 : if (constraint->contype == CONSTR_EXCLUSION)
2586 : {
2587 574 : foreach(lc, constraint->exclusions)
2588 : {
2589 340 : List *pair = (List *) lfirst(lc);
2590 : IndexElem *elem;
2591 : List *opname;
2592 :
2593 : Assert(list_length(pair) == 2);
2594 340 : elem = linitial_node(IndexElem, pair);
2595 340 : opname = lsecond_node(List, pair);
2596 :
2597 340 : index->indexParams = lappend(index->indexParams, elem);
2598 340 : index->excludeOpNames = lappend(index->excludeOpNames, opname);
2599 : }
2600 : }
2601 :
2602 : /*
2603 : * For UNIQUE and PRIMARY KEY, we just have a list of column names.
2604 : *
2605 : * Make sure referenced keys exist. If we are making a PRIMARY KEY index,
2606 : * also make sure they are not-null. For WITHOUT OVERLAPS constraints, we
2607 : * make sure the last part is a range or multirange.
2608 : */
2609 : else
2610 : {
2611 48108 : foreach(lc, constraint->keys)
2612 : {
2613 28316 : char *key = strVal(lfirst(lc));
2614 28316 : bool found = false;
2615 28316 : ColumnDef *column = NULL;
2616 : ListCell *columns;
2617 : IndexElem *iparam;
2618 28316 : Oid typid = InvalidOid;
2619 :
2620 : /* Make sure referenced column exists. */
2621 30032 : foreach(columns, cxt->columns)
2622 : {
2623 10418 : column = lfirst_node(ColumnDef, columns);
2624 10418 : if (strcmp(column->colname, key) == 0)
2625 : {
2626 8702 : found = true;
2627 8702 : break;
2628 : }
2629 : }
2630 28316 : if (!found)
2631 19614 : column = NULL;
2632 :
2633 28316 : if (found)
2634 : {
2635 : /*
2636 : * column is defined in the new table. For CREATE TABLE with
2637 : * a PRIMARY KEY, we can apply the not-null constraint cheaply
2638 : * here. If the not-null constraint already exists, we can
2639 : * (albeit not so cheaply) verify that it's not a NO INHERIT
2640 : * constraint.
2641 : *
2642 : * Note that ALTER TABLE never needs either check, because
2643 : * those constraints have already been added by
2644 : * ATPrepAddPrimaryKey.
2645 : */
2646 8702 : if (constraint->contype == CONSTR_PRIMARY &&
2647 7900 : !cxt->isalter)
2648 : {
2649 7876 : if (column->is_not_null)
2650 : {
2651 12746 : foreach_node(Constraint, nn, cxt->nnconstraints)
2652 : {
2653 6466 : if (strcmp(strVal(linitial(nn->keys)), key) == 0)
2654 : {
2655 6286 : if (nn->is_no_inherit)
2656 6 : ereport(ERROR,
2657 : errcode(ERRCODE_SYNTAX_ERROR),
2658 : errmsg("conflicting NO INHERIT declaration for not-null constraint on column \"%s\"",
2659 : key));
2660 6280 : break;
2661 : }
2662 : }
2663 : }
2664 : else
2665 : {
2666 1590 : column->is_not_null = true;
2667 1590 : cxt->nnconstraints =
2668 1590 : lappend(cxt->nnconstraints,
2669 1590 : makeNotNullConstraint(makeString(key)));
2670 : }
2671 : }
2672 24 : else if (constraint->contype == CONSTR_PRIMARY)
2673 : Assert(column->is_not_null);
2674 : }
2675 19614 : else if (SystemAttributeByName(key) != NULL)
2676 : {
2677 : /*
2678 : * column will be a system column in the new table, so accept
2679 : * it. System columns can't ever be null, so no need to worry
2680 : * about PRIMARY/NOT NULL constraint.
2681 : */
2682 0 : found = true;
2683 : }
2684 19614 : else if (cxt->inhRelations)
2685 : {
2686 : /* try inherited tables */
2687 : ListCell *inher;
2688 :
2689 96 : foreach(inher, cxt->inhRelations)
2690 : {
2691 96 : RangeVar *inh = lfirst_node(RangeVar, inher);
2692 : Relation rel;
2693 : int count;
2694 :
2695 96 : rel = table_openrv(inh, AccessShareLock);
2696 : /* check user requested inheritance from valid relkind */
2697 96 : if (rel->rd_rel->relkind != RELKIND_RELATION &&
2698 0 : rel->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
2699 0 : rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
2700 0 : ereport(ERROR,
2701 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2702 : errmsg("inherited relation \"%s\" is not a table or foreign table",
2703 : inh->relname)));
2704 102 : for (count = 0; count < rel->rd_att->natts; count++)
2705 : {
2706 102 : Form_pg_attribute inhattr = TupleDescAttr(rel->rd_att,
2707 : count);
2708 102 : char *inhname = NameStr(inhattr->attname);
2709 :
2710 102 : if (inhattr->attisdropped)
2711 0 : continue;
2712 102 : if (strcmp(key, inhname) == 0)
2713 : {
2714 96 : found = true;
2715 96 : typid = inhattr->atttypid;
2716 :
2717 96 : if (constraint->contype == CONSTR_PRIMARY)
2718 84 : cxt->nnconstraints =
2719 84 : lappend(cxt->nnconstraints,
2720 84 : makeNotNullConstraint(makeString(pstrdup(inhname))));
2721 96 : break;
2722 : }
2723 : }
2724 96 : table_close(rel, NoLock);
2725 96 : if (found)
2726 96 : break;
2727 : }
2728 : }
2729 :
2730 : /*
2731 : * In the ALTER TABLE case, don't complain about index keys not
2732 : * created in the command; they may well exist already.
2733 : * DefineIndex will complain about them if not.
2734 : */
2735 28310 : if (!found && !cxt->isalter)
2736 12 : ereport(ERROR,
2737 : (errcode(ERRCODE_UNDEFINED_COLUMN),
2738 : errmsg("column \"%s\" named in key does not exist", key),
2739 : parser_errposition(cxt->pstate, constraint->location)));
2740 :
2741 : /* Check for PRIMARY KEY(foo, foo) */
2742 39736 : foreach(columns, index->indexParams)
2743 : {
2744 11438 : iparam = (IndexElem *) lfirst(columns);
2745 11438 : if (iparam->name && strcmp(key, iparam->name) == 0)
2746 : {
2747 0 : if (index->primary)
2748 0 : ereport(ERROR,
2749 : (errcode(ERRCODE_DUPLICATE_COLUMN),
2750 : errmsg("column \"%s\" appears twice in primary key constraint",
2751 : key),
2752 : parser_errposition(cxt->pstate, constraint->location)));
2753 : else
2754 0 : ereport(ERROR,
2755 : (errcode(ERRCODE_DUPLICATE_COLUMN),
2756 : errmsg("column \"%s\" appears twice in unique constraint",
2757 : key),
2758 : parser_errposition(cxt->pstate, constraint->location)));
2759 : }
2760 : }
2761 :
2762 : /*
2763 : * The WITHOUT OVERLAPS part (if any) must be a range or
2764 : * multirange type.
2765 : */
2766 28298 : if (constraint->without_overlaps && lc == list_last_cell(constraint->keys))
2767 : {
2768 578 : if (!found && cxt->isalter)
2769 : {
2770 : /*
2771 : * Look up the column type on existing table. If we can't
2772 : * find it, let things fail in DefineIndex.
2773 : */
2774 166 : Relation rel = cxt->rel;
2775 :
2776 336 : for (int i = 0; i < rel->rd_att->natts; i++)
2777 : {
2778 336 : Form_pg_attribute attr = TupleDescAttr(rel->rd_att, i);
2779 : const char *attname;
2780 :
2781 336 : if (attr->attisdropped)
2782 0 : break;
2783 :
2784 336 : attname = NameStr(attr->attname);
2785 336 : if (strcmp(attname, key) == 0)
2786 : {
2787 166 : found = true;
2788 166 : typid = attr->atttypid;
2789 166 : break;
2790 : }
2791 : }
2792 : }
2793 578 : if (found)
2794 : {
2795 578 : if (!OidIsValid(typid) && column)
2796 406 : typid = typenameTypeId(NULL, column->typeName);
2797 :
2798 578 : if (!OidIsValid(typid) || !(type_is_range(typid) || type_is_multirange(typid)))
2799 12 : ereport(ERROR,
2800 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2801 : errmsg("column \"%s\" in WITHOUT OVERLAPS is not a range or multirange type", key),
2802 : parser_errposition(cxt->pstate, constraint->location)));
2803 : }
2804 : }
2805 :
2806 : /* OK, add it to the index definition */
2807 28286 : iparam = makeNode(IndexElem);
2808 28286 : iparam->name = pstrdup(key);
2809 28286 : iparam->expr = NULL;
2810 28286 : iparam->indexcolname = NULL;
2811 28286 : iparam->collation = NIL;
2812 28286 : iparam->opclass = NIL;
2813 28286 : iparam->opclassopts = NIL;
2814 28286 : iparam->ordering = SORTBY_DEFAULT;
2815 28286 : iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
2816 28286 : index->indexParams = lappend(index->indexParams, iparam);
2817 : }
2818 :
2819 19792 : if (constraint->without_overlaps)
2820 : {
2821 : /*
2822 : * This enforces that there is at least one equality column
2823 : * besides the WITHOUT OVERLAPS columns. This is per SQL
2824 : * standard. XXX Do we need this?
2825 : */
2826 566 : if (list_length(constraint->keys) < 2)
2827 12 : ereport(ERROR,
2828 : errcode(ERRCODE_SYNTAX_ERROR),
2829 : errmsg("constraint using WITHOUT OVERLAPS needs at least two columns"));
2830 :
2831 : /* WITHOUT OVERLAPS requires a GiST index */
2832 554 : index->accessMethod = "gist";
2833 : }
2834 :
2835 : }
2836 :
2837 : /*
2838 : * Add included columns to index definition. This is much like the
2839 : * simple-column-name-list code above, except that we don't worry about
2840 : * NOT NULL marking; included columns in a primary key should not be
2841 : * forced NOT NULL. We don't complain about duplicate columns, either,
2842 : * though maybe we should?
2843 : */
2844 20322 : foreach(lc, constraint->including)
2845 : {
2846 308 : char *key = strVal(lfirst(lc));
2847 308 : bool found = false;
2848 308 : ColumnDef *column = NULL;
2849 : ListCell *columns;
2850 : IndexElem *iparam;
2851 :
2852 662 : foreach(columns, cxt->columns)
2853 : {
2854 544 : column = lfirst_node(ColumnDef, columns);
2855 544 : if (strcmp(column->colname, key) == 0)
2856 : {
2857 190 : found = true;
2858 190 : break;
2859 : }
2860 : }
2861 :
2862 308 : if (!found)
2863 : {
2864 118 : if (SystemAttributeByName(key) != NULL)
2865 : {
2866 : /*
2867 : * column will be a system column in the new table, so accept
2868 : * it.
2869 : */
2870 0 : found = true;
2871 : }
2872 118 : else if (cxt->inhRelations)
2873 : {
2874 : /* try inherited tables */
2875 : ListCell *inher;
2876 :
2877 0 : foreach(inher, cxt->inhRelations)
2878 : {
2879 0 : RangeVar *inh = lfirst_node(RangeVar, inher);
2880 : Relation rel;
2881 : int count;
2882 :
2883 0 : rel = table_openrv(inh, AccessShareLock);
2884 : /* check user requested inheritance from valid relkind */
2885 0 : if (rel->rd_rel->relkind != RELKIND_RELATION &&
2886 0 : rel->rd_rel->relkind != RELKIND_FOREIGN_TABLE &&
2887 0 : rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
2888 0 : ereport(ERROR,
2889 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2890 : errmsg("inherited relation \"%s\" is not a table or foreign table",
2891 : inh->relname)));
2892 0 : for (count = 0; count < rel->rd_att->natts; count++)
2893 : {
2894 0 : Form_pg_attribute inhattr = TupleDescAttr(rel->rd_att,
2895 : count);
2896 0 : char *inhname = NameStr(inhattr->attname);
2897 :
2898 0 : if (inhattr->attisdropped)
2899 0 : continue;
2900 0 : if (strcmp(key, inhname) == 0)
2901 : {
2902 0 : found = true;
2903 0 : break;
2904 : }
2905 : }
2906 0 : table_close(rel, NoLock);
2907 0 : if (found)
2908 0 : break;
2909 : }
2910 : }
2911 : }
2912 :
2913 : /*
2914 : * In the ALTER TABLE case, don't complain about index keys not
2915 : * created in the command; they may well exist already. DefineIndex
2916 : * will complain about them if not.
2917 : */
2918 308 : if (!found && !cxt->isalter)
2919 0 : ereport(ERROR,
2920 : (errcode(ERRCODE_UNDEFINED_COLUMN),
2921 : errmsg("column \"%s\" named in key does not exist", key),
2922 : parser_errposition(cxt->pstate, constraint->location)));
2923 :
2924 : /* OK, add it to the index definition */
2925 308 : iparam = makeNode(IndexElem);
2926 308 : iparam->name = pstrdup(key);
2927 308 : iparam->expr = NULL;
2928 308 : iparam->indexcolname = NULL;
2929 308 : iparam->collation = NIL;
2930 308 : iparam->opclass = NIL;
2931 308 : iparam->opclassopts = NIL;
2932 308 : index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
2933 : }
2934 :
2935 20014 : return index;
2936 : }
2937 :
2938 : /*
2939 : * transformCheckConstraints
2940 : * handle CHECK constraints
2941 : *
2942 : * Right now, there's nothing to do here when called from ALTER TABLE,
2943 : * but the other constraint-transformation functions are called in both
2944 : * the CREATE TABLE and ALTER TABLE paths, so do the same here, and just
2945 : * don't do anything if we're not authorized to skip validation.
2946 : */
2947 : static void
2948 64684 : transformCheckConstraints(CreateStmtContext *cxt, bool skipValidation)
2949 : {
2950 : ListCell *ckclist;
2951 :
2952 64684 : if (cxt->ckconstraints == NIL)
2953 62854 : return;
2954 :
2955 : /*
2956 : * When creating a new table (but not a foreign table), we can safely skip
2957 : * the validation of check constraints and mark them as valid based on the
2958 : * constraint enforcement flag, since NOT ENFORCED constraints must always
2959 : * be marked as NOT VALID. (This will override any user-supplied NOT VALID
2960 : * flag.)
2961 : */
2962 1830 : if (skipValidation)
2963 : {
2964 1592 : foreach(ckclist, cxt->ckconstraints)
2965 : {
2966 866 : Constraint *constraint = (Constraint *) lfirst(ckclist);
2967 :
2968 866 : constraint->skip_validation = true;
2969 866 : constraint->initially_valid = constraint->is_enforced;
2970 : }
2971 : }
2972 : }
2973 :
2974 : /*
2975 : * transformFKConstraints
2976 : * handle FOREIGN KEY constraints
2977 : */
2978 : static void
2979 64684 : transformFKConstraints(CreateStmtContext *cxt,
2980 : bool skipValidation, bool isAddConstraint)
2981 : {
2982 : ListCell *fkclist;
2983 :
2984 64684 : if (cxt->fkconstraints == NIL)
2985 60568 : return;
2986 :
2987 : /*
2988 : * If CREATE TABLE or adding a column with NULL default, we can safely
2989 : * skip validation of FK constraints, and mark them as valid based on the
2990 : * constraint enforcement flag, since NOT ENFORCED constraints must always
2991 : * be marked as NOT VALID. (This will override any user-supplied NOT VALID
2992 : * flag.)
2993 : */
2994 4116 : if (skipValidation)
2995 : {
2996 2920 : foreach(fkclist, cxt->fkconstraints)
2997 : {
2998 1494 : Constraint *constraint = (Constraint *) lfirst(fkclist);
2999 :
3000 1494 : constraint->skip_validation = true;
3001 1494 : constraint->initially_valid = constraint->is_enforced;
3002 : }
3003 : }
3004 :
3005 : /*
3006 : * For CREATE TABLE or ALTER TABLE ADD COLUMN, gin up an ALTER TABLE ADD
3007 : * CONSTRAINT command to execute after the basic command is complete. (If
3008 : * called from ADD CONSTRAINT, that routine will add the FK constraints to
3009 : * its own subcommand list.)
3010 : *
3011 : * Note: the ADD CONSTRAINT command must also execute after any index
3012 : * creation commands. Thus, this should run after
3013 : * transformIndexConstraints, so that the CREATE INDEX commands are
3014 : * already in cxt->alist. See also the handling of cxt->likeclauses.
3015 : */
3016 4116 : if (!isAddConstraint)
3017 : {
3018 1420 : AlterTableStmt *alterstmt = makeNode(AlterTableStmt);
3019 :
3020 1420 : alterstmt->relation = cxt->relation;
3021 1420 : alterstmt->cmds = NIL;
3022 1420 : alterstmt->objtype = OBJECT_TABLE;
3023 :
3024 2908 : foreach(fkclist, cxt->fkconstraints)
3025 : {
3026 1488 : Constraint *constraint = (Constraint *) lfirst(fkclist);
3027 1488 : AlterTableCmd *altercmd = makeNode(AlterTableCmd);
3028 :
3029 1488 : altercmd->subtype = AT_AddConstraint;
3030 1488 : altercmd->name = NULL;
3031 1488 : altercmd->def = (Node *) constraint;
3032 1488 : alterstmt->cmds = lappend(alterstmt->cmds, altercmd);
3033 : }
3034 :
3035 1420 : cxt->alist = lappend(cxt->alist, alterstmt);
3036 : }
3037 : }
3038 :
3039 : /*
3040 : * transformIndexStmt - parse analysis for CREATE INDEX and ALTER TABLE
3041 : *
3042 : * Note: this is a no-op for an index not using either index expressions or
3043 : * a predicate expression. There are several code paths that create indexes
3044 : * without bothering to call this, because they know they don't have any
3045 : * such expressions to deal with.
3046 : *
3047 : * To avoid race conditions, it's important that this function rely only on
3048 : * the passed-in relid (and not on stmt->relation) to determine the target
3049 : * relation.
3050 : */
3051 : IndexStmt *
3052 26812 : transformIndexStmt(Oid relid, IndexStmt *stmt, const char *queryString)
3053 : {
3054 : ParseState *pstate;
3055 : ParseNamespaceItem *nsitem;
3056 : ListCell *l;
3057 : Relation rel;
3058 :
3059 : /* Nothing to do if statement already transformed. */
3060 26812 : if (stmt->transformed)
3061 130 : return stmt;
3062 :
3063 : /* Set up pstate */
3064 26682 : pstate = make_parsestate(NULL);
3065 26682 : pstate->p_sourcetext = queryString;
3066 :
3067 : /*
3068 : * Put the parent table into the rtable so that the expressions can refer
3069 : * to its fields without qualification. Caller is responsible for locking
3070 : * relation, but we still need to open it.
3071 : */
3072 26682 : rel = relation_open(relid, NoLock);
3073 26682 : nsitem = addRangeTableEntryForRelation(pstate, rel,
3074 : AccessShareLock,
3075 : NULL, false, true);
3076 :
3077 : /* no to join list, yes to namespaces */
3078 26682 : addNSItemToQuery(pstate, nsitem, false, true, true);
3079 :
3080 : /* take care of the where clause */
3081 26682 : if (stmt->whereClause)
3082 : {
3083 406 : stmt->whereClause = transformWhereClause(pstate,
3084 : stmt->whereClause,
3085 : EXPR_KIND_INDEX_PREDICATE,
3086 : "WHERE");
3087 : /* we have to fix its collations too */
3088 406 : assign_expr_collations(pstate, stmt->whereClause);
3089 : }
3090 :
3091 : /* take care of any index expressions */
3092 63632 : foreach(l, stmt->indexParams)
3093 : {
3094 36962 : IndexElem *ielem = (IndexElem *) lfirst(l);
3095 :
3096 36962 : if (ielem->expr)
3097 : {
3098 : /* Extract preliminary index col name before transforming expr */
3099 966 : if (ielem->indexcolname == NULL)
3100 966 : ielem->indexcolname = FigureIndexColname(ielem->expr);
3101 :
3102 : /* Now do parse transformation of the expression */
3103 966 : ielem->expr = transformExpr(pstate, ielem->expr,
3104 : EXPR_KIND_INDEX_EXPRESSION);
3105 :
3106 : /* We have to fix its collations too */
3107 954 : assign_expr_collations(pstate, ielem->expr);
3108 :
3109 : /*
3110 : * transformExpr() should have already rejected subqueries,
3111 : * aggregates, window functions, and SRFs, based on the EXPR_KIND_
3112 : * for an index expression.
3113 : *
3114 : * DefineIndex() will make more checks.
3115 : */
3116 : }
3117 : }
3118 :
3119 : /*
3120 : * Check that only the base rel is mentioned. (This should be dead code
3121 : * now that add_missing_from is history.)
3122 : */
3123 26670 : if (list_length(pstate->p_rtable) != 1)
3124 0 : ereport(ERROR,
3125 : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
3126 : errmsg("index expressions and predicates can refer only to the table being indexed")));
3127 :
3128 26670 : free_parsestate(pstate);
3129 :
3130 : /* Close relation */
3131 26670 : table_close(rel, NoLock);
3132 :
3133 : /* Mark statement as successfully transformed */
3134 26670 : stmt->transformed = true;
3135 :
3136 26670 : return stmt;
3137 : }
3138 :
3139 : /*
3140 : * transformStatsStmt - parse analysis for CREATE STATISTICS
3141 : *
3142 : * To avoid race conditions, it's important that this function relies only on
3143 : * the passed-in relid (and not on stmt->relation) to determine the target
3144 : * relation.
3145 : */
3146 : CreateStatsStmt *
3147 874 : transformStatsStmt(Oid relid, CreateStatsStmt *stmt, const char *queryString)
3148 : {
3149 : ParseState *pstate;
3150 : ParseNamespaceItem *nsitem;
3151 : ListCell *l;
3152 : Relation rel;
3153 :
3154 : /* Nothing to do if statement already transformed. */
3155 874 : if (stmt->transformed)
3156 48 : return stmt;
3157 :
3158 : /* Set up pstate */
3159 826 : pstate = make_parsestate(NULL);
3160 826 : pstate->p_sourcetext = queryString;
3161 :
3162 : /*
3163 : * Put the parent table into the rtable so that the expressions can refer
3164 : * to its fields without qualification. Caller is responsible for locking
3165 : * relation, but we still need to open it.
3166 : */
3167 826 : rel = relation_open(relid, NoLock);
3168 826 : nsitem = addRangeTableEntryForRelation(pstate, rel,
3169 : AccessShareLock,
3170 : NULL, false, true);
3171 :
3172 : /* no to join list, yes to namespaces */
3173 826 : addNSItemToQuery(pstate, nsitem, false, true, true);
3174 :
3175 : /* take care of any expressions */
3176 2840 : foreach(l, stmt->exprs)
3177 : {
3178 2014 : StatsElem *selem = (StatsElem *) lfirst(l);
3179 :
3180 2014 : if (selem->expr)
3181 : {
3182 : /* Now do parse transformation of the expression */
3183 510 : selem->expr = transformExpr(pstate, selem->expr,
3184 : EXPR_KIND_STATS_EXPRESSION);
3185 :
3186 : /* We have to fix its collations too */
3187 510 : assign_expr_collations(pstate, selem->expr);
3188 : }
3189 : }
3190 :
3191 : /*
3192 : * Check that only the base rel is mentioned. (This should be dead code
3193 : * now that add_missing_from is history.)
3194 : */
3195 826 : if (list_length(pstate->p_rtable) != 1)
3196 0 : ereport(ERROR,
3197 : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
3198 : errmsg("statistics expressions can refer only to the table being referenced")));
3199 :
3200 826 : free_parsestate(pstate);
3201 :
3202 : /* Close relation */
3203 826 : table_close(rel, NoLock);
3204 :
3205 : /* Mark statement as successfully transformed */
3206 826 : stmt->transformed = true;
3207 :
3208 826 : return stmt;
3209 : }
3210 :
3211 :
3212 : /*
3213 : * transformRuleStmt -
3214 : * transform a CREATE RULE Statement. The action is a list of parse
3215 : * trees which is transformed into a list of query trees, and we also
3216 : * transform the WHERE clause if any.
3217 : *
3218 : * actions and whereClause are output parameters that receive the
3219 : * transformed results.
3220 : */
3221 : void
3222 1102 : transformRuleStmt(RuleStmt *stmt, const char *queryString,
3223 : List **actions, Node **whereClause)
3224 : {
3225 : Relation rel;
3226 : ParseState *pstate;
3227 : ParseNamespaceItem *oldnsitem;
3228 : ParseNamespaceItem *newnsitem;
3229 :
3230 : /*
3231 : * To avoid deadlock, make sure the first thing we do is grab
3232 : * AccessExclusiveLock on the target relation. This will be needed by
3233 : * DefineQueryRewrite(), and we don't want to grab a lesser lock
3234 : * beforehand.
3235 : */
3236 1102 : rel = table_openrv(stmt->relation, AccessExclusiveLock);
3237 :
3238 1102 : if (rel->rd_rel->relkind == RELKIND_MATVIEW)
3239 0 : ereport(ERROR,
3240 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3241 : errmsg("rules on materialized views are not supported")));
3242 :
3243 : /* Set up pstate */
3244 1102 : pstate = make_parsestate(NULL);
3245 1102 : pstate->p_sourcetext = queryString;
3246 :
3247 : /*
3248 : * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
3249 : * Set up their ParseNamespaceItems in the main pstate for use in parsing
3250 : * the rule qualification.
3251 : */
3252 1102 : oldnsitem = addRangeTableEntryForRelation(pstate, rel,
3253 : AccessShareLock,
3254 : makeAlias("old", NIL),
3255 : false, false);
3256 1102 : newnsitem = addRangeTableEntryForRelation(pstate, rel,
3257 : AccessShareLock,
3258 : makeAlias("new", NIL),
3259 : false, false);
3260 :
3261 : /*
3262 : * They must be in the namespace too for lookup purposes, but only add the
3263 : * one(s) that are relevant for the current kind of rule. In an UPDATE
3264 : * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
3265 : * there's no need to be so picky for INSERT & DELETE. We do not add them
3266 : * to the joinlist.
3267 : */
3268 1102 : switch (stmt->event)
3269 : {
3270 18 : case CMD_SELECT:
3271 18 : addNSItemToQuery(pstate, oldnsitem, false, true, true);
3272 18 : break;
3273 436 : case CMD_UPDATE:
3274 436 : addNSItemToQuery(pstate, oldnsitem, false, true, true);
3275 436 : addNSItemToQuery(pstate, newnsitem, false, true, true);
3276 436 : break;
3277 484 : case CMD_INSERT:
3278 484 : addNSItemToQuery(pstate, newnsitem, false, true, true);
3279 484 : break;
3280 164 : case CMD_DELETE:
3281 164 : addNSItemToQuery(pstate, oldnsitem, false, true, true);
3282 164 : break;
3283 0 : default:
3284 0 : elog(ERROR, "unrecognized event type: %d",
3285 : (int) stmt->event);
3286 : break;
3287 : }
3288 :
3289 : /* take care of the where clause */
3290 1102 : *whereClause = transformWhereClause(pstate,
3291 : stmt->whereClause,
3292 : EXPR_KIND_WHERE,
3293 : "WHERE");
3294 : /* we have to fix its collations too */
3295 1102 : assign_expr_collations(pstate, *whereClause);
3296 :
3297 : /* this is probably dead code without add_missing_from: */
3298 1102 : if (list_length(pstate->p_rtable) != 2) /* naughty, naughty... */
3299 0 : ereport(ERROR,
3300 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3301 : errmsg("rule WHERE condition cannot contain references to other relations")));
3302 :
3303 : /*
3304 : * 'instead nothing' rules with a qualification need a query rangetable so
3305 : * the rewrite handler can add the negated rule qualification to the
3306 : * original query. We create a query with the new command type CMD_NOTHING
3307 : * here that is treated specially by the rewrite system.
3308 : */
3309 1102 : if (stmt->actions == NIL)
3310 : {
3311 164 : Query *nothing_qry = makeNode(Query);
3312 :
3313 164 : nothing_qry->commandType = CMD_NOTHING;
3314 164 : nothing_qry->rtable = pstate->p_rtable;
3315 164 : nothing_qry->rteperminfos = pstate->p_rteperminfos;
3316 164 : nothing_qry->jointree = makeFromExpr(NIL, NULL); /* no join wanted */
3317 :
3318 164 : *actions = list_make1(nothing_qry);
3319 : }
3320 : else
3321 : {
3322 : ListCell *l;
3323 938 : List *newactions = NIL;
3324 :
3325 : /*
3326 : * transform each statement, like parse_sub_analyze()
3327 : */
3328 1904 : foreach(l, stmt->actions)
3329 : {
3330 984 : Node *action = (Node *) lfirst(l);
3331 984 : ParseState *sub_pstate = make_parsestate(NULL);
3332 : Query *sub_qry,
3333 : *top_subqry;
3334 : bool has_old,
3335 : has_new;
3336 :
3337 : /*
3338 : * Since outer ParseState isn't parent of inner, have to pass down
3339 : * the query text by hand.
3340 : */
3341 984 : sub_pstate->p_sourcetext = queryString;
3342 :
3343 : /*
3344 : * Set up OLD/NEW in the rtable for this statement. The entries
3345 : * are added only to relnamespace, not varnamespace, because we
3346 : * don't want them to be referred to by unqualified field names
3347 : * nor "*" in the rule actions. We decide later whether to put
3348 : * them in the joinlist.
3349 : */
3350 984 : oldnsitem = addRangeTableEntryForRelation(sub_pstate, rel,
3351 : AccessShareLock,
3352 : makeAlias("old", NIL),
3353 : false, false);
3354 984 : newnsitem = addRangeTableEntryForRelation(sub_pstate, rel,
3355 : AccessShareLock,
3356 : makeAlias("new", NIL),
3357 : false, false);
3358 984 : addNSItemToQuery(sub_pstate, oldnsitem, false, true, false);
3359 984 : addNSItemToQuery(sub_pstate, newnsitem, false, true, false);
3360 :
3361 : /* Transform the rule action statement */
3362 984 : top_subqry = transformStmt(sub_pstate, action);
3363 :
3364 : /*
3365 : * We cannot support utility-statement actions (eg NOTIFY) with
3366 : * nonempty rule WHERE conditions, because there's no way to make
3367 : * the utility action execute conditionally.
3368 : */
3369 972 : if (top_subqry->commandType == CMD_UTILITY &&
3370 40 : *whereClause != NULL)
3371 0 : ereport(ERROR,
3372 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3373 : errmsg("rules with WHERE conditions can only have SELECT, INSERT, UPDATE, or DELETE actions")));
3374 :
3375 : /*
3376 : * If the action is INSERT...SELECT, OLD/NEW have been pushed down
3377 : * into the SELECT, and that's what we need to look at. (Ugly
3378 : * kluge ... try to fix this when we redesign querytrees.)
3379 : */
3380 972 : sub_qry = getInsertSelectQuery(top_subqry, NULL);
3381 :
3382 : /*
3383 : * If the sub_qry is a setop, we cannot attach any qualifications
3384 : * to it, because the planner won't notice them. This could
3385 : * perhaps be relaxed someday, but for now, we may as well reject
3386 : * such a rule immediately.
3387 : */
3388 972 : if (sub_qry->setOperations != NULL && *whereClause != NULL)
3389 0 : ereport(ERROR,
3390 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3391 : errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
3392 :
3393 : /*
3394 : * Validate action's use of OLD/NEW, qual too
3395 : */
3396 972 : has_old =
3397 1554 : rangeTableEntry_used((Node *) sub_qry, PRS2_OLD_VARNO, 0) ||
3398 582 : rangeTableEntry_used(*whereClause, PRS2_OLD_VARNO, 0);
3399 972 : has_new =
3400 1300 : rangeTableEntry_used((Node *) sub_qry, PRS2_NEW_VARNO, 0) ||
3401 328 : rangeTableEntry_used(*whereClause, PRS2_NEW_VARNO, 0);
3402 :
3403 972 : switch (stmt->event)
3404 : {
3405 18 : case CMD_SELECT:
3406 18 : if (has_old)
3407 0 : ereport(ERROR,
3408 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3409 : errmsg("ON SELECT rule cannot use OLD")));
3410 18 : if (has_new)
3411 0 : ereport(ERROR,
3412 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3413 : errmsg("ON SELECT rule cannot use NEW")));
3414 18 : break;
3415 346 : case CMD_UPDATE:
3416 : /* both are OK */
3417 346 : break;
3418 440 : case CMD_INSERT:
3419 440 : if (has_old)
3420 0 : ereport(ERROR,
3421 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3422 : errmsg("ON INSERT rule cannot use OLD")));
3423 440 : break;
3424 168 : case CMD_DELETE:
3425 168 : if (has_new)
3426 0 : ereport(ERROR,
3427 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3428 : errmsg("ON DELETE rule cannot use NEW")));
3429 168 : break;
3430 0 : default:
3431 0 : elog(ERROR, "unrecognized event type: %d",
3432 : (int) stmt->event);
3433 : break;
3434 : }
3435 :
3436 : /*
3437 : * OLD/NEW are not allowed in WITH queries, because they would
3438 : * amount to outer references for the WITH, which we disallow.
3439 : * However, they were already in the outer rangetable when we
3440 : * analyzed the query, so we have to check.
3441 : *
3442 : * Note that in the INSERT...SELECT case, we need to examine the
3443 : * CTE lists of both top_subqry and sub_qry.
3444 : *
3445 : * Note that we aren't digging into the body of the query looking
3446 : * for WITHs in nested sub-SELECTs. A WITH down there can
3447 : * legitimately refer to OLD/NEW, because it'd be an
3448 : * indirect-correlated outer reference.
3449 : */
3450 972 : if (rangeTableEntry_used((Node *) top_subqry->cteList,
3451 966 : PRS2_OLD_VARNO, 0) ||
3452 966 : rangeTableEntry_used((Node *) sub_qry->cteList,
3453 : PRS2_OLD_VARNO, 0))
3454 6 : ereport(ERROR,
3455 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3456 : errmsg("cannot refer to OLD within WITH query")));
3457 966 : if (rangeTableEntry_used((Node *) top_subqry->cteList,
3458 966 : PRS2_NEW_VARNO, 0) ||
3459 966 : rangeTableEntry_used((Node *) sub_qry->cteList,
3460 : PRS2_NEW_VARNO, 0))
3461 0 : ereport(ERROR,
3462 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3463 : errmsg("cannot refer to NEW within WITH query")));
3464 :
3465 : /*
3466 : * For efficiency's sake, add OLD to the rule action's jointree
3467 : * only if it was actually referenced in the statement or qual.
3468 : *
3469 : * For INSERT, NEW is not really a relation (only a reference to
3470 : * the to-be-inserted tuple) and should never be added to the
3471 : * jointree.
3472 : *
3473 : * For UPDATE, we treat NEW as being another kind of reference to
3474 : * OLD, because it represents references to *transformed* tuples
3475 : * of the existing relation. It would be wrong to enter NEW
3476 : * separately in the jointree, since that would cause a double
3477 : * join of the updated relation. It's also wrong to fail to make
3478 : * a jointree entry if only NEW and not OLD is mentioned.
3479 : */
3480 966 : if (has_old || (has_new && stmt->event == CMD_UPDATE))
3481 : {
3482 : RangeTblRef *rtr;
3483 :
3484 : /*
3485 : * If sub_qry is a setop, manipulating its jointree will do no
3486 : * good at all, because the jointree is dummy. (This should be
3487 : * a can't-happen case because of prior tests.)
3488 : */
3489 432 : if (sub_qry->setOperations != NULL)
3490 0 : ereport(ERROR,
3491 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3492 : errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
3493 : /* hackishly add OLD to the already-built FROM clause */
3494 432 : rtr = makeNode(RangeTblRef);
3495 432 : rtr->rtindex = oldnsitem->p_rtindex;
3496 432 : sub_qry->jointree->fromlist =
3497 432 : lappend(sub_qry->jointree->fromlist, rtr);
3498 : }
3499 :
3500 966 : newactions = lappend(newactions, top_subqry);
3501 :
3502 966 : free_parsestate(sub_pstate);
3503 : }
3504 :
3505 920 : *actions = newactions;
3506 : }
3507 :
3508 1084 : free_parsestate(pstate);
3509 :
3510 : /* Close relation, but keep the exclusive lock */
3511 1084 : table_close(rel, NoLock);
3512 1084 : }
3513 :
3514 :
3515 : /*
3516 : * checkPartition
3517 : * Check whether partRelOid is a leaf partition of the parent table (rel).
3518 : * isMerge: true indicates the operation is "ALTER TABLE ... MERGE PARTITIONS";
3519 : * false indicates the operation is "ALTER TABLE ... SPLIT PARTITION".
3520 : */
3521 : static void
3522 888 : checkPartition(Relation rel, Oid partRelOid, bool isMerge)
3523 : {
3524 : Relation partRel;
3525 :
3526 888 : partRel = table_open(partRelOid, NoLock);
3527 :
3528 888 : if (partRel->rd_rel->relkind != RELKIND_RELATION)
3529 6 : ereport(ERROR,
3530 : errcode(ERRCODE_WRONG_OBJECT_TYPE),
3531 : errmsg("\"%s\" is not a table", RelationGetRelationName(partRel)),
3532 : isMerge
3533 : ? errhint("ALTER TABLE ... MERGE PARTITIONS can only merge partitions don't have sub-partitions")
3534 : : errhint("ALTER TABLE ... SPLIT PARTITION can only split partitions don't have sub-partitions"));
3535 :
3536 882 : if (!partRel->rd_rel->relispartition)
3537 18 : ereport(ERROR,
3538 : errcode(ERRCODE_WRONG_OBJECT_TYPE),
3539 : errmsg("\"%s\" is not a partition of partitioned table \"%s\"",
3540 : RelationGetRelationName(partRel), RelationGetRelationName(rel)),
3541 : isMerge
3542 : ? errhint("ALTER TABLE ... MERGE PARTITIONS can only merge partitions don't have sub-partitions")
3543 : : errhint("ALTER TABLE ... SPLIT PARTITION can only split partitions don't have sub-partitions"));
3544 :
3545 864 : if (get_partition_parent(partRelOid, false) != RelationGetRelid(rel))
3546 18 : ereport(ERROR,
3547 : errcode(ERRCODE_UNDEFINED_TABLE),
3548 : errmsg("relation \"%s\" is not a partition of relation \"%s\"",
3549 : RelationGetRelationName(partRel), RelationGetRelationName(rel)),
3550 : isMerge
3551 : ? errhint("ALTER TABLE ... MERGE PARTITIONS can only merge partitions don't have sub-partitions")
3552 : : errhint("ALTER TABLE ... SPLIT PARTITION can only split partitions don't have sub-partitions"));
3553 :
3554 846 : table_close(partRel, NoLock);
3555 846 : }
3556 :
3557 : /*
3558 : * transformPartitionCmdForSplit -
3559 : * analyze the ALTER TABLE ... SPLIT PARTITION command
3560 : *
3561 : * For each new partition, sps->bound is set to the transformed value of bound.
3562 : * Does checks for bounds of new partitions.
3563 : */
3564 : static void
3565 366 : transformPartitionCmdForSplit(CreateStmtContext *cxt, PartitionCmd *partcmd)
3566 : {
3567 366 : Relation parent = cxt->rel;
3568 : PartitionKey key;
3569 : char strategy;
3570 : Oid splitPartOid;
3571 : Oid defaultPartOid;
3572 366 : int default_index = -1;
3573 : bool isSplitPartDefault;
3574 : ListCell *listptr,
3575 : *listptr2;
3576 : List *splitlist;
3577 :
3578 366 : splitlist = partcmd->partlist;
3579 366 : key = RelationGetPartitionKey(parent);
3580 366 : strategy = get_partition_strategy(key);
3581 366 : defaultPartOid = get_default_oid_from_partdesc(RelationGetPartitionDesc(parent, true));
3582 :
3583 : /* Transform partition bounds for all partitions in the list: */
3584 1770 : foreach_node(SinglePartitionSpec, sps, splitlist)
3585 : {
3586 1050 : cxt->partbound = NULL;
3587 1050 : transformPartitionCmd(cxt, sps->bound);
3588 : /* Assign the transformed value of the partition bound. */
3589 1044 : sps->bound = cxt->partbound;
3590 : }
3591 :
3592 : /*
3593 : * Open and lock the partition, check ownership along the way. We need to
3594 : * use AccessExclusiveLock here because this split partition will be
3595 : * detached, then dropped in ATExecSplitPartition.
3596 : */
3597 360 : splitPartOid = RangeVarGetRelidExtended(partcmd->name, AccessExclusiveLock,
3598 : 0, RangeVarCallbackOwnsRelation,
3599 : NULL);
3600 :
3601 348 : checkPartition(parent, splitPartOid, false);
3602 :
3603 342 : switch (strategy)
3604 : {
3605 336 : case PARTITION_STRATEGY_LIST:
3606 : case PARTITION_STRATEGY_RANGE:
3607 : {
3608 1650 : foreach_node(SinglePartitionSpec, sps, splitlist)
3609 : {
3610 990 : if (sps->bound->is_default)
3611 : {
3612 84 : if (default_index != -1)
3613 6 : ereport(ERROR,
3614 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3615 : errmsg("DEFAULT partition should be one"),
3616 : parser_errposition(cxt->pstate, sps->name->location));
3617 :
3618 78 : default_index = foreach_current_index(sps);
3619 : }
3620 : }
3621 : }
3622 330 : break;
3623 :
3624 6 : case PARTITION_STRATEGY_HASH:
3625 6 : ereport(ERROR,
3626 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3627 : errmsg("partition of hash-partitioned table cannot be split"));
3628 : break;
3629 :
3630 0 : default:
3631 0 : elog(ERROR, "unexpected partition strategy: %d",
3632 : (int) key->strategy);
3633 : break;
3634 : }
3635 :
3636 : /* isSplitPartDefault: is the being split partition a DEFAULT partition? */
3637 330 : isSplitPartDefault = (defaultPartOid == splitPartOid);
3638 :
3639 330 : if (isSplitPartDefault && default_index == -1)
3640 6 : ereport(ERROR,
3641 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3642 : errmsg("can not split DEFAULT partition \"%s\"",
3643 : get_rel_name(splitPartOid)),
3644 : errhint("To split DEFAULT partition one of the new partition msut be DEFAULT"),
3645 : parser_errposition(cxt->pstate, ((SinglePartitionSpec *) linitial(splitlist))->name->location));
3646 :
3647 : /*
3648 : * If the partition being split is not the DEFAULT partition, but the
3649 : * DEFAULT partition exists, then none of the resulting split partitions
3650 : * can be the DEFAULT.
3651 : */
3652 324 : if (!isSplitPartDefault && (default_index != -1) && OidIsValid(defaultPartOid))
3653 : {
3654 : SinglePartitionSpec *spsDef =
3655 6 : (SinglePartitionSpec *) list_nth(splitlist, default_index);
3656 :
3657 6 : ereport(ERROR,
3658 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3659 : errmsg("can not split non-DEFAULT partition \"%s\"",
3660 : get_rel_name(splitPartOid)),
3661 : errmsg("new partition cannot be DEFAULT because DEFAULT partition \"%s\" already exists",
3662 : get_rel_name(defaultPartOid)),
3663 : parser_errposition(cxt->pstate, spsDef->name->location));
3664 : }
3665 :
3666 1182 : foreach(listptr, splitlist)
3667 : {
3668 : Oid nspid;
3669 882 : SinglePartitionSpec *sps = (SinglePartitionSpec *) lfirst(listptr);
3670 882 : RangeVar *name = sps->name;
3671 :
3672 882 : nspid = RangeVarGetCreationNamespace(sps->name);
3673 :
3674 : /* Partitions in the list should have different names. */
3675 1788 : for_each_cell(listptr2, splitlist, lnext(splitlist, listptr))
3676 : {
3677 : Oid nspid2;
3678 924 : SinglePartitionSpec *sps2 = (SinglePartitionSpec *) lfirst(listptr2);
3679 924 : RangeVar *name2 = sps2->name;
3680 :
3681 924 : if (equal(name, name2))
3682 12 : ereport(ERROR,
3683 : errcode(ERRCODE_DUPLICATE_TABLE),
3684 : errmsg("partition with name \"%s\" is already used", name->relname),
3685 : parser_errposition(cxt->pstate, name2->location));
3686 :
3687 912 : nspid2 = RangeVarGetCreationNamespace(sps2->name);
3688 :
3689 912 : if (nspid2 == nspid && strcmp(name->relname, name2->relname) == 0)
3690 6 : ereport(ERROR,
3691 : errcode(ERRCODE_DUPLICATE_TABLE),
3692 : errmsg("partition with name \"%s\" is already used", name->relname),
3693 : parser_errposition(cxt->pstate, name2->location));
3694 : }
3695 : }
3696 :
3697 : /* Then we should check partitions with transformed bounds. */
3698 300 : check_partitions_for_split(parent, splitPartOid, splitlist, cxt->pstate);
3699 198 : }
3700 :
3701 :
3702 : /*
3703 : * transformPartitionCmdForMerge -
3704 : * analyze the ALTER TABLE ... MERGE PARTITIONS command
3705 : *
3706 : * Does simple checks for merged partitions. Calculates bound of the resulting
3707 : * partition.
3708 : */
3709 : static void
3710 258 : transformPartitionCmdForMerge(CreateStmtContext *cxt, PartitionCmd *partcmd)
3711 : {
3712 : Oid defaultPartOid;
3713 : Oid partOid;
3714 258 : Relation parent = cxt->rel;
3715 : PartitionKey key;
3716 : char strategy;
3717 : ListCell *listptr,
3718 : *listptr2;
3719 258 : bool isDefaultPart = false;
3720 258 : List *partOids = NIL;
3721 :
3722 258 : key = RelationGetPartitionKey(parent);
3723 258 : strategy = get_partition_strategy(key);
3724 :
3725 258 : if (strategy == PARTITION_STRATEGY_HASH)
3726 6 : ereport(ERROR,
3727 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3728 : errmsg("partition of hash-partitioned table cannot be merged"));
3729 :
3730 : /* Does the partitioned table (parent) have a default partition? */
3731 252 : defaultPartOid = get_default_oid_from_partdesc(RelationGetPartitionDesc(parent, true));
3732 :
3733 756 : foreach(listptr, partcmd->partlist)
3734 : {
3735 564 : RangeVar *name = (RangeVar *) lfirst(listptr);
3736 :
3737 : /* Partitions in the list should have different names. */
3738 984 : for_each_cell(listptr2, partcmd->partlist, lnext(partcmd->partlist, listptr))
3739 : {
3740 426 : RangeVar *name2 = (RangeVar *) lfirst(listptr2);
3741 :
3742 426 : if (equal(name, name2))
3743 6 : ereport(ERROR,
3744 : errcode(ERRCODE_DUPLICATE_TABLE),
3745 : errmsg("partition with name \"%s\" is already used", name->relname),
3746 : parser_errposition(cxt->pstate, name2->location));
3747 : }
3748 :
3749 : /*
3750 : * Search the DEFAULT partition in the list. Open and lock partitions
3751 : * before calculating the boundary for resulting partition, we also
3752 : * check for ownership along the way. We need to use
3753 : * AccessExclusiveLock here, because these merged partitions will be
3754 : * detached and then dropped in ATExecMergePartitions.
3755 : */
3756 558 : partOid = RangeVarGetRelidExtended(name, AccessExclusiveLock, 0,
3757 : RangeVarCallbackOwnsRelation,
3758 : NULL);
3759 : /* Is the current partition a DEFAULT partition? */
3760 546 : if (partOid == defaultPartOid)
3761 6 : isDefaultPart = true;
3762 :
3763 : /*
3764 : * Extended check because the same partition can have different names
3765 : * (for example, "part_name" and "public.part_name").
3766 : */
3767 918 : foreach(listptr2, partOids)
3768 : {
3769 378 : Oid curOid = lfirst_oid(listptr2);
3770 :
3771 378 : if (curOid == partOid)
3772 6 : ereport(ERROR,
3773 : errcode(ERRCODE_DUPLICATE_TABLE),
3774 : errmsg("partition with name \"%s\" is already used", name->relname),
3775 : parser_errposition(cxt->pstate, name->location));
3776 : }
3777 :
3778 540 : checkPartition(parent, partOid, true);
3779 :
3780 504 : partOids = lappend_oid(partOids, partOid);
3781 : }
3782 :
3783 : /* Allocate the bound of the resulting partition. */
3784 : Assert(partcmd->bound == NULL);
3785 192 : partcmd->bound = makeNode(PartitionBoundSpec);
3786 :
3787 : /* Fill the partition bound. */
3788 192 : partcmd->bound->strategy = strategy;
3789 192 : partcmd->bound->location = -1;
3790 192 : partcmd->bound->is_default = isDefaultPart;
3791 192 : if (!isDefaultPart)
3792 186 : calculate_partition_bound_for_merge(parent, partcmd->partlist,
3793 : partOids, partcmd->bound,
3794 : cxt->pstate);
3795 180 : }
3796 :
3797 : /*
3798 : * transformAlterTableStmt -
3799 : * parse analysis for ALTER TABLE
3800 : *
3801 : * Returns the transformed AlterTableStmt. There may be additional actions
3802 : * to be done before and after the transformed statement, which are returned
3803 : * in *beforeStmts and *afterStmts as lists of utility command parsetrees.
3804 : *
3805 : * To avoid race conditions, it's important that this function rely only on
3806 : * the passed-in relid (and not on stmt->relation) to determine the target
3807 : * relation.
3808 : */
3809 : AlterTableStmt *
3810 24838 : transformAlterTableStmt(Oid relid, AlterTableStmt *stmt,
3811 : const char *queryString,
3812 : List **beforeStmts, List **afterStmts)
3813 : {
3814 : Relation rel;
3815 : TupleDesc tupdesc;
3816 : ParseState *pstate;
3817 : CreateStmtContext cxt;
3818 : List *save_alist;
3819 : ListCell *lcmd,
3820 : *l;
3821 24838 : List *newcmds = NIL;
3822 24838 : bool skipValidation = true;
3823 : AlterTableCmd *newcmd;
3824 : ParseNamespaceItem *nsitem;
3825 :
3826 : /* Caller is responsible for locking the relation */
3827 24838 : rel = relation_open(relid, NoLock);
3828 24838 : tupdesc = RelationGetDescr(rel);
3829 :
3830 : /* Set up pstate */
3831 24838 : pstate = make_parsestate(NULL);
3832 24838 : pstate->p_sourcetext = queryString;
3833 24838 : nsitem = addRangeTableEntryForRelation(pstate,
3834 : rel,
3835 : AccessShareLock,
3836 : NULL,
3837 : false,
3838 : true);
3839 24838 : addNSItemToQuery(pstate, nsitem, false, true, true);
3840 :
3841 : /* Set up CreateStmtContext */
3842 24838 : cxt.pstate = pstate;
3843 24838 : if (rel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
3844 : {
3845 180 : cxt.stmtType = "ALTER FOREIGN TABLE";
3846 180 : cxt.isforeign = true;
3847 : }
3848 : else
3849 : {
3850 24658 : cxt.stmtType = "ALTER TABLE";
3851 24658 : cxt.isforeign = false;
3852 : }
3853 24838 : cxt.relation = stmt->relation;
3854 24838 : cxt.rel = rel;
3855 24838 : cxt.inhRelations = NIL;
3856 24838 : cxt.isalter = true;
3857 24838 : cxt.columns = NIL;
3858 24838 : cxt.ckconstraints = NIL;
3859 24838 : cxt.nnconstraints = NIL;
3860 24838 : cxt.fkconstraints = NIL;
3861 24838 : cxt.ixconstraints = NIL;
3862 24838 : cxt.likeclauses = NIL;
3863 24838 : cxt.blist = NIL;
3864 24838 : cxt.alist = NIL;
3865 24838 : cxt.pkey = NULL;
3866 24838 : cxt.ispartitioned = (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
3867 24838 : cxt.partbound = NULL;
3868 24838 : cxt.ofType = false;
3869 :
3870 : /*
3871 : * Transform ALTER subcommands that need it (most don't). These largely
3872 : * re-use code from CREATE TABLE.
3873 : */
3874 49370 : foreach(lcmd, stmt->cmds)
3875 : {
3876 24838 : AlterTableCmd *cmd = (AlterTableCmd *) lfirst(lcmd);
3877 :
3878 24838 : switch (cmd->subtype)
3879 : {
3880 2076 : case AT_AddColumn:
3881 : {
3882 2076 : ColumnDef *def = castNode(ColumnDef, cmd->def);
3883 :
3884 2076 : transformColumnDefinition(&cxt, def);
3885 :
3886 : /*
3887 : * If the column has a non-null default, we can't skip
3888 : * validation of foreign keys.
3889 : */
3890 2070 : if (def->raw_default != NULL)
3891 858 : skipValidation = false;
3892 :
3893 : /*
3894 : * All constraints are processed in other ways. Remove the
3895 : * original list
3896 : */
3897 2070 : def->constraints = NIL;
3898 :
3899 2070 : newcmds = lappend(newcmds, cmd);
3900 2070 : break;
3901 : }
3902 :
3903 16938 : case AT_AddConstraint:
3904 :
3905 : /*
3906 : * The original AddConstraint cmd node doesn't go to newcmds
3907 : */
3908 16938 : if (IsA(cmd->def, Constraint))
3909 : {
3910 16938 : transformTableConstraint(&cxt, (Constraint *) cmd->def);
3911 16932 : if (((Constraint *) cmd->def)->contype == CONSTR_FOREIGN)
3912 2690 : skipValidation = false;
3913 : }
3914 : else
3915 0 : elog(ERROR, "unrecognized node type: %d",
3916 : (int) nodeTag(cmd->def));
3917 16932 : break;
3918 :
3919 1432 : case AT_AlterColumnType:
3920 : {
3921 1432 : ColumnDef *def = castNode(ColumnDef, cmd->def);
3922 : AttrNumber attnum;
3923 :
3924 : /*
3925 : * For ALTER COLUMN TYPE, transform the USING clause if
3926 : * one was specified.
3927 : */
3928 1432 : if (def->raw_default)
3929 : {
3930 252 : def->cooked_default =
3931 252 : transformExpr(pstate, def->raw_default,
3932 : EXPR_KIND_ALTER_COL_TRANSFORM);
3933 : }
3934 :
3935 : /*
3936 : * For identity column, create ALTER SEQUENCE command to
3937 : * change the data type of the sequence. Identity sequence
3938 : * is associated with the top level partitioned table.
3939 : * Hence ignore partitions.
3940 : */
3941 1432 : if (!RelationGetForm(rel)->relispartition)
3942 : {
3943 1330 : attnum = get_attnum(relid, cmd->name);
3944 1330 : if (attnum == InvalidAttrNumber)
3945 0 : ereport(ERROR,
3946 : (errcode(ERRCODE_UNDEFINED_COLUMN),
3947 : errmsg("column \"%s\" of relation \"%s\" does not exist",
3948 : cmd->name, RelationGetRelationName(rel))));
3949 :
3950 1330 : if (attnum > 0 &&
3951 1324 : TupleDescAttr(tupdesc, attnum - 1)->attidentity)
3952 : {
3953 36 : Oid seq_relid = getIdentitySequence(rel, attnum, false);
3954 36 : Oid typeOid = typenameTypeId(pstate, def->typeName);
3955 36 : AlterSeqStmt *altseqstmt = makeNode(AlterSeqStmt);
3956 :
3957 : altseqstmt->sequence
3958 36 : = makeRangeVar(get_namespace_name(get_rel_namespace(seq_relid)),
3959 : get_rel_name(seq_relid),
3960 : -1);
3961 36 : altseqstmt->options = list_make1(makeDefElem("as",
3962 : (Node *) makeTypeNameFromOid(typeOid, -1),
3963 : -1));
3964 36 : altseqstmt->for_identity = true;
3965 36 : cxt.blist = lappend(cxt.blist, altseqstmt);
3966 : }
3967 : }
3968 :
3969 1432 : newcmds = lappend(newcmds, cmd);
3970 1432 : break;
3971 : }
3972 :
3973 172 : case AT_AddIdentity:
3974 : {
3975 172 : Constraint *def = castNode(Constraint, cmd->def);
3976 172 : ColumnDef *newdef = makeNode(ColumnDef);
3977 : AttrNumber attnum;
3978 :
3979 172 : newdef->colname = cmd->name;
3980 172 : newdef->identity = def->generated_when;
3981 172 : cmd->def = (Node *) newdef;
3982 :
3983 172 : attnum = get_attnum(relid, cmd->name);
3984 172 : if (attnum == InvalidAttrNumber)
3985 6 : ereport(ERROR,
3986 : (errcode(ERRCODE_UNDEFINED_COLUMN),
3987 : errmsg("column \"%s\" of relation \"%s\" does not exist",
3988 : cmd->name, RelationGetRelationName(rel))));
3989 :
3990 166 : generateSerialExtraStmts(&cxt, newdef,
3991 : get_atttype(relid, attnum),
3992 : def->options, true, true,
3993 : NULL, NULL);
3994 :
3995 166 : newcmds = lappend(newcmds, cmd);
3996 166 : break;
3997 : }
3998 :
3999 62 : case AT_SetIdentity:
4000 : {
4001 : /*
4002 : * Create an ALTER SEQUENCE statement for the internal
4003 : * sequence of the identity column.
4004 : */
4005 : ListCell *lc;
4006 62 : List *newseqopts = NIL;
4007 62 : List *newdef = NIL;
4008 : AttrNumber attnum;
4009 : Oid seq_relid;
4010 :
4011 : /*
4012 : * Split options into those handled by ALTER SEQUENCE and
4013 : * those for ALTER TABLE proper.
4014 : */
4015 184 : foreach(lc, castNode(List, cmd->def))
4016 : {
4017 122 : DefElem *def = lfirst_node(DefElem, lc);
4018 :
4019 122 : if (strcmp(def->defname, "generated") == 0)
4020 44 : newdef = lappend(newdef, def);
4021 : else
4022 78 : newseqopts = lappend(newseqopts, def);
4023 : }
4024 :
4025 62 : attnum = get_attnum(relid, cmd->name);
4026 62 : if (attnum == InvalidAttrNumber)
4027 0 : ereport(ERROR,
4028 : (errcode(ERRCODE_UNDEFINED_COLUMN),
4029 : errmsg("column \"%s\" of relation \"%s\" does not exist",
4030 : cmd->name, RelationGetRelationName(rel))));
4031 :
4032 62 : seq_relid = getIdentitySequence(rel, attnum, true);
4033 :
4034 62 : if (seq_relid)
4035 : {
4036 : AlterSeqStmt *seqstmt;
4037 :
4038 50 : seqstmt = makeNode(AlterSeqStmt);
4039 50 : seqstmt->sequence = makeRangeVar(get_namespace_name(get_rel_namespace(seq_relid)),
4040 : get_rel_name(seq_relid), -1);
4041 50 : seqstmt->options = newseqopts;
4042 50 : seqstmt->for_identity = true;
4043 50 : seqstmt->missing_ok = false;
4044 :
4045 50 : cxt.blist = lappend(cxt.blist, seqstmt);
4046 : }
4047 :
4048 : /*
4049 : * If column was not an identity column, we just let the
4050 : * ALTER TABLE command error out later. (There are cases
4051 : * this fails to cover, but we'll need to restructure
4052 : * where creation of the sequence dependency linkage
4053 : * happens before we can fix it.)
4054 : */
4055 :
4056 62 : cmd->def = (Node *) newdef;
4057 62 : newcmds = lappend(newcmds, cmd);
4058 62 : break;
4059 : }
4060 :
4061 3516 : case AT_AttachPartition:
4062 : case AT_DetachPartition:
4063 : {
4064 3516 : PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
4065 :
4066 3516 : transformPartitionCmd(&cxt, partcmd->bound);
4067 : /* assign the transformed value of the partition bound */
4068 3492 : partcmd->bound = cxt.partbound;
4069 : }
4070 :
4071 3492 : newcmds = lappend(newcmds, cmd);
4072 3492 : break;
4073 :
4074 264 : case AT_MergePartitions:
4075 : {
4076 264 : PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
4077 :
4078 264 : if (list_length(partcmd->partlist) < 2)
4079 6 : ereport(ERROR,
4080 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4081 : errmsg("list of partitions to be merged should include at least two partitions"));
4082 :
4083 258 : transformPartitionCmdForMerge(&cxt, partcmd);
4084 180 : newcmds = lappend(newcmds, cmd);
4085 180 : break;
4086 : }
4087 :
4088 378 : case AT_SplitPartition:
4089 : {
4090 378 : PartitionCmd *partcmd = (PartitionCmd *) cmd->def;
4091 :
4092 378 : if (list_length(partcmd->partlist) < 2)
4093 12 : ereport(ERROR,
4094 : errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4095 : errmsg("list of new partitions should contain at least two partitions"));
4096 :
4097 366 : transformPartitionCmdForSplit(&cxt, partcmd);
4098 198 : newcmds = lappend(newcmds, cmd);
4099 198 : break;
4100 : }
4101 :
4102 0 : default:
4103 :
4104 : /*
4105 : * Currently, we shouldn't actually get here for the
4106 : * subcommand types that don't require transformation; but if
4107 : * we do, just emit them unchanged.
4108 : */
4109 0 : newcmds = lappend(newcmds, cmd);
4110 0 : break;
4111 : }
4112 : }
4113 :
4114 : /*
4115 : * Transfer anything we already have in cxt.alist into save_alist, to keep
4116 : * it separate from the output of transformIndexConstraints.
4117 : */
4118 24532 : save_alist = cxt.alist;
4119 24532 : cxt.alist = NIL;
4120 :
4121 : /* Postprocess constraints */
4122 24532 : transformIndexConstraints(&cxt);
4123 24508 : transformFKConstraints(&cxt, skipValidation, true);
4124 24508 : transformCheckConstraints(&cxt, false);
4125 :
4126 : /*
4127 : * Push any index-creation commands into the ALTER, so that they can be
4128 : * scheduled nicely by tablecmds.c. Note that tablecmds.c assumes that
4129 : * the IndexStmt attached to an AT_AddIndex or AT_AddIndexConstraint
4130 : * subcommand has already been through transformIndexStmt.
4131 : */
4132 36806 : foreach(l, cxt.alist)
4133 : {
4134 12298 : Node *istmt = (Node *) lfirst(l);
4135 :
4136 : /*
4137 : * We assume here that cxt.alist contains only IndexStmts generated
4138 : * from primary key constraints.
4139 : */
4140 12298 : if (IsA(istmt, IndexStmt))
4141 : {
4142 12298 : IndexStmt *idxstmt = (IndexStmt *) istmt;
4143 :
4144 12298 : idxstmt = transformIndexStmt(relid, idxstmt, queryString);
4145 12298 : newcmd = makeNode(AlterTableCmd);
4146 12298 : newcmd->subtype = OidIsValid(idxstmt->indexOid) ? AT_AddIndexConstraint : AT_AddIndex;
4147 12298 : newcmd->def = (Node *) idxstmt;
4148 12298 : newcmds = lappend(newcmds, newcmd);
4149 : }
4150 : else
4151 0 : elog(ERROR, "unexpected stmt type %d", (int) nodeTag(istmt));
4152 : }
4153 24508 : cxt.alist = NIL;
4154 :
4155 : /* Append any CHECK, NOT NULL or FK constraints to the commands list */
4156 50098 : foreach_node(Constraint, def, cxt.ckconstraints)
4157 : {
4158 1082 : newcmd = makeNode(AlterTableCmd);
4159 1082 : newcmd->subtype = AT_AddConstraint;
4160 1082 : newcmd->def = (Node *) def;
4161 1082 : newcmds = lappend(newcmds, newcmd);
4162 : }
4163 58358 : foreach_node(Constraint, def, cxt.nnconstraints)
4164 : {
4165 9342 : newcmd = makeNode(AlterTableCmd);
4166 9342 : newcmd->subtype = AT_AddConstraint;
4167 9342 : newcmd->def = (Node *) def;
4168 9342 : newcmds = lappend(newcmds, newcmd);
4169 : }
4170 51712 : foreach_node(Constraint, def, cxt.fkconstraints)
4171 : {
4172 2696 : newcmd = makeNode(AlterTableCmd);
4173 2696 : newcmd->subtype = AT_AddConstraint;
4174 2696 : newcmd->def = (Node *) def;
4175 2696 : newcmds = lappend(newcmds, newcmd);
4176 : }
4177 :
4178 : /* Close rel */
4179 24508 : relation_close(rel, NoLock);
4180 :
4181 : /*
4182 : * Output results.
4183 : */
4184 24508 : stmt->cmds = newcmds;
4185 :
4186 24508 : *beforeStmts = cxt.blist;
4187 24508 : *afterStmts = list_concat(cxt.alist, save_alist);
4188 :
4189 24508 : return stmt;
4190 : }
4191 :
4192 :
4193 : /*
4194 : * Preprocess a list of column constraint clauses
4195 : * to attach constraint attributes to their primary constraint nodes
4196 : * and detect inconsistent/misplaced constraint attributes.
4197 : *
4198 : * NOTE: currently, attributes are only supported for FOREIGN KEY, UNIQUE,
4199 : * EXCLUSION, and PRIMARY KEY constraints, but someday they ought to be
4200 : * supported for other constraint types.
4201 : */
4202 : static void
4203 70150 : transformConstraintAttrs(CreateStmtContext *cxt, List *constraintList)
4204 : {
4205 70150 : Constraint *lastprimarycon = NULL;
4206 70150 : bool saw_deferrability = false;
4207 70150 : bool saw_initially = false;
4208 70150 : bool saw_enforced = false;
4209 : ListCell *clist;
4210 :
4211 : #define SUPPORTS_ATTRS(node) \
4212 : ((node) != NULL && \
4213 : ((node)->contype == CONSTR_PRIMARY || \
4214 : (node)->contype == CONSTR_UNIQUE || \
4215 : (node)->contype == CONSTR_EXCLUSION || \
4216 : (node)->contype == CONSTR_FOREIGN))
4217 :
4218 89694 : foreach(clist, constraintList)
4219 : {
4220 19568 : Constraint *con = (Constraint *) lfirst(clist);
4221 :
4222 19568 : if (!IsA(con, Constraint))
4223 0 : elog(ERROR, "unrecognized node type: %d",
4224 : (int) nodeTag(con));
4225 19568 : switch (con->contype)
4226 : {
4227 94 : case CONSTR_ATTR_DEFERRABLE:
4228 94 : if (!SUPPORTS_ATTRS(lastprimarycon))
4229 0 : ereport(ERROR,
4230 : (errcode(ERRCODE_SYNTAX_ERROR),
4231 : errmsg("misplaced DEFERRABLE clause"),
4232 : parser_errposition(cxt->pstate, con->location)));
4233 94 : if (saw_deferrability)
4234 0 : ereport(ERROR,
4235 : (errcode(ERRCODE_SYNTAX_ERROR),
4236 : errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
4237 : parser_errposition(cxt->pstate, con->location)));
4238 94 : saw_deferrability = true;
4239 94 : lastprimarycon->deferrable = true;
4240 94 : break;
4241 :
4242 0 : case CONSTR_ATTR_NOT_DEFERRABLE:
4243 0 : if (!SUPPORTS_ATTRS(lastprimarycon))
4244 0 : ereport(ERROR,
4245 : (errcode(ERRCODE_SYNTAX_ERROR),
4246 : errmsg("misplaced NOT DEFERRABLE clause"),
4247 : parser_errposition(cxt->pstate, con->location)));
4248 0 : if (saw_deferrability)
4249 0 : ereport(ERROR,
4250 : (errcode(ERRCODE_SYNTAX_ERROR),
4251 : errmsg("multiple DEFERRABLE/NOT DEFERRABLE clauses not allowed"),
4252 : parser_errposition(cxt->pstate, con->location)));
4253 0 : saw_deferrability = true;
4254 0 : lastprimarycon->deferrable = false;
4255 0 : if (saw_initially &&
4256 0 : lastprimarycon->initdeferred)
4257 0 : ereport(ERROR,
4258 : (errcode(ERRCODE_SYNTAX_ERROR),
4259 : errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
4260 : parser_errposition(cxt->pstate, con->location)));
4261 0 : break;
4262 :
4263 76 : case CONSTR_ATTR_DEFERRED:
4264 76 : if (!SUPPORTS_ATTRS(lastprimarycon))
4265 0 : ereport(ERROR,
4266 : (errcode(ERRCODE_SYNTAX_ERROR),
4267 : errmsg("misplaced INITIALLY DEFERRED clause"),
4268 : parser_errposition(cxt->pstate, con->location)));
4269 76 : if (saw_initially)
4270 0 : ereport(ERROR,
4271 : (errcode(ERRCODE_SYNTAX_ERROR),
4272 : errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
4273 : parser_errposition(cxt->pstate, con->location)));
4274 76 : saw_initially = true;
4275 76 : lastprimarycon->initdeferred = true;
4276 :
4277 : /*
4278 : * If only INITIALLY DEFERRED appears, assume DEFERRABLE
4279 : */
4280 76 : if (!saw_deferrability)
4281 26 : lastprimarycon->deferrable = true;
4282 50 : else if (!lastprimarycon->deferrable)
4283 0 : ereport(ERROR,
4284 : (errcode(ERRCODE_SYNTAX_ERROR),
4285 : errmsg("constraint declared INITIALLY DEFERRED must be DEFERRABLE"),
4286 : parser_errposition(cxt->pstate, con->location)));
4287 76 : break;
4288 :
4289 6 : case CONSTR_ATTR_IMMEDIATE:
4290 6 : if (!SUPPORTS_ATTRS(lastprimarycon))
4291 0 : ereport(ERROR,
4292 : (errcode(ERRCODE_SYNTAX_ERROR),
4293 : errmsg("misplaced INITIALLY IMMEDIATE clause"),
4294 : parser_errposition(cxt->pstate, con->location)));
4295 6 : if (saw_initially)
4296 0 : ereport(ERROR,
4297 : (errcode(ERRCODE_SYNTAX_ERROR),
4298 : errmsg("multiple INITIALLY IMMEDIATE/DEFERRED clauses not allowed"),
4299 : parser_errposition(cxt->pstate, con->location)));
4300 6 : saw_initially = true;
4301 6 : lastprimarycon->initdeferred = false;
4302 6 : break;
4303 :
4304 36 : case CONSTR_ATTR_ENFORCED:
4305 36 : if (lastprimarycon == NULL ||
4306 36 : (lastprimarycon->contype != CONSTR_CHECK &&
4307 12 : lastprimarycon->contype != CONSTR_FOREIGN))
4308 6 : ereport(ERROR,
4309 : (errcode(ERRCODE_SYNTAX_ERROR),
4310 : errmsg("misplaced ENFORCED clause"),
4311 : parser_errposition(cxt->pstate, con->location)));
4312 30 : if (saw_enforced)
4313 6 : ereport(ERROR,
4314 : (errcode(ERRCODE_SYNTAX_ERROR),
4315 : errmsg("multiple ENFORCED/NOT ENFORCED clauses not allowed"),
4316 : parser_errposition(cxt->pstate, con->location)));
4317 24 : saw_enforced = true;
4318 24 : lastprimarycon->is_enforced = true;
4319 24 : break;
4320 :
4321 60 : case CONSTR_ATTR_NOT_ENFORCED:
4322 60 : if (lastprimarycon == NULL ||
4323 60 : (lastprimarycon->contype != CONSTR_CHECK &&
4324 18 : lastprimarycon->contype != CONSTR_FOREIGN))
4325 6 : ereport(ERROR,
4326 : (errcode(ERRCODE_SYNTAX_ERROR),
4327 : errmsg("misplaced NOT ENFORCED clause"),
4328 : parser_errposition(cxt->pstate, con->location)));
4329 54 : if (saw_enforced)
4330 6 : ereport(ERROR,
4331 : (errcode(ERRCODE_SYNTAX_ERROR),
4332 : errmsg("multiple ENFORCED/NOT ENFORCED clauses not allowed"),
4333 : parser_errposition(cxt->pstate, con->location)));
4334 48 : saw_enforced = true;
4335 48 : lastprimarycon->is_enforced = false;
4336 :
4337 : /* A NOT ENFORCED constraint must be marked as invalid. */
4338 48 : lastprimarycon->skip_validation = true;
4339 48 : lastprimarycon->initially_valid = false;
4340 48 : break;
4341 :
4342 19296 : default:
4343 : /* Otherwise it's not an attribute */
4344 19296 : lastprimarycon = con;
4345 : /* reset flags for new primary node */
4346 19296 : saw_deferrability = false;
4347 19296 : saw_initially = false;
4348 19296 : saw_enforced = false;
4349 19296 : break;
4350 : }
4351 : }
4352 70126 : }
4353 :
4354 : /*
4355 : * Special handling of type definition for a column
4356 : */
4357 : static void
4358 69830 : transformColumnType(CreateStmtContext *cxt, ColumnDef *column)
4359 : {
4360 : /*
4361 : * All we really need to do here is verify that the type is valid,
4362 : * including any collation spec that might be present.
4363 : */
4364 69830 : Type ctype = typenameType(cxt->pstate, column->typeName, NULL);
4365 :
4366 69816 : if (column->collClause)
4367 : {
4368 520 : Form_pg_type typtup = (Form_pg_type) GETSTRUCT(ctype);
4369 :
4370 520 : LookupCollation(cxt->pstate,
4371 520 : column->collClause->collname,
4372 520 : column->collClause->location);
4373 : /* Complain if COLLATE is applied to an uncollatable type */
4374 508 : if (!OidIsValid(typtup->typcollation))
4375 12 : ereport(ERROR,
4376 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4377 : errmsg("collations are not supported by type %s",
4378 : format_type_be(typtup->oid)),
4379 : parser_errposition(cxt->pstate,
4380 : column->collClause->location)));
4381 : }
4382 :
4383 69792 : ReleaseSysCache(ctype);
4384 69792 : }
4385 :
4386 :
4387 : /*
4388 : * transformCreateSchemaStmtElements -
4389 : * analyzes the elements of a CREATE SCHEMA statement
4390 : *
4391 : * Split the schema element list from a CREATE SCHEMA statement into
4392 : * individual commands and place them in the result list in an order
4393 : * such that there are no forward references (e.g. GRANT to a table
4394 : * created later in the list). Note that the logic we use for determining
4395 : * forward references is presently quite incomplete.
4396 : *
4397 : * "schemaName" is the name of the schema that will be used for the creation
4398 : * of the objects listed, that may be compiled from the schema name defined
4399 : * in the statement or a role specification.
4400 : *
4401 : * SQL also allows constraints to make forward references, so thumb through
4402 : * the table columns and move forward references to a posterior alter-table
4403 : * command.
4404 : *
4405 : * The result is a list of parse nodes that still need to be analyzed ---
4406 : * but we can't analyze the later commands until we've executed the earlier
4407 : * ones, because of possible inter-object references.
4408 : *
4409 : * Note: this breaks the rules a little bit by modifying schema-name fields
4410 : * within passed-in structs. However, the transformation would be the same
4411 : * if done over, so it should be all right to scribble on the input to this
4412 : * extent.
4413 : */
4414 : List *
4415 1072 : transformCreateSchemaStmtElements(List *schemaElts, const char *schemaName)
4416 : {
4417 : CreateSchemaStmtContext cxt;
4418 : List *result;
4419 : ListCell *elements;
4420 :
4421 1072 : cxt.schemaname = schemaName;
4422 1072 : cxt.sequences = NIL;
4423 1072 : cxt.tables = NIL;
4424 1072 : cxt.views = NIL;
4425 1072 : cxt.indexes = NIL;
4426 1072 : cxt.triggers = NIL;
4427 1072 : cxt.grants = NIL;
4428 :
4429 : /*
4430 : * Run through each schema element in the schema element list. Separate
4431 : * statements by type, and do preliminary analysis.
4432 : */
4433 1546 : foreach(elements, schemaElts)
4434 : {
4435 564 : Node *element = lfirst(elements);
4436 :
4437 564 : switch (nodeTag(element))
4438 : {
4439 18 : case T_CreateSeqStmt:
4440 : {
4441 18 : CreateSeqStmt *elp = (CreateSeqStmt *) element;
4442 :
4443 18 : setSchemaName(cxt.schemaname, &elp->sequence->schemaname);
4444 0 : cxt.sequences = lappend(cxt.sequences, element);
4445 : }
4446 0 : break;
4447 :
4448 452 : case T_CreateStmt:
4449 : {
4450 452 : CreateStmt *elp = (CreateStmt *) element;
4451 :
4452 452 : setSchemaName(cxt.schemaname, &elp->relation->schemaname);
4453 :
4454 : /*
4455 : * XXX todo: deal with constraints
4456 : */
4457 434 : cxt.tables = lappend(cxt.tables, element);
4458 : }
4459 434 : break;
4460 :
4461 44 : case T_ViewStmt:
4462 : {
4463 44 : ViewStmt *elp = (ViewStmt *) element;
4464 :
4465 44 : setSchemaName(cxt.schemaname, &elp->view->schemaname);
4466 :
4467 : /*
4468 : * XXX todo: deal with references between views
4469 : */
4470 26 : cxt.views = lappend(cxt.views, element);
4471 : }
4472 26 : break;
4473 :
4474 32 : case T_IndexStmt:
4475 : {
4476 32 : IndexStmt *elp = (IndexStmt *) element;
4477 :
4478 32 : setSchemaName(cxt.schemaname, &elp->relation->schemaname);
4479 14 : cxt.indexes = lappend(cxt.indexes, element);
4480 : }
4481 14 : break;
4482 :
4483 18 : case T_CreateTrigStmt:
4484 : {
4485 18 : CreateTrigStmt *elp = (CreateTrigStmt *) element;
4486 :
4487 18 : setSchemaName(cxt.schemaname, &elp->relation->schemaname);
4488 0 : cxt.triggers = lappend(cxt.triggers, element);
4489 : }
4490 0 : break;
4491 :
4492 0 : case T_GrantStmt:
4493 0 : cxt.grants = lappend(cxt.grants, element);
4494 0 : break;
4495 :
4496 0 : default:
4497 0 : elog(ERROR, "unrecognized node type: %d",
4498 : (int) nodeTag(element));
4499 : }
4500 : }
4501 :
4502 982 : result = NIL;
4503 982 : result = list_concat(result, cxt.sequences);
4504 982 : result = list_concat(result, cxt.tables);
4505 982 : result = list_concat(result, cxt.views);
4506 982 : result = list_concat(result, cxt.indexes);
4507 982 : result = list_concat(result, cxt.triggers);
4508 982 : result = list_concat(result, cxt.grants);
4509 :
4510 982 : return result;
4511 : }
4512 :
4513 : /*
4514 : * setSchemaName
4515 : * Set or check schema name in an element of a CREATE SCHEMA command
4516 : */
4517 : static void
4518 564 : setSchemaName(const char *context_schema, char **stmt_schema_name)
4519 : {
4520 564 : if (*stmt_schema_name == NULL)
4521 450 : *stmt_schema_name = unconstify(char *, context_schema);
4522 114 : else if (strcmp(context_schema, *stmt_schema_name) != 0)
4523 90 : ereport(ERROR,
4524 : (errcode(ERRCODE_INVALID_SCHEMA_DEFINITION),
4525 : errmsg("CREATE specifies a schema (%s) "
4526 : "different from the one being created (%s)",
4527 : *stmt_schema_name, context_schema)));
4528 474 : }
4529 :
4530 : /*
4531 : * transformPartitionCmd
4532 : * Analyze the ATTACH/DETACH/SPLIT PARTITION command
4533 : *
4534 : * In case of the ATTACH/SPLIT PARTITION command, cxt->partbound is set to the
4535 : * transformed value of bound.
4536 : */
4537 : static void
4538 4566 : transformPartitionCmd(CreateStmtContext *cxt, PartitionBoundSpec *bound)
4539 : {
4540 4566 : Relation parentRel = cxt->rel;
4541 :
4542 4566 : switch (parentRel->rd_rel->relkind)
4543 : {
4544 4176 : case RELKIND_PARTITIONED_TABLE:
4545 : /* transform the partition bound, if any */
4546 : Assert(RelationGetPartitionKey(parentRel) != NULL);
4547 4176 : if (bound != NULL)
4548 3592 : cxt->partbound = transformPartitionBound(cxt->pstate, parentRel,
4549 : bound);
4550 4152 : break;
4551 390 : case RELKIND_PARTITIONED_INDEX:
4552 :
4553 : /*
4554 : * A partitioned index cannot have a partition bound set. ALTER
4555 : * INDEX prevents that with its grammar, but not ALTER TABLE.
4556 : */
4557 390 : if (bound != NULL)
4558 6 : ereport(ERROR,
4559 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4560 : errmsg("\"%s\" is not a partitioned table",
4561 : RelationGetRelationName(parentRel))));
4562 384 : break;
4563 0 : case RELKIND_RELATION:
4564 : /* the table must be partitioned */
4565 0 : ereport(ERROR,
4566 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4567 : errmsg("table \"%s\" is not partitioned",
4568 : RelationGetRelationName(parentRel))));
4569 : break;
4570 0 : case RELKIND_INDEX:
4571 : /* the index must be partitioned */
4572 0 : ereport(ERROR,
4573 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4574 : errmsg("index \"%s\" is not partitioned",
4575 : RelationGetRelationName(parentRel))));
4576 : break;
4577 0 : default:
4578 : /* parser shouldn't let this case through */
4579 0 : elog(ERROR, "\"%s\" is not a partitioned table or index",
4580 : RelationGetRelationName(parentRel));
4581 : break;
4582 : }
4583 4536 : }
4584 :
4585 : /*
4586 : * transformPartitionBound
4587 : *
4588 : * Transform a partition bound specification
4589 : */
4590 : PartitionBoundSpec *
4591 12628 : transformPartitionBound(ParseState *pstate, Relation parent,
4592 : PartitionBoundSpec *spec)
4593 : {
4594 : PartitionBoundSpec *result_spec;
4595 12628 : PartitionKey key = RelationGetPartitionKey(parent);
4596 12628 : char strategy = get_partition_strategy(key);
4597 12628 : int partnatts = get_partition_natts(key);
4598 12628 : List *partexprs = get_partition_exprs(key);
4599 :
4600 : /* Avoid scribbling on input */
4601 12628 : result_spec = copyObject(spec);
4602 :
4603 12628 : if (spec->is_default)
4604 : {
4605 : /*
4606 : * Hash partitioning does not support a default partition; there's no
4607 : * use case for it (since the set of partitions to create is perfectly
4608 : * defined), and if users do get into it accidentally, it's hard to
4609 : * back out from it afterwards.
4610 : */
4611 822 : if (strategy == PARTITION_STRATEGY_HASH)
4612 6 : ereport(ERROR,
4613 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4614 : errmsg("a hash-partitioned table may not have a default partition")));
4615 :
4616 : /*
4617 : * In case of the default partition, parser had no way to identify the
4618 : * partition strategy. Assign the parent's strategy to the default
4619 : * partition bound spec.
4620 : */
4621 816 : result_spec->strategy = strategy;
4622 :
4623 816 : return result_spec;
4624 : }
4625 :
4626 11806 : if (strategy == PARTITION_STRATEGY_HASH)
4627 : {
4628 756 : if (spec->strategy != PARTITION_STRATEGY_HASH)
4629 12 : ereport(ERROR,
4630 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4631 : errmsg("invalid bound specification for a hash partition"),
4632 : parser_errposition(pstate, exprLocation((Node *) spec))));
4633 :
4634 744 : if (spec->modulus <= 0)
4635 12 : ereport(ERROR,
4636 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4637 : errmsg("modulus for hash partition must be an integer value greater than zero")));
4638 :
4639 : Assert(spec->remainder >= 0);
4640 :
4641 732 : if (spec->remainder >= spec->modulus)
4642 12 : ereport(ERROR,
4643 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4644 : errmsg("remainder for hash partition must be less than modulus")));
4645 : }
4646 11050 : else if (strategy == PARTITION_STRATEGY_LIST)
4647 : {
4648 : ListCell *cell;
4649 : char *colname;
4650 : Oid coltype;
4651 : int32 coltypmod;
4652 : Oid partcollation;
4653 :
4654 5246 : if (spec->strategy != PARTITION_STRATEGY_LIST)
4655 18 : ereport(ERROR,
4656 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4657 : errmsg("invalid bound specification for a list partition"),
4658 : parser_errposition(pstate, exprLocation((Node *) spec))));
4659 :
4660 : /* Get the only column's name in case we need to output an error */
4661 5228 : if (key->partattrs[0] != 0)
4662 5096 : colname = get_attname(RelationGetRelid(parent),
4663 5096 : key->partattrs[0], false);
4664 : else
4665 132 : colname = deparse_expression((Node *) linitial(partexprs),
4666 132 : deparse_context_for(RelationGetRelationName(parent),
4667 : RelationGetRelid(parent)),
4668 : false, false);
4669 : /* Need its type data too */
4670 5228 : coltype = get_partition_col_typid(key, 0);
4671 5228 : coltypmod = get_partition_col_typmod(key, 0);
4672 5228 : partcollation = get_partition_col_collation(key, 0);
4673 :
4674 5228 : result_spec->listdatums = NIL;
4675 13422 : foreach(cell, spec->listdatums)
4676 : {
4677 8254 : Node *expr = lfirst(cell);
4678 : Const *value;
4679 : ListCell *cell2;
4680 : bool duplicate;
4681 :
4682 8254 : value = transformPartitionBoundValue(pstate, expr,
4683 : colname, coltype, coltypmod,
4684 : partcollation);
4685 :
4686 : /* Don't add to the result if the value is a duplicate */
4687 8194 : duplicate = false;
4688 14944 : foreach(cell2, result_spec->listdatums)
4689 : {
4690 6750 : Const *value2 = lfirst_node(Const, cell2);
4691 :
4692 6750 : if (equal(value, value2))
4693 : {
4694 0 : duplicate = true;
4695 0 : break;
4696 : }
4697 : }
4698 8194 : if (duplicate)
4699 0 : continue;
4700 :
4701 8194 : result_spec->listdatums = lappend(result_spec->listdatums,
4702 : value);
4703 : }
4704 : }
4705 5804 : else if (strategy == PARTITION_STRATEGY_RANGE)
4706 : {
4707 5804 : if (spec->strategy != PARTITION_STRATEGY_RANGE)
4708 24 : ereport(ERROR,
4709 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4710 : errmsg("invalid bound specification for a range partition"),
4711 : parser_errposition(pstate, exprLocation((Node *) spec))));
4712 :
4713 5780 : if (list_length(spec->lowerdatums) != partnatts)
4714 6 : ereport(ERROR,
4715 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4716 : errmsg("FROM must specify exactly one value per partitioning column")));
4717 5774 : if (list_length(spec->upperdatums) != partnatts)
4718 6 : ereport(ERROR,
4719 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
4720 : errmsg("TO must specify exactly one value per partitioning column")));
4721 :
4722 : /*
4723 : * Convert raw parse nodes into PartitionRangeDatum nodes and perform
4724 : * any necessary validation.
4725 : */
4726 5702 : result_spec->lowerdatums =
4727 5768 : transformPartitionRangeBounds(pstate, spec->lowerdatums,
4728 : parent);
4729 5696 : result_spec->upperdatums =
4730 5702 : transformPartitionRangeBounds(pstate, spec->upperdatums,
4731 : parent);
4732 : }
4733 : else
4734 0 : elog(ERROR, "unexpected partition strategy: %d", (int) strategy);
4735 :
4736 11584 : return result_spec;
4737 : }
4738 :
4739 : /*
4740 : * transformPartitionRangeBounds
4741 : * This converts the expressions for range partition bounds from the raw
4742 : * grammar representation to PartitionRangeDatum structs
4743 : */
4744 : static List *
4745 11470 : transformPartitionRangeBounds(ParseState *pstate, List *blist,
4746 : Relation parent)
4747 : {
4748 11470 : List *result = NIL;
4749 11470 : PartitionKey key = RelationGetPartitionKey(parent);
4750 11470 : List *partexprs = get_partition_exprs(key);
4751 : ListCell *lc;
4752 : int i,
4753 : j;
4754 :
4755 11470 : i = j = 0;
4756 25126 : foreach(lc, blist)
4757 : {
4758 13710 : Node *expr = lfirst(lc);
4759 13710 : PartitionRangeDatum *prd = NULL;
4760 :
4761 : /*
4762 : * Infinite range bounds -- "minvalue" and "maxvalue" -- get passed in
4763 : * as ColumnRefs.
4764 : */
4765 13710 : if (IsA(expr, ColumnRef))
4766 : {
4767 788 : ColumnRef *cref = (ColumnRef *) expr;
4768 788 : char *cname = NULL;
4769 :
4770 : /*
4771 : * There should be a single field named either "minvalue" or
4772 : * "maxvalue".
4773 : */
4774 788 : if (list_length(cref->fields) == 1 &&
4775 782 : IsA(linitial(cref->fields), String))
4776 782 : cname = strVal(linitial(cref->fields));
4777 :
4778 788 : if (cname == NULL)
4779 : {
4780 : /*
4781 : * ColumnRef is not in the desired single-field-name form. For
4782 : * consistency between all partition strategies, let the
4783 : * expression transformation report any errors rather than
4784 : * doing it ourselves.
4785 : */
4786 : }
4787 782 : else if (strcmp("minvalue", cname) == 0)
4788 : {
4789 380 : prd = makeNode(PartitionRangeDatum);
4790 380 : prd->kind = PARTITION_RANGE_DATUM_MINVALUE;
4791 380 : prd->value = NULL;
4792 : }
4793 402 : else if (strcmp("maxvalue", cname) == 0)
4794 : {
4795 390 : prd = makeNode(PartitionRangeDatum);
4796 390 : prd->kind = PARTITION_RANGE_DATUM_MAXVALUE;
4797 390 : prd->value = NULL;
4798 : }
4799 : }
4800 :
4801 13710 : if (prd == NULL)
4802 : {
4803 : char *colname;
4804 : Oid coltype;
4805 : int32 coltypmod;
4806 : Oid partcollation;
4807 : Const *value;
4808 :
4809 : /* Get the column's name in case we need to output an error */
4810 12940 : if (key->partattrs[i] != 0)
4811 12062 : colname = get_attname(RelationGetRelid(parent),
4812 12062 : key->partattrs[i], false);
4813 : else
4814 : {
4815 878 : colname = deparse_expression((Node *) list_nth(partexprs, j),
4816 878 : deparse_context_for(RelationGetRelationName(parent),
4817 : RelationGetRelid(parent)),
4818 : false, false);
4819 878 : ++j;
4820 : }
4821 :
4822 : /* Need its type data too */
4823 12940 : coltype = get_partition_col_typid(key, i);
4824 12940 : coltypmod = get_partition_col_typmod(key, i);
4825 12940 : partcollation = get_partition_col_collation(key, i);
4826 :
4827 12940 : value = transformPartitionBoundValue(pstate, expr,
4828 : colname,
4829 : coltype, coltypmod,
4830 : partcollation);
4831 12892 : if (value->constisnull)
4832 6 : ereport(ERROR,
4833 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
4834 : errmsg("cannot specify NULL in range bound")));
4835 12886 : prd = makeNode(PartitionRangeDatum);
4836 12886 : prd->kind = PARTITION_RANGE_DATUM_VALUE;
4837 12886 : prd->value = (Node *) value;
4838 12886 : ++i;
4839 : }
4840 :
4841 13656 : prd->location = exprLocation(expr);
4842 :
4843 13656 : result = lappend(result, prd);
4844 : }
4845 :
4846 : /*
4847 : * Once we see MINVALUE or MAXVALUE for one column, the remaining columns
4848 : * must be the same.
4849 : */
4850 11416 : validateInfiniteBounds(pstate, result);
4851 :
4852 11398 : return result;
4853 : }
4854 :
4855 : /*
4856 : * validateInfiniteBounds
4857 : *
4858 : * Check that a MAXVALUE or MINVALUE specification in a partition bound is
4859 : * followed only by more of the same.
4860 : */
4861 : static void
4862 11416 : validateInfiniteBounds(ParseState *pstate, List *blist)
4863 : {
4864 : ListCell *lc;
4865 11416 : PartitionRangeDatumKind kind = PARTITION_RANGE_DATUM_VALUE;
4866 :
4867 25048 : foreach(lc, blist)
4868 : {
4869 13650 : PartitionRangeDatum *prd = lfirst_node(PartitionRangeDatum, lc);
4870 :
4871 13650 : if (kind == prd->kind)
4872 13096 : continue;
4873 :
4874 554 : switch (kind)
4875 : {
4876 536 : case PARTITION_RANGE_DATUM_VALUE:
4877 536 : kind = prd->kind;
4878 536 : break;
4879 :
4880 6 : case PARTITION_RANGE_DATUM_MAXVALUE:
4881 6 : ereport(ERROR,
4882 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4883 : errmsg("every bound following MAXVALUE must also be MAXVALUE"),
4884 : parser_errposition(pstate, exprLocation((Node *) prd))));
4885 : break;
4886 :
4887 12 : case PARTITION_RANGE_DATUM_MINVALUE:
4888 12 : ereport(ERROR,
4889 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4890 : errmsg("every bound following MINVALUE must also be MINVALUE"),
4891 : parser_errposition(pstate, exprLocation((Node *) prd))));
4892 : break;
4893 : }
4894 : }
4895 11398 : }
4896 :
4897 : /*
4898 : * Transform one entry in a partition bound spec, producing a constant.
4899 : */
4900 : static Const *
4901 21194 : transformPartitionBoundValue(ParseState *pstate, Node *val,
4902 : const char *colName, Oid colType, int32 colTypmod,
4903 : Oid partCollation)
4904 : {
4905 : Node *value;
4906 :
4907 : /* Transform raw parsetree */
4908 21194 : value = transformExpr(pstate, val, EXPR_KIND_PARTITION_BOUND);
4909 :
4910 : /*
4911 : * transformExpr() should have already rejected column references,
4912 : * subqueries, aggregates, window functions, and SRFs, based on the
4913 : * EXPR_KIND_ of a partition bound expression.
4914 : */
4915 : Assert(!contain_var_clause(value));
4916 :
4917 : /*
4918 : * Coerce to the correct type. This might cause an explicit coercion step
4919 : * to be added on top of the expression, which must be evaluated before
4920 : * returning the result to the caller.
4921 : */
4922 21092 : value = coerce_to_target_type(pstate,
4923 : value, exprType(value),
4924 : colType,
4925 : colTypmod,
4926 : COERCION_ASSIGNMENT,
4927 : COERCE_IMPLICIT_CAST,
4928 : -1);
4929 :
4930 21092 : if (value == NULL)
4931 6 : ereport(ERROR,
4932 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4933 : errmsg("specified value cannot be cast to type %s for column \"%s\"",
4934 : format_type_be(colType), colName),
4935 : parser_errposition(pstate, exprLocation(val))));
4936 :
4937 : /*
4938 : * Evaluate the expression, if needed, assigning the partition key's data
4939 : * type and collation to the resulting Const node.
4940 : */
4941 21086 : if (!IsA(value, Const))
4942 : {
4943 1458 : assign_expr_collations(pstate, value);
4944 1458 : value = (Node *) expression_planner((Expr *) value);
4945 1458 : value = (Node *) evaluate_expr((Expr *) value, colType, colTypmod,
4946 : partCollation);
4947 1458 : if (!IsA(value, Const))
4948 0 : elog(ERROR, "could not evaluate partition bound expression");
4949 : }
4950 : else
4951 : {
4952 : /*
4953 : * If the expression is already a Const, as is often the case, we can
4954 : * skip the rather expensive steps above. But we still have to insert
4955 : * the right collation, since coerce_to_target_type doesn't handle
4956 : * that.
4957 : */
4958 19628 : ((Const *) value)->constcollid = partCollation;
4959 : }
4960 :
4961 : /*
4962 : * Attach original expression's parse location to the Const, so that
4963 : * that's what will be reported for any later errors related to this
4964 : * partition bound.
4965 : */
4966 21086 : ((Const *) value)->location = exprLocation(val);
4967 :
4968 21086 : return (Const *) value;
4969 : }
|
