PostgreSQL Source Code  git master
pg_publication.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * pg_publication.c
4  * publication C API manipulation
5  *
6  * Portions Copyright (c) 1996-2024, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  * IDENTIFICATION
10  * src/backend/catalog/pg_publication.c
11  *
12  *-------------------------------------------------------------------------
13  */
14 
15 #include "postgres.h"
16 
17 #include "access/genam.h"
18 #include "access/heapam.h"
19 #include "access/htup_details.h"
20 #include "access/tableam.h"
21 #include "catalog/catalog.h"
22 #include "catalog/dependency.h"
23 #include "catalog/indexing.h"
24 #include "catalog/namespace.h"
25 #include "catalog/objectaddress.h"
26 #include "catalog/partition.h"
27 #include "catalog/pg_inherits.h"
28 #include "catalog/pg_namespace.h"
29 #include "catalog/pg_publication.h"
32 #include "catalog/pg_type.h"
34 #include "funcapi.h"
35 #include "utils/array.h"
36 #include "utils/builtins.h"
37 #include "utils/catcache.h"
38 #include "utils/fmgroids.h"
39 #include "utils/lsyscache.h"
40 #include "utils/rel.h"
41 #include "utils/syscache.h"
42 
43 /* Records association between publication and published table */
44 typedef struct
45 {
46  Oid relid; /* OID of published table */
47  Oid pubid; /* OID of publication that publishes this
48  * table. */
50 
51 /*
52  * Check if relation can be in given publication and throws appropriate
53  * error if not.
54  */
55 static void
57 {
58  /* Must be a regular or partitioned table */
59  if (RelationGetForm(targetrel)->relkind != RELKIND_RELATION &&
60  RelationGetForm(targetrel)->relkind != RELKIND_PARTITIONED_TABLE)
61  ereport(ERROR,
62  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
63  errmsg("cannot add relation \"%s\" to publication",
64  RelationGetRelationName(targetrel)),
65  errdetail_relkind_not_supported(RelationGetForm(targetrel)->relkind)));
66 
67  /* Can't be system table */
68  if (IsCatalogRelation(targetrel))
69  ereport(ERROR,
70  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
71  errmsg("cannot add relation \"%s\" to publication",
72  RelationGetRelationName(targetrel)),
73  errdetail("This operation is not supported for system tables.")));
74 
75  /* UNLOGGED and TEMP relations cannot be part of publication. */
76  if (targetrel->rd_rel->relpersistence == RELPERSISTENCE_TEMP)
77  ereport(ERROR,
78  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
79  errmsg("cannot add relation \"%s\" to publication",
80  RelationGetRelationName(targetrel)),
81  errdetail("This operation is not supported for temporary tables.")));
82  else if (targetrel->rd_rel->relpersistence == RELPERSISTENCE_UNLOGGED)
83  ereport(ERROR,
84  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
85  errmsg("cannot add relation \"%s\" to publication",
86  RelationGetRelationName(targetrel)),
87  errdetail("This operation is not supported for unlogged tables.")));
88 }
89 
90 /*
91  * Check if schema can be in given publication and throw appropriate error if
92  * not.
93  */
94 static void
96 {
97  /* Can't be system namespace */
98  if (IsCatalogNamespace(schemaid) || IsToastNamespace(schemaid))
99  ereport(ERROR,
100  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
101  errmsg("cannot add schema \"%s\" to publication",
102  get_namespace_name(schemaid)),
103  errdetail("This operation is not supported for system schemas.")));
104 
105  /* Can't be temporary namespace */
106  if (isAnyTempNamespace(schemaid))
107  ereport(ERROR,
108  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
109  errmsg("cannot add schema \"%s\" to publication",
110  get_namespace_name(schemaid)),
111  errdetail("Temporary schemas cannot be replicated.")));
112 }
113 
114 /*
115  * Returns if relation represented by oid and Form_pg_class entry
116  * is publishable.
117  *
118  * Does same checks as check_publication_add_relation() above, but does not
119  * need relation to be opened and also does not throw errors.
120  *
121  * XXX This also excludes all tables with relid < FirstNormalObjectId,
122  * ie all tables created during initdb. This mainly affects the preinstalled
123  * information_schema. IsCatalogRelationOid() only excludes tables with
124  * relid < FirstUnpinnedObjectId, making that test rather redundant,
125  * but really we should get rid of the FirstNormalObjectId test not
126  * IsCatalogRelationOid. We can't do so today because we don't want
127  * information_schema tables to be considered publishable; but this test
128  * is really inadequate for that, since the information_schema could be
129  * dropped and reloaded and then it'll be considered publishable. The best
130  * long-term solution may be to add a "relispublishable" bool to pg_class,
131  * and depend on that instead of OID checks.
132  */
133 static bool
135 {
136  return (reltuple->relkind == RELKIND_RELATION ||
137  reltuple->relkind == RELKIND_PARTITIONED_TABLE) &&
138  !IsCatalogRelationOid(relid) &&
139  reltuple->relpersistence == RELPERSISTENCE_PERMANENT &&
140  relid >= FirstNormalObjectId;
141 }
142 
143 /*
144  * Another variant of is_publishable_class(), taking a Relation.
145  */
146 bool
148 {
149  return is_publishable_class(RelationGetRelid(rel), rel->rd_rel);
150 }
151 
152 /*
153  * SQL-callable variant of the above
154  *
155  * This returns null when the relation does not exist. This is intended to be
156  * used for example in psql to avoid gratuitous errors when there are
157  * concurrent catalog changes.
158  */
159 Datum
161 {
162  Oid relid = PG_GETARG_OID(0);
163  HeapTuple tuple;
164  bool result;
165 
166  tuple = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
167  if (!HeapTupleIsValid(tuple))
168  PG_RETURN_NULL();
169  result = is_publishable_class(relid, (Form_pg_class) GETSTRUCT(tuple));
170  ReleaseSysCache(tuple);
171  PG_RETURN_BOOL(result);
172 }
173 
174 /*
175  * Returns true if the ancestor is in the list of published relations.
176  * Otherwise, returns false.
177  */
178 static bool
179 is_ancestor_member_tableinfos(Oid ancestor, List *table_infos)
180 {
181  ListCell *lc;
182 
183  foreach(lc, table_infos)
184  {
185  Oid relid = ((published_rel *) lfirst(lc))->relid;
186 
187  if (relid == ancestor)
188  return true;
189  }
190 
191  return false;
192 }
193 
194 /*
195  * Filter out the partitions whose parent tables are also present in the list.
196  */
197 static void
198 filter_partitions(List *table_infos)
199 {
200  ListCell *lc;
201 
202  foreach(lc, table_infos)
203  {
204  bool skip = false;
205  List *ancestors = NIL;
206  ListCell *lc2;
207  published_rel *table_info = (published_rel *) lfirst(lc);
208 
209  if (get_rel_relispartition(table_info->relid))
210  ancestors = get_partition_ancestors(table_info->relid);
211 
212  foreach(lc2, ancestors)
213  {
214  Oid ancestor = lfirst_oid(lc2);
215 
216  if (is_ancestor_member_tableinfos(ancestor, table_infos))
217  {
218  skip = true;
219  break;
220  }
221  }
222 
223  if (skip)
224  table_infos = foreach_delete_current(table_infos, lc);
225  }
226 }
227 
228 /*
229  * Returns true if any schema is associated with the publication, false if no
230  * schema is associated with the publication.
231  */
232 bool
234 {
235  Relation pubschsrel;
236  ScanKeyData scankey;
237  SysScanDesc scan;
238  HeapTuple tup;
239  bool result = false;
240 
241  pubschsrel = table_open(PublicationNamespaceRelationId, AccessShareLock);
242  ScanKeyInit(&scankey,
243  Anum_pg_publication_namespace_pnpubid,
244  BTEqualStrategyNumber, F_OIDEQ,
245  ObjectIdGetDatum(pubid));
246 
247  scan = systable_beginscan(pubschsrel,
248  PublicationNamespacePnnspidPnpubidIndexId,
249  true, NULL, 1, &scankey);
250  tup = systable_getnext(scan);
251  result = HeapTupleIsValid(tup);
252 
253  systable_endscan(scan);
254  table_close(pubschsrel, AccessShareLock);
255 
256  return result;
257 }
258 
259 /*
260  * Gets the relations based on the publication partition option for a specified
261  * relation.
262  */
263 List *
265  Oid relid)
266 {
267  if (get_rel_relkind(relid) == RELKIND_PARTITIONED_TABLE &&
268  pub_partopt != PUBLICATION_PART_ROOT)
269  {
270  List *all_parts = find_all_inheritors(relid, NoLock,
271  NULL);
272 
273  if (pub_partopt == PUBLICATION_PART_ALL)
274  result = list_concat(result, all_parts);
275  else if (pub_partopt == PUBLICATION_PART_LEAF)
276  {
277  ListCell *lc;
278 
279  foreach(lc, all_parts)
280  {
281  Oid partOid = lfirst_oid(lc);
282 
283  if (get_rel_relkind(partOid) != RELKIND_PARTITIONED_TABLE)
284  result = lappend_oid(result, partOid);
285  }
286  }
287  else
288  Assert(false);
289  }
290  else
291  result = lappend_oid(result, relid);
292 
293  return result;
294 }
295 
296 /*
297  * Returns the relid of the topmost ancestor that is published via this
298  * publication if any and set its ancestor level to ancestor_level,
299  * otherwise returns InvalidOid.
300  *
301  * The ancestor_level value allows us to compare the results for multiple
302  * publications, and decide which value is higher up.
303  *
304  * Note that the list of ancestors should be ordered such that the topmost
305  * ancestor is at the end of the list.
306  */
307 Oid
308 GetTopMostAncestorInPublication(Oid puboid, List *ancestors, int *ancestor_level)
309 {
310  ListCell *lc;
311  Oid topmost_relid = InvalidOid;
312  int level = 0;
313 
314  /*
315  * Find the "topmost" ancestor that is in this publication.
316  */
317  foreach(lc, ancestors)
318  {
319  Oid ancestor = lfirst_oid(lc);
320  List *apubids = GetRelationPublications(ancestor);
321  List *aschemaPubids = NIL;
322 
323  level++;
324 
325  if (list_member_oid(apubids, puboid))
326  {
327  topmost_relid = ancestor;
328 
329  if (ancestor_level)
330  *ancestor_level = level;
331  }
332  else
333  {
334  aschemaPubids = GetSchemaPublications(get_rel_namespace(ancestor));
335  if (list_member_oid(aschemaPubids, puboid))
336  {
337  topmost_relid = ancestor;
338 
339  if (ancestor_level)
340  *ancestor_level = level;
341  }
342  }
343 
344  list_free(apubids);
345  list_free(aschemaPubids);
346  }
347 
348  return topmost_relid;
349 }
350 
351 /*
352  * attnumstoint2vector
353  * Convert a Bitmapset of AttrNumbers into an int2vector.
354  *
355  * AttrNumber numbers are 0-based, i.e., not offset by
356  * FirstLowInvalidHeapAttributeNumber.
357  */
358 static int2vector *
360 {
361  int2vector *result;
362  int n = bms_num_members(attrs);
363  int i = -1;
364  int j = 0;
365 
366  result = buildint2vector(NULL, n);
367 
368  while ((i = bms_next_member(attrs, i)) >= 0)
369  {
370  Assert(i <= PG_INT16_MAX);
371 
372  result->values[j++] = (int16) i;
373  }
374 
375  return result;
376 }
377 
378 /*
379  * Insert new publication / relation mapping.
380  */
383  bool if_not_exists)
384 {
385  Relation rel;
386  HeapTuple tup;
387  Datum values[Natts_pg_publication_rel];
388  bool nulls[Natts_pg_publication_rel];
389  Relation targetrel = pri->relation;
390  Oid relid = RelationGetRelid(targetrel);
391  Oid pubreloid;
392  Bitmapset *attnums;
393  Publication *pub = GetPublication(pubid);
394  ObjectAddress myself,
395  referenced;
396  List *relids = NIL;
397  int i;
398 
399  rel = table_open(PublicationRelRelationId, RowExclusiveLock);
400 
401  /*
402  * Check for duplicates. Note that this does not really prevent
403  * duplicates, it's here just to provide nicer error message in common
404  * case. The real protection is the unique key on the catalog.
405  */
406  if (SearchSysCacheExists2(PUBLICATIONRELMAP, ObjectIdGetDatum(relid),
407  ObjectIdGetDatum(pubid)))
408  {
410 
411  if (if_not_exists)
412  return InvalidObjectAddress;
413 
414  ereport(ERROR,
416  errmsg("relation \"%s\" is already member of publication \"%s\"",
417  RelationGetRelationName(targetrel), pub->name)));
418  }
419 
421 
422  /* Validate and translate column names into a Bitmapset of attnums. */
423  attnums = pub_collist_validate(pri->relation, pri->columns);
424 
425  /* Form a tuple. */
426  memset(values, 0, sizeof(values));
427  memset(nulls, false, sizeof(nulls));
428 
429  pubreloid = GetNewOidWithIndex(rel, PublicationRelObjectIndexId,
430  Anum_pg_publication_rel_oid);
431  values[Anum_pg_publication_rel_oid - 1] = ObjectIdGetDatum(pubreloid);
432  values[Anum_pg_publication_rel_prpubid - 1] =
433  ObjectIdGetDatum(pubid);
434  values[Anum_pg_publication_rel_prrelid - 1] =
435  ObjectIdGetDatum(relid);
436 
437  /* Add qualifications, if available */
438  if (pri->whereClause != NULL)
439  values[Anum_pg_publication_rel_prqual - 1] = CStringGetTextDatum(nodeToString(pri->whereClause));
440  else
441  nulls[Anum_pg_publication_rel_prqual - 1] = true;
442 
443  /* Add column list, if available */
444  if (pri->columns)
445  values[Anum_pg_publication_rel_prattrs - 1] = PointerGetDatum(attnumstoint2vector(attnums));
446  else
447  nulls[Anum_pg_publication_rel_prattrs - 1] = true;
448 
449  tup = heap_form_tuple(RelationGetDescr(rel), values, nulls);
450 
451  /* Insert tuple into catalog. */
452  CatalogTupleInsert(rel, tup);
453  heap_freetuple(tup);
454 
455  /* Register dependencies as needed */
456  ObjectAddressSet(myself, PublicationRelRelationId, pubreloid);
457 
458  /* Add dependency on the publication */
459  ObjectAddressSet(referenced, PublicationRelationId, pubid);
460  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
461 
462  /* Add dependency on the relation */
463  ObjectAddressSet(referenced, RelationRelationId, relid);
464  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
465 
466  /* Add dependency on the objects mentioned in the qualifications */
467  if (pri->whereClause)
468  recordDependencyOnSingleRelExpr(&myself, pri->whereClause, relid,
470  false);
471 
472  /* Add dependency on the columns, if any are listed */
473  i = -1;
474  while ((i = bms_next_member(attnums, i)) >= 0)
475  {
476  ObjectAddressSubSet(referenced, RelationRelationId, relid, i);
477  recordDependencyOn(&myself, &referenced, DEPENDENCY_NORMAL);
478  }
479 
480  /* Close the table. */
482 
483  /*
484  * Invalidate relcache so that publication info is rebuilt.
485  *
486  * For the partitioned tables, we must invalidate all partitions contained
487  * in the respective partition hierarchies, not just the one explicitly
488  * mentioned in the publication. This is required because we implicitly
489  * publish the child tables when the parent table is published.
490  */
492  relid);
493 
495 
496  return myself;
497 }
498 
499 /*
500  * pub_collist_validate
501  * Process and validate the 'columns' list and ensure the columns are all
502  * valid to use for a publication. Checks for and raises an ERROR for
503  * any; unknown columns, system columns, duplicate columns or generated
504  * columns.
505  *
506  * Looks up each column's attnum and returns a 0-based Bitmapset of the
507  * corresponding attnums.
508  */
509 Bitmapset *
510 pub_collist_validate(Relation targetrel, List *columns)
511 {
512  Bitmapset *set = NULL;
513  ListCell *lc;
514  TupleDesc tupdesc = RelationGetDescr(targetrel);
515 
516  foreach(lc, columns)
517  {
518  char *colname = strVal(lfirst(lc));
519  AttrNumber attnum = get_attnum(RelationGetRelid(targetrel), colname);
520 
521  if (attnum == InvalidAttrNumber)
522  ereport(ERROR,
523  errcode(ERRCODE_UNDEFINED_COLUMN),
524  errmsg("column \"%s\" of relation \"%s\" does not exist",
525  colname, RelationGetRelationName(targetrel)));
526 
528  ereport(ERROR,
529  errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
530  errmsg("cannot use system column \"%s\" in publication column list",
531  colname));
532 
533  if (TupleDescAttr(tupdesc, attnum - 1)->attgenerated)
534  ereport(ERROR,
535  errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
536  errmsg("cannot use generated column \"%s\" in publication column list",
537  colname));
538 
539  if (bms_is_member(attnum, set))
540  ereport(ERROR,
542  errmsg("duplicate column \"%s\" in publication column list",
543  colname));
544 
545  set = bms_add_member(set, attnum);
546  }
547 
548  return set;
549 }
550 
551 /*
552  * Transform a column list (represented by an array Datum) to a bitmapset.
553  *
554  * If columns isn't NULL, add the column numbers to that set.
555  *
556  * If mcxt isn't NULL, build the bitmapset in that context.
557  */
558 Bitmapset *
560 {
561  Bitmapset *result = columns;
562  ArrayType *arr;
563  int nelems;
564  int16 *elems;
565  MemoryContext oldcxt = NULL;
566 
567  arr = DatumGetArrayTypeP(pubcols);
568  nelems = ARR_DIMS(arr)[0];
569  elems = (int16 *) ARR_DATA_PTR(arr);
570 
571  /* If a memory context was specified, switch to it. */
572  if (mcxt)
573  oldcxt = MemoryContextSwitchTo(mcxt);
574 
575  for (int i = 0; i < nelems; i++)
576  result = bms_add_member(result, elems[i]);
577 
578  if (mcxt)
579  MemoryContextSwitchTo(oldcxt);
580 
581  return result;
582 }
583 
584 /*
585  * Insert new publication / schema mapping.
586  */
588 publication_add_schema(Oid pubid, Oid schemaid, bool if_not_exists)
589 {
590  Relation rel;
591  HeapTuple tup;
592  Datum values[Natts_pg_publication_namespace];
593  bool nulls[Natts_pg_publication_namespace];
594  Oid psschid;
595  Publication *pub = GetPublication(pubid);
596  List *schemaRels = NIL;
597  ObjectAddress myself,
598  referenced;
599 
600  rel = table_open(PublicationNamespaceRelationId, RowExclusiveLock);
601 
602  /*
603  * Check for duplicates. Note that this does not really prevent
604  * duplicates, it's here just to provide nicer error message in common
605  * case. The real protection is the unique key on the catalog.
606  */
607  if (SearchSysCacheExists2(PUBLICATIONNAMESPACEMAP,
608  ObjectIdGetDatum(schemaid),
609  ObjectIdGetDatum(pubid)))
610  {
612 
613  if (if_not_exists)
614  return InvalidObjectAddress;
615 
616  ereport(ERROR,
618  errmsg("schema \"%s\" is already member of publication \"%s\"",
619  get_namespace_name(schemaid), pub->name)));
620  }
621 
623 
624  /* Form a tuple */
625  memset(values, 0, sizeof(values));
626  memset(nulls, false, sizeof(nulls));
627 
628  psschid = GetNewOidWithIndex(rel, PublicationNamespaceObjectIndexId,
629  Anum_pg_publication_namespace_oid);
630  values[Anum_pg_publication_namespace_oid - 1] = ObjectIdGetDatum(psschid);
631  values[Anum_pg_publication_namespace_pnpubid - 1] =
632  ObjectIdGetDatum(pubid);
633  values[Anum_pg_publication_namespace_pnnspid - 1] =
634  ObjectIdGetDatum(schemaid);
635 
636  tup = heap_form_tuple(RelationGetDescr(rel), values, nulls);
637 
638  /* Insert tuple into catalog */
639  CatalogTupleInsert(rel, tup);
640  heap_freetuple(tup);
641 
642  ObjectAddressSet(myself, PublicationNamespaceRelationId, psschid);
643 
644  /* Add dependency on the publication */
645  ObjectAddressSet(referenced, PublicationRelationId, pubid);
646  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
647 
648  /* Add dependency on the schema */
649  ObjectAddressSet(referenced, NamespaceRelationId, schemaid);
650  recordDependencyOn(&myself, &referenced, DEPENDENCY_AUTO);
651 
652  /* Close the table */
654 
655  /*
656  * Invalidate relcache so that publication info is rebuilt. See
657  * publication_add_relation for why we need to consider all the
658  * partitions.
659  */
660  schemaRels = GetSchemaPublicationRelations(schemaid,
662  InvalidatePublicationRels(schemaRels);
663 
664  return myself;
665 }
666 
667 /* Gets list of publication oids for a relation */
668 List *
670 {
671  List *result = NIL;
672  CatCList *pubrellist;
673  int i;
674 
675  /* Find all publications associated with the relation. */
676  pubrellist = SearchSysCacheList1(PUBLICATIONRELMAP,
677  ObjectIdGetDatum(relid));
678  for (i = 0; i < pubrellist->n_members; i++)
679  {
680  HeapTuple tup = &pubrellist->members[i]->tuple;
681  Oid pubid = ((Form_pg_publication_rel) GETSTRUCT(tup))->prpubid;
682 
683  result = lappend_oid(result, pubid);
684  }
685 
686  ReleaseSysCacheList(pubrellist);
687 
688  return result;
689 }
690 
691 /*
692  * Gets list of relation oids for a publication.
693  *
694  * This should only be used FOR TABLE publications, the FOR ALL TABLES
695  * should use GetAllTablesPublicationRelations().
696  */
697 List *
699 {
700  List *result;
701  Relation pubrelsrel;
702  ScanKeyData scankey;
703  SysScanDesc scan;
704  HeapTuple tup;
705 
706  /* Find all publications associated with the relation. */
707  pubrelsrel = table_open(PublicationRelRelationId, AccessShareLock);
708 
709  ScanKeyInit(&scankey,
710  Anum_pg_publication_rel_prpubid,
711  BTEqualStrategyNumber, F_OIDEQ,
712  ObjectIdGetDatum(pubid));
713 
714  scan = systable_beginscan(pubrelsrel, PublicationRelPrpubidIndexId,
715  true, NULL, 1, &scankey);
716 
717  result = NIL;
718  while (HeapTupleIsValid(tup = systable_getnext(scan)))
719  {
721 
722  pubrel = (Form_pg_publication_rel) GETSTRUCT(tup);
723  result = GetPubPartitionOptionRelations(result, pub_partopt,
724  pubrel->prrelid);
725  }
726 
727  systable_endscan(scan);
728  table_close(pubrelsrel, AccessShareLock);
729 
730  /* Now sort and de-duplicate the result list */
731  list_sort(result, list_oid_cmp);
732  list_deduplicate_oid(result);
733 
734  return result;
735 }
736 
737 /*
738  * Gets list of publication oids for publications marked as FOR ALL TABLES.
739  */
740 List *
742 {
743  List *result;
744  Relation rel;
745  ScanKeyData scankey;
746  SysScanDesc scan;
747  HeapTuple tup;
748 
749  /* Find all publications that are marked as for all tables. */
750  rel = table_open(PublicationRelationId, AccessShareLock);
751 
752  ScanKeyInit(&scankey,
753  Anum_pg_publication_puballtables,
754  BTEqualStrategyNumber, F_BOOLEQ,
755  BoolGetDatum(true));
756 
757  scan = systable_beginscan(rel, InvalidOid, false,
758  NULL, 1, &scankey);
759 
760  result = NIL;
761  while (HeapTupleIsValid(tup = systable_getnext(scan)))
762  {
763  Oid oid = ((Form_pg_publication) GETSTRUCT(tup))->oid;
764 
765  result = lappend_oid(result, oid);
766  }
767 
768  systable_endscan(scan);
770 
771  return result;
772 }
773 
774 /*
775  * Gets list of all relation published by FOR ALL TABLES publication(s).
776  *
777  * If the publication publishes partition changes via their respective root
778  * partitioned tables, we must exclude partitions in favor of including the
779  * root partitioned tables.
780  */
781 List *
783 {
784  Relation classRel;
785  ScanKeyData key[1];
786  TableScanDesc scan;
787  HeapTuple tuple;
788  List *result = NIL;
789 
790  classRel = table_open(RelationRelationId, AccessShareLock);
791 
792  ScanKeyInit(&key[0],
793  Anum_pg_class_relkind,
794  BTEqualStrategyNumber, F_CHAREQ,
795  CharGetDatum(RELKIND_RELATION));
796 
797  scan = table_beginscan_catalog(classRel, 1, key);
798 
799  while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
800  {
801  Form_pg_class relForm = (Form_pg_class) GETSTRUCT(tuple);
802  Oid relid = relForm->oid;
803 
804  if (is_publishable_class(relid, relForm) &&
805  !(relForm->relispartition && pubviaroot))
806  result = lappend_oid(result, relid);
807  }
808 
809  table_endscan(scan);
810 
811  if (pubviaroot)
812  {
813  ScanKeyInit(&key[0],
814  Anum_pg_class_relkind,
815  BTEqualStrategyNumber, F_CHAREQ,
816  CharGetDatum(RELKIND_PARTITIONED_TABLE));
817 
818  scan = table_beginscan_catalog(classRel, 1, key);
819 
820  while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
821  {
822  Form_pg_class relForm = (Form_pg_class) GETSTRUCT(tuple);
823  Oid relid = relForm->oid;
824 
825  if (is_publishable_class(relid, relForm) &&
826  !relForm->relispartition)
827  result = lappend_oid(result, relid);
828  }
829 
830  table_endscan(scan);
831  }
832 
833  table_close(classRel, AccessShareLock);
834  return result;
835 }
836 
837 /*
838  * Gets the list of schema oids for a publication.
839  *
840  * This should only be used FOR TABLES IN SCHEMA publications.
841  */
842 List *
844 {
845  List *result = NIL;
846  Relation pubschsrel;
847  ScanKeyData scankey;
848  SysScanDesc scan;
849  HeapTuple tup;
850 
851  /* Find all schemas associated with the publication */
852  pubschsrel = table_open(PublicationNamespaceRelationId, AccessShareLock);
853 
854  ScanKeyInit(&scankey,
855  Anum_pg_publication_namespace_pnpubid,
856  BTEqualStrategyNumber, F_OIDEQ,
857  ObjectIdGetDatum(pubid));
858 
859  scan = systable_beginscan(pubschsrel,
860  PublicationNamespacePnnspidPnpubidIndexId,
861  true, NULL, 1, &scankey);
862  while (HeapTupleIsValid(tup = systable_getnext(scan)))
863  {
865 
867 
868  result = lappend_oid(result, pubsch->pnnspid);
869  }
870 
871  systable_endscan(scan);
872  table_close(pubschsrel, AccessShareLock);
873 
874  return result;
875 }
876 
877 /*
878  * Gets the list of publication oids associated with a specified schema.
879  */
880 List *
882 {
883  List *result = NIL;
884  CatCList *pubschlist;
885  int i;
886 
887  /* Find all publications associated with the schema */
888  pubschlist = SearchSysCacheList1(PUBLICATIONNAMESPACEMAP,
889  ObjectIdGetDatum(schemaid));
890  for (i = 0; i < pubschlist->n_members; i++)
891  {
892  HeapTuple tup = &pubschlist->members[i]->tuple;
893  Oid pubid = ((Form_pg_publication_namespace) GETSTRUCT(tup))->pnpubid;
894 
895  result = lappend_oid(result, pubid);
896  }
897 
898  ReleaseSysCacheList(pubschlist);
899 
900  return result;
901 }
902 
903 /*
904  * Get the list of publishable relation oids for a specified schema.
905  */
906 List *
908 {
909  Relation classRel;
910  ScanKeyData key[1];
911  TableScanDesc scan;
912  HeapTuple tuple;
913  List *result = NIL;
914 
915  Assert(OidIsValid(schemaid));
916 
917  classRel = table_open(RelationRelationId, AccessShareLock);
918 
919  ScanKeyInit(&key[0],
920  Anum_pg_class_relnamespace,
921  BTEqualStrategyNumber, F_OIDEQ,
922  schemaid);
923 
924  /* get all the relations present in the specified schema */
925  scan = table_beginscan_catalog(classRel, 1, key);
926  while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
927  {
928  Form_pg_class relForm = (Form_pg_class) GETSTRUCT(tuple);
929  Oid relid = relForm->oid;
930  char relkind;
931 
932  if (!is_publishable_class(relid, relForm))
933  continue;
934 
935  relkind = get_rel_relkind(relid);
936  if (relkind == RELKIND_RELATION)
937  result = lappend_oid(result, relid);
938  else if (relkind == RELKIND_PARTITIONED_TABLE)
939  {
940  List *partitionrels = NIL;
941 
942  /*
943  * It is quite possible that some of the partitions are in a
944  * different schema than the parent table, so we need to get such
945  * partitions separately.
946  */
947  partitionrels = GetPubPartitionOptionRelations(partitionrels,
948  pub_partopt,
949  relForm->oid);
950  result = list_concat_unique_oid(result, partitionrels);
951  }
952  }
953 
954  table_endscan(scan);
955  table_close(classRel, AccessShareLock);
956  return result;
957 }
958 
959 /*
960  * Gets the list of all relations published by FOR TABLES IN SCHEMA
961  * publication.
962  */
963 List *
965 {
966  List *result = NIL;
967  List *pubschemalist = GetPublicationSchemas(pubid);
968  ListCell *cell;
969 
970  foreach(cell, pubschemalist)
971  {
972  Oid schemaid = lfirst_oid(cell);
973  List *schemaRels = NIL;
974 
975  schemaRels = GetSchemaPublicationRelations(schemaid, pub_partopt);
976  result = list_concat(result, schemaRels);
977  }
978 
979  return result;
980 }
981 
982 /*
983  * Get publication using oid
984  *
985  * The Publication struct and its data are palloc'ed here.
986  */
987 Publication *
989 {
990  HeapTuple tup;
991  Publication *pub;
992  Form_pg_publication pubform;
993 
994  tup = SearchSysCache1(PUBLICATIONOID, ObjectIdGetDatum(pubid));
995  if (!HeapTupleIsValid(tup))
996  elog(ERROR, "cache lookup failed for publication %u", pubid);
997 
998  pubform = (Form_pg_publication) GETSTRUCT(tup);
999 
1000  pub = (Publication *) palloc(sizeof(Publication));
1001  pub->oid = pubid;
1002  pub->name = pstrdup(NameStr(pubform->pubname));
1003  pub->alltables = pubform->puballtables;
1004  pub->pubactions.pubinsert = pubform->pubinsert;
1005  pub->pubactions.pubupdate = pubform->pubupdate;
1006  pub->pubactions.pubdelete = pubform->pubdelete;
1007  pub->pubactions.pubtruncate = pubform->pubtruncate;
1008  pub->pubviaroot = pubform->pubviaroot;
1009 
1010  ReleaseSysCache(tup);
1011 
1012  return pub;
1013 }
1014 
1015 /*
1016  * Get Publication using name.
1017  */
1018 Publication *
1019 GetPublicationByName(const char *pubname, bool missing_ok)
1020 {
1021  Oid oid;
1022 
1023  oid = get_publication_oid(pubname, missing_ok);
1024 
1025  return OidIsValid(oid) ? GetPublication(oid) : NULL;
1026 }
1027 
1028 /*
1029  * Get information of the tables in the given publication array.
1030  *
1031  * Returns pubid, relid, column list, row filter for each table.
1032  */
1033 Datum
1035 {
1036 #define NUM_PUBLICATION_TABLES_ELEM 4
1037  FuncCallContext *funcctx;
1038  List *table_infos = NIL;
1039 
1040  /* stuff done only on the first call of the function */
1041  if (SRF_IS_FIRSTCALL())
1042  {
1043  TupleDesc tupdesc;
1044  MemoryContext oldcontext;
1045  ArrayType *arr;
1046  Datum *elems;
1047  int nelems,
1048  i;
1049  bool viaroot = false;
1050 
1051  /* create a function context for cross-call persistence */
1052  funcctx = SRF_FIRSTCALL_INIT();
1053 
1054  /* switch to memory context appropriate for multiple function calls */
1055  oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
1056 
1057  /*
1058  * Deconstruct the parameter into elements where each element is a
1059  * publication name.
1060  */
1061  arr = PG_GETARG_ARRAYTYPE_P(0);
1062  deconstruct_array_builtin(arr, TEXTOID, &elems, NULL, &nelems);
1063 
1064  /* Get Oids of tables from each publication. */
1065  for (i = 0; i < nelems; i++)
1066  {
1067  Publication *pub_elem;
1068  List *pub_elem_tables = NIL;
1069  ListCell *lc;
1070 
1071  pub_elem = GetPublicationByName(TextDatumGetCString(elems[i]), false);
1072 
1073  /*
1074  * Publications support partitioned tables. If
1075  * publish_via_partition_root is false, all changes are replicated
1076  * using leaf partition identity and schema, so we only need
1077  * those. Otherwise, get the partitioned table itself.
1078  */
1079  if (pub_elem->alltables)
1080  pub_elem_tables = GetAllTablesPublicationRelations(pub_elem->pubviaroot);
1081  else
1082  {
1083  List *relids,
1084  *schemarelids;
1085 
1086  relids = GetPublicationRelations(pub_elem->oid,
1087  pub_elem->pubviaroot ?
1090  schemarelids = GetAllSchemaPublicationRelations(pub_elem->oid,
1091  pub_elem->pubviaroot ?
1094  pub_elem_tables = list_concat_unique_oid(relids, schemarelids);
1095  }
1096 
1097  /*
1098  * Record the published table and the corresponding publication so
1099  * that we can get row filters and column lists later.
1100  *
1101  * When a table is published by multiple publications, to obtain
1102  * all row filters and column lists, the structure related to this
1103  * table will be recorded multiple times.
1104  */
1105  foreach(lc, pub_elem_tables)
1106  {
1107  published_rel *table_info = (published_rel *) palloc(sizeof(published_rel));
1108 
1109  table_info->relid = lfirst_oid(lc);
1110  table_info->pubid = pub_elem->oid;
1111  table_infos = lappend(table_infos, table_info);
1112  }
1113 
1114  /* At least one publication is using publish_via_partition_root. */
1115  if (pub_elem->pubviaroot)
1116  viaroot = true;
1117  }
1118 
1119  /*
1120  * If the publication publishes partition changes via their respective
1121  * root partitioned tables, we must exclude partitions in favor of
1122  * including the root partitioned tables. Otherwise, the function
1123  * could return both the child and parent tables which could cause
1124  * data of the child table to be double-published on the subscriber
1125  * side.
1126  */
1127  if (viaroot)
1128  filter_partitions(table_infos);
1129 
1130  /* Construct a tuple descriptor for the result rows. */
1132  TupleDescInitEntry(tupdesc, (AttrNumber) 1, "pubid",
1133  OIDOID, -1, 0);
1134  TupleDescInitEntry(tupdesc, (AttrNumber) 2, "relid",
1135  OIDOID, -1, 0);
1136  TupleDescInitEntry(tupdesc, (AttrNumber) 3, "attrs",
1137  INT2VECTOROID, -1, 0);
1138  TupleDescInitEntry(tupdesc, (AttrNumber) 4, "qual",
1139  PG_NODE_TREEOID, -1, 0);
1140 
1141  funcctx->tuple_desc = BlessTupleDesc(tupdesc);
1142  funcctx->user_fctx = (void *) table_infos;
1143 
1144  MemoryContextSwitchTo(oldcontext);
1145  }
1146 
1147  /* stuff done on every call of the function */
1148  funcctx = SRF_PERCALL_SETUP();
1149  table_infos = (List *) funcctx->user_fctx;
1150 
1151  if (funcctx->call_cntr < list_length(table_infos))
1152  {
1153  HeapTuple pubtuple = NULL;
1154  HeapTuple rettuple;
1155  Publication *pub;
1156  published_rel *table_info = (published_rel *) list_nth(table_infos, funcctx->call_cntr);
1157  Oid relid = table_info->relid;
1158  Oid schemaid = get_rel_namespace(relid);
1160  bool nulls[NUM_PUBLICATION_TABLES_ELEM] = {0};
1161 
1162  /*
1163  * Form tuple with appropriate data.
1164  */
1165 
1166  pub = GetPublication(table_info->pubid);
1167 
1168  values[0] = ObjectIdGetDatum(pub->oid);
1169  values[1] = ObjectIdGetDatum(relid);
1170 
1171  /*
1172  * We don't consider row filters or column lists for FOR ALL TABLES or
1173  * FOR TABLES IN SCHEMA publications.
1174  */
1175  if (!pub->alltables &&
1176  !SearchSysCacheExists2(PUBLICATIONNAMESPACEMAP,
1177  ObjectIdGetDatum(schemaid),
1178  ObjectIdGetDatum(pub->oid)))
1179  pubtuple = SearchSysCacheCopy2(PUBLICATIONRELMAP,
1180  ObjectIdGetDatum(relid),
1181  ObjectIdGetDatum(pub->oid));
1182 
1183  if (HeapTupleIsValid(pubtuple))
1184  {
1185  /* Lookup the column list attribute. */
1186  values[2] = SysCacheGetAttr(PUBLICATIONRELMAP, pubtuple,
1187  Anum_pg_publication_rel_prattrs,
1188  &(nulls[2]));
1189 
1190  /* Null indicates no filter. */
1191  values[3] = SysCacheGetAttr(PUBLICATIONRELMAP, pubtuple,
1192  Anum_pg_publication_rel_prqual,
1193  &(nulls[3]));
1194  }
1195  else
1196  {
1197  nulls[2] = true;
1198  nulls[3] = true;
1199  }
1200 
1201  /* Show all columns when the column list is not specified. */
1202  if (nulls[2])
1203  {
1204  Relation rel = table_open(relid, AccessShareLock);
1205  int nattnums = 0;
1206  int16 *attnums;
1207  TupleDesc desc = RelationGetDescr(rel);
1208  int i;
1209 
1210  attnums = (int16 *) palloc(desc->natts * sizeof(int16));
1211 
1212  for (i = 0; i < desc->natts; i++)
1213  {
1214  Form_pg_attribute att = TupleDescAttr(desc, i);
1215 
1216  if (att->attisdropped || att->attgenerated)
1217  continue;
1218 
1219  attnums[nattnums++] = att->attnum;
1220  }
1221 
1222  if (nattnums > 0)
1223  {
1224  values[2] = PointerGetDatum(buildint2vector(attnums, nattnums));
1225  nulls[2] = false;
1226  }
1227 
1229  }
1230 
1231  rettuple = heap_form_tuple(funcctx->tuple_desc, values, nulls);
1232 
1233  SRF_RETURN_NEXT(funcctx, HeapTupleGetDatum(rettuple));
1234  }
1235 
1236  SRF_RETURN_DONE(funcctx);
1237 }
#define PG_GETARG_ARRAYTYPE_P(n)
Definition: array.h:263
#define ARR_DATA_PTR(a)
Definition: array.h:322
#define DatumGetArrayTypeP(X)
Definition: array.h:261
#define ARR_DIMS(a)
Definition: array.h:294
void deconstruct_array_builtin(ArrayType *array, Oid elmtype, Datum **elemsp, bool **nullsp, int *nelemsp)
Definition: arrayfuncs.c:3697
int16 AttrNumber
Definition: attnum.h:21
#define AttrNumberIsForUserDefinedAttr(attributeNumber)
Definition: attnum.h:41
#define InvalidAttrNumber
Definition: attnum.h:23
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1306
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:751
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:510
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:815
static Datum values[MAXATTR]
Definition: bootstrap.c:150
#define CStringGetTextDatum(s)
Definition: builtins.h:97
#define TextDatumGetCString(d)
Definition: builtins.h:98
#define NameStr(name)
Definition: c.h:737
signed short int16
Definition: c.h:495
#define Assert(condition)
Definition: c.h:849
#define PG_INT16_MAX
Definition: c.h:577
#define OidIsValid(objectId)
Definition: c.h:766
bool IsToastNamespace(Oid namespaceId)
Definition: catalog.c:230
Oid GetNewOidWithIndex(Relation relation, Oid indexId, AttrNumber oidcolumn)
Definition: catalog.c:419
bool IsCatalogNamespace(Oid namespaceId)
Definition: catalog.c:212
bool IsCatalogRelation(Relation relation)
Definition: catalog.c:103
bool IsCatalogRelationOid(Oid relid)
Definition: catalog.c:120
void recordDependencyOnSingleRelExpr(const ObjectAddress *depender, Node *expr, Oid relId, DependencyType behavior, DependencyType self_behavior, bool reverse_self)
Definition: dependency.c:1596
@ DEPENDENCY_AUTO
Definition: dependency.h:34
@ DEPENDENCY_NORMAL
Definition: dependency.h:33
int errdetail(const char *fmt,...)
Definition: elog.c:1203
int errcode(int sqlerrcode)
Definition: elog.c:853
int errmsg(const char *fmt,...)
Definition: elog.c:1070
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:225
#define ereport(elevel,...)
Definition: elog.h:149
TupleDesc BlessTupleDesc(TupleDesc tupdesc)
Definition: execTuples.c:2158
#define PG_GETARG_OID(n)
Definition: fmgr.h:275
#define PG_RETURN_NULL()
Definition: fmgr.h:345
#define PG_FUNCTION_ARGS
Definition: fmgr.h:193
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
#define SRF_IS_FIRSTCALL()
Definition: funcapi.h:304
#define SRF_PERCALL_SETUP()
Definition: funcapi.h:308
#define SRF_RETURN_NEXT(_funcctx, _result)
Definition: funcapi.h:310
#define SRF_FIRSTCALL_INIT()
Definition: funcapi.h:306
static Datum HeapTupleGetDatum(const HeapTupleData *tuple)
Definition: funcapi.h:230
#define SRF_RETURN_DONE(_funcctx)
Definition: funcapi.h:328
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:604
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:511
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:387
HeapTuple heap_getnext(TableScanDesc sscan, ScanDirection direction)
Definition: heapam.c:1243
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
Definition: heaptuple.c:1116
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1434
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
void CatalogTupleInsert(Relation heapRel, HeapTuple tup)
Definition: indexing.c:233
int2vector * buildint2vector(const int16 *int2s, int n)
Definition: int.c:114
int j
Definition: isn.c:74
int i
Definition: isn.c:73
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:77
void list_sort(List *list, list_sort_comparator cmp)
Definition: list.c:1674
List * list_concat_unique_oid(List *list1, const List *list2)
Definition: list.c:1469
List * lappend(List *list, void *datum)
Definition: list.c:339
List * lappend_oid(List *list, Oid datum)
Definition: list.c:375
void list_deduplicate_oid(List *list)
Definition: list.c:1495
int list_oid_cmp(const ListCell *p1, const ListCell *p2)
Definition: list.c:1703
void list_free(List *list)
Definition: list.c:1546
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:722
List * list_concat(List *list1, const List *list2)
Definition: list.c:561
#define NoLock
Definition: lockdefs.h:34
#define AccessShareLock
Definition: lockdefs.h:36
#define RowExclusiveLock
Definition: lockdefs.h:38
bool get_rel_relispartition(Oid relid)
Definition: lsyscache.c:2027
AttrNumber get_attnum(Oid relid, const char *attname)
Definition: lsyscache.c:858
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3366
char get_rel_relkind(Oid relid)
Definition: lsyscache.c:2003
Oid get_publication_oid(const char *pubname, bool missing_ok)
Definition: lsyscache.c:3625
Oid get_rel_namespace(Oid relid)
Definition: lsyscache.c:1952
char * pstrdup(const char *in)
Definition: mcxt.c:1696
void * palloc(Size size)
Definition: mcxt.c:1317
bool isAnyTempNamespace(Oid namespaceId)
Definition: namespace.c:3687
const ObjectAddress InvalidObjectAddress
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
#define ObjectAddressSubSet(addr, class_id, object_id, object_sub_id)
Definition: objectaddress.h:33
char * nodeToString(const void *obj)
Definition: outfuncs.c:794
List * get_partition_ancestors(Oid relid)
Definition: partition.c:134
int16 attnum
Definition: pg_attribute.h:74
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:209
static const struct exclude_list_item skip[]
Definition: pg_checksums.c:108
int errdetail_relkind_not_supported(char relkind)
Definition: pg_class.c:24
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
void recordDependencyOn(const ObjectAddress *depender, const ObjectAddress *referenced, DependencyType behavior)
Definition: pg_depend.c:46
List * find_all_inheritors(Oid parentrelId, LOCKMODE lockmode, List **numparents)
Definition: pg_inherits.c:255
#define lfirst(lc)
Definition: pg_list.h:172
static int list_length(const List *l)
Definition: pg_list.h:152
#define NIL
Definition: pg_list.h:68
#define foreach_delete_current(lst, var_or_cell)
Definition: pg_list.h:391
static void * list_nth(const List *list, int n)
Definition: pg_list.h:299
#define lfirst_oid(lc)
Definition: pg_list.h:174
static int2vector * attnumstoint2vector(Bitmapset *attrs)
bool is_schema_publication(Oid pubid)
List * GetPublicationSchemas(Oid pubid)
Publication * GetPublicationByName(const char *pubname, bool missing_ok)
List * GetSchemaPublications(Oid schemaid)
Publication * GetPublication(Oid pubid)
List * GetRelationPublications(Oid relid)
ObjectAddress publication_add_schema(Oid pubid, Oid schemaid, bool if_not_exists)
ObjectAddress publication_add_relation(Oid pubid, PublicationRelInfo *pri, bool if_not_exists)
List * GetPublicationRelations(Oid pubid, PublicationPartOpt pub_partopt)
Bitmapset * pub_collist_validate(Relation targetrel, List *columns)
Datum pg_get_publication_tables(PG_FUNCTION_ARGS)
List * GetAllTablesPublications(void)
static void check_publication_add_relation(Relation targetrel)
static void filter_partitions(List *table_infos)
List * GetAllTablesPublicationRelations(bool pubviaroot)
Oid GetTopMostAncestorInPublication(Oid puboid, List *ancestors, int *ancestor_level)
List * GetPubPartitionOptionRelations(List *result, PublicationPartOpt pub_partopt, Oid relid)
static bool is_publishable_class(Oid relid, Form_pg_class reltuple)
#define NUM_PUBLICATION_TABLES_ELEM
static bool is_ancestor_member_tableinfos(Oid ancestor, List *table_infos)
static void check_publication_add_schema(Oid schemaid)
List * GetSchemaPublicationRelations(Oid schemaid, PublicationPartOpt pub_partopt)
Bitmapset * pub_collist_to_bitmapset(Bitmapset *columns, Datum pubcols, MemoryContext mcxt)
Datum pg_relation_is_publishable(PG_FUNCTION_ARGS)
bool is_publishable_relation(Relation rel)
List * GetAllSchemaPublicationRelations(Oid pubid, PublicationPartOpt pub_partopt)
FormData_pg_publication * Form_pg_publication
PublicationPartOpt
@ PUBLICATION_PART_LEAF
@ PUBLICATION_PART_ROOT
@ PUBLICATION_PART_ALL
FormData_pg_publication_namespace * Form_pg_publication_namespace
FormData_pg_publication_rel * Form_pg_publication_rel
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
uintptr_t Datum
Definition: postgres.h:64
static Datum BoolGetDatum(bool X)
Definition: postgres.h:102
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
static Datum CharGetDatum(char X)
Definition: postgres.h:122
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
void InvalidatePublicationRels(List *relids)
MemoryContextSwitchTo(old_ctx)
#define RelationGetForm(relation)
Definition: rel.h:499
#define RelationGetRelid(relation)
Definition: rel.h:505
#define RelationGetDescr(relation)
Definition: rel.h:531
#define RelationGetRelationName(relation)
Definition: rel.h:539
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
@ ForwardScanDirection
Definition: sdir.h:28
#define BTEqualStrategyNumber
Definition: stratnum.h:31
#define ERRCODE_DUPLICATE_OBJECT
Definition: streamutil.c:32
void * user_fctx
Definition: funcapi.h:82
uint64 call_cntr
Definition: funcapi.h:65
MemoryContext multi_call_memory_ctx
Definition: funcapi.h:101
TupleDesc tuple_desc
Definition: funcapi.h:112
Definition: pg_list.h:54
PublicationActions pubactions
Form_pg_class rd_rel
Definition: rel.h:111
CatCTup * members[FLEXIBLE_ARRAY_MEMBER]
Definition: catcache.h:180
int n_members
Definition: catcache.h:178
HeapTupleData tuple
Definition: catcache.h:123
Definition: c.h:706
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:713
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:269
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:221
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:596
#define SearchSysCacheCopy2(cacheId, key1, key2)
Definition: syscache.h:93
#define ReleaseSysCacheList(x)
Definition: syscache.h:134
#define SearchSysCacheExists2(cacheId, key1, key2)
Definition: syscache.h:102
#define SearchSysCacheList1(cacheId, key1)
Definition: syscache.h:127
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40
TableScanDesc table_beginscan_catalog(Relation relation, int nkeys, struct ScanKeyData *key)
Definition: tableam.c:112
static void table_endscan(TableScanDesc scan)
Definition: tableam.h:1019
#define FirstNormalObjectId
Definition: transam.h:197
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:67
void TupleDescInitEntry(TupleDesc desc, AttrNumber attributeNumber, const char *attributeName, Oid oidtypeid, int32 typmod, int attdim)
Definition: tupdesc.c:651
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
#define strVal(v)
Definition: value.h:82