Debian Codegraph @

src/backend/catalog/dependency.c

raw
1 /*-------------------------------------------------------------------------
2 *
3 * dependency.c
4 * Routines to support inter-object dependencies.
5 *
6 *
7 * Portions Copyright (c) 1996-2025, 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/genam.h"
18 #include "access/htup_details.h"
19 #include "access/table.h"
20 #include "access/xact.h"
21 #include "catalog/catalog.h"
22 #include "catalog/dependency.h"
23 #include "catalog/heap.h"
24 #include "catalog/index.h"
25 #include "catalog/objectaccess.h"
26 #include "catalog/pg_am.h"
27 #include "catalog/pg_amop.h"
28 #include "catalog/pg_amproc.h"
29 #include "catalog/pg_attrdef.h"
30 #include "catalog/pg_authid.h"
31 #include "catalog/pg_auth_members.h"
32 #include "catalog/pg_cast.h"
33 #include "catalog/pg_collation.h"
34 #include "catalog/pg_constraint.h"
35 #include "catalog/pg_conversion.h"
36 #include "catalog/pg_database.h"
37 #include "catalog/pg_default_acl.h"
38 #include "catalog/pg_depend.h"
39 #include "catalog/pg_event_trigger.h"
40 #include "catalog/pg_extension.h"
41 #include "catalog/pg_foreign_data_wrapper.h"
42 #include "catalog/pg_foreign_server.h"
43 #include "catalog/pg_init_privs.h"
44 #include "catalog/pg_language.h"
45 #include "catalog/pg_largeobject.h"
46 #include "catalog/pg_namespace.h"
47 #include "catalog/pg_opclass.h"
48 #include "catalog/pg_operator.h"
49 #include "catalog/pg_opfamily.h"
50 #include "catalog/pg_parameter_acl.h"
51 #include "catalog/pg_policy.h"
52 #include "catalog/pg_proc.h"
53 #include "catalog/pg_publication.h"
54 #include "catalog/pg_publication_namespace.h"
55 #include "catalog/pg_publication_rel.h"
56 #include "catalog/pg_rewrite.h"
57 #include "catalog/pg_statistic_ext.h"
58 #include "catalog/pg_subscription.h"
59 #include "catalog/pg_tablespace.h"
60 #include "catalog/pg_transform.h"
61 #include "catalog/pg_trigger.h"
62 #include "catalog/pg_ts_config.h"
63 #include "catalog/pg_ts_dict.h"
64 #include "catalog/pg_ts_parser.h"
65 #include "catalog/pg_ts_template.h"
66 #include "catalog/pg_type.h"
67 #include "catalog/pg_user_mapping.h"
68 #include "commands/comment.h"
69 #include "commands/defrem.h"
70 #include "commands/event_trigger.h"
71 #include "commands/extension.h"
72 #include "commands/policy.h"
73 #include "commands/publicationcmds.h"
74 #include "commands/seclabel.h"
75 #include "commands/sequence.h"
76 #include "commands/trigger.h"
77 #include "commands/typecmds.h"
78 #include "funcapi.h"
79 #include "miscadmin.h"
80 #include "nodes/nodeFuncs.h"
81 #include "parser/parsetree.h"
82 #include "rewrite/rewriteRemove.h"
83 #include "storage/lmgr.h"
84 #include "utils/fmgroids.h"
85 #include "utils/lsyscache.h"
86 #include "utils/syscache.h"
87
88
89 /*
90 * Deletion processing requires additional state for each ObjectAddress that
91 * it's planning to delete. For simplicity and code-sharing we make the
92 * ObjectAddresses code support arrays with or without this extra state.
93 */
94 typedef struct
95 {
96 int flags; /* bitmask, see bit definitions below */
97 ObjectAddress dependee; /* object whose deletion forced this one */
98 } ObjectAddressExtra;
99
100 /* ObjectAddressExtra flag bits */
101 #define DEPFLAG_ORIGINAL 0x0001 /* an original deletion target */
102 #define DEPFLAG_NORMAL 0x0002 /* reached via normal dependency */
103 #define DEPFLAG_AUTO 0x0004 /* reached via auto dependency */
104 #define DEPFLAG_INTERNAL 0x0008 /* reached via internal dependency */
105 #define DEPFLAG_PARTITION 0x0010 /* reached via partition dependency */
106 #define DEPFLAG_EXTENSION 0x0020 /* reached via extension dependency */
107 #define DEPFLAG_REVERSE 0x0040 /* reverse internal/extension link */
108 #define DEPFLAG_IS_PART 0x0080 /* has a partition dependency */
109 #define DEPFLAG_SUBOBJECT 0x0100 /* subobject of another deletable object */
110
111
112 /* expansible list of ObjectAddresses */
113 struct ObjectAddresses
114 {
115 ObjectAddress *refs; /* => palloc'd array */
116 ObjectAddressExtra *extras; /* => palloc'd array, or NULL if not used */
117 int numrefs; /* current number of references */
118 int maxrefs; /* current size of palloc'd array(s) */
119 };
120
121 /* typedef ObjectAddresses appears in dependency.h */
122
123 /* threaded list of ObjectAddresses, for recursion detection */
124 typedef struct ObjectAddressStack
125 {
126 const ObjectAddress *object; /* object being visited */
127 int flags; /* its current flag bits */
128 struct ObjectAddressStack *next; /* next outer stack level */
129 } ObjectAddressStack;
130
131 /* temporary storage in findDependentObjects */
132 typedef struct
133 {
134 ObjectAddress obj; /* object to be deleted --- MUST BE FIRST */
135 int subflags; /* flags to pass down when recursing to obj */
136 } ObjectAddressAndFlags;
137
138 /* for find_expr_references_walker */
139 typedef struct
140 {
141 ObjectAddresses *addrs; /* addresses being accumulated */
142 List *rtables; /* list of rangetables to resolve Vars */
143 } find_expr_references_context;
144
145
146 static void findDependentObjects(const ObjectAddress *object,
147 int objflags,
148 int flags,
149 ObjectAddressStack *stack,
150 ObjectAddresses *targetObjects,
151 const ObjectAddresses *pendingObjects,
152 Relation *depRel);
153 static void reportDependentObjects(const ObjectAddresses *targetObjects,
154 DropBehavior behavior,
155 int flags,
156 const ObjectAddress *origObject);
157 static void deleteOneObject(const ObjectAddress *object,
158 Relation *depRel, int32 flags);
159 static void doDeletion(const ObjectAddress *object, int flags);
160 static bool find_expr_references_walker(Node *node,
161 find_expr_references_context *context);
162 static void process_function_rte_ref(RangeTblEntry *rte, AttrNumber attnum,
163 find_expr_references_context *context);
164 static void eliminate_duplicate_dependencies(ObjectAddresses *addrs);
165 static int object_address_comparator(const void *a, const void *b);
166 static void add_object_address(Oid classId, Oid objectId, int32 subId,
167 ObjectAddresses *addrs);
168 static void add_exact_object_address_extra(const ObjectAddress *object,
169 const ObjectAddressExtra *extra,
170 ObjectAddresses *addrs);
171 static bool object_address_present_add_flags(const ObjectAddress *object,
172 int flags,
173 ObjectAddresses *addrs);
174 static bool stack_address_present_add_flags(const ObjectAddress *object,
175 int flags,
176 ObjectAddressStack *stack);
177 static void DeleteInitPrivs(const ObjectAddress *object);
178
179
180 /*
181 * Go through the objects given running the final actions on them, and execute
182 * the actual deletion.
183 */
184 static void
185 deleteObjectsInList(ObjectAddresses *targetObjects, Relation *depRel,
186 int flags)
187 {
188 int i;
189
190 /*
191 * Keep track of objects for event triggers, if necessary.
192 */
193 if (trackDroppedObjectsNeeded() && !(flags & PERFORM_DELETION_INTERNAL))
194 {
195 for (i = 0; i < targetObjects->numrefs; i++)
196 {
197 const ObjectAddress *thisobj = &targetObjects->refs[i];
198 const ObjectAddressExtra *extra = &targetObjects->extras[i];
199 bool original = false;
200 bool normal = false;
201
202 if (extra->flags & DEPFLAG_ORIGINAL)
203 original = true;
204 if (extra->flags & DEPFLAG_NORMAL)
205 normal = true;
206 if (extra->flags & DEPFLAG_REVERSE)
207 normal = true;
208
209 if (EventTriggerSupportsObject(thisobj))
210 {
211 EventTriggerSQLDropAddObject(thisobj, original, normal);
212 }
213 }
214 }
215
216 /*
217 * Delete all the objects in the proper order, except that if told to, we
218 * should skip the original object(s).
219 */
220 for (i = 0; i < targetObjects->numrefs; i++)
221 {
222 ObjectAddress *thisobj = targetObjects->refs + i;
223 ObjectAddressExtra *thisextra = targetObjects->extras + i;
224
225 if ((flags & PERFORM_DELETION_SKIP_ORIGINAL) &&
226 (thisextra->flags & DEPFLAG_ORIGINAL))
227 continue;
228
229 deleteOneObject(thisobj, depRel, flags);
230 }
231 }
232
233 /*
234 * performDeletion: attempt to drop the specified object. If CASCADE
235 * behavior is specified, also drop any dependent objects (recursively).
236 * If RESTRICT behavior is specified, error out if there are any dependent
237 * objects, except for those that should be implicitly dropped anyway
238 * according to the dependency type.
239 *
240 * This is the outer control routine for all forms of DROP that drop objects
241 * that can participate in dependencies. Note that performMultipleDeletions
242 * is a variant on the same theme; if you change anything here you'll likely
243 * need to fix that too.
244 *
245 * Bits in the flags argument can include:
246 *
247 * PERFORM_DELETION_INTERNAL: indicates that the drop operation is not the
248 * direct result of a user-initiated action. For example, when a temporary
249 * schema is cleaned out so that a new backend can use it, or when a column
250 * default is dropped as an intermediate step while adding a new one, that's
251 * an internal operation. On the other hand, when we drop something because
252 * the user issued a DROP statement against it, that's not internal. Currently
253 * this suppresses calling event triggers and making some permissions checks.
254 *
255 * PERFORM_DELETION_CONCURRENTLY: perform the drop concurrently. This does
256 * not currently work for anything except dropping indexes; don't set it for
257 * other object types or you may get strange results.
258 *
259 * PERFORM_DELETION_QUIETLY: reduce message level from NOTICE to DEBUG2.
260 *
261 * PERFORM_DELETION_SKIP_ORIGINAL: do not delete the specified object(s),
262 * but only what depends on it/them.
263 *
264 * PERFORM_DELETION_SKIP_EXTENSIONS: do not delete extensions, even when
265 * deleting objects that are part of an extension. This should generally
266 * be used only when dropping temporary objects.
267 *
268 * PERFORM_DELETION_CONCURRENT_LOCK: perform the drop normally but with a lock
269 * as if it were concurrent. This is used by REINDEX CONCURRENTLY.
270 *
271 */
272 void
273 performDeletion(const ObjectAddress *object,
274 DropBehavior behavior, int flags)
275 {
276 Relation depRel;
277 ObjectAddresses *targetObjects;
278
279 /*
280 * We save some cycles by opening pg_depend just once and passing the
281 * Relation pointer down to all the recursive deletion steps.
282 */
283 depRel = table_open(DependRelationId, RowExclusiveLock);
284
285 /*
286 * Acquire deletion lock on the target object. (Ideally the caller has
287 * done this already, but many places are sloppy about it.)
288 */
289 AcquireDeletionLock(object, 0);
290
291 /*
292 * Construct a list of objects to delete (ie, the given object plus
293 * everything directly or indirectly dependent on it).
294 */
295 targetObjects = new_object_addresses();
296
297 findDependentObjects(object,
298 DEPFLAG_ORIGINAL,
299 flags,
300 NULL, /* empty stack */
301 targetObjects,
302 NULL, /* no pendingObjects */
303 &depRel);
304
305 /*
306 * Check if deletion is allowed, and report about cascaded deletes.
307 */
308 reportDependentObjects(targetObjects,
309 behavior,
310 flags,
311 object);
312
313 /* do the deed */
314 deleteObjectsInList(targetObjects, &depRel, flags);
315
316 /* And clean up */
317 free_object_addresses(targetObjects);
318
319 table_close(depRel, RowExclusiveLock);
320 }
321
322 /*
323 * performMultipleDeletions: Similar to performDeletion, but act on multiple
324 * objects at once.
325 *
326 * The main difference from issuing multiple performDeletion calls is that the
327 * list of objects that would be implicitly dropped, for each object to be
328 * dropped, is the union of the implicit-object list for all objects. This
329 * makes each check be more relaxed.
330 */
331 void
332 performMultipleDeletions(const ObjectAddresses *objects,
333 DropBehavior behavior, int flags)
334 {
335 Relation depRel;
336 ObjectAddresses *targetObjects;
337 int i;
338
339 /* No work if no objects... */
340 if (objects->numrefs <= 0)
341 return;
342
343 /*
344 * We save some cycles by opening pg_depend just once and passing the
345 * Relation pointer down to all the recursive deletion steps.
346 */
347 depRel = table_open(DependRelationId, RowExclusiveLock);
348
349 /*
350 * Construct a list of objects to delete (ie, the given objects plus
351 * everything directly or indirectly dependent on them). Note that
352 * because we pass the whole objects list as pendingObjects context, we
353 * won't get a failure from trying to delete an object that is internally
354 * dependent on another one in the list; we'll just skip that object and
355 * delete it when we reach its owner.
356 */
357 targetObjects = new_object_addresses();
358
359 for (i = 0; i < objects->numrefs; i++)
360 {
361 const ObjectAddress *thisobj = objects->refs + i;
362
363 /*
364 * Acquire deletion lock on each target object. (Ideally the caller
365 * has done this already, but many places are sloppy about it.)
366 */
367 AcquireDeletionLock(thisobj, flags);
368
369 findDependentObjects(thisobj,
370 DEPFLAG_ORIGINAL,
371 flags,
372 NULL, /* empty stack */
373 targetObjects,
374 objects,
375 &depRel);
376 }
377
378 /*
379 * Check if deletion is allowed, and report about cascaded deletes.
380 *
381 * If there's exactly one object being deleted, report it the same way as
382 * in performDeletion(), else we have to be vaguer.
383 */
384 reportDependentObjects(targetObjects,
385 behavior,
386 flags,
387 (objects->numrefs == 1 ? objects->refs : NULL));
388
389 /* do the deed */
390 deleteObjectsInList(targetObjects, &depRel, flags);
391
392 /* And clean up */
393 free_object_addresses(targetObjects);
394
395 table_close(depRel, RowExclusiveLock);
396 }
397
398 /*
399 * findDependentObjects - find all objects that depend on 'object'
400 *
401 * For every object that depends on the starting object, acquire a deletion
402 * lock on the object, add it to targetObjects (if not already there),
403 * and recursively find objects that depend on it. An object's dependencies
404 * will be placed into targetObjects before the object itself; this means
405 * that the finished list's order represents a safe deletion order.
406 *
407 * The caller must already have a deletion lock on 'object' itself,
408 * but must not have added it to targetObjects. (Note: there are corner
409 * cases where we won't add the object either, and will also release the
410 * caller-taken lock. This is a bit ugly, but the API is set up this way
411 * to allow easy rechecking of an object's liveness after we lock it. See
412 * notes within the function.)
413 *
414 * When dropping a whole object (subId = 0), we find dependencies for
415 * its sub-objects too.
416 *
417 * object: the object to add to targetObjects and find dependencies on
418 * objflags: flags to be ORed into the object's targetObjects entry
419 * flags: PERFORM_DELETION_xxx flags for the deletion operation as a whole
420 * stack: list of objects being visited in current recursion; topmost item
421 * is the object that we recursed from (NULL for external callers)
422 * targetObjects: list of objects that are scheduled to be deleted
423 * pendingObjects: list of other objects slated for destruction, but
424 * not necessarily in targetObjects yet (can be NULL if none)
425 * *depRel: already opened pg_depend relation
426 *
427 * Note: objflags describes the reason for visiting this particular object
428 * at this time, and is not passed down when recursing. The flags argument
429 * is passed down, since it describes what we're doing overall.
430 */
431 static void
432 findDependentObjects(const ObjectAddress *object,
433 int objflags,
434 int flags,
435 ObjectAddressStack *stack,
436 ObjectAddresses *targetObjects,
437 const ObjectAddresses *pendingObjects,
438 Relation *depRel)
439 {
440 ScanKeyData key[3];
441 int nkeys;
442 SysScanDesc scan;
443 HeapTuple tup;
444 ObjectAddress otherObject;
445 ObjectAddress owningObject;
446 ObjectAddress partitionObject;
447 ObjectAddressAndFlags *dependentObjects;
448 int numDependentObjects;
449 int maxDependentObjects;
450 ObjectAddressStack mystack;
451 ObjectAddressExtra extra;
452
453 /*
454 * If the target object is already being visited in an outer recursion
455 * level, just report the current objflags back to that level and exit.
456 * This is needed to avoid infinite recursion in the face of circular
457 * dependencies.
458 *
459 * The stack check alone would result in dependency loops being broken at
460 * an arbitrary point, ie, the first member object of the loop to be
461 * visited is the last one to be deleted. This is obviously unworkable.
462 * However, the check for internal dependency below guarantees that we
463 * will not break a loop at an internal dependency: if we enter the loop
464 * at an "owned" object we will switch and start at the "owning" object
465 * instead. We could probably hack something up to avoid breaking at an
466 * auto dependency, too, if we had to. However there are no known cases
467 * where that would be necessary.
468 */
469 if (stack_address_present_add_flags(object, objflags, stack))
470 return;
471
472 /*
473 * since this function recurses, it could be driven to stack overflow,
474 * because of the deep dependency tree, not only due to dependency loops.
475 */
476 check_stack_depth();
477
478 /*
479 * It's also possible that the target object has already been completely
480 * processed and put into targetObjects. If so, again we just add the
481 * specified objflags to its entry and return.
482 *
483 * (Note: in these early-exit cases we could release the caller-taken
484 * lock, since the object is presumably now locked multiple times; but it
485 * seems not worth the cycles.)
486 */
487 if (object_address_present_add_flags(object, objflags, targetObjects))
488 return;
489
490 /*
491 * If the target object is pinned, we can just error out immediately; it
492 * won't have any objects recorded as depending on it.
493 */
494 if (IsPinnedObject(object->classId, object->objectId))
495 ereport(ERROR,
496 (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
497 errmsg("cannot drop %s because it is required by the database system",
498 getObjectDescription(object, false))));
499
500 /*
501 * The target object might be internally dependent on some other object
502 * (its "owner"), and/or be a member of an extension (also considered its
503 * owner). If so, and if we aren't recursing from the owning object, we
504 * have to transform this deletion request into a deletion request of the
505 * owning object. (We'll eventually recurse back to this object, but the
506 * owning object has to be visited first so it will be deleted after.) The
507 * way to find out about this is to scan the pg_depend entries that show
508 * what this object depends on.
509 */
510 ScanKeyInit(&key[0],
511 Anum_pg_depend_classid,
512 BTEqualStrategyNumber, F_OIDEQ,
513 ObjectIdGetDatum(object->classId));
514 ScanKeyInit(&key[1],
515 Anum_pg_depend_objid,
516 BTEqualStrategyNumber, F_OIDEQ,
517 ObjectIdGetDatum(object->objectId));
518 if (object->objectSubId != 0)
519 {
520 /* Consider only dependencies of this sub-object */
521 ScanKeyInit(&key[2],
522 Anum_pg_depend_objsubid,
523 BTEqualStrategyNumber, F_INT4EQ,
524 Int32GetDatum(object->objectSubId));
525 nkeys = 3;
526 }
527 else
528 {
529 /* Consider dependencies of this object and any sub-objects it has */
530 nkeys = 2;
531 }
532
533 scan = systable_beginscan(*depRel, DependDependerIndexId, true,
534 NULL, nkeys, key);
535
536 /* initialize variables that loop may fill */
537 memset(&owningObject, 0, sizeof(owningObject));
538 memset(&partitionObject, 0, sizeof(partitionObject));
539
540 while (HeapTupleIsValid(tup = systable_getnext(scan)))
541 {
542 Form_pg_depend foundDep = (Form_pg_depend) GETSTRUCT(tup);
543
544 otherObject.classId = foundDep->refclassid;
545 otherObject.objectId = foundDep->refobjid;
546 otherObject.objectSubId = foundDep->refobjsubid;
547
548 /*
549 * When scanning dependencies of a whole object, we may find rows
550 * linking sub-objects of the object to the object itself. (Normally,
551 * such a dependency is implicit, but we must make explicit ones in
552 * some cases involving partitioning.) We must ignore such rows to
553 * avoid infinite recursion.
554 */
555 if (otherObject.classId == object->classId &&
556 otherObject.objectId == object->objectId &&
557 object->objectSubId == 0)
558 continue;
559
560 switch (foundDep->deptype)
561 {
562 case DEPENDENCY_NORMAL:
563 case DEPENDENCY_AUTO:
564 case DEPENDENCY_AUTO_EXTENSION:
565 /* no problem */
566 break;
567
568 case DEPENDENCY_EXTENSION:
569
570 /*
571 * If told to, ignore EXTENSION dependencies altogether. This
572 * flag is normally used to prevent dropping extensions during
573 * temporary-object cleanup, even if a temp object was created
574 * during an extension script.
575 */
576 if (flags & PERFORM_DELETION_SKIP_EXTENSIONS)
577 break;
578
579 /*
580 * If the other object is the extension currently being
581 * created/altered, ignore this dependency and continue with
582 * the deletion. This allows dropping of an extension's
583 * objects within the extension's scripts, as well as corner
584 * cases such as dropping a transient object created within
585 * such a script.
586 */
587 if (creating_extension &&
588 otherObject.classId == ExtensionRelationId &&
589 otherObject.objectId == CurrentExtensionObject)
590 break;
591
592 /* Otherwise, treat this like an internal dependency */
593 /* FALL THRU */
594
595 case DEPENDENCY_INTERNAL:
596
597 /*
598 * This object is part of the internal implementation of
599 * another object, or is part of the extension that is the
600 * other object. We have three cases:
601 *
602 * 1. At the outermost recursion level, we must disallow the
603 * DROP. However, if the owning object is listed in
604 * pendingObjects, just release the caller's lock and return;
605 * we'll eventually complete the DROP when we reach that entry
606 * in the pending list.
607 *
608 * Note: the above statement is true only if this pg_depend
609 * entry still exists by then; in principle, therefore, we
610 * could miss deleting an item the user told us to delete.
611 * However, no inconsistency can result: since we're at outer
612 * level, there is no object depending on this one.
613 */
614 if (stack == NULL)
615 {
616 if (pendingObjects &&
617 object_address_present(&otherObject, pendingObjects))
618 {
619 systable_endscan(scan);
620 /* need to release caller's lock; see notes below */
621 ReleaseDeletionLock(object);
622 return;
623 }
624
625 /*
626 * We postpone actually issuing the error message until
627 * after this loop, so that we can make the behavior
628 * independent of the ordering of pg_depend entries, at
629 * least if there's not more than one INTERNAL and one
630 * EXTENSION dependency. (If there's more, we'll complain
631 * about a random one of them.) Prefer to complain about
632 * EXTENSION, since that's generally a more important
633 * dependency.
634 */
635 if (!OidIsValid(owningObject.classId) ||
636 foundDep->deptype == DEPENDENCY_EXTENSION)
637 owningObject = otherObject;
638 break;
639 }
640
641 /*
642 * 2. When recursing from the other end of this dependency,
643 * it's okay to continue with the deletion. This holds when
644 * recursing from a whole object that includes the nominal
645 * other end as a component, too. Since there can be more
646 * than one "owning" object, we have to allow matches that are
647 * more than one level down in the stack.
648 */
649 if (stack_address_present_add_flags(&otherObject, 0, stack))
650 break;
651
652 /*
653 * 3. Not all the owning objects have been visited, so
654 * transform this deletion request into a delete of this
655 * owning object.
656 *
657 * First, release caller's lock on this object and get
658 * deletion lock on the owning object. (We must release
659 * caller's lock to avoid deadlock against a concurrent
660 * deletion of the owning object.)
661 */
662 ReleaseDeletionLock(object);
663 AcquireDeletionLock(&otherObject, 0);
664
665 /*
666 * The owning object might have been deleted while we waited
667 * to lock it; if so, neither it nor the current object are
668 * interesting anymore. We test this by checking the
669 * pg_depend entry (see notes below).
670 */
671 if (!systable_recheck_tuple(scan, tup))
672 {
673 systable_endscan(scan);
674 ReleaseDeletionLock(&otherObject);
675 return;
676 }
677
678 /*
679 * One way or the other, we're done with the scan; might as
680 * well close it down before recursing, to reduce peak
681 * resource consumption.
682 */
683 systable_endscan(scan);
684
685 /*
686 * Okay, recurse to the owning object instead of proceeding.
687 *
688 * We do not need to stack the current object; we want the
689 * traversal order to be as if the original reference had
690 * linked to the owning object instead of this one.
691 *
692 * The dependency type is a "reverse" dependency: we need to
693 * delete the owning object if this one is to be deleted, but
694 * this linkage is never a reason for an automatic deletion.
695 */
696 findDependentObjects(&otherObject,
697 DEPFLAG_REVERSE,
698 flags,
699 stack,
700 targetObjects,
701 pendingObjects,
702 depRel);
703
704 /*
705 * The current target object should have been added to
706 * targetObjects while processing the owning object; but it
707 * probably got only the flag bits associated with the
708 * dependency we're looking at. We need to add the objflags
709 * that were passed to this recursion level, too, else we may
710 * get a bogus failure in reportDependentObjects (if, for
711 * example, we were called due to a partition dependency).
712 *
713 * If somehow the current object didn't get scheduled for
714 * deletion, bleat. (That would imply that somebody deleted
715 * this dependency record before the recursion got to it.)
716 * Another idea would be to reacquire lock on the current
717 * object and resume trying to delete it, but it seems not
718 * worth dealing with the race conditions inherent in that.
719 */
720 if (!object_address_present_add_flags(object, objflags,
721 targetObjects))
722 elog(ERROR, "deletion of owning object %s failed to delete %s",
723 getObjectDescription(&otherObject, false),
724 getObjectDescription(object, false));
725
726 /* And we're done here. */
727 return;
728
729 case DEPENDENCY_PARTITION_PRI:
730
731 /*
732 * Remember that this object has a partition-type dependency.
733 * After the dependency scan, we'll complain if we didn't find
734 * a reason to delete one of its partition dependencies.
735 */
736 objflags |= DEPFLAG_IS_PART;
737
738 /*
739 * Also remember the primary partition owner, for error
740 * messages. If there are multiple primary owners (which
741 * there should not be), we'll report a random one of them.
742 */
743 partitionObject = otherObject;
744 break;
745
746 case DEPENDENCY_PARTITION_SEC:
747
748 /*
749 * Only use secondary partition owners in error messages if we
750 * find no primary owner (which probably shouldn't happen).
751 */
752 if (!(objflags & DEPFLAG_IS_PART))
753 partitionObject = otherObject;
754
755 /*
756 * Remember that this object has a partition-type dependency.
757 * After the dependency scan, we'll complain if we didn't find
758 * a reason to delete one of its partition dependencies.
759 */
760 objflags |= DEPFLAG_IS_PART;
761 break;
762
763 default:
764 elog(ERROR, "unrecognized dependency type '%c' for %s",
765 foundDep->deptype, getObjectDescription(object, false));
766 break;
767 }
768 }
769
770 systable_endscan(scan);
771
772 /*
773 * If we found an INTERNAL or EXTENSION dependency when we're at outer
774 * level, complain about it now. If we also found a PARTITION dependency,
775 * we prefer to report the PARTITION dependency. This is arbitrary but
776 * seems to be more useful in practice.
777 */
778 if (OidIsValid(owningObject.classId))
779 {
780 char *otherObjDesc;
781
782 if (OidIsValid(partitionObject.classId))
783 otherObjDesc = getObjectDescription(&partitionObject, false);
784 else
785 otherObjDesc = getObjectDescription(&owningObject, false);
786
787 ereport(ERROR,
788 (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
789 errmsg("cannot drop %s because %s requires it",
790 getObjectDescription(object, false), otherObjDesc),
791 errhint("You can drop %s instead.", otherObjDesc)));
792 }
793
794 /*
795 * Next, identify all objects that directly depend on the current object.
796 * To ensure predictable deletion order, we collect them up in
797 * dependentObjects and sort the list before actually recursing. (The
798 * deletion order would be valid in any case, but doing this ensures
799 * consistent output from DROP CASCADE commands, which is helpful for
800 * regression testing.)
801 */
802 maxDependentObjects = 128; /* arbitrary initial allocation */
803 dependentObjects = (ObjectAddressAndFlags *)
804 palloc(maxDependentObjects * sizeof(ObjectAddressAndFlags));
805 numDependentObjects = 0;
806
807 ScanKeyInit(&key[0],
808 Anum_pg_depend_refclassid,
809 BTEqualStrategyNumber, F_OIDEQ,
810 ObjectIdGetDatum(object->classId));
811 ScanKeyInit(&key[1],
812 Anum_pg_depend_refobjid,
813 BTEqualStrategyNumber, F_OIDEQ,
814 ObjectIdGetDatum(object->objectId));
815 if (object->objectSubId != 0)
816 {
817 ScanKeyInit(&key[2],
818 Anum_pg_depend_refobjsubid,
819 BTEqualStrategyNumber, F_INT4EQ,
820 Int32GetDatum(object->objectSubId));
821 nkeys = 3;
822 }
823 else
824 nkeys = 2;
825
826 scan = systable_beginscan(*depRel, DependReferenceIndexId, true,
827 NULL, nkeys, key);
828
829 while (HeapTupleIsValid(tup = systable_getnext(scan)))
830 {
831 Form_pg_depend foundDep = (Form_pg_depend) GETSTRUCT(tup);
832 int subflags;
833
834 otherObject.classId = foundDep->classid;
835 otherObject.objectId = foundDep->objid;
836 otherObject.objectSubId = foundDep->objsubid;
837
838 /*
839 * If what we found is a sub-object of the current object, just ignore
840 * it. (Normally, such a dependency is implicit, but we must make
841 * explicit ones in some cases involving partitioning.)
842 */
843 if (otherObject.classId == object->classId &&
844 otherObject.objectId == object->objectId &&
845 object->objectSubId == 0)
846 continue;
847
848 /*
849 * Must lock the dependent object before recursing to it.
850 */
851 AcquireDeletionLock(&otherObject, 0);
852
853 /*
854 * The dependent object might have been deleted while we waited to
855 * lock it; if so, we don't need to do anything more with it. We can
856 * test this cheaply and independently of the object's type by seeing
857 * if the pg_depend tuple we are looking at is still live. (If the
858 * object got deleted, the tuple would have been deleted too.)
859 */
860 if (!systable_recheck_tuple(scan, tup))
861 {
862 /* release the now-useless lock */
863 ReleaseDeletionLock(&otherObject);
864 /* and continue scanning for dependencies */
865 continue;
866 }
867
868 /*
869 * We do need to delete it, so identify objflags to be passed down,
870 * which depend on the dependency type.
871 */
872 switch (foundDep->deptype)
873 {
874 case DEPENDENCY_NORMAL:
875 subflags = DEPFLAG_NORMAL;
876 break;
877 case DEPENDENCY_AUTO:
878 case DEPENDENCY_AUTO_EXTENSION:
879 subflags = DEPFLAG_AUTO;
880 break;
881 case DEPENDENCY_INTERNAL:
882 subflags = DEPFLAG_INTERNAL;
883 break;
884 case DEPENDENCY_PARTITION_PRI:
885 case DEPENDENCY_PARTITION_SEC:
886 subflags = DEPFLAG_PARTITION;
887 break;
888 case DEPENDENCY_EXTENSION:
889 subflags = DEPFLAG_EXTENSION;
890 break;
891 default:
892 elog(ERROR, "unrecognized dependency type '%c' for %s",
893 foundDep->deptype, getObjectDescription(object, false));
894 subflags = 0; /* keep compiler quiet */
895 break;
896 }
897
898 /* And add it to the pending-objects list */
899 if (numDependentObjects >= maxDependentObjects)
900 {
901 /* enlarge array if needed */
902 maxDependentObjects *= 2;
903 dependentObjects = (ObjectAddressAndFlags *)
904 repalloc(dependentObjects,
905 maxDependentObjects * sizeof(ObjectAddressAndFlags));
906 }
907
908 dependentObjects[numDependentObjects].obj = otherObject;
909 dependentObjects[numDependentObjects].subflags = subflags;
910 numDependentObjects++;
911 }
912
913 systable_endscan(scan);
914
915 /*
916 * Now we can sort the dependent objects into a stable visitation order.
917 * It's safe to use object_address_comparator here since the obj field is
918 * first within ObjectAddressAndFlags.
919 */
920 if (numDependentObjects > 1)
921 qsort(dependentObjects, numDependentObjects,
922 sizeof(ObjectAddressAndFlags),
923 object_address_comparator);
924
925 /*
926 * Now recurse to the dependent objects. We must visit them first since
927 * they have to be deleted before the current object.
928 */
929 mystack.object = object; /* set up a new stack level */
930 mystack.flags = objflags;
931 mystack.next = stack;
932
933 for (int i = 0; i < numDependentObjects; i++)
934 {
935 ObjectAddressAndFlags *depObj = dependentObjects + i;
936
937 findDependentObjects(&depObj->obj,
938 depObj->subflags,
939 flags,
940 &mystack,
941 targetObjects,
942 pendingObjects,
943 depRel);
944 }
945
946 pfree(dependentObjects);
947
948 /*
949 * Finally, we can add the target object to targetObjects. Be careful to
950 * include any flags that were passed back down to us from inner recursion
951 * levels. Record the "dependee" as being either the most important
952 * partition owner if there is one, else the object we recursed from, if
953 * any. (The logic in reportDependentObjects() is such that it can only
954 * need one of those objects.)
955 */
956 extra.flags = mystack.flags;
957 if (extra.flags & DEPFLAG_IS_PART)
958 extra.dependee = partitionObject;
959 else if (stack)
960 extra.dependee = *stack->object;
961 else
962 memset(&extra.dependee, 0, sizeof(extra.dependee));
963 add_exact_object_address_extra(object, &extra, targetObjects);
964 }
965
966 /*
967 * reportDependentObjects - report about dependencies, and fail if RESTRICT
968 *
969 * Tell the user about dependent objects that we are going to delete
970 * (or would need to delete, but are prevented by RESTRICT mode);
971 * then error out if there are any and it's not CASCADE mode.
972 *
973 * targetObjects: list of objects that are scheduled to be deleted
974 * behavior: RESTRICT or CASCADE
975 * flags: other flags for the deletion operation
976 * origObject: base object of deletion, or NULL if not available
977 * (the latter case occurs in DROP OWNED)
978 */
979 static void
980 reportDependentObjects(const ObjectAddresses *targetObjects,
981 DropBehavior behavior,
982 int flags,
983 const ObjectAddress *origObject)
984 {
985 int msglevel = (flags & PERFORM_DELETION_QUIETLY) ? DEBUG2 : NOTICE;
986 bool ok = true;
987 StringInfoData clientdetail;
988 StringInfoData logdetail;
989 int numReportedClient = 0;
990 int numNotReportedClient = 0;
991 int i;
992
993 /*
994 * If we need to delete any partition-dependent objects, make sure that
995 * we're deleting at least one of their partition dependencies, too. That
996 * can be detected by checking that we reached them by a PARTITION
997 * dependency at some point.
998 *
999 * We just report the first such object, as in most cases the only way to
1000 * trigger this complaint is to explicitly try to delete one partition of
1001 * a partitioned object.
1002 */
1003 for (i = 0; i < targetObjects->numrefs; i++)
1004 {
1005 const ObjectAddressExtra *extra = &targetObjects->extras[i];
1006
1007 if ((extra->flags & DEPFLAG_IS_PART) &&
1008 !(extra->flags & DEPFLAG_PARTITION))
1009 {
1010 const ObjectAddress *object = &targetObjects->refs[i];
1011 char *otherObjDesc = getObjectDescription(&extra->dependee,
1012 false);
1013
1014 ereport(ERROR,
1015 (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
1016 errmsg("cannot drop %s because %s requires it",
1017 getObjectDescription(object, false), otherObjDesc),
1018 errhint("You can drop %s instead.", otherObjDesc)));
1019 }
1020 }
1021
1022 /*
1023 * If no error is to be thrown, and the msglevel is too low to be shown to
1024 * either client or server log, there's no need to do any of the rest of
1025 * the work.
1026 */
1027 if (behavior == DROP_CASCADE &&
1028 !message_level_is_interesting(msglevel))
1029 return;
1030
1031 /*
1032 * We limit the number of dependencies reported to the client to
1033 * MAX_REPORTED_DEPS, since client software may not deal well with
1034 * enormous error strings. The server log always gets a full report.
1035 */
1036 #define MAX_REPORTED_DEPS 100
1037
1038 initStringInfo(&clientdetail);
1039 initStringInfo(&logdetail);
1040
1041 /*
1042 * We process the list back to front (ie, in dependency order not deletion
1043 * order), since this makes for a more understandable display.
1044 */
1045 for (i = targetObjects->numrefs - 1; i >= 0; i--)
1046 {
1047 const ObjectAddress *obj = &targetObjects->refs[i];
1048 const ObjectAddressExtra *extra = &targetObjects->extras[i];
1049 char *objDesc;
1050
1051 /* Ignore the original deletion target(s) */
1052 if (extra->flags & DEPFLAG_ORIGINAL)
1053 continue;
1054
1055 /* Also ignore sub-objects; we'll report the whole object elsewhere */
1056 if (extra->flags & DEPFLAG_SUBOBJECT)
1057 continue;
1058
1059 objDesc = getObjectDescription(obj, false);
1060
1061 /* An object being dropped concurrently doesn't need to be reported */
1062 if (objDesc == NULL)
1063 continue;
1064
1065 /*
1066 * If, at any stage of the recursive search, we reached the object via
1067 * an AUTO, INTERNAL, PARTITION, or EXTENSION dependency, then it's
1068 * okay to delete it even in RESTRICT mode.
1069 */
1070 if (extra->flags & (DEPFLAG_AUTO |
1071 DEPFLAG_INTERNAL |
1072 DEPFLAG_PARTITION |
1073 DEPFLAG_EXTENSION))
1074 {
1075 /*
1076 * auto-cascades are reported at DEBUG2, not msglevel. We don't
1077 * try to combine them with the regular message because the
1078 * results are too confusing when client_min_messages and
1079 * log_min_messages are different.
1080 */
1081 ereport(DEBUG2,
1082 (errmsg_internal("drop auto-cascades to %s",
1083 objDesc)));
1084 }
1085 else if (behavior == DROP_RESTRICT)
1086 {
1087 char *otherDesc = getObjectDescription(&extra->dependee,
1088 false);
1089
1090 if (otherDesc)
1091 {
1092 if (numReportedClient < MAX_REPORTED_DEPS)
1093 {
1094 /* separate entries with a newline */
1095 if (clientdetail.len != 0)
1096 appendStringInfoChar(&clientdetail, '\n');
1097 appendStringInfo(&clientdetail, _("%s depends on %s"),
1098 objDesc, otherDesc);
1099 numReportedClient++;
1100 }
1101 else
1102 numNotReportedClient++;
1103 /* separate entries with a newline */
1104 if (logdetail.len != 0)
1105 appendStringInfoChar(&logdetail, '\n');
1106 appendStringInfo(&logdetail, _("%s depends on %s"),
1107 objDesc, otherDesc);
1108 pfree(otherDesc);
1109 }
1110 else
1111 numNotReportedClient++;
1112 ok = false;
1113 }
1114 else
1115 {
1116 if (numReportedClient < MAX_REPORTED_DEPS)
1117 {
1118 /* separate entries with a newline */
1119 if (clientdetail.len != 0)
1120 appendStringInfoChar(&clientdetail, '\n');
1121 appendStringInfo(&clientdetail, _("drop cascades to %s"),
1122 objDesc);
1123 numReportedClient++;
1124 }
1125 else
1126 numNotReportedClient++;
1127 /* separate entries with a newline */
1128 if (logdetail.len != 0)
1129 appendStringInfoChar(&logdetail, '\n');
1130 appendStringInfo(&logdetail, _("drop cascades to %s"),
1131 objDesc);
1132 }
1133
1134 pfree(objDesc);
1135 }
1136
1137 if (numNotReportedClient > 0)
1138 appendStringInfo(&clientdetail, ngettext("\nand %d other object "
1139 "(see server log for list)",
1140 "\nand %d other objects "
1141 "(see server log for list)",
1142 numNotReportedClient),
1143 numNotReportedClient);
1144
1145 if (!ok)
1146 {
1147 if (origObject)
1148 ereport(ERROR,
1149 (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
1150 errmsg("cannot drop %s because other objects depend on it",
1151 getObjectDescription(origObject, false)),
1152 errdetail_internal("%s", clientdetail.data),
1153 errdetail_log("%s", logdetail.data),
1154 errhint("Use DROP ... CASCADE to drop the dependent objects too.")));
1155 else
1156 ereport(ERROR,
1157 (errcode(ERRCODE_DEPENDENT_OBJECTS_STILL_EXIST),
1158 errmsg("cannot drop desired object(s) because other objects depend on them"),
1159 errdetail_internal("%s", clientdetail.data),
1160 errdetail_log("%s", logdetail.data),
1161 errhint("Use DROP ... CASCADE to drop the dependent objects too.")));
1162 }
1163 else if (numReportedClient > 1)
1164 {
1165 ereport(msglevel,
1166 (errmsg_plural("drop cascades to %d other object",
1167 "drop cascades to %d other objects",
1168 numReportedClient + numNotReportedClient,
1169 numReportedClient + numNotReportedClient),
1170 errdetail_internal("%s", clientdetail.data),
1171 errdetail_log("%s", logdetail.data)));
1172 }
1173 else if (numReportedClient == 1)
1174 {
1175 /* we just use the single item as-is */
1176 ereport(msglevel,
1177 (errmsg_internal("%s", clientdetail.data)));
1178 }
1179
1180 pfree(clientdetail.data);
1181 pfree(logdetail.data);
1182 }
1183
1184 /*
1185 * Drop an object by OID. Works for most catalogs, if no special processing
1186 * is needed.
1187 */
1188 static void
1189 DropObjectById(const ObjectAddress *object)
1190 {
1191 int cacheId;
1192 Relation rel;
1193 HeapTuple tup;
1194
1195 cacheId = get_object_catcache_oid(object->classId);
1196
1197 rel = table_open(object->classId, RowExclusiveLock);
1198
1199 /*
1200 * Use the system cache for the oid column, if one exists.
1201 */
1202 if (cacheId >= 0)
1203 {
1204 tup = SearchSysCache1(cacheId, ObjectIdGetDatum(object->objectId));
1205 if (!HeapTupleIsValid(tup))
1206 elog(ERROR, "cache lookup failed for %s %u",
1207 get_object_class_descr(object->classId), object->objectId);
1208
1209 CatalogTupleDelete(rel, &tup->t_self);
1210
1211 ReleaseSysCache(tup);
1212 }
1213 else
1214 {
1215 ScanKeyData skey[1];
1216 SysScanDesc scan;
1217
1218 ScanKeyInit(&skey[0],
1219 get_object_attnum_oid(object->classId),
1220 BTEqualStrategyNumber, F_OIDEQ,
1221 ObjectIdGetDatum(object->objectId));
1222
1223 scan = systable_beginscan(rel, get_object_oid_index(object->classId), true,
1224 NULL, 1, skey);
1225
1226 /* we expect exactly one match */
1227 tup = systable_getnext(scan);
1228 if (!HeapTupleIsValid(tup))
1229 elog(ERROR, "could not find tuple for %s %u",
1230 get_object_class_descr(object->classId), object->objectId);
1231
1232 CatalogTupleDelete(rel, &tup->t_self);
1233
1234 systable_endscan(scan);
1235 }
1236
1237 table_close(rel, RowExclusiveLock);
1238 }
1239
1240 /*
1241 * deleteOneObject: delete a single object for performDeletion.
1242 *
1243 * *depRel is the already-open pg_depend relation.
1244 */
1245 static void
1246 deleteOneObject(const ObjectAddress *object, Relation *depRel, int flags)
1247 {
1248 ScanKeyData key[3];
1249 int nkeys;
1250 SysScanDesc scan;
1251 HeapTuple tup;
1252
1253 /* DROP hook of the objects being removed */
1254 InvokeObjectDropHookArg(object->classId, object->objectId,
1255 object->objectSubId, flags);
1256
1257 /*
1258 * Close depRel if we are doing a drop concurrently. The object deletion
1259 * subroutine will commit the current transaction, so we can't keep the
1260 * relation open across doDeletion().
1261 */
1262 if (flags & PERFORM_DELETION_CONCURRENTLY)
1263 table_close(*depRel, RowExclusiveLock);
1264
1265 /*
1266 * Delete the object itself, in an object-type-dependent way.
1267 *
1268 * We used to do this after removing the outgoing dependency links, but it
1269 * seems just as reasonable to do it beforehand. In the concurrent case
1270 * we *must* do it in this order, because we can't make any transactional
1271 * updates before calling doDeletion() --- they'd get committed right
1272 * away, which is not cool if the deletion then fails.
1273 */
1274 doDeletion(object, flags);
1275
1276 /*
1277 * Reopen depRel if we closed it above
1278 */
1279 if (flags & PERFORM_DELETION_CONCURRENTLY)
1280 *depRel = table_open(DependRelationId, RowExclusiveLock);
1281
1282 /*
1283 * Now remove any pg_depend records that link from this object to others.
1284 * (Any records linking to this object should be gone already.)
1285 *
1286 * When dropping a whole object (subId = 0), remove all pg_depend records
1287 * for its sub-objects too.
1288 */
1289 ScanKeyInit(&key[0],
1290 Anum_pg_depend_classid,
1291 BTEqualStrategyNumber, F_OIDEQ,
1292 ObjectIdGetDatum(object->classId));
1293 ScanKeyInit(&key[1],
1294 Anum_pg_depend_objid,
1295 BTEqualStrategyNumber, F_OIDEQ,
1296 ObjectIdGetDatum(object->objectId));
1297 if (object->objectSubId != 0)
1298 {
1299 ScanKeyInit(&key[2],
1300 Anum_pg_depend_objsubid,
1301 BTEqualStrategyNumber, F_INT4EQ,
1302 Int32GetDatum(object->objectSubId));
1303 nkeys = 3;
1304 }
1305 else
1306 nkeys = 2;
1307
1308 scan = systable_beginscan(*depRel, DependDependerIndexId, true,
1309 NULL, nkeys, key);
1310
1311 while (HeapTupleIsValid(tup = systable_getnext(scan)))
1312 {
1313 CatalogTupleDelete(*depRel, &tup->t_self);
1314 }
1315
1316 systable_endscan(scan);
1317
1318 /*
1319 * Delete shared dependency references related to this object. Again, if
1320 * subId = 0, remove records for sub-objects too.
1321 */
1322 deleteSharedDependencyRecordsFor(object->classId, object->objectId,
1323 object->objectSubId);
1324
1325
1326 /*
1327 * Delete any comments, security labels, or initial privileges associated
1328 * with this object. (This is a convenient place to do these things,
1329 * rather than having every object type know to do it.) As above, all
1330 * these functions must remove records for sub-objects too if the subid is
1331 * zero.
1332 */
1333 DeleteComments(object->objectId, object->classId, object->objectSubId);
1334 DeleteSecurityLabel(object);
1335 DeleteInitPrivs(object);
1336
1337 /*
1338 * CommandCounterIncrement here to ensure that preceding changes are all
1339 * visible to the next deletion step.
1340 */
1341 CommandCounterIncrement();
1342
1343 /*
1344 * And we're done!
1345 */
1346 }
1347
1348 /*
1349 * doDeletion: actually delete a single object
1350 */
1351 static void
1352 doDeletion(const ObjectAddress *object, int flags)
1353 {
1354 switch (object->classId)
1355 {
1356 case RelationRelationId:
1357 {
1358 char relKind = get_rel_relkind(object->objectId);
1359
1360 if (relKind == RELKIND_INDEX ||
1361 relKind == RELKIND_PARTITIONED_INDEX)
1362 {
1363 bool concurrent = ((flags & PERFORM_DELETION_CONCURRENTLY) != 0);
1364 bool concurrent_lock_mode = ((flags & PERFORM_DELETION_CONCURRENT_LOCK) != 0);
1365
1366 Assert(object->objectSubId == 0);
1367 index_drop(object->objectId, concurrent, concurrent_lock_mode);
1368 }
1369 else
1370 {
1371 if (object->objectSubId != 0)
1372 RemoveAttributeById(object->objectId,
1373 object->objectSubId);
1374 else
1375 heap_drop_with_catalog(object->objectId);
1376 }
1377
1378 /*
1379 * for a sequence, in addition to dropping the heap, also
1380 * delete pg_sequence tuple
1381 */
1382 if (relKind == RELKIND_SEQUENCE)
1383 DeleteSequenceTuple(object->objectId);
1384 break;
1385 }
1386
1387 case ProcedureRelationId:
1388 RemoveFunctionById(object->objectId);
1389 break;
1390
1391 case TypeRelationId:
1392 RemoveTypeById(object->objectId);
1393 break;
1394
1395 case ConstraintRelationId:
1396 RemoveConstraintById(object->objectId);
1397 break;
1398
1399 case AttrDefaultRelationId:
1400 RemoveAttrDefaultById(object->objectId);
1401 break;
1402
1403 case LargeObjectRelationId:
1404 LargeObjectDrop(object->objectId);
1405 break;
1406
1407 case OperatorRelationId:
1408 RemoveOperatorById(object->objectId);
1409 break;
1410
1411 case RewriteRelationId:
1412 RemoveRewriteRuleById(object->objectId);
1413 break;
1414
1415 case TriggerRelationId:
1416 RemoveTriggerById(object->objectId);
1417 break;
1418
1419 case StatisticExtRelationId:
1420 RemoveStatisticsById(object->objectId);
1421 break;
1422
1423 case TSConfigRelationId:
1424 RemoveTSConfigurationById(object->objectId);
1425 break;
1426
1427 case ExtensionRelationId:
1428 RemoveExtensionById(object->objectId);
1429 break;
1430
1431 case PolicyRelationId:
1432 RemovePolicyById(object->objectId);
1433 break;
1434
1435 case PublicationNamespaceRelationId:
1436 RemovePublicationSchemaById(object->objectId);
1437 break;
1438
1439 case PublicationRelRelationId:
1440 RemovePublicationRelById(object->objectId);
1441 break;
1442
1443 case PublicationRelationId:
1444 RemovePublicationById(object->objectId);
1445 break;
1446
1447 case CastRelationId:
1448 case CollationRelationId:
1449 case ConversionRelationId:
1450 case LanguageRelationId:
1451 case OperatorClassRelationId:
1452 case OperatorFamilyRelationId:
1453 case AccessMethodRelationId:
1454 case AccessMethodOperatorRelationId:
1455 case AccessMethodProcedureRelationId:
1456 case NamespaceRelationId:
1457 case TSParserRelationId:
1458 case TSDictionaryRelationId:
1459 case TSTemplateRelationId:
1460 case ForeignDataWrapperRelationId:
1461 case ForeignServerRelationId:
1462 case UserMappingRelationId:
1463 case DefaultAclRelationId:
1464 case EventTriggerRelationId:
1465 case TransformRelationId:
1466 case AuthMemRelationId:
1467 DropObjectById(object);
1468 break;
1469
1470 /*
1471 * These global object types are not supported here.
1472 */
1473 case AuthIdRelationId:
1474 case DatabaseRelationId:
1475 case TableSpaceRelationId:
1476 case SubscriptionRelationId:
1477 case ParameterAclRelationId:
1478 elog(ERROR, "global objects cannot be deleted by doDeletion");
1479 break;
1480
1481 default:
1482 elog(ERROR, "unsupported object class: %u", object->classId);
1483 }
1484 }
1485
1486 /*
1487 * AcquireDeletionLock - acquire a suitable lock for deleting an object
1488 *
1489 * Accepts the same flags as performDeletion (though currently only
1490 * PERFORM_DELETION_CONCURRENTLY does anything).
1491 *
1492 * We use LockRelation for relations, and otherwise LockSharedObject or
1493 * LockDatabaseObject as appropriate for the object type.
1494 */
1495 void
1496 AcquireDeletionLock(const ObjectAddress *object, int flags)
1497 {
1498 if (object->classId == RelationRelationId)
1499 {
1500 /*
1501 * In DROP INDEX CONCURRENTLY, take only ShareUpdateExclusiveLock on
1502 * the index for the moment. index_drop() will promote the lock once
1503 * it's safe to do so. In all other cases we need full exclusive
1504 * lock.
1505 */
1506 if (flags & PERFORM_DELETION_CONCURRENTLY)
1507 LockRelationOid(object->objectId, ShareUpdateExclusiveLock);
1508 else
1509 LockRelationOid(object->objectId, AccessExclusiveLock);
1510 }
1511 else if (object->classId == AuthMemRelationId)
1512 LockSharedObject(object->classId, object->objectId, 0,
1513 AccessExclusiveLock);
1514 else
1515 {
1516 /* assume we should lock the whole object not a sub-object */
1517 LockDatabaseObject(object->classId, object->objectId, 0,
1518 AccessExclusiveLock);
1519 }
1520 }
1521
1522 /*
1523 * ReleaseDeletionLock - release an object deletion lock
1524 *
1525 * Companion to AcquireDeletionLock.
1526 */
1527 void
1528 ReleaseDeletionLock(const ObjectAddress *object)
1529 {
1530 if (object->classId == RelationRelationId)
1531 UnlockRelationOid(object->objectId, AccessExclusiveLock);
1532 else if (object->classId == AuthMemRelationId)
1533 UnlockSharedObject(object->classId, object->objectId, 0,
1534 AccessExclusiveLock);
1535 else
1536 /* assume we should lock the whole object not a sub-object */
1537 UnlockDatabaseObject(object->classId, object->objectId, 0,
1538 AccessExclusiveLock);
1539 }
1540
1541 /*
1542 * recordDependencyOnExpr - find expression dependencies
1543 *
1544 * This is used to find the dependencies of rules, constraint expressions,
1545 * etc.
1546 *
1547 * Given an expression or query in node-tree form, find all the objects
1548 * it refers to (tables, columns, operators, functions, etc). Record
1549 * a dependency of the specified type from the given depender object
1550 * to each object mentioned in the expression.
1551 *
1552 * rtable is the rangetable to be used to interpret Vars with varlevelsup=0.
1553 * It can be NIL if no such variables are expected.
1554 */
1555 void
1556 recordDependencyOnExpr(const ObjectAddress *depender,
1557 Node *expr, List *rtable,
1558 DependencyType behavior)
1559 {
1560 find_expr_references_context context;
1561
1562 context.addrs = new_object_addresses();
1563
1564 /* Set up interpretation for Vars at varlevelsup = 0 */
1565 context.rtables = list_make1(rtable);
1566
1567 /* Scan the expression tree for referenceable objects */
1568 find_expr_references_walker(expr, &context);
1569
1570 /* Remove any duplicates */
1571 eliminate_duplicate_dependencies(context.addrs);
1572
1573 /* And record 'em */
1574 recordMultipleDependencies(depender,
1575 context.addrs->refs, context.addrs->numrefs,
1576 behavior);
1577
1578 free_object_addresses(context.addrs);
1579 }
1580
1581 /*
1582 * recordDependencyOnSingleRelExpr - find expression dependencies
1583 *
1584 * As above, but only one relation is expected to be referenced (with
1585 * varno = 1 and varlevelsup = 0). Pass the relation OID instead of a
1586 * range table. An additional frammish is that dependencies on that
1587 * relation's component columns will be marked with 'self_behavior',
1588 * whereas 'behavior' is used for everything else; also, if 'reverse_self'
1589 * is true, those dependencies are reversed so that the columns are made
1590 * to depend on the table not vice versa.
1591 *
1592 * NOTE: the caller should ensure that a whole-table dependency on the
1593 * specified relation is created separately, if one is needed. In particular,
1594 * a whole-row Var "relation.*" will not cause this routine to emit any
1595 * dependency item. This is appropriate behavior for subexpressions of an
1596 * ordinary query, so other cases need to cope as necessary.
1597 */
1598 void
1599 recordDependencyOnSingleRelExpr(const ObjectAddress *depender,
1600 Node *expr, Oid relId,
1601 DependencyType behavior,
1602 DependencyType self_behavior,
1603 bool reverse_self)
1604 {
1605 find_expr_references_context context;
1606 RangeTblEntry rte = {0};
1607
1608 context.addrs = new_object_addresses();
1609
1610 /* We gin up a rather bogus rangetable list to handle Vars */
1611 rte.type = T_RangeTblEntry;
1612 rte.rtekind = RTE_RELATION;
1613 rte.relid = relId;
1614 rte.relkind = RELKIND_RELATION; /* no need for exactness here */
1615 rte.rellockmode = AccessShareLock;
1616
1617 context.rtables = list_make1(list_make1(&rte));
1618
1619 /* Scan the expression tree for referenceable objects */
1620 find_expr_references_walker(expr, &context);
1621
1622 /* Remove any duplicates */
1623 eliminate_duplicate_dependencies(context.addrs);
1624
1625 /* Separate self-dependencies if necessary */
1626 if ((behavior != self_behavior || reverse_self) &&
1627 context.addrs->numrefs > 0)
1628 {
1629 ObjectAddresses *self_addrs;
1630 ObjectAddress *outobj;
1631 int oldref,
1632 outrefs;
1633
1634 self_addrs = new_object_addresses();
1635
1636 outobj = context.addrs->refs;
1637 outrefs = 0;
1638 for (oldref = 0; oldref < context.addrs->numrefs; oldref++)
1639 {
1640 ObjectAddress *thisobj = context.addrs->refs + oldref;
1641
1642 if (thisobj->classId == RelationRelationId &&
1643 thisobj->objectId == relId)
1644 {
1645 /* Move this ref into self_addrs */
1646 add_exact_object_address(thisobj, self_addrs);
1647 }
1648 else
1649 {
1650 /* Keep it in context.addrs */
1651 *outobj = *thisobj;
1652 outobj++;
1653 outrefs++;
1654 }
1655 }
1656 context.addrs->numrefs = outrefs;
1657
1658 /* Record the self-dependencies with the appropriate direction */
1659 if (!reverse_self)
1660 recordMultipleDependencies(depender,
1661 self_addrs->refs, self_addrs->numrefs,
1662 self_behavior);
1663 else
1664 {
1665 /* Can't use recordMultipleDependencies, so do it the hard way */
1666 int selfref;
1667
1668 for (selfref = 0; selfref < self_addrs->numrefs; selfref++)
1669 {
1670 ObjectAddress *thisobj = self_addrs->refs + selfref;
1671
1672 recordDependencyOn(thisobj, depender, self_behavior);
1673 }
1674 }
1675
1676 free_object_addresses(self_addrs);
1677 }
1678
1679 /* Record the external dependencies */
1680 recordMultipleDependencies(depender,
1681 context.addrs->refs, context.addrs->numrefs,
1682 behavior);
1683
1684 free_object_addresses(context.addrs);
1685 }
1686
1687 /*
1688 * We require USAGE on a type to store a dependency on it. This helper
1689 * function does the appropriate privilege checks.
1690 *
1691 * NB: Other objects have privileges of their own, but recording those
1692 * dependencies doesn't require holding them. For example, an expression may
1693 * reference a function for which the user lacks EXECUTE. Instead, EXECUTE is
1694 * checked when the function is executed.
1695 */
1696 static void
1697 check_usage_on_types(ObjectAddresses *addrs, Oid roleid)
1698 {
1699 for (int i = 0; i < addrs->numrefs; i++)
1700 {
1701 ObjectAddress *ref = &addrs->refs[i];
1702 AclResult aclresult;
1703
1704 if (ref->classId != TypeRelationId)
1705 continue;
1706
1707 /* we don't record dependencies on pinned types */
1708 if (IsPinnedObject(ref->classId, ref->objectId))
1709 continue;
1710
1711 aclresult = object_aclcheck(ref->classId, ref->objectId,
1712 roleid, ACL_USAGE);
1713 if (aclresult != ACLCHECK_OK)
1714 aclcheck_error_type(aclresult, ref->objectId);
1715 }
1716 }
1717
1718 /*
1719 * CheckUsageOnTypesInExpr - require USAGE on all types named by an expression
1720 *
1721 * rtable is the rangetable for interpreting Vars (or NIL if none are
1722 * expected). roleid is the role whose USAGE is required.
1723 */
1724 void
1725 CheckUsageOnTypesInExpr(Node *expr, List *rtable, Oid roleid)
1726 {
1727 find_expr_references_context context;
1728
1729 context.addrs = new_object_addresses();
1730
1731 /* Set up interpretation for Vars at varlevelsup = 0 */
1732 context.rtables = list_make1(rtable);
1733
1734 find_expr_references_walker(expr, &context);
1735 eliminate_duplicate_dependencies(context.addrs);
1736 check_usage_on_types(context.addrs, roleid);
1737 free_object_addresses(context.addrs);
1738 }
1739
1740 /*
1741 * CheckUsageOnTypesInSingleRelExpr - as above, for a single-rel expression
1742 *
1743 * Like recordDependencyOnSingleRelExpr(), this handles expressions whose Vars
1744 * all refer to one relation. roleid is the role whose USAGE is required.
1745 */
1746 void
1747 CheckUsageOnTypesInSingleRelExpr(Node *expr, Oid relId, Oid roleid)
1748 {
1749 find_expr_references_context context;
1750 RangeTblEntry rte = {0};
1751
1752 context.addrs = new_object_addresses();
1753
1754 /* We gin up a rather bogus rangetable list to handle Vars */
1755 rte.type = T_RangeTblEntry;
1756 rte.rtekind = RTE_RELATION;
1757 rte.relid = relId;
1758 rte.relkind = RELKIND_RELATION;
1759 rte.rellockmode = AccessShareLock;
1760 context.rtables = list_make1(list_make1(&rte));
1761
1762 find_expr_references_walker(expr, &context);
1763 eliminate_duplicate_dependencies(context.addrs);
1764 check_usage_on_types(context.addrs, roleid);
1765 free_object_addresses(context.addrs);
1766 }
1767
1768 /*
1769 * Recursively search an expression tree for object references.
1770 *
1771 * Note: in many cases we do not need to create dependencies on the datatypes
1772 * involved in an expression, because we'll have an indirect dependency via
1773 * some other object. For instance Var nodes depend on a column which depends
1774 * on the datatype, and OpExpr nodes depend on the operator which depends on
1775 * the datatype. However we do need a type dependency if there is no such
1776 * indirect dependency, as for example in Const and CoerceToDomain nodes.
1777 *
1778 * Similarly, we don't need to create dependencies on collations except where
1779 * the collation is being freshly introduced to the expression.
1780 */
1781 static bool
1782 find_expr_references_walker(Node *node,
1783 find_expr_references_context *context)
1784 {
1785 if (node == NULL)
1786 return false;
1787 if (IsA(node, Var))
1788 {
1789 Var *var = (Var *) node;
1790 List *rtable;
1791 RangeTblEntry *rte;
1792
1793 /* Find matching rtable entry, or complain if not found */
1794 if (var->varlevelsup >= list_length(context->rtables))
1795 elog(ERROR, "invalid varlevelsup %d", var->varlevelsup);
1796 rtable = (List *) list_nth(context->rtables, var->varlevelsup);
1797 if (var->varno <= 0 || var->varno > list_length(rtable))
1798 elog(ERROR, "invalid varno %d", var->varno);
1799 rte = rt_fetch(var->varno, rtable);
1800
1801 /*
1802 * A whole-row Var references no specific columns, so adds no new
1803 * dependency. (We assume that there is a whole-table dependency
1804 * arising from each underlying rangetable entry. While we could
1805 * record such a dependency when finding a whole-row Var that
1806 * references a relation directly, it's quite unclear how to extend
1807 * that to whole-row Vars for JOINs, so it seems better to leave the
1808 * responsibility with the range table. Note that this poses some
1809 * risks for identifying dependencies of stand-alone expressions:
1810 * whole-table references may need to be created separately.)
1811 */
1812 if (var->varattno == InvalidAttrNumber)
1813 return false;
1814 if (rte->rtekind == RTE_RELATION)
1815 {
1816 /* If it's a plain relation, reference this column */
1817 add_object_address(RelationRelationId, rte->relid, var->varattno,
1818 context->addrs);
1819 }
1820 else if (rte->rtekind == RTE_FUNCTION)
1821 {
1822 /* Might need to add a dependency on a composite type's column */
1823 /* (done out of line, because it's a bit bulky) */
1824 process_function_rte_ref(rte, var->varattno, context);
1825 }
1826
1827 /*
1828 * Vars referencing other RTE types require no additional work. In
1829 * particular, a join alias Var can be ignored, because it must
1830 * reference a merged USING column. The relevant join input columns
1831 * will also be referenced in the join qual, and any type coercion
1832 * functions involved in the alias expression will be dealt with when
1833 * we scan the RTE itself.
1834 */
1835 return false;
1836 }
1837 else if (IsA(node, Const))
1838 {
1839 Const *con = (Const *) node;
1840 Oid objoid;
1841
1842 /* A constant must depend on the constant's datatype */
1843 add_object_address(TypeRelationId, con->consttype, 0,
1844 context->addrs);
1845
1846 /*
1847 * We must also depend on the constant's collation: it could be
1848 * different from the datatype's, if a CollateExpr was const-folded to
1849 * a simple constant. However we can save work in the most common
1850 * case where the collation is "default", since we know that's pinned.
1851 */
1852 if (OidIsValid(con->constcollid) &&
1853 con->constcollid != DEFAULT_COLLATION_OID)
1854 add_object_address(CollationRelationId, con->constcollid, 0,
1855 context->addrs);
1856
1857 /*
1858 * If it's a regclass or similar literal referring to an existing
1859 * object, add a reference to that object. (Currently, only the
1860 * regclass and regconfig cases have any likely use, but we may as
1861 * well handle all the OID-alias datatypes consistently.)
1862 */
1863 if (!con->constisnull)
1864 {
1865 switch (con->consttype)
1866 {
1867 case REGPROCOID:
1868 case REGPROCEDUREOID:
1869 objoid = DatumGetObjectId(con->constvalue);
1870 if (SearchSysCacheExists1(PROCOID,
1871 ObjectIdGetDatum(objoid)))
1872 add_object_address(ProcedureRelationId, objoid, 0,
1873 context->addrs);
1874 break;
1875 case REGOPEROID:
1876 case REGOPERATOROID:
1877 objoid = DatumGetObjectId(con->constvalue);
1878 if (SearchSysCacheExists1(OPEROID,
1879 ObjectIdGetDatum(objoid)))
1880 add_object_address(OperatorRelationId, objoid, 0,
1881 context->addrs);
1882 break;
1883 case REGCLASSOID:
1884 objoid = DatumGetObjectId(con->constvalue);
1885 if (SearchSysCacheExists1(RELOID,
1886 ObjectIdGetDatum(objoid)))
1887 add_object_address(RelationRelationId, objoid, 0,
1888 context->addrs);
1889 break;
1890 case REGTYPEOID:
1891 objoid = DatumGetObjectId(con->constvalue);
1892 if (SearchSysCacheExists1(TYPEOID,
1893 ObjectIdGetDatum(objoid)))
1894 add_object_address(TypeRelationId, objoid, 0,
1895 context->addrs);
1896 break;
1897 case REGCOLLATIONOID:
1898 objoid = DatumGetObjectId(con->constvalue);
1899 if (SearchSysCacheExists1(COLLOID,
1900 ObjectIdGetDatum(objoid)))
1901 add_object_address(CollationRelationId, objoid, 0,
1902 context->addrs);
1903 break;
1904 case REGCONFIGOID:
1905 objoid = DatumGetObjectId(con->constvalue);
1906 if (SearchSysCacheExists1(TSCONFIGOID,
1907 ObjectIdGetDatum(objoid)))
1908 add_object_address(TSConfigRelationId, objoid, 0,
1909 context->addrs);
1910 break;
1911 case REGDICTIONARYOID:
1912 objoid = DatumGetObjectId(con->constvalue);
1913 if (SearchSysCacheExists1(TSDICTOID,
1914 ObjectIdGetDatum(objoid)))
1915 add_object_address(TSDictionaryRelationId, objoid, 0,
1916 context->addrs);
1917 break;
1918
1919 case REGNAMESPACEOID:
1920 objoid = DatumGetObjectId(con->constvalue);
1921 if (SearchSysCacheExists1(NAMESPACEOID,
1922 ObjectIdGetDatum(objoid)))
1923 add_object_address(NamespaceRelationId, objoid, 0,
1924 context->addrs);
1925 break;
1926
1927 /*
1928 * Dependencies for regrole should be shared among all
1929 * databases, so explicitly inhibit to have dependencies.
1930 */
1931 case REGROLEOID:
1932 ereport(ERROR,
1933 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1934 errmsg("constant of the type %s cannot be used here",
1935 "regrole")));
1936 break;
1937 }
1938 }
1939 return false;
1940 }
1941 else if (IsA(node, Param))
1942 {
1943 Param *param = (Param *) node;
1944
1945 /* A parameter must depend on the parameter's datatype */
1946 add_object_address(TypeRelationId, param->paramtype, 0,
1947 context->addrs);
1948 /* and its collation, just as for Consts */
1949 if (OidIsValid(param->paramcollid) &&
1950 param->paramcollid != DEFAULT_COLLATION_OID)
1951 add_object_address(CollationRelationId, param->paramcollid, 0,
1952 context->addrs);
1953 }
1954 else if (IsA(node, FuncExpr))
1955 {
1956 FuncExpr *funcexpr = (FuncExpr *) node;
1957
1958 add_object_address(ProcedureRelationId, funcexpr->funcid, 0,
1959 context->addrs);
1960 /* fall through to examine arguments */
1961 }
1962 else if (IsA(node, OpExpr))
1963 {
1964 OpExpr *opexpr = (OpExpr *) node;
1965
1966 add_object_address(OperatorRelationId, opexpr->opno, 0,
1967 context->addrs);
1968 /* fall through to examine arguments */
1969 }
1970 else if (IsA(node, DistinctExpr))
1971 {
1972 DistinctExpr *distinctexpr = (DistinctExpr *) node;
1973
1974 add_object_address(OperatorRelationId, distinctexpr->opno, 0,
1975 context->addrs);
1976 /* fall through to examine arguments */
1977 }
1978 else if (IsA(node, NullIfExpr))
1979 {
1980 NullIfExpr *nullifexpr = (NullIfExpr *) node;
1981
1982 add_object_address(OperatorRelationId, nullifexpr->opno, 0,
1983 context->addrs);
1984 /* fall through to examine arguments */
1985 }
1986 else if (IsA(node, ScalarArrayOpExpr))
1987 {
1988 ScalarArrayOpExpr *opexpr = (ScalarArrayOpExpr *) node;
1989
1990 add_object_address(OperatorRelationId, opexpr->opno, 0,
1991 context->addrs);
1992 /* fall through to examine arguments */
1993 }
1994 else if (IsA(node, Aggref))
1995 {
1996 Aggref *aggref = (Aggref *) node;
1997
1998 add_object_address(ProcedureRelationId, aggref->aggfnoid, 0,
1999 context->addrs);
2000 /* fall through to examine arguments */
2001 }
2002 else if (IsA(node, WindowFunc))
2003 {
2004 WindowFunc *wfunc = (WindowFunc *) node;
2005
2006 add_object_address(ProcedureRelationId, wfunc->winfnoid, 0,
2007 context->addrs);
2008 /* fall through to examine arguments */
2009 }
2010 else if (IsA(node, SubscriptingRef))
2011 {
2012 SubscriptingRef *sbsref = (SubscriptingRef *) node;
2013
2014 /*
2015 * The refexpr should provide adequate dependency on refcontainertype,
2016 * and that type in turn depends on refelemtype. However, a custom
2017 * subscripting handler might set refrestype to something different
2018 * from either of those, in which case we'd better record it.
2019 */
2020 if (sbsref->refrestype != sbsref->refcontainertype &&
2021 sbsref->refrestype != sbsref->refelemtype)
2022 add_object_address(TypeRelationId, sbsref->refrestype, 0,
2023 context->addrs);
2024 /* fall through to examine arguments */
2025 }
2026 else if (IsA(node, SubPlan))
2027 {
2028 /* Extra work needed here if we ever need this case */
2029 elog(ERROR, "already-planned subqueries not supported");
2030 }
2031 else if (IsA(node, FieldSelect))
2032 {
2033 FieldSelect *fselect = (FieldSelect *) node;
2034 Oid argtype = getBaseType(exprType((Node *) fselect->arg));
2035 Oid reltype = get_typ_typrelid(argtype);
2036
2037 /*
2038 * We need a dependency on the specific column named in FieldSelect,
2039 * assuming we can identify the pg_class OID for it. (Probably we
2040 * always can at the moment, but in future it might be possible for
2041 * argtype to be RECORDOID.) If we can make a column dependency then
2042 * we shouldn't need a dependency on the column's type; but if we
2043 * can't, make a dependency on the type, as it might not appear
2044 * anywhere else in the expression.
2045 */
2046 if (OidIsValid(reltype))
2047 add_object_address(RelationRelationId, reltype, fselect->fieldnum,
2048 context->addrs);
2049 else
2050 add_object_address(TypeRelationId, fselect->resulttype, 0,
2051 context->addrs);
2052 /* the collation might not be referenced anywhere else, either */
2053 if (OidIsValid(fselect->resultcollid) &&
2054 fselect->resultcollid != DEFAULT_COLLATION_OID)
2055 add_object_address(CollationRelationId, fselect->resultcollid, 0,
2056 context->addrs);
2057 }
2058 else if (IsA(node, FieldStore))
2059 {
2060 FieldStore *fstore = (FieldStore *) node;
2061 Oid reltype = get_typ_typrelid(fstore->resulttype);
2062
2063 /* similar considerations to FieldSelect, but multiple column(s) */
2064 if (OidIsValid(reltype))
2065 {
2066 ListCell *l;
2067
2068 foreach(l, fstore->fieldnums)
2069 add_object_address(RelationRelationId, reltype, lfirst_int(l),
2070 context->addrs);
2071 }
2072 else
2073 add_object_address(TypeRelationId, fstore->resulttype, 0,
2074 context->addrs);
2075 }
2076 else if (IsA(node, RelabelType))
2077 {
2078 RelabelType *relab = (RelabelType *) node;
2079
2080 /* since there is no function dependency, need to depend on type */
2081 add_object_address(TypeRelationId, relab->resulttype, 0,
2082 context->addrs);
2083 /* the collation might not be referenced anywhere else, either */
2084 if (OidIsValid(relab->resultcollid) &&
2085 relab->resultcollid != DEFAULT_COLLATION_OID)
2086 add_object_address(CollationRelationId, relab->resultcollid, 0,
2087 context->addrs);
2088 }
2089 else if (IsA(node, CoerceViaIO))
2090 {
2091 CoerceViaIO *iocoerce = (CoerceViaIO *) node;
2092
2093 /* since there is no exposed function, need to depend on type */
2094 add_object_address(TypeRelationId, iocoerce->resulttype, 0,
2095 context->addrs);
2096 /* the collation might not be referenced anywhere else, either */
2097 if (OidIsValid(iocoerce->resultcollid) &&
2098 iocoerce->resultcollid != DEFAULT_COLLATION_OID)
2099 add_object_address(CollationRelationId, iocoerce->resultcollid, 0,
2100 context->addrs);
2101 }
2102 else if (IsA(node, ArrayCoerceExpr))
2103 {
2104 ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) node;
2105
2106 /* as above, depend on type */
2107 add_object_address(TypeRelationId, acoerce->resulttype, 0,
2108 context->addrs);
2109 /* the collation might not be referenced anywhere else, either */
2110 if (OidIsValid(acoerce->resultcollid) &&
2111 acoerce->resultcollid != DEFAULT_COLLATION_OID)
2112 add_object_address(CollationRelationId, acoerce->resultcollid, 0,
2113 context->addrs);
2114 /* fall through to examine arguments */
2115 }
2116 else if (IsA(node, ConvertRowtypeExpr))
2117 {
2118 ConvertRowtypeExpr *cvt = (ConvertRowtypeExpr *) node;
2119
2120 /* since there is no function dependency, need to depend on type */
2121 add_object_address(TypeRelationId, cvt->resulttype, 0,
2122 context->addrs);
2123 }
2124 else if (IsA(node, CollateExpr))
2125 {
2126 CollateExpr *coll = (CollateExpr *) node;
2127
2128 add_object_address(CollationRelationId, coll->collOid, 0,
2129 context->addrs);
2130 }
2131 else if (IsA(node, RowExpr))
2132 {
2133 RowExpr *rowexpr = (RowExpr *) node;
2134
2135 add_object_address(TypeRelationId, rowexpr->row_typeid, 0,
2136 context->addrs);
2137 }
2138 else if (IsA(node, RowCompareExpr))
2139 {
2140 RowCompareExpr *rcexpr = (RowCompareExpr *) node;
2141 ListCell *l;
2142
2143 foreach(l, rcexpr->opnos)
2144 {
2145 add_object_address(OperatorRelationId, lfirst_oid(l), 0,
2146 context->addrs);
2147 }
2148 foreach(l, rcexpr->opfamilies)
2149 {
2150 add_object_address(OperatorFamilyRelationId, lfirst_oid(l), 0,
2151 context->addrs);
2152 }
2153 /* fall through to examine arguments */
2154 }
2155 else if (IsA(node, CoerceToDomain))
2156 {
2157 CoerceToDomain *cd = (CoerceToDomain *) node;
2158
2159 add_object_address(TypeRelationId, cd->resulttype, 0,
2160 context->addrs);
2161 }
2162 else if (IsA(node, NextValueExpr))
2163 {
2164 NextValueExpr *nve = (NextValueExpr *) node;
2165
2166 add_object_address(RelationRelationId, nve->seqid, 0,
2167 context->addrs);
2168 }
2169 else if (IsA(node, OnConflictExpr))
2170 {
2171 OnConflictExpr *onconflict = (OnConflictExpr *) node;
2172
2173 if (OidIsValid(onconflict->constraint))
2174 add_object_address(ConstraintRelationId, onconflict->constraint, 0,
2175 context->addrs);
2176 /* fall through to examine arguments */
2177 }
2178 else if (IsA(node, SortGroupClause))
2179 {
2180 SortGroupClause *sgc = (SortGroupClause *) node;
2181
2182 add_object_address(OperatorRelationId, sgc->eqop, 0,
2183 context->addrs);
2184 if (OidIsValid(sgc->sortop))
2185 add_object_address(OperatorRelationId, sgc->sortop, 0,
2186 context->addrs);
2187 return false;
2188 }
2189 else if (IsA(node, WindowClause))
2190 {
2191 WindowClause *wc = (WindowClause *) node;
2192
2193 if (OidIsValid(wc->startInRangeFunc))
2194 add_object_address(ProcedureRelationId, wc->startInRangeFunc, 0,
2195 context->addrs);
2196 if (OidIsValid(wc->endInRangeFunc))
2197 add_object_address(ProcedureRelationId, wc->endInRangeFunc, 0,
2198 context->addrs);
2199 if (OidIsValid(wc->inRangeColl) &&
2200 wc->inRangeColl != DEFAULT_COLLATION_OID)
2201 add_object_address(CollationRelationId, wc->inRangeColl, 0,
2202 context->addrs);
2203 /* fall through to examine substructure */
2204 }
2205 else if (IsA(node, CTECycleClause))
2206 {
2207 CTECycleClause *cc = (CTECycleClause *) node;
2208
2209 if (OidIsValid(cc->cycle_mark_type))
2210 add_object_address(TypeRelationId, cc->cycle_mark_type, 0,
2211 context->addrs);
2212 if (OidIsValid(cc->cycle_mark_collation))
2213 add_object_address(CollationRelationId, cc->cycle_mark_collation, 0,
2214 context->addrs);
2215 if (OidIsValid(cc->cycle_mark_neop))
2216 add_object_address(OperatorRelationId, cc->cycle_mark_neop, 0,
2217 context->addrs);
2218 /* fall through to examine substructure */
2219 }
2220 else if (IsA(node, Query))
2221 {
2222 /* Recurse into RTE subquery or not-yet-planned sublink subquery */
2223 Query *query = (Query *) node;
2224 ListCell *lc;
2225 bool result;
2226
2227 /*
2228 * Add whole-relation refs for each plain relation mentioned in the
2229 * subquery's rtable, and ensure we add refs for any type-coercion
2230 * functions used in join alias lists.
2231 *
2232 * Note: query_tree_walker takes care of recursing into RTE_FUNCTION
2233 * RTEs, subqueries, etc, so no need to do that here. But we must
2234 * tell it not to visit join alias lists, or we'll add refs for join
2235 * input columns whether or not they are actually used in our query.
2236 *
2237 * Note: we don't need to worry about collations mentioned in
2238 * RTE_VALUES or RTE_CTE RTEs, because those must just duplicate
2239 * collations referenced in other parts of the Query. We do have to
2240 * worry about collations mentioned in RTE_FUNCTION, but we take care
2241 * of those when we recurse to the RangeTblFunction node(s).
2242 */
2243 foreach(lc, query->rtable)
2244 {
2245 RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
2246
2247 switch (rte->rtekind)
2248 {
2249 case RTE_RELATION:
2250 add_object_address(RelationRelationId, rte->relid, 0,
2251 context->addrs);
2252 break;
2253 case RTE_JOIN:
2254
2255 /*
2256 * Examine joinaliasvars entries only for merged JOIN
2257 * USING columns. Only those entries could contain
2258 * type-coercion functions. Also, their join input
2259 * columns must be referenced in the join quals, so this
2260 * won't accidentally add refs to otherwise-unused join
2261 * input columns. (We want to ref the type coercion
2262 * functions even if the merged column isn't explicitly
2263 * used anywhere, to protect possible expansion of the
2264 * join RTE as a whole-row var, and because it seems like
2265 * a bad idea to allow dropping a function that's present
2266 * in our query tree, whether or not it could get called.)
2267 */
2268 context->rtables = lcons(query->rtable, context->rtables);
2269 for (int i = 0; i < rte->joinmergedcols; i++)
2270 {
2271 Node *aliasvar = list_nth(rte->joinaliasvars, i);
2272
2273 if (!IsA(aliasvar, Var))
2274 find_expr_references_walker(aliasvar, context);
2275 }
2276 context->rtables = list_delete_first(context->rtables);
2277 break;
2278 case RTE_NAMEDTUPLESTORE:
2279
2280 /*
2281 * Cataloged objects cannot depend on tuplestores, because
2282 * those have no cataloged representation. For now we can
2283 * call the tuplestore a "transition table" because that's
2284 * the only kind exposed to SQL, but someday we might have
2285 * to work harder.
2286 */
2287 ereport(ERROR,
2288 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2289 errmsg("transition table \"%s\" cannot be referenced in a persistent object",
2290 rte->eref->aliasname)));
2291 break;
2292 default:
2293 /* Other RTE types can be ignored here */
2294 break;
2295 }
2296 }
2297
2298 /*
2299 * If the query is an INSERT or UPDATE, we should create a dependency
2300 * on each target column, to prevent the specific target column from
2301 * being dropped. Although we will visit the TargetEntry nodes again
2302 * during query_tree_walker, we won't have enough context to do this
2303 * conveniently, so do it here.
2304 */
2305 if (query->commandType == CMD_INSERT ||
2306 query->commandType == CMD_UPDATE)
2307 {
2308 RangeTblEntry *rte;
2309
2310 if (query->resultRelation <= 0 ||
2311 query->resultRelation > list_length(query->rtable))
2312 elog(ERROR, "invalid resultRelation %d",
2313 query->resultRelation);
2314 rte = rt_fetch(query->resultRelation, query->rtable);
2315 if (rte->rtekind == RTE_RELATION)
2316 {
2317 foreach(lc, query->targetList)
2318 {
2319 TargetEntry *tle = (TargetEntry *) lfirst(lc);
2320
2321 if (tle->resjunk)
2322 continue; /* ignore junk tlist items */
2323 add_object_address(RelationRelationId, rte->relid, tle->resno,
2324 context->addrs);
2325 }
2326 }
2327 }
2328
2329 /*
2330 * Add dependencies on constraints listed in query's constraintDeps
2331 */
2332 foreach(lc, query->constraintDeps)
2333 {
2334 add_object_address(ConstraintRelationId, lfirst_oid(lc), 0,
2335 context->addrs);
2336 }
2337
2338 /* Examine substructure of query */
2339 context->rtables = lcons(query->rtable, context->rtables);
2340 result = query_tree_walker(query,
2341 find_expr_references_walker,
2342 context,
2343 QTW_IGNORE_JOINALIASES |
2344 QTW_EXAMINE_SORTGROUP);
2345 context->rtables = list_delete_first(context->rtables);
2346 return result;
2347 }
2348 else if (IsA(node, SetOperationStmt))
2349 {
2350 SetOperationStmt *setop = (SetOperationStmt *) node;
2351
2352 /* we need to look at the groupClauses for operator references */
2353 find_expr_references_walker((Node *) setop->groupClauses, context);
2354 /* fall through to examine child nodes */
2355 }
2356 else if (IsA(node, RangeTblFunction))
2357 {
2358 RangeTblFunction *rtfunc = (RangeTblFunction *) node;
2359 ListCell *ct;
2360
2361 /*
2362 * Add refs for any datatypes and collations used in a column
2363 * definition list for a RECORD function. (For other cases, it should
2364 * be enough to depend on the function itself.)
2365 */
2366 foreach(ct, rtfunc->funccoltypes)
2367 {
2368 add_object_address(TypeRelationId, lfirst_oid(ct), 0,
2369 context->addrs);
2370 }
2371 foreach(ct, rtfunc->funccolcollations)
2372 {
2373 Oid collid = lfirst_oid(ct);
2374
2375 if (OidIsValid(collid) && collid != DEFAULT_COLLATION_OID)
2376 add_object_address(CollationRelationId, collid, 0,
2377 context->addrs);
2378 }
2379 }
2380 else if (IsA(node, TableFunc))
2381 {
2382 TableFunc *tf = (TableFunc *) node;
2383 ListCell *ct;
2384
2385 /*
2386 * Add refs for the datatypes and collations used in the TableFunc.
2387 */
2388 foreach(ct, tf->coltypes)
2389 {
2390 add_object_address(TypeRelationId, lfirst_oid(ct), 0,
2391 context->addrs);
2392 }
2393 foreach(ct, tf->colcollations)
2394 {
2395 Oid collid = lfirst_oid(ct);
2396
2397 if (OidIsValid(collid) && collid != DEFAULT_COLLATION_OID)
2398 add_object_address(CollationRelationId, collid, 0,
2399 context->addrs);
2400 }
2401 }
2402 else if (IsA(node, TableSampleClause))
2403 {
2404 TableSampleClause *tsc = (TableSampleClause *) node;
2405
2406 add_object_address(ProcedureRelationId, tsc->tsmhandler, 0,
2407 context->addrs);
2408 /* fall through to examine arguments */
2409 }
2410
2411 return expression_tree_walker(node, find_expr_references_walker,
2412 context);
2413 }
2414
2415 /*
2416 * find_expr_references_walker subroutine: handle a Var reference
2417 * to an RTE_FUNCTION RTE
2418 */
2419 static void
2420 process_function_rte_ref(RangeTblEntry *rte, AttrNumber attnum,
2421 find_expr_references_context *context)
2422 {
2423 int atts_done = 0;
2424 ListCell *lc;
2425
2426 /*
2427 * Identify which RangeTblFunction produces this attnum, and see if it
2428 * returns a composite type. If so, we'd better make a dependency on the
2429 * referenced column of the composite type (or actually, of its associated
2430 * relation).
2431 */
2432 foreach(lc, rte->functions)
2433 {
2434 RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
2435
2436 if (attnum > atts_done &&
2437 attnum <= atts_done + rtfunc->funccolcount)
2438 {
2439 TupleDesc tupdesc;
2440
2441 /* If it has a coldeflist, it certainly returns RECORD */
2442 if (rtfunc->funccolnames != NIL)
2443 tupdesc = NULL; /* no need to work hard */
2444 else
2445 tupdesc = get_expr_result_tupdesc(rtfunc->funcexpr, true);
2446 if (tupdesc && tupdesc->tdtypeid != RECORDOID)
2447 {
2448 /*
2449 * Named composite type, so individual columns could get
2450 * dropped. Make a dependency on this specific column.
2451 */
2452 Oid reltype = get_typ_typrelid(tupdesc->tdtypeid);
2453
2454 Assert(attnum - atts_done <= tupdesc->natts);
2455 if (OidIsValid(reltype)) /* can this fail? */
2456 add_object_address(RelationRelationId, reltype,
2457 attnum - atts_done,
2458 context->addrs);
2459 return;
2460 }
2461 /* Nothing to do; function's result type is handled elsewhere */
2462 return;
2463 }
2464 atts_done += rtfunc->funccolcount;
2465 }
2466
2467 /* If we get here, must be looking for the ordinality column */
2468 if (rte->funcordinality && attnum == atts_done + 1)
2469 return;
2470
2471 /* this probably can't happen ... */
2472 ereport(ERROR,
2473 (errcode(ERRCODE_UNDEFINED_COLUMN),
2474 errmsg("column %d of relation \"%s\" does not exist",
2475 attnum, rte->eref->aliasname)));
2476 }
2477
2478 /*
2479 * Given an array of dependency references, eliminate any duplicates.
2480 */
2481 static void
2482 eliminate_duplicate_dependencies(ObjectAddresses *addrs)
2483 {
2484 ObjectAddress *priorobj;
2485 int oldref,
2486 newrefs;
2487
2488 /*
2489 * We can't sort if the array has "extra" data, because there's no way to
2490 * keep it in sync. Fortunately that combination of features is not
2491 * needed.
2492 */
2493 Assert(!addrs->extras);
2494
2495 if (addrs->numrefs <= 1)
2496 return; /* nothing to do */
2497
2498 /* Sort the refs so that duplicates are adjacent */
2499 qsort(addrs->refs, addrs->numrefs, sizeof(ObjectAddress),
2500 object_address_comparator);
2501
2502 /* Remove dups */
2503 priorobj = addrs->refs;
2504 newrefs = 1;
2505 for (oldref = 1; oldref < addrs->numrefs; oldref++)
2506 {
2507 ObjectAddress *thisobj = addrs->refs + oldref;
2508
2509 if (priorobj->classId == thisobj->classId &&
2510 priorobj->objectId == thisobj->objectId)
2511 {
2512 if (priorobj->objectSubId == thisobj->objectSubId)
2513 continue; /* identical, so drop thisobj */
2514
2515 /*
2516 * If we have a whole-object reference and a reference to a part
2517 * of the same object, we don't need the whole-object reference
2518 * (for example, we don't need to reference both table foo and
2519 * column foo.bar). The whole-object reference will always appear
2520 * first in the sorted list.
2521 */
2522 if (priorobj->objectSubId == 0)
2523 {
2524 /* replace whole ref with partial */
2525 priorobj->objectSubId = thisobj->objectSubId;
2526 continue;
2527 }
2528 }
2529 /* Not identical, so add thisobj to output set */
2530 priorobj++;
2531 *priorobj = *thisobj;
2532 newrefs++;
2533 }
2534
2535 addrs->numrefs = newrefs;
2536 }
2537
2538 /*
2539 * qsort comparator for ObjectAddress items
2540 */
2541 static int
2542 object_address_comparator(const void *a, const void *b)
2543 {
2544 const ObjectAddress *obja = (const ObjectAddress *) a;
2545 const ObjectAddress *objb = (const ObjectAddress *) b;
2546
2547 /*
2548 * Primary sort key is OID descending. Most of the time, this will result
2549 * in putting newer objects before older ones, which is likely to be the
2550 * right order to delete in.
2551 */
2552 if (obja->objectId > objb->objectId)
2553 return -1;
2554 if (obja->objectId < objb->objectId)
2555 return 1;
2556
2557 /*
2558 * Next sort on catalog ID, in case identical OIDs appear in different
2559 * catalogs. Sort direction is pretty arbitrary here.
2560 */
2561 if (obja->classId < objb->classId)
2562 return -1;
2563 if (obja->classId > objb->classId)
2564 return 1;
2565
2566 /*
2567 * Last, sort on object subId.
2568 *
2569 * We sort the subId as an unsigned int so that 0 (the whole object) will
2570 * come first. This is essential for eliminate_duplicate_dependencies,
2571 * and is also the best order for findDependentObjects.
2572 */
2573 if ((unsigned int) obja->objectSubId < (unsigned int) objb->objectSubId)
2574 return -1;
2575 if ((unsigned int) obja->objectSubId > (unsigned int) objb->objectSubId)
2576 return 1;
2577 return 0;
2578 }
2579
2580 /*
2581 * Routines for handling an expansible array of ObjectAddress items.
2582 *
2583 * new_object_addresses: create a new ObjectAddresses array.
2584 */
2585 ObjectAddresses *
2586 new_object_addresses(void)
2587 {
2588 ObjectAddresses *addrs;
2589
2590 addrs = palloc(sizeof(ObjectAddresses));
2591
2592 addrs->numrefs = 0;
2593 addrs->maxrefs = 32;
2594 addrs->refs = (ObjectAddress *)
2595 palloc(addrs->maxrefs * sizeof(ObjectAddress));
2596 addrs->extras = NULL; /* until/unless needed */
2597
2598 return addrs;
2599 }
2600
2601 /*
2602 * Add an entry to an ObjectAddresses array.
2603 */
2604 static void
2605 add_object_address(Oid classId, Oid objectId, int32 subId,
2606 ObjectAddresses *addrs)
2607 {
2608 ObjectAddress *item;
2609
2610 /* enlarge array if needed */
2611 if (addrs->numrefs >= addrs->maxrefs)
2612 {
2613 addrs->maxrefs *= 2;
2614 addrs->refs = (ObjectAddress *)
2615 repalloc(addrs->refs, addrs->maxrefs * sizeof(ObjectAddress));
2616 Assert(!addrs->extras);
2617 }
2618 /* record this item */
2619 item = addrs->refs + addrs->numrefs;
2620 item->classId = classId;
2621 item->objectId = objectId;
2622 item->objectSubId = subId;
2623 addrs->numrefs++;
2624 }
2625
2626 /*
2627 * Add an entry to an ObjectAddresses array.
2628 *
2629 * As above, but specify entry exactly.
2630 */
2631 void
2632 add_exact_object_address(const ObjectAddress *object,
2633 ObjectAddresses *addrs)
2634 {
2635 ObjectAddress *item;
2636
2637 /* enlarge array if needed */
2638 if (addrs->numrefs >= addrs->maxrefs)
2639 {
2640 addrs->maxrefs *= 2;
2641 addrs->refs = (ObjectAddress *)
2642 repalloc(addrs->refs, addrs->maxrefs * sizeof(ObjectAddress));
2643 Assert(!addrs->extras);
2644 }
2645 /* record this item */
2646 item = addrs->refs + addrs->numrefs;
2647 *item = *object;
2648 addrs->numrefs++;
2649 }
2650
2651 /*
2652 * Add an entry to an ObjectAddresses array.
2653 *
2654 * As above, but specify entry exactly and provide some "extra" data too.
2655 */
2656 static void
2657 add_exact_object_address_extra(const ObjectAddress *object,
2658 const ObjectAddressExtra *extra,
2659 ObjectAddresses *addrs)
2660 {
2661 ObjectAddress *item;
2662 ObjectAddressExtra *itemextra;
2663
2664 /* allocate extra space if first time */
2665 if (!addrs->extras)
2666 addrs->extras = (ObjectAddressExtra *)
2667 palloc(addrs->maxrefs * sizeof(ObjectAddressExtra));
2668
2669 /* enlarge array if needed */
2670 if (addrs->numrefs >= addrs->maxrefs)
2671 {
2672 addrs->maxrefs *= 2;
2673 addrs->refs = (ObjectAddress *)
2674 repalloc(addrs->refs, addrs->maxrefs * sizeof(ObjectAddress));
2675 addrs->extras = (ObjectAddressExtra *)
2676 repalloc(addrs->extras, addrs->maxrefs * sizeof(ObjectAddressExtra));
2677 }
2678 /* record this item */
2679 item = addrs->refs + addrs->numrefs;
2680 *item = *object;
2681 itemextra = addrs->extras + addrs->numrefs;
2682 *itemextra = *extra;
2683 addrs->numrefs++;
2684 }
2685
2686 /*
2687 * Test whether an object is present in an ObjectAddresses array.
2688 *
2689 * We return "true" if object is a subobject of something in the array, too.
2690 */
2691 bool
2692 object_address_present(const ObjectAddress *object,
2693 const ObjectAddresses *addrs)
2694 {
2695 int i;
2696
2697 for (i = addrs->numrefs - 1; i >= 0; i--)
2698 {
2699 const ObjectAddress *thisobj = addrs->refs + i;
2700
2701 if (object->classId == thisobj->classId &&
2702 object->objectId == thisobj->objectId)
2703 {
2704 if (object->objectSubId == thisobj->objectSubId ||
2705 thisobj->objectSubId == 0)
2706 return true;
2707 }
2708 }
2709
2710 return false;
2711 }
2712
2713 /*
2714 * As above, except that if the object is present then also OR the given
2715 * flags into its associated extra data (which must exist).
2716 */
2717 static bool
2718 object_address_present_add_flags(const ObjectAddress *object,
2719 int flags,
2720 ObjectAddresses *addrs)
2721 {
2722 bool result = false;
2723 int i;
2724
2725 for (i = addrs->numrefs - 1; i >= 0; i--)
2726 {
2727 ObjectAddress *thisobj = addrs->refs + i;
2728
2729 if (object->classId == thisobj->classId &&
2730 object->objectId == thisobj->objectId)
2731 {
2732 if (object->objectSubId == thisobj->objectSubId)
2733 {
2734 ObjectAddressExtra *thisextra = addrs->extras + i;
2735
2736 thisextra->flags |= flags;
2737 result = true;
2738 }
2739 else if (thisobj->objectSubId == 0)
2740 {
2741 /*
2742 * We get here if we find a need to delete a column after
2743 * having already decided to drop its whole table. Obviously
2744 * we no longer need to drop the subobject, so report that we
2745 * found the subobject in the array. But don't plaster its
2746 * flags on the whole object.
2747 */
2748 result = true;
2749 }
2750 else if (object->objectSubId == 0)
2751 {
2752 /*
2753 * We get here if we find a need to delete a whole table after
2754 * having already decided to drop one of its columns. We
2755 * can't report that the whole object is in the array, but we
2756 * should mark the subobject with the whole object's flags.
2757 *
2758 * It might seem attractive to physically delete the column's
2759 * array entry, or at least mark it as no longer needing
2760 * separate deletion. But that could lead to, e.g., dropping
2761 * the column's datatype before we drop the table, which does
2762 * not seem like a good idea. This is a very rare situation
2763 * in practice, so we just take the hit of doing a separate
2764 * DROP COLUMN action even though we know we're gonna delete
2765 * the table later.
2766 *
2767 * What we can do, though, is mark this as a subobject so that
2768 * we don't report it separately, which is confusing because
2769 * it's unpredictable whether it happens or not. But do so
2770 * only if flags != 0 (flags == 0 is a read-only probe).
2771 *
2772 * Because there could be other subobjects of this object in
2773 * the array, this case means we always have to loop through
2774 * the whole array; we cannot exit early on a match.
2775 */
2776 ObjectAddressExtra *thisextra = addrs->extras + i;
2777
2778 if (flags)
2779 thisextra->flags |= (flags | DEPFLAG_SUBOBJECT);
2780 }
2781 }
2782 }
2783
2784 return result;
2785 }
2786
2787 /*
2788 * Similar to above, except we search an ObjectAddressStack.
2789 */
2790 static bool
2791 stack_address_present_add_flags(const ObjectAddress *object,
2792 int flags,
2793 ObjectAddressStack *stack)
2794 {
2795 bool result = false;
2796 ObjectAddressStack *stackptr;
2797
2798 for (stackptr = stack; stackptr; stackptr = stackptr->next)
2799 {
2800 const ObjectAddress *thisobj = stackptr->object;
2801
2802 if (object->classId == thisobj->classId &&
2803 object->objectId == thisobj->objectId)
2804 {
2805 if (object->objectSubId == thisobj->objectSubId)
2806 {
2807 stackptr->flags |= flags;
2808 result = true;
2809 }
2810 else if (thisobj->objectSubId == 0)
2811 {
2812 /*
2813 * We're visiting a column with whole table already on stack.
2814 * As in object_address_present_add_flags(), we can skip
2815 * further processing of the subobject, but we don't want to
2816 * propagate flags for the subobject to the whole object.
2817 */
2818 result = true;
2819 }
2820 else if (object->objectSubId == 0)
2821 {
2822 /*
2823 * We're visiting a table with column already on stack. As in
2824 * object_address_present_add_flags(), we should propagate
2825 * flags for the whole object to each of its subobjects.
2826 */
2827 if (flags)
2828 stackptr->flags |= (flags | DEPFLAG_SUBOBJECT);
2829 }
2830 }
2831 }
2832
2833 return result;
2834 }
2835
2836 /*
2837 * Record multiple dependencies from an ObjectAddresses array, after first
2838 * removing any duplicates.
2839 */
2840 void
2841 record_object_address_dependencies(const ObjectAddress *depender,
2842 ObjectAddresses *referenced,
2843 DependencyType behavior)
2844 {
2845 eliminate_duplicate_dependencies(referenced);
2846 recordMultipleDependencies(depender,
2847 referenced->refs, referenced->numrefs,
2848 behavior);
2849 }
2850
2851 /*
2852 * Sort the items in an ObjectAddresses array.
2853 *
2854 * The major sort key is OID-descending, so that newer objects will be listed
2855 * first in most cases. This is primarily useful for ensuring stable outputs
2856 * from regression tests; it's not recommended if the order of the objects is
2857 * determined by user input, such as the order of targets in a DROP command.
2858 */
2859 void
2860 sort_object_addresses(ObjectAddresses *addrs)
2861 {
2862 if (addrs->numrefs > 1)
2863 qsort(addrs->refs, addrs->numrefs,
2864 sizeof(ObjectAddress),
2865 object_address_comparator);
2866 }
2867
2868 /*
2869 * Clean up when done with an ObjectAddresses array.
2870 */
2871 void
2872 free_object_addresses(ObjectAddresses *addrs)
2873 {
2874 pfree(addrs->refs);
2875 if (addrs->extras)
2876 pfree(addrs->extras);
2877 pfree(addrs);
2878 }
2879
2880 /*
2881 * delete initial ACL for extension objects
2882 */
2883 static void
2884 DeleteInitPrivs(const ObjectAddress *object)
2885 {
2886 Relation relation;
2887 ScanKeyData key[3];
2888 int nkeys;
2889 SysScanDesc scan;
2890 HeapTuple oldtuple;
2891
2892 relation = table_open(InitPrivsRelationId, RowExclusiveLock);
2893
2894 ScanKeyInit(&key[0],
2895 Anum_pg_init_privs_objoid,
2896 BTEqualStrategyNumber, F_OIDEQ,
2897 ObjectIdGetDatum(object->objectId));
2898 ScanKeyInit(&key[1],
2899 Anum_pg_init_privs_classoid,
2900 BTEqualStrategyNumber, F_OIDEQ,
2901 ObjectIdGetDatum(object->classId));
2902 if (object->objectSubId != 0)
2903 {
2904 ScanKeyInit(&key[2],
2905 Anum_pg_init_privs_objsubid,
2906 BTEqualStrategyNumber, F_INT4EQ,
2907 Int32GetDatum(object->objectSubId));
2908 nkeys = 3;
2909 }
2910 else
2911 nkeys = 2;
2912
2913 scan = systable_beginscan(relation, InitPrivsObjIndexId, true,
2914 NULL, nkeys, key);
2915
2916 while (HeapTupleIsValid(oldtuple = systable_getnext(scan)))
2917 CatalogTupleDelete(relation, &oldtuple->t_self);
2918
2919 systable_endscan(scan);
2920
2921 table_close(relation, RowExclusiveLock);
2922 }