Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * heap.c
4 : * code to create and destroy POSTGRES heap relations
5 : *
6 : * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
7 : * Portions Copyright (c) 1994, Regents of the University of California
8 : *
9 : *
10 : * IDENTIFICATION
11 : * src/backend/catalog/heap.c
12 : *
13 : *
14 : * INTERFACE ROUTINES
15 : * heap_create() - Create an uncataloged heap relation
16 : * heap_create_with_catalog() - Create a cataloged relation
17 : * heap_drop_with_catalog() - Removes named relation from catalogs
18 : *
19 : * NOTES
20 : * this code taken from access/heap/create.c, which contains
21 : * the old heap_create_with_catalog, amcreate, and amdestroy.
22 : * those routines will soon call these routines using the function
23 : * manager,
24 : * just like the poorly named "NewXXX" routines do. The
25 : * "New" routines are all going to die soon, once and for all!
26 : * -cim 1/13/91
27 : *
28 : *-------------------------------------------------------------------------
29 : */
30 : #include "postgres.h"
31 :
32 : #include "access/genam.h"
33 : #include "access/multixact.h"
34 : #include "access/relation.h"
35 : #include "access/table.h"
36 : #include "access/tableam.h"
37 : #include "catalog/binary_upgrade.h"
38 : #include "catalog/catalog.h"
39 : #include "catalog/heap.h"
40 : #include "catalog/index.h"
41 : #include "catalog/objectaccess.h"
42 : #include "catalog/partition.h"
43 : #include "catalog/pg_am.h"
44 : #include "catalog/pg_attrdef.h"
45 : #include "catalog/pg_collation.h"
46 : #include "catalog/pg_constraint.h"
47 : #include "catalog/pg_foreign_table.h"
48 : #include "catalog/pg_inherits.h"
49 : #include "catalog/pg_namespace.h"
50 : #include "catalog/pg_opclass.h"
51 : #include "catalog/pg_partitioned_table.h"
52 : #include "catalog/pg_statistic.h"
53 : #include "catalog/pg_subscription_rel.h"
54 : #include "catalog/pg_tablespace.h"
55 : #include "catalog/pg_type.h"
56 : #include "catalog/storage.h"
57 : #include "commands/tablecmds.h"
58 : #include "commands/typecmds.h"
59 : #include "common/int.h"
60 : #include "miscadmin.h"
61 : #include "nodes/nodeFuncs.h"
62 : #include "optimizer/optimizer.h"
63 : #include "parser/parse_coerce.h"
64 : #include "parser/parse_collate.h"
65 : #include "parser/parse_expr.h"
66 : #include "parser/parse_relation.h"
67 : #include "parser/parsetree.h"
68 : #include "partitioning/partdesc.h"
69 : #include "pgstat.h"
70 : #include "storage/lmgr.h"
71 : #include "storage/predicate.h"
72 : #include "utils/array.h"
73 : #include "utils/builtins.h"
74 : #include "utils/fmgroids.h"
75 : #include "utils/inval.h"
76 : #include "utils/lsyscache.h"
77 : #include "utils/syscache.h"
78 :
79 :
80 : /* Potentially set by pg_upgrade_support functions */
81 : Oid binary_upgrade_next_heap_pg_class_oid = InvalidOid;
82 : Oid binary_upgrade_next_toast_pg_class_oid = InvalidOid;
83 : RelFileNumber binary_upgrade_next_heap_pg_class_relfilenumber = InvalidRelFileNumber;
84 : RelFileNumber binary_upgrade_next_toast_pg_class_relfilenumber = InvalidRelFileNumber;
85 :
86 : static void AddNewRelationTuple(Relation pg_class_desc,
87 : Relation new_rel_desc,
88 : Oid new_rel_oid,
89 : Oid new_type_oid,
90 : Oid reloftype,
91 : Oid relowner,
92 : char relkind,
93 : TransactionId relfrozenxid,
94 : TransactionId relminmxid,
95 : Datum relacl,
96 : Datum reloptions);
97 : static ObjectAddress AddNewRelationType(const char *typeName,
98 : Oid typeNamespace,
99 : Oid new_rel_oid,
100 : char new_rel_kind,
101 : Oid ownerid,
102 : Oid new_row_type,
103 : Oid new_array_type);
104 : static void RelationRemoveInheritance(Oid relid);
105 : static Oid StoreRelCheck(Relation rel, const char *ccname, Node *expr,
106 : bool is_enforced, bool is_validated, bool is_local,
107 : int16 inhcount, bool is_no_inherit, bool is_internal);
108 : static void StoreConstraints(Relation rel, List *cooked_constraints,
109 : bool is_internal);
110 : static bool MergeWithExistingConstraint(Relation rel, const char *ccname, Node *expr,
111 : bool allow_merge, bool is_local,
112 : bool is_enforced,
113 : bool is_initially_valid,
114 : bool is_no_inherit);
115 : static void SetRelationNumChecks(Relation rel, int numchecks);
116 : static Node *cookConstraint(ParseState *pstate,
117 : Node *raw_constraint,
118 : char *relname);
119 :
120 :
121 : /* ----------------------------------------------------------------
122 : * XXX UGLY HARD CODED BADNESS FOLLOWS XXX
123 : *
124 : * these should all be moved to someplace in the lib/catalog
125 : * module, if not obliterated first.
126 : * ----------------------------------------------------------------
127 : */
128 :
129 :
130 : /*
131 : * Note:
132 : * Should the system special case these attributes in the future?
133 : * Advantage: consume much less space in the ATTRIBUTE relation.
134 : * Disadvantage: special cases will be all over the place.
135 : */
136 :
137 : /*
138 : * The initializers below do not include trailing variable length fields,
139 : * but that's OK - we're never going to reference anything beyond the
140 : * fixed-size portion of the structure anyway. Fields that can default
141 : * to zeroes are also not mentioned.
142 : */
143 :
144 : static const FormData_pg_attribute a1 = {
145 : .attname = {"ctid"},
146 : .atttypid = TIDOID,
147 : .attlen = sizeof(ItemPointerData),
148 : .attnum = SelfItemPointerAttributeNumber,
149 : .atttypmod = -1,
150 : .attbyval = false,
151 : .attalign = TYPALIGN_SHORT,
152 : .attstorage = TYPSTORAGE_PLAIN,
153 : .attnotnull = true,
154 : .attislocal = true,
155 : };
156 :
157 : static const FormData_pg_attribute a2 = {
158 : .attname = {"xmin"},
159 : .atttypid = XIDOID,
160 : .attlen = sizeof(TransactionId),
161 : .attnum = MinTransactionIdAttributeNumber,
162 : .atttypmod = -1,
163 : .attbyval = true,
164 : .attalign = TYPALIGN_INT,
165 : .attstorage = TYPSTORAGE_PLAIN,
166 : .attnotnull = true,
167 : .attislocal = true,
168 : };
169 :
170 : static const FormData_pg_attribute a3 = {
171 : .attname = {"cmin"},
172 : .atttypid = CIDOID,
173 : .attlen = sizeof(CommandId),
174 : .attnum = MinCommandIdAttributeNumber,
175 : .atttypmod = -1,
176 : .attbyval = true,
177 : .attalign = TYPALIGN_INT,
178 : .attstorage = TYPSTORAGE_PLAIN,
179 : .attnotnull = true,
180 : .attislocal = true,
181 : };
182 :
183 : static const FormData_pg_attribute a4 = {
184 : .attname = {"xmax"},
185 : .atttypid = XIDOID,
186 : .attlen = sizeof(TransactionId),
187 : .attnum = MaxTransactionIdAttributeNumber,
188 : .atttypmod = -1,
189 : .attbyval = true,
190 : .attalign = TYPALIGN_INT,
191 : .attstorage = TYPSTORAGE_PLAIN,
192 : .attnotnull = true,
193 : .attislocal = true,
194 : };
195 :
196 : static const FormData_pg_attribute a5 = {
197 : .attname = {"cmax"},
198 : .atttypid = CIDOID,
199 : .attlen = sizeof(CommandId),
200 : .attnum = MaxCommandIdAttributeNumber,
201 : .atttypmod = -1,
202 : .attbyval = true,
203 : .attalign = TYPALIGN_INT,
204 : .attstorage = TYPSTORAGE_PLAIN,
205 : .attnotnull = true,
206 : .attislocal = true,
207 : };
208 :
209 : /*
210 : * We decided to call this attribute "tableoid" rather than say
211 : * "classoid" on the basis that in the future there may be more than one
212 : * table of a particular class/type. In any case table is still the word
213 : * used in SQL.
214 : */
215 : static const FormData_pg_attribute a6 = {
216 : .attname = {"tableoid"},
217 : .atttypid = OIDOID,
218 : .attlen = sizeof(Oid),
219 : .attnum = TableOidAttributeNumber,
220 : .atttypmod = -1,
221 : .attbyval = true,
222 : .attalign = TYPALIGN_INT,
223 : .attstorage = TYPSTORAGE_PLAIN,
224 : .attnotnull = true,
225 : .attislocal = true,
226 : };
227 :
228 : static const FormData_pg_attribute *const SysAtt[] = {&a1, &a2, &a3, &a4, &a5, &a6};
229 :
230 : /*
231 : * This function returns a Form_pg_attribute pointer for a system attribute.
232 : * Note that we elog if the presented attno is invalid, which would only
233 : * happen if there's a problem upstream.
234 : */
235 : const FormData_pg_attribute *
236 32944 : SystemAttributeDefinition(AttrNumber attno)
237 : {
238 32944 : if (attno >= 0 || attno < -(int) lengthof(SysAtt))
239 0 : elog(ERROR, "invalid system attribute number %d", attno);
240 32944 : return SysAtt[-attno - 1];
241 : }
242 :
243 : /*
244 : * If the given name is a system attribute name, return a Form_pg_attribute
245 : * pointer for a prototype definition. If not, return NULL.
246 : */
247 : const FormData_pg_attribute *
248 338772 : SystemAttributeByName(const char *attname)
249 : {
250 : int j;
251 :
252 2251912 : for (j = 0; j < (int) lengthof(SysAtt); j++)
253 : {
254 1946130 : const FormData_pg_attribute *att = SysAtt[j];
255 :
256 1946130 : if (strcmp(NameStr(att->attname), attname) == 0)
257 32990 : return att;
258 : }
259 :
260 305782 : return NULL;
261 : }
262 :
263 :
264 : /* ----------------------------------------------------------------
265 : * XXX END OF UGLY HARD CODED BADNESS XXX
266 : * ---------------------------------------------------------------- */
267 :
268 :
269 : /* ----------------------------------------------------------------
270 : * heap_create - Create an uncataloged heap relation
271 : *
272 : * Note API change: the caller must now always provide the OID
273 : * to use for the relation. The relfilenumber may be (and in
274 : * the simplest cases is) left unspecified.
275 : *
276 : * create_storage indicates whether or not to create the storage.
277 : * However, even if create_storage is true, no storage will be
278 : * created if the relkind is one that doesn't have storage.
279 : *
280 : * rel->rd_rel is initialized by RelationBuildLocalRelation,
281 : * and is mostly zeroes at return.
282 : * ----------------------------------------------------------------
283 : */
284 : Relation
285 129998 : heap_create(const char *relname,
286 : Oid relnamespace,
287 : Oid reltablespace,
288 : Oid relid,
289 : RelFileNumber relfilenumber,
290 : Oid accessmtd,
291 : TupleDesc tupDesc,
292 : char relkind,
293 : char relpersistence,
294 : bool shared_relation,
295 : bool mapped_relation,
296 : bool allow_system_table_mods,
297 : TransactionId *relfrozenxid,
298 : MultiXactId *relminmxid,
299 : bool create_storage)
300 : {
301 : Relation rel;
302 :
303 : /* The caller must have provided an OID for the relation. */
304 : Assert(OidIsValid(relid));
305 :
306 : /*
307 : * Don't allow creating relations in pg_catalog directly, even though it
308 : * is allowed to move user defined relations there. Semantics with search
309 : * paths including pg_catalog are too confusing for now.
310 : *
311 : * But allow creating indexes on relations in pg_catalog even if
312 : * allow_system_table_mods = off, upper layers already guarantee it's on a
313 : * user defined relation, not a system one.
314 : */
315 204784 : if (!allow_system_table_mods &&
316 160738 : ((IsCatalogNamespace(relnamespace) && relkind != RELKIND_INDEX) ||
317 74778 : IsToastNamespace(relnamespace)) &&
318 8 : IsNormalProcessingMode())
319 8 : ereport(ERROR,
320 : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
321 : errmsg("permission denied to create \"%s.%s\"",
322 : get_namespace_name(relnamespace), relname),
323 : errdetail("System catalog modifications are currently disallowed.")));
324 :
325 129990 : *relfrozenxid = InvalidTransactionId;
326 129990 : *relminmxid = InvalidMultiXactId;
327 :
328 : /*
329 : * Force reltablespace to zero if the relation kind does not support
330 : * tablespaces. This is mainly just for cleanliness' sake.
331 : */
332 129990 : if (!RELKIND_HAS_TABLESPACE(relkind))
333 21648 : reltablespace = InvalidOid;
334 :
335 : /* Don't create storage for relkinds without physical storage. */
336 129990 : if (!RELKIND_HAS_STORAGE(relkind))
337 26664 : create_storage = false;
338 : else
339 : {
340 : /*
341 : * If relfilenumber is unspecified by the caller then create storage
342 : * with oid same as relid.
343 : */
344 103326 : if (!RelFileNumberIsValid(relfilenumber))
345 100298 : relfilenumber = relid;
346 : }
347 :
348 : /*
349 : * Never allow a pg_class entry to explicitly specify the database's
350 : * default tablespace in reltablespace; force it to zero instead. This
351 : * ensures that if the database is cloned with a different default
352 : * tablespace, the pg_class entry will still match where CREATE DATABASE
353 : * will put the physically copied relation.
354 : *
355 : * Yes, this is a bit of a hack.
356 : */
357 129990 : if (reltablespace == MyDatabaseTableSpace)
358 6 : reltablespace = InvalidOid;
359 :
360 : /*
361 : * build the relcache entry.
362 : */
363 129990 : rel = RelationBuildLocalRelation(relname,
364 : relnamespace,
365 : tupDesc,
366 : relid,
367 : accessmtd,
368 : relfilenumber,
369 : reltablespace,
370 : shared_relation,
371 : mapped_relation,
372 : relpersistence,
373 : relkind);
374 :
375 : /*
376 : * Have the storage manager create the relation's disk file, if needed.
377 : *
378 : * For tables, the AM callback creates both the main and the init fork.
379 : * For others, only the main fork is created; the other forks will be
380 : * created on demand.
381 : */
382 129990 : if (create_storage)
383 : {
384 103252 : if (RELKIND_HAS_TABLE_AM(rel->rd_rel->relkind))
385 57604 : table_relation_set_new_filelocator(rel, &rel->rd_locator,
386 : relpersistence,
387 : relfrozenxid, relminmxid);
388 45648 : else if (RELKIND_HAS_STORAGE(rel->rd_rel->relkind))
389 45648 : RelationCreateStorage(rel->rd_locator, relpersistence, true);
390 : else
391 : Assert(false);
392 : }
393 :
394 : /*
395 : * If a tablespace is specified, removal of that tablespace is normally
396 : * protected by the existence of a physical file; but for relations with
397 : * no files, add a pg_shdepend entry to account for that.
398 : */
399 129990 : if (!create_storage && reltablespace != InvalidOid)
400 106 : recordDependencyOnTablespace(RelationRelationId, relid,
401 : reltablespace);
402 :
403 : /* ensure that stats are dropped if transaction aborts */
404 129990 : pgstat_create_relation(rel);
405 :
406 129990 : return rel;
407 : }
408 :
409 : /* ----------------------------------------------------------------
410 : * heap_create_with_catalog - Create a cataloged relation
411 : *
412 : * this is done in multiple steps:
413 : *
414 : * 1) CheckAttributeNamesTypes() is used to make certain the tuple
415 : * descriptor contains a valid set of attribute names and types
416 : *
417 : * 2) pg_class is opened and get_relname_relid()
418 : * performs a scan to ensure that no relation with the
419 : * same name already exists.
420 : *
421 : * 3) heap_create() is called to create the new relation on disk.
422 : *
423 : * 4) TypeCreate() is called to define a new type corresponding
424 : * to the new relation.
425 : *
426 : * 5) AddNewRelationTuple() is called to register the
427 : * relation in pg_class.
428 : *
429 : * 6) AddNewAttributeTuples() is called to register the
430 : * new relation's schema in pg_attribute.
431 : *
432 : * 7) StoreConstraints() is called - vadim 08/22/97
433 : *
434 : * 8) the relations are closed and the new relation's oid
435 : * is returned.
436 : *
437 : * ----------------------------------------------------------------
438 : */
439 :
440 : /* --------------------------------
441 : * CheckAttributeNamesTypes
442 : *
443 : * this is used to make certain the tuple descriptor contains a
444 : * valid set of attribute names and datatypes. a problem simply
445 : * generates ereport(ERROR) which aborts the current transaction.
446 : *
447 : * relkind is the relkind of the relation to be created.
448 : * flags controls which datatypes are allowed, cf CheckAttributeType.
449 : * --------------------------------
450 : */
451 : void
452 84596 : CheckAttributeNamesTypes(TupleDesc tupdesc, char relkind,
453 : int flags)
454 : {
455 : int i;
456 : int j;
457 84596 : int natts = tupdesc->natts;
458 :
459 : /* Sanity check on column count */
460 84596 : if (natts < 0 || natts > MaxHeapAttributeNumber)
461 0 : ereport(ERROR,
462 : (errcode(ERRCODE_TOO_MANY_COLUMNS),
463 : errmsg("tables can have at most %d columns",
464 : MaxHeapAttributeNumber)));
465 :
466 : /*
467 : * first check for collision with system attribute names
468 : *
469 : * Skip this for a view or type relation, since those don't have system
470 : * attributes.
471 : */
472 84596 : if (relkind != RELKIND_VIEW && relkind != RELKIND_COMPOSITE_TYPE)
473 : {
474 260956 : for (i = 0; i < natts; i++)
475 : {
476 196562 : Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
477 :
478 196562 : if (SystemAttributeByName(NameStr(attr->attname)) != NULL)
479 0 : ereport(ERROR,
480 : (errcode(ERRCODE_DUPLICATE_COLUMN),
481 : errmsg("column name \"%s\" conflicts with a system column name",
482 : NameStr(attr->attname))));
483 : }
484 : }
485 :
486 : /*
487 : * next check for repeated attribute names
488 : */
489 341672 : for (i = 1; i < natts; i++)
490 : {
491 6788326 : for (j = 0; j < i; j++)
492 : {
493 6531250 : if (strcmp(NameStr(TupleDescAttr(tupdesc, j)->attname),
494 6531250 : NameStr(TupleDescAttr(tupdesc, i)->attname)) == 0)
495 0 : ereport(ERROR,
496 : (errcode(ERRCODE_DUPLICATE_COLUMN),
497 : errmsg("column name \"%s\" specified more than once",
498 : NameStr(TupleDescAttr(tupdesc, j)->attname))));
499 : }
500 : }
501 :
502 : /*
503 : * next check the attribute types
504 : */
505 422038 : for (i = 0; i < natts; i++)
506 : {
507 337468 : CheckAttributeType(NameStr(TupleDescAttr(tupdesc, i)->attname),
508 337468 : TupleDescAttr(tupdesc, i)->atttypid,
509 337468 : TupleDescAttr(tupdesc, i)->attcollation,
510 : NIL, /* assume we're creating a new rowtype */
511 337468 : flags | (TupleDescAttr(tupdesc, i)->attgenerated == ATTRIBUTE_GENERATED_VIRTUAL ? CHKATYPE_IS_VIRTUAL : 0));
512 : }
513 84570 : }
514 :
515 : /* --------------------------------
516 : * CheckAttributeType
517 : *
518 : * Verify that the proposed datatype of an attribute is legal.
519 : * This is needed mainly because there are types (and pseudo-types)
520 : * in the catalogs that we do not support as elements of real tuples.
521 : * We also check some other properties required of a table column.
522 : *
523 : * If the attribute is being proposed for addition to an existing table or
524 : * composite type, pass a one-element list of the rowtype OID as
525 : * containing_rowtypes. When checking a to-be-created rowtype, it's
526 : * sufficient to pass NIL, because there could not be any recursive reference
527 : * to a not-yet-existing rowtype.
528 : *
529 : * flags is a bitmask controlling which datatypes we allow. For the most
530 : * part, pseudo-types are disallowed as attribute types, but there are some
531 : * exceptions: ANYARRAYOID, RECORDOID, and RECORDARRAYOID can be allowed
532 : * in some cases. (This works because values of those type classes are
533 : * self-identifying to some extent. However, RECORDOID and RECORDARRAYOID
534 : * are reliably identifiable only within a session, since the identity info
535 : * may use a typmod that is only locally assigned. The caller is expected
536 : * to know whether these cases are safe.)
537 : *
538 : * flags can also control the phrasing of the error messages. If
539 : * CHKATYPE_IS_PARTKEY is specified, "attname" should be a partition key
540 : * column number as text, not a real column name.
541 : * --------------------------------
542 : */
543 : void
544 417508 : CheckAttributeType(const char *attname,
545 : Oid atttypid, Oid attcollation,
546 : List *containing_rowtypes,
547 : int flags)
548 : {
549 417508 : char att_typtype = get_typtype(atttypid);
550 : Oid att_typelem;
551 :
552 : /* since this function recurses, it could be driven to stack overflow */
553 417508 : check_stack_depth();
554 :
555 417508 : if (att_typtype == TYPTYPE_PSEUDO)
556 : {
557 : /*
558 : * We disallow pseudo-type columns, with the exception of ANYARRAY,
559 : * RECORD, and RECORD[] when the caller says that those are OK.
560 : *
561 : * We don't need to worry about recursive containment for RECORD and
562 : * RECORD[] because (a) no named composite type should be allowed to
563 : * contain those, and (b) two "anonymous" record types couldn't be
564 : * considered to be the same type, so infinite recursion isn't
565 : * possible.
566 : */
567 1674 : if (!((atttypid == ANYARRAYOID && (flags & CHKATYPE_ANYARRAY)) ||
568 24 : (atttypid == RECORDOID && (flags & CHKATYPE_ANYRECORD)) ||
569 6 : (atttypid == RECORDARRAYOID && (flags & CHKATYPE_ANYRECORD))))
570 : {
571 32 : if (flags & CHKATYPE_IS_PARTKEY)
572 12 : ereport(ERROR,
573 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
574 : /* translator: first %s is an integer not a name */
575 : errmsg("partition key column %s has pseudo-type %s",
576 : attname, format_type_be(atttypid))));
577 : else
578 20 : ereport(ERROR,
579 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
580 : errmsg("column \"%s\" has pseudo-type %s",
581 : attname, format_type_be(atttypid))));
582 : }
583 : }
584 415846 : else if (att_typtype == TYPTYPE_DOMAIN)
585 : {
586 : /*
587 : * Prevent virtual generated columns from having a domain type. We
588 : * would have to enforce domain constraints when columns underlying
589 : * the generated column change. This could possibly be implemented,
590 : * but it's not.
591 : */
592 59480 : if (flags & CHKATYPE_IS_VIRTUAL)
593 12 : ereport(ERROR,
594 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
595 : errmsg("virtual generated column \"%s\" cannot have a domain type", attname));
596 :
597 : /*
598 : * If it's a domain, recurse to check its base type.
599 : */
600 59468 : CheckAttributeType(attname, getBaseType(atttypid), attcollation,
601 : containing_rowtypes,
602 : flags);
603 : }
604 356366 : else if (att_typtype == TYPTYPE_COMPOSITE)
605 : {
606 : /*
607 : * For a composite type, recurse into its attributes.
608 : */
609 : Relation relation;
610 : TupleDesc tupdesc;
611 : int i;
612 :
613 : /*
614 : * Check for self-containment. Eventually we might be able to allow
615 : * this (just return without complaint, if so) but it's not clear how
616 : * many other places would require anti-recursion defenses before it
617 : * would be safe to allow tables to contain their own rowtype.
618 : */
619 740 : if (list_member_oid(containing_rowtypes, atttypid))
620 36 : ereport(ERROR,
621 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
622 : errmsg("composite type %s cannot be made a member of itself",
623 : format_type_be(atttypid))));
624 :
625 704 : containing_rowtypes = lappend_oid(containing_rowtypes, atttypid);
626 :
627 704 : relation = relation_open(get_typ_typrelid(atttypid), AccessShareLock);
628 :
629 704 : tupdesc = RelationGetDescr(relation);
630 :
631 4978 : for (i = 0; i < tupdesc->natts; i++)
632 : {
633 4286 : Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
634 :
635 4286 : if (attr->attisdropped)
636 2 : continue;
637 4284 : CheckAttributeType(NameStr(attr->attname),
638 : attr->atttypid, attr->attcollation,
639 : containing_rowtypes,
640 : flags & ~CHKATYPE_IS_PARTKEY);
641 : }
642 :
643 692 : relation_close(relation, AccessShareLock);
644 :
645 692 : containing_rowtypes = list_delete_last(containing_rowtypes);
646 : }
647 355626 : else if (att_typtype == TYPTYPE_RANGE)
648 : {
649 : /*
650 : * If it's a range, recurse to check its subtype.
651 : */
652 1898 : CheckAttributeType(attname, get_range_subtype(atttypid),
653 : get_range_collation(atttypid),
654 : containing_rowtypes,
655 : flags);
656 : }
657 353728 : else if (OidIsValid((att_typelem = get_element_type(atttypid))))
658 : {
659 : /*
660 : * Must recurse into array types, too, in case they are composite.
661 : */
662 9304 : CheckAttributeType(attname, att_typelem, attcollation,
663 : containing_rowtypes,
664 : flags);
665 : }
666 :
667 : /*
668 : * This might not be strictly invalid per SQL standard, but it is pretty
669 : * useless, and it cannot be dumped, so we must disallow it.
670 : */
671 417386 : if (!OidIsValid(attcollation) && type_is_collatable(atttypid))
672 : {
673 0 : if (flags & CHKATYPE_IS_PARTKEY)
674 0 : ereport(ERROR,
675 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
676 : /* translator: first %s is an integer not a name */
677 : errmsg("no collation was derived for partition key column %s with collatable type %s",
678 : attname, format_type_be(atttypid)),
679 : errhint("Use the COLLATE clause to set the collation explicitly.")));
680 : else
681 0 : ereport(ERROR,
682 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
683 : errmsg("no collation was derived for column \"%s\" with collatable type %s",
684 : attname, format_type_be(atttypid)),
685 : errhint("Use the COLLATE clause to set the collation explicitly.")));
686 : }
687 417386 : }
688 :
689 : /*
690 : * InsertPgAttributeTuples
691 : * Construct and insert a set of tuples in pg_attribute.
692 : *
693 : * Caller has already opened and locked pg_attribute. tupdesc contains the
694 : * attributes to insert. tupdesc_extra supplies the values for certain
695 : * variable-length/nullable pg_attribute fields and must contain the same
696 : * number of elements as tupdesc or be NULL. The other variable-length fields
697 : * of pg_attribute are always initialized to null values.
698 : *
699 : * indstate is the index state for CatalogTupleInsertWithInfo. It can be
700 : * passed as NULL, in which case we'll fetch the necessary info. (Don't do
701 : * this when inserting multiple attributes, because it's a tad more
702 : * expensive.)
703 : *
704 : * new_rel_oid is the relation OID assigned to the attributes inserted.
705 : * If set to InvalidOid, the relation OID from tupdesc is used instead.
706 : */
707 : void
708 196644 : InsertPgAttributeTuples(Relation pg_attribute_rel,
709 : TupleDesc tupdesc,
710 : Oid new_rel_oid,
711 : const FormExtraData_pg_attribute tupdesc_extra[],
712 : CatalogIndexState indstate)
713 : {
714 : TupleTableSlot **slot;
715 : TupleDesc td;
716 : int nslots;
717 196644 : int natts = 0;
718 196644 : int slotCount = 0;
719 196644 : bool close_index = false;
720 :
721 196644 : td = RelationGetDescr(pg_attribute_rel);
722 :
723 : /* Initialize the number of slots to use */
724 196644 : nslots = Min(tupdesc->natts,
725 : (MAX_CATALOG_MULTI_INSERT_BYTES / sizeof(FormData_pg_attribute)));
726 196644 : slot = palloc(sizeof(TupleTableSlot *) * nslots);
727 992120 : for (int i = 0; i < nslots; i++)
728 795476 : slot[i] = MakeSingleTupleTableSlot(td, &TTSOpsHeapTuple);
729 :
730 995696 : while (natts < tupdesc->natts)
731 : {
732 799052 : Form_pg_attribute attrs = TupleDescAttr(tupdesc, natts);
733 799052 : const FormExtraData_pg_attribute *attrs_extra = tupdesc_extra ? &tupdesc_extra[natts] : NULL;
734 :
735 799052 : ExecClearTuple(slot[slotCount]);
736 :
737 799052 : memset(slot[slotCount]->tts_isnull, false,
738 799052 : slot[slotCount]->tts_tupleDescriptor->natts * sizeof(bool));
739 :
740 799052 : if (new_rel_oid != InvalidOid)
741 724352 : slot[slotCount]->tts_values[Anum_pg_attribute_attrelid - 1] = ObjectIdGetDatum(new_rel_oid);
742 : else
743 74700 : slot[slotCount]->tts_values[Anum_pg_attribute_attrelid - 1] = ObjectIdGetDatum(attrs->attrelid);
744 :
745 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attname - 1] = NameGetDatum(&attrs->attname);
746 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_atttypid - 1] = ObjectIdGetDatum(attrs->atttypid);
747 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attlen - 1] = Int16GetDatum(attrs->attlen);
748 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attnum - 1] = Int16GetDatum(attrs->attnum);
749 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_atttypmod - 1] = Int32GetDatum(attrs->atttypmod);
750 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attndims - 1] = Int16GetDatum(attrs->attndims);
751 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attbyval - 1] = BoolGetDatum(attrs->attbyval);
752 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attalign - 1] = CharGetDatum(attrs->attalign);
753 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attstorage - 1] = CharGetDatum(attrs->attstorage);
754 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attcompression - 1] = CharGetDatum(attrs->attcompression);
755 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attnotnull - 1] = BoolGetDatum(attrs->attnotnull);
756 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_atthasdef - 1] = BoolGetDatum(attrs->atthasdef);
757 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_atthasmissing - 1] = BoolGetDatum(attrs->atthasmissing);
758 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attidentity - 1] = CharGetDatum(attrs->attidentity);
759 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attgenerated - 1] = CharGetDatum(attrs->attgenerated);
760 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attisdropped - 1] = BoolGetDatum(attrs->attisdropped);
761 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attislocal - 1] = BoolGetDatum(attrs->attislocal);
762 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attinhcount - 1] = Int16GetDatum(attrs->attinhcount);
763 799052 : slot[slotCount]->tts_values[Anum_pg_attribute_attcollation - 1] = ObjectIdGetDatum(attrs->attcollation);
764 799052 : if (attrs_extra)
765 : {
766 40768 : slot[slotCount]->tts_values[Anum_pg_attribute_attstattarget - 1] = attrs_extra->attstattarget.value;
767 40768 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attstattarget - 1] = attrs_extra->attstattarget.isnull;
768 :
769 40768 : slot[slotCount]->tts_values[Anum_pg_attribute_attoptions - 1] = attrs_extra->attoptions.value;
770 40768 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attoptions - 1] = attrs_extra->attoptions.isnull;
771 : }
772 : else
773 : {
774 758284 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attstattarget - 1] = true;
775 758284 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attoptions - 1] = true;
776 : }
777 :
778 : /*
779 : * The remaining fields are not set for new columns.
780 : */
781 799052 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attacl - 1] = true;
782 799052 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attfdwoptions - 1] = true;
783 799052 : slot[slotCount]->tts_isnull[Anum_pg_attribute_attmissingval - 1] = true;
784 :
785 799052 : ExecStoreVirtualTuple(slot[slotCount]);
786 799052 : slotCount++;
787 :
788 : /*
789 : * If slots are full or the end of processing has been reached, insert
790 : * a batch of tuples.
791 : */
792 799052 : if (slotCount == nslots || natts == tupdesc->natts - 1)
793 : {
794 : /* fetch index info only when we know we need it */
795 192454 : if (!indstate)
796 : {
797 2650 : indstate = CatalogOpenIndexes(pg_attribute_rel);
798 2650 : close_index = true;
799 : }
800 :
801 : /* insert the new tuples and update the indexes */
802 192454 : CatalogTuplesMultiInsertWithInfo(pg_attribute_rel, slot, slotCount,
803 : indstate);
804 192454 : slotCount = 0;
805 : }
806 :
807 799052 : natts++;
808 : }
809 :
810 196644 : if (close_index)
811 2650 : CatalogCloseIndexes(indstate);
812 992120 : for (int i = 0; i < nslots; i++)
813 795476 : ExecDropSingleTupleTableSlot(slot[i]);
814 196644 : pfree(slot);
815 196644 : }
816 :
817 : /* --------------------------------
818 : * AddNewAttributeTuples
819 : *
820 : * this registers the new relation's schema by adding
821 : * tuples to pg_attribute.
822 : * --------------------------------
823 : */
824 : static void
825 83766 : AddNewAttributeTuples(Oid new_rel_oid,
826 : TupleDesc tupdesc,
827 : char relkind)
828 : {
829 : Relation rel;
830 : CatalogIndexState indstate;
831 83766 : int natts = tupdesc->natts;
832 : ObjectAddress myself,
833 : referenced;
834 :
835 : /*
836 : * open pg_attribute and its indexes.
837 : */
838 83766 : rel = table_open(AttributeRelationId, RowExclusiveLock);
839 :
840 83766 : indstate = CatalogOpenIndexes(rel);
841 :
842 83766 : InsertPgAttributeTuples(rel, tupdesc, new_rel_oid, NULL, indstate);
843 :
844 : /* add dependencies on their datatypes and collations */
845 419284 : for (int i = 0; i < natts; i++)
846 : {
847 335518 : Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
848 :
849 : /* Add dependency info */
850 335518 : ObjectAddressSubSet(myself, RelationRelationId, new_rel_oid, i + 1);
851 335518 : ObjectAddressSet(referenced, TypeRelationId, attr->atttypid);
852 335518 : recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
853 :
854 : /* The default collation is pinned, so don't bother recording it */
855 335518 : if (OidIsValid(attr->attcollation) &&
856 101302 : attr->attcollation != DEFAULT_COLLATION_OID)
857 : {
858 73314 : ObjectAddressSet(referenced, CollationRelationId,
859 : attr->attcollation);
860 73314 : recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
861 : }
862 : }
863 :
864 : /*
865 : * Next we add the system attributes. Skip all for a view or type
866 : * relation. We don't bother with making datatype dependencies here,
867 : * since presumably all these types are pinned.
868 : */
869 83766 : if (relkind != RELKIND_VIEW && relkind != RELKIND_COMPOSITE_TYPE)
870 : {
871 : TupleDesc td;
872 :
873 64364 : td = CreateTupleDesc(lengthof(SysAtt), (FormData_pg_attribute **) &SysAtt);
874 :
875 64364 : InsertPgAttributeTuples(rel, td, new_rel_oid, NULL, indstate);
876 64364 : FreeTupleDesc(td);
877 : }
878 :
879 : /*
880 : * clean up
881 : */
882 83766 : CatalogCloseIndexes(indstate);
883 :
884 83766 : table_close(rel, RowExclusiveLock);
885 83766 : }
886 :
887 : /* --------------------------------
888 : * InsertPgClassTuple
889 : *
890 : * Construct and insert a new tuple in pg_class.
891 : *
892 : * Caller has already opened and locked pg_class.
893 : * Tuple data is taken from new_rel_desc->rd_rel, except for the
894 : * variable-width fields which are not present in a cached reldesc.
895 : * relacl and reloptions are passed in Datum form (to avoid having
896 : * to reference the data types in heap.h). Pass (Datum) 0 to set them
897 : * to NULL.
898 : * --------------------------------
899 : */
900 : void
901 129630 : InsertPgClassTuple(Relation pg_class_desc,
902 : Relation new_rel_desc,
903 : Oid new_rel_oid,
904 : Datum relacl,
905 : Datum reloptions)
906 : {
907 129630 : Form_pg_class rd_rel = new_rel_desc->rd_rel;
908 : Datum values[Natts_pg_class];
909 : bool nulls[Natts_pg_class];
910 : HeapTuple tup;
911 :
912 : /* This is a tad tedious, but way cleaner than what we used to do... */
913 129630 : memset(values, 0, sizeof(values));
914 129630 : memset(nulls, false, sizeof(nulls));
915 :
916 129630 : values[Anum_pg_class_oid - 1] = ObjectIdGetDatum(new_rel_oid);
917 129630 : values[Anum_pg_class_relname - 1] = NameGetDatum(&rd_rel->relname);
918 129630 : values[Anum_pg_class_relnamespace - 1] = ObjectIdGetDatum(rd_rel->relnamespace);
919 129630 : values[Anum_pg_class_reltype - 1] = ObjectIdGetDatum(rd_rel->reltype);
920 129630 : values[Anum_pg_class_reloftype - 1] = ObjectIdGetDatum(rd_rel->reloftype);
921 129630 : values[Anum_pg_class_relowner - 1] = ObjectIdGetDatum(rd_rel->relowner);
922 129630 : values[Anum_pg_class_relam - 1] = ObjectIdGetDatum(rd_rel->relam);
923 129630 : values[Anum_pg_class_relfilenode - 1] = ObjectIdGetDatum(rd_rel->relfilenode);
924 129630 : values[Anum_pg_class_reltablespace - 1] = ObjectIdGetDatum(rd_rel->reltablespace);
925 129630 : values[Anum_pg_class_relpages - 1] = Int32GetDatum(rd_rel->relpages);
926 129630 : values[Anum_pg_class_reltuples - 1] = Float4GetDatum(rd_rel->reltuples);
927 129630 : values[Anum_pg_class_relallvisible - 1] = Int32GetDatum(rd_rel->relallvisible);
928 129630 : values[Anum_pg_class_relallfrozen - 1] = Int32GetDatum(rd_rel->relallfrozen);
929 129630 : values[Anum_pg_class_reltoastrelid - 1] = ObjectIdGetDatum(rd_rel->reltoastrelid);
930 129630 : values[Anum_pg_class_relhasindex - 1] = BoolGetDatum(rd_rel->relhasindex);
931 129630 : values[Anum_pg_class_relisshared - 1] = BoolGetDatum(rd_rel->relisshared);
932 129630 : values[Anum_pg_class_relpersistence - 1] = CharGetDatum(rd_rel->relpersistence);
933 129630 : values[Anum_pg_class_relkind - 1] = CharGetDatum(rd_rel->relkind);
934 129630 : values[Anum_pg_class_relnatts - 1] = Int16GetDatum(rd_rel->relnatts);
935 129630 : values[Anum_pg_class_relchecks - 1] = Int16GetDatum(rd_rel->relchecks);
936 129630 : values[Anum_pg_class_relhasrules - 1] = BoolGetDatum(rd_rel->relhasrules);
937 129630 : values[Anum_pg_class_relhastriggers - 1] = BoolGetDatum(rd_rel->relhastriggers);
938 129630 : values[Anum_pg_class_relrowsecurity - 1] = BoolGetDatum(rd_rel->relrowsecurity);
939 129630 : values[Anum_pg_class_relforcerowsecurity - 1] = BoolGetDatum(rd_rel->relforcerowsecurity);
940 129630 : values[Anum_pg_class_relhassubclass - 1] = BoolGetDatum(rd_rel->relhassubclass);
941 129630 : values[Anum_pg_class_relispopulated - 1] = BoolGetDatum(rd_rel->relispopulated);
942 129630 : values[Anum_pg_class_relreplident - 1] = CharGetDatum(rd_rel->relreplident);
943 129630 : values[Anum_pg_class_relispartition - 1] = BoolGetDatum(rd_rel->relispartition);
944 129630 : values[Anum_pg_class_relrewrite - 1] = ObjectIdGetDatum(rd_rel->relrewrite);
945 129630 : values[Anum_pg_class_relfrozenxid - 1] = TransactionIdGetDatum(rd_rel->relfrozenxid);
946 129630 : values[Anum_pg_class_relminmxid - 1] = MultiXactIdGetDatum(rd_rel->relminmxid);
947 129630 : if (relacl != (Datum) 0)
948 132 : values[Anum_pg_class_relacl - 1] = relacl;
949 : else
950 129498 : nulls[Anum_pg_class_relacl - 1] = true;
951 129630 : if (reloptions != (Datum) 0)
952 1508 : values[Anum_pg_class_reloptions - 1] = reloptions;
953 : else
954 128122 : nulls[Anum_pg_class_reloptions - 1] = true;
955 :
956 : /* relpartbound is set by updating this tuple, if necessary */
957 129630 : nulls[Anum_pg_class_relpartbound - 1] = true;
958 :
959 129630 : tup = heap_form_tuple(RelationGetDescr(pg_class_desc), values, nulls);
960 :
961 : /* finally insert the new tuple, update the indexes, and clean up */
962 129630 : CatalogTupleInsert(pg_class_desc, tup);
963 :
964 129630 : heap_freetuple(tup);
965 129630 : }
966 :
967 : /* --------------------------------
968 : * AddNewRelationTuple
969 : *
970 : * this registers the new relation in the catalogs by
971 : * adding a tuple to pg_class.
972 : * --------------------------------
973 : */
974 : static void
975 83766 : AddNewRelationTuple(Relation pg_class_desc,
976 : Relation new_rel_desc,
977 : Oid new_rel_oid,
978 : Oid new_type_oid,
979 : Oid reloftype,
980 : Oid relowner,
981 : char relkind,
982 : TransactionId relfrozenxid,
983 : TransactionId relminmxid,
984 : Datum relacl,
985 : Datum reloptions)
986 : {
987 : Form_pg_class new_rel_reltup;
988 :
989 : /*
990 : * first we update some of the information in our uncataloged relation's
991 : * relation descriptor.
992 : */
993 83766 : new_rel_reltup = new_rel_desc->rd_rel;
994 :
995 : /* The relation is empty */
996 83766 : new_rel_reltup->relpages = 0;
997 83766 : new_rel_reltup->reltuples = -1;
998 83766 : new_rel_reltup->relallvisible = 0;
999 83766 : new_rel_reltup->relallfrozen = 0;
1000 :
1001 : /* Sequences always have a known size */
1002 83766 : if (relkind == RELKIND_SEQUENCE)
1003 : {
1004 1794 : new_rel_reltup->relpages = 1;
1005 1794 : new_rel_reltup->reltuples = 1;
1006 : }
1007 :
1008 83766 : new_rel_reltup->relfrozenxid = relfrozenxid;
1009 83766 : new_rel_reltup->relminmxid = relminmxid;
1010 83766 : new_rel_reltup->relowner = relowner;
1011 83766 : new_rel_reltup->reltype = new_type_oid;
1012 83766 : new_rel_reltup->reloftype = reloftype;
1013 :
1014 : /* relispartition is always set by updating this tuple later */
1015 83766 : new_rel_reltup->relispartition = false;
1016 :
1017 : /* fill rd_att's type ID with something sane even if reltype is zero */
1018 83766 : new_rel_desc->rd_att->tdtypeid = new_type_oid ? new_type_oid : RECORDOID;
1019 83766 : new_rel_desc->rd_att->tdtypmod = -1;
1020 :
1021 : /* Now build and insert the tuple */
1022 83766 : InsertPgClassTuple(pg_class_desc, new_rel_desc, new_rel_oid,
1023 : relacl, reloptions);
1024 83766 : }
1025 :
1026 :
1027 : /* --------------------------------
1028 : * AddNewRelationType -
1029 : *
1030 : * define a composite type corresponding to the new relation
1031 : * --------------------------------
1032 : */
1033 : static ObjectAddress
1034 65006 : AddNewRelationType(const char *typeName,
1035 : Oid typeNamespace,
1036 : Oid new_rel_oid,
1037 : char new_rel_kind,
1038 : Oid ownerid,
1039 : Oid new_row_type,
1040 : Oid new_array_type)
1041 : {
1042 : return
1043 65006 : TypeCreate(new_row_type, /* optional predetermined OID */
1044 : typeName, /* type name */
1045 : typeNamespace, /* type namespace */
1046 : new_rel_oid, /* relation oid */
1047 : new_rel_kind, /* relation kind */
1048 : ownerid, /* owner's ID */
1049 : -1, /* internal size (varlena) */
1050 : TYPTYPE_COMPOSITE, /* type-type (composite) */
1051 : TYPCATEGORY_COMPOSITE, /* type-category (ditto) */
1052 : false, /* composite types are never preferred */
1053 : DEFAULT_TYPDELIM, /* default array delimiter */
1054 : F_RECORD_IN, /* input procedure */
1055 : F_RECORD_OUT, /* output procedure */
1056 : F_RECORD_RECV, /* receive procedure */
1057 : F_RECORD_SEND, /* send procedure */
1058 : InvalidOid, /* typmodin procedure - none */
1059 : InvalidOid, /* typmodout procedure - none */
1060 : InvalidOid, /* analyze procedure - default */
1061 : InvalidOid, /* subscript procedure - none */
1062 : InvalidOid, /* array element type - irrelevant */
1063 : false, /* this is not an array type */
1064 : new_array_type, /* array type if any */
1065 : InvalidOid, /* domain base type - irrelevant */
1066 : NULL, /* default value - none */
1067 : NULL, /* default binary representation */
1068 : false, /* passed by reference */
1069 : TYPALIGN_DOUBLE, /* alignment - must be the largest! */
1070 : TYPSTORAGE_EXTENDED, /* fully TOASTable */
1071 : -1, /* typmod */
1072 : 0, /* array dimensions for typBaseType */
1073 : false, /* Type NOT NULL */
1074 : InvalidOid); /* rowtypes never have a collation */
1075 : }
1076 :
1077 : /* --------------------------------
1078 : * heap_create_with_catalog
1079 : *
1080 : * creates a new cataloged relation. see comments above.
1081 : *
1082 : * Arguments:
1083 : * relname: name to give to new rel
1084 : * relnamespace: OID of namespace it goes in
1085 : * reltablespace: OID of tablespace it goes in
1086 : * relid: OID to assign to new rel, or InvalidOid to select a new OID
1087 : * reltypeid: OID to assign to rel's rowtype, or InvalidOid to select one
1088 : * reloftypeid: if a typed table, OID of underlying type; else InvalidOid
1089 : * ownerid: OID of new rel's owner
1090 : * accessmtd: OID of new rel's access method
1091 : * tupdesc: tuple descriptor (source of column definitions)
1092 : * cooked_constraints: list of precooked check constraints and defaults
1093 : * relkind: relkind for new rel
1094 : * relpersistence: rel's persistence status (permanent, temp, or unlogged)
1095 : * shared_relation: true if it's to be a shared relation
1096 : * mapped_relation: true if the relation will use the relfilenumber map
1097 : * oncommit: ON COMMIT marking (only relevant if it's a temp table)
1098 : * reloptions: reloptions in Datum form, or (Datum) 0 if none
1099 : * use_user_acl: true if should look for user-defined default permissions;
1100 : * if false, relacl is always set NULL
1101 : * allow_system_table_mods: true to allow creation in system namespaces
1102 : * is_internal: is this a system-generated catalog?
1103 : *
1104 : * Output parameters:
1105 : * typaddress: if not null, gets the object address of the new pg_type entry
1106 : * (this must be null if the relkind is one that doesn't get a pg_type entry)
1107 : *
1108 : * Returns the OID of the new relation
1109 : * --------------------------------
1110 : */
1111 : Oid
1112 83802 : heap_create_with_catalog(const char *relname,
1113 : Oid relnamespace,
1114 : Oid reltablespace,
1115 : Oid relid,
1116 : Oid reltypeid,
1117 : Oid reloftypeid,
1118 : Oid ownerid,
1119 : Oid accessmtd,
1120 : TupleDesc tupdesc,
1121 : List *cooked_constraints,
1122 : char relkind,
1123 : char relpersistence,
1124 : bool shared_relation,
1125 : bool mapped_relation,
1126 : OnCommitAction oncommit,
1127 : Datum reloptions,
1128 : bool use_user_acl,
1129 : bool allow_system_table_mods,
1130 : bool is_internal,
1131 : Oid relrewrite,
1132 : ObjectAddress *typaddress)
1133 : {
1134 : Relation pg_class_desc;
1135 : Relation new_rel_desc;
1136 : Acl *relacl;
1137 : Oid existing_relid;
1138 : Oid old_type_oid;
1139 : Oid new_type_oid;
1140 :
1141 : /* By default set to InvalidOid unless overridden by binary-upgrade */
1142 83802 : RelFileNumber relfilenumber = InvalidRelFileNumber;
1143 : TransactionId relfrozenxid;
1144 : MultiXactId relminmxid;
1145 :
1146 83802 : pg_class_desc = table_open(RelationRelationId, RowExclusiveLock);
1147 :
1148 : /*
1149 : * sanity checks
1150 : */
1151 : Assert(IsNormalProcessingMode() || IsBootstrapProcessingMode());
1152 :
1153 : /*
1154 : * Validate proposed tupdesc for the desired relkind. If
1155 : * allow_system_table_mods is on, allow ANYARRAY to be used; this is a
1156 : * hack to allow creating pg_statistic and cloning it during VACUUM FULL.
1157 : */
1158 83802 : CheckAttributeNamesTypes(tupdesc, relkind,
1159 : allow_system_table_mods ? CHKATYPE_ANYARRAY : 0);
1160 :
1161 : /*
1162 : * This would fail later on anyway, if the relation already exists. But
1163 : * by catching it here we can emit a nicer error message.
1164 : */
1165 83776 : existing_relid = get_relname_relid(relname, relnamespace);
1166 83776 : if (existing_relid != InvalidOid)
1167 2 : ereport(ERROR,
1168 : (errcode(ERRCODE_DUPLICATE_TABLE),
1169 : errmsg("relation \"%s\" already exists", relname)));
1170 :
1171 : /*
1172 : * Since we are going to create a rowtype as well, also check for
1173 : * collision with an existing type name. If there is one and it's an
1174 : * autogenerated array, we can rename it out of the way; otherwise we can
1175 : * at least give a good error message.
1176 : */
1177 83774 : old_type_oid = GetSysCacheOid2(TYPENAMENSP, Anum_pg_type_oid,
1178 : CStringGetDatum(relname),
1179 : ObjectIdGetDatum(relnamespace));
1180 83774 : if (OidIsValid(old_type_oid))
1181 : {
1182 2 : if (!moveArrayTypeName(old_type_oid, relname, relnamespace))
1183 0 : ereport(ERROR,
1184 : (errcode(ERRCODE_DUPLICATE_OBJECT),
1185 : errmsg("type \"%s\" already exists", relname),
1186 : errhint("A relation has an associated type of the same name, "
1187 : "so you must use a name that doesn't conflict "
1188 : "with any existing type.")));
1189 : }
1190 :
1191 : /*
1192 : * Shared relations must be in pg_global (last-ditch check)
1193 : */
1194 83774 : if (shared_relation && reltablespace != GLOBALTABLESPACE_OID)
1195 0 : elog(ERROR, "shared relations must be placed in pg_global tablespace");
1196 :
1197 : /*
1198 : * Allocate an OID for the relation, unless we were told what to use.
1199 : *
1200 : * The OID will be the relfilenumber as well, so make sure it doesn't
1201 : * collide with either pg_class OIDs or existing physical files.
1202 : */
1203 83774 : if (!OidIsValid(relid))
1204 : {
1205 : /* Use binary-upgrade override for pg_class.oid and relfilenumber */
1206 75134 : if (IsBinaryUpgrade)
1207 : {
1208 : /*
1209 : * Indexes are not supported here; they use
1210 : * binary_upgrade_next_index_pg_class_oid.
1211 : */
1212 : Assert(relkind != RELKIND_INDEX);
1213 : Assert(relkind != RELKIND_PARTITIONED_INDEX);
1214 :
1215 2216 : if (relkind == RELKIND_TOASTVALUE)
1216 : {
1217 : /* There might be no TOAST table, so we have to test for it. */
1218 532 : if (OidIsValid(binary_upgrade_next_toast_pg_class_oid))
1219 : {
1220 532 : relid = binary_upgrade_next_toast_pg_class_oid;
1221 532 : binary_upgrade_next_toast_pg_class_oid = InvalidOid;
1222 :
1223 532 : if (!RelFileNumberIsValid(binary_upgrade_next_toast_pg_class_relfilenumber))
1224 0 : ereport(ERROR,
1225 : (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1226 : errmsg("toast relfilenumber value not set when in binary upgrade mode")));
1227 :
1228 532 : relfilenumber = binary_upgrade_next_toast_pg_class_relfilenumber;
1229 532 : binary_upgrade_next_toast_pg_class_relfilenumber = InvalidRelFileNumber;
1230 : }
1231 : }
1232 : else
1233 : {
1234 1684 : if (!OidIsValid(binary_upgrade_next_heap_pg_class_oid))
1235 0 : ereport(ERROR,
1236 : (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1237 : errmsg("pg_class heap OID value not set when in binary upgrade mode")));
1238 :
1239 1684 : relid = binary_upgrade_next_heap_pg_class_oid;
1240 1684 : binary_upgrade_next_heap_pg_class_oid = InvalidOid;
1241 :
1242 1684 : if (RELKIND_HAS_STORAGE(relkind))
1243 : {
1244 1382 : if (!RelFileNumberIsValid(binary_upgrade_next_heap_pg_class_relfilenumber))
1245 0 : ereport(ERROR,
1246 : (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1247 : errmsg("relfilenumber value not set when in binary upgrade mode")));
1248 :
1249 1382 : relfilenumber = binary_upgrade_next_heap_pg_class_relfilenumber;
1250 1382 : binary_upgrade_next_heap_pg_class_relfilenumber = InvalidRelFileNumber;
1251 : }
1252 : }
1253 : }
1254 :
1255 75134 : if (!OidIsValid(relid))
1256 72918 : relid = GetNewRelFileNumber(reltablespace, pg_class_desc,
1257 : relpersistence);
1258 : }
1259 :
1260 : /*
1261 : * Other sessions' catalog scans can't find this until we commit. Hence,
1262 : * it doesn't hurt to hold AccessExclusiveLock. Do it here so callers
1263 : * can't accidentally vary in their lock mode or acquisition timing.
1264 : */
1265 83774 : LockRelationOid(relid, AccessExclusiveLock);
1266 :
1267 : /*
1268 : * Determine the relation's initial permissions.
1269 : */
1270 83774 : if (use_user_acl)
1271 : {
1272 59288 : switch (relkind)
1273 : {
1274 53006 : case RELKIND_RELATION:
1275 : case RELKIND_VIEW:
1276 : case RELKIND_MATVIEW:
1277 : case RELKIND_FOREIGN_TABLE:
1278 : case RELKIND_PARTITIONED_TABLE:
1279 53006 : relacl = get_user_default_acl(OBJECT_TABLE, ownerid,
1280 : relnamespace);
1281 53006 : break;
1282 1794 : case RELKIND_SEQUENCE:
1283 1794 : relacl = get_user_default_acl(OBJECT_SEQUENCE, ownerid,
1284 : relnamespace);
1285 1794 : break;
1286 4488 : default:
1287 4488 : relacl = NULL;
1288 4488 : break;
1289 : }
1290 : }
1291 : else
1292 24486 : relacl = NULL;
1293 :
1294 : /*
1295 : * Create the relcache entry (mostly dummy at this point) and the physical
1296 : * disk file. (If we fail further down, it's the smgr's responsibility to
1297 : * remove the disk file again.)
1298 : *
1299 : * NB: Note that passing create_storage = true is correct even for binary
1300 : * upgrade. The storage we create here will be replaced later, but we
1301 : * need to have something on disk in the meanwhile.
1302 : */
1303 83774 : new_rel_desc = heap_create(relname,
1304 : relnamespace,
1305 : reltablespace,
1306 : relid,
1307 : relfilenumber,
1308 : accessmtd,
1309 : tupdesc,
1310 : relkind,
1311 : relpersistence,
1312 : shared_relation,
1313 : mapped_relation,
1314 : allow_system_table_mods,
1315 : &relfrozenxid,
1316 : &relminmxid,
1317 : true);
1318 :
1319 : Assert(relid == RelationGetRelid(new_rel_desc));
1320 :
1321 83766 : new_rel_desc->rd_rel->relrewrite = relrewrite;
1322 :
1323 : /*
1324 : * Decide whether to create a pg_type entry for the relation's rowtype.
1325 : * These types are made except where the use of a relation as such is an
1326 : * implementation detail: toast tables, sequences and indexes.
1327 : */
1328 148772 : if (!(relkind == RELKIND_SEQUENCE ||
1329 65006 : relkind == RELKIND_TOASTVALUE ||
1330 : relkind == RELKIND_INDEX ||
1331 : relkind == RELKIND_PARTITIONED_INDEX))
1332 65006 : {
1333 : Oid new_array_oid;
1334 : ObjectAddress new_type_addr;
1335 : char *relarrayname;
1336 :
1337 : /*
1338 : * We'll make an array over the composite type, too. For largely
1339 : * historical reasons, the array type's OID is assigned first.
1340 : */
1341 65006 : new_array_oid = AssignTypeArrayOid();
1342 :
1343 : /*
1344 : * Make the pg_type entry for the composite type. The OID of the
1345 : * composite type can be preselected by the caller, but if reltypeid
1346 : * is InvalidOid, we'll generate a new OID for it.
1347 : *
1348 : * NOTE: we could get a unique-index failure here, in case someone
1349 : * else is creating the same type name in parallel but hadn't
1350 : * committed yet when we checked for a duplicate name above.
1351 : */
1352 65006 : new_type_addr = AddNewRelationType(relname,
1353 : relnamespace,
1354 : relid,
1355 : relkind,
1356 : ownerid,
1357 : reltypeid,
1358 : new_array_oid);
1359 65006 : new_type_oid = new_type_addr.objectId;
1360 65006 : if (typaddress)
1361 4488 : *typaddress = new_type_addr;
1362 :
1363 : /* Now create the array type. */
1364 65006 : relarrayname = makeArrayTypeName(relname, relnamespace);
1365 :
1366 65006 : TypeCreate(new_array_oid, /* force the type's OID to this */
1367 : relarrayname, /* Array type name */
1368 : relnamespace, /* Same namespace as parent */
1369 : InvalidOid, /* Not composite, no relationOid */
1370 : 0, /* relkind, also N/A here */
1371 : ownerid, /* owner's ID */
1372 : -1, /* Internal size (varlena) */
1373 : TYPTYPE_BASE, /* Not composite - typelem is */
1374 : TYPCATEGORY_ARRAY, /* type-category (array) */
1375 : false, /* array types are never preferred */
1376 : DEFAULT_TYPDELIM, /* default array delimiter */
1377 : F_ARRAY_IN, /* array input proc */
1378 : F_ARRAY_OUT, /* array output proc */
1379 : F_ARRAY_RECV, /* array recv (bin) proc */
1380 : F_ARRAY_SEND, /* array send (bin) proc */
1381 : InvalidOid, /* typmodin procedure - none */
1382 : InvalidOid, /* typmodout procedure - none */
1383 : F_ARRAY_TYPANALYZE, /* array analyze procedure */
1384 : F_ARRAY_SUBSCRIPT_HANDLER, /* array subscript procedure */
1385 : new_type_oid, /* array element type - the rowtype */
1386 : true, /* yes, this is an array type */
1387 : InvalidOid, /* this has no array type */
1388 : InvalidOid, /* domain base type - irrelevant */
1389 : NULL, /* default value - none */
1390 : NULL, /* default binary representation */
1391 : false, /* passed by reference */
1392 : TYPALIGN_DOUBLE, /* alignment - must be the largest! */
1393 : TYPSTORAGE_EXTENDED, /* fully TOASTable */
1394 : -1, /* typmod */
1395 : 0, /* array dimensions for typBaseType */
1396 : false, /* Type NOT NULL */
1397 : InvalidOid); /* rowtypes never have a collation */
1398 :
1399 65006 : pfree(relarrayname);
1400 : }
1401 : else
1402 : {
1403 : /* Caller should not be expecting a type to be created. */
1404 : Assert(reltypeid == InvalidOid);
1405 : Assert(typaddress == NULL);
1406 :
1407 18760 : new_type_oid = InvalidOid;
1408 : }
1409 :
1410 : /*
1411 : * now create an entry in pg_class for the relation.
1412 : *
1413 : * NOTE: we could get a unique-index failure here, in case someone else is
1414 : * creating the same relation name in parallel but hadn't committed yet
1415 : * when we checked for a duplicate name above.
1416 : */
1417 83766 : AddNewRelationTuple(pg_class_desc,
1418 : new_rel_desc,
1419 : relid,
1420 : new_type_oid,
1421 : reloftypeid,
1422 : ownerid,
1423 : relkind,
1424 : relfrozenxid,
1425 : relminmxid,
1426 : PointerGetDatum(relacl),
1427 : reloptions);
1428 :
1429 : /*
1430 : * now add tuples to pg_attribute for the attributes in our new relation.
1431 : */
1432 83766 : AddNewAttributeTuples(relid, new_rel_desc->rd_att, relkind);
1433 :
1434 : /*
1435 : * Make a dependency link to force the relation to be deleted if its
1436 : * namespace is. Also make a dependency link to its owner, as well as
1437 : * dependencies for any roles mentioned in the default ACL.
1438 : *
1439 : * For composite types, these dependencies are tracked for the pg_type
1440 : * entry, so we needn't record them here. Likewise, TOAST tables don't
1441 : * need a namespace dependency (they live in a pinned namespace) nor an
1442 : * owner dependency (they depend indirectly through the parent table), nor
1443 : * should they have any ACL entries. The same applies for extension
1444 : * dependencies.
1445 : *
1446 : * Also, skip this in bootstrap mode, since we don't make dependencies
1447 : * while bootstrapping.
1448 : */
1449 83766 : if (relkind != RELKIND_COMPOSITE_TYPE &&
1450 62312 : relkind != RELKIND_TOASTVALUE &&
1451 62312 : !IsBootstrapProcessingMode())
1452 : {
1453 : ObjectAddress myself,
1454 : referenced;
1455 : ObjectAddresses *addrs;
1456 :
1457 56912 : ObjectAddressSet(myself, RelationRelationId, relid);
1458 :
1459 56912 : recordDependencyOnOwner(RelationRelationId, relid, ownerid);
1460 :
1461 56912 : recordDependencyOnNewAcl(RelationRelationId, relid, 0, ownerid, relacl);
1462 :
1463 56912 : recordDependencyOnCurrentExtension(&myself, false);
1464 :
1465 56912 : addrs = new_object_addresses();
1466 :
1467 56912 : ObjectAddressSet(referenced, NamespaceRelationId, relnamespace);
1468 56912 : add_exact_object_address(&referenced, addrs);
1469 :
1470 56912 : if (reloftypeid)
1471 : {
1472 68 : ObjectAddressSet(referenced, TypeRelationId, reloftypeid);
1473 68 : add_exact_object_address(&referenced, addrs);
1474 : }
1475 :
1476 : /*
1477 : * Make a dependency link to force the relation to be deleted if its
1478 : * access method is.
1479 : *
1480 : * No need to add an explicit dependency for the toast table, as the
1481 : * main table depends on it. Partitioned tables may not have an
1482 : * access method set.
1483 : */
1484 56912 : if ((RELKIND_HAS_TABLE_AM(relkind) && relkind != RELKIND_TOASTVALUE) ||
1485 4874 : (relkind == RELKIND_PARTITIONED_TABLE && OidIsValid(accessmtd)))
1486 : {
1487 34896 : ObjectAddressSet(referenced, AccessMethodRelationId, accessmtd);
1488 34896 : add_exact_object_address(&referenced, addrs);
1489 : }
1490 :
1491 56912 : record_object_address_dependencies(&myself, addrs, DEPENDENCY_NORMAL);
1492 56912 : free_object_addresses(addrs);
1493 : }
1494 :
1495 : /* Post creation hook for new relation */
1496 83766 : InvokeObjectPostCreateHookArg(RelationRelationId, relid, 0, is_internal);
1497 :
1498 : /*
1499 : * Store any supplied CHECK constraints and defaults.
1500 : *
1501 : * NB: this may do a CommandCounterIncrement and rebuild the relcache
1502 : * entry, so the relation must be valid and self-consistent at this point.
1503 : * In particular, there are not yet constraints and defaults anywhere.
1504 : */
1505 83766 : StoreConstraints(new_rel_desc, cooked_constraints, is_internal);
1506 :
1507 : /*
1508 : * If there's a special on-commit action, remember it
1509 : */
1510 83766 : if (oncommit != ONCOMMIT_NOOP)
1511 170 : register_on_commit_action(relid, oncommit);
1512 :
1513 : /*
1514 : * ok, the relation has been cataloged, so close our relations and return
1515 : * the OID of the newly created relation.
1516 : */
1517 83766 : table_close(new_rel_desc, NoLock); /* do not unlock till end of xact */
1518 83766 : table_close(pg_class_desc, RowExclusiveLock);
1519 :
1520 83766 : return relid;
1521 : }
1522 :
1523 : /*
1524 : * RelationRemoveInheritance
1525 : *
1526 : * Formerly, this routine checked for child relations and aborted the
1527 : * deletion if any were found. Now we rely on the dependency mechanism
1528 : * to check for or delete child relations. By the time we get here,
1529 : * there are no children and we need only remove any pg_inherits rows
1530 : * linking this relation to its parent(s).
1531 : */
1532 : static void
1533 47494 : RelationRemoveInheritance(Oid relid)
1534 : {
1535 : Relation catalogRelation;
1536 : SysScanDesc scan;
1537 : ScanKeyData key;
1538 : HeapTuple tuple;
1539 :
1540 47494 : catalogRelation = table_open(InheritsRelationId, RowExclusiveLock);
1541 :
1542 47494 : ScanKeyInit(&key,
1543 : Anum_pg_inherits_inhrelid,
1544 : BTEqualStrategyNumber, F_OIDEQ,
1545 : ObjectIdGetDatum(relid));
1546 :
1547 47494 : scan = systable_beginscan(catalogRelation, InheritsRelidSeqnoIndexId, true,
1548 : NULL, 1, &key);
1549 :
1550 56238 : while (HeapTupleIsValid(tuple = systable_getnext(scan)))
1551 8744 : CatalogTupleDelete(catalogRelation, &tuple->t_self);
1552 :
1553 47494 : systable_endscan(scan);
1554 47494 : table_close(catalogRelation, RowExclusiveLock);
1555 47494 : }
1556 :
1557 : /*
1558 : * DeleteRelationTuple
1559 : *
1560 : * Remove pg_class row for the given relid.
1561 : *
1562 : * Note: this is shared by relation deletion and index deletion. It's
1563 : * not intended for use anyplace else.
1564 : */
1565 : void
1566 71116 : DeleteRelationTuple(Oid relid)
1567 : {
1568 : Relation pg_class_desc;
1569 : HeapTuple tup;
1570 :
1571 : /* Grab an appropriate lock on the pg_class relation */
1572 71116 : pg_class_desc = table_open(RelationRelationId, RowExclusiveLock);
1573 :
1574 71116 : tup = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
1575 71116 : if (!HeapTupleIsValid(tup))
1576 0 : elog(ERROR, "cache lookup failed for relation %u", relid);
1577 :
1578 : /* delete the relation tuple from pg_class, and finish up */
1579 71116 : CatalogTupleDelete(pg_class_desc, &tup->t_self);
1580 :
1581 71116 : ReleaseSysCache(tup);
1582 :
1583 71116 : table_close(pg_class_desc, RowExclusiveLock);
1584 71116 : }
1585 :
1586 : /*
1587 : * DeleteAttributeTuples
1588 : *
1589 : * Remove pg_attribute rows for the given relid.
1590 : *
1591 : * Note: this is shared by relation deletion and index deletion. It's
1592 : * not intended for use anyplace else.
1593 : */
1594 : void
1595 71116 : DeleteAttributeTuples(Oid relid)
1596 : {
1597 : Relation attrel;
1598 : SysScanDesc scan;
1599 : ScanKeyData key[1];
1600 : HeapTuple atttup;
1601 :
1602 : /* Grab an appropriate lock on the pg_attribute relation */
1603 71116 : attrel = table_open(AttributeRelationId, RowExclusiveLock);
1604 :
1605 : /* Use the index to scan only attributes of the target relation */
1606 71116 : ScanKeyInit(&key[0],
1607 : Anum_pg_attribute_attrelid,
1608 : BTEqualStrategyNumber, F_OIDEQ,
1609 : ObjectIdGetDatum(relid));
1610 :
1611 71116 : scan = systable_beginscan(attrel, AttributeRelidNumIndexId, true,
1612 : NULL, 1, key);
1613 :
1614 : /* Delete all the matching tuples */
1615 462958 : while ((atttup = systable_getnext(scan)) != NULL)
1616 391842 : CatalogTupleDelete(attrel, &atttup->t_self);
1617 :
1618 : /* Clean up after the scan */
1619 71116 : systable_endscan(scan);
1620 71116 : table_close(attrel, RowExclusiveLock);
1621 71116 : }
1622 :
1623 : /*
1624 : * DeleteSystemAttributeTuples
1625 : *
1626 : * Remove pg_attribute rows for system columns of the given relid.
1627 : *
1628 : * Note: this is only used when converting a table to a view. Views don't
1629 : * have system columns, so we should remove them from pg_attribute.
1630 : */
1631 : void
1632 0 : DeleteSystemAttributeTuples(Oid relid)
1633 : {
1634 : Relation attrel;
1635 : SysScanDesc scan;
1636 : ScanKeyData key[2];
1637 : HeapTuple atttup;
1638 :
1639 : /* Grab an appropriate lock on the pg_attribute relation */
1640 0 : attrel = table_open(AttributeRelationId, RowExclusiveLock);
1641 :
1642 : /* Use the index to scan only system attributes of the target relation */
1643 0 : ScanKeyInit(&key[0],
1644 : Anum_pg_attribute_attrelid,
1645 : BTEqualStrategyNumber, F_OIDEQ,
1646 : ObjectIdGetDatum(relid));
1647 0 : ScanKeyInit(&key[1],
1648 : Anum_pg_attribute_attnum,
1649 : BTLessEqualStrategyNumber, F_INT2LE,
1650 : Int16GetDatum(0));
1651 :
1652 0 : scan = systable_beginscan(attrel, AttributeRelidNumIndexId, true,
1653 : NULL, 2, key);
1654 :
1655 : /* Delete all the matching tuples */
1656 0 : while ((atttup = systable_getnext(scan)) != NULL)
1657 0 : CatalogTupleDelete(attrel, &atttup->t_self);
1658 :
1659 : /* Clean up after the scan */
1660 0 : systable_endscan(scan);
1661 0 : table_close(attrel, RowExclusiveLock);
1662 0 : }
1663 :
1664 : /*
1665 : * RemoveAttributeById
1666 : *
1667 : * This is the guts of ALTER TABLE DROP COLUMN: actually mark the attribute
1668 : * deleted in pg_attribute. We also remove pg_statistic entries for it.
1669 : * (Everything else needed, such as getting rid of any pg_attrdef entry,
1670 : * is handled by dependency.c.)
1671 : */
1672 : void
1673 2066 : RemoveAttributeById(Oid relid, AttrNumber attnum)
1674 : {
1675 : Relation rel;
1676 : Relation attr_rel;
1677 : HeapTuple tuple;
1678 : Form_pg_attribute attStruct;
1679 : char newattname[NAMEDATALEN];
1680 2066 : Datum valuesAtt[Natts_pg_attribute] = {0};
1681 2066 : bool nullsAtt[Natts_pg_attribute] = {0};
1682 2066 : bool replacesAtt[Natts_pg_attribute] = {0};
1683 :
1684 : /*
1685 : * Grab an exclusive lock on the target table, which we will NOT release
1686 : * until end of transaction. (In the simple case where we are directly
1687 : * dropping this column, ATExecDropColumn already did this ... but when
1688 : * cascading from a drop of some other object, we may not have any lock.)
1689 : */
1690 2066 : rel = relation_open(relid, AccessExclusiveLock);
1691 :
1692 2066 : attr_rel = table_open(AttributeRelationId, RowExclusiveLock);
1693 :
1694 2066 : tuple = SearchSysCacheCopy2(ATTNUM,
1695 : ObjectIdGetDatum(relid),
1696 : Int16GetDatum(attnum));
1697 2066 : if (!HeapTupleIsValid(tuple)) /* shouldn't happen */
1698 0 : elog(ERROR, "cache lookup failed for attribute %d of relation %u",
1699 : attnum, relid);
1700 2066 : attStruct = (Form_pg_attribute) GETSTRUCT(tuple);
1701 :
1702 : /* Mark the attribute as dropped */
1703 2066 : attStruct->attisdropped = true;
1704 :
1705 : /*
1706 : * Set the type OID to invalid. A dropped attribute's type link cannot be
1707 : * relied on (once the attribute is dropped, the type might be too).
1708 : * Fortunately we do not need the type row --- the only really essential
1709 : * information is the type's typlen and typalign, which are preserved in
1710 : * the attribute's attlen and attalign. We set atttypid to zero here as a
1711 : * means of catching code that incorrectly expects it to be valid.
1712 : */
1713 2066 : attStruct->atttypid = InvalidOid;
1714 :
1715 : /* Remove any not-null constraint the column may have */
1716 2066 : attStruct->attnotnull = false;
1717 :
1718 : /* Unset this so no one tries to look up the generation expression */
1719 2066 : attStruct->attgenerated = '\0';
1720 :
1721 : /*
1722 : * Change the column name to something that isn't likely to conflict
1723 : */
1724 2066 : snprintf(newattname, sizeof(newattname),
1725 : "........pg.dropped.%d........", attnum);
1726 2066 : namestrcpy(&(attStruct->attname), newattname);
1727 :
1728 : /* Clear the missing value */
1729 2066 : attStruct->atthasmissing = false;
1730 2066 : nullsAtt[Anum_pg_attribute_attmissingval - 1] = true;
1731 2066 : replacesAtt[Anum_pg_attribute_attmissingval - 1] = true;
1732 :
1733 : /*
1734 : * Clear the other nullable fields. This saves some space in pg_attribute
1735 : * and removes no longer useful information.
1736 : */
1737 2066 : nullsAtt[Anum_pg_attribute_attstattarget - 1] = true;
1738 2066 : replacesAtt[Anum_pg_attribute_attstattarget - 1] = true;
1739 2066 : nullsAtt[Anum_pg_attribute_attacl - 1] = true;
1740 2066 : replacesAtt[Anum_pg_attribute_attacl - 1] = true;
1741 2066 : nullsAtt[Anum_pg_attribute_attoptions - 1] = true;
1742 2066 : replacesAtt[Anum_pg_attribute_attoptions - 1] = true;
1743 2066 : nullsAtt[Anum_pg_attribute_attfdwoptions - 1] = true;
1744 2066 : replacesAtt[Anum_pg_attribute_attfdwoptions - 1] = true;
1745 :
1746 2066 : tuple = heap_modify_tuple(tuple, RelationGetDescr(attr_rel),
1747 : valuesAtt, nullsAtt, replacesAtt);
1748 :
1749 2066 : CatalogTupleUpdate(attr_rel, &tuple->t_self, tuple);
1750 :
1751 : /*
1752 : * Because updating the pg_attribute row will trigger a relcache flush for
1753 : * the target relation, we need not do anything else to notify other
1754 : * backends of the change.
1755 : */
1756 :
1757 2066 : table_close(attr_rel, RowExclusiveLock);
1758 :
1759 2066 : RemoveStatistics(relid, attnum);
1760 :
1761 2066 : relation_close(rel, NoLock);
1762 2066 : }
1763 :
1764 : /*
1765 : * heap_drop_with_catalog - removes specified relation from catalogs
1766 : *
1767 : * Note that this routine is not responsible for dropping objects that are
1768 : * linked to the pg_class entry via dependencies (for example, indexes and
1769 : * constraints). Those are deleted by the dependency-tracing logic in
1770 : * dependency.c before control gets here. In general, therefore, this routine
1771 : * should never be called directly; go through performDeletion() instead.
1772 : */
1773 : void
1774 47500 : heap_drop_with_catalog(Oid relid)
1775 : {
1776 : Relation rel;
1777 : HeapTuple tuple;
1778 47500 : Oid parentOid = InvalidOid,
1779 47500 : defaultPartOid = InvalidOid;
1780 :
1781 : /*
1782 : * To drop a partition safely, we must grab exclusive lock on its parent,
1783 : * because another backend might be about to execute a query on the parent
1784 : * table. If it relies on previously cached partition descriptor, then it
1785 : * could attempt to access the just-dropped relation as its partition. We
1786 : * must therefore take a table lock strong enough to prevent all queries
1787 : * on the table from proceeding until we commit and send out a
1788 : * shared-cache-inval notice that will make them update their partition
1789 : * descriptors.
1790 : */
1791 47500 : tuple = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
1792 47500 : if (!HeapTupleIsValid(tuple))
1793 0 : elog(ERROR, "cache lookup failed for relation %u", relid);
1794 47500 : if (((Form_pg_class) GETSTRUCT(tuple))->relispartition)
1795 : {
1796 : /*
1797 : * We have to lock the parent if the partition is being detached,
1798 : * because it's possible that some query still has a partition
1799 : * descriptor that includes this partition.
1800 : */
1801 6944 : parentOid = get_partition_parent(relid, true);
1802 6944 : LockRelationOid(parentOid, AccessExclusiveLock);
1803 :
1804 : /*
1805 : * If this is not the default partition, dropping it will change the
1806 : * default partition's partition constraint, so we must lock it.
1807 : */
1808 6944 : defaultPartOid = get_default_partition_oid(parentOid);
1809 6944 : if (OidIsValid(defaultPartOid) && relid != defaultPartOid)
1810 374 : LockRelationOid(defaultPartOid, AccessExclusiveLock);
1811 : }
1812 :
1813 47500 : ReleaseSysCache(tuple);
1814 :
1815 : /*
1816 : * Open and lock the relation.
1817 : */
1818 47500 : rel = relation_open(relid, AccessExclusiveLock);
1819 :
1820 : /*
1821 : * There can no longer be anyone *else* touching the relation, but we
1822 : * might still have open queries or cursors, or pending trigger events, in
1823 : * our own session.
1824 : */
1825 47500 : CheckTableNotInUse(rel, "DROP TABLE");
1826 :
1827 : /*
1828 : * This effectively deletes all rows in the table, and may be done in a
1829 : * serializable transaction. In that case we must record a rw-conflict in
1830 : * to this transaction from each transaction holding a predicate lock on
1831 : * the table.
1832 : */
1833 47494 : CheckTableForSerializableConflictIn(rel);
1834 :
1835 : /*
1836 : * Delete pg_foreign_table tuple first.
1837 : */
1838 47494 : if (rel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
1839 : {
1840 : Relation ftrel;
1841 : HeapTuple fttuple;
1842 :
1843 244 : ftrel = table_open(ForeignTableRelationId, RowExclusiveLock);
1844 :
1845 244 : fttuple = SearchSysCache1(FOREIGNTABLEREL, ObjectIdGetDatum(relid));
1846 244 : if (!HeapTupleIsValid(fttuple))
1847 0 : elog(ERROR, "cache lookup failed for foreign table %u", relid);
1848 :
1849 244 : CatalogTupleDelete(ftrel, &fttuple->t_self);
1850 :
1851 244 : ReleaseSysCache(fttuple);
1852 244 : table_close(ftrel, RowExclusiveLock);
1853 : }
1854 :
1855 : /*
1856 : * If a partitioned table, delete the pg_partitioned_table tuple.
1857 : */
1858 47494 : if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
1859 3806 : RemovePartitionKeyByRelId(relid);
1860 :
1861 : /*
1862 : * If the relation being dropped is the default partition itself,
1863 : * invalidate its entry in pg_partitioned_table.
1864 : */
1865 47494 : if (relid == defaultPartOid)
1866 410 : update_default_partition_oid(parentOid, InvalidOid);
1867 :
1868 : /*
1869 : * Schedule unlinking of the relation's physical files at commit.
1870 : */
1871 47494 : if (RELKIND_HAS_STORAGE(rel->rd_rel->relkind))
1872 37106 : RelationDropStorage(rel);
1873 :
1874 : /* ensure that stats are dropped if transaction commits */
1875 47494 : pgstat_drop_relation(rel);
1876 :
1877 : /*
1878 : * Close relcache entry, but *keep* AccessExclusiveLock on the relation
1879 : * until transaction commit. This ensures no one else will try to do
1880 : * something with the doomed relation.
1881 : */
1882 47494 : relation_close(rel, NoLock);
1883 :
1884 : /*
1885 : * Remove any associated relation synchronization states.
1886 : */
1887 47494 : RemoveSubscriptionRel(InvalidOid, relid);
1888 :
1889 : /*
1890 : * Forget any ON COMMIT action for the rel
1891 : */
1892 47494 : remove_on_commit_action(relid);
1893 :
1894 : /*
1895 : * Flush the relation from the relcache. We want to do this before
1896 : * starting to remove catalog entries, just to be certain that no relcache
1897 : * entry rebuild will happen partway through. (That should not really
1898 : * matter, since we don't do CommandCounterIncrement here, but let's be
1899 : * safe.)
1900 : */
1901 47494 : RelationForgetRelation(relid);
1902 :
1903 : /*
1904 : * remove inheritance information
1905 : */
1906 47494 : RelationRemoveInheritance(relid);
1907 :
1908 : /*
1909 : * delete statistics
1910 : */
1911 47494 : RemoveStatistics(relid, 0);
1912 :
1913 : /*
1914 : * delete attribute tuples
1915 : */
1916 47494 : DeleteAttributeTuples(relid);
1917 :
1918 : /*
1919 : * delete relation tuple
1920 : */
1921 47494 : DeleteRelationTuple(relid);
1922 :
1923 47494 : if (OidIsValid(parentOid))
1924 : {
1925 : /*
1926 : * If this is not the default partition, the partition constraint of
1927 : * the default partition has changed to include the portion of the key
1928 : * space previously covered by the dropped partition.
1929 : */
1930 6944 : if (OidIsValid(defaultPartOid) && relid != defaultPartOid)
1931 374 : CacheInvalidateRelcacheByRelid(defaultPartOid);
1932 :
1933 : /*
1934 : * Invalidate the parent's relcache so that the partition is no longer
1935 : * included in its partition descriptor.
1936 : */
1937 6944 : CacheInvalidateRelcacheByRelid(parentOid);
1938 : /* keep the lock */
1939 : }
1940 47494 : }
1941 :
1942 :
1943 : /*
1944 : * RelationClearMissing
1945 : *
1946 : * Set atthasmissing and attmissingval to false/null for all attributes
1947 : * where they are currently set. This can be safely and usefully done if
1948 : * the table is rewritten (e.g. by VACUUM FULL or CLUSTER) where we know there
1949 : * are no rows left with less than a full complement of attributes.
1950 : *
1951 : * The caller must have an AccessExclusive lock on the relation.
1952 : */
1953 : void
1954 2548 : RelationClearMissing(Relation rel)
1955 : {
1956 : Relation attr_rel;
1957 2548 : Oid relid = RelationGetRelid(rel);
1958 2548 : int natts = RelationGetNumberOfAttributes(rel);
1959 : int attnum;
1960 : Datum repl_val[Natts_pg_attribute];
1961 : bool repl_null[Natts_pg_attribute];
1962 : bool repl_repl[Natts_pg_attribute];
1963 : Form_pg_attribute attrtuple;
1964 : HeapTuple tuple,
1965 : newtuple;
1966 :
1967 2548 : memset(repl_val, 0, sizeof(repl_val));
1968 2548 : memset(repl_null, false, sizeof(repl_null));
1969 2548 : memset(repl_repl, false, sizeof(repl_repl));
1970 :
1971 2548 : repl_val[Anum_pg_attribute_atthasmissing - 1] = BoolGetDatum(false);
1972 2548 : repl_null[Anum_pg_attribute_attmissingval - 1] = true;
1973 :
1974 2548 : repl_repl[Anum_pg_attribute_atthasmissing - 1] = true;
1975 2548 : repl_repl[Anum_pg_attribute_attmissingval - 1] = true;
1976 :
1977 :
1978 : /* Get a lock on pg_attribute */
1979 2548 : attr_rel = table_open(AttributeRelationId, RowExclusiveLock);
1980 :
1981 : /* process each non-system attribute, including any dropped columns */
1982 9428 : for (attnum = 1; attnum <= natts; attnum++)
1983 : {
1984 6880 : tuple = SearchSysCache2(ATTNUM,
1985 : ObjectIdGetDatum(relid),
1986 : Int16GetDatum(attnum));
1987 6880 : if (!HeapTupleIsValid(tuple)) /* shouldn't happen */
1988 0 : elog(ERROR, "cache lookup failed for attribute %d of relation %u",
1989 : attnum, relid);
1990 :
1991 6880 : attrtuple = (Form_pg_attribute) GETSTRUCT(tuple);
1992 :
1993 : /* ignore any where atthasmissing is not true */
1994 6880 : if (attrtuple->atthasmissing)
1995 : {
1996 120 : newtuple = heap_modify_tuple(tuple, RelationGetDescr(attr_rel),
1997 : repl_val, repl_null, repl_repl);
1998 :
1999 120 : CatalogTupleUpdate(attr_rel, &newtuple->t_self, newtuple);
2000 :
2001 120 : heap_freetuple(newtuple);
2002 : }
2003 :
2004 6880 : ReleaseSysCache(tuple);
2005 : }
2006 :
2007 : /*
2008 : * Our update of the pg_attribute rows will force a relcache rebuild, so
2009 : * there's nothing else to do here.
2010 : */
2011 2548 : table_close(attr_rel, RowExclusiveLock);
2012 2548 : }
2013 :
2014 : /*
2015 : * StoreAttrMissingVal
2016 : *
2017 : * Set the missing value of a single attribute.
2018 : */
2019 : void
2020 478 : StoreAttrMissingVal(Relation rel, AttrNumber attnum, Datum missingval)
2021 : {
2022 478 : Datum valuesAtt[Natts_pg_attribute] = {0};
2023 478 : bool nullsAtt[Natts_pg_attribute] = {0};
2024 478 : bool replacesAtt[Natts_pg_attribute] = {0};
2025 : Relation attrrel;
2026 : Form_pg_attribute attStruct;
2027 : HeapTuple atttup,
2028 : newtup;
2029 :
2030 : /* This is only supported for plain tables */
2031 : Assert(rel->rd_rel->relkind == RELKIND_RELATION);
2032 :
2033 : /* Fetch the pg_attribute row */
2034 478 : attrrel = table_open(AttributeRelationId, RowExclusiveLock);
2035 :
2036 478 : atttup = SearchSysCache2(ATTNUM,
2037 : ObjectIdGetDatum(RelationGetRelid(rel)),
2038 : Int16GetDatum(attnum));
2039 478 : if (!HeapTupleIsValid(atttup)) /* shouldn't happen */
2040 0 : elog(ERROR, "cache lookup failed for attribute %d of relation %u",
2041 : attnum, RelationGetRelid(rel));
2042 478 : attStruct = (Form_pg_attribute) GETSTRUCT(atttup);
2043 :
2044 : /* Make a one-element array containing the value */
2045 478 : missingval = PointerGetDatum(construct_array(&missingval,
2046 : 1,
2047 : attStruct->atttypid,
2048 478 : attStruct->attlen,
2049 478 : attStruct->attbyval,
2050 478 : attStruct->attalign));
2051 :
2052 : /* Update the pg_attribute row */
2053 478 : valuesAtt[Anum_pg_attribute_atthasmissing - 1] = BoolGetDatum(true);
2054 478 : replacesAtt[Anum_pg_attribute_atthasmissing - 1] = true;
2055 :
2056 478 : valuesAtt[Anum_pg_attribute_attmissingval - 1] = missingval;
2057 478 : replacesAtt[Anum_pg_attribute_attmissingval - 1] = true;
2058 :
2059 478 : newtup = heap_modify_tuple(atttup, RelationGetDescr(attrrel),
2060 : valuesAtt, nullsAtt, replacesAtt);
2061 478 : CatalogTupleUpdate(attrrel, &newtup->t_self, newtup);
2062 :
2063 : /* clean up */
2064 478 : ReleaseSysCache(atttup);
2065 478 : table_close(attrrel, RowExclusiveLock);
2066 478 : }
2067 :
2068 : /*
2069 : * SetAttrMissing
2070 : *
2071 : * Set the missing value of a single attribute. This should only be used by
2072 : * binary upgrade. Takes an AccessExclusive lock on the relation owning the
2073 : * attribute.
2074 : */
2075 : void
2076 4 : SetAttrMissing(Oid relid, char *attname, char *value)
2077 : {
2078 4 : Datum valuesAtt[Natts_pg_attribute] = {0};
2079 4 : bool nullsAtt[Natts_pg_attribute] = {0};
2080 4 : bool replacesAtt[Natts_pg_attribute] = {0};
2081 : Datum missingval;
2082 : Form_pg_attribute attStruct;
2083 : Relation attrrel,
2084 : tablerel;
2085 : HeapTuple atttup,
2086 : newtup;
2087 :
2088 : /* lock the table the attribute belongs to */
2089 4 : tablerel = table_open(relid, AccessExclusiveLock);
2090 :
2091 : /* Don't do anything unless it's a plain table */
2092 4 : if (tablerel->rd_rel->relkind != RELKIND_RELATION)
2093 : {
2094 0 : table_close(tablerel, AccessExclusiveLock);
2095 0 : return;
2096 : }
2097 :
2098 : /* Lock the attribute row and get the data */
2099 4 : attrrel = table_open(AttributeRelationId, RowExclusiveLock);
2100 4 : atttup = SearchSysCacheAttName(relid, attname);
2101 4 : if (!HeapTupleIsValid(atttup))
2102 0 : elog(ERROR, "cache lookup failed for attribute %s of relation %u",
2103 : attname, relid);
2104 4 : attStruct = (Form_pg_attribute) GETSTRUCT(atttup);
2105 :
2106 : /* get an array value from the value string */
2107 4 : missingval = OidFunctionCall3(F_ARRAY_IN,
2108 : CStringGetDatum(value),
2109 : ObjectIdGetDatum(attStruct->atttypid),
2110 : Int32GetDatum(attStruct->atttypmod));
2111 :
2112 : /* update the tuple - set atthasmissing and attmissingval */
2113 4 : valuesAtt[Anum_pg_attribute_atthasmissing - 1] = BoolGetDatum(true);
2114 4 : replacesAtt[Anum_pg_attribute_atthasmissing - 1] = true;
2115 4 : valuesAtt[Anum_pg_attribute_attmissingval - 1] = missingval;
2116 4 : replacesAtt[Anum_pg_attribute_attmissingval - 1] = true;
2117 :
2118 4 : newtup = heap_modify_tuple(atttup, RelationGetDescr(attrrel),
2119 : valuesAtt, nullsAtt, replacesAtt);
2120 4 : CatalogTupleUpdate(attrrel, &newtup->t_self, newtup);
2121 :
2122 : /* clean up */
2123 4 : ReleaseSysCache(atttup);
2124 4 : table_close(attrrel, RowExclusiveLock);
2125 4 : table_close(tablerel, AccessExclusiveLock);
2126 : }
2127 :
2128 : /*
2129 : * Store a check-constraint expression for the given relation.
2130 : *
2131 : * Caller is responsible for updating the count of constraints
2132 : * in the pg_class entry for the relation.
2133 : *
2134 : * The OID of the new constraint is returned.
2135 : */
2136 : static Oid
2137 2622 : StoreRelCheck(Relation rel, const char *ccname, Node *expr,
2138 : bool is_enforced, bool is_validated, bool is_local,
2139 : int16 inhcount, bool is_no_inherit, bool is_internal)
2140 : {
2141 : char *ccbin;
2142 : List *varList;
2143 : int keycount;
2144 : int16 *attNos;
2145 : Oid constrOid;
2146 :
2147 : /*
2148 : * Flatten expression to string form for storage.
2149 : */
2150 2622 : ccbin = nodeToString(expr);
2151 :
2152 : /*
2153 : * Find columns of rel that are used in expr
2154 : *
2155 : * NB: pull_var_clause is okay here only because we don't allow subselects
2156 : * in check constraints; it would fail to examine the contents of
2157 : * subselects.
2158 : */
2159 2622 : varList = pull_var_clause(expr, 0);
2160 2622 : keycount = list_length(varList);
2161 :
2162 2622 : if (keycount > 0)
2163 : {
2164 : ListCell *vl;
2165 2608 : int i = 0;
2166 :
2167 2608 : attNos = (int16 *) palloc(keycount * sizeof(int16));
2168 5840 : foreach(vl, varList)
2169 : {
2170 3232 : Var *var = (Var *) lfirst(vl);
2171 : int j;
2172 :
2173 3476 : for (j = 0; j < i; j++)
2174 644 : if (attNos[j] == var->varattno)
2175 400 : break;
2176 3232 : if (j == i)
2177 2832 : attNos[i++] = var->varattno;
2178 : }
2179 2608 : keycount = i;
2180 : }
2181 : else
2182 14 : attNos = NULL;
2183 :
2184 : /*
2185 : * Partitioned tables do not contain any rows themselves, so a NO INHERIT
2186 : * constraint makes no sense.
2187 : */
2188 2622 : if (is_no_inherit &&
2189 112 : rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
2190 24 : ereport(ERROR,
2191 : (errcode(ERRCODE_INVALID_TABLE_DEFINITION),
2192 : errmsg("cannot add NO INHERIT constraint to partitioned table \"%s\"",
2193 : RelationGetRelationName(rel))));
2194 :
2195 : /*
2196 : * Create the Check Constraint
2197 : */
2198 : constrOid =
2199 2598 : CreateConstraintEntry(ccname, /* Constraint Name */
2200 2598 : RelationGetNamespace(rel), /* namespace */
2201 : CONSTRAINT_CHECK, /* Constraint Type */
2202 : false, /* Is Deferrable */
2203 : false, /* Is Deferred */
2204 : is_enforced, /* Is Enforced */
2205 : is_validated,
2206 : InvalidOid, /* no parent constraint */
2207 : RelationGetRelid(rel), /* relation */
2208 : attNos, /* attrs in the constraint */
2209 : keycount, /* # key attrs in the constraint */
2210 : keycount, /* # total attrs in the constraint */
2211 : InvalidOid, /* not a domain constraint */
2212 : InvalidOid, /* no associated index */
2213 : InvalidOid, /* Foreign key fields */
2214 : NULL,
2215 : NULL,
2216 : NULL,
2217 : NULL,
2218 : 0,
2219 : ' ',
2220 : ' ',
2221 : NULL,
2222 : 0,
2223 : ' ',
2224 : NULL, /* not an exclusion constraint */
2225 : expr, /* Tree form of check constraint */
2226 : ccbin, /* Binary form of check constraint */
2227 : is_local, /* conislocal */
2228 : inhcount, /* coninhcount */
2229 : is_no_inherit, /* connoinherit */
2230 : false, /* conperiod */
2231 : is_internal); /* internally constructed? */
2232 :
2233 2598 : pfree(ccbin);
2234 :
2235 2598 : return constrOid;
2236 : }
2237 :
2238 : /*
2239 : * Store a not-null constraint for the given relation
2240 : *
2241 : * The OID of the new constraint is returned.
2242 : */
2243 : static Oid
2244 23620 : StoreRelNotNull(Relation rel, const char *nnname, AttrNumber attnum,
2245 : bool is_validated, bool is_local, int inhcount,
2246 : bool is_no_inherit)
2247 : {
2248 : Oid constrOid;
2249 :
2250 : Assert(attnum > InvalidAttrNumber);
2251 :
2252 : constrOid =
2253 23620 : CreateConstraintEntry(nnname,
2254 23620 : RelationGetNamespace(rel),
2255 : CONSTRAINT_NOTNULL,
2256 : false,
2257 : false,
2258 : true, /* Is Enforced */
2259 : is_validated,
2260 : InvalidOid,
2261 : RelationGetRelid(rel),
2262 : &attnum,
2263 : 1,
2264 : 1,
2265 : InvalidOid, /* not a domain constraint */
2266 : InvalidOid, /* no associated index */
2267 : InvalidOid, /* Foreign key fields */
2268 : NULL,
2269 : NULL,
2270 : NULL,
2271 : NULL,
2272 : 0,
2273 : ' ',
2274 : ' ',
2275 : NULL,
2276 : 0,
2277 : ' ',
2278 : NULL, /* not an exclusion constraint */
2279 : NULL,
2280 : NULL,
2281 : is_local,
2282 : inhcount,
2283 : is_no_inherit,
2284 : false,
2285 : false);
2286 23620 : return constrOid;
2287 : }
2288 :
2289 : /*
2290 : * Store defaults and CHECK constraints (passed as a list of CookedConstraint).
2291 : *
2292 : * Each CookedConstraint struct is modified to store the new catalog tuple OID.
2293 : *
2294 : * NOTE: only pre-cooked expressions will be passed this way, which is to
2295 : * say expressions inherited from an existing relation. Newly parsed
2296 : * expressions can be added later, by direct calls to StoreAttrDefault
2297 : * and StoreRelCheck (see AddRelationNewConstraints()).
2298 : */
2299 : static void
2300 83766 : StoreConstraints(Relation rel, List *cooked_constraints, bool is_internal)
2301 : {
2302 83766 : int numchecks = 0;
2303 : ListCell *lc;
2304 :
2305 83766 : if (cooked_constraints == NIL)
2306 83218 : return; /* nothing to do */
2307 :
2308 : /*
2309 : * Deparsing of constraint expressions will fail unless the just-created
2310 : * pg_attribute tuples for this relation are made visible. So, bump the
2311 : * command counter. CAUTION: this will cause a relcache entry rebuild.
2312 : */
2313 548 : CommandCounterIncrement();
2314 :
2315 1372 : foreach(lc, cooked_constraints)
2316 : {
2317 824 : CookedConstraint *con = (CookedConstraint *) lfirst(lc);
2318 :
2319 824 : switch (con->contype)
2320 : {
2321 388 : case CONSTR_DEFAULT:
2322 388 : con->conoid = StoreAttrDefault(rel, con->attnum, con->expr,
2323 : is_internal);
2324 388 : break;
2325 436 : case CONSTR_CHECK:
2326 436 : con->conoid =
2327 436 : StoreRelCheck(rel, con->name, con->expr,
2328 436 : con->is_enforced, !con->skip_validation,
2329 436 : con->is_local, con->inhcount,
2330 436 : con->is_no_inherit, is_internal);
2331 436 : numchecks++;
2332 436 : break;
2333 :
2334 0 : default:
2335 0 : elog(ERROR, "unrecognized constraint type: %d",
2336 : (int) con->contype);
2337 : }
2338 : }
2339 :
2340 548 : if (numchecks > 0)
2341 226 : SetRelationNumChecks(rel, numchecks);
2342 : }
2343 :
2344 : /*
2345 : * AddRelationNewConstraints
2346 : *
2347 : * Add new column default expressions and/or constraint check expressions
2348 : * to an existing relation. This is defined to do both for efficiency in
2349 : * DefineRelation, but of course you can do just one or the other by passing
2350 : * empty lists.
2351 : *
2352 : * rel: relation to be modified
2353 : * newColDefaults: list of RawColumnDefault structures
2354 : * newConstraints: list of Constraint nodes
2355 : * allow_merge: true if check constraints may be merged with existing ones
2356 : * is_local: true if definition is local, false if it's inherited
2357 : * is_internal: true if result of some internal process, not a user request
2358 : * queryString: used during expression transformation of default values and
2359 : * cooked CHECK constraints
2360 : *
2361 : * All entries in newColDefaults will be processed. Entries in newConstraints
2362 : * will be processed only if they are CONSTR_CHECK or CONSTR_NOTNULL types.
2363 : *
2364 : * Returns a list of CookedConstraint nodes that shows the cooked form of
2365 : * the default and constraint expressions added to the relation.
2366 : *
2367 : * NB: caller should have opened rel with some self-conflicting lock mode,
2368 : * and should hold that lock till end of transaction; for normal cases that'll
2369 : * be AccessExclusiveLock, but if caller knows that the constraint is already
2370 : * enforced by some other means, it can be ShareUpdateExclusiveLock. Also, we
2371 : * assume the caller has done a CommandCounterIncrement if necessary to make
2372 : * the relation's catalog tuples visible.
2373 : */
2374 : List *
2375 15716 : AddRelationNewConstraints(Relation rel,
2376 : List *newColDefaults,
2377 : List *newConstraints,
2378 : bool allow_merge,
2379 : bool is_local,
2380 : bool is_internal,
2381 : const char *queryString)
2382 : {
2383 15716 : List *cookedConstraints = NIL;
2384 : TupleDesc tupleDesc;
2385 : TupleConstr *oldconstr;
2386 : int numoldchecks;
2387 : ParseState *pstate;
2388 : ParseNamespaceItem *nsitem;
2389 : int numchecks;
2390 : List *checknames;
2391 : List *nnnames;
2392 : Node *expr;
2393 : CookedConstraint *cooked;
2394 :
2395 : /*
2396 : * Get info about existing constraints.
2397 : */
2398 15716 : tupleDesc = RelationGetDescr(rel);
2399 15716 : oldconstr = tupleDesc->constr;
2400 15716 : if (oldconstr)
2401 13604 : numoldchecks = oldconstr->num_check;
2402 : else
2403 2112 : numoldchecks = 0;
2404 :
2405 : /*
2406 : * Create a dummy ParseState and insert the target relation as its sole
2407 : * rangetable entry. We need a ParseState for transformExpr.
2408 : */
2409 15716 : pstate = make_parsestate(NULL);
2410 15716 : pstate->p_sourcetext = queryString;
2411 15716 : nsitem = addRangeTableEntryForRelation(pstate,
2412 : rel,
2413 : AccessShareLock,
2414 : NULL,
2415 : false,
2416 : true);
2417 15716 : addNSItemToQuery(pstate, nsitem, true, true, true);
2418 :
2419 : /*
2420 : * Process column default expressions.
2421 : */
2422 35522 : foreach_ptr(RawColumnDefault, colDef, newColDefaults)
2423 : {
2424 4474 : Form_pg_attribute atp = TupleDescAttr(rel->rd_att, colDef->attnum - 1);
2425 : Oid defOid;
2426 :
2427 4474 : expr = cookDefault(pstate, colDef->raw_default,
2428 : atp->atttypid, atp->atttypmod,
2429 4474 : NameStr(atp->attname),
2430 4474 : atp->attgenerated);
2431 :
2432 : /*
2433 : * If the expression is just a NULL constant, we do not bother to make
2434 : * an explicit pg_attrdef entry, since the default behavior is
2435 : * equivalent. This applies to column defaults, but not for
2436 : * generation expressions.
2437 : *
2438 : * Note a nonobvious property of this test: if the column is of a
2439 : * domain type, what we'll get is not a bare null Const but a
2440 : * CoerceToDomain expr, so we will not discard the default. This is
2441 : * critical because the column default needs to be retained to
2442 : * override any default that the domain might have.
2443 : */
2444 4282 : if (expr == NULL ||
2445 4282 : (!colDef->generated &&
2446 2698 : IsA(expr, Const) &&
2447 1294 : castNode(Const, expr)->constisnull))
2448 122 : continue;
2449 :
2450 4160 : defOid = StoreAttrDefault(rel, colDef->attnum, expr, is_internal);
2451 :
2452 4160 : cooked = (CookedConstraint *) palloc(sizeof(CookedConstraint));
2453 4160 : cooked->contype = CONSTR_DEFAULT;
2454 4160 : cooked->conoid = defOid;
2455 4160 : cooked->name = NULL;
2456 4160 : cooked->attnum = colDef->attnum;
2457 4160 : cooked->expr = expr;
2458 4160 : cooked->is_enforced = true;
2459 4160 : cooked->skip_validation = false;
2460 4160 : cooked->is_local = is_local;
2461 4160 : cooked->inhcount = is_local ? 0 : 1;
2462 4160 : cooked->is_no_inherit = false;
2463 4160 : cookedConstraints = lappend(cookedConstraints, cooked);
2464 : }
2465 :
2466 : /*
2467 : * Process constraint expressions.
2468 : */
2469 15524 : numchecks = numoldchecks;
2470 15524 : checknames = NIL;
2471 15524 : nnnames = NIL;
2472 42574 : foreach_node(Constraint, cdef, newConstraints)
2473 : {
2474 : Oid constrOid;
2475 :
2476 11826 : if (cdef->contype == CONSTR_CHECK)
2477 : {
2478 : char *ccname;
2479 :
2480 2394 : if (cdef->raw_expr != NULL)
2481 : {
2482 : Assert(cdef->cooked_expr == NULL);
2483 :
2484 : /*
2485 : * Transform raw parsetree to executable expression, and
2486 : * verify it's valid as a CHECK constraint.
2487 : */
2488 2134 : expr = cookConstraint(pstate, cdef->raw_expr,
2489 2134 : RelationGetRelationName(rel));
2490 : }
2491 : else
2492 : {
2493 : Assert(cdef->cooked_expr != NULL);
2494 :
2495 : /*
2496 : * Here, we assume the parser will only pass us valid CHECK
2497 : * expressions, so we do no particular checking.
2498 : */
2499 260 : expr = stringToNode(cdef->cooked_expr);
2500 : }
2501 :
2502 : /*
2503 : * Check name uniqueness, or generate a name if none was given.
2504 : */
2505 2364 : if (cdef->conname != NULL)
2506 : {
2507 1648 : ccname = cdef->conname;
2508 : /* Check against other new constraints */
2509 : /* Needed because we don't do CommandCounterIncrement in loop */
2510 3406 : foreach_ptr(char, chkname, checknames)
2511 : {
2512 110 : if (strcmp(chkname, ccname) == 0)
2513 0 : ereport(ERROR,
2514 : (errcode(ERRCODE_DUPLICATE_OBJECT),
2515 : errmsg("check constraint \"%s\" already exists",
2516 : ccname)));
2517 : }
2518 :
2519 : /* save name for future checks */
2520 1648 : checknames = lappend(checknames, ccname);
2521 :
2522 : /*
2523 : * Check against pre-existing constraints. If we are allowed
2524 : * to merge with an existing constraint, there's no more to do
2525 : * here. (We omit the duplicate constraint from the result,
2526 : * which is what ATAddCheckNNConstraint wants.)
2527 : */
2528 1600 : if (MergeWithExistingConstraint(rel, ccname, expr,
2529 : allow_merge, is_local,
2530 1648 : cdef->is_enforced,
2531 1648 : cdef->initially_valid,
2532 1648 : cdef->is_no_inherit))
2533 130 : continue;
2534 : }
2535 : else
2536 : {
2537 : /*
2538 : * When generating a name, we want to create "tab_col_check"
2539 : * for a column constraint and "tab_check" for a table
2540 : * constraint. We no longer have any info about the syntactic
2541 : * positioning of the constraint phrase, so we approximate
2542 : * this by seeing whether the expression references more than
2543 : * one column. (If the user played by the rules, the result
2544 : * is the same...)
2545 : *
2546 : * Note: pull_var_clause() doesn't descend into sublinks, but
2547 : * we eliminated those above; and anyway this only needs to be
2548 : * an approximate answer.
2549 : */
2550 : List *vars;
2551 : char *colname;
2552 :
2553 716 : vars = pull_var_clause(expr, 0);
2554 :
2555 : /* eliminate duplicates */
2556 716 : vars = list_union(NIL, vars);
2557 :
2558 716 : if (list_length(vars) == 1)
2559 644 : colname = get_attname(RelationGetRelid(rel),
2560 644 : ((Var *) linitial(vars))->varattno,
2561 : true);
2562 : else
2563 72 : colname = NULL;
2564 :
2565 716 : ccname = ChooseConstraintName(RelationGetRelationName(rel),
2566 : colname,
2567 : "check",
2568 716 : RelationGetNamespace(rel),
2569 : checknames);
2570 :
2571 : /* save name for future checks */
2572 716 : checknames = lappend(checknames, ccname);
2573 : }
2574 :
2575 : /*
2576 : * OK, store it.
2577 : */
2578 : constrOid =
2579 2186 : StoreRelCheck(rel, ccname, expr, cdef->is_enforced,
2580 2186 : cdef->initially_valid, is_local,
2581 2186 : is_local ? 0 : 1, cdef->is_no_inherit,
2582 : is_internal);
2583 :
2584 2162 : numchecks++;
2585 :
2586 2162 : cooked = (CookedConstraint *) palloc(sizeof(CookedConstraint));
2587 2162 : cooked->contype = CONSTR_CHECK;
2588 2162 : cooked->conoid = constrOid;
2589 2162 : cooked->name = ccname;
2590 2162 : cooked->attnum = 0;
2591 2162 : cooked->expr = expr;
2592 2162 : cooked->is_enforced = cdef->is_enforced;
2593 2162 : cooked->skip_validation = cdef->skip_validation;
2594 2162 : cooked->is_local = is_local;
2595 2162 : cooked->inhcount = is_local ? 0 : 1;
2596 2162 : cooked->is_no_inherit = cdef->is_no_inherit;
2597 2162 : cookedConstraints = lappend(cookedConstraints, cooked);
2598 : }
2599 9432 : else if (cdef->contype == CONSTR_NOTNULL)
2600 : {
2601 : CookedConstraint *nncooked;
2602 : AttrNumber colnum;
2603 9432 : int16 inhcount = is_local ? 0 : 1;
2604 : char *nnname;
2605 :
2606 : /* Determine which column to modify */
2607 9432 : colnum = get_attnum(RelationGetRelid(rel), strVal(linitial(cdef->keys)));
2608 9432 : if (colnum == InvalidAttrNumber)
2609 18 : ereport(ERROR,
2610 : errcode(ERRCODE_UNDEFINED_COLUMN),
2611 : errmsg("column \"%s\" of relation \"%s\" does not exist",
2612 : strVal(linitial(cdef->keys)), RelationGetRelationName(rel)));
2613 9414 : if (colnum < InvalidAttrNumber)
2614 0 : ereport(ERROR,
2615 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2616 : errmsg("cannot add not-null constraint on system column \"%s\"",
2617 : strVal(linitial(cdef->keys))));
2618 :
2619 : /*
2620 : * If the column already has a not-null constraint, we don't want
2621 : * to add another one; just adjust inheritance status as needed.
2622 : */
2623 9390 : if (AdjustNotNullInheritance(RelationGetRelid(rel), colnum,
2624 9414 : is_local, cdef->is_no_inherit))
2625 554 : continue;
2626 :
2627 : /*
2628 : * If a constraint name is specified, check that it isn't already
2629 : * used. Otherwise, choose a non-conflicting one ourselves.
2630 : */
2631 8836 : if (cdef->conname)
2632 : {
2633 944 : if (ConstraintNameIsUsed(CONSTRAINT_RELATION,
2634 : RelationGetRelid(rel),
2635 944 : cdef->conname))
2636 6 : ereport(ERROR,
2637 : errcode(ERRCODE_DUPLICATE_OBJECT),
2638 : errmsg("constraint \"%s\" for relation \"%s\" already exists",
2639 : cdef->conname, RelationGetRelationName(rel)));
2640 938 : nnname = cdef->conname;
2641 : }
2642 : else
2643 15784 : nnname = ChooseConstraintName(RelationGetRelationName(rel),
2644 7892 : strVal(linitial(cdef->keys)),
2645 : "not_null",
2646 7892 : RelationGetNamespace(rel),
2647 : nnnames);
2648 8830 : nnnames = lappend(nnnames, nnname);
2649 :
2650 : constrOid =
2651 8830 : StoreRelNotNull(rel, nnname, colnum,
2652 8830 : cdef->initially_valid,
2653 : is_local,
2654 : inhcount,
2655 8830 : cdef->is_no_inherit);
2656 :
2657 8830 : nncooked = (CookedConstraint *) palloc(sizeof(CookedConstraint));
2658 8830 : nncooked->contype = CONSTR_NOTNULL;
2659 8830 : nncooked->conoid = constrOid;
2660 8830 : nncooked->name = nnname;
2661 8830 : nncooked->attnum = colnum;
2662 8830 : nncooked->expr = NULL;
2663 8830 : nncooked->is_enforced = true;
2664 8830 : nncooked->skip_validation = cdef->skip_validation;
2665 8830 : nncooked->is_local = is_local;
2666 8830 : nncooked->inhcount = inhcount;
2667 8830 : nncooked->is_no_inherit = cdef->is_no_inherit;
2668 :
2669 8830 : cookedConstraints = lappend(cookedConstraints, nncooked);
2670 : }
2671 : }
2672 :
2673 : /*
2674 : * Update the count of constraints in the relation's pg_class tuple. We do
2675 : * this even if there was no change, in order to ensure that an SI update
2676 : * message is sent out for the pg_class tuple, which will force other
2677 : * backends to rebuild their relcache entries for the rel. (This is
2678 : * critical if we added defaults but not constraints.)
2679 : */
2680 15374 : SetRelationNumChecks(rel, numchecks);
2681 :
2682 15374 : return cookedConstraints;
2683 : }
2684 :
2685 : /*
2686 : * Check for a pre-existing check constraint that conflicts with a proposed
2687 : * new one, and either adjust its conislocal/coninhcount settings or throw
2688 : * error as needed.
2689 : *
2690 : * Returns true if merged (constraint is a duplicate), or false if it's
2691 : * got a so-far-unique name, or throws error if conflict.
2692 : *
2693 : * XXX See MergeConstraintsIntoExisting too if you change this code.
2694 : */
2695 : static bool
2696 1648 : MergeWithExistingConstraint(Relation rel, const char *ccname, Node *expr,
2697 : bool allow_merge, bool is_local,
2698 : bool is_enforced,
2699 : bool is_initially_valid,
2700 : bool is_no_inherit)
2701 : {
2702 : bool found;
2703 : Relation conDesc;
2704 : SysScanDesc conscan;
2705 : ScanKeyData skey[3];
2706 : HeapTuple tup;
2707 :
2708 : /* Search for a pg_constraint entry with same name and relation */
2709 1648 : conDesc = table_open(ConstraintRelationId, RowExclusiveLock);
2710 :
2711 1648 : found = false;
2712 :
2713 1648 : ScanKeyInit(&skey[0],
2714 : Anum_pg_constraint_conrelid,
2715 : BTEqualStrategyNumber, F_OIDEQ,
2716 : ObjectIdGetDatum(RelationGetRelid(rel)));
2717 1648 : ScanKeyInit(&skey[1],
2718 : Anum_pg_constraint_contypid,
2719 : BTEqualStrategyNumber, F_OIDEQ,
2720 : ObjectIdGetDatum(InvalidOid));
2721 1648 : ScanKeyInit(&skey[2],
2722 : Anum_pg_constraint_conname,
2723 : BTEqualStrategyNumber, F_NAMEEQ,
2724 : CStringGetDatum(ccname));
2725 :
2726 1648 : conscan = systable_beginscan(conDesc, ConstraintRelidTypidNameIndexId, true,
2727 : NULL, 3, skey);
2728 :
2729 : /* There can be at most one matching row */
2730 1648 : if (HeapTupleIsValid(tup = systable_getnext(conscan)))
2731 : {
2732 178 : Form_pg_constraint con = (Form_pg_constraint) GETSTRUCT(tup);
2733 :
2734 : /* Found it. Conflicts if not identical check constraint */
2735 178 : if (con->contype == CONSTRAINT_CHECK)
2736 : {
2737 : Datum val;
2738 : bool isnull;
2739 :
2740 172 : val = fastgetattr(tup,
2741 : Anum_pg_constraint_conbin,
2742 : conDesc->rd_att, &isnull);
2743 172 : if (isnull)
2744 0 : elog(ERROR, "null conbin for rel %s",
2745 : RelationGetRelationName(rel));
2746 172 : if (equal(expr, stringToNode(TextDatumGetCString(val))))
2747 166 : found = true;
2748 : }
2749 :
2750 : /*
2751 : * If the existing constraint is purely inherited (no local
2752 : * definition) then interpret addition of a local constraint as a
2753 : * legal merge. This allows ALTER ADD CONSTRAINT on parent and child
2754 : * tables to be given in either order with same end state. However if
2755 : * the relation is a partition, all inherited constraints are always
2756 : * non-local, including those that were merged.
2757 : */
2758 178 : if (is_local && !con->conislocal && !rel->rd_rel->relispartition)
2759 96 : allow_merge = true;
2760 :
2761 178 : if (!found || !allow_merge)
2762 12 : ereport(ERROR,
2763 : (errcode(ERRCODE_DUPLICATE_OBJECT),
2764 : errmsg("constraint \"%s\" for relation \"%s\" already exists",
2765 : ccname, RelationGetRelationName(rel))));
2766 :
2767 : /* If the child constraint is "no inherit" then cannot merge */
2768 166 : if (con->connoinherit)
2769 0 : ereport(ERROR,
2770 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2771 : errmsg("constraint \"%s\" conflicts with non-inherited constraint on relation \"%s\"",
2772 : ccname, RelationGetRelationName(rel))));
2773 :
2774 : /*
2775 : * Must not change an existing inherited constraint to "no inherit"
2776 : * status. That's because inherited constraints should be able to
2777 : * propagate to lower-level children.
2778 : */
2779 166 : if (con->coninhcount > 0 && is_no_inherit)
2780 6 : ereport(ERROR,
2781 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2782 : errmsg("constraint \"%s\" conflicts with inherited constraint on relation \"%s\"",
2783 : ccname, RelationGetRelationName(rel))));
2784 :
2785 : /*
2786 : * If the child constraint is "not valid" then cannot merge with a
2787 : * valid parent constraint.
2788 : */
2789 160 : if (is_initially_valid && con->conenforced && !con->convalidated)
2790 6 : ereport(ERROR,
2791 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2792 : errmsg("constraint \"%s\" conflicts with NOT VALID constraint on relation \"%s\"",
2793 : ccname, RelationGetRelationName(rel))));
2794 :
2795 : /*
2796 : * A non-enforced child constraint cannot be merged with an enforced
2797 : * parent constraint. However, the reverse is allowed, where the child
2798 : * constraint is enforced.
2799 : */
2800 154 : if ((!is_local && is_enforced && !con->conenforced) ||
2801 96 : (is_local && !is_enforced && con->conenforced))
2802 24 : ereport(ERROR,
2803 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
2804 : errmsg("constraint \"%s\" conflicts with NOT ENFORCED constraint on relation \"%s\"",
2805 : ccname, RelationGetRelationName(rel))));
2806 :
2807 : /* OK to update the tuple */
2808 130 : ereport(NOTICE,
2809 : (errmsg("merging constraint \"%s\" with inherited definition",
2810 : ccname)));
2811 :
2812 130 : tup = heap_copytuple(tup);
2813 130 : con = (Form_pg_constraint) GETSTRUCT(tup);
2814 :
2815 : /*
2816 : * In case of partitions, an inherited constraint must be inherited
2817 : * only once since it cannot have multiple parents and it is never
2818 : * considered local.
2819 : */
2820 130 : if (rel->rd_rel->relispartition)
2821 : {
2822 12 : con->coninhcount = 1;
2823 12 : con->conislocal = false;
2824 : }
2825 : else
2826 : {
2827 118 : if (is_local)
2828 72 : con->conislocal = true;
2829 46 : else if (pg_add_s16_overflow(con->coninhcount, 1,
2830 : &con->coninhcount))
2831 0 : ereport(ERROR,
2832 : errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
2833 : errmsg("too many inheritance parents"));
2834 : }
2835 :
2836 130 : if (is_no_inherit)
2837 : {
2838 : Assert(is_local);
2839 0 : con->connoinherit = true;
2840 : }
2841 :
2842 : /*
2843 : * If the child constraint is required to be enforced while the parent
2844 : * constraint is not, this should be allowed by marking the child
2845 : * constraint as enforced. In the reverse case, an error would have
2846 : * already been thrown before reaching this point.
2847 : */
2848 130 : if (is_enforced && !con->conenforced)
2849 : {
2850 : Assert(is_local);
2851 12 : con->conenforced = true;
2852 12 : con->convalidated = true;
2853 : }
2854 :
2855 130 : CatalogTupleUpdate(conDesc, &tup->t_self, tup);
2856 : }
2857 :
2858 1600 : systable_endscan(conscan);
2859 1600 : table_close(conDesc, RowExclusiveLock);
2860 :
2861 1600 : return found;
2862 : }
2863 :
2864 : /*
2865 : * Create the not-null constraints when creating a new relation
2866 : *
2867 : * These come from two sources: the 'constraints' list (of Constraint) is
2868 : * specified directly by the user; the 'old_notnulls' list (of
2869 : * CookedConstraint) comes from inheritance. We create one constraint
2870 : * for each column, giving priority to user-specified ones, and setting
2871 : * inhcount according to how many parents cause each column to get a
2872 : * not-null constraint. If a user-specified name clashes with another
2873 : * user-specified name, an error is raised.
2874 : *
2875 : * Returns a list of AttrNumber for columns that need to have the attnotnull
2876 : * flag set.
2877 : */
2878 : List *
2879 58590 : AddRelationNotNullConstraints(Relation rel, List *constraints,
2880 : List *old_notnulls)
2881 : {
2882 : List *givennames;
2883 : List *nnnames;
2884 58590 : List *nncols = NIL;
2885 :
2886 : /*
2887 : * We track two lists of names: nnnames keeps all the constraint names,
2888 : * givennames tracks user-generated names. The distinction is important,
2889 : * because we must raise error for user-generated name conflicts, but for
2890 : * system-generated name conflicts we just generate another.
2891 : */
2892 58590 : nnnames = NIL;
2893 58590 : givennames = NIL;
2894 :
2895 : /*
2896 : * First, create all not-null constraints that are directly specified by
2897 : * the user. Note that inheritance might have given us another source for
2898 : * each, so we must scan the old_notnulls list and increment inhcount for
2899 : * each element with identical attnum. We delete from there any element
2900 : * that we process.
2901 : *
2902 : * We don't use foreach() here because we have two nested loops over the
2903 : * constraint list, with possible element deletions in the inner one. If
2904 : * we used foreach_delete_current() it could only fix up the state of one
2905 : * of the loops, so it seems cleaner to use looping over list indexes for
2906 : * both loops. Note that any deletion will happen beyond where the outer
2907 : * loop is, so its index never needs adjustment.
2908 : */
2909 71396 : for (int outerpos = 0; outerpos < list_length(constraints); outerpos++)
2910 : {
2911 : Constraint *constr;
2912 : AttrNumber attnum;
2913 : char *conname;
2914 12884 : int inhcount = 0;
2915 :
2916 12884 : constr = list_nth_node(Constraint, constraints, outerpos);
2917 :
2918 : Assert(constr->contype == CONSTR_NOTNULL);
2919 :
2920 12884 : attnum = get_attnum(RelationGetRelid(rel),
2921 12884 : strVal(linitial(constr->keys)));
2922 12884 : if (attnum == InvalidAttrNumber)
2923 0 : ereport(ERROR,
2924 : errcode(ERRCODE_UNDEFINED_COLUMN),
2925 : errmsg("column \"%s\" of relation \"%s\" does not exist",
2926 : strVal(linitial(constr->keys)),
2927 : RelationGetRelationName(rel)));
2928 12884 : if (attnum < InvalidAttrNumber)
2929 0 : ereport(ERROR,
2930 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2931 : errmsg("cannot add not-null constraint on system column \"%s\"",
2932 : strVal(linitial(constr->keys))));
2933 :
2934 : /*
2935 : * A column can only have one not-null constraint, so discard any
2936 : * additional ones that appear for columns we already saw; but check
2937 : * that the NO INHERIT flags match.
2938 : */
2939 16990 : for (int restpos = outerpos + 1; restpos < list_length(constraints);)
2940 : {
2941 : Constraint *other;
2942 :
2943 4166 : other = list_nth_node(Constraint, constraints, restpos);
2944 4166 : if (strcmp(strVal(linitial(constr->keys)),
2945 4166 : strVal(linitial(other->keys))) == 0)
2946 : {
2947 96 : if (other->is_no_inherit != constr->is_no_inherit)
2948 42 : ereport(ERROR,
2949 : errcode(ERRCODE_SYNTAX_ERROR),
2950 : errmsg("conflicting NO INHERIT declaration for not-null constraint on column \"%s\"",
2951 : strVal(linitial(constr->keys))));
2952 :
2953 : /*
2954 : * Preserve constraint name if one is specified, but raise an
2955 : * error if conflicting ones are specified.
2956 : */
2957 54 : if (other->conname)
2958 : {
2959 36 : if (!constr->conname)
2960 12 : constr->conname = pstrdup(other->conname);
2961 24 : else if (strcmp(constr->conname, other->conname) != 0)
2962 18 : ereport(ERROR,
2963 : errcode(ERRCODE_SYNTAX_ERROR),
2964 : errmsg("conflicting not-null constraint names \"%s\" and \"%s\"",
2965 : constr->conname, other->conname));
2966 : }
2967 :
2968 : /* XXX do we need to verify any other fields? */
2969 36 : constraints = list_delete_nth_cell(constraints, restpos);
2970 : }
2971 : else
2972 4070 : restpos++;
2973 : }
2974 :
2975 : /*
2976 : * Search in the list of inherited constraints for any entries on the
2977 : * same column; determine an inheritance count from that. Also, if at
2978 : * least one parent has a constraint for this column, then we must not
2979 : * accept a user specification for a NO INHERIT one. Any constraint
2980 : * from parents that we process here is deleted from the list: we no
2981 : * longer need to process it in the loop below.
2982 : */
2983 25800 : foreach_ptr(CookedConstraint, old, old_notnulls)
2984 : {
2985 176 : if (old->attnum == attnum)
2986 : {
2987 : /*
2988 : * If we get a constraint from the parent, having a local NO
2989 : * INHERIT one doesn't work.
2990 : */
2991 146 : if (constr->is_no_inherit)
2992 12 : ereport(ERROR,
2993 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2994 : errmsg("cannot define not-null constraint on column \"%s\" with NO INHERIT",
2995 : strVal(linitial(constr->keys))),
2996 : errdetail("The column has an inherited not-null constraint.")));
2997 :
2998 134 : inhcount++;
2999 134 : old_notnulls = foreach_delete_current(old_notnulls, old);
3000 : }
3001 : }
3002 :
3003 : /*
3004 : * Determine a constraint name, which may have been specified by the
3005 : * user, or raise an error if a conflict exists with another
3006 : * user-specified name.
3007 : */
3008 12812 : if (constr->conname)
3009 : {
3010 1418 : foreach_ptr(char, thisname, givennames)
3011 : {
3012 130 : if (strcmp(thisname, constr->conname) == 0)
3013 6 : ereport(ERROR,
3014 : errcode(ERRCODE_DUPLICATE_OBJECT),
3015 : errmsg("constraint \"%s\" for relation \"%s\" already exists",
3016 : constr->conname,
3017 : RelationGetRelationName(rel)));
3018 : }
3019 :
3020 644 : conname = constr->conname;
3021 644 : givennames = lappend(givennames, conname);
3022 : }
3023 : else
3024 12162 : conname = ChooseConstraintName(RelationGetRelationName(rel),
3025 12162 : get_attname(RelationGetRelid(rel),
3026 : attnum, false),
3027 : "not_null",
3028 12162 : RelationGetNamespace(rel),
3029 : nnnames);
3030 12806 : nnnames = lappend(nnnames, conname);
3031 :
3032 12806 : StoreRelNotNull(rel, conname,
3033 : attnum, true, true,
3034 12806 : inhcount, constr->is_no_inherit);
3035 :
3036 12806 : nncols = lappend_int(nncols, attnum);
3037 : }
3038 :
3039 : /*
3040 : * If any column remains in the old_notnulls list, we must create a not-
3041 : * null constraint marked not-local for that column. Because multiple
3042 : * parents could specify a not-null constraint for the same column, we
3043 : * must count how many there are and set an appropriate inhcount
3044 : * accordingly, deleting elements we've already processed.
3045 : *
3046 : * We don't use foreach() here because we have two nested loops over the
3047 : * constraint list, with possible element deletions in the inner one. If
3048 : * we used foreach_delete_current() it could only fix up the state of one
3049 : * of the loops, so it seems cleaner to use looping over list indexes for
3050 : * both loops. Note that any deletion will happen beyond where the outer
3051 : * loop is, so its index never needs adjustment.
3052 : */
3053 60496 : for (int outerpos = 0; outerpos < list_length(old_notnulls); outerpos++)
3054 : {
3055 : CookedConstraint *cooked;
3056 1984 : char *conname = NULL;
3057 1984 : int inhcount = 1;
3058 :
3059 1984 : cooked = (CookedConstraint *) list_nth(old_notnulls, outerpos);
3060 : Assert(cooked->contype == CONSTR_NOTNULL);
3061 : Assert(cooked->name);
3062 :
3063 : /*
3064 : * Preserve the first non-conflicting constraint name we come across.
3065 : */
3066 1984 : if (conname == NULL)
3067 1984 : conname = cooked->name;
3068 :
3069 2462 : for (int restpos = outerpos + 1; restpos < list_length(old_notnulls);)
3070 : {
3071 : CookedConstraint *other;
3072 :
3073 478 : other = (CookedConstraint *) list_nth(old_notnulls, restpos);
3074 : Assert(other->name);
3075 478 : if (other->attnum == cooked->attnum)
3076 : {
3077 32 : if (conname == NULL)
3078 0 : conname = other->name;
3079 :
3080 32 : inhcount++;
3081 32 : old_notnulls = list_delete_nth_cell(old_notnulls, restpos);
3082 : }
3083 : else
3084 446 : restpos++;
3085 : }
3086 :
3087 : /* If we got a name, make sure it isn't one we've already used */
3088 1984 : if (conname != NULL)
3089 : {
3090 4432 : foreach_ptr(char, thisname, nnnames)
3091 : {
3092 470 : if (strcmp(thisname, conname) == 0)
3093 : {
3094 6 : conname = NULL;
3095 6 : break;
3096 : }
3097 : }
3098 : }
3099 :
3100 : /* and choose a name, if needed */
3101 1984 : if (conname == NULL)
3102 6 : conname = ChooseConstraintName(RelationGetRelationName(rel),
3103 6 : get_attname(RelationGetRelid(rel),
3104 6 : cooked->attnum, false),
3105 : "not_null",
3106 6 : RelationGetNamespace(rel),
3107 : nnnames);
3108 1984 : nnnames = lappend(nnnames, conname);
3109 :
3110 : /* ignore the origin constraint's is_local and inhcount */
3111 1984 : StoreRelNotNull(rel, conname, cooked->attnum, true,
3112 : false, inhcount, false);
3113 :
3114 1984 : nncols = lappend_int(nncols, cooked->attnum);
3115 : }
3116 :
3117 58512 : return nncols;
3118 : }
3119 :
3120 : /*
3121 : * Update the count of constraints in the relation's pg_class tuple.
3122 : *
3123 : * Caller had better hold exclusive lock on the relation.
3124 : *
3125 : * An important side effect is that a SI update message will be sent out for
3126 : * the pg_class tuple, which will force other backends to rebuild their
3127 : * relcache entries for the rel. Also, this backend will rebuild its
3128 : * own relcache entry at the next CommandCounterIncrement.
3129 : */
3130 : static void
3131 15600 : SetRelationNumChecks(Relation rel, int numchecks)
3132 : {
3133 : Relation relrel;
3134 : HeapTuple reltup;
3135 : Form_pg_class relStruct;
3136 :
3137 15600 : relrel = table_open(RelationRelationId, RowExclusiveLock);
3138 15600 : reltup = SearchSysCacheCopy1(RELOID,
3139 : ObjectIdGetDatum(RelationGetRelid(rel)));
3140 15600 : if (!HeapTupleIsValid(reltup))
3141 0 : elog(ERROR, "cache lookup failed for relation %u",
3142 : RelationGetRelid(rel));
3143 15600 : relStruct = (Form_pg_class) GETSTRUCT(reltup);
3144 :
3145 15600 : if (relStruct->relchecks != numchecks)
3146 : {
3147 2258 : relStruct->relchecks = numchecks;
3148 :
3149 2258 : CatalogTupleUpdate(relrel, &reltup->t_self, reltup);
3150 : }
3151 : else
3152 : {
3153 : /* Skip the disk update, but force relcache inval anyway */
3154 13342 : CacheInvalidateRelcache(rel);
3155 : }
3156 :
3157 15600 : heap_freetuple(reltup);
3158 15600 : table_close(relrel, RowExclusiveLock);
3159 15600 : }
3160 :
3161 : /*
3162 : * Check for references to generated columns
3163 : */
3164 : static bool
3165 5568 : check_nested_generated_walker(Node *node, void *context)
3166 : {
3167 5568 : ParseState *pstate = context;
3168 :
3169 5568 : if (node == NULL)
3170 0 : return false;
3171 5568 : else if (IsA(node, Var))
3172 : {
3173 1942 : Var *var = (Var *) node;
3174 : Oid relid;
3175 : AttrNumber attnum;
3176 :
3177 1942 : relid = rt_fetch(var->varno, pstate->p_rtable)->relid;
3178 1942 : if (!OidIsValid(relid))
3179 0 : return false; /* XXX shouldn't we raise an error? */
3180 :
3181 1942 : attnum = var->varattno;
3182 :
3183 1942 : if (attnum > 0 && get_attgenerated(relid, attnum))
3184 36 : ereport(ERROR,
3185 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3186 : errmsg("cannot use generated column \"%s\" in column generation expression",
3187 : get_attname(relid, attnum, false)),
3188 : errdetail("A generated column cannot reference another generated column."),
3189 : parser_errposition(pstate, var->location)));
3190 : /* A whole-row Var is necessarily self-referential, so forbid it */
3191 1906 : if (attnum == 0)
3192 12 : ereport(ERROR,
3193 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3194 : errmsg("cannot use whole-row variable in column generation expression"),
3195 : errdetail("This would cause the generated column to depend on its own value."),
3196 : parser_errposition(pstate, var->location)));
3197 : /* System columns were already checked in the parser */
3198 :
3199 1894 : return false;
3200 : }
3201 : else
3202 3626 : return expression_tree_walker(node, check_nested_generated_walker,
3203 : context);
3204 : }
3205 :
3206 : static void
3207 1644 : check_nested_generated(ParseState *pstate, Node *node)
3208 : {
3209 1644 : check_nested_generated_walker(node, pstate);
3210 1596 : }
3211 :
3212 : /*
3213 : * Take a raw default and convert it to a cooked format ready for
3214 : * storage.
3215 : *
3216 : * Parse state should be set up to recognize any vars that might appear
3217 : * in the expression. (Even though we plan to reject vars, it's more
3218 : * user-friendly to give the correct error message than "unknown var".)
3219 : *
3220 : * If atttypid is not InvalidOid, coerce the expression to the specified
3221 : * type (and typmod atttypmod). attname is only needed in this case:
3222 : * it is used in the error message, if any.
3223 : */
3224 : Node *
3225 4646 : cookDefault(ParseState *pstate,
3226 : Node *raw_default,
3227 : Oid atttypid,
3228 : int32 atttypmod,
3229 : const char *attname,
3230 : char attgenerated)
3231 : {
3232 : Node *expr;
3233 :
3234 : Assert(raw_default != NULL);
3235 :
3236 : /*
3237 : * Transform raw parsetree to executable expression.
3238 : */
3239 4646 : expr = transformExpr(pstate, raw_default, attgenerated ? EXPR_KIND_GENERATED_COLUMN : EXPR_KIND_COLUMN_DEFAULT);
3240 :
3241 4514 : if (attgenerated)
3242 : {
3243 : /* Disallow refs to other generated columns */
3244 1644 : check_nested_generated(pstate, expr);
3245 :
3246 : /* Disallow mutable functions */
3247 1596 : if (contain_mutable_functions_after_planning((Expr *) expr))
3248 12 : ereport(ERROR,
3249 : (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
3250 : errmsg("generation expression is not immutable")));
3251 : }
3252 : else
3253 : {
3254 : /*
3255 : * For a default expression, transformExpr() should have rejected
3256 : * column references.
3257 : */
3258 : Assert(!contain_var_clause(expr));
3259 : }
3260 :
3261 : /*
3262 : * Coerce the expression to the correct type and typmod, if given. This
3263 : * should match the parser's processing of non-defaulted expressions ---
3264 : * see transformAssignedExpr().
3265 : */
3266 4454 : if (OidIsValid(atttypid))
3267 : {
3268 4454 : Oid type_id = exprType(expr);
3269 :
3270 4454 : expr = coerce_to_target_type(pstate, expr, type_id,
3271 : atttypid, atttypmod,
3272 : COERCION_ASSIGNMENT,
3273 : COERCE_IMPLICIT_CAST,
3274 : -1);
3275 4448 : if (expr == NULL)
3276 0 : ereport(ERROR,
3277 : (errcode(ERRCODE_DATATYPE_MISMATCH),
3278 : errmsg("column \"%s\" is of type %s"
3279 : " but default expression is of type %s",
3280 : attname,
3281 : format_type_be(atttypid),
3282 : format_type_be(type_id)),
3283 : errhint("You will need to rewrite or cast the expression.")));
3284 : }
3285 :
3286 : /*
3287 : * Finally, take care of collations in the finished expression.
3288 : */
3289 4448 : assign_expr_collations(pstate, expr);
3290 :
3291 4448 : return expr;
3292 : }
3293 :
3294 : /*
3295 : * Take a raw CHECK constraint expression and convert it to a cooked format
3296 : * ready for storage.
3297 : *
3298 : * Parse state must be set up to recognize any vars that might appear
3299 : * in the expression.
3300 : */
3301 : static Node *
3302 2134 : cookConstraint(ParseState *pstate,
3303 : Node *raw_constraint,
3304 : char *relname)
3305 : {
3306 : Node *expr;
3307 :
3308 : /*
3309 : * Transform raw parsetree to executable expression.
3310 : */
3311 2134 : expr = transformExpr(pstate, raw_constraint, EXPR_KIND_CHECK_CONSTRAINT);
3312 :
3313 : /*
3314 : * Make sure it yields a boolean result.
3315 : */
3316 2104 : expr = coerce_to_boolean(pstate, expr, "CHECK");
3317 :
3318 : /*
3319 : * Take care of collations.
3320 : */
3321 2104 : assign_expr_collations(pstate, expr);
3322 :
3323 : /*
3324 : * Make sure no outside relations are referred to (this is probably dead
3325 : * code now that add_missing_from is history).
3326 : */
3327 2104 : if (list_length(pstate->p_rtable) != 1)
3328 0 : ereport(ERROR,
3329 : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
3330 : errmsg("only table \"%s\" can be referenced in check constraint",
3331 : relname)));
3332 :
3333 2104 : return expr;
3334 : }
3335 :
3336 : /*
3337 : * CopyStatistics --- copy entries in pg_statistic from one rel to another
3338 : */
3339 : void
3340 508 : CopyStatistics(Oid fromrelid, Oid torelid)
3341 : {
3342 : HeapTuple tup;
3343 : SysScanDesc scan;
3344 : ScanKeyData key[1];
3345 : Relation statrel;
3346 508 : CatalogIndexState indstate = NULL;
3347 :
3348 508 : statrel = table_open(StatisticRelationId, RowExclusiveLock);
3349 :
3350 : /* Now search for stat records */
3351 508 : ScanKeyInit(&key[0],
3352 : Anum_pg_statistic_starelid,
3353 : BTEqualStrategyNumber, F_OIDEQ,
3354 : ObjectIdGetDatum(fromrelid));
3355 :
3356 508 : scan = systable_beginscan(statrel, StatisticRelidAttnumInhIndexId,
3357 : true, NULL, 1, key);
3358 :
3359 514 : while (HeapTupleIsValid((tup = systable_getnext(scan))))
3360 : {
3361 : Form_pg_statistic statform;
3362 :
3363 : /* make a modifiable copy */
3364 6 : tup = heap_copytuple(tup);
3365 6 : statform = (Form_pg_statistic) GETSTRUCT(tup);
3366 :
3367 : /* update the copy of the tuple and insert it */
3368 6 : statform->starelid = torelid;
3369 :
3370 : /* fetch index information when we know we need it */
3371 6 : if (indstate == NULL)
3372 6 : indstate = CatalogOpenIndexes(statrel);
3373 :
3374 6 : CatalogTupleInsertWithInfo(statrel, tup, indstate);
3375 :
3376 6 : heap_freetuple(tup);
3377 : }
3378 :
3379 508 : systable_endscan(scan);
3380 :
3381 508 : if (indstate != NULL)
3382 6 : CatalogCloseIndexes(indstate);
3383 508 : table_close(statrel, RowExclusiveLock);
3384 508 : }
3385 :
3386 : /*
3387 : * RemoveStatistics --- remove entries in pg_statistic for a rel or column
3388 : *
3389 : * If attnum is zero, remove all entries for rel; else remove only the one(s)
3390 : * for that column.
3391 : */
3392 : void
3393 51464 : RemoveStatistics(Oid relid, AttrNumber attnum)
3394 : {
3395 : Relation pgstatistic;
3396 : SysScanDesc scan;
3397 : ScanKeyData key[2];
3398 : int nkeys;
3399 : HeapTuple tuple;
3400 :
3401 51464 : pgstatistic = table_open(StatisticRelationId, RowExclusiveLock);
3402 :
3403 51464 : ScanKeyInit(&key[0],
3404 : Anum_pg_statistic_starelid,
3405 : BTEqualStrategyNumber, F_OIDEQ,
3406 : ObjectIdGetDatum(relid));
3407 :
3408 51464 : if (attnum == 0)
3409 48242 : nkeys = 1;
3410 : else
3411 : {
3412 3222 : ScanKeyInit(&key[1],
3413 : Anum_pg_statistic_staattnum,
3414 : BTEqualStrategyNumber, F_INT2EQ,
3415 : Int16GetDatum(attnum));
3416 3222 : nkeys = 2;
3417 : }
3418 :
3419 51464 : scan = systable_beginscan(pgstatistic, StatisticRelidAttnumInhIndexId, true,
3420 : NULL, nkeys, key);
3421 :
3422 : /* we must loop even when attnum != 0, in case of inherited stats */
3423 54818 : while (HeapTupleIsValid(tuple = systable_getnext(scan)))
3424 3354 : CatalogTupleDelete(pgstatistic, &tuple->t_self);
3425 :
3426 51464 : systable_endscan(scan);
3427 :
3428 51464 : table_close(pgstatistic, RowExclusiveLock);
3429 51464 : }
3430 :
3431 :
3432 : /*
3433 : * RelationTruncateIndexes - truncate all indexes associated
3434 : * with the heap relation to zero tuples.
3435 : *
3436 : * The routine will truncate and then reconstruct the indexes on
3437 : * the specified relation. Caller must hold exclusive lock on rel.
3438 : */
3439 : static void
3440 576 : RelationTruncateIndexes(Relation heapRelation)
3441 : {
3442 : ListCell *indlist;
3443 :
3444 : /* Ask the relcache to produce a list of the indexes of the rel */
3445 780 : foreach(indlist, RelationGetIndexList(heapRelation))
3446 : {
3447 204 : Oid indexId = lfirst_oid(indlist);
3448 : Relation currentIndex;
3449 : IndexInfo *indexInfo;
3450 :
3451 : /* Open the index relation; use exclusive lock, just to be sure */
3452 204 : currentIndex = index_open(indexId, AccessExclusiveLock);
3453 :
3454 : /*
3455 : * Fetch info needed for index_build. Since we know there are no
3456 : * tuples that actually need indexing, we can use a dummy IndexInfo.
3457 : * This is slightly cheaper to build, but the real point is to avoid
3458 : * possibly running user-defined code in index expressions or
3459 : * predicates. We might be getting invoked during ON COMMIT
3460 : * processing, and we don't want to run any such code then.
3461 : */
3462 204 : indexInfo = BuildDummyIndexInfo(currentIndex);
3463 :
3464 : /*
3465 : * Now truncate the actual file (and discard buffers).
3466 : */
3467 204 : RelationTruncate(currentIndex, 0);
3468 :
3469 : /* Initialize the index and rebuild */
3470 : /* Note: we do not need to re-establish pkey setting */
3471 204 : index_build(heapRelation, currentIndex, indexInfo, true, false);
3472 :
3473 : /* We're done with this index */
3474 204 : index_close(currentIndex, NoLock);
3475 : }
3476 576 : }
3477 :
3478 : /*
3479 : * heap_truncate
3480 : *
3481 : * This routine deletes all data within all the specified relations.
3482 : *
3483 : * This is not transaction-safe! There is another, transaction-safe
3484 : * implementation in commands/tablecmds.c. We now use this only for
3485 : * ON COMMIT truncation of temporary tables, where it doesn't matter.
3486 : */
3487 : void
3488 334 : heap_truncate(List *relids)
3489 : {
3490 334 : List *relations = NIL;
3491 : ListCell *cell;
3492 :
3493 : /* Open relations for processing, and grab exclusive access on each */
3494 734 : foreach(cell, relids)
3495 : {
3496 400 : Oid rid = lfirst_oid(cell);
3497 : Relation rel;
3498 :
3499 400 : rel = table_open(rid, AccessExclusiveLock);
3500 400 : relations = lappend(relations, rel);
3501 : }
3502 :
3503 : /* Don't allow truncate on tables that are referenced by foreign keys */
3504 334 : heap_truncate_check_FKs(relations, true);
3505 :
3506 : /* OK to do it */
3507 716 : foreach(cell, relations)
3508 : {
3509 388 : Relation rel = lfirst(cell);
3510 :
3511 : /* Truncate the relation */
3512 388 : heap_truncate_one_rel(rel);
3513 :
3514 : /* Close the relation, but keep exclusive lock on it until commit */
3515 388 : table_close(rel, NoLock);
3516 : }
3517 328 : }
3518 :
3519 : /*
3520 : * heap_truncate_one_rel
3521 : *
3522 : * This routine deletes all data within the specified relation.
3523 : *
3524 : * This is not transaction-safe, because the truncation is done immediately
3525 : * and cannot be rolled back later. Caller is responsible for having
3526 : * checked permissions etc, and must have obtained AccessExclusiveLock.
3527 : */
3528 : void
3529 478 : heap_truncate_one_rel(Relation rel)
3530 : {
3531 : Oid toastrelid;
3532 :
3533 : /*
3534 : * Truncate the relation. Partitioned tables have no storage, so there is
3535 : * nothing to do for them here.
3536 : */
3537 478 : if (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
3538 24 : return;
3539 :
3540 : /* Truncate the underlying relation */
3541 454 : table_relation_nontransactional_truncate(rel);
3542 :
3543 : /* If the relation has indexes, truncate the indexes too */
3544 454 : RelationTruncateIndexes(rel);
3545 :
3546 : /* If there is a toast table, truncate that too */
3547 454 : toastrelid = rel->rd_rel->reltoastrelid;
3548 454 : if (OidIsValid(toastrelid))
3549 : {
3550 122 : Relation toastrel = table_open(toastrelid, AccessExclusiveLock);
3551 :
3552 122 : table_relation_nontransactional_truncate(toastrel);
3553 122 : RelationTruncateIndexes(toastrel);
3554 : /* keep the lock... */
3555 122 : table_close(toastrel, NoLock);
3556 : }
3557 : }
3558 :
3559 : /*
3560 : * heap_truncate_check_FKs
3561 : * Check for foreign keys referencing a list of relations that
3562 : * are to be truncated, and raise error if there are any
3563 : *
3564 : * We disallow such FKs (except self-referential ones) since the whole point
3565 : * of TRUNCATE is to not scan the individual rows to be thrown away.
3566 : *
3567 : * This is split out so it can be shared by both implementations of truncate.
3568 : * Caller should already hold a suitable lock on the relations.
3569 : *
3570 : * tempTables is only used to select an appropriate error message.
3571 : */
3572 : void
3573 1942 : heap_truncate_check_FKs(List *relations, bool tempTables)
3574 : {
3575 1942 : List *oids = NIL;
3576 : List *dependents;
3577 : ListCell *cell;
3578 :
3579 : /*
3580 : * Build a list of OIDs of the interesting relations.
3581 : *
3582 : * If a relation has no triggers, then it can neither have FKs nor be
3583 : * referenced by a FK from another table, so we can ignore it. For
3584 : * partitioned tables, FKs have no triggers, so we must include them
3585 : * anyway.
3586 : */
3587 6022 : foreach(cell, relations)
3588 : {
3589 4080 : Relation rel = lfirst(cell);
3590 :
3591 4080 : if (rel->rd_rel->relhastriggers ||
3592 2836 : rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
3593 1734 : oids = lappend_oid(oids, RelationGetRelid(rel));
3594 : }
3595 :
3596 : /*
3597 : * Fast path: if no relation has triggers, none has FKs either.
3598 : */
3599 1942 : if (oids == NIL)
3600 1230 : return;
3601 :
3602 : /*
3603 : * Otherwise, must scan pg_constraint. We make one pass with all the
3604 : * relations considered; if this finds nothing, then all is well.
3605 : */
3606 712 : dependents = heap_truncate_find_FKs(oids);
3607 712 : if (dependents == NIL)
3608 632 : return;
3609 :
3610 : /*
3611 : * Otherwise we repeat the scan once per relation to identify a particular
3612 : * pair of relations to complain about. This is pretty slow, but
3613 : * performance shouldn't matter much in a failure path. The reason for
3614 : * doing things this way is to ensure that the message produced is not
3615 : * dependent on chance row locations within pg_constraint.
3616 : */
3617 104 : foreach(cell, oids)
3618 : {
3619 104 : Oid relid = lfirst_oid(cell);
3620 : ListCell *cell2;
3621 :
3622 104 : dependents = heap_truncate_find_FKs(list_make1_oid(relid));
3623 :
3624 164 : foreach(cell2, dependents)
3625 : {
3626 140 : Oid relid2 = lfirst_oid(cell2);
3627 :
3628 140 : if (!list_member_oid(oids, relid2))
3629 : {
3630 80 : char *relname = get_rel_name(relid);
3631 80 : char *relname2 = get_rel_name(relid2);
3632 :
3633 80 : if (tempTables)
3634 6 : ereport(ERROR,
3635 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3636 : errmsg("unsupported ON COMMIT and foreign key combination"),
3637 : errdetail("Table \"%s\" references \"%s\", but they do not have the same ON COMMIT setting.",
3638 : relname2, relname)));
3639 : else
3640 74 : ereport(ERROR,
3641 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3642 : errmsg("cannot truncate a table referenced in a foreign key constraint"),
3643 : errdetail("Table \"%s\" references \"%s\".",
3644 : relname2, relname),
3645 : errhint("Truncate table \"%s\" at the same time, "
3646 : "or use TRUNCATE ... CASCADE.",
3647 : relname2)));
3648 : }
3649 : }
3650 : }
3651 : }
3652 :
3653 : /*
3654 : * heap_truncate_find_FKs
3655 : * Find relations having foreign keys referencing any of the given rels
3656 : *
3657 : * Input and result are both lists of relation OIDs. The result contains
3658 : * no duplicates, does *not* include any rels that were already in the input
3659 : * list, and is sorted in OID order. (The last property is enforced mainly
3660 : * to guarantee consistent behavior in the regression tests; we don't want
3661 : * behavior to change depending on chance locations of rows in pg_constraint.)
3662 : *
3663 : * Note: caller should already have appropriate lock on all rels mentioned
3664 : * in relationIds. Since adding or dropping an FK requires exclusive lock
3665 : * on both rels, this ensures that the answer will be stable.
3666 : */
3667 : List *
3668 896 : heap_truncate_find_FKs(List *relationIds)
3669 : {
3670 896 : List *result = NIL;
3671 : List *oids;
3672 : List *parent_cons;
3673 : ListCell *cell;
3674 : ScanKeyData key;
3675 : Relation fkeyRel;
3676 : SysScanDesc fkeyScan;
3677 : HeapTuple tuple;
3678 : bool restart;
3679 :
3680 896 : oids = list_copy(relationIds);
3681 :
3682 : /*
3683 : * Must scan pg_constraint. Right now, it is a seqscan because there is
3684 : * no available index on confrelid.
3685 : */
3686 896 : fkeyRel = table_open(ConstraintRelationId, AccessShareLock);
3687 :
3688 920 : restart:
3689 920 : restart = false;
3690 920 : parent_cons = NIL;
3691 :
3692 920 : fkeyScan = systable_beginscan(fkeyRel, InvalidOid, false,
3693 : NULL, 0, NULL);
3694 :
3695 457740 : while (HeapTupleIsValid(tuple = systable_getnext(fkeyScan)))
3696 : {
3697 456820 : Form_pg_constraint con = (Form_pg_constraint) GETSTRUCT(tuple);
3698 :
3699 : /* Not a foreign key */
3700 456820 : if (con->contype != CONSTRAINT_FOREIGN)
3701 421346 : continue;
3702 :
3703 : /* Not referencing one of our list of tables */
3704 35474 : if (!list_member_oid(oids, con->confrelid))
3705 34486 : continue;
3706 :
3707 : /*
3708 : * If this constraint has a parent constraint which we have not seen
3709 : * yet, keep track of it for the second loop, below. Tracking parent
3710 : * constraints allows us to climb up to the top-level constraint and
3711 : * look for all possible relations referencing the partitioned table.
3712 : */
3713 988 : if (OidIsValid(con->conparentid) &&
3714 288 : !list_member_oid(parent_cons, con->conparentid))
3715 144 : parent_cons = lappend_oid(parent_cons, con->conparentid);
3716 :
3717 : /*
3718 : * Add referencer to result, unless present in input list. (Don't
3719 : * worry about dupes: we'll fix that below).
3720 : */
3721 988 : if (!list_member_oid(relationIds, con->conrelid))
3722 500 : result = lappend_oid(result, con->conrelid);
3723 : }
3724 :
3725 920 : systable_endscan(fkeyScan);
3726 :
3727 : /*
3728 : * Process each parent constraint we found to add the list of referenced
3729 : * relations by them to the oids list. If we do add any new such
3730 : * relations, redo the first loop above. Also, if we see that the parent
3731 : * constraint in turn has a parent, add that so that we process all
3732 : * relations in a single additional pass.
3733 : */
3734 1076 : foreach(cell, parent_cons)
3735 : {
3736 156 : Oid parent = lfirst_oid(cell);
3737 :
3738 156 : ScanKeyInit(&key,
3739 : Anum_pg_constraint_oid,
3740 : BTEqualStrategyNumber, F_OIDEQ,
3741 : ObjectIdGetDatum(parent));
3742 :
3743 156 : fkeyScan = systable_beginscan(fkeyRel, ConstraintOidIndexId,
3744 : true, NULL, 1, &key);
3745 :
3746 156 : tuple = systable_getnext(fkeyScan);
3747 156 : if (HeapTupleIsValid(tuple))
3748 : {
3749 156 : Form_pg_constraint con = (Form_pg_constraint) GETSTRUCT(tuple);
3750 :
3751 : /*
3752 : * pg_constraint rows always appear for partitioned hierarchies
3753 : * this way: on the each side of the constraint, one row appears
3754 : * for each partition that points to the top-most table on the
3755 : * other side.
3756 : *
3757 : * Because of this arrangement, we can correctly catch all
3758 : * relevant relations by adding to 'parent_cons' all rows with
3759 : * valid conparentid, and to the 'oids' list all rows with a zero
3760 : * conparentid. If any oids are added to 'oids', redo the first
3761 : * loop above by setting 'restart'.
3762 : */
3763 156 : if (OidIsValid(con->conparentid))
3764 54 : parent_cons = list_append_unique_oid(parent_cons,
3765 : con->conparentid);
3766 102 : else if (!list_member_oid(oids, con->confrelid))
3767 : {
3768 24 : oids = lappend_oid(oids, con->confrelid);
3769 24 : restart = true;
3770 : }
3771 : }
3772 :
3773 156 : systable_endscan(fkeyScan);
3774 : }
3775 :
3776 920 : list_free(parent_cons);
3777 920 : if (restart)
3778 24 : goto restart;
3779 :
3780 896 : table_close(fkeyRel, AccessShareLock);
3781 896 : list_free(oids);
3782 :
3783 : /* Now sort and de-duplicate the result list */
3784 896 : list_sort(result, list_oid_cmp);
3785 896 : list_deduplicate_oid(result);
3786 :
3787 896 : return result;
3788 : }
3789 :
3790 : /*
3791 : * StorePartitionKey
3792 : * Store information about the partition key rel into the catalog
3793 : */
3794 : void
3795 4748 : StorePartitionKey(Relation rel,
3796 : char strategy,
3797 : int16 partnatts,
3798 : AttrNumber *partattrs,
3799 : List *partexprs,
3800 : Oid *partopclass,
3801 : Oid *partcollation)
3802 : {
3803 : int i;
3804 : int2vector *partattrs_vec;
3805 : oidvector *partopclass_vec;
3806 : oidvector *partcollation_vec;
3807 : Datum partexprDatum;
3808 : Relation pg_partitioned_table;
3809 : HeapTuple tuple;
3810 : Datum values[Natts_pg_partitioned_table];
3811 4748 : bool nulls[Natts_pg_partitioned_table] = {0};
3812 : ObjectAddress myself;
3813 : ObjectAddress referenced;
3814 : ObjectAddresses *addrs;
3815 :
3816 : Assert(rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
3817 :
3818 : /* Copy the partition attribute numbers, opclass OIDs into arrays */
3819 4748 : partattrs_vec = buildint2vector(partattrs, partnatts);
3820 4748 : partopclass_vec = buildoidvector(partopclass, partnatts);
3821 4748 : partcollation_vec = buildoidvector(partcollation, partnatts);
3822 :
3823 : /* Convert the expressions (if any) to a text datum */
3824 4748 : if (partexprs)
3825 : {
3826 : char *exprString;
3827 :
3828 214 : exprString = nodeToString(partexprs);
3829 214 : partexprDatum = CStringGetTextDatum(exprString);
3830 214 : pfree(exprString);
3831 : }
3832 : else
3833 4534 : partexprDatum = (Datum) 0;
3834 :
3835 4748 : pg_partitioned_table = table_open(PartitionedRelationId, RowExclusiveLock);
3836 :
3837 : /* Only this can ever be NULL */
3838 4748 : if (!partexprDatum)
3839 4534 : nulls[Anum_pg_partitioned_table_partexprs - 1] = true;
3840 :
3841 4748 : values[Anum_pg_partitioned_table_partrelid - 1] = ObjectIdGetDatum(RelationGetRelid(rel));
3842 4748 : values[Anum_pg_partitioned_table_partstrat - 1] = CharGetDatum(strategy);
3843 4748 : values[Anum_pg_partitioned_table_partnatts - 1] = Int16GetDatum(partnatts);
3844 4748 : values[Anum_pg_partitioned_table_partdefid - 1] = ObjectIdGetDatum(InvalidOid);
3845 4748 : values[Anum_pg_partitioned_table_partattrs - 1] = PointerGetDatum(partattrs_vec);
3846 4748 : values[Anum_pg_partitioned_table_partclass - 1] = PointerGetDatum(partopclass_vec);
3847 4748 : values[Anum_pg_partitioned_table_partcollation - 1] = PointerGetDatum(partcollation_vec);
3848 4748 : values[Anum_pg_partitioned_table_partexprs - 1] = partexprDatum;
3849 :
3850 4748 : tuple = heap_form_tuple(RelationGetDescr(pg_partitioned_table), values, nulls);
3851 :
3852 4748 : CatalogTupleInsert(pg_partitioned_table, tuple);
3853 4748 : table_close(pg_partitioned_table, RowExclusiveLock);
3854 :
3855 : /* Mark this relation as dependent on a few things as follows */
3856 4748 : addrs = new_object_addresses();
3857 4748 : ObjectAddressSet(myself, RelationRelationId, RelationGetRelid(rel));
3858 :
3859 : /* Operator class and collation per key column */
3860 9940 : for (i = 0; i < partnatts; i++)
3861 : {
3862 5192 : ObjectAddressSet(referenced, OperatorClassRelationId, partopclass[i]);
3863 5192 : add_exact_object_address(&referenced, addrs);
3864 :
3865 : /* The default collation is pinned, so don't bother recording it */
3866 5192 : if (OidIsValid(partcollation[i]) &&
3867 604 : partcollation[i] != DEFAULT_COLLATION_OID)
3868 : {
3869 120 : ObjectAddressSet(referenced, CollationRelationId, partcollation[i]);
3870 120 : add_exact_object_address(&referenced, addrs);
3871 : }
3872 : }
3873 :
3874 4748 : record_object_address_dependencies(&myself, addrs, DEPENDENCY_NORMAL);
3875 4748 : free_object_addresses(addrs);
3876 :
3877 : /*
3878 : * The partitioning columns are made internally dependent on the table,
3879 : * because we cannot drop any of them without dropping the whole table.
3880 : * (ATExecDropColumn independently enforces that, but it's not bulletproof
3881 : * so we need the dependencies too.)
3882 : */
3883 9940 : for (i = 0; i < partnatts; i++)
3884 : {
3885 5192 : if (partattrs[i] == 0)
3886 232 : continue; /* ignore expressions here */
3887 :
3888 4960 : ObjectAddressSubSet(referenced, RelationRelationId,
3889 : RelationGetRelid(rel), partattrs[i]);
3890 4960 : recordDependencyOn(&referenced, &myself, DEPENDENCY_INTERNAL);
3891 : }
3892 :
3893 : /*
3894 : * Also consider anything mentioned in partition expressions. External
3895 : * references (e.g. functions) get NORMAL dependencies. Table columns
3896 : * mentioned in the expressions are handled the same as plain partitioning
3897 : * columns, i.e. they become internally dependent on the whole table.
3898 : */
3899 4748 : if (partexprs)
3900 214 : recordDependencyOnSingleRelExpr(&myself,
3901 : (Node *) partexprs,
3902 : RelationGetRelid(rel),
3903 : DEPENDENCY_NORMAL,
3904 : DEPENDENCY_INTERNAL,
3905 : true /* reverse the self-deps */ );
3906 :
3907 : /*
3908 : * We must invalidate the relcache so that the next
3909 : * CommandCounterIncrement() will cause the same to be rebuilt using the
3910 : * information in just created catalog entry.
3911 : */
3912 4748 : CacheInvalidateRelcache(rel);
3913 4748 : }
3914 :
3915 : /*
3916 : * RemovePartitionKeyByRelId
3917 : * Remove pg_partitioned_table entry for a relation
3918 : */
3919 : void
3920 3806 : RemovePartitionKeyByRelId(Oid relid)
3921 : {
3922 : Relation rel;
3923 : HeapTuple tuple;
3924 :
3925 3806 : rel = table_open(PartitionedRelationId, RowExclusiveLock);
3926 :
3927 3806 : tuple = SearchSysCache1(PARTRELID, ObjectIdGetDatum(relid));
3928 3806 : if (!HeapTupleIsValid(tuple))
3929 0 : elog(ERROR, "cache lookup failed for partition key of relation %u",
3930 : relid);
3931 :
3932 3806 : CatalogTupleDelete(rel, &tuple->t_self);
3933 :
3934 3806 : ReleaseSysCache(tuple);
3935 3806 : table_close(rel, RowExclusiveLock);
3936 3806 : }
3937 :
3938 : /*
3939 : * StorePartitionBound
3940 : * Update pg_class tuple of rel to store the partition bound and set
3941 : * relispartition to true
3942 : *
3943 : * If this is the default partition, also update the default partition OID in
3944 : * pg_partitioned_table.
3945 : *
3946 : * Also, invalidate the parent's relcache, so that the next rebuild will load
3947 : * the new partition's info into its partition descriptor. If there is a
3948 : * default partition, we must invalidate its relcache entry as well.
3949 : */
3950 : void
3951 9512 : StorePartitionBound(Relation rel, Relation parent, PartitionBoundSpec *bound)
3952 : {
3953 : Relation classRel;
3954 : HeapTuple tuple,
3955 : newtuple;
3956 : Datum new_val[Natts_pg_class];
3957 : bool new_null[Natts_pg_class],
3958 : new_repl[Natts_pg_class];
3959 : Oid defaultPartOid;
3960 :
3961 : /* Update pg_class tuple */
3962 9512 : classRel = table_open(RelationRelationId, RowExclusiveLock);
3963 9512 : tuple = SearchSysCacheCopy1(RELOID,
3964 : ObjectIdGetDatum(RelationGetRelid(rel)));
3965 9512 : if (!HeapTupleIsValid(tuple))
3966 0 : elog(ERROR, "cache lookup failed for relation %u",
3967 : RelationGetRelid(rel));
3968 :
3969 : #ifdef USE_ASSERT_CHECKING
3970 : {
3971 : Form_pg_class classForm;
3972 : bool isnull;
3973 :
3974 : classForm = (Form_pg_class) GETSTRUCT(tuple);
3975 : Assert(!classForm->relispartition);
3976 : (void) SysCacheGetAttr(RELOID, tuple, Anum_pg_class_relpartbound,
3977 : &isnull);
3978 : Assert(isnull);
3979 : }
3980 : #endif
3981 :
3982 : /* Fill in relpartbound value */
3983 9512 : memset(new_val, 0, sizeof(new_val));
3984 9512 : memset(new_null, false, sizeof(new_null));
3985 9512 : memset(new_repl, false, sizeof(new_repl));
3986 9512 : new_val[Anum_pg_class_relpartbound - 1] = CStringGetTextDatum(nodeToString(bound));
3987 9512 : new_null[Anum_pg_class_relpartbound - 1] = false;
3988 9512 : new_repl[Anum_pg_class_relpartbound - 1] = true;
3989 9512 : newtuple = heap_modify_tuple(tuple, RelationGetDescr(classRel),
3990 : new_val, new_null, new_repl);
3991 : /* Also set the flag */
3992 9512 : ((Form_pg_class) GETSTRUCT(newtuple))->relispartition = true;
3993 :
3994 : /*
3995 : * We already checked for no inheritance children, but reset
3996 : * relhassubclass in case it was left over.
3997 : */
3998 9512 : if (rel->rd_rel->relkind == RELKIND_RELATION && rel->rd_rel->relhassubclass)
3999 6 : ((Form_pg_class) GETSTRUCT(newtuple))->relhassubclass = false;
4000 :
4001 9512 : CatalogTupleUpdate(classRel, &newtuple->t_self, newtuple);
4002 9512 : heap_freetuple(newtuple);
4003 9512 : table_close(classRel, RowExclusiveLock);
4004 :
4005 : /*
4006 : * If we're storing bounds for the default partition, update
4007 : * pg_partitioned_table too.
4008 : */
4009 9512 : if (bound->is_default)
4010 526 : update_default_partition_oid(RelationGetRelid(parent),
4011 : RelationGetRelid(rel));
4012 :
4013 : /* Make these updates visible */
4014 9512 : CommandCounterIncrement();
4015 :
4016 : /*
4017 : * The partition constraint for the default partition depends on the
4018 : * partition bounds of every other partition, so we must invalidate the
4019 : * relcache entry for that partition every time a partition is added or
4020 : * removed.
4021 : */
4022 : defaultPartOid =
4023 9512 : get_default_oid_from_partdesc(RelationGetPartitionDesc(parent, true));
4024 9512 : if (OidIsValid(defaultPartOid))
4025 646 : CacheInvalidateRelcacheByRelid(defaultPartOid);
4026 :
4027 9512 : CacheInvalidateRelcache(parent);
4028 9512 : }
|
