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