PostgreSQL Source Code  git master
relation.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  * relation.c
3  * PostgreSQL logical replication relation mapping cache
4  *
5  * Copyright (c) 2016-2020, PostgreSQL Global Development Group
6  *
7  * IDENTIFICATION
8  * src/backend/replication/logical/relation.c
9  *
10  * NOTES
11  * Routines in this file mainly have to do with mapping the properties
12  * of local replication target relations to the properties of their
13  * remote counterpart.
14  *
15  *-------------------------------------------------------------------------
16  */
17 
18 #include "postgres.h"
19 
20 #include "access/sysattr.h"
21 #include "access/table.h"
22 #include "catalog/namespace.h"
24 #include "executor/executor.h"
25 #include "nodes/makefuncs.h"
28 #include "utils/builtins.h"
29 #include "utils/inval.h"
30 #include "utils/lsyscache.h"
31 #include "utils/memutils.h"
32 #include "utils/syscache.h"
33 
35 
36 static HTAB *LogicalRepRelMap = NULL;
37 static HTAB *LogicalRepTypMap = NULL;
38 
39 /*
40  * Partition map (LogicalRepPartMap)
41  *
42  * When a partitioned table is used as replication target, replicated
43  * operations are actually performed on its leaf partitions, which requires
44  * the partitions to also be mapped to the remote relation. Parent's entry
45  * (LogicalRepRelMapEntry) cannot be used as-is for all partitions, because
46  * individual partitions may have different attribute numbers, which means
47  * attribute mappings to remote relation's attributes must be maintained
48  * separately for each partition.
49  */
51 static HTAB *LogicalRepPartMap = NULL;
52 typedef struct LogicalRepPartMapEntry
53 {
54  Oid partoid; /* LogicalRepPartMap's key */
57 
58 /*
59  * Relcache invalidation callback for our relation map cache.
60  */
61 static void
63 {
64  LogicalRepRelMapEntry *entry;
65 
66  /* Just to be sure. */
67  if (LogicalRepRelMap == NULL)
68  return;
69 
70  if (reloid != InvalidOid)
71  {
73 
74  hash_seq_init(&status, LogicalRepRelMap);
75 
76  /* TODO, use inverse lookup hashtable? */
77  while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
78  {
79  if (entry->localreloid == reloid)
80  {
81  entry->localrelvalid = false;
82  hash_seq_term(&status);
83  break;
84  }
85  }
86  }
87  else
88  {
89  /* invalidate all cache entries */
91 
92  hash_seq_init(&status, LogicalRepRelMap);
93 
94  while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
95  entry->localrelvalid = false;
96  }
97 }
98 
99 /*
100  * Initialize the relation map cache.
101  */
102 static void
104 {
105  HASHCTL ctl;
106 
107  if (!LogicalRepRelMapContext)
108  LogicalRepRelMapContext =
110  "LogicalRepRelMapContext",
112 
113  /* Initialize the relation hash table. */
114  MemSet(&ctl, 0, sizeof(ctl));
115  ctl.keysize = sizeof(LogicalRepRelId);
116  ctl.entrysize = sizeof(LogicalRepRelMapEntry);
118 
119  LogicalRepRelMap = hash_create("logicalrep relation map cache", 128, &ctl,
121 
122  /* Initialize the type hash table. */
123  MemSet(&ctl, 0, sizeof(ctl));
124  ctl.keysize = sizeof(Oid);
125  ctl.entrysize = sizeof(LogicalRepTyp);
127 
128  /* This will usually be small. */
129  LogicalRepTypMap = hash_create("logicalrep type map cache", 2, &ctl,
131 
132  /* Watch for invalidation events. */
134  (Datum) 0);
135 }
136 
137 /*
138  * Free the entry of a relation map cache.
139  */
140 static void
142 {
143  LogicalRepRelation *remoterel;
144 
145  remoterel = &entry->remoterel;
146 
147  pfree(remoterel->nspname);
148  pfree(remoterel->relname);
149 
150  if (remoterel->natts > 0)
151  {
152  int i;
153 
154  for (i = 0; i < remoterel->natts; i++)
155  pfree(remoterel->attnames[i]);
156 
157  pfree(remoterel->attnames);
158  pfree(remoterel->atttyps);
159  }
160  bms_free(remoterel->attkeys);
161 
162  if (entry->attrmap)
163  pfree(entry->attrmap);
164 }
165 
166 /*
167  * Add new entry or update existing entry in the relation map cache.
168  *
169  * Called when new relation mapping is sent by the publisher to update
170  * our expected view of incoming data from said publisher.
171  */
172 void
174 {
175  MemoryContext oldctx;
176  LogicalRepRelMapEntry *entry;
177  bool found;
178  int i;
179 
180  if (LogicalRepRelMap == NULL)
182 
183  /*
184  * HASH_ENTER returns the existing entry if present or creates a new one.
185  */
186  entry = hash_search(LogicalRepRelMap, (void *) &remoterel->remoteid,
187  HASH_ENTER, &found);
188 
189  if (found)
191 
192  memset(entry, 0, sizeof(LogicalRepRelMapEntry));
193 
194  /* Make cached copy of the data */
195  oldctx = MemoryContextSwitchTo(LogicalRepRelMapContext);
196  entry->remoterel.remoteid = remoterel->remoteid;
197  entry->remoterel.nspname = pstrdup(remoterel->nspname);
198  entry->remoterel.relname = pstrdup(remoterel->relname);
199  entry->remoterel.natts = remoterel->natts;
200  entry->remoterel.attnames = palloc(remoterel->natts * sizeof(char *));
201  entry->remoterel.atttyps = palloc(remoterel->natts * sizeof(Oid));
202  for (i = 0; i < remoterel->natts; i++)
203  {
204  entry->remoterel.attnames[i] = pstrdup(remoterel->attnames[i]);
205  entry->remoterel.atttyps[i] = remoterel->atttyps[i];
206  }
207  entry->remoterel.replident = remoterel->replident;
208  entry->remoterel.attkeys = bms_copy(remoterel->attkeys);
209  MemoryContextSwitchTo(oldctx);
210 }
211 
212 /*
213  * Find attribute index in TupleDesc struct by attribute name.
214  *
215  * Returns -1 if not found.
216  */
217 static int
219 {
220  int i;
221 
222  for (i = 0; i < remoterel->natts; i++)
223  {
224  if (strcmp(remoterel->attnames[i], attname) == 0)
225  return i;
226  }
227 
228  return -1;
229 }
230 
231 /*
232  * Report error with names of the missing local relation column(s), if any.
233  */
234 static void
236  Bitmapset *missingatts)
237 {
238  if (!bms_is_empty(missingatts))
239  {
240  StringInfoData missingattsbuf;
241  int missingattcnt = 0;
242  int i;
243 
244  initStringInfo(&missingattsbuf);
245 
246  while ((i = bms_first_member(missingatts)) >= 0)
247  {
248  missingattcnt++;
249  if (missingattcnt == 1)
250  appendStringInfo(&missingattsbuf, _("\"%s\""),
251  remoterel->attnames[i]);
252  else
253  appendStringInfo(&missingattsbuf, _(", \"%s\""),
254  remoterel->attnames[i]);
255  }
256 
257  ereport(ERROR,
258  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
259  errmsg_plural("logical replication target relation \"%s.%s\" is missing replicated column: %s",
260  "logical replication target relation \"%s.%s\" is missing replicated columns: %s",
261  missingattcnt,
262  remoterel->nspname,
263  remoterel->relname,
264  missingattsbuf.data)));
265  }
266 }
267 
268 /*
269  * Open the local relation associated with the remote one.
270  *
271  * Rebuilds the Relcache mapping if it was invalidated by local DDL.
272  */
275 {
276  LogicalRepRelMapEntry *entry;
277  bool found;
278  LogicalRepRelation *remoterel;
279 
280  if (LogicalRepRelMap == NULL)
282 
283  /* Search for existing entry. */
284  entry = hash_search(LogicalRepRelMap, (void *) &remoteid,
285  HASH_FIND, &found);
286 
287  if (!found)
288  elog(ERROR, "no relation map entry for remote relation ID %u",
289  remoteid);
290 
291  remoterel = &entry->remoterel;
292 
293  /* Ensure we don't leak a relcache refcount. */
294  if (entry->localrel)
295  elog(ERROR, "remote relation ID %u is already open", remoteid);
296 
297  /*
298  * When opening and locking a relation, pending invalidation messages are
299  * processed which can invalidate the relation. Hence, if the entry is
300  * currently considered valid, try to open the local relation by OID and
301  * see if invalidation ensues.
302  */
303  if (entry->localrelvalid)
304  {
305  entry->localrel = try_table_open(entry->localreloid, lockmode);
306  if (!entry->localrel)
307  {
308  /* Table was renamed or dropped. */
309  entry->localrelvalid = false;
310  }
311  else if (!entry->localrelvalid)
312  {
313  /* Note we release the no-longer-useful lock here. */
314  table_close(entry->localrel, lockmode);
315  entry->localrel = NULL;
316  }
317  }
318 
319  /*
320  * If the entry has been marked invalid since we last had lock on it,
321  * re-open the local relation by name and rebuild all derived data.
322  */
323  if (!entry->localrelvalid)
324  {
325  Oid relid;
326  Bitmapset *idkey;
327  TupleDesc desc;
328  MemoryContext oldctx;
329  int i;
330  Bitmapset *missingatts;
331 
332  /* Try to find and lock the relation by name. */
333  relid = RangeVarGetRelid(makeRangeVar(remoterel->nspname,
334  remoterel->relname, -1),
335  lockmode, true);
336  if (!OidIsValid(relid))
337  ereport(ERROR,
338  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
339  errmsg("logical replication target relation \"%s.%s\" does not exist",
340  remoterel->nspname, remoterel->relname)));
341  entry->localrel = table_open(relid, NoLock);
342  entry->localreloid = relid;
343 
344  /* Check for supported relkind. */
345  CheckSubscriptionRelkind(entry->localrel->rd_rel->relkind,
346  remoterel->nspname, remoterel->relname);
347 
348  /*
349  * Build the mapping of local attribute numbers to remote attribute
350  * numbers and validate that we don't miss any replicated columns as
351  * that would result in potentially unwanted data loss.
352  */
353  desc = RelationGetDescr(entry->localrel);
354  oldctx = MemoryContextSwitchTo(LogicalRepRelMapContext);
355  entry->attrmap = make_attrmap(desc->natts);
356  MemoryContextSwitchTo(oldctx);
357 
358  /* check and report missing attrs, if any */
359  missingatts = bms_add_range(NULL, 0, remoterel->natts - 1);
360  for (i = 0; i < desc->natts; i++)
361  {
362  int attnum;
363  Form_pg_attribute attr = TupleDescAttr(desc, i);
364 
365  if (attr->attisdropped || attr->attgenerated)
366  {
367  entry->attrmap->attnums[i] = -1;
368  continue;
369  }
370 
371  attnum = logicalrep_rel_att_by_name(remoterel,
372  NameStr(attr->attname));
373 
374  entry->attrmap->attnums[i] = attnum;
375  if (attnum >= 0)
376  missingatts = bms_del_member(missingatts, attnum);
377  }
378 
379  logicalrep_report_missing_attrs(remoterel, missingatts);
380 
381  /* be tidy */
382  bms_free(missingatts);
383 
384  /*
385  * Check that replica identity matches. We allow for stricter replica
386  * identity (fewer columns) on subscriber as that will not stop us
387  * from finding unique tuple. IE, if publisher has identity
388  * (id,timestamp) and subscriber just (id) this will not be a problem,
389  * but in the opposite scenario it will.
390  *
391  * Don't throw any error here just mark the relation entry as not
392  * updatable, as replica identity is only for updates and deletes but
393  * inserts can be replicated even without it.
394  */
395  entry->updatable = true;
396  idkey = RelationGetIndexAttrBitmap(entry->localrel,
398  /* fallback to PK if no replica identity */
399  if (idkey == NULL)
400  {
401  idkey = RelationGetIndexAttrBitmap(entry->localrel,
403 
404  /*
405  * If no replica identity index and no PK, the published table
406  * must have replica identity FULL.
407  */
408  if (idkey == NULL && remoterel->replident != REPLICA_IDENTITY_FULL)
409  entry->updatable = false;
410  }
411 
412  i = -1;
413  while ((i = bms_next_member(idkey, i)) >= 0)
414  {
416 
417  if (!AttrNumberIsForUserDefinedAttr(attnum))
418  ereport(ERROR,
419  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
420  errmsg("logical replication target relation \"%s.%s\" uses "
421  "system columns in REPLICA IDENTITY index",
422  remoterel->nspname, remoterel->relname)));
423 
424  attnum = AttrNumberGetAttrOffset(attnum);
425 
426  if (entry->attrmap->attnums[attnum] < 0 ||
427  !bms_is_member(entry->attrmap->attnums[attnum], remoterel->attkeys))
428  {
429  entry->updatable = false;
430  break;
431  }
432  }
433 
434  entry->localrelvalid = true;
435  }
436 
437  if (entry->state != SUBREL_STATE_READY)
439  entry->localreloid,
440  &entry->statelsn);
441 
442  return entry;
443 }
444 
445 /*
446  * Close the previously opened logical relation.
447  */
448 void
450 {
451  table_close(rel->localrel, lockmode);
452  rel->localrel = NULL;
453 }
454 
455 /*
456  * Free the type map cache entry data.
457  */
458 static void
460 {
461  pfree(entry->nspname);
462  pfree(entry->typname);
463 }
464 
465 /*
466  * Add new entry or update existing entry in the type map cache.
467  */
468 void
470 {
471  MemoryContext oldctx;
472  LogicalRepTyp *entry;
473  bool found;
474 
475  if (LogicalRepTypMap == NULL)
477 
478  /*
479  * HASH_ENTER returns the existing entry if present or creates a new one.
480  */
481  entry = hash_search(LogicalRepTypMap, (void *) &remotetyp->remoteid,
482  HASH_ENTER, &found);
483 
484  if (found)
486 
487  /* Make cached copy of the data */
488  entry->remoteid = remotetyp->remoteid;
489  oldctx = MemoryContextSwitchTo(LogicalRepRelMapContext);
490  entry->nspname = pstrdup(remotetyp->nspname);
491  entry->typname = pstrdup(remotetyp->typname);
492  MemoryContextSwitchTo(oldctx);
493 }
494 
495 /*
496  * Fetch type name from the cache by remote type OID.
497  *
498  * Return a substitute value if we cannot find the data type; no message is
499  * sent to the log in that case, because this is used by error callback
500  * already.
501  */
502 char *
504 {
505  LogicalRepTyp *entry;
506  bool found;
507 
508  /* Internal types are mapped directly. */
509  if (remoteid < FirstGenbkiObjectId)
510  {
511  if (!get_typisdefined(remoteid))
512  {
513  /*
514  * This can be caused by having a publisher with a higher
515  * PostgreSQL major version than the subscriber.
516  */
517  return psprintf("unrecognized %u", remoteid);
518  }
519 
520  return format_type_be(remoteid);
521  }
522 
523  if (LogicalRepTypMap == NULL)
524  {
525  /*
526  * If the typemap is not initialized yet, we cannot possibly attempt
527  * to search the hash table; but there's no way we know the type
528  * locally yet, since we haven't received a message about this type,
529  * so this is the best we can do.
530  */
531  return psprintf("unrecognized %u", remoteid);
532  }
533 
534  /* search the mapping */
535  entry = hash_search(LogicalRepTypMap, (void *) &remoteid,
536  HASH_FIND, &found);
537  if (!found)
538  return psprintf("unrecognized %u", remoteid);
539 
540  Assert(OidIsValid(entry->remoteid));
541  return psprintf("%s.%s", entry->nspname, entry->typname);
542 }
543 
544 /*
545  * Partition cache: look up partition LogicalRepRelMapEntry's
546  *
547  * Unlike relation map cache, this is keyed by partition OID, not remote
548  * relation OID, because we only have to use this cache in the case where
549  * partitions are not directly mapped to any remote relation, such as when
550  * replication is occurring with one of their ancestors as target.
551  */
552 
553 /*
554  * Relcache invalidation callback
555  */
556 static void
558 {
559  LogicalRepRelMapEntry *entry;
560 
561  /* Just to be sure. */
562  if (LogicalRepPartMap == NULL)
563  return;
564 
565  if (reloid != InvalidOid)
566  {
568 
569  hash_seq_init(&status, LogicalRepPartMap);
570 
571  /* TODO, use inverse lookup hashtable? */
572  while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
573  {
574  if (entry->localreloid == reloid)
575  {
576  entry->localrelvalid = false;
577  hash_seq_term(&status);
578  break;
579  }
580  }
581  }
582  else
583  {
584  /* invalidate all cache entries */
586 
587  hash_seq_init(&status, LogicalRepPartMap);
588 
589  while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
590  entry->localrelvalid = false;
591  }
592 }
593 
594 /*
595  * Initialize the partition map cache.
596  */
597 static void
599 {
600  HASHCTL ctl;
601 
602  if (!LogicalRepPartMapContext)
603  LogicalRepPartMapContext =
605  "LogicalRepPartMapContext",
607 
608  /* Initialize the relation hash table. */
609  MemSet(&ctl, 0, sizeof(ctl));
610  ctl.keysize = sizeof(Oid); /* partition OID */
611  ctl.entrysize = sizeof(LogicalRepPartMapEntry);
613 
614  LogicalRepPartMap = hash_create("logicalrep partition map cache", 64, &ctl,
616 
617  /* Watch for invalidation events. */
619  (Datum) 0);
620 }
621 
622 /*
623  * logicalrep_partition_open
624  *
625  * Returned entry reuses most of the values of the root table's entry, save
626  * the attribute map, which can be different for the partition.
627  *
628  * Note there's no logicalrep_partition_close, because the caller closes the
629  * component relation.
630  */
633  Relation partrel, AttrMap *map)
634 {
635  LogicalRepRelMapEntry *entry;
636  LogicalRepPartMapEntry *part_entry;
637  LogicalRepRelation *remoterel = &root->remoterel;
638  Oid partOid = RelationGetRelid(partrel);
639  AttrMap *attrmap = root->attrmap;
640  bool found;
641  int i;
642  MemoryContext oldctx;
643 
644  if (LogicalRepPartMap == NULL)
646 
647  /* Search for existing entry. */
648  part_entry = (LogicalRepPartMapEntry *) hash_search(LogicalRepPartMap,
649  (void *) &partOid,
650  HASH_ENTER, &found);
651 
652  if (found)
653  return &part_entry->relmapentry;
654 
655  memset(part_entry, 0, sizeof(LogicalRepPartMapEntry));
656 
657  /* Switch to longer-lived context. */
658  oldctx = MemoryContextSwitchTo(LogicalRepPartMapContext);
659 
660  part_entry->partoid = partOid;
661 
662  /* Remote relation is used as-is from the root entry. */
663  entry = &part_entry->relmapentry;
664  entry->remoterel.remoteid = remoterel->remoteid;
665  entry->remoterel.nspname = pstrdup(remoterel->nspname);
666  entry->remoterel.relname = pstrdup(remoterel->relname);
667  entry->remoterel.natts = remoterel->natts;
668  entry->remoterel.attnames = palloc(remoterel->natts * sizeof(char *));
669  entry->remoterel.atttyps = palloc(remoterel->natts * sizeof(Oid));
670  for (i = 0; i < remoterel->natts; i++)
671  {
672  entry->remoterel.attnames[i] = pstrdup(remoterel->attnames[i]);
673  entry->remoterel.atttyps[i] = remoterel->atttyps[i];
674  }
675  entry->remoterel.replident = remoterel->replident;
676  entry->remoterel.attkeys = bms_copy(remoterel->attkeys);
677 
678  entry->localrel = partrel;
679  entry->localreloid = partOid;
680 
681  /*
682  * If the partition's attributes don't match the root relation's, we'll
683  * need to make a new attrmap which maps partition attribute numbers to
684  * remoterel's, instead of the original which maps root relation's
685  * attribute numbers to remoterel's.
686  *
687  * Note that 'map' which comes from the tuple routing data structure
688  * contains 1-based attribute numbers (of the parent relation). However,
689  * the map in 'entry', a logical replication data structure, contains
690  * 0-based attribute numbers (of the remote relation).
691  */
692  if (map)
693  {
694  AttrNumber attno;
695 
696  entry->attrmap = make_attrmap(map->maplen);
697  for (attno = 0; attno < entry->attrmap->maplen; attno++)
698  {
699  AttrNumber root_attno = map->attnums[attno];
700 
701  entry->attrmap->attnums[attno] = attrmap->attnums[root_attno - 1];
702  }
703  }
704  else
705  entry->attrmap = attrmap;
706 
707  entry->updatable = root->updatable;
708 
709  entry->localrelvalid = true;
710 
711  /* state and statelsn are left set to 0. */
712  MemoryContextSwitchTo(oldctx);
713 
714  return entry;
715 }
Subscription * MySubscription
Definition: worker.c:161
static void logicalrep_relmap_free_entry(LogicalRepRelMapEntry *entry)
Definition: relation.c:141
static void logicalrep_partmap_init(void)
Definition: relation.c:598
int bms_first_member(Bitmapset *a)
Definition: bitmapset.c:996
#define AllocSetContextCreate
Definition: memutils.h:170
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:167
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
#define HASH_CONTEXT
Definition: hsearch.h:91
#define HASH_ELEM
Definition: hsearch.h:85
MemoryContext hcxt
Definition: hsearch.h:77
#define RelationGetDescr(relation)
Definition: rel.h:483
int LOCKMODE
Definition: lockdefs.h:26
int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...)
Definition: elog.c:1012
#define RangeVarGetRelid(relation, lockmode, missing_ok)
Definition: namespace.h:78
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
char * pstrdup(const char *in)
Definition: mcxt.c:1187
char * psprintf(const char *fmt,...)
Definition: psprintf.c:46
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1043
struct LogicalRepPartMapEntry LogicalRepPartMapEntry
int maplen
Definition: attmap.h:37
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
Size entrysize
Definition: hsearch.h:72
#define AttrNumberIsForUserDefinedAttr(attributeNumber)
Definition: attnum.h:41
bool get_typisdefined(Oid typid)
Definition: lsyscache.c:2066
int errcode(int sqlerrcode)
Definition: elog.c:691
#define MemSet(start, val, len)
Definition: c.h:1004
char * format_type_be(Oid type_oid)
Definition: format_type.c:339
void logicalrep_rel_close(LogicalRepRelMapEntry *rel, LOCKMODE lockmode)
Definition: relation.c:449
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:919
Form_pg_class rd_rel
Definition: rel.h:110
unsigned int Oid
Definition: postgres_ext.h:31
Relation try_table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:69
static HTAB * LogicalRepTypMap
Definition: relation.c:37
#define OidIsValid(objectId)
Definition: c.h:706
Bitmapset * attkeys
Definition: logicalproto.h:98
Definition: attmap.h:34
LogicalRepRelId remoteid
Definition: logicalproto.h:90
void CacheRegisterRelcacheCallback(RelcacheCallbackFunction func, Datum arg)
Definition: inval.c:1476
static void logicalrep_report_missing_attrs(LogicalRepRelation *remoterel, Bitmapset *missingatts)
Definition: relation.c:235
void logicalrep_relmap_update(LogicalRepRelation *remoterel)
Definition: relation.c:173
Definition: dynahash.c:218
void pfree(void *pointer)
Definition: mcxt.c:1057
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:91
Bitmapset * bms_add_range(Bitmapset *a, int lower, int upper)
Definition: bitmapset.c:834
#define ERROR
Definition: elog.h:43
NameData attname
Definition: pg_attribute.h:40
static int logicalrep_rel_att_by_name(LogicalRepRelation *remoterel, const char *attname)
Definition: relation.c:218
LogicalRepRelation remoterel
static HTAB * LogicalRepPartMap
Definition: relation.c:51
static void logicalrep_relmap_invalidate_cb(Datum arg, Oid reloid)
Definition: relation.c:62
LogicalRepRelMapEntry relmapentry
Definition: relation.c:55
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:192
#define AttrNumberGetAttrOffset(attNum)
Definition: attnum.h:51
#define NoLock
Definition: lockdefs.h:34
static MemoryContext LogicalRepRelMapContext
Definition: relation.c:34
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:193
void CheckSubscriptionRelkind(char relkind, const char *nspname, const char *relname)
LogicalRepRelMapEntry * logicalrep_rel_open(LogicalRepRelId remoteid, LOCKMODE lockmode)
Definition: relation.c:274
struct LogicalRepTyp LogicalRepTyp
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
void initStringInfo(StringInfo str)
Definition: stringinfo.c:59
#define HASH_BLOBS
Definition: hsearch.h:86
struct LogicalRepRelMapEntry LogicalRepRelMapEntry
char GetSubscriptionRelState(Oid subid, Oid relid, XLogRecPtr *sublsn)
HTAB * hash_create(const char *tabname, long nelem, HASHCTL *info, int flags)
Definition: dynahash.c:326
uintptr_t Datum
Definition: postgres.h:367
Size keysize
Definition: hsearch.h:71
#define InvalidOid
Definition: postgres_ext.h:36
LogicalRepRelMapEntry * logicalrep_partition_open(LogicalRepRelMapEntry *root, Relation partrel, AttrMap *map)
Definition: relation.c:632
int16 attnum
Definition: pg_attribute.h:79
#define ereport(elevel,...)
Definition: elog.h:155
void bms_free(Bitmapset *a)
Definition: bitmapset.c:208
#define Assert(condition)
Definition: c.h:800
static void logicalrep_partmap_invalidate_cb(Datum arg, Oid reloid)
Definition: relation.c:557
AttrNumber * attnums
Definition: attmap.h:36
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1401
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1391
AttrMap * make_attrmap(int maplen)
Definition: attmap.c:41
char * logicalrep_typmap_gettypname(Oid remoteid)
Definition: relation.c:503
static MemoryContext LogicalRepPartMapContext
Definition: relation.c:50
#define FirstGenbkiObjectId
Definition: transam.h:188
void * palloc(Size size)
Definition: mcxt.c:950
int errmsg(const char *fmt,...)
Definition: elog.c:902
#define elog(elevel,...)
Definition: elog.h:228
int i
Bitmapset * RelationGetIndexAttrBitmap(Relation relation, IndexAttrBitmapKind attrKind)
Definition: relcache.c:4945
#define NameStr(name)
Definition: c.h:677
void * arg
static void logicalrep_relmap_init(void)
Definition: relation.c:103
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:227
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:773
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:427
int16 AttrNumber
Definition: attnum.h:21
#define _(x)
Definition: elog.c:88
#define RelationGetRelid(relation)
Definition: rel.h:457
RangeVar * makeRangeVar(char *schemaname, char *relname, int location)
Definition: makefuncs.c:422
static void logicalrep_typmap_free_entry(LogicalRepTyp *entry)
Definition: relation.c:459
void hash_seq_term(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1477
void logicalrep_typmap_update(LogicalRepTyp *remotetyp)
Definition: relation.c:469
static HTAB * LogicalRepRelMap
Definition: relation.c:36
uint32 LogicalRepRelId
Definition: logicalproto.h:84
MemoryContext CacheMemoryContext
Definition: mcxt.c:47