PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
dependency.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * dependency.c
4  * Routines to support inter-object dependencies.
5  *
6  *
7  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
8  * Portions Copyright (c) 1994, Regents of the University of California
9  *
10  * IDENTIFICATION
11  * src/backend/catalog/dependency.c
12  *
13  *-------------------------------------------------------------------------
14  */
15 #include "postgres.h"
16 
17 #include "access/htup_details.h"
18 #include "access/xact.h"
19 #include "catalog/dependency.h"
20 #include "catalog/heap.h"
21 #include "catalog/index.h"
22 #include "catalog/objectaccess.h"
23 #include "catalog/pg_am.h"
24 #include "catalog/pg_amop.h"
25 #include "catalog/pg_amproc.h"
26 #include "catalog/pg_attrdef.h"
27 #include "catalog/pg_authid.h"
28 #include "catalog/pg_cast.h"
29 #include "catalog/pg_collation.h"
31 #include "catalog/pg_constraint.h"
33 #include "catalog/pg_conversion.h"
35 #include "catalog/pg_database.h"
36 #include "catalog/pg_default_acl.h"
37 #include "catalog/pg_depend.h"
39 #include "catalog/pg_extension.h"
42 #include "catalog/pg_init_privs.h"
43 #include "catalog/pg_language.h"
44 #include "catalog/pg_largeobject.h"
45 #include "catalog/pg_namespace.h"
46 #include "catalog/pg_opclass.h"
47 #include "catalog/pg_operator.h"
48 #include "catalog/pg_opfamily.h"
49 #include "catalog/pg_policy.h"
50 #include "catalog/pg_proc.h"
51 #include "catalog/pg_publication.h"
53 #include "catalog/pg_rewrite.h"
56 #include "catalog/pg_tablespace.h"
57 #include "catalog/pg_transform.h"
58 #include "catalog/pg_trigger.h"
59 #include "catalog/pg_ts_config.h"
60 #include "catalog/pg_ts_dict.h"
61 #include "catalog/pg_ts_parser.h"
62 #include "catalog/pg_ts_template.h"
63 #include "catalog/pg_type.h"
65 #include "commands/comment.h"
66 #include "commands/defrem.h"
67 #include "commands/event_trigger.h"
68 #include "commands/extension.h"
69 #include "commands/policy.h"
70 #include "commands/proclang.h"
72 #include "commands/schemacmds.h"
73 #include "commands/seclabel.h"
74 #include "commands/sequence.h"
75 #include "commands/trigger.h"
76 #include "commands/typecmds.h"
77 #include "nodes/nodeFuncs.h"
78 #include "parser/parsetree.h"
79 #include "rewrite/rewriteRemove.h"
80 #include "storage/lmgr.h"
81 #include "utils/fmgroids.h"
82 #include "utils/guc.h"
83 #include "utils/lsyscache.h"
84 #include "utils/syscache.h"
85 #include "utils/tqual.h"
86 
87 
88 /*
89  * Deletion processing requires additional state for each ObjectAddress that
90  * it's planning to delete. For simplicity and code-sharing we make the
91  * ObjectAddresses code support arrays with or without this extra state.
92  */
93 typedef struct
94 {
95  int flags; /* bitmask, see bit definitions below */
96  ObjectAddress dependee; /* object whose deletion forced this one */
98 
99 /* ObjectAddressExtra flag bits */
100 #define DEPFLAG_ORIGINAL 0x0001 /* an original deletion target */
101 #define DEPFLAG_NORMAL 0x0002 /* reached via normal dependency */
102 #define DEPFLAG_AUTO 0x0004 /* reached via auto dependency */
103 #define DEPFLAG_INTERNAL 0x0008 /* reached via internal dependency */
104 #define DEPFLAG_EXTENSION 0x0010 /* reached via extension dependency */
105 #define DEPFLAG_REVERSE 0x0020 /* reverse internal/extension link */
106 
107 
108 /* expansible list of ObjectAddresses */
110 {
111  ObjectAddress *refs; /* => palloc'd array */
112  ObjectAddressExtra *extras; /* => palloc'd array, or NULL if not used */
113  int numrefs; /* current number of references */
114  int maxrefs; /* current size of palloc'd array(s) */
115 };
116 
117 /* typedef ObjectAddresses appears in dependency.h */
118 
119 /* threaded list of ObjectAddresses, for recursion detection */
120 typedef struct ObjectAddressStack
121 {
122  const ObjectAddress *object; /* object being visited */
123  int flags; /* its current flag bits */
124  struct ObjectAddressStack *next; /* next outer stack level */
126 
127 /* for find_expr_references_walker */
128 typedef struct
129 {
130  ObjectAddresses *addrs; /* addresses being accumulated */
131  List *rtables; /* list of rangetables to resolve Vars */
133 
134 /*
135  * This constant table maps ObjectClasses to the corresponding catalog OIDs.
136  * See also getObjectClass().
137  */
138 static const Oid object_classes[] = {
139  RelationRelationId, /* OCLASS_CLASS */
140  ProcedureRelationId, /* OCLASS_PROC */
141  TypeRelationId, /* OCLASS_TYPE */
142  CastRelationId, /* OCLASS_CAST */
143  CollationRelationId, /* OCLASS_COLLATION */
144  ConstraintRelationId, /* OCLASS_CONSTRAINT */
145  ConversionRelationId, /* OCLASS_CONVERSION */
146  AttrDefaultRelationId, /* OCLASS_DEFAULT */
147  LanguageRelationId, /* OCLASS_LANGUAGE */
148  LargeObjectRelationId, /* OCLASS_LARGEOBJECT */
149  OperatorRelationId, /* OCLASS_OPERATOR */
150  OperatorClassRelationId, /* OCLASS_OPCLASS */
151  OperatorFamilyRelationId, /* OCLASS_OPFAMILY */
152  AccessMethodRelationId, /* OCLASS_AM */
153  AccessMethodOperatorRelationId, /* OCLASS_AMOP */
154  AccessMethodProcedureRelationId, /* OCLASS_AMPROC */
155  RewriteRelationId, /* OCLASS_REWRITE */
156  TriggerRelationId, /* OCLASS_TRIGGER */
157  NamespaceRelationId, /* OCLASS_SCHEMA */
158  StatisticExtRelationId, /* OCLASS_STATISTIC_EXT */
159  TSParserRelationId, /* OCLASS_TSPARSER */
160  TSDictionaryRelationId, /* OCLASS_TSDICT */
161  TSTemplateRelationId, /* OCLASS_TSTEMPLATE */
162  TSConfigRelationId, /* OCLASS_TSCONFIG */
163  AuthIdRelationId, /* OCLASS_ROLE */
164  DatabaseRelationId, /* OCLASS_DATABASE */
165  TableSpaceRelationId, /* OCLASS_TBLSPACE */
166  ForeignDataWrapperRelationId, /* OCLASS_FDW */
167  ForeignServerRelationId, /* OCLASS_FOREIGN_SERVER */
168  UserMappingRelationId, /* OCLASS_USER_MAPPING */
169  DefaultAclRelationId, /* OCLASS_DEFACL */
170  ExtensionRelationId, /* OCLASS_EXTENSION */
171  EventTriggerRelationId, /* OCLASS_EVENT_TRIGGER */
172  PolicyRelationId, /* OCLASS_POLICY */
173  PublicationRelationId, /* OCLASS_PUBLICATION */
174  PublicationRelRelationId, /* OCLASS_PUBLICATION_REL */
175  SubscriptionRelationId, /* OCLASS_SUBSCRIPTION */
176  TransformRelationId /* OCLASS_TRANSFORM */
177 };
178 
179 
180 static void findDependentObjects(const ObjectAddress *object,
181  int objflags,
182  int flags,
183  ObjectAddressStack *stack,
184  ObjectAddresses *targetObjects,
185  const ObjectAddresses *pendingObjects,
186  Relation *depRel);
187 static void reportDependentObjects(const ObjectAddresses *targetObjects,
188  DropBehavior behavior,
189  int flags,
190  const ObjectAddress *origObject);
191 static void deleteOneObject(const ObjectAddress *object,
192  Relation *depRel, int32 flags);
193 static void doDeletion(const ObjectAddress *object, int flags);
194 static void AcquireDeletionLock(const ObjectAddress *object, int flags);
195 static void ReleaseDeletionLock(const ObjectAddress *object);
196 static bool find_expr_references_walker(Node *node,
199 static int object_address_comparator(const void *a, const void *b);
200 static void add_object_address(ObjectClass oclass, Oid objectId, int32 subId,
201  ObjectAddresses *addrs);
202 static void add_exact_object_address_extra(const ObjectAddress *object,
203  const ObjectAddressExtra *extra,
204  ObjectAddresses *addrs);
205 static bool object_address_present_add_flags(const ObjectAddress *object,
206  int flags,
207  ObjectAddresses *addrs);
208 static bool stack_address_present_add_flags(const ObjectAddress *object,
209  int flags,
210  ObjectAddressStack *stack);
211 static void DeleteInitPrivs(const ObjectAddress *object);
212 
213 
214 /*
215  * Go through the objects given running the final actions on them, and execute
216  * the actual deletion.
217  */
218 static void
220  int flags)
221 {
222  int i;
223 
224  /*
225  * Keep track of objects for event triggers, if necessary.
226  */
228  {
229  for (i = 0; i < targetObjects->numrefs; i++)
230  {
231  const ObjectAddress *thisobj = &targetObjects->refs[i];
232  const ObjectAddressExtra *extra = &targetObjects->extras[i];
233  bool original = false;
234  bool normal = false;
235 
236  if (extra->flags & DEPFLAG_ORIGINAL)
237  original = true;
238  if (extra->flags & DEPFLAG_NORMAL)
239  normal = true;
240  if (extra->flags & DEPFLAG_REVERSE)
241  normal = true;
242 
244  {
245  EventTriggerSQLDropAddObject(thisobj, original, normal);
246  }
247  }
248  }
249 
250  /*
251  * Delete all the objects in the proper order, except that if told to, we
252  * should skip the original object(s).
253  */
254  for (i = 0; i < targetObjects->numrefs; i++)
255  {
256  ObjectAddress *thisobj = targetObjects->refs + i;
257  ObjectAddressExtra *thisextra = targetObjects->extras + i;
258 
259  if ((flags & PERFORM_DELETION_SKIP_ORIGINAL) &&
260  (thisextra->flags & DEPFLAG_ORIGINAL))
261  continue;
262 
263  deleteOneObject(thisobj, depRel, flags);
264  }
265 }
266 
267 /*
268  * performDeletion: attempt to drop the specified object. If CASCADE
269  * behavior is specified, also drop any dependent objects (recursively).
270  * If RESTRICT behavior is specified, error out if there are any dependent
271  * objects, except for those that should be implicitly dropped anyway
272  * according to the dependency type.
273  *
274  * This is the outer control routine for all forms of DROP that drop objects
275  * that can participate in dependencies. Note that performMultipleDeletions
276  * is a variant on the same theme; if you change anything here you'll likely
277  * need to fix that too.
278  *
279  * Bits in the flags argument can include:
280  *
281  * PERFORM_DELETION_INTERNAL: indicates that the drop operation is not the
282  * direct result of a user-initiated action. For example, when a temporary
283  * schema is cleaned out so that a new backend can use it, or when a column
284  * default is dropped as an intermediate step while adding a new one, that's
285  * an internal operation. On the other hand, when we drop something because
286  * the user issued a DROP statement against it, that's not internal. Currently
287  * this suppresses calling event triggers and making some permissions checks.
288  *
289  * PERFORM_DELETION_CONCURRENTLY: perform the drop concurrently. This does
290  * not currently work for anything except dropping indexes; don't set it for
291  * other object types or you may get strange results.
292  *
293  * PERFORM_DELETION_QUIETLY: reduce message level from NOTICE to DEBUG2.
294  *
295  * PERFORM_DELETION_SKIP_ORIGINAL: do not delete the specified object(s),
296  * but only what depends on it/them.
297  *
298  * PERFORM_DELETION_SKIP_EXTENSIONS: do not delete extensions, even when
299  * deleting objects that are part of an extension. This should generally
300  * be used only when dropping temporary objects.
301  */
302 void
304  DropBehavior behavior, int flags)
305 {
306  Relation depRel;
307  ObjectAddresses *targetObjects;
308 
309  /*
310  * We save some cycles by opening pg_depend just once and passing the
311  * Relation pointer down to all the recursive deletion steps.
312  */
314 
315  /*
316  * Acquire deletion lock on the target object. (Ideally the caller has
317  * done this already, but many places are sloppy about it.)
318  */
319  AcquireDeletionLock(object, 0);
320 
321  /*
322  * Construct a list of objects to delete (ie, the given object plus
323  * everything directly or indirectly dependent on it).
324  */
325  targetObjects = new_object_addresses();
326 
327  findDependentObjects(object,
329  flags,
330  NULL, /* empty stack */
331  targetObjects,
332  NULL, /* no pendingObjects */
333  &depRel);
334 
335  /*
336  * Check if deletion is allowed, and report about cascaded deletes.
337  */
338  reportDependentObjects(targetObjects,
339  behavior,
340  flags,
341  object);
342 
343  /* do the deed */
344  deleteObjectsInList(targetObjects, &depRel, flags);
345 
346  /* And clean up */
347  free_object_addresses(targetObjects);
348 
349  heap_close(depRel, RowExclusiveLock);
350 }
351 
352 /*
353  * performMultipleDeletions: Similar to performDeletion, but act on multiple
354  * objects at once.
355  *
356  * The main difference from issuing multiple performDeletion calls is that the
357  * list of objects that would be implicitly dropped, for each object to be
358  * dropped, is the union of the implicit-object list for all objects. This
359  * makes each check be more relaxed.
360  */
361 void
363  DropBehavior behavior, int flags)
364 {
365  Relation depRel;
366  ObjectAddresses *targetObjects;
367  int i;
368 
369  /* No work if no objects... */
370  if (objects->numrefs <= 0)
371  return;
372 
373  /*
374  * We save some cycles by opening pg_depend just once and passing the
375  * Relation pointer down to all the recursive deletion steps.
376  */
378 
379  /*
380  * Construct a list of objects to delete (ie, the given objects plus
381  * everything directly or indirectly dependent on them). Note that
382  * because we pass the whole objects list as pendingObjects context, we
383  * won't get a failure from trying to delete an object that is internally
384  * dependent on another one in the list; we'll just skip that object and
385  * delete it when we reach its owner.
386  */
387  targetObjects = new_object_addresses();
388 
389  for (i = 0; i < objects->numrefs; i++)
390  {
391  const ObjectAddress *thisobj = objects->refs + i;
392 
393  /*
394  * Acquire deletion lock on each target object. (Ideally the caller
395  * has done this already, but many places are sloppy about it.)
396  */
397  AcquireDeletionLock(thisobj, flags);
398 
399  findDependentObjects(thisobj,
401  flags,
402  NULL, /* empty stack */
403  targetObjects,
404  objects,
405  &depRel);
406  }
407 
408  /*
409  * Check if deletion is allowed, and report about cascaded deletes.
410  *
411  * If there's exactly one object being deleted, report it the same way as
412  * in performDeletion(), else we have to be vaguer.
413  */
414  reportDependentObjects(targetObjects,
415  behavior,
416  flags,
417  (objects->numrefs == 1 ? objects->refs : NULL));
418 
419  /* do the deed */
420  deleteObjectsInList(targetObjects, &depRel, flags);
421 
422  /* And clean up */
423  free_object_addresses(targetObjects);
424 
425  heap_close(depRel, RowExclusiveLock);
426 }
427 
428 /*
429  * findDependentObjects - find all objects that depend on 'object'
430  *
431  * For every object that depends on the starting object, acquire a deletion
432  * lock on the object, add it to targetObjects (if not already there),
433  * and recursively find objects that depend on it. An object's dependencies
434  * will be placed into targetObjects before the object itself; this means
435  * that the finished list's order represents a safe deletion order.
436  *
437  * The caller must already have a deletion lock on 'object' itself,
438  * but must not have added it to targetObjects. (Note: there are corner
439  * cases where we won't add the object either, and will also release the
440  * caller-taken lock. This is a bit ugly, but the API is set up this way
441  * to allow easy rechecking of an object's liveness after we lock it. See
442  * notes within the function.)
443  *
444  * When dropping a whole object (subId = 0), we find dependencies for
445  * its sub-objects too.
446  *
447  * object: the object to add to targetObjects and find dependencies on
448  * objflags: flags to be ORed into the object's targetObjects entry
449  * flags: PERFORM_DELETION_xxx flags for the deletion operation as a whole
450  * stack: list of objects being visited in current recursion; topmost item
451  * is the object that we recursed from (NULL for external callers)
452  * targetObjects: list of objects that are scheduled to be deleted
453  * pendingObjects: list of other objects slated for destruction, but
454  * not necessarily in targetObjects yet (can be NULL if none)
455  * *depRel: already opened pg_depend relation
456  *
457  * Note: objflags describes the reason for visiting this particular object
458  * at this time, and is not passed down when recursing. The flags argument
459  * is passed down, since it describes what we're doing overall.
460  */
461 static void
463  int objflags,
464  int flags,
465  ObjectAddressStack *stack,
466  ObjectAddresses *targetObjects,
467  const ObjectAddresses *pendingObjects,
468  Relation *depRel)
469 {
470  ScanKeyData key[3];
471  int nkeys;
472  SysScanDesc scan;
473  HeapTuple tup;
474  ObjectAddress otherObject;
475  ObjectAddressStack mystack;
476  ObjectAddressExtra extra;
477 
478  /*
479  * If the target object is already being visited in an outer recursion
480  * level, just report the current objflags back to that level and exit.
481  * This is needed to avoid infinite recursion in the face of circular
482  * dependencies.
483  *
484  * The stack check alone would result in dependency loops being broken at
485  * an arbitrary point, ie, the first member object of the loop to be
486  * visited is the last one to be deleted. This is obviously unworkable.
487  * However, the check for internal dependency below guarantees that we
488  * will not break a loop at an internal dependency: if we enter the loop
489  * at an "owned" object we will switch and start at the "owning" object
490  * instead. We could probably hack something up to avoid breaking at an
491  * auto dependency, too, if we had to. However there are no known cases
492  * where that would be necessary.
493  */
494  if (stack_address_present_add_flags(object, objflags, stack))
495  return;
496 
497  /*
498  * It's also possible that the target object has already been completely
499  * processed and put into targetObjects. If so, again we just add the
500  * specified objflags to its entry and return.
501  *
502  * (Note: in these early-exit cases we could release the caller-taken
503  * lock, since the object is presumably now locked multiple times; but it
504  * seems not worth the cycles.)
505  */
506  if (object_address_present_add_flags(object, objflags, targetObjects))
507  return;
508 
509  /*
510  * The target object might be internally dependent on some other object
511  * (its "owner"), and/or be a member of an extension (also considered its
512  * owner). If so, and if we aren't recursing from the owning object, we
513  * have to transform this deletion request into a deletion request of the
514  * owning object. (We'll eventually recurse back to this object, but the
515  * owning object has to be visited first so it will be deleted after.) The
516  * way to find out about this is to scan the pg_depend entries that show
517  * what this object depends on.
518  */
519  ScanKeyInit(&key[0],
521  BTEqualStrategyNumber, F_OIDEQ,
522  ObjectIdGetDatum(object->classId));
523  ScanKeyInit(&key[1],
525  BTEqualStrategyNumber, F_OIDEQ,
526  ObjectIdGetDatum(object->objectId));
527  if (object->objectSubId != 0)
528  {
529  ScanKeyInit(&key[2],
531  BTEqualStrategyNumber, F_INT4EQ,
532  Int32GetDatum(object->objectSubId));
533  nkeys = 3;
534  }
535  else
536  nkeys = 2;
537 
538  scan = systable_beginscan(*depRel, DependDependerIndexId, true,
539  NULL, nkeys, key);
540 
541  while (HeapTupleIsValid(tup = systable_getnext(scan)))
542  {
543  Form_pg_depend foundDep = (Form_pg_depend) GETSTRUCT(tup);
544 
545  otherObject.classId = foundDep->refclassid;
546  otherObject.objectId = foundDep->refobjid;
547  otherObject.objectSubId = foundDep->refobjsubid;
548 
549  switch (foundDep->deptype)
550  {
551  case DEPENDENCY_NORMAL:
552  case DEPENDENCY_AUTO:
554  /* no problem */
555  break;
556 
558 
559  /*
560  * If told to, ignore EXTENSION dependencies altogether. This
561  * flag is normally used to prevent dropping extensions during
562  * temporary-object cleanup, even if a temp object was created
563  * during an extension script.
564  */
566  break;
567 
568  /*
569  * If the other object is the extension currently being
570  * created/altered, ignore this dependency and continue with
571  * the deletion. This allows dropping of an extension's
572  * objects within the extension's scripts, as well as corner
573  * cases such as dropping a transient object created within
574  * such a script.
575  */
576  if (creating_extension &&
577  otherObject.classId == ExtensionRelationId &&
578  otherObject.objectId == CurrentExtensionObject)
579  break;
580 
581  /* Otherwise, treat this like an internal dependency */
582  /* FALL THRU */
583 
584  case DEPENDENCY_INTERNAL:
585 
586  /*
587  * This object is part of the internal implementation of
588  * another object, or is part of the extension that is the
589  * other object. We have three cases:
590  *
591  * 1. At the outermost recursion level, disallow the DROP. (We
592  * just ereport here, rather than proceeding, since no other
593  * dependencies are likely to be interesting.) However, if
594  * the owning object is listed in pendingObjects, just release
595  * the caller's lock and return; we'll eventually complete the
596  * DROP when we reach that entry in the pending list.
597  */
598  if (stack == NULL)
599  {
600  char *otherObjDesc;
601 
602  if (pendingObjects &&
603  object_address_present(&otherObject, pendingObjects))
604  {
605  systable_endscan(scan);
606  /* need to release caller's lock; see notes below */
607  ReleaseDeletionLock(object);
608  return;
609  }
610  otherObjDesc = getObjectDescription(&otherObject);
611  ereport(ERROR,
612  (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
613  errmsg("cannot drop %s because %s requires it",
614  getObjectDescription(object),
615  otherObjDesc),
616  errhint("You can drop %s instead.",
617  otherObjDesc)));
618  }
619 
620  /*
621  * 2. When recursing from the other end of this dependency,
622  * it's okay to continue with the deletion. This holds when
623  * recursing from a whole object that includes the nominal
624  * other end as a component, too. Since there can be more
625  * than one "owning" object, we have to allow matches that are
626  * more than one level down in the stack.
627  */
628  if (stack_address_present_add_flags(&otherObject, 0, stack))
629  break;
630 
631  /*
632  * 3. Not all the owning objects have been visited, so
633  * transform this deletion request into a delete of this
634  * owning object.
635  *
636  * First, release caller's lock on this object and get
637  * deletion lock on the owning object. (We must release
638  * caller's lock to avoid deadlock against a concurrent
639  * deletion of the owning object.)
640  */
641  ReleaseDeletionLock(object);
642  AcquireDeletionLock(&otherObject, 0);
643 
644  /*
645  * The owning object might have been deleted while we waited
646  * to lock it; if so, neither it nor the current object are
647  * interesting anymore. We test this by checking the
648  * pg_depend entry (see notes below).
649  */
650  if (!systable_recheck_tuple(scan, tup))
651  {
652  systable_endscan(scan);
653  ReleaseDeletionLock(&otherObject);
654  return;
655  }
656 
657  /*
658  * Okay, recurse to the owning object instead of proceeding.
659  *
660  * We do not need to stack the current object; we want the
661  * traversal order to be as if the original reference had
662  * linked to the owning object instead of this one.
663  *
664  * The dependency type is a "reverse" dependency: we need to
665  * delete the owning object if this one is to be deleted, but
666  * this linkage is never a reason for an automatic deletion.
667  */
668  findDependentObjects(&otherObject,
670  flags,
671  stack,
672  targetObjects,
673  pendingObjects,
674  depRel);
675  /* And we're done here. */
676  systable_endscan(scan);
677  return;
678  case DEPENDENCY_PIN:
679 
680  /*
681  * Should not happen; PIN dependencies should have zeroes in
682  * the depender fields...
683  */
684  elog(ERROR, "incorrect use of PIN dependency with %s",
685  getObjectDescription(object));
686  break;
687  default:
688  elog(ERROR, "unrecognized dependency type '%c' for %s",
689  foundDep->deptype, getObjectDescription(object));
690  break;
691  }
692  }
693 
694  systable_endscan(scan);
695 
696  /*
697  * Now recurse to any dependent objects. We must visit them first since
698  * they have to be deleted before the current object.
699  */
700  mystack.object = object; /* set up a new stack level */
701  mystack.flags = objflags;
702  mystack.next = stack;
703 
704  ScanKeyInit(&key[0],
706  BTEqualStrategyNumber, F_OIDEQ,
707  ObjectIdGetDatum(object->classId));
708  ScanKeyInit(&key[1],
710  BTEqualStrategyNumber, F_OIDEQ,
711  ObjectIdGetDatum(object->objectId));
712  if (object->objectSubId != 0)
713  {
714  ScanKeyInit(&key[2],
716  BTEqualStrategyNumber, F_INT4EQ,
717  Int32GetDatum(object->objectSubId));
718  nkeys = 3;
719  }
720  else
721  nkeys = 2;
722 
723  scan = systable_beginscan(*depRel, DependReferenceIndexId, true,
724  NULL, nkeys, key);
725 
726  while (HeapTupleIsValid(tup = systable_getnext(scan)))
727  {
728  Form_pg_depend foundDep = (Form_pg_depend) GETSTRUCT(tup);
729  int subflags;
730 
731  otherObject.classId = foundDep->classid;
732  otherObject.objectId = foundDep->objid;
733  otherObject.objectSubId = foundDep->objsubid;
734 
735  /*
736  * Must lock the dependent object before recursing to it.
737  */
738  AcquireDeletionLock(&otherObject, 0);
739 
740  /*
741  * The dependent object might have been deleted while we waited to
742  * lock it; if so, we don't need to do anything more with it. We can
743  * test this cheaply and independently of the object's type by seeing
744  * if the pg_depend tuple we are looking at is still live. (If the
745  * object got deleted, the tuple would have been deleted too.)
746  */
747  if (!systable_recheck_tuple(scan, tup))
748  {
749  /* release the now-useless lock */
750  ReleaseDeletionLock(&otherObject);
751  /* and continue scanning for dependencies */
752  continue;
753  }
754 
755  /* Recurse, passing objflags indicating the dependency type */
756  switch (foundDep->deptype)
757  {
758  case DEPENDENCY_NORMAL:
759  subflags = DEPFLAG_NORMAL;
760  break;
761  case DEPENDENCY_AUTO:
763  subflags = DEPFLAG_AUTO;
764  break;
765  case DEPENDENCY_INTERNAL:
766  subflags = DEPFLAG_INTERNAL;
767  break;
769  subflags = DEPFLAG_EXTENSION;
770  break;
771  case DEPENDENCY_PIN:
772 
773  /*
774  * For a PIN dependency we just ereport immediately; there
775  * won't be any others to report.
776  */
777  ereport(ERROR,
778  (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
779  errmsg("cannot drop %s because it is required by the database system",
780  getObjectDescription(object))));
781  subflags = 0; /* keep compiler quiet */
782  break;
783  default:
784  elog(ERROR, "unrecognized dependency type '%c' for %s",
785  foundDep->deptype, getObjectDescription(object));
786  subflags = 0; /* keep compiler quiet */
787  break;
788  }
789 
790  findDependentObjects(&otherObject,
791  subflags,
792  flags,
793  &mystack,
794  targetObjects,
795  pendingObjects,
796  depRel);
797  }
798 
799  systable_endscan(scan);
800 
801  /*
802  * Finally, we can add the target object to targetObjects. Be careful to
803  * include any flags that were passed back down to us from inner recursion
804  * levels.
805  */
806  extra.flags = mystack.flags;
807  if (stack)
808  extra.dependee = *stack->object;
809  else
810  memset(&extra.dependee, 0, sizeof(extra.dependee));
811  add_exact_object_address_extra(object, &extra, targetObjects);
812 }
813 
814 /*
815  * reportDependentObjects - report about dependencies, and fail if RESTRICT
816  *
817  * Tell the user about dependent objects that we are going to delete
818  * (or would need to delete, but are prevented by RESTRICT mode);
819  * then error out if there are any and it's not CASCADE mode.
820  *
821  * targetObjects: list of objects that are scheduled to be deleted
822  * behavior: RESTRICT or CASCADE
823  * flags: other flags for the deletion operation
824  * origObject: base object of deletion, or NULL if not available
825  * (the latter case occurs in DROP OWNED)
826  */
827 static void
829  DropBehavior behavior,
830  int flags,
831  const ObjectAddress *origObject)
832 {
833  int msglevel = (flags & PERFORM_DELETION_QUIETLY) ? DEBUG2 : NOTICE;
834  bool ok = true;
835  StringInfoData clientdetail;
836  StringInfoData logdetail;
837  int numReportedClient = 0;
838  int numNotReportedClient = 0;
839  int i;
840 
841  /*
842  * If no error is to be thrown, and the msglevel is too low to be shown to
843  * either client or server log, there's no need to do any of the work.
844  *
845  * Note: this code doesn't know all there is to be known about elog
846  * levels, but it works for NOTICE and DEBUG2, which are the only values
847  * msglevel can currently have. We also assume we are running in a normal
848  * operating environment.
849  */
850  if (behavior == DROP_CASCADE &&
851  msglevel < client_min_messages &&
852  (msglevel < log_min_messages || log_min_messages == LOG))
853  return;
854 
855  /*
856  * We limit the number of dependencies reported to the client to
857  * MAX_REPORTED_DEPS, since client software may not deal well with
858  * enormous error strings. The server log always gets a full report.
859  */
860 #define MAX_REPORTED_DEPS 100
861 
862  initStringInfo(&clientdetail);
863  initStringInfo(&logdetail);
864 
865  /*
866  * We process the list back to front (ie, in dependency order not deletion
867  * order), since this makes for a more understandable display.
868  */
869  for (i = targetObjects->numrefs - 1; i >= 0; i--)
870  {
871  const ObjectAddress *obj = &targetObjects->refs[i];
872  const ObjectAddressExtra *extra = &targetObjects->extras[i];
873  char *objDesc;
874 
875  /* Ignore the original deletion target(s) */
876  if (extra->flags & DEPFLAG_ORIGINAL)
877  continue;
878 
879  objDesc = getObjectDescription(obj);
880 
881  /*
882  * If, at any stage of the recursive search, we reached the object via
883  * an AUTO, INTERNAL, or EXTENSION dependency, then it's okay to
884  * delete it even in RESTRICT mode.
885  */
886  if (extra->flags & (DEPFLAG_AUTO |
889  {
890  /*
891  * auto-cascades are reported at DEBUG2, not msglevel. We don't
892  * try to combine them with the regular message because the
893  * results are too confusing when client_min_messages and
894  * log_min_messages are different.
895  */
896  ereport(DEBUG2,
897  (errmsg("drop auto-cascades to %s",
898  objDesc)));
899  }
900  else if (behavior == DROP_RESTRICT)
901  {
902  char *otherDesc = getObjectDescription(&extra->dependee);
903 
904  if (numReportedClient < MAX_REPORTED_DEPS)
905  {
906  /* separate entries with a newline */
907  if (clientdetail.len != 0)
908  appendStringInfoChar(&clientdetail, '\n');
909  appendStringInfo(&clientdetail, _("%s depends on %s"),
910  objDesc, otherDesc);
911  numReportedClient++;
912  }
913  else
914  numNotReportedClient++;
915  /* separate entries with a newline */
916  if (logdetail.len != 0)
917  appendStringInfoChar(&logdetail, '\n');
918  appendStringInfo(&logdetail, _("%s depends on %s"),
919  objDesc, otherDesc);
920  pfree(otherDesc);
921  ok = false;
922  }
923  else
924  {
925  if (numReportedClient < MAX_REPORTED_DEPS)
926  {
927  /* separate entries with a newline */
928  if (clientdetail.len != 0)
929  appendStringInfoChar(&clientdetail, '\n');
930  appendStringInfo(&clientdetail, _("drop cascades to %s"),
931  objDesc);
932  numReportedClient++;
933  }
934  else
935  numNotReportedClient++;
936  /* separate entries with a newline */
937  if (logdetail.len != 0)
938  appendStringInfoChar(&logdetail, '\n');
939  appendStringInfo(&logdetail, _("drop cascades to %s"),
940  objDesc);
941  }
942 
943  pfree(objDesc);
944  }
945 
946  if (numNotReportedClient > 0)
947  appendStringInfo(&clientdetail, ngettext("\nand %d other object "
948  "(see server log for list)",
949  "\nand %d other objects "
950  "(see server log for list)",
951  numNotReportedClient),
952  numNotReportedClient);
953 
954  if (!ok)
955  {
956  if (origObject)
957  ereport(ERROR,
958  (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
959  errmsg("cannot drop %s because other objects depend on it",
960  getObjectDescription(origObject)),
961  errdetail("%s", clientdetail.data),
962  errdetail_log("%s", logdetail.data),
963  errhint("Use DROP ... CASCADE to drop the dependent objects too.")));
964  else
965  ereport(ERROR,
966  (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
967  errmsg("cannot drop desired object(s) because other objects depend on them"),
968  errdetail("%s", clientdetail.data),
969  errdetail_log("%s", logdetail.data),
970  errhint("Use DROP ... CASCADE to drop the dependent objects too.")));
971  }
972  else if (numReportedClient > 1)
973  {
974  ereport(msglevel,
975  /* translator: %d always has a value larger than 1 */
976  (errmsg_plural("drop cascades to %d other object",
977  "drop cascades to %d other objects",
978  numReportedClient + numNotReportedClient,
979  numReportedClient + numNotReportedClient),
980  errdetail("%s", clientdetail.data),
981  errdetail_log("%s", logdetail.data)));
982  }
983  else if (numReportedClient == 1)
984  {
985  /* we just use the single item as-is */
986  ereport(msglevel,
987  (errmsg_internal("%s", clientdetail.data)));
988  }
989 
990  pfree(clientdetail.data);
991  pfree(logdetail.data);
992 }
993 
994 /*
995  * deleteOneObject: delete a single object for performDeletion.
996  *
997  * *depRel is the already-open pg_depend relation.
998  */
999 static void
1000 deleteOneObject(const ObjectAddress *object, Relation *depRel, int flags)
1001 {
1002  ScanKeyData key[3];
1003  int nkeys;
1004  SysScanDesc scan;
1005  HeapTuple tup;
1006 
1007  /* DROP hook of the objects being removed */
1008  InvokeObjectDropHookArg(object->classId, object->objectId,
1009  object->objectSubId, flags);
1010 
1011  /*
1012  * Close depRel if we are doing a drop concurrently. The object deletion
1013  * subroutine will commit the current transaction, so we can't keep the
1014  * relation open across doDeletion().
1015  */
1016  if (flags & PERFORM_DELETION_CONCURRENTLY)
1017  heap_close(*depRel, RowExclusiveLock);
1018 
1019  /*
1020  * Delete the object itself, in an object-type-dependent way.
1021  *
1022  * We used to do this after removing the outgoing dependency links, but it
1023  * seems just as reasonable to do it beforehand. In the concurrent case
1024  * we *must* do it in this order, because we can't make any transactional
1025  * updates before calling doDeletion() --- they'd get committed right
1026  * away, which is not cool if the deletion then fails.
1027  */
1028  doDeletion(object, flags);
1029 
1030  /*
1031  * Reopen depRel if we closed it above
1032  */
1033  if (flags & PERFORM_DELETION_CONCURRENTLY)
1035 
1036  /*
1037  * Now remove any pg_depend records that link from this object to others.
1038  * (Any records linking to this object should be gone already.)
1039  *
1040  * When dropping a whole object (subId = 0), remove all pg_depend records
1041  * for its sub-objects too.
1042  */
1043  ScanKeyInit(&key[0],
1045  BTEqualStrategyNumber, F_OIDEQ,
1046  ObjectIdGetDatum(object->classId));
1047  ScanKeyInit(&key[1],
1049  BTEqualStrategyNumber, F_OIDEQ,
1050  ObjectIdGetDatum(object->objectId));
1051  if (object->objectSubId != 0)
1052  {
1053  ScanKeyInit(&key[2],
1055  BTEqualStrategyNumber, F_INT4EQ,
1056  Int32GetDatum(object->objectSubId));
1057  nkeys = 3;
1058  }
1059  else
1060  nkeys = 2;
1061 
1062  scan = systable_beginscan(*depRel, DependDependerIndexId, true,
1063  NULL, nkeys, key);
1064 
1065  while (HeapTupleIsValid(tup = systable_getnext(scan)))
1066  {
1067  CatalogTupleDelete(*depRel, &tup->t_self);
1068  }
1069 
1070  systable_endscan(scan);
1071 
1072  /*
1073  * Delete shared dependency references related to this object. Again, if
1074  * subId = 0, remove records for sub-objects too.
1075  */
1077  object->objectSubId);
1078 
1079 
1080  /*
1081  * Delete any comments, security labels, or initial privileges associated
1082  * with this object. (This is a convenient place to do these things,
1083  * rather than having every object type know to do it.)
1084  */
1085  DeleteComments(object->objectId, object->classId, object->objectSubId);
1086  DeleteSecurityLabel(object);
1087  DeleteInitPrivs(object);
1088 
1089  /*
1090  * CommandCounterIncrement here to ensure that preceding changes are all
1091  * visible to the next deletion step.
1092  */
1094 
1095  /*
1096  * And we're done!
1097  */
1098 }
1099 
1100 /*
1101  * doDeletion: actually delete a single object
1102  */
1103 static void
1104 doDeletion(const ObjectAddress *object, int flags)
1105 {
1106  switch (getObjectClass(object))
1107  {
1108  case OCLASS_CLASS:
1109  {
1110  char relKind = get_rel_relkind(object->objectId);
1111 
1112  if (relKind == RELKIND_INDEX)
1113  {
1114  bool concurrent = ((flags & PERFORM_DELETION_CONCURRENTLY) != 0);
1115 
1116  Assert(object->objectSubId == 0);
1117  index_drop(object->objectId, concurrent);
1118  }
1119  else
1120  {
1121  if (object->objectSubId != 0)
1122  RemoveAttributeById(object->objectId,
1123  object->objectSubId);
1124  else
1126  }
1127 
1128  /*
1129  * for a sequence, in addition to dropping the heap, also
1130  * delete pg_sequence tuple
1131  */
1132  if (relKind == RELKIND_SEQUENCE)
1133  DeleteSequenceTuple(object->objectId);
1134  break;
1135  }
1136 
1137  case OCLASS_PROC:
1138  RemoveFunctionById(object->objectId);
1139  break;
1140 
1141  case OCLASS_TYPE:
1142  RemoveTypeById(object->objectId);
1143  break;
1144 
1145  case OCLASS_CAST:
1146  DropCastById(object->objectId);
1147  break;
1148 
1149  case OCLASS_COLLATION:
1150  RemoveCollationById(object->objectId);
1151  break;
1152 
1153  case OCLASS_CONSTRAINT:
1154  RemoveConstraintById(object->objectId);
1155  break;
1156 
1157  case OCLASS_CONVERSION:
1158  RemoveConversionById(object->objectId);
1159  break;
1160 
1161  case OCLASS_DEFAULT:
1163  break;
1164 
1165  case OCLASS_LANGUAGE:
1167  break;
1168 
1169  case OCLASS_LARGEOBJECT:
1170  LargeObjectDrop(object->objectId);
1171  break;
1172 
1173  case OCLASS_OPERATOR:
1174  RemoveOperatorById(object->objectId);
1175  break;
1176 
1177  case OCLASS_OPCLASS:
1178  RemoveOpClassById(object->objectId);
1179  break;
1180 
1181  case OCLASS_OPFAMILY:
1182  RemoveOpFamilyById(object->objectId);
1183  break;
1184 
1185  case OCLASS_AM:
1187  break;
1188 
1189  case OCLASS_AMOP:
1190  RemoveAmOpEntryById(object->objectId);
1191  break;
1192 
1193  case OCLASS_AMPROC:
1195  break;
1196 
1197  case OCLASS_REWRITE:
1199  break;
1200 
1201  case OCLASS_TRIGGER:
1202  RemoveTriggerById(object->objectId);
1203  break;
1204 
1205  case OCLASS_SCHEMA:
1206  RemoveSchemaById(object->objectId);
1207  break;
1208 
1209  case OCLASS_STATISTIC_EXT:
1210  RemoveStatisticsById(object->objectId);
1211  break;
1212 
1213  case OCLASS_TSPARSER:
1214  RemoveTSParserById(object->objectId);
1215  break;
1216 
1217  case OCLASS_TSDICT:
1219  break;
1220 
1221  case OCLASS_TSTEMPLATE:
1222  RemoveTSTemplateById(object->objectId);
1223  break;
1224 
1225  case OCLASS_TSCONFIG:
1227  break;
1228 
1229  /*
1230  * OCLASS_ROLE, OCLASS_DATABASE, OCLASS_TBLSPACE intentionally not
1231  * handled here
1232  */
1233 
1234  case OCLASS_FDW:
1236  break;
1237 
1238  case OCLASS_FOREIGN_SERVER:
1240  break;
1241 
1242  case OCLASS_USER_MAPPING:
1244  break;
1245 
1246  case OCLASS_DEFACL:
1247  RemoveDefaultACLById(object->objectId);
1248  break;
1249 
1250  case OCLASS_EXTENSION:
1251  RemoveExtensionById(object->objectId);
1252  break;
1253 
1254  case OCLASS_EVENT_TRIGGER:
1256  break;
1257 
1258  case OCLASS_POLICY:
1259  RemovePolicyById(object->objectId);
1260  break;
1261 
1262  case OCLASS_PUBLICATION:
1264  break;
1265 
1268  break;
1269 
1270  case OCLASS_TRANSFORM:
1271  DropTransformById(object->objectId);
1272  break;
1273 
1274  /*
1275  * These global object types are not supported here.
1276  */
1277  case OCLASS_ROLE:
1278  case OCLASS_DATABASE:
1279  case OCLASS_TBLSPACE:
1280  case OCLASS_SUBSCRIPTION:
1281  elog(ERROR, "global objects cannot be deleted by doDeletion");
1282  break;
1283 
1284  /*
1285  * There's intentionally no default: case here; we want the
1286  * compiler to warn if a new OCLASS hasn't been handled above.
1287  */
1288  }
1289 }
1290 
1291 /*
1292  * AcquireDeletionLock - acquire a suitable lock for deleting an object
1293  *
1294  * We use LockRelation for relations, LockDatabaseObject for everything
1295  * else. Note that dependency.c is not concerned with deleting any kind of
1296  * shared-across-databases object, so we have no need for LockSharedObject.
1297  */
1298 static void
1300 {
1301  if (object->classId == RelationRelationId)
1302  {
1303  /*
1304  * In DROP INDEX CONCURRENTLY, take only ShareUpdateExclusiveLock on
1305  * the index for the moment. index_drop() will promote the lock once
1306  * it's safe to do so. In all other cases we need full exclusive
1307  * lock.
1308  */
1309  if (flags & PERFORM_DELETION_CONCURRENTLY)
1311  else
1313  }
1314  else
1315  {
1316  /* assume we should lock the whole object not a sub-object */
1317  LockDatabaseObject(object->classId, object->objectId, 0,
1319  }
1320 }
1321 
1322 /*
1323  * ReleaseDeletionLock - release an object deletion lock
1324  */
1325 static void
1327 {
1328  if (object->classId == RelationRelationId)
1330  else
1331  /* assume we should lock the whole object not a sub-object */
1332  UnlockDatabaseObject(object->classId, object->objectId, 0,
1334 }
1335 
1336 /*
1337  * recordDependencyOnExpr - find expression dependencies
1338  *
1339  * This is used to find the dependencies of rules, constraint expressions,
1340  * etc.
1341  *
1342  * Given an expression or query in node-tree form, find all the objects
1343  * it refers to (tables, columns, operators, functions, etc). Record
1344  * a dependency of the specified type from the given depender object
1345  * to each object mentioned in the expression.
1346  *
1347  * rtable is the rangetable to be used to interpret Vars with varlevelsup=0.
1348  * It can be NIL if no such variables are expected.
1349  */
1350 void
1352  Node *expr, List *rtable,
1353  DependencyType behavior)
1354 {
1356 
1357  context.addrs = new_object_addresses();
1358 
1359  /* Set up interpretation for Vars at varlevelsup = 0 */
1360  context.rtables = list_make1(rtable);
1361 
1362  /* Scan the expression tree for referenceable objects */
1363  find_expr_references_walker(expr, &context);
1364 
1365  /* Remove any duplicates */
1367 
1368  /* And record 'em */
1369  recordMultipleDependencies(depender,
1370  context.addrs->refs, context.addrs->numrefs,
1371  behavior);
1372 
1373  free_object_addresses(context.addrs);
1374 }
1375 
1376 /*
1377  * recordDependencyOnSingleRelExpr - find expression dependencies
1378  *
1379  * As above, but only one relation is expected to be referenced (with
1380  * varno = 1 and varlevelsup = 0). Pass the relation OID instead of a
1381  * range table. An additional frammish is that dependencies on that
1382  * relation (or its component columns) will be marked with 'self_behavior',
1383  * whereas 'behavior' is used for everything else.
1384  *
1385  * NOTE: the caller should ensure that a whole-table dependency on the
1386  * specified relation is created separately, if one is needed. In particular,
1387  * a whole-row Var "relation.*" will not cause this routine to emit any
1388  * dependency item. This is appropriate behavior for subexpressions of an
1389  * ordinary query, so other cases need to cope as necessary.
1390  */
1391 void
1393  Node *expr, Oid relId,
1394  DependencyType behavior,
1395  DependencyType self_behavior,
1396  bool ignore_self)
1397 {
1399  RangeTblEntry rte;
1400 
1401  context.addrs = new_object_addresses();
1402 
1403  /* We gin up a rather bogus rangetable list to handle Vars */
1404  MemSet(&rte, 0, sizeof(rte));
1405  rte.type = T_RangeTblEntry;
1406  rte.rtekind = RTE_RELATION;
1407  rte.relid = relId;
1408  rte.relkind = RELKIND_RELATION; /* no need for exactness here */
1409 
1410  context.rtables = list_make1(list_make1(&rte));
1411 
1412  /* Scan the expression tree for referenceable objects */
1413  find_expr_references_walker(expr, &context);
1414 
1415  /* Remove any duplicates */
1417 
1418  /* Separate self-dependencies if necessary */
1419  if (behavior != self_behavior && context.addrs->numrefs > 0)
1420  {
1421  ObjectAddresses *self_addrs;
1422  ObjectAddress *outobj;
1423  int oldref,
1424  outrefs;
1425 
1426  self_addrs = new_object_addresses();
1427 
1428  outobj = context.addrs->refs;
1429  outrefs = 0;
1430  for (oldref = 0; oldref < context.addrs->numrefs; oldref++)
1431  {
1432  ObjectAddress *thisobj = context.addrs->refs + oldref;
1433 
1434  if (thisobj->classId == RelationRelationId &&
1435  thisobj->objectId == relId)
1436  {
1437  /* Move this ref into self_addrs */
1438  add_exact_object_address(thisobj, self_addrs);
1439  }
1440  else
1441  {
1442  /* Keep it in context.addrs */
1443  *outobj = *thisobj;
1444  outobj++;
1445  outrefs++;
1446  }
1447  }
1448  context.addrs->numrefs = outrefs;
1449 
1450  /* Record the self-dependencies */
1451  if (!ignore_self)
1452  recordMultipleDependencies(depender,
1453  self_addrs->refs, self_addrs->numrefs,
1454  self_behavior);
1455 
1456  free_object_addresses(self_addrs);
1457  }
1458 
1459  /* Record the external dependencies */
1460  recordMultipleDependencies(depender,
1461  context.addrs->refs, context.addrs->numrefs,
1462  behavior);
1463 
1464  free_object_addresses(context.addrs);
1465 }
1466 
1467 /*
1468  * Recursively search an expression tree for object references.
1469  *
1470  * Note: we avoid creating references to columns of tables that participate
1471  * in an SQL JOIN construct, but are not actually used anywhere in the query.
1472  * To do so, we do not scan the joinaliasvars list of a join RTE while
1473  * scanning the query rangetable, but instead scan each individual entry
1474  * of the alias list when we find a reference to it.
1475  *
1476  * Note: in many cases we do not need to create dependencies on the datatypes
1477  * involved in an expression, because we'll have an indirect dependency via
1478  * some other object. For instance Var nodes depend on a column which depends
1479  * on the datatype, and OpExpr nodes depend on the operator which depends on
1480  * the datatype. However we do need a type dependency if there is no such
1481  * indirect dependency, as for example in Const and CoerceToDomain nodes.
1482  *
1483  * Similarly, we don't need to create dependencies on collations except where
1484  * the collation is being freshly introduced to the expression.
1485  */
1486 static bool
1489 {
1490  if (node == NULL)
1491  return false;
1492  if (IsA(node, Var))
1493  {
1494  Var *var = (Var *) node;
1495  List *rtable;
1496  RangeTblEntry *rte;
1497 
1498  /* Find matching rtable entry, or complain if not found */
1499  if (var->varlevelsup >= list_length(context->rtables))
1500  elog(ERROR, "invalid varlevelsup %d", var->varlevelsup);
1501  rtable = (List *) list_nth(context->rtables, var->varlevelsup);
1502  if (var->varno <= 0 || var->varno > list_length(rtable))
1503  elog(ERROR, "invalid varno %d", var->varno);
1504  rte = rt_fetch(var->varno, rtable);
1505 
1506  /*
1507  * A whole-row Var references no specific columns, so adds no new
1508  * dependency. (We assume that there is a whole-table dependency
1509  * arising from each underlying rangetable entry. While we could
1510  * record such a dependency when finding a whole-row Var that
1511  * references a relation directly, it's quite unclear how to extend
1512  * that to whole-row Vars for JOINs, so it seems better to leave the
1513  * responsibility with the range table. Note that this poses some
1514  * risks for identifying dependencies of stand-alone expressions:
1515  * whole-table references may need to be created separately.)
1516  */
1517  if (var->varattno == InvalidAttrNumber)
1518  return false;
1519  if (rte->rtekind == RTE_RELATION)
1520  {
1521  /* If it's a plain relation, reference this column */
1523  context->addrs);
1524  }
1525  else if (rte->rtekind == RTE_JOIN)
1526  {
1527  /* Scan join output column to add references to join inputs */
1528  List *save_rtables;
1529 
1530  /* We must make the context appropriate for join's level */
1531  save_rtables = context->rtables;
1532  context->rtables = list_copy_tail(context->rtables,
1533  var->varlevelsup);
1534  if (var->varattno <= 0 ||
1535  var->varattno > list_length(rte->joinaliasvars))
1536  elog(ERROR, "invalid varattno %d", var->varattno);
1538  var->varattno - 1),
1539  context);
1540  list_free(context->rtables);
1541  context->rtables = save_rtables;
1542  }
1543  return false;
1544  }
1545  else if (IsA(node, Const))
1546  {
1547  Const *con = (Const *) node;
1548  Oid objoid;
1549 
1550  /* A constant must depend on the constant's datatype */
1552  context->addrs);
1553 
1554  /*
1555  * We must also depend on the constant's collation: it could be
1556  * different from the datatype's, if a CollateExpr was const-folded to
1557  * a simple constant. However we can save work in the most common
1558  * case where the collation is "default", since we know that's pinned.
1559  */
1560  if (OidIsValid(con->constcollid) &&
1563  context->addrs);
1564 
1565  /*
1566  * If it's a regclass or similar literal referring to an existing
1567  * object, add a reference to that object. (Currently, only the
1568  * regclass and regconfig cases have any likely use, but we may as
1569  * well handle all the OID-alias datatypes consistently.)
1570  */
1571  if (!con->constisnull)
1572  {
1573  switch (con->consttype)
1574  {
1575  case REGPROCOID:
1576  case REGPROCEDUREOID:
1577  objoid = DatumGetObjectId(con->constvalue);
1579  ObjectIdGetDatum(objoid)))
1580  add_object_address(OCLASS_PROC, objoid, 0,
1581  context->addrs);
1582  break;
1583  case REGOPEROID:
1584  case REGOPERATOROID:
1585  objoid = DatumGetObjectId(con->constvalue);
1587  ObjectIdGetDatum(objoid)))
1589  context->addrs);
1590  break;
1591  case REGCLASSOID:
1592  objoid = DatumGetObjectId(con->constvalue);
1594  ObjectIdGetDatum(objoid)))
1595  add_object_address(OCLASS_CLASS, objoid, 0,
1596  context->addrs);
1597  break;
1598  case REGTYPEOID:
1599  objoid = DatumGetObjectId(con->constvalue);
1601  ObjectIdGetDatum(objoid)))
1602  add_object_address(OCLASS_TYPE, objoid, 0,
1603  context->addrs);
1604  break;
1605  case REGCONFIGOID:
1606  objoid = DatumGetObjectId(con->constvalue);
1608  ObjectIdGetDatum(objoid)))
1610  context->addrs);
1611  break;
1612  case REGDICTIONARYOID:
1613  objoid = DatumGetObjectId(con->constvalue);
1615  ObjectIdGetDatum(objoid)))
1616  add_object_address(OCLASS_TSDICT, objoid, 0,
1617  context->addrs);
1618  break;
1619 
1620  case REGNAMESPACEOID:
1621  objoid = DatumGetObjectId(con->constvalue);
1623  ObjectIdGetDatum(objoid)))
1624  add_object_address(OCLASS_SCHEMA, objoid, 0,
1625  context->addrs);
1626  break;
1627 
1628  /*
1629  * Dependencies for regrole should be shared among all
1630  * databases, so explicitly inhibit to have dependencies.
1631  */
1632  case REGROLEOID:
1633  ereport(ERROR,
1634  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1635  errmsg("constant of the type %s cannot be used here",
1636  "regrole")));
1637  break;
1638  }
1639  }
1640  return false;
1641  }
1642  else if (IsA(node, Param))
1643  {
1644  Param *param = (Param *) node;
1645 
1646  /* A parameter must depend on the parameter's datatype */
1648  context->addrs);
1649  /* and its collation, just as for Consts */
1650  if (OidIsValid(param->paramcollid) &&
1653  context->addrs);
1654  }
1655  else if (IsA(node, FuncExpr))
1656  {
1657  FuncExpr *funcexpr = (FuncExpr *) node;
1658 
1659  add_object_address(OCLASS_PROC, funcexpr->funcid, 0,
1660  context->addrs);
1661  /* fall through to examine arguments */
1662  }
1663  else if (IsA(node, OpExpr))
1664  {
1665  OpExpr *opexpr = (OpExpr *) node;
1666 
1668  context->addrs);
1669  /* fall through to examine arguments */
1670  }
1671  else if (IsA(node, DistinctExpr))
1672  {
1673  DistinctExpr *distinctexpr = (DistinctExpr *) node;
1674 
1675  add_object_address(OCLASS_OPERATOR, distinctexpr->opno, 0,
1676  context->addrs);
1677  /* fall through to examine arguments */
1678  }
1679  else if (IsA(node, NullIfExpr))
1680  {
1681  NullIfExpr *nullifexpr = (NullIfExpr *) node;
1682 
1683  add_object_address(OCLASS_OPERATOR, nullifexpr->opno, 0,
1684  context->addrs);
1685  /* fall through to examine arguments */
1686  }
1687  else if (IsA(node, ScalarArrayOpExpr))
1688  {
1689  ScalarArrayOpExpr *opexpr = (ScalarArrayOpExpr *) node;
1690 
1692  context->addrs);
1693  /* fall through to examine arguments */
1694  }
1695  else if (IsA(node, Aggref))
1696  {
1697  Aggref *aggref = (Aggref *) node;
1698 
1700  context->addrs);
1701  /* fall through to examine arguments */
1702  }
1703  else if (IsA(node, WindowFunc))
1704  {
1705  WindowFunc *wfunc = (WindowFunc *) node;
1706 
1708  context->addrs);
1709  /* fall through to examine arguments */
1710  }
1711  else if (IsA(node, SubPlan))
1712  {
1713  /* Extra work needed here if we ever need this case */
1714  elog(ERROR, "already-planned subqueries not supported");
1715  }
1716  else if (IsA(node, RelabelType))
1717  {
1718  RelabelType *relab = (RelabelType *) node;
1719 
1720  /* since there is no function dependency, need to depend on type */
1722  context->addrs);
1723  /* the collation might not be referenced anywhere else, either */
1724  if (OidIsValid(relab->resultcollid) &&
1727  context->addrs);
1728  }
1729  else if (IsA(node, CoerceViaIO))
1730  {
1731  CoerceViaIO *iocoerce = (CoerceViaIO *) node;
1732 
1733  /* since there is no exposed function, need to depend on type */
1735  context->addrs);
1736  }
1737  else if (IsA(node, ArrayCoerceExpr))
1738  {
1739  ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) node;
1740 
1741  /* as above, depend on type */
1743  context->addrs);
1744  /* the collation might not be referenced anywhere else, either */
1745  if (OidIsValid(acoerce->resultcollid) &&
1746  acoerce->resultcollid != DEFAULT_COLLATION_OID)
1748  context->addrs);
1749  /* fall through to examine arguments */
1750  }
1751  else if (IsA(node, ConvertRowtypeExpr))
1752  {
1753  ConvertRowtypeExpr *cvt = (ConvertRowtypeExpr *) node;
1754 
1755  /* since there is no function dependency, need to depend on type */
1757  context->addrs);
1758  }
1759  else if (IsA(node, CollateExpr))
1760  {
1761  CollateExpr *coll = (CollateExpr *) node;
1762 
1764  context->addrs);
1765  }
1766  else if (IsA(node, RowExpr))
1767  {
1768  RowExpr *rowexpr = (RowExpr *) node;
1769 
1771  context->addrs);
1772  }
1773  else if (IsA(node, RowCompareExpr))
1774  {
1775  RowCompareExpr *rcexpr = (RowCompareExpr *) node;
1776  ListCell *l;
1777 
1778  foreach(l, rcexpr->opnos)
1779  {
1781  context->addrs);
1782  }
1783  foreach(l, rcexpr->opfamilies)
1784  {
1786  context->addrs);
1787  }
1788  /* fall through to examine arguments */
1789  }
1790  else if (IsA(node, CoerceToDomain))
1791  {
1792  CoerceToDomain *cd = (CoerceToDomain *) node;
1793 
1795  context->addrs);
1796  }
1797  else if (IsA(node, NextValueExpr))
1798  {
1799  NextValueExpr *nve = (NextValueExpr *) node;
1800 
1802  context->addrs);
1803  }
1804  else if (IsA(node, OnConflictExpr))
1805  {
1806  OnConflictExpr *onconflict = (OnConflictExpr *) node;
1807 
1808  if (OidIsValid(onconflict->constraint))
1810  context->addrs);
1811  /* fall through to examine arguments */
1812  }
1813  else if (IsA(node, SortGroupClause))
1814  {
1815  SortGroupClause *sgc = (SortGroupClause *) node;
1816 
1818  context->addrs);
1819  if (OidIsValid(sgc->sortop))
1821  context->addrs);
1822  return false;
1823  }
1824  else if (IsA(node, Query))
1825  {
1826  /* Recurse into RTE subquery or not-yet-planned sublink subquery */
1827  Query *query = (Query *) node;
1828  ListCell *lc;
1829  bool result;
1830 
1831  /*
1832  * Add whole-relation refs for each plain relation mentioned in the
1833  * subquery's rtable.
1834  *
1835  * Note: query_tree_walker takes care of recursing into RTE_FUNCTION
1836  * RTEs, subqueries, etc, so no need to do that here. But keep it
1837  * from looking at join alias lists.
1838  *
1839  * Note: we don't need to worry about collations mentioned in
1840  * RTE_VALUES or RTE_CTE RTEs, because those must just duplicate
1841  * collations referenced in other parts of the Query. We do have to
1842  * worry about collations mentioned in RTE_FUNCTION, but we take care
1843  * of those when we recurse to the RangeTblFunction node(s).
1844  */
1845  foreach(lc, query->rtable)
1846  {
1847  RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
1848 
1849  switch (rte->rtekind)
1850  {
1851  case RTE_RELATION:
1853  context->addrs);
1854  break;
1855  default:
1856  break;
1857  }
1858  }
1859 
1860  /*
1861  * If the query is an INSERT or UPDATE, we should create a dependency
1862  * on each target column, to prevent the specific target column from
1863  * being dropped. Although we will visit the TargetEntry nodes again
1864  * during query_tree_walker, we won't have enough context to do this
1865  * conveniently, so do it here.
1866  */
1867  if (query->commandType == CMD_INSERT ||
1868  query->commandType == CMD_UPDATE)
1869  {
1870  RangeTblEntry *rte;
1871 
1872  if (query->resultRelation <= 0 ||
1873  query->resultRelation > list_length(query->rtable))
1874  elog(ERROR, "invalid resultRelation %d",
1875  query->resultRelation);
1876  rte = rt_fetch(query->resultRelation, query->rtable);
1877  if (rte->rtekind == RTE_RELATION)
1878  {
1879  foreach(lc, query->targetList)
1880  {
1881  TargetEntry *tle = (TargetEntry *) lfirst(lc);
1882 
1883  if (tle->resjunk)
1884  continue; /* ignore junk tlist items */
1886  context->addrs);
1887  }
1888  }
1889  }
1890 
1891  /*
1892  * Add dependencies on constraints listed in query's constraintDeps
1893  */
1894  foreach(lc, query->constraintDeps)
1895  {
1897  context->addrs);
1898  }
1899 
1900  /* query_tree_walker ignores ORDER BY etc, but we need those opers */
1901  find_expr_references_walker((Node *) query->sortClause, context);
1902  find_expr_references_walker((Node *) query->groupClause, context);
1903  find_expr_references_walker((Node *) query->windowClause, context);
1904  find_expr_references_walker((Node *) query->distinctClause, context);
1905 
1906  /* Examine substructure of query */
1907  context->rtables = lcons(query->rtable, context->rtables);
1908  result = query_tree_walker(query,
1910  (void *) context,
1912  context->rtables = list_delete_first(context->rtables);
1913  return result;
1914  }
1915  else if (IsA(node, SetOperationStmt))
1916  {
1917  SetOperationStmt *setop = (SetOperationStmt *) node;
1918 
1919  /* we need to look at the groupClauses for operator references */
1920  find_expr_references_walker((Node *) setop->groupClauses, context);
1921  /* fall through to examine child nodes */
1922  }
1923  else if (IsA(node, RangeTblFunction))
1924  {
1925  RangeTblFunction *rtfunc = (RangeTblFunction *) node;
1926  ListCell *ct;
1927 
1928  /*
1929  * Add refs for any datatypes and collations used in a column
1930  * definition list for a RECORD function. (For other cases, it should
1931  * be enough to depend on the function itself.)
1932  */
1933  foreach(ct, rtfunc->funccoltypes)
1934  {
1936  context->addrs);
1937  }
1938  foreach(ct, rtfunc->funccolcollations)
1939  {
1940  Oid collid = lfirst_oid(ct);
1941 
1942  if (OidIsValid(collid) && collid != DEFAULT_COLLATION_OID)
1944  context->addrs);
1945  }
1946  }
1947  else if (IsA(node, TableSampleClause))
1948  {
1949  TableSampleClause *tsc = (TableSampleClause *) node;
1950 
1952  context->addrs);
1953  /* fall through to examine arguments */
1954  }
1955 
1957  (void *) context);
1958 }
1959 
1960 /*
1961  * Given an array of dependency references, eliminate any duplicates.
1962  */
1963 static void
1965 {
1966  ObjectAddress *priorobj;
1967  int oldref,
1968  newrefs;
1969 
1970  /*
1971  * We can't sort if the array has "extra" data, because there's no way to
1972  * keep it in sync. Fortunately that combination of features is not
1973  * needed.
1974  */
1975  Assert(!addrs->extras);
1976 
1977  if (addrs->numrefs <= 1)
1978  return; /* nothing to do */
1979 
1980  /* Sort the refs so that duplicates are adjacent */
1981  qsort((void *) addrs->refs, addrs->numrefs, sizeof(ObjectAddress),
1983 
1984  /* Remove dups */
1985  priorobj = addrs->refs;
1986  newrefs = 1;
1987  for (oldref = 1; oldref < addrs->numrefs; oldref++)
1988  {
1989  ObjectAddress *thisobj = addrs->refs + oldref;
1990 
1991  if (priorobj->classId == thisobj->classId &&
1992  priorobj->objectId == thisobj->objectId)
1993  {
1994  if (priorobj->objectSubId == thisobj->objectSubId)
1995  continue; /* identical, so drop thisobj */
1996 
1997  /*
1998  * If we have a whole-object reference and a reference to a part
1999  * of the same object, we don't need the whole-object reference
2000  * (for example, we don't need to reference both table foo and
2001  * column foo.bar). The whole-object reference will always appear
2002  * first in the sorted list.
2003  */
2004  if (priorobj->objectSubId == 0)
2005  {
2006  /* replace whole ref with partial */
2007  priorobj->objectSubId = thisobj->objectSubId;
2008  continue;
2009  }
2010  }
2011  /* Not identical, so add thisobj to output set */
2012  priorobj++;
2013  *priorobj = *thisobj;
2014  newrefs++;
2015  }
2016 
2017  addrs->numrefs = newrefs;
2018 }
2019 
2020 /*
2021  * qsort comparator for ObjectAddress items
2022  */
2023 static int
2024 object_address_comparator(const void *a, const void *b)
2025 {
2026  const ObjectAddress *obja = (const ObjectAddress *) a;
2027  const ObjectAddress *objb = (const ObjectAddress *) b;
2028 
2029  if (obja->classId < objb->classId)
2030  return -1;
2031  if (obja->classId > objb->classId)
2032  return 1;
2033  if (obja->objectId < objb->objectId)
2034  return -1;
2035  if (obja->objectId > objb->objectId)
2036  return 1;
2037 
2038  /*
2039  * We sort the subId as an unsigned int so that 0 will come first. See
2040  * logic in eliminate_duplicate_dependencies.
2041  */
2042  if ((unsigned int) obja->objectSubId < (unsigned int) objb->objectSubId)
2043  return -1;
2044  if ((unsigned int) obja->objectSubId > (unsigned int) objb->objectSubId)
2045  return 1;
2046  return 0;
2047 }
2048 
2049 /*
2050  * Routines for handling an expansible array of ObjectAddress items.
2051  *
2052  * new_object_addresses: create a new ObjectAddresses array.
2053  */
2056 {
2057  ObjectAddresses *addrs;
2058 
2059  addrs = palloc(sizeof(ObjectAddresses));
2060 
2061  addrs->numrefs = 0;
2062  addrs->maxrefs = 32;
2063  addrs->refs = (ObjectAddress *)
2064  palloc(addrs->maxrefs * sizeof(ObjectAddress));
2065  addrs->extras = NULL; /* until/unless needed */
2066 
2067  return addrs;
2068 }
2069 
2070 /*
2071  * Add an entry to an ObjectAddresses array.
2072  *
2073  * It is convenient to specify the class by ObjectClass rather than directly
2074  * by catalog OID.
2075  */
2076 static void
2077 add_object_address(ObjectClass oclass, Oid objectId, int32 subId,
2078  ObjectAddresses *addrs)
2079 {
2080  ObjectAddress *item;
2081 
2082  /*
2083  * Make sure object_classes is kept up to date with the ObjectClass enum.
2084  */
2086  "object_classes[] must cover all ObjectClasses");
2087 
2088  /* enlarge array if needed */
2089  if (addrs->numrefs >= addrs->maxrefs)
2090  {
2091  addrs->maxrefs *= 2;
2092  addrs->refs = (ObjectAddress *)
2093  repalloc(addrs->refs, addrs->maxrefs * sizeof(ObjectAddress));
2094  Assert(!addrs->extras);
2095  }
2096  /* record this item */
2097  item = addrs->refs + addrs->numrefs;
2098  item->classId = object_classes[oclass];
2099  item->objectId = objectId;
2100  item->objectSubId = subId;
2101  addrs->numrefs++;
2102 }
2103 
2104 /*
2105  * Add an entry to an ObjectAddresses array.
2106  *
2107  * As above, but specify entry exactly.
2108  */
2109 void
2111  ObjectAddresses *addrs)
2112 {
2113  ObjectAddress *item;
2114 
2115  /* enlarge array if needed */
2116  if (addrs->numrefs >= addrs->maxrefs)
2117  {
2118  addrs->maxrefs *= 2;
2119  addrs->refs = (ObjectAddress *)
2120  repalloc(addrs->refs, addrs->maxrefs * sizeof(ObjectAddress));
2121  Assert(!addrs->extras);
2122  }
2123  /* record this item */
2124  item = addrs->refs + addrs->numrefs;
2125  *item = *object;
2126  addrs->numrefs++;
2127 }
2128 
2129 /*
2130  * Add an entry to an ObjectAddresses array.
2131  *
2132  * As above, but specify entry exactly and provide some "extra" data too.
2133  */
2134 static void
2136  const ObjectAddressExtra *extra,
2137  ObjectAddresses *addrs)
2138 {
2139  ObjectAddress *item;
2140  ObjectAddressExtra *itemextra;
2141 
2142  /* allocate extra space if first time */
2143  if (!addrs->extras)
2144  addrs->extras = (ObjectAddressExtra *)
2145  palloc(addrs->maxrefs * sizeof(ObjectAddressExtra));
2146 
2147  /* enlarge array if needed */
2148  if (addrs->numrefs >= addrs->maxrefs)
2149  {
2150  addrs->maxrefs *= 2;
2151  addrs->refs = (ObjectAddress *)
2152  repalloc(addrs->refs, addrs->maxrefs * sizeof(ObjectAddress));
2153  addrs->extras = (ObjectAddressExtra *)
2154  repalloc(addrs->extras, addrs->maxrefs * sizeof(ObjectAddressExtra));
2155  }
2156  /* record this item */
2157  item = addrs->refs + addrs->numrefs;
2158  *item = *object;
2159  itemextra = addrs->extras + addrs->numrefs;
2160  *itemextra = *extra;
2161  addrs->numrefs++;
2162 }
2163 
2164 /*
2165  * Test whether an object is present in an ObjectAddresses array.
2166  *
2167  * We return "true" if object is a subobject of something in the array, too.
2168  */
2169 bool
2171  const ObjectAddresses *addrs)
2172 {
2173  int i;
2174 
2175  for (i = addrs->numrefs - 1; i >= 0; i--)
2176  {
2177  const ObjectAddress *thisobj = addrs->refs + i;
2178 
2179  if (object->classId == thisobj->classId &&
2180  object->objectId == thisobj->objectId)
2181  {
2182  if (object->objectSubId == thisobj->objectSubId ||
2183  thisobj->objectSubId == 0)
2184  return true;
2185  }
2186  }
2187 
2188  return false;
2189 }
2190 
2191 /*
2192  * As above, except that if the object is present then also OR the given
2193  * flags into its associated extra data (which must exist).
2194  */
2195 static bool
2197  int flags,
2198  ObjectAddresses *addrs)
2199 {
2200  bool result = false;
2201  int i;
2202 
2203  for (i = addrs->numrefs - 1; i >= 0; i--)
2204  {
2205  ObjectAddress *thisobj = addrs->refs + i;
2206 
2207  if (object->classId == thisobj->classId &&
2208  object->objectId == thisobj->objectId)
2209  {
2210  if (object->objectSubId == thisobj->objectSubId)
2211  {
2212  ObjectAddressExtra *thisextra = addrs->extras + i;
2213 
2214  thisextra->flags |= flags;
2215  result = true;
2216  }
2217  else if (thisobj->objectSubId == 0)
2218  {
2219  /*
2220  * We get here if we find a need to delete a column after
2221  * having already decided to drop its whole table. Obviously
2222  * we no longer need to drop the subobject, so report that we
2223  * found the subobject in the array. But don't plaster its
2224  * flags on the whole object.
2225  */
2226  result = true;
2227  }
2228  else if (object->objectSubId == 0)
2229  {
2230  /*
2231  * We get here if we find a need to delete a whole table after
2232  * having already decided to drop one of its columns. We
2233  * can't report that the whole object is in the array, but we
2234  * should mark the subobject with the whole object's flags.
2235  *
2236  * It might seem attractive to physically delete the column's
2237  * array entry, or at least mark it as no longer needing
2238  * separate deletion. But that could lead to, e.g., dropping
2239  * the column's datatype before we drop the table, which does
2240  * not seem like a good idea. This is a very rare situation
2241  * in practice, so we just take the hit of doing a separate
2242  * DROP COLUMN action even though we know we're gonna delete
2243  * the table later.
2244  *
2245  * Because there could be other subobjects of this object in
2246  * the array, this case means we always have to loop through
2247  * the whole array; we cannot exit early on a match.
2248  */
2249  ObjectAddressExtra *thisextra = addrs->extras + i;
2250 
2251  thisextra->flags |= flags;
2252  }
2253  }
2254  }
2255 
2256  return result;
2257 }
2258 
2259 /*
2260  * Similar to above, except we search an ObjectAddressStack.
2261  */
2262 static bool
2264  int flags,
2265  ObjectAddressStack *stack)
2266 {
2267  bool result = false;
2268  ObjectAddressStack *stackptr;
2269 
2270  for (stackptr = stack; stackptr; stackptr = stackptr->next)
2271  {
2272  const ObjectAddress *thisobj = stackptr->object;
2273 
2274  if (object->classId == thisobj->classId &&
2275  object->objectId == thisobj->objectId)
2276  {
2277  if (object->objectSubId == thisobj->objectSubId)
2278  {
2279  stackptr->flags |= flags;
2280  result = true;
2281  }
2282  else if (thisobj->objectSubId == 0)
2283  {
2284  /*
2285  * We're visiting a column with whole table already on stack.
2286  * As in object_address_present_add_flags(), we can skip
2287  * further processing of the subobject, but we don't want to
2288  * propagate flags for the subobject to the whole object.
2289  */
2290  result = true;
2291  }
2292  else if (object->objectSubId == 0)
2293  {
2294  /*
2295  * We're visiting a table with column already on stack. As in
2296  * object_address_present_add_flags(), we should propagate
2297  * flags for the whole object to each of its subobjects.
2298  */
2299  stackptr->flags |= flags;
2300  }
2301  }
2302  }
2303 
2304  return result;
2305 }
2306 
2307 /*
2308  * Record multiple dependencies from an ObjectAddresses array, after first
2309  * removing any duplicates.
2310  */
2311 void
2313  ObjectAddresses *referenced,
2314  DependencyType behavior)
2315 {
2317  recordMultipleDependencies(depender,
2318  referenced->refs, referenced->numrefs,
2319  behavior);
2320 }
2321 
2322 /*
2323  * Clean up when done with an ObjectAddresses array.
2324  */
2325 void
2327 {
2328  pfree(addrs->refs);
2329  if (addrs->extras)
2330  pfree(addrs->extras);
2331  pfree(addrs);
2332 }
2333 
2334 /*
2335  * Determine the class of a given object identified by objectAddress.
2336  *
2337  * This function is essentially the reverse mapping for the object_classes[]
2338  * table. We implement it as a function because the OIDs aren't consecutive.
2339  */
2342 {
2343  /* only pg_class entries can have nonzero objectSubId */
2344  if (object->classId != RelationRelationId &&
2345  object->objectSubId != 0)
2346  elog(ERROR, "invalid non-zero objectSubId for object class %u",
2347  object->classId);
2348 
2349  switch (object->classId)
2350  {
2351  case RelationRelationId:
2352  /* caller must check objectSubId */
2353  return OCLASS_CLASS;
2354 
2355  case ProcedureRelationId:
2356  return OCLASS_PROC;
2357 
2358  case TypeRelationId:
2359  return OCLASS_TYPE;
2360 
2361  case CastRelationId:
2362  return OCLASS_CAST;
2363 
2364  case CollationRelationId:
2365  return OCLASS_COLLATION;
2366 
2367  case ConstraintRelationId:
2368  return OCLASS_CONSTRAINT;
2369 
2370  case ConversionRelationId:
2371  return OCLASS_CONVERSION;
2372 
2373  case AttrDefaultRelationId:
2374  return OCLASS_DEFAULT;
2375 
2376  case LanguageRelationId:
2377  return OCLASS_LANGUAGE;
2378 
2379  case LargeObjectRelationId:
2380  return OCLASS_LARGEOBJECT;
2381 
2382  case OperatorRelationId:
2383  return OCLASS_OPERATOR;
2384 
2386  return OCLASS_OPCLASS;
2387 
2389  return OCLASS_OPFAMILY;
2390 
2392  return OCLASS_AM;
2393 
2395  return OCLASS_AMOP;
2396 
2398  return OCLASS_AMPROC;
2399 
2400  case RewriteRelationId:
2401  return OCLASS_REWRITE;
2402 
2403  case TriggerRelationId:
2404  return OCLASS_TRIGGER;
2405 
2406  case NamespaceRelationId:
2407  return OCLASS_SCHEMA;
2408 
2410  return OCLASS_STATISTIC_EXT;
2411 
2412  case TSParserRelationId:
2413  return OCLASS_TSPARSER;
2414 
2416  return OCLASS_TSDICT;
2417 
2418  case TSTemplateRelationId:
2419  return OCLASS_TSTEMPLATE;
2420 
2421  case TSConfigRelationId:
2422  return OCLASS_TSCONFIG;
2423 
2424  case AuthIdRelationId:
2425  return OCLASS_ROLE;
2426 
2427  case DatabaseRelationId:
2428  return OCLASS_DATABASE;
2429 
2430  case TableSpaceRelationId:
2431  return OCLASS_TBLSPACE;
2432 
2434  return OCLASS_FDW;
2435 
2437  return OCLASS_FOREIGN_SERVER;
2438 
2439  case UserMappingRelationId:
2440  return OCLASS_USER_MAPPING;
2441 
2442  case DefaultAclRelationId:
2443  return OCLASS_DEFACL;
2444 
2445  case ExtensionRelationId:
2446  return OCLASS_EXTENSION;
2447 
2449  return OCLASS_EVENT_TRIGGER;
2450 
2451  case PolicyRelationId:
2452  return OCLASS_POLICY;
2453 
2454  case PublicationRelationId:
2455  return OCLASS_PUBLICATION;
2456 
2458  return OCLASS_PUBLICATION_REL;
2459 
2461  return OCLASS_SUBSCRIPTION;
2462 
2463  case TransformRelationId:
2464  return OCLASS_TRANSFORM;
2465  }
2466 
2467  /* shouldn't get here */
2468  elog(ERROR, "unrecognized object class: %u", object->classId);
2469  return OCLASS_CLASS; /* keep compiler quiet */
2470 }
2471 
2472 /*
2473  * delete initial ACL for extension objects
2474  */
2475 static void
2477 {
2478  Relation relation;
2479  ScanKeyData key[3];
2480  SysScanDesc scan;
2481  HeapTuple oldtuple;
2482 
2484 
2485  ScanKeyInit(&key[0],
2487  BTEqualStrategyNumber, F_OIDEQ,
2488  ObjectIdGetDatum(object->objectId));
2489  ScanKeyInit(&key[1],
2491  BTEqualStrategyNumber, F_OIDEQ,
2492  ObjectIdGetDatum(object->classId));
2493  ScanKeyInit(&key[2],
2495  BTEqualStrategyNumber, F_INT4EQ,
2496  Int32GetDatum(object->objectSubId));
2497 
2498  scan = systable_beginscan(relation, InitPrivsObjIndexId, true,
2499  NULL, 3, key);
2500 
2501  while (HeapTupleIsValid(oldtuple = systable_getnext(scan)))
2502  CatalogTupleDelete(relation, &oldtuple->t_self);
2503 
2504  systable_endscan(scan);
2505 
2506  heap_close(relation, RowExclusiveLock);
2507 }
Datum constvalue
Definition: primnodes.h:196
static void findDependentObjects(const ObjectAddress *object, int objflags, int flags, ObjectAddressStack *stack, ObjectAddresses *targetObjects, const ObjectAddresses *pendingObjects, Relation *depRel)
Definition: dependency.c:462
void RemoveTriggerById(Oid trigOid)
Definition: trigger.c:1275
Oid CurrentExtensionObject
Definition: extension.c:68
static void ReleaseDeletionLock(const ObjectAddress *object)
Definition: dependency.c:1326
DependencyType
Definition: dependency.h:73
bool query_tree_walker(Query *query, bool(*walker)(), void *context, int flags)
Definition: nodeFuncs.c:2245
#define REGCLASSOID
Definition: pg_type.h:577
#define Anum_pg_depend_refobjid
Definition: pg_depend.h:72
#define NamespaceRelationId
Definition: pg_namespace.h:34
static int object_address_comparator(const void *a, const void *b)
Definition: dependency.c:2024
#define IsA(nodeptr, _type_)
Definition: nodes.h:561
#define Anum_pg_depend_refobjsubid
Definition: pg_depend.h:73
#define OperatorRelationId
Definition: pg_operator.h:32
List * joinaliasvars
Definition: parsenodes.h:989
Index varlevelsup
Definition: primnodes.h:173
int errhint(const char *fmt,...)
Definition: elog.c:987
#define Anum_pg_depend_refclassid
Definition: pg_depend.h:71
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:499
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
List * sortClause
Definition: parsenodes.h:156
static void add_exact_object_address_extra(const ObjectAddress *object, const ObjectAddressExtra *extra, ObjectAddresses *addrs)
Definition: dependency.c:2135
static bool find_expr_references_walker(Node *node, find_expr_references_context *context)
Definition: dependency.c:1487
void RemoveStatisticsById(Oid statsOid)
Definition: statscmds.c:351
static void deleteOneObject(const ObjectAddress *object, Relation *depRel, int32 flags)
#define TransformRelationId
Definition: pg_transform.h:25
#define REGROLEOID
Definition: pg_type.h:585
void RemoveOpClassById(Oid opclassOid)
Definition: opclasscmds.c:1582
void DropTransformById(Oid transformOid)
int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...)
Definition: elog.c:850
void UnlockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:182
bool trackDroppedObjectsNeeded(void)
void RemoveExtensionById(Oid extId)
Definition: extension.c:1826
#define ProcedureRelationId
Definition: pg_proc.h:33
ObjectAddresses * addrs
Definition: dependency.c:130
List * constraintDeps
Definition: parsenodes.h:166
void DropProceduralLanguageById(Oid langOid)
Definition: proclang.c:528
char get_rel_relkind(Oid relid)
Definition: lsyscache.c:1801
void RemoveForeignDataWrapperById(Oid fdwId)
Definition: foreigncmds.c:837
#define DatumGetObjectId(X)
Definition: postgres.h:506
#define DatabaseRelationId
Definition: pg_database.h:29
#define RelationRelationId
Definition: pg_class.h:29
void record_object_address_dependencies(const ObjectAddress *depender, ObjectAddresses *referenced, DependencyType behavior)
Definition: dependency.c:2312
bool object_address_present(const ObjectAddress *object, const ObjectAddresses *addrs)
Definition: dependency.c:2170
#define DependReferenceIndexId
Definition: indexing.h:147
Oid resulttype
Definition: primnodes.h:812
#define Anum_pg_init_privs_classoid
Definition: pg_init_privs.h:69
List * opfamilies
Definition: primnodes.h:1033
#define DependDependerIndexId
Definition: indexing.h:145
#define PERFORM_DELETION_SKIP_ORIGINAL
Definition: dependency.h:177
#define DependRelationId
Definition: pg_depend.h:29
int resultRelation
Definition: parsenodes.h:120
void DeleteSecurityLabel(const ObjectAddress *object)
Definition: seclabel.c:446
#define LAST_OCLASS
Definition: dependency.h:171
#define OperatorClassRelationId
Definition: pg_opclass.h:49
void RemoveSchemaById(Oid schemaOid)
Definition: schemacmds.c:218
Definition: nodes.h:510
#define OperatorFamilyRelationId
Definition: pg_opfamily.h:29
void index_drop(Oid indexId, bool concurrent)
Definition: index.c:1347
int errcode(int sqlerrcode)
Definition: elog.c:575
#define MemSet(start, val, len)
Definition: c.h:863
AttrNumber varattno
Definition: primnodes.h:168
#define PublicationRelationId
void RemovePublicationById(Oid pubid)
void CatalogTupleDelete(Relation heapRel, ItemPointer tid)
Definition: indexing.c:255
void RemovePublicationRelById(Oid proid)
void add_exact_object_address(const ObjectAddress *object, ObjectAddresses *addrs)
Definition: dependency.c:2110
#define heap_close(r, l)
Definition: heapam.h:97
#define lengthof(array)
Definition: c.h:556
#define DEPFLAG_REVERSE
Definition: dependency.c:105
ObjectAddresses * new_object_addresses(void)
Definition: dependency.c:2055
List * list_copy_tail(const List *oldlist, int nskip)
Definition: list.c:1203
void RemoveAmProcEntryById(Oid entryOid)
Definition: opclasscmds.c:1630
#define LOG
Definition: elog.h:26
void free_object_addresses(ObjectAddresses *addrs)
Definition: dependency.c:2326
unsigned int Oid
Definition: postgres_ext.h:31
#define REGTYPEOID
Definition: pg_type.h:581
Definition: primnodes.h:163
#define InitPrivsObjIndexId
Definition: indexing.h:172
#define TypeRelationId
Definition: pg_type.h:34
void RemoveTypeById(Oid typeOid)
Definition: typecmds.c:689
#define REGOPEROID
Definition: pg_type.h:569
ObjectClass getObjectClass(const ObjectAddress *object)
Definition: dependency.c:2341
#define OidIsValid(objectId)
Definition: c.h:532
void RemoveCollationById(Oid collationOid)
Definition: pg_collation.c:211
void RemoveUserMappingById(Oid umId)
Definition: foreigncmds.c:1422
struct ObjectAddressStack * next
Definition: dependency.c:124
static void eliminate_duplicate_dependencies(ObjectAddresses *addrs)
Definition: dependency.c:1964
void RemoveConversionById(Oid conversionOid)
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:328
void RemoveAccessMethodById(Oid amOid)
Definition: amcmds.c:115
#define DefaultAclRelationId
#define Anum_pg_depend_objsubid
Definition: pg_depend.h:70
char * getObjectDescription(const ObjectAddress *object)
#define AccessMethodOperatorRelationId
Definition: pg_amop.h:54
signed int int32
Definition: c.h:246
List * windowClause
Definition: parsenodes.h:152
List * targetList
Definition: parsenodes.h:138
bool systable_recheck_tuple(SysScanDesc sysscan, HeapTuple tup)
Definition: genam.c:454
void RemoveOperatorById(Oid operOid)
Definition: operatorcmds.c:340
#define PublicationRelRelationId
#define AuthIdRelationId
Definition: pg_authid.h:42
#define PERFORM_DELETION_CONCURRENTLY
Definition: dependency.h:175
#define list_make1(x1)
Definition: pg_list.h:139
Oid consttype
Definition: primnodes.h:192
#define TSConfigRelationId
Definition: pg_ts_config.h:31
#define StaticAssertStmt(condition, errmessage)
Definition: c.h:763
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:416
#define SearchSysCacheExists1(cacheId, key1)
Definition: syscache.h:182
void pfree(void *pointer)
Definition: mcxt.c:949
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:78
bool resjunk
Definition: primnodes.h:1375
void RemoveDefaultACLById(Oid defaclOid)
Definition: aclchk.c:1468
List * rtable
Definition: parsenodes.h:135
List * distinctClause
Definition: parsenodes.h:154
Oid funcid
Definition: primnodes.h:449
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
#define DEPFLAG_ORIGINAL
Definition: dependency.c:100
static const Oid object_classes[]
Definition: dependency.c:138
Oid paramcollid
Definition: primnodes.h:248
#define DEPFLAG_AUTO
Definition: dependency.c:102
#define TSDictionaryRelationId
Definition: pg_ts_dict.h:31
void RemoveTSConfigurationById(Oid cfgId)
Definition: tsearchcmds.c:1125
ItemPointerData t_self
Definition: htup.h:65
const ObjectAddress * object
Definition: dependency.c:122
#define DEPFLAG_INTERNAL
Definition: dependency.c:103
Oid constcollid
Definition: primnodes.h:194
#define DEBUG2
Definition: elog.h:24
void RemoveOpFamilyById(Oid opfamilyOid)
Definition: opclasscmds.c:1563
void RemovePolicyById(Oid policy_id)
Definition: policy.c:350
#define SubscriptionRelationId
#define InitPrivsRelationId
Definition: pg_init_privs.h:42
void * list_nth(const List *list, int n)
Definition: list.c:410
#define Anum_pg_init_privs_objoid
Definition: pg_init_privs.h:68
static bool object_address_present_add_flags(const ObjectAddress *object, int flags, ObjectAddresses *addrs)
Definition: dependency.c:2196
#define AccessMethodRelationId
Definition: pg_am.h:32
struct ObjectAddressStack ObjectAddressStack
#define DEFAULT_COLLATION_OID
Definition: pg_collation.h:75
ObjectAddress * refs
Definition: dependency.c:111
ObjectClass
Definition: dependency.h:129
#define RowExclusiveLock
Definition: lockdefs.h:38
void RemoveTSParserById(Oid prsId)
Definition: tsearchcmds.c:292
int errdetail(const char *fmt,...)
Definition: elog.c:873
AttrNumber resno
Definition: primnodes.h:1369
void recordDependencyOnExpr(const ObjectAddress *depender, Node *expr, List *rtable, DependencyType behavior)
Definition: dependency.c:1351
void LockDatabaseObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:830
void RemoveAttributeById(Oid relid, AttrNumber attnum)
Definition: heap.c:1543
#define REGDICTIONARYOID
Definition: pg_type.h:627
void performDeletion(const ObjectAddress *object, DropBehavior behavior, int flags)
Definition: dependency.c:303
void RemoveTSTemplateById(Oid tmplId)
Definition: tsearchcmds.c:821
static void reportDependentObjects(const ObjectAddresses *targetObjects, DropBehavior behavior, int flags, const ObjectAddress *origObject)
Definition: dependency.c:828
int errdetail_log(const char *fmt,...)
Definition: elog.c:921
Oid winfnoid
Definition: primnodes.h:355
FormData_pg_depend * Form_pg_depend
Definition: pg_depend.h:61
void DeleteSequenceTuple(Oid relid)
Definition: sequence.c:516
void RemoveEventTriggerById(Oid trigOid)
void RemoveAttrDefaultById(Oid attrdefId)
Definition: heap.c:1685
#define ereport(elevel, rest)
Definition: elog.h:122
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
void LargeObjectDrop(Oid loid)
void deleteSharedDependencyRecordsFor(Oid classId, Oid objectId, int32 objectSubId)
Definition: pg_shdepend.c:823
void UnlockDatabaseObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition: lmgr.c:851
bool EventTriggerSupportsObjectClass(ObjectClass objclass)
void appendStringInfoChar(StringInfo str, char ch)
Definition: stringinfo.c:169
void initStringInfo(StringInfo str)
Definition: stringinfo.c:46
Index varno
Definition: primnodes.h:166
#define ngettext(s, p, n)
Definition: c.h:127
void RemoveAmOpEntryById(Oid entryOid)
Definition: opclasscmds.c:1601
DropBehavior
Definition: parsenodes.h:1678
static void AcquireDeletionLock(const ObjectAddress *object, int flags)
Definition: dependency.c:1299
void CommandCounterIncrement(void)
Definition: xact.c:915
void DeleteComments(Oid oid, Oid classoid, int32 subid)
Definition: comment.c:325
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
#define TSParserRelationId
Definition: pg_ts_parser.h:31
Oid resulttype
Definition: primnodes.h:792
#define CollationRelationId
Definition: pg_collation.h:30
int log_min_messages
Definition: guc.c:451
Oid resultcollid
Definition: primnodes.h:794
void RemoveForeignServerById(Oid srvId)
Definition: foreigncmds.c:1084
bool creating_extension
Definition: extension.c:67
Oid aggfnoid
Definition: primnodes.h:294
#define PolicyRelationId
Definition: pg_policy.h:19
#define RewriteRelationId
Definition: pg_rewrite.h:32
#define DEPFLAG_EXTENSION
Definition: dependency.c:104
#define NOTICE
Definition: elog.h:37
CmdType commandType
Definition: parsenodes.h:110
List * lcons(void *datum, List *list)
Definition: list.c:259
int errmsg_internal(const char *fmt,...)
Definition: elog.c:827
#define Anum_pg_init_privs_objsubid
Definition: pg_init_privs.h:70
#define ForeignServerRelationId
List * funccolcollations
Definition: parsenodes.h:1087
#define ShareUpdateExclusiveLock
Definition: lockdefs.h:39
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
#define Assert(condition)
Definition: c.h:681
#define lfirst(lc)
Definition: pg_list.h:106
void recordMultipleDependencies(const ObjectAddress *depender, const ObjectAddress *referenced, int nreferenced, DependencyType behavior)
Definition: pg_depend.c:56
#define StatisticExtRelationId
#define PERFORM_DELETION_QUIETLY
Definition: dependency.h:176
#define EventTriggerRelationId
#define TriggerRelationId
Definition: pg_trigger.h:34
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1834
Oid row_typeid
Definition: primnodes.h:987
static int list_length(const List *l)
Definition: pg_list.h:89
#define CastRelationId
Definition: pg_cast.h:31
void EventTriggerSQLDropAddObject(const ObjectAddress *object, bool original, bool normal)
#define ForeignDataWrapperRelationId
static void doDeletion(const ObjectAddress *object, int flags)
Definition: dependency.c:1104
void recordDependencyOnSingleRelExpr(const ObjectAddress *depender, Node *expr, Oid relId, DependencyType behavior, DependencyType self_behavior, bool ignore_self)
Definition: dependency.c:1392
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:962
#define InvalidAttrNumber
Definition: attnum.h:23
void RemoveFunctionById(Oid funcOid)
#define TableSpaceRelationId
Definition: pg_tablespace.h:29
#define REGCONFIGOID
Definition: pg_type.h:624
RTEKind rtekind
Definition: parsenodes.h:945
ObjectAddressExtra * extras
Definition: dependency.c:112
#define AccessExclusiveLock
Definition: lockdefs.h:45
#define Int32GetDatum(X)
Definition: postgres.h:485
List * groupClause
Definition: parsenodes.h:146
void * palloc(Size size)
Definition: mcxt.c:848
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define DEPFLAG_NORMAL
Definition: dependency.c:101
NodeTag type
Definition: parsenodes.h:943
#define UserMappingRelationId
void list_free(List *list)
Definition: list.c:1133
void RemoveRewriteRuleById(Oid ruleOid)
Definition: rewriteRemove.c:38
int i
static void DeleteInitPrivs(const ObjectAddress *object)
Definition: dependency.c:2476
#define RELKIND_INDEX
Definition: pg_class.h:161
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
int client_min_messages
Definition: guc.c:452
#define LanguageRelationId
Definition: pg_language.h:29
#define ConstraintRelationId
Definition: pg_constraint.h:29
static void deleteObjectsInList(ObjectAddresses *targetObjects, Relation *depRel, int flags)
Definition: dependency.c:219
Oid opno
Definition: primnodes.h:496
void DropCastById(Oid castOid)
#define Anum_pg_depend_classid
Definition: pg_depend.h:68
void performMultipleDeletions(const ObjectAddresses *objects, DropBehavior behavior, int flags)
Definition: dependency.c:362
#define elog
Definition: elog.h:219
#define MAX_REPORTED_DEPS
#define ExtensionRelationId
Definition: pg_extension.h:29
#define qsort(a, b, c, d)
Definition: port.h:447
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:105
#define REGPROCEDUREOID
Definition: pg_type.h:565
static bool stack_address_present_add_flags(const ObjectAddress *object, int flags, ObjectAddressStack *stack)
Definition: dependency.c:2263
#define AttrDefaultRelationId
Definition: pg_attrdef.h:29
#define PERFORM_DELETION_SKIP_EXTENSIONS
Definition: dependency.h:178
#define RELKIND_RELATION
Definition: pg_class.h:160
void heap_drop_with_catalog(Oid relid)
Definition: heap.c:1758
#define LargeObjectRelationId
#define AccessMethodProcedureRelationId
Definition: pg_amproc.h:43
#define RELKIND_SEQUENCE
Definition: pg_class.h:162
Definition: pg_list.h:45
#define ConversionRelationId
Definition: pg_conversion.h:38
#define REGNAMESPACEOID
Definition: pg_type.h:589
static void add_object_address(ObjectClass oclass, Oid objectId, int32 subId, ObjectAddresses *addrs)
Definition: dependency.c:2077
ObjectAddress dependee
Definition: dependency.c:96
void RemoveConstraintById(Oid conId)
#define _(x)
Definition: elog.c:84
#define Anum_pg_depend_objid
Definition: pg_depend.h:69
Oid paramtype
Definition: primnodes.h:246
#define InvokeObjectDropHookArg(classId, objectId, subId, dropflags)
Definition: objectaccess.h:156
bool constisnull
Definition: primnodes.h:197
#define BTEqualStrategyNumber
Definition: stratnum.h:31
#define lfirst_oid(lc)
Definition: pg_list.h:108
#define REGOPERATOROID
Definition: pg_type.h:573
List * list_delete_first(List *list)
Definition: list.c:666
#define REGPROCOID
Definition: pg_type.h:320
#define TSTemplateRelationId
#define PERFORM_DELETION_INTERNAL
Definition: dependency.h:174
#define QTW_IGNORE_JOINALIASES
Definition: nodeFuncs.h:23
void RemoveTSDictionaryById(Oid dictId)
Definition: tsearchcmds.c:501