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-2024, 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 #ifdef USE_ASSERT_CHECKING
21 #include "access/amapi.h"
22 #endif
23 #include "access/genam.h"
24 #include "access/table.h"
25 #include "catalog/namespace.h"
27 #include "executor/executor.h"
28 #include "nodes/makefuncs.h"
31 #include "utils/inval.h"
32 
33 
35 
36 static HTAB *LogicalRepRelMap = NULL;
37 
38 /*
39  * Partition map (LogicalRepPartMap)
40  *
41  * When a partitioned table is used as replication target, replicated
42  * operations are actually performed on its leaf partitions, which requires
43  * the partitions to also be mapped to the remote relation. Parent's entry
44  * (LogicalRepRelMapEntry) cannot be used as-is for all partitions, because
45  * individual partitions may have different attribute numbers, which means
46  * attribute mappings to remote relation's attributes must be maintained
47  * separately for each partition.
48  */
50 static HTAB *LogicalRepPartMap = NULL;
51 typedef struct LogicalRepPartMapEntry
52 {
53  Oid partoid; /* LogicalRepPartMap's key */
56 
57 static Oid FindLogicalRepLocalIndex(Relation localrel, LogicalRepRelation *remoterel,
58  AttrMap *attrMap);
59 
60 /*
61  * Relcache invalidation callback for our relation map cache.
62  */
63 static void
65 {
66  LogicalRepRelMapEntry *entry;
67 
68  /* Just to be sure. */
69  if (LogicalRepRelMap == NULL)
70  return;
71 
72  if (reloid != InvalidOid)
73  {
74  HASH_SEQ_STATUS status;
75 
77 
78  /* TODO, use inverse lookup hashtable? */
79  while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
80  {
81  if (entry->localreloid == reloid)
82  {
83  entry->localrelvalid = false;
84  hash_seq_term(&status);
85  break;
86  }
87  }
88  }
89  else
90  {
91  /* invalidate all cache entries */
92  HASH_SEQ_STATUS status;
93 
95 
96  while ((entry = (LogicalRepRelMapEntry *) hash_seq_search(&status)) != NULL)
97  entry->localrelvalid = false;
98  }
99 }
100 
101 /*
102  * Initialize the relation map cache.
103  */
104 static void
106 {
107  HASHCTL ctl;
108 
112  "LogicalRepRelMapContext",
114 
115  /* Initialize the relation hash table. */
116  ctl.keysize = sizeof(LogicalRepRelId);
117  ctl.entrysize = sizeof(LogicalRepRelMapEntry);
119 
120  LogicalRepRelMap = hash_create("logicalrep relation map cache", 128, &ctl,
122 
123  /* Watch for invalidation events. */
125  (Datum) 0);
126 }
127 
128 /*
129  * Free the entry of a relation map cache.
130  */
131 static void
133 {
134  LogicalRepRelation *remoterel;
135 
136  remoterel = &entry->remoterel;
137 
138  pfree(remoterel->nspname);
139  pfree(remoterel->relname);
140 
141  if (remoterel->natts > 0)
142  {
143  int i;
144 
145  for (i = 0; i < remoterel->natts; i++)
146  pfree(remoterel->attnames[i]);
147 
148  pfree(remoterel->attnames);
149  pfree(remoterel->atttyps);
150  }
151  bms_free(remoterel->attkeys);
152 
153  if (entry->attrmap)
154  free_attrmap(entry->attrmap);
155 }
156 
157 /*
158  * Add new entry or update existing entry in the relation map cache.
159  *
160  * Called when new relation mapping is sent by the publisher to update
161  * our expected view of incoming data from said publisher.
162  */
163 void
165 {
166  MemoryContext oldctx;
167  LogicalRepRelMapEntry *entry;
168  bool found;
169  int i;
170 
171  if (LogicalRepRelMap == NULL)
173 
174  /*
175  * HASH_ENTER returns the existing entry if present or creates a new one.
176  */
177  entry = hash_search(LogicalRepRelMap, &remoterel->remoteid,
178  HASH_ENTER, &found);
179 
180  if (found)
182 
183  memset(entry, 0, sizeof(LogicalRepRelMapEntry));
184 
185  /* Make cached copy of the data */
187  entry->remoterel.remoteid = remoterel->remoteid;
188  entry->remoterel.nspname = pstrdup(remoterel->nspname);
189  entry->remoterel.relname = pstrdup(remoterel->relname);
190  entry->remoterel.natts = remoterel->natts;
191  entry->remoterel.attnames = palloc(remoterel->natts * sizeof(char *));
192  entry->remoterel.atttyps = palloc(remoterel->natts * sizeof(Oid));
193  for (i = 0; i < remoterel->natts; i++)
194  {
195  entry->remoterel.attnames[i] = pstrdup(remoterel->attnames[i]);
196  entry->remoterel.atttyps[i] = remoterel->atttyps[i];
197  }
198  entry->remoterel.replident = remoterel->replident;
199  entry->remoterel.attkeys = bms_copy(remoterel->attkeys);
200  MemoryContextSwitchTo(oldctx);
201 }
202 
203 /*
204  * Find attribute index in TupleDesc struct by attribute name.
205  *
206  * Returns -1 if not found.
207  */
208 static int
210 {
211  int i;
212 
213  for (i = 0; i < remoterel->natts; i++)
214  {
215  if (strcmp(remoterel->attnames[i], attname) == 0)
216  return i;
217  }
218 
219  return -1;
220 }
221 
222 /*
223  * Report error with names of the missing local relation column(s), if any.
224  */
225 static void
227  Bitmapset *missingatts)
228 {
229  if (!bms_is_empty(missingatts))
230  {
231  StringInfoData missingattsbuf;
232  int missingattcnt = 0;
233  int i;
234 
235  initStringInfo(&missingattsbuf);
236 
237  i = -1;
238  while ((i = bms_next_member(missingatts, i)) >= 0)
239  {
240  missingattcnt++;
241  if (missingattcnt == 1)
242  appendStringInfo(&missingattsbuf, _("\"%s\""),
243  remoterel->attnames[i]);
244  else
245  appendStringInfo(&missingattsbuf, _(", \"%s\""),
246  remoterel->attnames[i]);
247  }
248 
249  ereport(ERROR,
250  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
251  errmsg_plural("logical replication target relation \"%s.%s\" is missing replicated column: %s",
252  "logical replication target relation \"%s.%s\" is missing replicated columns: %s",
253  missingattcnt,
254  remoterel->nspname,
255  remoterel->relname,
256  missingattsbuf.data)));
257  }
258 }
259 
260 /*
261  * Check if replica identity matches and mark the updatable flag.
262  *
263  * We allow for stricter replica identity (fewer columns) on subscriber as
264  * that will not stop us from finding unique tuple. IE, if publisher has
265  * identity (id,timestamp) and subscriber just (id) this will not be a
266  * problem, but in the opposite scenario it will.
267  *
268  * We just mark the relation entry as not updatable here if the local
269  * replica identity is found to be insufficient for applying
270  * updates/deletes (inserts don't care!) and leave it to
271  * check_relation_updatable() to throw the actual error if needed.
272  */
273 static void
275 {
276  Bitmapset *idkey;
277  LogicalRepRelation *remoterel = &entry->remoterel;
278  int i;
279 
280  entry->updatable = true;
281 
282  idkey = RelationGetIndexAttrBitmap(entry->localrel,
284  /* fallback to PK if no replica identity */
285  if (idkey == NULL)
286  {
287  idkey = RelationGetIndexAttrBitmap(entry->localrel,
289 
290  /*
291  * If no replica identity index and no PK, the published table must
292  * have replica identity FULL.
293  */
294  if (idkey == NULL && remoterel->replident != REPLICA_IDENTITY_FULL)
295  entry->updatable = false;
296  }
297 
298  i = -1;
299  while ((i = bms_next_member(idkey, i)) >= 0)
300  {
302 
304  ereport(ERROR,
305  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
306  errmsg("logical replication target relation \"%s.%s\" uses "
307  "system columns in REPLICA IDENTITY index",
308  remoterel->nspname, remoterel->relname)));
309 
311 
312  if (entry->attrmap->attnums[attnum] < 0 ||
313  !bms_is_member(entry->attrmap->attnums[attnum], remoterel->attkeys))
314  {
315  entry->updatable = false;
316  break;
317  }
318  }
319 }
320 
321 /*
322  * Open the local relation associated with the remote one.
323  *
324  * Rebuilds the Relcache mapping if it was invalidated by local DDL.
325  */
328 {
329  LogicalRepRelMapEntry *entry;
330  bool found;
331  LogicalRepRelation *remoterel;
332 
333  if (LogicalRepRelMap == NULL)
335 
336  /* Search for existing entry. */
337  entry = hash_search(LogicalRepRelMap, &remoteid,
338  HASH_FIND, &found);
339 
340  if (!found)
341  elog(ERROR, "no relation map entry for remote relation ID %u",
342  remoteid);
343 
344  remoterel = &entry->remoterel;
345 
346  /* Ensure we don't leak a relcache refcount. */
347  if (entry->localrel)
348  elog(ERROR, "remote relation ID %u is already open", remoteid);
349 
350  /*
351  * When opening and locking a relation, pending invalidation messages are
352  * processed which can invalidate the relation. Hence, if the entry is
353  * currently considered valid, try to open the local relation by OID and
354  * see if invalidation ensues.
355  */
356  if (entry->localrelvalid)
357  {
358  entry->localrel = try_table_open(entry->localreloid, lockmode);
359  if (!entry->localrel)
360  {
361  /* Table was renamed or dropped. */
362  entry->localrelvalid = false;
363  }
364  else if (!entry->localrelvalid)
365  {
366  /* Note we release the no-longer-useful lock here. */
367  table_close(entry->localrel, lockmode);
368  entry->localrel = NULL;
369  }
370  }
371 
372  /*
373  * If the entry has been marked invalid since we last had lock on it,
374  * re-open the local relation by name and rebuild all derived data.
375  */
376  if (!entry->localrelvalid)
377  {
378  Oid relid;
379  TupleDesc desc;
380  MemoryContext oldctx;
381  int i;
382  Bitmapset *missingatts;
383 
384  /* Release the no-longer-useful attrmap, if any. */
385  if (entry->attrmap)
386  {
387  free_attrmap(entry->attrmap);
388  entry->attrmap = NULL;
389  }
390 
391  /* Try to find and lock the relation by name. */
392  relid = RangeVarGetRelid(makeRangeVar(remoterel->nspname,
393  remoterel->relname, -1),
394  lockmode, true);
395  if (!OidIsValid(relid))
396  ereport(ERROR,
397  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
398  errmsg("logical replication target relation \"%s.%s\" does not exist",
399  remoterel->nspname, remoterel->relname)));
400  entry->localrel = table_open(relid, NoLock);
401  entry->localreloid = relid;
402 
403  /* Check for supported relkind. */
404  CheckSubscriptionRelkind(entry->localrel->rd_rel->relkind,
405  remoterel->nspname, remoterel->relname);
406 
407  /*
408  * Build the mapping of local attribute numbers to remote attribute
409  * numbers and validate that we don't miss any replicated columns as
410  * that would result in potentially unwanted data loss.
411  */
412  desc = RelationGetDescr(entry->localrel);
414  entry->attrmap = make_attrmap(desc->natts);
415  MemoryContextSwitchTo(oldctx);
416 
417  /* check and report missing attrs, if any */
418  missingatts = bms_add_range(NULL, 0, remoterel->natts - 1);
419  for (i = 0; i < desc->natts; i++)
420  {
421  int attnum;
422  Form_pg_attribute attr = TupleDescAttr(desc, i);
423 
424  if (attr->attisdropped || attr->attgenerated)
425  {
426  entry->attrmap->attnums[i] = -1;
427  continue;
428  }
429 
431  NameStr(attr->attname));
432 
433  entry->attrmap->attnums[i] = attnum;
434  if (attnum >= 0)
435  missingatts = bms_del_member(missingatts, attnum);
436  }
437 
438  logicalrep_report_missing_attrs(remoterel, missingatts);
439 
440  /* be tidy */
441  bms_free(missingatts);
442 
443  /*
444  * Set if the table's replica identity is enough to apply
445  * update/delete.
446  */
448 
449  /*
450  * Finding a usable index is an infrequent task. It occurs when an
451  * operation is first performed on the relation, or after invalidation
452  * of the relation cache entry (such as ANALYZE or CREATE/DROP index
453  * on the relation).
454  */
455  entry->localindexoid = FindLogicalRepLocalIndex(entry->localrel, remoterel,
456  entry->attrmap);
457 
458  entry->localrelvalid = true;
459  }
460 
461  if (entry->state != SUBREL_STATE_READY)
463  entry->localreloid,
464  &entry->statelsn);
465 
466  return entry;
467 }
468 
469 /*
470  * Close the previously opened logical relation.
471  */
472 void
474 {
475  table_close(rel->localrel, lockmode);
476  rel->localrel = NULL;
477 }
478 
479 /*
480  * Partition cache: look up partition LogicalRepRelMapEntry's
481  *
482  * Unlike relation map cache, this is keyed by partition OID, not remote
483  * relation OID, because we only have to use this cache in the case where
484  * partitions are not directly mapped to any remote relation, such as when
485  * replication is occurring with one of their ancestors as target.
486  */
487 
488 /*
489  * Relcache invalidation callback
490  */
491 static void
493 {
494  LogicalRepPartMapEntry *entry;
495 
496  /* Just to be sure. */
497  if (LogicalRepPartMap == NULL)
498  return;
499 
500  if (reloid != InvalidOid)
501  {
502  HASH_SEQ_STATUS status;
503 
505 
506  /* TODO, use inverse lookup hashtable? */
507  while ((entry = (LogicalRepPartMapEntry *) hash_seq_search(&status)) != NULL)
508  {
509  if (entry->relmapentry.localreloid == reloid)
510  {
511  entry->relmapentry.localrelvalid = false;
512  hash_seq_term(&status);
513  break;
514  }
515  }
516  }
517  else
518  {
519  /* invalidate all cache entries */
520  HASH_SEQ_STATUS status;
521 
523 
524  while ((entry = (LogicalRepPartMapEntry *) hash_seq_search(&status)) != NULL)
525  entry->relmapentry.localrelvalid = false;
526  }
527 }
528 
529 /*
530  * Reset the entries in the partition map that refer to remoterel.
531  *
532  * Called when new relation mapping is sent by the publisher to update our
533  * expected view of incoming data from said publisher.
534  *
535  * Note that we don't update the remoterel information in the entry here,
536  * we will update the information in logicalrep_partition_open to avoid
537  * unnecessary work.
538  */
539 void
541 {
542  HASH_SEQ_STATUS status;
543  LogicalRepPartMapEntry *part_entry;
544  LogicalRepRelMapEntry *entry;
545 
546  if (LogicalRepPartMap == NULL)
547  return;
548 
550  while ((part_entry = (LogicalRepPartMapEntry *) hash_seq_search(&status)) != NULL)
551  {
552  entry = &part_entry->relmapentry;
553 
554  if (entry->remoterel.remoteid != remoterel->remoteid)
555  continue;
556 
558 
559  memset(entry, 0, sizeof(LogicalRepRelMapEntry));
560  }
561 }
562 
563 /*
564  * Initialize the partition map cache.
565  */
566 static void
568 {
569  HASHCTL ctl;
570 
574  "LogicalRepPartMapContext",
576 
577  /* Initialize the relation hash table. */
578  ctl.keysize = sizeof(Oid); /* partition OID */
579  ctl.entrysize = sizeof(LogicalRepPartMapEntry);
581 
582  LogicalRepPartMap = hash_create("logicalrep partition map cache", 64, &ctl,
584 
585  /* Watch for invalidation events. */
587  (Datum) 0);
588 }
589 
590 /*
591  * logicalrep_partition_open
592  *
593  * Returned entry reuses most of the values of the root table's entry, save
594  * the attribute map, which can be different for the partition. However,
595  * we must physically copy all the data, in case the root table's entry
596  * gets freed/rebuilt.
597  *
598  * Note there's no logicalrep_partition_close, because the caller closes the
599  * component relation.
600  */
603  Relation partrel, AttrMap *map)
604 {
605  LogicalRepRelMapEntry *entry;
606  LogicalRepPartMapEntry *part_entry;
607  LogicalRepRelation *remoterel = &root->remoterel;
608  Oid partOid = RelationGetRelid(partrel);
609  AttrMap *attrmap = root->attrmap;
610  bool found;
611  MemoryContext oldctx;
612 
613  if (LogicalRepPartMap == NULL)
615 
616  /* Search for existing entry. */
618  &partOid,
619  HASH_ENTER, &found);
620 
621  entry = &part_entry->relmapentry;
622 
623  /*
624  * We must always overwrite entry->localrel with the latest partition
625  * Relation pointer, because the Relation pointed to by the old value may
626  * have been cleared after the caller would have closed the partition
627  * relation after the last use of this entry. Note that localrelvalid is
628  * only updated by the relcache invalidation callback, so it may still be
629  * true irrespective of whether the Relation pointed to by localrel has
630  * been cleared or not.
631  */
632  if (found && entry->localrelvalid)
633  {
634  entry->localrel = partrel;
635  return entry;
636  }
637 
638  /* Switch to longer-lived context. */
640 
641  if (!found)
642  {
643  memset(part_entry, 0, sizeof(LogicalRepPartMapEntry));
644  part_entry->partoid = partOid;
645  }
646 
647  /* Release the no-longer-useful attrmap, if any. */
648  if (entry->attrmap)
649  {
650  free_attrmap(entry->attrmap);
651  entry->attrmap = NULL;
652  }
653 
654  if (!entry->remoterel.remoteid)
655  {
656  int i;
657 
658  /* Remote relation is copied as-is from the root entry. */
659  entry->remoterel.remoteid = remoterel->remoteid;
660  entry->remoterel.nspname = pstrdup(remoterel->nspname);
661  entry->remoterel.relname = pstrdup(remoterel->relname);
662  entry->remoterel.natts = remoterel->natts;
663  entry->remoterel.attnames = palloc(remoterel->natts * sizeof(char *));
664  entry->remoterel.atttyps = palloc(remoterel->natts * sizeof(Oid));
665  for (i = 0; i < remoterel->natts; i++)
666  {
667  entry->remoterel.attnames[i] = pstrdup(remoterel->attnames[i]);
668  entry->remoterel.atttyps[i] = remoterel->atttyps[i];
669  }
670  entry->remoterel.replident = remoterel->replident;
671  entry->remoterel.attkeys = bms_copy(remoterel->attkeys);
672  }
673 
674  entry->localrel = partrel;
675  entry->localreloid = partOid;
676 
677  /*
678  * If the partition's attributes don't match the root relation's, we'll
679  * need to make a new attrmap which maps partition attribute numbers to
680  * remoterel's, instead of the original which maps root relation's
681  * attribute numbers to remoterel's.
682  *
683  * Note that 'map' which comes from the tuple routing data structure
684  * contains 1-based attribute numbers (of the parent relation). However,
685  * the map in 'entry', a logical replication data structure, contains
686  * 0-based attribute numbers (of the remote relation).
687  */
688  if (map)
689  {
690  AttrNumber attno;
691 
692  entry->attrmap = make_attrmap(map->maplen);
693  for (attno = 0; attno < entry->attrmap->maplen; attno++)
694  {
695  AttrNumber root_attno = map->attnums[attno];
696 
697  /* 0 means it's a dropped attribute. See comments atop AttrMap. */
698  if (root_attno == 0)
699  entry->attrmap->attnums[attno] = -1;
700  else
701  entry->attrmap->attnums[attno] = attrmap->attnums[root_attno - 1];
702  }
703  }
704  else
705  {
706  /* Lacking copy_attmap, do this the hard way. */
707  entry->attrmap = make_attrmap(attrmap->maplen);
708  memcpy(entry->attrmap->attnums, attrmap->attnums,
709  attrmap->maplen * sizeof(AttrNumber));
710  }
711 
712  /* Set if the table's replica identity is enough to apply update/delete. */
714 
715  /* state and statelsn are left set to 0. */
716  MemoryContextSwitchTo(oldctx);
717 
718  /*
719  * Finding a usable index is an infrequent task. It occurs when an
720  * operation is first performed on the relation, or after invalidation of
721  * the relation cache entry (such as ANALYZE or CREATE/DROP index on the
722  * relation).
723  *
724  * We also prefer to run this code on the oldctx so that we do not leak
725  * anything in the LogicalRepPartMapContext (hence CacheMemoryContext).
726  */
727  entry->localindexoid = FindLogicalRepLocalIndex(partrel, remoterel,
728  entry->attrmap);
729 
730  entry->localrelvalid = true;
731 
732  return entry;
733 }
734 
735 /*
736  * Returns the oid of an index that can be used by the apply worker to scan
737  * the relation.
738  *
739  * We expect to call this function when REPLICA IDENTITY FULL is defined for
740  * the remote relation.
741  *
742  * If no suitable index is found, returns InvalidOid.
743  */
744 static Oid
746 {
747  List *idxlist = RelationGetIndexList(localrel);
748 
749  foreach_oid(idxoid, idxlist)
750  {
751  bool isUsableIdx;
752  Relation idxRel;
753  IndexInfo *idxInfo;
754 
755  idxRel = index_open(idxoid, AccessShareLock);
756  idxInfo = BuildIndexInfo(idxRel);
757  isUsableIdx = IsIndexUsableForReplicaIdentityFull(idxInfo, attrmap);
758  index_close(idxRel, AccessShareLock);
759 
760  /* Return the first eligible index found */
761  if (isUsableIdx)
762  return idxoid;
763  }
764 
765  return InvalidOid;
766 }
767 
768 /*
769  * Returns true if the index is usable for replica identity full.
770  *
771  * The index must be btree or hash, non-partial, and the leftmost field must be
772  * a column (not an expression) that references the remote relation column. These
773  * limitations help to keep the index scan similar to PK/RI index scans.
774  *
775  * attrmap is a map of local attributes to remote ones. We can consult this
776  * map to check whether the local index attribute has a corresponding remote
777  * attribute.
778  *
779  * Note that the limitations of index scans for replica identity full only
780  * adheres to a subset of the limitations of PK/RI. For example, we support
781  * columns that are marked as [NULL] or we are not interested in the [NOT
782  * DEFERRABLE] aspect of constraints here. It works for us because we always
783  * compare the tuples for non-PK/RI index scans. See
784  * RelationFindReplTupleByIndex().
785  *
786  * The reasons why only Btree and Hash indexes can be considered as usable are:
787  *
788  * 1) Other index access methods don't have a fixed strategy for equality
789  * operation. Refer get_equal_strategy_number_for_am().
790  *
791  * 2) For indexes other than PK and REPLICA IDENTITY, we need to match the
792  * local and remote tuples. The equality routine tuples_equal() cannot accept
793  * a datatype (e.g. point or box) that does not have a default operator class
794  * for Btree or Hash.
795  *
796  * XXX: Note that BRIN and GIN indexes do not implement "amgettuple" which
797  * will be used later to fetch the tuples. See RelationFindReplTupleByIndex().
798  *
799  * XXX: To support partial indexes, the required changes are likely to be larger.
800  * If none of the tuples satisfy the expression for the index scan, we fall-back
801  * to sequential execution, which might not be a good idea in some cases.
802  */
803 bool
805 {
806  AttrNumber keycol;
807 
808  /* Ensure that the index access method has a valid equal strategy */
810  return false;
811 
812  /* The index must not be a partial index */
813  if (indexInfo->ii_Predicate != NIL)
814  return false;
815 
816  Assert(indexInfo->ii_NumIndexAttrs >= 1);
817 
818  /* The leftmost index field must not be an expression */
819  keycol = indexInfo->ii_IndexAttrNumbers[0];
820  if (!AttributeNumberIsValid(keycol))
821  return false;
822 
823  /*
824  * And the leftmost index field must reference the remote relation column.
825  * This is because if it doesn't, the sequential scan is favorable over
826  * index scan in most cases.
827  */
828  if (attrmap->maplen <= AttrNumberGetAttrOffset(keycol) ||
829  attrmap->attnums[AttrNumberGetAttrOffset(keycol)] < 0)
830  return false;
831 
832 #ifdef USE_ASSERT_CHECKING
833  {
834  IndexAmRoutine *amroutine;
835 
836  /* The given index access method must implement amgettuple. */
837  amroutine = GetIndexAmRoutineByAmId(indexInfo->ii_Am, false);
838  Assert(amroutine->amgettuple != NULL);
839  }
840 #endif
841 
842  return true;
843 }
844 
845 /*
846  * Return the OID of the replica identity index if one is defined;
847  * the OID of the PK if one exists and is not deferrable;
848  * otherwise, InvalidOid.
849  */
850 Oid
852 {
853  Oid idxoid;
854 
855  idxoid = RelationGetReplicaIndex(rel);
856 
857  if (!OidIsValid(idxoid))
858  idxoid = RelationGetPrimaryKeyIndex(rel);
859 
860  return idxoid;
861 }
862 
863 /*
864  * Returns the index oid if we can use an index for subscriber. Otherwise,
865  * returns InvalidOid.
866  */
867 static Oid
869  AttrMap *attrMap)
870 {
871  Oid idxoid;
872 
873  /*
874  * We never need index oid for partitioned tables, always rely on leaf
875  * partition's index.
876  */
877  if (localrel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
878  return InvalidOid;
879 
880  /*
881  * Simple case, we already have a primary key or a replica identity index.
882  */
883  idxoid = GetRelationIdentityOrPK(localrel);
884  if (OidIsValid(idxoid))
885  return idxoid;
886 
887  if (remoterel->replident == REPLICA_IDENTITY_FULL)
888  {
889  /*
890  * We are looking for one more opportunity for using an index. If
891  * there are any indexes defined on the local relation, try to pick a
892  * suitable index.
893  *
894  * The index selection safely assumes that all the columns are going
895  * to be available for the index scan given that remote relation has
896  * replica identity full.
897  *
898  * Note that we are not using the planner to find the cheapest method
899  * to scan the relation as that would require us to either use lower
900  * level planner functions which would be a maintenance burden in the
901  * long run or use the full-fledged planner which could cause
902  * overhead.
903  */
904  return FindUsableIndexForReplicaIdentityFull(localrel, attrMap);
905  }
906 
907  return InvalidOid;
908 }
IndexAmRoutine * GetIndexAmRoutineByAmId(Oid amoid, bool noerror)
Definition: amapi.c:56
void free_attrmap(AttrMap *map)
Definition: attmap.c:56
AttrMap * make_attrmap(int maplen)
Definition: attmap.c:40
int16 AttrNumber
Definition: attnum.h:21
#define AttributeNumberIsValid(attributeNumber)
Definition: attnum.h:34
#define AttrNumberGetAttrOffset(attNum)
Definition: attnum.h:51
#define AttrNumberIsForUserDefinedAttr(attributeNumber)
Definition: attnum.h:41
Subscription * MySubscription
Definition: worker.c:298
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1306
void bms_free(Bitmapset *a)
Definition: bitmapset.c:239
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:510
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:868
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:122
Bitmapset * bms_add_range(Bitmapset *a, int lower, int upper)
Definition: bitmapset.c:1019
#define bms_is_empty(a)
Definition: bitmapset.h:118
#define NameStr(name)
Definition: c.h:746
#define Assert(condition)
Definition: c.h:858
#define OidIsValid(objectId)
Definition: c.h:775
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:955
void hash_seq_term(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1471
HTAB * hash_create(const char *tabname, long nelem, const HASHCTL *info, int flags)
Definition: dynahash.c:352
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1395
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1385
int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...)
Definition: elog.c:1182
int errcode(int sqlerrcode)
Definition: elog.c:859
int errmsg(const char *fmt,...)
Definition: elog.c:1072
#define _(x)
Definition: elog.c:90
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:224
#define ereport(elevel,...)
Definition: elog.h:149
void CheckSubscriptionRelkind(char relkind, const char *nspname, const char *relname)
StrategyNumber get_equal_strategy_number_for_am(Oid am)
@ HASH_FIND
Definition: hsearch.h:113
@ HASH_ENTER
Definition: hsearch.h:114
#define HASH_CONTEXT
Definition: hsearch.h:102
#define HASH_ELEM
Definition: hsearch.h:95
#define HASH_BLOBS
Definition: hsearch.h:97
IndexInfo * BuildIndexInfo(Relation index)
Definition: index.c:2407
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:177
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:133
void CacheRegisterRelcacheCallback(RelcacheCallbackFunction func, Datum arg)
Definition: inval.c:1558
int i
Definition: isn.c:73
int LOCKMODE
Definition: lockdefs.h:26
#define NoLock
Definition: lockdefs.h:34
#define AccessShareLock
Definition: lockdefs.h:36
uint32 LogicalRepRelId
Definition: logicalproto.h:101
struct LogicalRepRelMapEntry LogicalRepRelMapEntry
RangeVar * makeRangeVar(char *schemaname, char *relname, int location)
Definition: makefuncs.c:424
char * pstrdup(const char *in)
Definition: mcxt.c:1695
void pfree(void *pointer)
Definition: mcxt.c:1520
MemoryContext CacheMemoryContext
Definition: mcxt.c:152
void * palloc(Size size)
Definition: mcxt.c:1316
#define AllocSetContextCreate
Definition: memutils.h:129
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:160
#define RangeVarGetRelid(relation, lockmode, missing_ok)
Definition: namespace.h:80
NameData attname
Definition: pg_attribute.h:41
int16 attnum
Definition: pg_attribute.h:74
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:209
void * arg
#define NIL
Definition: pg_list.h:68
#define foreach_oid(var, lst)
Definition: pg_list.h:471
char GetSubscriptionRelState(Oid subid, Oid relid, XLogRecPtr *sublsn)
uintptr_t Datum
Definition: postgres.h:64
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
MemoryContextSwitchTo(old_ctx)
tree ctl
Definition: radixtree.h:1847
tree ctl root
Definition: radixtree.h:1880
#define RelationGetRelid(relation)
Definition: rel.h:505
#define RelationGetDescr(relation)
Definition: rel.h:531
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4760
Oid RelationGetPrimaryKeyIndex(Relation relation)
Definition: relcache.c:4979
Bitmapset * RelationGetIndexAttrBitmap(Relation relation, IndexAttrBitmapKind attrKind)
Definition: relcache.c:5231
Oid RelationGetReplicaIndex(Relation relation)
Definition: relcache.c:5000
@ INDEX_ATTR_BITMAP_PRIMARY_KEY
Definition: relcache.h:62
@ INDEX_ATTR_BITMAP_IDENTITY_KEY
Definition: relcache.h:63
static MemoryContext LogicalRepPartMapContext
Definition: relation.c:49
void logicalrep_partmap_reset_relmap(LogicalRepRelation *remoterel)
Definition: relation.c:540
static void logicalrep_partmap_init(void)
Definition: relation.c:567
static void logicalrep_report_missing_attrs(LogicalRepRelation *remoterel, Bitmapset *missingatts)
Definition: relation.c:226
bool IsIndexUsableForReplicaIdentityFull(IndexInfo *indexInfo, AttrMap *attrmap)
Definition: relation.c:804
static void logicalrep_relmap_free_entry(LogicalRepRelMapEntry *entry)
Definition: relation.c:132
LogicalRepRelMapEntry * logicalrep_partition_open(LogicalRepRelMapEntry *root, Relation partrel, AttrMap *map)
Definition: relation.c:602
struct LogicalRepPartMapEntry LogicalRepPartMapEntry
static void logicalrep_partmap_invalidate_cb(Datum arg, Oid reloid)
Definition: relation.c:492
static HTAB * LogicalRepPartMap
Definition: relation.c:50
static HTAB * LogicalRepRelMap
Definition: relation.c:36
static void logicalrep_rel_mark_updatable(LogicalRepRelMapEntry *entry)
Definition: relation.c:274
static MemoryContext LogicalRepRelMapContext
Definition: relation.c:34
Oid GetRelationIdentityOrPK(Relation rel)
Definition: relation.c:851
void logicalrep_relmap_update(LogicalRepRelation *remoterel)
Definition: relation.c:164
static void logicalrep_relmap_init(void)
Definition: relation.c:105
LogicalRepRelMapEntry * logicalrep_rel_open(LogicalRepRelId remoteid, LOCKMODE lockmode)
Definition: relation.c:327
static int logicalrep_rel_att_by_name(LogicalRepRelation *remoterel, const char *attname)
Definition: relation.c:209
static Oid FindUsableIndexForReplicaIdentityFull(Relation localrel, AttrMap *attrmap)
Definition: relation.c:745
static void logicalrep_relmap_invalidate_cb(Datum arg, Oid reloid)
Definition: relation.c:64
void logicalrep_rel_close(LogicalRepRelMapEntry *rel, LOCKMODE lockmode)
Definition: relation.c:473
static Oid FindLogicalRepLocalIndex(Relation localrel, LogicalRepRelation *remoterel, AttrMap *attrMap)
Definition: relation.c:868
#define InvalidStrategy
Definition: stratnum.h:24
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:97
void initStringInfo(StringInfo str)
Definition: stringinfo.c:59
Definition: attmap.h:35
int maplen
Definition: attmap.h:37
AttrNumber * attnums
Definition: attmap.h:36
Definition: dynahash.c:220
amgettuple_function amgettuple
Definition: amapi.h:282
int ii_NumIndexAttrs
Definition: execnodes.h:184
Oid ii_Am
Definition: execnodes.h:206
AttrNumber ii_IndexAttrNumbers[INDEX_MAX_KEYS]
Definition: execnodes.h:186
List * ii_Predicate
Definition: execnodes.h:189
Definition: pg_list.h:54
LogicalRepRelMapEntry relmapentry
Definition: relation.c:54
LogicalRepRelation remoterel
LogicalRepRelId remoteid
Definition: logicalproto.h:107
Bitmapset * attkeys
Definition: logicalproto.h:115
Form_pg_class rd_rel
Definition: rel.h:111
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
Relation try_table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:60
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92