PostgreSQL Source Code git master
Loading...
Searching...
No Matches
sequencesync.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 * sequencesync.c
3 * PostgreSQL logical replication: sequence synchronization
4 *
5 * Copyright (c) 2025-2026, PostgreSQL Global Development Group
6 *
7 * IDENTIFICATION
8 * src/backend/replication/logical/sequencesync.c
9 *
10 * NOTES
11 * This file contains code for sequence synchronization for
12 * logical replication.
13 *
14 * Sequences requiring synchronization are tracked in the pg_subscription_rel
15 * catalog.
16 *
17 * Sequences to be synchronized will be added with state INIT when either of
18 * the following commands is executed:
19 * CREATE SUBSCRIPTION
20 * ALTER SUBSCRIPTION ... REFRESH PUBLICATION
21 *
22 * Executing the following command resets all sequences in the subscription to
23 * state INIT, triggering re-synchronization:
24 * ALTER SUBSCRIPTION ... REFRESH SEQUENCES
25 *
26 * The apply worker periodically scans pg_subscription_rel for sequences in
27 * INIT state. When such sequences are found, it spawns a sequencesync worker
28 * to handle synchronization.
29 *
30 * A single sequencesync worker is responsible for synchronizing all sequences.
31 * It begins by retrieving the list of sequences that are flagged for
32 * synchronization, i.e., those in the INIT state. These sequences are then
33 * processed in batches, allowing multiple entries to be synchronized within a
34 * single transaction. The worker fetches the current sequence values and page
35 * LSNs from the remote publisher, updates the corresponding sequences on the
36 * local subscriber, and finally marks each sequence as READY upon successful
37 * synchronization.
38 *
39 * Sequence state transitions follow this pattern:
40 * INIT -> READY
41 *
42 * To avoid creating too many transactions, up to MAX_SEQUENCES_SYNC_PER_BATCH
43 * sequences are synchronized per transaction. The locks on the sequence
44 * relation will be periodically released at each transaction commit.
45 *
46 * XXX: We didn't choose launcher process to maintain the launch of sequencesync
47 * worker as it didn't have database connection to access the sequences from the
48 * pg_subscription_rel system catalog that need to be synchronized.
49 *-------------------------------------------------------------------------
50 */
51
52#include "postgres.h"
53
54#include "access/genam.h"
55#include "access/table.h"
56#include "catalog/pg_sequence.h"
58#include "commands/sequence.h"
59#include "pgstat.h"
63#include "storage/lwlock.h"
64#include "utils/acl.h"
65#include "utils/builtins.h"
66#include "utils/fmgroids.h"
67#include "utils/guc.h"
68#include "utils/inval.h"
69#include "utils/lsyscache.h"
70#include "utils/memutils.h"
71#include "utils/pg_lsn.h"
72#include "utils/syscache.h"
73#include "utils/usercontext.h"
74
75#define REMOTE_SEQ_COL_COUNT 10
76
84
85static List *seqinfos = NIL;
86
87/*
88 * Apply worker determines if sequence synchronization is needed.
89 *
90 * Start a sequencesync worker if one is not already running. The active
91 * sequencesync worker will handle all pending sequence synchronization. If any
92 * sequences remain unsynchronized after it exits, a new worker can be started
93 * in the next iteration.
94 */
95void
97{
99 int nsyncworkers;
101 bool started_tx;
102
104
105 if (started_tx)
106 {
108 pgstat_report_stat(true);
109 }
110
112 return;
113
115
116 /* Check if there is a sequencesync worker already running? */
119 InvalidOid, true);
121 {
123 return;
124 }
125
126 /*
127 * Count running sync workers for this subscription, while we have the
128 * lock.
129 */
132
133 /*
134 * It is okay to read/update last_seqsync_start_time here in apply worker
135 * as we have already ensured that sync worker doesn't exist.
136 */
139}
140
141/*
142 * get_sequences_string
143 *
144 * Build a comma-separated string of schema-qualified sequence names
145 * for the given list of sequence indexes.
146 */
147static void
149{
152 {
155
156 if (buf->len > 0)
158
159 appendStringInfo(buf, "\"%s.%s\"", seqinfo->nspname, seqinfo->seqname);
160 }
161}
162
163/*
164 * report_sequence_errors
165 *
166 * Report discrepancies found during sequence synchronization between
167 * the publisher and subscriber. Emits warnings for:
168 * a) mismatched definitions or concurrent rename
169 * b) insufficient privileges
170 * c) missing sequences on the subscriber
171 * Then raises an ERROR to indicate synchronization failure.
172 */
173static void
176{
178
179 /* Quick exit if there are no errors to report */
181 return;
182
184
186 {
190 errmsg_plural("mismatched or renamed sequence on subscriber (%s)",
191 "mismatched or renamed sequences on subscriber (%s)",
193 seqstr->data));
194 }
195
197 {
201 errmsg_plural("insufficient privileges on sequence (%s)",
202 "insufficient privileges on sequences (%s)",
204 seqstr->data));
205 }
206
208 {
212 errmsg_plural("missing sequence on publisher (%s)",
213 "missing sequences on publisher (%s)",
215 seqstr->data));
216 }
217
220 errmsg("logical replication sequence synchronization failed for subscription \"%s\"",
222}
223
224/*
225 * get_and_validate_seq_info
226 *
227 * Extracts remote sequence information from the tuple slot received from the
228 * publisher, and validates it against the corresponding local sequence
229 * definition.
230 */
231static CopySeqResult
234{
235 bool isnull;
236 int col = 0;
237 Datum datum;
243 bool remote_cycle;
248
249 *seqidx = DatumGetInt32(slot_getattr(slot, ++col, &isnull));
250 Assert(!isnull);
251
252 /* Identify the corresponding local sequence for the given index. */
255
256 /*
257 * last_value can be NULL if the sequence was dropped concurrently (see
258 * pg_get_sequence_data()).
259 */
260 datum = slot_getattr(slot, ++col, &isnull);
261 if (isnull)
262 return COPYSEQ_SKIPPED;
263 seqinfo_local->last_value = DatumGetInt64(datum);
264
265 seqinfo_local->is_called = DatumGetBool(slot_getattr(slot, ++col, &isnull));
266 Assert(!isnull);
267
268 seqinfo_local->page_lsn = DatumGetLSN(slot_getattr(slot, ++col, &isnull));
269 Assert(!isnull);
270
271 remote_typid = DatumGetObjectId(slot_getattr(slot, ++col, &isnull));
272 Assert(!isnull);
273
274 remote_start = DatumGetInt64(slot_getattr(slot, ++col, &isnull));
275 Assert(!isnull);
276
277 remote_increment = DatumGetInt64(slot_getattr(slot, ++col, &isnull));
278 Assert(!isnull);
279
280 remote_min = DatumGetInt64(slot_getattr(slot, ++col, &isnull));
281 Assert(!isnull);
282
283 remote_max = DatumGetInt64(slot_getattr(slot, ++col, &isnull));
284 Assert(!isnull);
285
286 remote_cycle = DatumGetBool(slot_getattr(slot, ++col, &isnull));
287 Assert(!isnull);
288
289 /* Sanity check */
291
292 seqinfo_local->found_on_pub = true;
293
295
296 /* Sequence was concurrently dropped? */
297 if (!*sequence_rel)
298 return COPYSEQ_SKIPPED;
299
301
302 /* Sequence was concurrently dropped? */
303 if (!HeapTupleIsValid(tup))
304 elog(ERROR, "cache lookup failed for sequence %u",
305 seqinfo_local->localrelid);
306
308
309 /* Sequence parameters for remote/local are the same? */
310 if (local_seq->seqtypid != remote_typid ||
311 local_seq->seqstart != remote_start ||
312 local_seq->seqincrement != remote_increment ||
313 local_seq->seqmin != remote_min ||
314 local_seq->seqmax != remote_max ||
315 local_seq->seqcycle != remote_cycle)
317
318 /* Sequence was concurrently renamed? */
319 if (strcmp(seqinfo_local->nspname,
323
325 return result;
326}
327
328/*
329 * Apply remote sequence state to local sequence and mark it as
330 * synchronized (READY).
331 */
332static CopySeqResult
334{
338 Oid seqoid = seqinfo->localrelid;
339
340 /*
341 * If the user did not opt to run as the owner of the subscription
342 * ('run_as_owner'), then copy the sequence as the owner of the sequence.
343 */
344 if (!run_as_owner)
346
348
349 if (aclresult != ACLCHECK_OK)
350 {
351 if (!run_as_owner)
353
355 }
356
357 /*
358 * The log counter (log_cnt) tracks how many sequence values are still
359 * unused locally. It is only relevant to the local node and managed
360 * internally by nextval() when allocating new ranges. Since log_cnt does
361 * not affect the visible sequence state (like last_value or is_called)
362 * and is only used for local caching, it need not be copied to the
363 * subscriber during synchronization.
364 */
365 SetSequence(seqoid, seqinfo->last_value, seqinfo->is_called);
366
367 if (!run_as_owner)
369
370 /*
371 * Record the remote sequence's LSN in pg_subscription_rel and mark the
372 * sequence as READY.
373 */
375 seqinfo->page_lsn, false);
376
377 return COPYSEQ_SUCCESS;
378}
379
380/*
381 * Copy existing data of sequences from the publisher.
382 */
383static void
385{
386 int cur_batch_base_index = 0;
394
395#define MAX_SEQUENCES_SYNC_PER_BATCH 100
396
397 elog(DEBUG1,
398 "logical replication sequence synchronization for subscription \"%s\" - total unsynchronized: %d",
400
402 {
405 int batch_size = 0;
406 int batch_succeeded_count = 0;
408 int batch_skipped_count = 0;
412
413 WalRcvExecResult *res;
414 TupleTableSlot *slot;
415
417
418 for (int idx = cur_batch_base_index; idx < n_seqinfos; idx++)
419 {
420 char *nspname_literal;
421 char *seqname_literal;
422
425
426 if (seqstr->len > 0)
428
431
432 appendStringInfo(seqstr, "(%s, %s, %d)",
434
435 if (++batch_size == MAX_SEQUENCES_SYNC_PER_BATCH)
436 break;
437 }
438
439 /*
440 * We deliberately avoid acquiring a local lock on the sequence before
441 * querying the publisher to prevent potential distributed deadlocks
442 * in bi-directional replication setups.
443 *
444 * Example scenario:
445 *
446 * - On each node, a background worker acquires a lock on a sequence
447 * as part of a sync operation.
448 *
449 * - Concurrently, a user transaction attempts to alter the same
450 * sequence, waiting on the background worker's lock.
451 *
452 * - Meanwhile, a query from the other node tries to access metadata
453 * that depends on the completion of the alter operation.
454 *
455 * - This creates a circular wait across nodes:
456 *
457 * Node-1: Query -> waits on Alter -> waits on Sync Worker
458 *
459 * Node-2: Query -> waits on Alter -> waits on Sync Worker
460 *
461 * Since each node only sees part of the wait graph, the deadlock may
462 * go undetected, leading to indefinite blocking.
463 *
464 * Note: Each entry in VALUES includes an index 'seqidx' that
465 * represents the sequence's position in the local 'seqinfos' list.
466 * This index is propagated to the query results and later used to
467 * directly map the fetched publisher sequence rows back to their
468 * corresponding local entries without relying on result order or name
469 * matching.
470 */
472 "SELECT s.seqidx, ps.*, seq.seqtypid,\n"
473 " seq.seqstart, seq.seqincrement, seq.seqmin,\n"
474 " seq.seqmax, seq.seqcycle\n"
475 "FROM ( VALUES %s ) AS s (schname, seqname, seqidx)\n"
476 "JOIN pg_namespace n ON n.nspname = s.schname\n"
477 "JOIN pg_class c ON c.relnamespace = n.oid AND c.relname = s.seqname\n"
478 "JOIN pg_sequence seq ON seq.seqrelid = c.oid\n"
479 "JOIN LATERAL pg_get_sequence_data(seq.seqrelid) AS ps ON true\n",
480 seqstr->data);
481
482 res = walrcv_exec(conn, cmd->data, lengthof(seqRow), seqRow);
483 if (res->status != WALRCV_OK_TUPLES)
486 errmsg("could not fetch sequence information from the publisher: %s",
487 res->err));
488
490 while (tuplestore_gettupleslot(res->tuplestore, true, false, slot))
491 {
494 int seqidx;
495
497
499 {
500 ConfigReloadPending = false;
502 }
503
505 &seqinfo, &seqidx);
508 sequence_rel->rd_rel->relowner);
509
510 switch (sync_status)
511 {
512 case COPYSEQ_SUCCESS:
513 elog(DEBUG1,
514 "logical replication synchronization for subscription \"%s\", sequence \"%s.%s\" has finished",
515 MySubscription->name, seqinfo->nspname,
516 seqinfo->seqname);
518 break;
519 case COPYSEQ_MISMATCH:
520
521 /*
522 * Remember mismatched sequences in a long-lived memory
523 * context since these will be used after the transaction
524 * is committed.
525 */
528 seqidx);
531 break;
533
534 /*
535 * Remember sequences with insufficient privileges in a
536 * long-lived memory context since these will be used
537 * after the transaction is committed.
538 */
541 seqidx);
544 break;
545 case COPYSEQ_SKIPPED:
546
547 /*
548 * Concurrent removal of a sequence on the subscriber is
549 * treated as success, since the only viable action is to
550 * skip the corresponding sequence data. Missing sequences
551 * on the publisher are treated as ERROR.
552 */
553 if (seqinfo->found_on_pub)
554 {
555 ereport(LOG,
556 errmsg("skip synchronization of sequence \"%s.%s\" because it has been dropped concurrently",
557 seqinfo->nspname,
558 seqinfo->seqname));
560 }
561 break;
562 }
563
564 if (sequence_rel)
566 }
567
571 resetStringInfo(cmd);
572
577
578 elog(DEBUG1,
579 "logical replication sequence synchronization for subscription \"%s\" - batch #%d = %d attempted, %d succeeded, %d mismatched, %d insufficient permission, %d missing from publisher, %d skipped",
584
585 /* Commit this batch, and prepare for next batch */
587
589 {
590 for (int idx = cur_batch_base_index; idx < cur_batch_base_index + batch_size; idx++)
591 {
594
595 /* If the sequence was not found on publisher, record it */
596 if (!seqinfo->found_on_pub)
598 }
599 }
600
601 /*
602 * cur_batch_base_index is not incremented sequentially because some
603 * sequences may be missing, and the number of fetched rows may not
604 * match the batch size.
605 */
606 cur_batch_base_index += batch_size;
607 }
608
609 /* Report mismatches, permission issues, or missing sequences */
612}
613
614/*
615 * Identifies sequences that require synchronization and initiates the
616 * synchronization process.
617 */
618static void
620{
621 char *err;
623 Relation rel;
625 ScanKeyData skey[2];
626 SysScanDesc scan;
629
631
633
634 ScanKeyInit(&skey[0],
637 ObjectIdGetDatum(subid));
638
639 ScanKeyInit(&skey[1],
643
644 scan = systable_beginscan(rel, InvalidOid, false,
645 NULL, 2, skey);
646 while (HeapTupleIsValid(tup = systable_getnext(scan)))
647 {
652
654
656
658
659 /* Skip if sequence was dropped concurrently */
660 if (!sequence_rel)
661 continue;
662
663 /* Skip if the relation is not a sequence */
664 if (sequence_rel->rd_rel->relkind != RELKIND_SEQUENCE)
665 {
667 continue;
668 }
669
670 /*
671 * Worker needs to process sequences across transaction boundary, so
672 * allocate them under long-lived context.
673 */
675
677 seq->localrelid = subrel->srrelid;
681
683
685 }
686
687 /* Cleanup */
688 systable_endscan(scan);
690
692
693 /*
694 * Exit early if no catalog entries found, likely due to concurrent drops.
695 */
696 if (!seqinfos)
697 return;
698
699 /* Is the use of a password mandatory? */
702
704 appendStringInfo(&app_name, "pg_%u_sequence_sync_" UINT64_FORMAT,
706
707 /*
708 * Establish the connection to the publisher for sequence synchronization.
709 */
713 app_name.data, &err);
717 errmsg("sequencesync worker for subscription \"%s\" could not connect to the publisher: %s",
719
720 pfree(app_name.data);
721
723}
724
725/*
726 * Execute the initial sync with error handling. Disable the subscription,
727 * if required.
728 *
729 * Note that we don't handle FATAL errors which are probably because of system
730 * resource error and are not repeatable.
731 */
732static void
734{
736
737 PG_TRY();
738 {
739 /* Call initial sync. */
741 }
742 PG_CATCH();
743 {
746 else
747 {
748 /*
749 * Report the worker failed during sequence synchronization. Abort
750 * the current transaction so that the stats message is sent in an
751 * idle state.
752 */
755
756 PG_RE_THROW();
757 }
758 }
759 PG_END_TRY();
760}
761
762/* Logical Replication sequencesync worker entry point */
763void
Datum idx(PG_FUNCTION_ARGS)
Definition _int_op.c:262
AclResult
Definition acl.h:183
@ ACLCHECK_OK
Definition acl.h:184
AclResult pg_class_aclcheck(Oid table_oid, Oid roleid, AclMode mode)
Definition aclchk.c:4082
void DisableSubscriptionAndExit(void)
Definition worker.c:6007
MemoryContext ApplyContext
Definition worker.c:477
void SetupApplyOrSyncWorker(int worker_slot)
Definition worker.c:5947
WalReceiverConn * LogRepWorkerWalRcvConn
Definition worker.c:482
Subscription * MySubscription
Definition worker.c:484
#define Assert(condition)
Definition c.h:943
int64_t int64
Definition c.h:621
#define UINT64_FORMAT
Definition c.h:635
#define lengthof(array)
Definition c.h:873
uint32 result
void SetSequence(Oid relid, int64 next, bool iscalled)
Definition sequence.c:946
int errcode(int sqlerrcode)
Definition elog.c:874
#define LOG
Definition elog.h:32
#define PG_RE_THROW()
Definition elog.h:407
#define PG_TRY(...)
Definition elog.h:374
#define WARNING
Definition elog.h:37
int int int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...) pg_attribute_printf(1
#define PG_END_TRY(...)
Definition elog.h:399
#define DEBUG1
Definition elog.h:31
#define ERROR
Definition elog.h:40
#define PG_CATCH(...)
Definition elog.h:384
#define elog(elevel,...)
Definition elog.h:228
#define ereport(elevel,...)
Definition elog.h:152
void err(int eval, const char *fmt,...)
Definition err.c:43
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc, const TupleTableSlotOps *tts_ops)
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
const TupleTableSlotOps TTSOpsMinimalTuple
Definition execTuples.c:86
#define palloc0_object(type)
Definition fe_memutils.h:75
void systable_endscan(SysScanDesc sysscan)
Definition genam.c:612
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition genam.c:523
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition genam.c:388
void ProcessConfigFile(GucContext context)
Definition guc-file.l:120
@ PGC_SIGHUP
Definition guc.h:75
#define HeapTupleIsValid(tuple)
Definition htup.h:78
static void * GETSTRUCT(const HeapTupleData *tuple)
volatile sig_atomic_t ConfigReloadPending
Definition interrupt.c:27
LogicalRepWorker * logicalrep_worker_find(LogicalRepWorkerType wtype, Oid subid, Oid relid, bool only_running)
Definition launcher.c:268
LogicalRepWorker * MyLogicalRepWorker
Definition launcher.c:58
int logicalrep_sync_worker_count(Oid subid)
Definition launcher.c:937
List * lappend(List *list, void *datum)
Definition list.c:339
List * lappend_int(List *list, int datum)
Definition list.c:357
#define NoLock
Definition lockdefs.h:34
#define AccessShareLock
Definition lockdefs.h:36
#define RowExclusiveLock
Definition lockdefs.h:38
char * get_namespace_name(Oid nspid)
Definition lsyscache.c:3588
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition lwlock.c:1150
void LWLockRelease(LWLock *lock)
Definition lwlock.c:1767
@ LW_SHARED
Definition lwlock.h:105
char * pstrdup(const char *in)
Definition mcxt.c:1781
void pfree(void *pointer)
Definition mcxt.c:1616
#define CHECK_FOR_INTERRUPTS()
Definition miscadmin.h:125
Oid GetUserId(void)
Definition miscinit.c:470
static char * errmsg
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition palloc.h:124
#define ACL_UPDATE
Definition parsenodes.h:78
static int list_length(const List *l)
Definition pg_list.h:152
#define NIL
Definition pg_list.h:68
static void * list_nth(const List *list, int n)
Definition pg_list.h:331
#define foreach_int(var, lst)
Definition pg_list.h:502
static XLogRecPtr DatumGetLSN(Datum X)
Definition pg_lsn.h:25
END_CATALOG_STRUCT typedef FormData_pg_sequence * Form_pg_sequence
Definition pg_sequence.h:44
void UpdateSubscriptionRelState(Oid subid, Oid relid, char state, XLogRecPtr sublsn, bool already_locked)
END_CATALOG_STRUCT typedef FormData_pg_subscription_rel * Form_pg_subscription_rel
static char buf[DEFAULT_XLOG_SEG_SIZE]
long pgstat_report_stat(bool force)
Definition pgstat.c:722
void pgstat_report_subscription_error(Oid subid)
static bool DatumGetBool(Datum X)
Definition postgres.h:100
static int64 DatumGetInt64(Datum X)
Definition postgres.h:403
static Oid DatumGetObjectId(Datum X)
Definition postgres.h:242
static Datum ObjectIdGetDatum(Oid X)
Definition postgres.h:252
uint64_t Datum
Definition postgres.h:70
static int32 DatumGetInt32(Datum X)
Definition postgres.h:202
static Datum CharGetDatum(char X)
Definition postgres.h:132
#define InvalidOid
unsigned int Oid
static int fb(int x)
char * quote_literal_cstr(const char *rawstr)
Definition quote.c:101
#define RelationGetRelationName(relation)
Definition rel.h:550
#define RelationGetNamespace(relation)
Definition rel.h:557
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition scankey.c:76
#define REMOTE_SEQ_COL_COUNT
CopySeqResult
@ COPYSEQ_INSUFFICIENT_PERM
@ COPYSEQ_MISMATCH
@ COPYSEQ_SUCCESS
@ COPYSEQ_SKIPPED
static CopySeqResult get_and_validate_seq_info(TupleTableSlot *slot, Relation *sequence_rel, LogicalRepSequenceInfo **seqinfo, int *seqidx)
static List * seqinfos
#define MAX_SEQUENCES_SYNC_PER_BATCH
void SequenceSyncWorkerMain(Datum main_arg)
static void start_sequence_sync(void)
static void LogicalRepSyncSequences(void)
static void copy_sequences(WalReceiverConn *conn)
static void get_sequences_string(List *seqindexes, StringInfo buf)
static void report_sequence_errors(List *mismatched_seqs_idx, List *insuffperm_seqs_idx, List *missing_seqs_idx)
void ProcessSequencesForSync(void)
static CopySeqResult copy_sequence(LogicalRepSequenceInfo *seqinfo, Oid seqowner)
#define BTEqualStrategyNumber
Definition stratnum.h:31
PGconn * conn
Definition streamutil.c:52
StringInfo makeStringInfo(void)
Definition stringinfo.c:72
void resetStringInfo(StringInfo str)
Definition stringinfo.c:126
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition stringinfo.c:145
void appendStringInfoString(StringInfo str, const char *s)
Definition stringinfo.c:230
void initStringInfo(StringInfo str)
Definition stringinfo.c:97
Definition pg_list.h:54
TimestampTz last_seqsync_start_time
Tuplestorestate * tuplestore
TupleDesc tupledesc
WalRcvExecStatus status
void launch_sync_worker(LogicalRepWorkerType wtype, int nsyncworkers, Oid relid, TimestampTz *last_start_time)
Definition syncutils.c:118
pg_noreturn void FinishSyncWorker(void)
Definition syncutils.c:50
void FetchRelationStates(bool *has_pending_subtables, bool *has_pending_subsequences, bool *started_tx)
Definition syncutils.c:203
void ReleaseSysCache(HeapTuple tuple)
Definition syscache.c:265
HeapTuple SearchSysCache1(SysCacheIdentifier cacheId, Datum key1)
Definition syscache.c:221
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
bool tuplestore_gettupleslot(Tuplestorestate *state, bool forward, bool copy, TupleTableSlot *slot)
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition tuptable.h:417
void SwitchToUntrustedUser(Oid userid, UserContext *context)
Definition usercontext.c:33
void RestoreUserContext(UserContext *context)
Definition usercontext.c:87
#define walrcv_connect(conninfo, replication, logical, must_use_password, appname, err)
@ WALRCV_OK_TUPLES
static void walrcv_clear_result(WalRcvExecResult *walres)
#define walrcv_exec(conn, exec, nRetTypes, retTypes)
@ WORKERTYPE_SEQUENCESYNC
static bool am_sequencesync_worker(void)
void StartTransactionCommand(void)
Definition xact.c:3109
void CommitTransactionCommand(void)
Definition xact.c:3207
void AbortOutOfAnyTransaction(void)
Definition xact.c:4913
uint64 GetSystemIdentifier(void)
Definition xlog.c:4647