PostgreSQL Source Code  git master
execReplication.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * execReplication.c
4  * miscellaneous executor routines for logical replication
5  *
6  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  * IDENTIFICATION
10  * src/backend/executor/execReplication.c
11  *
12  *-------------------------------------------------------------------------
13  */
14 
15 #include "postgres.h"
16 
17 #include "access/relscan.h"
18 #include "access/transam.h"
19 #include "access/xact.h"
20 #include "commands/trigger.h"
21 #include "executor/executor.h"
22 #include "nodes/nodeFuncs.h"
23 #include "parser/parse_relation.h"
24 #include "parser/parsetree.h"
25 #include "storage/bufmgr.h"
26 #include "storage/lmgr.h"
27 #include "utils/builtins.h"
28 #include "utils/datum.h"
29 #include "utils/lsyscache.h"
30 #include "utils/memutils.h"
31 #include "utils/rel.h"
32 #include "utils/snapmgr.h"
33 #include "utils/syscache.h"
34 #include "utils/typcache.h"
35 #include "utils/tqual.h"
36 
37 
38 /*
39  * Setup a ScanKey for a search in the relation 'rel' for a tuple 'key' that
40  * is setup to match 'rel' (*NOT* idxrel!).
41  *
42  * Returns whether any column contains NULLs.
43  *
44  * This is not generic routine, it expects the idxrel to be replication
45  * identity of a rel and meet all limitations associated with that.
46  */
47 static bool
49  TupleTableSlot *searchslot)
50 {
51  int attoff;
52  bool isnull;
53  Datum indclassDatum;
54  oidvector *opclass;
55  int2vector *indkey = &idxrel->rd_index->indkey;
56  bool hasnulls = false;
57 
59 
60  indclassDatum = SysCacheGetAttr(INDEXRELID, idxrel->rd_indextuple,
61  Anum_pg_index_indclass, &isnull);
62  Assert(!isnull);
63  opclass = (oidvector *) DatumGetPointer(indclassDatum);
64 
65  /* Build scankey for every attribute in the index. */
66  for (attoff = 0; attoff < RelationGetNumberOfAttributes(idxrel); attoff++)
67  {
68  Oid operator;
69  Oid opfamily;
70  RegProcedure regop;
71  int pkattno = attoff + 1;
72  int mainattno = indkey->values[attoff];
73  Oid optype = get_opclass_input_type(opclass->values[attoff]);
74 
75  /*
76  * Load the operator info. We need this to get the equality operator
77  * function for the scan key.
78  */
79  opfamily = get_opclass_family(opclass->values[attoff]);
80 
81  operator = get_opfamily_member(opfamily, optype,
82  optype,
84  if (!OidIsValid(operator))
85  elog(ERROR, "missing operator %d(%u,%u) in opfamily %u",
86  BTEqualStrategyNumber, optype, optype, opfamily);
87 
88  regop = get_opcode(operator);
89 
90  /* Initialize the scankey. */
91  ScanKeyInit(&skey[attoff],
92  pkattno,
94  regop,
95  searchslot->tts_values[mainattno - 1]);
96 
97  /* Check for null value. */
98  if (searchslot->tts_isnull[mainattno - 1])
99  {
100  hasnulls = true;
101  skey[attoff].sk_flags |= SK_ISNULL;
102  }
103  }
104 
105  return hasnulls;
106 }
107 
108 /*
109  * Search the relation 'rel' for tuple using the index.
110  *
111  * If a matching tuple is found, lock it with lockmode, fill the slot with its
112  * contents, and return true. Return false otherwise.
113  */
114 bool
116  LockTupleMode lockmode,
117  TupleTableSlot *searchslot,
118  TupleTableSlot *outslot)
119 {
120  HeapTuple scantuple;
122  IndexScanDesc scan;
123  SnapshotData snap;
124  TransactionId xwait;
125  Relation idxrel;
126  bool found;
127 
128  /* Open the index. */
129  idxrel = index_open(idxoid, RowExclusiveLock);
130 
131  /* Start an index scan. */
132  InitDirtySnapshot(snap);
133  scan = index_beginscan(rel, idxrel, &snap,
135  0);
136 
137  /* Build scan key. */
138  build_replindex_scan_key(skey, rel, idxrel, searchslot);
139 
140 retry:
141  found = false;
142 
143  index_rescan(scan, skey, RelationGetNumberOfAttributes(idxrel), NULL, 0);
144 
145  /* Try to find the tuple */
146  if ((scantuple = index_getnext(scan, ForwardScanDirection)) != NULL)
147  {
148  found = true;
149  ExecStoreTuple(scantuple, outslot, InvalidBuffer, false);
150  ExecMaterializeSlot(outslot);
151 
152  xwait = TransactionIdIsValid(snap.xmin) ?
153  snap.xmin : snap.xmax;
154 
155  /*
156  * If the tuple is locked, wait for locking transaction to finish and
157  * retry.
158  */
159  if (TransactionIdIsValid(xwait))
160  {
161  XactLockTableWait(xwait, NULL, NULL, XLTW_None);
162  goto retry;
163  }
164  }
165 
166  /* Found tuple, try to lock it in the lockmode. */
167  if (found)
168  {
169  Buffer buf;
171  HTSU_Result res;
172  HeapTupleData locktup;
173 
174  ItemPointerCopy(&outslot->tts_tuple->t_self, &locktup.t_self);
175 
177 
178  res = heap_lock_tuple(rel, &locktup, GetCurrentCommandId(false),
179  lockmode,
181  false /* don't follow updates */ ,
182  &buf, &hufd);
183  /* the tuple slot already has the buffer pinned */
184  ReleaseBuffer(buf);
185 
187 
188  switch (res)
189  {
191  break;
192  case HeapTupleUpdated:
193  /* XXX: Improve handling here */
194  ereport(LOG,
195  (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE),
196  errmsg("concurrent update, retrying")));
197  goto retry;
198  case HeapTupleInvisible:
199  elog(ERROR, "attempted to lock invisible tuple");
200  default:
201  elog(ERROR, "unexpected heap_lock_tuple status: %u", res);
202  break;
203  }
204  }
205 
206  index_endscan(scan);
207 
208  /* Don't release lock until commit. */
209  index_close(idxrel, NoLock);
210 
211  return found;
212 }
213 
214 /*
215  * Compare the tuple and slot and check if they have equal values.
216  *
217  * We use binary datum comparison which might return false negatives but
218  * that's the best we can do here as there may be multiple notions of
219  * equality for the data types and table columns don't specify which one
220  * to use.
221  */
222 static bool
224 {
226  bool isnull[MaxTupleAttributeNumber];
227  int attrnum;
228 
229  heap_deform_tuple(tup, desc, values, isnull);
230 
231  /* Check equality of the attributes. */
232  for (attrnum = 0; attrnum < desc->natts; attrnum++)
233  {
234  Form_pg_attribute att;
235  TypeCacheEntry *typentry;
236 
237  /*
238  * If one value is NULL and other is not, then they are certainly not
239  * equal
240  */
241  if (isnull[attrnum] != slot->tts_isnull[attrnum])
242  return false;
243 
244  /*
245  * If both are NULL, they can be considered equal.
246  */
247  if (isnull[attrnum])
248  continue;
249 
250  att = TupleDescAttr(desc, attrnum);
251 
252  typentry = lookup_type_cache(att->atttypid, TYPECACHE_EQ_OPR_FINFO);
253  if (!OidIsValid(typentry->eq_opr_finfo.fn_oid))
254  ereport(ERROR,
255  (errcode(ERRCODE_UNDEFINED_FUNCTION),
256  errmsg("could not identify an equality operator for type %s",
257  format_type_be(att->atttypid))));
258 
259  if (!DatumGetBool(FunctionCall2(&typentry->eq_opr_finfo,
260  values[attrnum],
261  slot->tts_values[attrnum])))
262  return false;
263  }
264 
265  return true;
266 }
267 
268 /*
269  * Search the relation 'rel' for tuple using the sequential scan.
270  *
271  * If a matching tuple is found, lock it with lockmode, fill the slot with its
272  * contents, and return true. Return false otherwise.
273  *
274  * Note that this stops on the first matching tuple.
275  *
276  * This can obviously be quite slow on tables that have more than few rows.
277  */
278 bool
280  TupleTableSlot *searchslot, TupleTableSlot *outslot)
281 {
282  HeapTuple scantuple;
283  HeapScanDesc scan;
284  SnapshotData snap;
285  TransactionId xwait;
286  bool found;
287  TupleDesc desc = RelationGetDescr(rel);
288 
289  Assert(equalTupleDescs(desc, outslot->tts_tupleDescriptor));
290 
291  /* Start an index scan. */
292  InitDirtySnapshot(snap);
293  scan = heap_beginscan(rel, &snap, 0, NULL);
294 
295 retry:
296  found = false;
297 
298  heap_rescan(scan, NULL);
299 
300  /* Try to find the tuple */
301  while ((scantuple = heap_getnext(scan, ForwardScanDirection)) != NULL)
302  {
303  if (!tuple_equals_slot(desc, scantuple, searchslot))
304  continue;
305 
306  found = true;
307  ExecStoreTuple(scantuple, outslot, InvalidBuffer, false);
308  ExecMaterializeSlot(outslot);
309 
310  xwait = TransactionIdIsValid(snap.xmin) ?
311  snap.xmin : snap.xmax;
312 
313  /*
314  * If the tuple is locked, wait for locking transaction to finish and
315  * retry.
316  */
317  if (TransactionIdIsValid(xwait))
318  {
319  XactLockTableWait(xwait, NULL, NULL, XLTW_None);
320  goto retry;
321  }
322  }
323 
324  /* Found tuple, try to lock it in the lockmode. */
325  if (found)
326  {
327  Buffer buf;
329  HTSU_Result res;
330  HeapTupleData locktup;
331 
332  ItemPointerCopy(&outslot->tts_tuple->t_self, &locktup.t_self);
333 
335 
336  res = heap_lock_tuple(rel, &locktup, GetCurrentCommandId(false),
337  lockmode,
339  false /* don't follow updates */ ,
340  &buf, &hufd);
341  /* the tuple slot already has the buffer pinned */
342  ReleaseBuffer(buf);
343 
345 
346  switch (res)
347  {
349  break;
350  case HeapTupleUpdated:
351  /* XXX: Improve handling here */
352  ereport(LOG,
353  (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE),
354  errmsg("concurrent update, retrying")));
355  goto retry;
356  case HeapTupleInvisible:
357  elog(ERROR, "attempted to lock invisible tuple");
358  default:
359  elog(ERROR, "unexpected heap_lock_tuple status: %u", res);
360  break;
361  }
362  }
363 
364  heap_endscan(scan);
365 
366  return found;
367 }
368 
369 /*
370  * Insert tuple represented in the slot to the relation, update the indexes,
371  * and execute any constraints and per-row triggers.
372  *
373  * Caller is responsible for opening the indexes.
374  */
375 void
377 {
378  bool skip_tuple = false;
379  HeapTuple tuple;
380  ResultRelInfo *resultRelInfo = estate->es_result_relation_info;
381  Relation rel = resultRelInfo->ri_RelationDesc;
382 
383  /* For now we support only tables. */
384  Assert(rel->rd_rel->relkind == RELKIND_RELATION);
385 
387 
388  /* BEFORE ROW INSERT Triggers */
389  if (resultRelInfo->ri_TrigDesc &&
390  resultRelInfo->ri_TrigDesc->trig_insert_before_row)
391  {
392  slot = ExecBRInsertTriggers(estate, resultRelInfo, slot);
393 
394  if (slot == NULL) /* "do nothing" */
395  skip_tuple = true;
396  }
397 
398  if (!skip_tuple)
399  {
400  List *recheckIndexes = NIL;
401 
402  /* Check the constraints of the tuple */
403  if (rel->rd_att->constr)
404  ExecConstraints(resultRelInfo, slot, estate);
405 
406  /* Store the slot into tuple that we can inspect. */
407  tuple = ExecMaterializeSlot(slot);
408 
409  /* OK, store the tuple and create index entries for it */
410  simple_heap_insert(rel, tuple);
411 
412  if (resultRelInfo->ri_NumIndices > 0)
413  recheckIndexes = ExecInsertIndexTuples(slot, &(tuple->t_self),
414  estate, false, NULL,
415  NIL);
416 
417  /* AFTER ROW INSERT Triggers */
418  ExecARInsertTriggers(estate, resultRelInfo, tuple,
419  recheckIndexes, NULL);
420 
421  /*
422  * XXX we should in theory pass a TransitionCaptureState object to the
423  * above to capture transition tuples, but after statement triggers
424  * don't actually get fired by replication yet anyway
425  */
426 
427  list_free(recheckIndexes);
428  }
429 }
430 
431 /*
432  * Find the searchslot tuple and update it with data in the slot,
433  * update the indexes, and execute any constraints and per-row triggers.
434  *
435  * Caller is responsible for opening the indexes.
436  */
437 void
439  TupleTableSlot *searchslot, TupleTableSlot *slot)
440 {
441  bool skip_tuple = false;
442  HeapTuple tuple;
443  ResultRelInfo *resultRelInfo = estate->es_result_relation_info;
444  Relation rel = resultRelInfo->ri_RelationDesc;
445 
446  /* For now we support only tables. */
447  Assert(rel->rd_rel->relkind == RELKIND_RELATION);
448 
450 
451  /* BEFORE ROW UPDATE Triggers */
452  if (resultRelInfo->ri_TrigDesc &&
453  resultRelInfo->ri_TrigDesc->trig_update_before_row)
454  {
455  slot = ExecBRUpdateTriggers(estate, epqstate, resultRelInfo,
456  &searchslot->tts_tuple->t_self,
457  NULL, slot);
458 
459  if (slot == NULL) /* "do nothing" */
460  skip_tuple = true;
461  }
462 
463  if (!skip_tuple)
464  {
465  List *recheckIndexes = NIL;
466 
467  /* Check the constraints of the tuple */
468  if (rel->rd_att->constr)
469  ExecConstraints(resultRelInfo, slot, estate);
470 
471  /* Store the slot into tuple that we can write. */
472  tuple = ExecMaterializeSlot(slot);
473 
474  /* OK, update the tuple and index entries for it */
475  simple_heap_update(rel, &searchslot->tts_tuple->t_self,
476  slot->tts_tuple);
477 
478  if (resultRelInfo->ri_NumIndices > 0 &&
480  recheckIndexes = ExecInsertIndexTuples(slot, &(tuple->t_self),
481  estate, false, NULL,
482  NIL);
483 
484  /* AFTER ROW UPDATE Triggers */
485  ExecARUpdateTriggers(estate, resultRelInfo,
486  &searchslot->tts_tuple->t_self,
487  NULL, tuple, recheckIndexes, NULL);
488 
489  list_free(recheckIndexes);
490  }
491 }
492 
493 /*
494  * Find the searchslot tuple and delete it, and execute any constraints
495  * and per-row triggers.
496  *
497  * Caller is responsible for opening the indexes.
498  */
499 void
501  TupleTableSlot *searchslot)
502 {
503  bool skip_tuple = false;
504  ResultRelInfo *resultRelInfo = estate->es_result_relation_info;
505  Relation rel = resultRelInfo->ri_RelationDesc;
506 
507  /* For now we support only tables. */
508  Assert(rel->rd_rel->relkind == RELKIND_RELATION);
509 
511 
512  /* BEFORE ROW DELETE Triggers */
513  if (resultRelInfo->ri_TrigDesc &&
514  resultRelInfo->ri_TrigDesc->trig_delete_before_row)
515  {
516  skip_tuple = !ExecBRDeleteTriggers(estate, epqstate, resultRelInfo,
517  &searchslot->tts_tuple->t_self,
518  NULL);
519  }
520 
521  if (!skip_tuple)
522  {
523  List *recheckIndexes = NIL;
524 
525  /* OK, delete the tuple */
526  simple_heap_delete(rel, &searchslot->tts_tuple->t_self);
527 
528  /* AFTER ROW DELETE Triggers */
529  ExecARDeleteTriggers(estate, resultRelInfo,
530  &searchslot->tts_tuple->t_self, NULL, NULL);
531 
532  list_free(recheckIndexes);
533  }
534 }
535 
536 /*
537  * Check if command can be executed with current replica identity.
538  */
539 void
541 {
542  PublicationActions *pubactions;
543 
544  /* We only need to do checks for UPDATE and DELETE. */
545  if (cmd != CMD_UPDATE && cmd != CMD_DELETE)
546  return;
547 
548  /* If relation has replica identity we are always good. */
549  if (rel->rd_rel->relreplident == REPLICA_IDENTITY_FULL ||
551  return;
552 
553  /*
554  * This is either UPDATE OR DELETE and there is no replica identity.
555  *
556  * Check if the table publishes UPDATES or DELETES.
557  */
558  pubactions = GetRelationPublicationActions(rel);
559  if (cmd == CMD_UPDATE && pubactions->pubupdate)
560  ereport(ERROR,
561  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
562  errmsg("cannot update table \"%s\" because it does not have a replica identity and publishes updates",
564  errhint("To enable updating the table, set REPLICA IDENTITY using ALTER TABLE.")));
565  else if (cmd == CMD_DELETE && pubactions->pubdelete)
566  ereport(ERROR,
567  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
568  errmsg("cannot delete from table \"%s\" because it does not have a replica identity and publishes deletes",
570  errhint("To enable deleting from the table, set REPLICA IDENTITY using ALTER TABLE.")));
571 }
572 
573 
574 /*
575  * Check if we support writing into specific relkind.
576  *
577  * The nspname and relname are only needed for error reporting.
578  */
579 void
580 CheckSubscriptionRelkind(char relkind, const char *nspname,
581  const char *relname)
582 {
583  /*
584  * We currently only support writing to regular tables.
585  */
586  if (relkind != RELKIND_RELATION)
587  ereport(ERROR,
588  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
589  errmsg("logical replication target relation \"%s.%s\" is not a table",
590  nspname, relname)));
591 }
void ExecSimpleRelationInsert(EState *estate, TupleTableSlot *slot)
int ri_NumIndices
Definition: execnodes.h:358
#define NIL
Definition: pg_list.h:69
Definition: c.h:526
TupleTableSlot * ExecStoreTuple(HeapTuple tuple, TupleTableSlot *slot, Buffer buffer, bool shouldFree)
Definition: execTuples.c:320
Relation ri_RelationDesc
Definition: execnodes.h:355
int errhint(const char *fmt,...)
Definition: elog.c:987
void heap_endscan(HeapScanDesc scan)
Definition: heapam.c:1565
Oid RelationGetReplicaIndex(Relation relation)
Definition: relcache.c:4691
List * ExecInsertIndexTuples(TupleTableSlot *slot, ItemPointer tupleid, EState *estate, bool noDupErr, bool *specConflict, List *arbiterIndexes)
Definition: execIndexing.c:271
uint32 TransactionId
Definition: c.h:445
#define MaxTupleAttributeNumber
Definition: htup_details.h:33
#define RelationGetDescr(relation)
Definition: rel.h:437
HTSU_Result heap_lock_tuple(Relation relation, HeapTuple tuple, CommandId cid, LockTupleMode mode, LockWaitPolicy wait_policy, bool follow_updates, Buffer *buffer, HeapUpdateFailureData *hufd)
Definition: heapam.c:4560
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:431
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:90
#define TYPECACHE_EQ_OPR_FINFO
Definition: typcache.h:129
regproc RegProcedure
Definition: c.h:443
TupleTableSlot * ExecBRUpdateTriggers(EState *estate, EPQState *epqstate, ResultRelInfo *relinfo, ItemPointer tupleid, HeapTuple fdw_trigtuple, TupleTableSlot *slot)
Definition: trigger.c:2724
void ExecConstraints(ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate)
Definition: execMain.c:1941
#define FunctionCall2(flinfo, arg1, arg2)
Definition: fmgr.h:605
#define Anum_pg_index_indclass
Definition: pg_index.h:89
#define InvalidBuffer
Definition: buf.h:25
void index_rescan(IndexScanDesc scan, ScanKey keys, int nkeys, ScanKey orderbys, int norderbys)
Definition: indexam.c:310
int errcode(int sqlerrcode)
Definition: elog.c:575
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
void ExecARInsertTriggers(EState *estate, ResultRelInfo *relinfo, HeapTuple trigtuple, List *recheckIndexes, TransitionCaptureState *transition_capture)
Definition: trigger.c:2354
Datum * tts_values
Definition: tuptable.h:125
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
void PopActiveSnapshot(void)
Definition: snapmgr.c:812
#define LOG
Definition: elog.h:26
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:576
bool RelationFindReplTupleByIndex(Relation rel, Oid idxoid, LockTupleMode lockmode, TupleTableSlot *searchslot, TupleTableSlot *outslot)
int natts
Definition: tupdesc.h:79
struct HeapTupleData * rd_indextuple
Definition: rel.h:161
static bool tuple_equals_slot(TupleDesc desc, HeapTuple tup, TupleTableSlot *slot)
void ExecARDeleteTriggers(EState *estate, ResultRelInfo *relinfo, ItemPointer tupleid, HeapTuple fdw_trigtuple, TransitionCaptureState *transition_capture)
Definition: trigger.c:2572
LockTupleMode
Definition: heapam.h:38
Form_pg_index rd_index
Definition: rel.h:159
#define REPLICA_IDENTITY_FULL
Definition: pg_class.h:179
#define ERROR
Definition: elog.h:43
Definition: lmgr.h:26
#define InitDirtySnapshot(snapshotdata)
Definition: tqual.h:103
ItemPointerData t_self
Definition: htup.h:65
#define NoLock
Definition: lockdefs.h:34
static char * buf
Definition: pg_test_fsync.c:67
void PushActiveSnapshot(Snapshot snap)
Definition: snapmgr.c:733
bool * tts_isnull
Definition: tuptable.h:126
void ExecSimpleRelationDelete(EState *estate, EPQState *epqstate, TupleTableSlot *searchslot)
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:534
#define RowExclusiveLock
Definition: lockdefs.h:38
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:163
#define DatumGetBool(X)
Definition: postgres.h:399
bool trig_update_before_row
Definition: reltrigger.h:60
void heap_rescan(HeapScanDesc scan, ScanKey key)
Definition: heapam.c:1521
HTSU_Result
Definition: snapshot.h:121
#define RelationGetRelationName(relation)
Definition: rel.h:445
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
TransactionId xmax
Definition: snapshot.h:69
void CheckSubscriptionRelkind(char relkind, const char *nspname, const char *relname)
TransactionId xmin
Definition: snapshot.h:68
void CheckCmdReplicaIdentity(Relation rel, CmdType cmd)
void index_endscan(IndexScanDesc scan)
Definition: indexam.c:340
#define SK_ISNULL
Definition: skey.h:115
#define ereport(elevel, rest)
Definition: elog.h:122
TriggerDesc * ri_TrigDesc
Definition: execnodes.h:367
void ExecARUpdateTriggers(EState *estate, ResultRelInfo *relinfo, ItemPointer tupleid, HeapTuple fdw_trigtuple, HeapTuple newtuple, List *recheckIndexes, TransitionCaptureState *transition_capture)
Definition: trigger.c:2841
TupleDesc tts_tupleDescriptor
Definition: tuptable.h:121
Definition: c.h:515
bool trig_insert_before_row
Definition: reltrigger.h:55
uintptr_t Datum
Definition: postgres.h:372
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:1368
Oid simple_heap_insert(Relation relation, HeapTuple tup)
Definition: heapam.c:2958
HeapTuple heap_getnext(HeapScanDesc scan, ScanDirection direction)
Definition: heapam.c:1808
TupleDesc rd_att
Definition: rel.h:115
FmgrInfo eq_opr_finfo
Definition: typcache.h:71
TypeCacheEntry * lookup_type_cache(Oid type_id, int flags)
Definition: typcache.c:311
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1094
Oid fn_oid
Definition: fmgr.h:59
struct PublicationActions * GetRelationPublicationActions(Relation relation)
Definition: relcache.c:5187
bool ExecBRDeleteTriggers(EState *estate, EPQState *epqstate, ResultRelInfo *relinfo, ItemPointer tupleid, HeapTuple fdw_trigtuple)
Definition: trigger.c:2503
int sk_flags
Definition: skey.h:66
void XactLockTableWait(TransactionId xid, Relation rel, ItemPointer ctid, XLTW_Oper oper)
Definition: lmgr.c:554
#define HeapTupleIsHeapOnly(tuple)
Definition: htup_details.h:691
#define Assert(condition)
Definition: c.h:670
TupleConstr * constr
Definition: tupdesc.h:84
#define INDEX_MAX_KEYS
void simple_heap_delete(Relation relation, ItemPointer tid)
Definition: heapam.c:3417
void simple_heap_update(Relation relation, ItemPointer otid, HeapTuple tup)
Definition: heapam.c:4471
HeapTuple ExecMaterializeSlot(TupleTableSlot *slot)
Definition: execTuples.c:725
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:523
Oid get_opclass_family(Oid opclass)
Definition: lsyscache.c:1047
Snapshot GetLatestSnapshot(void)
Definition: snapmgr.c:379
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
#define DatumGetPointer(X)
Definition: postgres.h:555
void heap_deform_tuple(HeapTuple tuple, TupleDesc tupleDesc, Datum *values, bool *isnull)
Definition: heaptuple.c:936
static Datum values[MAXATTR]
Definition: bootstrap.c:164
int errmsg(const char *fmt,...)
Definition: elog.c:797
void list_free(List *list)
Definition: list.c:1133
bool RelationFindReplTupleSeq(Relation rel, LockTupleMode lockmode, TupleTableSlot *searchslot, TupleTableSlot *outslot)
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
bool equalTupleDescs(TupleDesc tupdesc1, TupleDesc tupdesc2)
Definition: tupdesc.c:337
TupleTableSlot * ExecBRInsertTriggers(EState *estate, ResultRelInfo *relinfo, TupleTableSlot *slot)
Definition: trigger.c:2288
HeapTuple tts_tuple
Definition: tuptable.h:120
CommandId GetCurrentCommandId(bool used)
Definition: xact.c:680
#define elog
Definition: elog.h:219
#define TransactionIdIsValid(xid)
Definition: transam.h:41
#define RELKIND_RELATION
Definition: pg_class.h:160
Definition: pg_list.h:45
HeapScanDesc heap_beginscan(Relation relation, Snapshot snapshot, int nkeys, ScanKey key)
Definition: heapam.c:1397
int Buffer
Definition: buf.h:23
static bool build_replindex_scan_key(ScanKey skey, Relation rel, Relation idxrel, TupleTableSlot *searchslot)
#define RelationGetRelid(relation)
Definition: rel.h:425
CmdType
Definition: nodes.h:652
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:151
#define BTEqualStrategyNumber
Definition: stratnum.h:31
void ExecSimpleRelationUpdate(EState *estate, EPQState *epqstate, TupleTableSlot *searchslot, TupleTableSlot *slot)
HeapTuple index_getnext(IndexScanDesc scan, ScanDirection direction)
Definition: indexam.c:659
IndexScanDesc index_beginscan(Relation heapRelation, Relation indexRelation, Snapshot snapshot, int nkeys, int norderbys)
Definition: indexam.c:221
#define ItemPointerCopy(fromPointer, toPointer)
Definition: itemptr.h:139
bool trig_delete_before_row
Definition: reltrigger.h:65
Oid get_opclass_input_type(Oid opclass)
Definition: lsyscache.c:1069
ResultRelInfo * es_result_relation_info
Definition: execnodes.h:444