Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * common.c
4 : * Catalog routines used by pg_dump; long ago these were shared
5 : * by another dump tool, but not anymore.
6 : *
7 : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
8 : * Portions Copyright (c) 1994, Regents of the University of California
9 : *
10 : *
11 : * IDENTIFICATION
12 : * src/bin/pg_dump/common.c
13 : *
14 : *-------------------------------------------------------------------------
15 : */
16 : #include "postgres_fe.h"
17 :
18 : #include <ctype.h>
19 :
20 : #include "catalog/pg_am_d.h"
21 : #include "catalog/pg_class_d.h"
22 : #include "catalog/pg_collation_d.h"
23 : #include "catalog/pg_extension_d.h"
24 : #include "catalog/pg_namespace_d.h"
25 : #include "catalog/pg_operator_d.h"
26 : #include "catalog/pg_proc_d.h"
27 : #include "catalog/pg_publication_d.h"
28 : #include "catalog/pg_subscription_d.h"
29 : #include "catalog/pg_type_d.h"
30 : #include "common/hashfn.h"
31 : #include "pg_backup_utils.h"
32 : #include "pg_dump.h"
33 :
34 : /*
35 : * Variables for mapping DumpId to DumpableObject
36 : */
37 : static DumpableObject **dumpIdMap = NULL;
38 : static int allocedDumpIds = 0;
39 : static DumpId lastDumpId = 0; /* Note: 0 is InvalidDumpId */
40 :
41 : /*
42 : * Infrastructure for mapping CatalogId to DumpableObject
43 : *
44 : * We use a hash table generated by simplehash.h. That infrastructure
45 : * requires all the hash table entries to be the same size, and it also
46 : * expects that it can move them around when resizing the table. So we
47 : * cannot make the DumpableObjects be elements of the hash table directly;
48 : * instead, the hash table elements contain pointers to DumpableObjects.
49 : * This does have the advantage of letting us map multiple CatalogIds
50 : * to one DumpableObject, which is useful for blobs.
51 : *
52 : * It turns out to be convenient to also use this data structure to map
53 : * CatalogIds to owning extensions, if any. Since extension membership
54 : * data is read before creating most DumpableObjects, either one of dobj
55 : * and ext could be NULL.
56 : */
57 : typedef struct _catalogIdMapEntry
58 : {
59 : CatalogId catId; /* the indexed CatalogId */
60 : uint32 status; /* hash status */
61 : uint32 hashval; /* hash code for the CatalogId */
62 : DumpableObject *dobj; /* the associated DumpableObject, if any */
63 : ExtensionInfo *ext; /* owning extension, if any */
64 : } CatalogIdMapEntry;
65 :
66 : #define SH_PREFIX catalogid
67 : #define SH_ELEMENT_TYPE CatalogIdMapEntry
68 : #define SH_KEY_TYPE CatalogId
69 : #define SH_KEY catId
70 : #define SH_HASH_KEY(tb, key) hash_bytes((const unsigned char *) &(key), sizeof(CatalogId))
71 : #define SH_EQUAL(tb, a, b) ((a).oid == (b).oid && (a).tableoid == (b).tableoid)
72 : #define SH_STORE_HASH
73 : #define SH_GET_HASH(tb, a) (a)->hashval
74 : #define SH_SCOPE static inline
75 : #define SH_RAW_ALLOCATOR pg_malloc0
76 : #define SH_DECLARE
77 : #define SH_DEFINE
78 : #include "lib/simplehash.h"
79 :
80 : #define CATALOGIDHASH_INITIAL_SIZE 10000
81 :
82 : static catalogid_hash *catalogIdHash = NULL;
83 :
84 : static void flagInhTables(Archive *fout, TableInfo *tblinfo, int numTables,
85 : InhInfo *inhinfo, int numInherits);
86 : static void flagInhIndexes(Archive *fout, TableInfo *tblinfo, int numTables);
87 : static void flagInhAttrs(Archive *fout, DumpOptions *dopt, TableInfo *tblinfo,
88 : int numTables);
89 : static int strInArray(const char *pattern, char **arr, int arr_size);
90 : static IndxInfo *findIndexByOid(Oid oid);
91 :
92 :
93 : /*
94 : * getSchemaData
95 : * Collect information about all potentially dumpable objects
96 : */
97 : TableInfo *
98 258 : getSchemaData(Archive *fout, int *numTablesPtr)
99 : {
100 : TableInfo *tblinfo;
101 : ExtensionInfo *extinfo;
102 : InhInfo *inhinfo;
103 : int numTables;
104 : int numExtensions;
105 : int numInherits;
106 :
107 : /*
108 : * We must read extensions and extension membership info first, because
109 : * extension membership needs to be consultable during decisions about
110 : * whether other objects are to be dumped.
111 : */
112 258 : pg_log_info("reading extensions");
113 258 : extinfo = getExtensions(fout, &numExtensions);
114 :
115 258 : pg_log_info("identifying extension members");
116 258 : getExtensionMembership(fout, extinfo, numExtensions);
117 :
118 258 : pg_log_info("reading schemas");
119 258 : getNamespaces(fout);
120 :
121 : /*
122 : * getTables should be done as soon as possible, so as to minimize the
123 : * window between starting our transaction and acquiring per-table locks.
124 : * However, we have to do getNamespaces first because the tables get
125 : * linked to their containing namespaces during getTables.
126 : */
127 258 : pg_log_info("reading user-defined tables");
128 258 : tblinfo = getTables(fout, &numTables);
129 :
130 257 : getOwnedSeqs(fout, tblinfo, numTables);
131 :
132 257 : pg_log_info("reading user-defined functions");
133 257 : getFuncs(fout);
134 :
135 : /* this must be after getTables and getFuncs */
136 257 : pg_log_info("reading user-defined types");
137 257 : getTypes(fout);
138 :
139 : /* this must be after getFuncs, too */
140 257 : pg_log_info("reading procedural languages");
141 257 : getProcLangs(fout);
142 :
143 257 : pg_log_info("reading user-defined aggregate functions");
144 257 : getAggregates(fout);
145 :
146 257 : pg_log_info("reading user-defined operators");
147 257 : getOperators(fout);
148 :
149 257 : pg_log_info("reading user-defined access methods");
150 257 : getAccessMethods(fout);
151 :
152 257 : pg_log_info("reading user-defined operator classes");
153 257 : getOpclasses(fout);
154 :
155 257 : pg_log_info("reading user-defined operator families");
156 257 : getOpfamilies(fout);
157 :
158 257 : pg_log_info("reading user-defined text search parsers");
159 257 : getTSParsers(fout);
160 :
161 257 : pg_log_info("reading user-defined text search templates");
162 257 : getTSTemplates(fout);
163 :
164 257 : pg_log_info("reading user-defined text search dictionaries");
165 257 : getTSDictionaries(fout);
166 :
167 257 : pg_log_info("reading user-defined text search configurations");
168 257 : getTSConfigurations(fout);
169 :
170 257 : pg_log_info("reading user-defined foreign-data wrappers");
171 257 : getForeignDataWrappers(fout);
172 :
173 257 : pg_log_info("reading user-defined foreign servers");
174 257 : getForeignServers(fout);
175 :
176 257 : pg_log_info("reading default privileges");
177 257 : getDefaultACLs(fout);
178 :
179 257 : pg_log_info("reading user-defined collations");
180 257 : getCollations(fout);
181 :
182 257 : pg_log_info("reading user-defined conversions");
183 257 : getConversions(fout);
184 :
185 257 : pg_log_info("reading type casts");
186 257 : getCasts(fout);
187 :
188 257 : pg_log_info("reading transforms");
189 257 : getTransforms(fout);
190 :
191 257 : pg_log_info("reading table inheritance information");
192 257 : inhinfo = getInherits(fout, &numInherits);
193 :
194 257 : pg_log_info("reading event triggers");
195 257 : getEventTriggers(fout);
196 :
197 : /* Identify extension configuration tables that should be dumped */
198 257 : pg_log_info("finding extension tables");
199 257 : processExtensionTables(fout, extinfo, numExtensions);
200 :
201 : /* Link tables to parents, mark parents of target tables interesting */
202 257 : pg_log_info("finding inheritance relationships");
203 257 : flagInhTables(fout, tblinfo, numTables, inhinfo, numInherits);
204 :
205 257 : pg_log_info("reading column info for interesting tables");
206 257 : getTableAttrs(fout, tblinfo, numTables);
207 :
208 257 : pg_log_info("flagging inherited columns in subtables");
209 257 : flagInhAttrs(fout, fout->dopt, tblinfo, numTables);
210 :
211 257 : pg_log_info("reading partitioning data");
212 257 : getPartitioningInfo(fout);
213 :
214 257 : pg_log_info("reading indexes");
215 257 : getIndexes(fout, tblinfo, numTables);
216 :
217 257 : pg_log_info("flagging indexes in partitioned tables");
218 257 : flagInhIndexes(fout, tblinfo, numTables);
219 :
220 257 : pg_log_info("reading extended statistics");
221 257 : getExtendedStatistics(fout);
222 :
223 257 : pg_log_info("reading constraints");
224 257 : getConstraints(fout, tblinfo, numTables);
225 :
226 257 : pg_log_info("reading triggers");
227 257 : getTriggers(fout, tblinfo, numTables);
228 :
229 257 : pg_log_info("reading rewrite rules");
230 257 : getRules(fout);
231 :
232 257 : pg_log_info("reading policies");
233 257 : getPolicies(fout, tblinfo, numTables);
234 :
235 257 : pg_log_info("reading publications");
236 257 : getPublications(fout);
237 :
238 257 : pg_log_info("reading publication membership of tables");
239 257 : getPublicationTables(fout, tblinfo, numTables);
240 :
241 257 : pg_log_info("reading publication membership of schemas");
242 257 : getPublicationNamespaces(fout);
243 :
244 257 : pg_log_info("reading subscriptions");
245 257 : getSubscriptions(fout);
246 :
247 257 : pg_log_info("reading subscription membership of relations");
248 257 : getSubscriptionRelations(fout);
249 :
250 257 : free(inhinfo); /* not needed any longer */
251 :
252 257 : *numTablesPtr = numTables;
253 257 : return tblinfo;
254 : }
255 :
256 : /* flagInhTables -
257 : * Fill in parent link fields of tables for which we need that information,
258 : * mark parents of target tables as interesting, and create
259 : * TableAttachInfo objects for partitioned tables with appropriate
260 : * dependency links.
261 : *
262 : * Note that only direct ancestors of targets are marked interesting.
263 : * This is sufficient; we don't much care whether they inherited their
264 : * attributes or not.
265 : *
266 : * modifies tblinfo
267 : */
268 : static void
269 257 : flagInhTables(Archive *fout, TableInfo *tblinfo, int numTables,
270 : InhInfo *inhinfo, int numInherits)
271 : {
272 257 : TableInfo *child = NULL;
273 257 : TableInfo *parent = NULL;
274 : int i,
275 : j;
276 :
277 : /*
278 : * Set up links from child tables to their parents.
279 : *
280 : * We used to attempt to skip this work for tables that are not to be
281 : * dumped; but the optimizable cases are rare in practice, and setting up
282 : * these links in bulk is cheaper than the old way. (Note in particular
283 : * that it's very rare for a child to have more than one parent.)
284 : */
285 3698 : for (i = 0; i < numInherits; i++)
286 : {
287 : /*
288 : * Skip a hashtable lookup if it's same table as last time. This is
289 : * unlikely for the child, but less so for the parent. (Maybe we
290 : * should ask the backend for a sorted array to make it more likely?
291 : * Not clear the sorting effort would be repaid, though.)
292 : */
293 3441 : if (child == NULL ||
294 2653 : child->dobj.catId.oid != inhinfo[i].inhrelid)
295 : {
296 3330 : child = findTableByOid(inhinfo[i].inhrelid);
297 :
298 : /*
299 : * If we find no TableInfo, assume the pg_inherits entry is for a
300 : * partitioned index, which we don't need to track.
301 : */
302 3330 : if (child == NULL)
303 722 : continue;
304 : }
305 2719 : if (parent == NULL ||
306 2648 : parent->dobj.catId.oid != inhinfo[i].inhparent)
307 : {
308 1582 : parent = findTableByOid(inhinfo[i].inhparent);
309 1582 : if (parent == NULL)
310 0 : pg_fatal("failed sanity check, parent OID %u of table \"%s\" (OID %u) not found",
311 : inhinfo[i].inhparent,
312 : child->dobj.name,
313 : child->dobj.catId.oid);
314 : }
315 : /* Add this parent to the child's list of parents. */
316 2719 : if (child->numParents > 0)
317 115 : child->parents = pg_realloc_array(child->parents,
318 : TableInfo *,
319 : child->numParents + 1);
320 : else
321 2604 : child->parents = pg_malloc_array(TableInfo *, 1);
322 2719 : child->parents[child->numParents++] = parent;
323 : }
324 :
325 : /*
326 : * Now consider all child tables and mark parents interesting as needed.
327 : */
328 65332 : for (i = 0; i < numTables; i++)
329 : {
330 : /*
331 : * If needed, mark the parents as interesting for getTableAttrs and
332 : * getIndexes. We only need this for direct parents of dumpable
333 : * tables.
334 : */
335 65075 : if (tblinfo[i].dobj.dump)
336 : {
337 42140 : int numParents = tblinfo[i].numParents;
338 42140 : TableInfo **parents = tblinfo[i].parents;
339 :
340 44182 : for (j = 0; j < numParents; j++)
341 2042 : parents[j]->interesting = true;
342 : }
343 :
344 : /* Create TableAttachInfo object if needed */
345 65075 : if ((tblinfo[i].dobj.dump & DUMP_COMPONENT_DEFINITION) &&
346 7198 : tblinfo[i].ispartition)
347 : {
348 : TableAttachInfo *attachinfo;
349 :
350 : /* With partitions there can only be one parent */
351 1391 : if (tblinfo[i].numParents != 1)
352 0 : pg_fatal("invalid number of parents %d for table \"%s\"",
353 : tblinfo[i].numParents,
354 : tblinfo[i].dobj.name);
355 :
356 1391 : attachinfo = palloc_object(TableAttachInfo);
357 1391 : attachinfo->dobj.objType = DO_TABLE_ATTACH;
358 1391 : attachinfo->dobj.catId.tableoid = 0;
359 1391 : attachinfo->dobj.catId.oid = 0;
360 1391 : AssignDumpId(&attachinfo->dobj);
361 1391 : attachinfo->dobj.name = pg_strdup(tblinfo[i].dobj.name);
362 1391 : attachinfo->dobj.namespace = tblinfo[i].dobj.namespace;
363 1391 : attachinfo->parentTbl = tblinfo[i].parents[0];
364 1391 : attachinfo->partitionTbl = &tblinfo[i];
365 :
366 : /*
367 : * We must state the DO_TABLE_ATTACH object's dependencies
368 : * explicitly, since it will not match anything in pg_depend.
369 : *
370 : * Give it dependencies on both the partition table and the parent
371 : * table, so that it will not be executed till both of those
372 : * exist. (There's no need to care what order those are created
373 : * in.)
374 : */
375 1391 : addObjectDependency(&attachinfo->dobj, tblinfo[i].dobj.dumpId);
376 1391 : addObjectDependency(&attachinfo->dobj, tblinfo[i].parents[0]->dobj.dumpId);
377 : }
378 : }
379 257 : }
380 :
381 : /*
382 : * flagInhIndexes -
383 : * Create IndexAttachInfo objects for partitioned indexes, and add
384 : * appropriate dependency links.
385 : */
386 : static void
387 257 : flagInhIndexes(Archive *fout, TableInfo tblinfo[], int numTables)
388 : {
389 : int i,
390 : j;
391 :
392 65332 : for (i = 0; i < numTables; i++)
393 : {
394 65075 : if (!tblinfo[i].ispartition || tblinfo[i].numParents == 0)
395 63209 : continue;
396 :
397 : Assert(tblinfo[i].numParents == 1);
398 :
399 2500 : for (j = 0; j < tblinfo[i].numIndexes; j++)
400 : {
401 634 : IndxInfo *index = &(tblinfo[i].indexes[j]);
402 : IndxInfo *parentidx;
403 : IndexAttachInfo *attachinfo;
404 :
405 634 : if (index->parentidx == 0)
406 60 : continue;
407 :
408 574 : parentidx = findIndexByOid(index->parentidx);
409 574 : if (parentidx == NULL)
410 0 : continue;
411 :
412 574 : attachinfo = pg_malloc_object(IndexAttachInfo);
413 :
414 574 : attachinfo->dobj.objType = DO_INDEX_ATTACH;
415 574 : attachinfo->dobj.catId.tableoid = 0;
416 574 : attachinfo->dobj.catId.oid = 0;
417 574 : AssignDumpId(&attachinfo->dobj);
418 574 : attachinfo->dobj.name = pg_strdup(index->dobj.name);
419 574 : attachinfo->dobj.namespace = index->indextable->dobj.namespace;
420 574 : attachinfo->parentIdx = parentidx;
421 574 : attachinfo->partitionIdx = index;
422 :
423 : /*
424 : * We must state the DO_INDEX_ATTACH object's dependencies
425 : * explicitly, since it will not match anything in pg_depend.
426 : *
427 : * Give it dependencies on both the partition index and the parent
428 : * index, so that it will not be executed till both of those
429 : * exist. (There's no need to care what order those are created
430 : * in.)
431 : *
432 : * In addition, give it dependencies on the indexes' underlying
433 : * tables. This does nothing of great value so far as serial
434 : * restore ordering goes, but it ensures that a parallel restore
435 : * will not try to run the ATTACH concurrently with other
436 : * operations on those tables.
437 : */
438 574 : addObjectDependency(&attachinfo->dobj, index->dobj.dumpId);
439 574 : addObjectDependency(&attachinfo->dobj, parentidx->dobj.dumpId);
440 574 : addObjectDependency(&attachinfo->dobj,
441 574 : index->indextable->dobj.dumpId);
442 574 : addObjectDependency(&attachinfo->dobj,
443 574 : parentidx->indextable->dobj.dumpId);
444 :
445 : /* keep track of the list of partitions in the parent index */
446 574 : simple_ptr_list_append(&parentidx->partattaches, &attachinfo->dobj);
447 : }
448 : }
449 257 : }
450 :
451 : /* flagInhAttrs -
452 : * for each dumpable table in tblinfo, flag its inherited attributes
453 : *
454 : * What we need to do here is:
455 : *
456 : * - Detect child columns that inherit NOT NULL bits from their parents, so
457 : * that we needn't specify that again for the child. For versions 18 and
458 : * up, this is needed when the parent is NOT VALID and the child isn't.
459 : *
460 : * - Detect child columns that have DEFAULT NULL when their parents had some
461 : * non-null default. In this case, we make up a dummy AttrDefInfo object so
462 : * that we'll correctly emit the necessary DEFAULT NULL clause; otherwise
463 : * the backend will apply an inherited default to the column.
464 : *
465 : * - Detect child columns that have a generation expression and all their
466 : * parents also have the same generation expression, and if so suppress the
467 : * child's expression. The child will inherit the generation expression
468 : * automatically, so there's no need to dump it. This improves the dump's
469 : * compatibility with pre-v16 servers, which didn't allow the child's
470 : * expression to be given explicitly. Exceptions: If it's a partition or
471 : * we are in binary upgrade mode, we dump such expressions anyway because
472 : * in those cases inherited tables are recreated standalone first and then
473 : * reattached to the parent. (See also the logic in dumpTableSchema().)
474 : *
475 : * modifies tblinfo
476 : */
477 : static void
478 257 : flagInhAttrs(Archive *fout, DumpOptions *dopt, TableInfo *tblinfo, int numTables)
479 : {
480 : int i,
481 : j,
482 : k;
483 :
484 : /*
485 : * We scan the tables in OID order, since that's how tblinfo[] is sorted.
486 : * Hence we will typically visit parents before their children --- but
487 : * that is *not* guaranteed. Thus this loop must be careful that it does
488 : * not alter table properties in a way that could change decisions made at
489 : * child tables during other iterations.
490 : */
491 65332 : for (i = 0; i < numTables; i++)
492 : {
493 65075 : TableInfo *tbinfo = &(tblinfo[i]);
494 : int numParents;
495 : TableInfo **parents;
496 :
497 : /* Some kinds never have parents */
498 65075 : if (tbinfo->relkind == RELKIND_SEQUENCE ||
499 64428 : tbinfo->relkind == RELKIND_VIEW ||
500 25733 : tbinfo->relkind == RELKIND_MATVIEW)
501 39810 : continue;
502 :
503 : /* Don't bother computing anything for non-target tables, either */
504 25265 : if (!tbinfo->dobj.dump)
505 4292 : continue;
506 :
507 20973 : numParents = tbinfo->numParents;
508 20973 : parents = tbinfo->parents;
509 :
510 20973 : if (numParents == 0)
511 19019 : continue; /* nothing to see here, move along */
512 :
513 : /* For each column, search for matching column names in parent(s) */
514 6741 : for (j = 0; j < tbinfo->numatts; j++)
515 : {
516 : bool foundNotNull; /* Attr was NOT NULL in a parent */
517 : bool foundDefault; /* Found a default in a parent */
518 : bool foundSameGenerated; /* Found matching GENERATED */
519 : bool foundDiffGenerated; /* Found non-matching GENERATED */
520 4787 : bool allNotNullsInvalid = true; /* is NOT NULL NOT VALID
521 : * on all parents? */
522 :
523 : /* no point in examining dropped columns */
524 4787 : if (tbinfo->attisdropped[j])
525 305 : continue;
526 :
527 4482 : foundNotNull = false;
528 4482 : foundDefault = false;
529 4482 : foundSameGenerated = false;
530 4482 : foundDiffGenerated = false;
531 9177 : for (k = 0; k < numParents; k++)
532 : {
533 4695 : TableInfo *parent = parents[k];
534 : int inhAttrInd;
535 :
536 4695 : inhAttrInd = strInArray(tbinfo->attnames[j],
537 : parent->attnames,
538 : parent->numatts);
539 4695 : if (inhAttrInd >= 0)
540 : {
541 4455 : AttrDefInfo *parentDef = parent->attrdefs[inhAttrInd];
542 :
543 : /*
544 : * Account for each parent having a not-null constraint.
545 : * In versions 18 and later, we don't need this (and those
546 : * didn't have NO INHERIT.)
547 : */
548 4455 : if (fout->remoteVersion < 180000 &&
549 0 : parent->notnull_constrs[inhAttrInd] != NULL)
550 0 : foundNotNull = true;
551 :
552 : /*
553 : * Keep track of whether all the parents that have a
554 : * not-null constraint on this column have it as NOT
555 : * VALID; if they all are, arrange to have it printed for
556 : * this column. If at least one parent has it as valid,
557 : * there's no need.
558 : */
559 4455 : if (fout->remoteVersion >= 180000 &&
560 4455 : parent->notnull_constrs[inhAttrInd] &&
561 912 : !parent->notnull_invalid[inhAttrInd])
562 912 : allNotNullsInvalid = false;
563 :
564 9400 : foundDefault |= (parentDef != NULL &&
565 4895 : strcmp(parentDef->adef_expr, "NULL") != 0 &&
566 440 : !parent->attgenerated[inhAttrInd]);
567 4455 : if (parent->attgenerated[inhAttrInd])
568 : {
569 : /* these pointer nullness checks are just paranoia */
570 272 : if (parentDef != NULL &&
571 248 : tbinfo->attrdefs[j] != NULL &&
572 248 : strcmp(parentDef->adef_expr,
573 248 : tbinfo->attrdefs[j]->adef_expr) == 0)
574 218 : foundSameGenerated = true;
575 : else
576 54 : foundDiffGenerated = true;
577 : }
578 : }
579 : }
580 :
581 : /*
582 : * In versions < 18, for lack of a better system, we arbitrarily
583 : * decide that a not-null constraint is not locally defined if at
584 : * least one of the parents has it.
585 : */
586 4482 : if (fout->remoteVersion < 180000 && foundNotNull)
587 0 : tbinfo->notnull_islocal[j] = false;
588 :
589 : /*
590 : * For versions >18, we must print the not-null constraint locally
591 : * for this table even if it isn't really locally defined, but is
592 : * valid for the child and no parent has it as valid.
593 : */
594 4482 : if (fout->remoteVersion >= 180000 && allNotNullsInvalid)
595 3575 : tbinfo->notnull_islocal[j] = true;
596 :
597 : /*
598 : * Manufacture a DEFAULT NULL clause if necessary. This breaks
599 : * the advice given above to avoid changing state that might get
600 : * inspected in other loop iterations. We prevent trouble by
601 : * having the foundDefault test above check whether adef_expr is
602 : * "NULL", so that it will reach the same conclusion before or
603 : * after this is done.
604 : */
605 4482 : if (foundDefault && tbinfo->attrdefs[j] == NULL)
606 : {
607 : AttrDefInfo *attrDef;
608 :
609 40 : attrDef = pg_malloc_object(AttrDefInfo);
610 40 : attrDef->dobj.objType = DO_ATTRDEF;
611 40 : attrDef->dobj.catId.tableoid = 0;
612 40 : attrDef->dobj.catId.oid = 0;
613 40 : AssignDumpId(&attrDef->dobj);
614 40 : attrDef->dobj.name = pg_strdup(tbinfo->dobj.name);
615 40 : attrDef->dobj.namespace = tbinfo->dobj.namespace;
616 40 : attrDef->dobj.dump = tbinfo->dobj.dump;
617 :
618 40 : attrDef->adtable = tbinfo;
619 40 : attrDef->adnum = j + 1;
620 40 : attrDef->adef_expr = pg_strdup("NULL");
621 :
622 : /* Will column be dumped explicitly? */
623 40 : if (shouldPrintColumn(dopt, tbinfo, j))
624 : {
625 40 : attrDef->separate = false;
626 : /* No dependency needed: NULL cannot have dependencies */
627 : }
628 : else
629 : {
630 : /* column will be suppressed, print default separately */
631 0 : attrDef->separate = true;
632 : /* ensure it comes out after the table */
633 0 : addObjectDependency(&attrDef->dobj,
634 : tbinfo->dobj.dumpId);
635 : }
636 :
637 40 : tbinfo->attrdefs[j] = attrDef;
638 : }
639 :
640 : /* No need to dump generation expression if it's inheritable */
641 4482 : if (foundSameGenerated && !foundDiffGenerated &&
642 218 : !tbinfo->ispartition && !dopt->binary_upgrade)
643 156 : tbinfo->attrdefs[j]->dobj.dump = DUMP_COMPONENT_NONE;
644 : }
645 : }
646 257 : }
647 :
648 : /*
649 : * AssignDumpId
650 : * Given a newly-created dumpable object, assign a dump ID,
651 : * and enter the object into the lookup tables.
652 : *
653 : * The caller is expected to have filled in objType and catId,
654 : * but not any of the other standard fields of a DumpableObject.
655 : */
656 : void
657 956064 : AssignDumpId(DumpableObject *dobj)
658 : {
659 956064 : dobj->dumpId = ++lastDumpId;
660 956064 : dobj->name = NULL; /* must be set later */
661 956064 : dobj->namespace = NULL; /* may be set later */
662 956064 : dobj->dump = DUMP_COMPONENT_ALL; /* default assumption */
663 956064 : dobj->dump_contains = DUMP_COMPONENT_ALL; /* default assumption */
664 : /* All objects have definitions; we may set more components bits later */
665 956064 : dobj->components = DUMP_COMPONENT_DEFINITION;
666 956064 : dobj->ext_member = false; /* default assumption */
667 956064 : dobj->depends_on_ext = false; /* default assumption */
668 956064 : dobj->dependencies = NULL;
669 956064 : dobj->nDeps = 0;
670 956064 : dobj->allocDeps = 0;
671 :
672 : /* Add object to dumpIdMap[], enlarging that array if need be */
673 957364 : while (dobj->dumpId >= allocedDumpIds)
674 : {
675 : int newAlloc;
676 :
677 1300 : if (allocedDumpIds <= 0)
678 : {
679 258 : newAlloc = 256;
680 258 : dumpIdMap = pg_malloc_array(DumpableObject *, newAlloc);
681 : }
682 : else
683 : {
684 1042 : newAlloc = allocedDumpIds * 2;
685 1042 : dumpIdMap = pg_realloc_array(dumpIdMap, DumpableObject *, newAlloc);
686 : }
687 1300 : memset(dumpIdMap + allocedDumpIds, 0,
688 1300 : (newAlloc - allocedDumpIds) * sizeof(DumpableObject *));
689 1300 : allocedDumpIds = newAlloc;
690 : }
691 956064 : dumpIdMap[dobj->dumpId] = dobj;
692 :
693 : /* If it has a valid CatalogId, enter it into the hash table */
694 956064 : if (OidIsValid(dobj->catId.tableoid))
695 : {
696 : CatalogIdMapEntry *entry;
697 : bool found;
698 :
699 : /* Initialize CatalogId hash table if not done yet */
700 936742 : if (catalogIdHash == NULL)
701 258 : catalogIdHash = catalogid_create(CATALOGIDHASH_INITIAL_SIZE, NULL);
702 :
703 936742 : entry = catalogid_insert(catalogIdHash, dobj->catId, &found);
704 936742 : if (!found)
705 : {
706 935766 : entry->dobj = NULL;
707 935766 : entry->ext = NULL;
708 : }
709 : Assert(entry->dobj == NULL);
710 936742 : entry->dobj = dobj;
711 : }
712 956064 : }
713 :
714 : /*
715 : * recordAdditionalCatalogID
716 : * Record an additional catalog ID for the given DumpableObject
717 : */
718 : void
719 14 : recordAdditionalCatalogID(CatalogId catId, DumpableObject *dobj)
720 : {
721 : CatalogIdMapEntry *entry;
722 : bool found;
723 :
724 : /* CatalogId hash table must exist, if we have a DumpableObject */
725 : Assert(catalogIdHash != NULL);
726 :
727 : /* Add reference to CatalogId hash */
728 14 : entry = catalogid_insert(catalogIdHash, catId, &found);
729 14 : if (!found)
730 : {
731 14 : entry->dobj = NULL;
732 14 : entry->ext = NULL;
733 : }
734 : Assert(entry->dobj == NULL);
735 14 : entry->dobj = dobj;
736 14 : }
737 :
738 : /*
739 : * Assign a DumpId that's not tied to a DumpableObject.
740 : *
741 : * This is used when creating a "fixed" ArchiveEntry that doesn't need to
742 : * participate in the sorting logic.
743 : */
744 : DumpId
745 13703 : createDumpId(void)
746 : {
747 13703 : return ++lastDumpId;
748 : }
749 :
750 : /*
751 : * Return the largest DumpId so far assigned
752 : */
753 : DumpId
754 1544 : getMaxDumpId(void)
755 : {
756 1544 : return lastDumpId;
757 : }
758 :
759 : /*
760 : * Find a DumpableObject by dump ID
761 : *
762 : * Returns NULL for invalid ID
763 : */
764 : DumpableObject *
765 22320190 : findObjectByDumpId(DumpId dumpId)
766 : {
767 22320190 : if (dumpId <= 0 || dumpId >= allocedDumpIds)
768 0 : return NULL; /* out of range? */
769 22320190 : return dumpIdMap[dumpId];
770 : }
771 :
772 : /*
773 : * Find a DumpableObject by catalog ID
774 : *
775 : * Returns NULL for unknown ID
776 : */
777 : DumpableObject *
778 5165710 : findObjectByCatalogId(CatalogId catalogId)
779 : {
780 : CatalogIdMapEntry *entry;
781 :
782 5165710 : if (catalogIdHash == NULL)
783 0 : return NULL; /* no objects exist yet */
784 :
785 5165710 : entry = catalogid_lookup(catalogIdHash, catalogId);
786 5165710 : if (entry == NULL)
787 928389 : return NULL;
788 4237321 : return entry->dobj;
789 : }
790 :
791 : /*
792 : * Build an array of pointers to all known dumpable objects
793 : *
794 : * This simply creates a modifiable copy of the internal map.
795 : */
796 : void
797 264 : getDumpableObjects(DumpableObject ***objs, int *numObjs)
798 : {
799 : int i,
800 : j;
801 :
802 264 : *objs = pg_malloc_array(DumpableObject *, allocedDumpIds);
803 264 : j = 0;
804 1155072 : for (i = 1; i < allocedDumpIds; i++)
805 : {
806 1154808 : if (dumpIdMap[i])
807 982286 : (*objs)[j++] = dumpIdMap[i];
808 : }
809 264 : *numObjs = j;
810 264 : }
811 :
812 : /*
813 : * Add a dependency link to a DumpableObject
814 : *
815 : * Note: duplicate dependencies are currently not eliminated
816 : */
817 : void
818 1482484 : addObjectDependency(DumpableObject *dobj, DumpId refId)
819 : {
820 1482484 : if (dobj->nDeps >= dobj->allocDeps)
821 : {
822 238507 : if (dobj->allocDeps <= 0)
823 : {
824 227899 : dobj->allocDeps = 16;
825 227899 : dobj->dependencies = pg_malloc_array(DumpId, dobj->allocDeps);
826 : }
827 : else
828 : {
829 10608 : dobj->allocDeps *= 2;
830 10608 : dobj->dependencies = pg_realloc_array(dobj->dependencies,
831 : DumpId, dobj->allocDeps);
832 : }
833 : }
834 1482484 : dobj->dependencies[dobj->nDeps++] = refId;
835 1482484 : }
836 :
837 : /*
838 : * Remove a dependency link from a DumpableObject
839 : *
840 : * If there are multiple links, all are removed
841 : */
842 : void
843 42174 : removeObjectDependency(DumpableObject *dobj, DumpId refId)
844 : {
845 : int i;
846 42174 : int j = 0;
847 :
848 753682 : for (i = 0; i < dobj->nDeps; i++)
849 : {
850 711508 : if (dobj->dependencies[i] != refId)
851 667951 : dobj->dependencies[j++] = dobj->dependencies[i];
852 : }
853 42174 : dobj->nDeps = j;
854 42174 : }
855 :
856 :
857 : /*
858 : * findTableByOid
859 : * finds the DumpableObject for the table with the given oid
860 : * returns NULL if not found
861 : */
862 : TableInfo *
863 111579 : findTableByOid(Oid oid)
864 : {
865 : CatalogId catId;
866 : DumpableObject *dobj;
867 :
868 111579 : catId.tableoid = RelationRelationId;
869 111579 : catId.oid = oid;
870 111579 : dobj = findObjectByCatalogId(catId);
871 : Assert(dobj == NULL || dobj->objType == DO_TABLE);
872 111579 : return (TableInfo *) dobj;
873 : }
874 :
875 : /*
876 : * findIndexByOid
877 : * finds the DumpableObject for the index with the given oid
878 : * returns NULL if not found
879 : */
880 : static IndxInfo *
881 574 : findIndexByOid(Oid oid)
882 : {
883 : CatalogId catId;
884 : DumpableObject *dobj;
885 :
886 574 : catId.tableoid = RelationRelationId;
887 574 : catId.oid = oid;
888 574 : dobj = findObjectByCatalogId(catId);
889 : Assert(dobj == NULL || dobj->objType == DO_INDEX);
890 574 : return (IndxInfo *) dobj;
891 : }
892 :
893 : /*
894 : * findTypeByOid
895 : * finds the DumpableObject for the type with the given oid
896 : * returns NULL if not found
897 : */
898 : TypeInfo *
899 1970276 : findTypeByOid(Oid oid)
900 : {
901 : CatalogId catId;
902 : DumpableObject *dobj;
903 :
904 1970276 : catId.tableoid = TypeRelationId;
905 1970276 : catId.oid = oid;
906 1970276 : dobj = findObjectByCatalogId(catId);
907 : Assert(dobj == NULL ||
908 : dobj->objType == DO_TYPE || dobj->objType == DO_DUMMY_TYPE);
909 1970276 : return (TypeInfo *) dobj;
910 : }
911 :
912 : /*
913 : * findFuncByOid
914 : * finds the DumpableObject for the function with the given oid
915 : * returns NULL if not found
916 : */
917 : FuncInfo *
918 253 : findFuncByOid(Oid oid)
919 : {
920 : CatalogId catId;
921 : DumpableObject *dobj;
922 :
923 253 : catId.tableoid = ProcedureRelationId;
924 253 : catId.oid = oid;
925 253 : dobj = findObjectByCatalogId(catId);
926 : Assert(dobj == NULL || dobj->objType == DO_FUNC);
927 253 : return (FuncInfo *) dobj;
928 : }
929 :
930 : /*
931 : * findOprByOid
932 : * finds the DumpableObject for the operator with the given oid
933 : * returns NULL if not found
934 : */
935 : OprInfo *
936 2860 : findOprByOid(Oid oid)
937 : {
938 : CatalogId catId;
939 : DumpableObject *dobj;
940 :
941 2860 : catId.tableoid = OperatorRelationId;
942 2860 : catId.oid = oid;
943 2860 : dobj = findObjectByCatalogId(catId);
944 : Assert(dobj == NULL || dobj->objType == DO_OPERATOR);
945 2860 : return (OprInfo *) dobj;
946 : }
947 :
948 : /*
949 : * findAccessMethodByOid
950 : * finds the DumpableObject for the access method with the given oid
951 : * returns NULL if not found
952 : */
953 : AccessMethodInfo *
954 70706 : findAccessMethodByOid(Oid oid)
955 : {
956 : CatalogId catId;
957 : DumpableObject *dobj;
958 :
959 70706 : catId.tableoid = AccessMethodRelationId;
960 70706 : catId.oid = oid;
961 70706 : dobj = findObjectByCatalogId(catId);
962 : Assert(dobj == NULL || dobj->objType == DO_ACCESS_METHOD);
963 70706 : return (AccessMethodInfo *) dobj;
964 : }
965 :
966 : /*
967 : * findCollationByOid
968 : * finds the DumpableObject for the collation with the given oid
969 : * returns NULL if not found
970 : */
971 : CollInfo *
972 269 : findCollationByOid(Oid oid)
973 : {
974 : CatalogId catId;
975 : DumpableObject *dobj;
976 :
977 269 : catId.tableoid = CollationRelationId;
978 269 : catId.oid = oid;
979 269 : dobj = findObjectByCatalogId(catId);
980 : Assert(dobj == NULL || dobj->objType == DO_COLLATION);
981 269 : return (CollInfo *) dobj;
982 : }
983 :
984 : /*
985 : * findNamespaceByOid
986 : * finds the DumpableObject for the namespace with the given oid
987 : * returns NULL if not found
988 : */
989 : NamespaceInfo *
990 822004 : findNamespaceByOid(Oid oid)
991 : {
992 : CatalogId catId;
993 : DumpableObject *dobj;
994 :
995 822004 : catId.tableoid = NamespaceRelationId;
996 822004 : catId.oid = oid;
997 822004 : dobj = findObjectByCatalogId(catId);
998 : Assert(dobj == NULL || dobj->objType == DO_NAMESPACE);
999 822004 : return (NamespaceInfo *) dobj;
1000 : }
1001 :
1002 : /*
1003 : * findExtensionByOid
1004 : * finds the DumpableObject for the extension with the given oid
1005 : * returns NULL if not found
1006 : */
1007 : ExtensionInfo *
1008 288 : findExtensionByOid(Oid oid)
1009 : {
1010 : CatalogId catId;
1011 : DumpableObject *dobj;
1012 :
1013 288 : catId.tableoid = ExtensionRelationId;
1014 288 : catId.oid = oid;
1015 288 : dobj = findObjectByCatalogId(catId);
1016 : Assert(dobj == NULL || dobj->objType == DO_EXTENSION);
1017 288 : return (ExtensionInfo *) dobj;
1018 : }
1019 :
1020 : /*
1021 : * findPublicationByOid
1022 : * finds the DumpableObject for the publication with the given oid
1023 : * returns NULL if not found
1024 : */
1025 : PublicationInfo *
1026 475 : findPublicationByOid(Oid oid)
1027 : {
1028 : CatalogId catId;
1029 : DumpableObject *dobj;
1030 :
1031 475 : catId.tableoid = PublicationRelationId;
1032 475 : catId.oid = oid;
1033 475 : dobj = findObjectByCatalogId(catId);
1034 : Assert(dobj == NULL || dobj->objType == DO_PUBLICATION);
1035 475 : return (PublicationInfo *) dobj;
1036 : }
1037 :
1038 : /*
1039 : * findSubscriptionByOid
1040 : * finds the DumpableObject for the subscription with the given oid
1041 : * returns NULL if not found
1042 : */
1043 : SubscriptionInfo *
1044 2 : findSubscriptionByOid(Oid oid)
1045 : {
1046 : CatalogId catId;
1047 : DumpableObject *dobj;
1048 :
1049 2 : catId.tableoid = SubscriptionRelationId;
1050 2 : catId.oid = oid;
1051 2 : dobj = findObjectByCatalogId(catId);
1052 : Assert(dobj == NULL || dobj->objType == DO_SUBSCRIPTION);
1053 2 : return (SubscriptionInfo *) dobj;
1054 : }
1055 :
1056 :
1057 : /*
1058 : * recordExtensionMembership
1059 : * Record that the object identified by the given catalog ID
1060 : * belongs to the given extension
1061 : */
1062 : void
1063 1637 : recordExtensionMembership(CatalogId catId, ExtensionInfo *ext)
1064 : {
1065 : CatalogIdMapEntry *entry;
1066 : bool found;
1067 :
1068 : /* CatalogId hash table must exist, if we have an ExtensionInfo */
1069 : Assert(catalogIdHash != NULL);
1070 :
1071 : /* Add reference to CatalogId hash */
1072 1637 : entry = catalogid_insert(catalogIdHash, catId, &found);
1073 1637 : if (!found)
1074 : {
1075 1637 : entry->dobj = NULL;
1076 1637 : entry->ext = NULL;
1077 : }
1078 : Assert(entry->ext == NULL);
1079 1637 : entry->ext = ext;
1080 1637 : }
1081 :
1082 : /*
1083 : * findOwningExtension
1084 : * return owning extension for specified catalog ID, or NULL if none
1085 : */
1086 : ExtensionInfo *
1087 824684 : findOwningExtension(CatalogId catalogId)
1088 : {
1089 : CatalogIdMapEntry *entry;
1090 :
1091 824684 : if (catalogIdHash == NULL)
1092 0 : return NULL; /* no objects exist yet */
1093 :
1094 824684 : entry = catalogid_lookup(catalogIdHash, catalogId);
1095 824684 : if (entry == NULL)
1096 0 : return NULL;
1097 824684 : return entry->ext;
1098 : }
1099 :
1100 :
1101 : /*
1102 : * parseOidArray
1103 : * parse a string of numbers delimited by spaces into a character array
1104 : *
1105 : * Note: actually this is used for both Oids and potentially-signed
1106 : * attribute numbers. This should cause no trouble, but we could split
1107 : * the function into two functions with different argument types if it does.
1108 : */
1109 :
1110 : void
1111 7436 : parseOidArray(const char *str, Oid *array, int arraysize)
1112 : {
1113 : int j,
1114 : argNum;
1115 : char temp[100];
1116 : char s;
1117 :
1118 7436 : argNum = 0;
1119 7436 : j = 0;
1120 : for (;;)
1121 : {
1122 36039 : s = *str++;
1123 36039 : if (s == ' ' || s == '\0')
1124 : {
1125 12168 : if (j > 0)
1126 : {
1127 12168 : if (argNum >= arraysize)
1128 0 : pg_fatal("could not parse numeric array \"%s\": too many numbers", str);
1129 12168 : temp[j] = '\0';
1130 12168 : array[argNum++] = atooid(temp);
1131 12168 : j = 0;
1132 : }
1133 12168 : if (s == '\0')
1134 7436 : break;
1135 : }
1136 : else
1137 : {
1138 23871 : if (!(isdigit((unsigned char) s) || s == '-') ||
1139 23871 : j >= sizeof(temp) - 1)
1140 0 : pg_fatal("could not parse numeric array \"%s\": invalid character in number", str);
1141 23871 : temp[j++] = s;
1142 : }
1143 : }
1144 :
1145 7436 : while (argNum < arraysize)
1146 0 : array[argNum++] = InvalidOid;
1147 7436 : }
1148 :
1149 :
1150 : /*
1151 : * strInArray:
1152 : * takes in a string and a string array and the number of elements in the
1153 : * string array.
1154 : * returns the index if the string is somewhere in the array, -1 otherwise
1155 : */
1156 :
1157 : static int
1158 4695 : strInArray(const char *pattern, char **arr, int arr_size)
1159 : {
1160 : int i;
1161 :
1162 9172 : for (i = 0; i < arr_size; i++)
1163 : {
1164 8932 : if (strcmp(pattern, arr[i]) == 0)
1165 4455 : return i;
1166 : }
1167 240 : return -1;
1168 : }
|
