PostgreSQL Source Code git master
Loading...
Searching...
No Matches
tablesync.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 * tablesync.c
3 * PostgreSQL logical replication: initial table data synchronization
4 *
5 * Copyright (c) 2012-2026, PostgreSQL Global Development Group
6 *
7 * IDENTIFICATION
8 * src/backend/replication/logical/tablesync.c
9 *
10 * NOTES
11 * This file contains code for initial table data synchronization for
12 * logical replication.
13 *
14 * The initial data synchronization is done separately for each table,
15 * in a separate apply worker that only fetches the initial snapshot data
16 * from the publisher and then synchronizes the position in the stream with
17 * the leader apply worker.
18 *
19 * There are several reasons for doing the synchronization this way:
20 * - It allows us to parallelize the initial data synchronization
21 * which lowers the time needed for it to happen.
22 * - The initial synchronization does not have to hold the xid and LSN
23 * for the time it takes to copy data of all tables, causing less
24 * bloat and lower disk consumption compared to doing the
25 * synchronization in a single process for the whole database.
26 * - It allows us to synchronize any tables added after the initial
27 * synchronization has finished.
28 *
29 * The stream position synchronization works in multiple steps:
30 * - Apply worker requests a tablesync worker to start, setting the new
31 * table state to INIT.
32 * - Tablesync worker starts; changes table state from INIT to DATASYNC while
33 * copying.
34 * - Tablesync worker does initial table copy; there is a FINISHEDCOPY (sync
35 * worker specific) state to indicate when the copy phase has completed, so
36 * if the worker crashes with this (non-memory) state then the copy will not
37 * be re-attempted.
38 * - Tablesync worker then sets table state to SYNCWAIT; waits for state change.
39 * - Apply worker periodically checks for tables in SYNCWAIT state. When
40 * any appear, it sets the table state to CATCHUP and starts loop-waiting
41 * until either the table state is set to SYNCDONE or the sync worker
42 * exits.
43 * - After the sync worker has seen the state change to CATCHUP, it will
44 * read the stream and apply changes (acting like an apply worker) until
45 * it catches up to the specified stream position. Then it sets the
46 * state to SYNCDONE. There might be zero changes applied between
47 * CATCHUP and SYNCDONE, because the sync worker might be ahead of the
48 * apply worker.
49 * - Once the state is set to SYNCDONE, the apply will continue tracking
50 * the table until it reaches the SYNCDONE stream position, at which
51 * point it sets state to READY and stops tracking. Again, there might
52 * be zero changes in between.
53 *
54 * So the state progression is always: INIT -> DATASYNC -> FINISHEDCOPY
55 * -> SYNCWAIT -> CATCHUP -> SYNCDONE -> READY.
56 *
57 * The catalog pg_subscription_rel is used to keep information about
58 * subscribed tables and their state. The catalog holds all states
59 * except SYNCWAIT and CATCHUP which are only in shared memory.
60 *
61 * Example flows look like this:
62 * - Apply is in front:
63 * sync:8
64 * -> set in catalog FINISHEDCOPY
65 * -> set in memory SYNCWAIT
66 * apply:10
67 * -> set in memory CATCHUP
68 * -> enter wait-loop
69 * sync:10
70 * -> set in catalog SYNCDONE
71 * -> exit
72 * apply:10
73 * -> exit wait-loop
74 * -> continue rep
75 * apply:11
76 * -> set in catalog READY
77 *
78 * - Sync is in front:
79 * sync:10
80 * -> set in catalog FINISHEDCOPY
81 * -> set in memory SYNCWAIT
82 * apply:8
83 * -> set in memory CATCHUP
84 * -> continue per-table filtering
85 * sync:10
86 * -> set in catalog SYNCDONE
87 * -> exit
88 * apply:10
89 * -> set in catalog READY
90 * -> stop per-table filtering
91 * -> continue rep
92 *-------------------------------------------------------------------------
93 */
94
95#include "postgres.h"
96
97#include "access/table.h"
98#include "access/xact.h"
99#include "catalog/indexing.h"
101#include "catalog/pg_type.h"
102#include "commands/copy.h"
103#include "miscadmin.h"
104#include "nodes/makefuncs.h"
106#include "pgstat.h"
110#include "replication/origin.h"
111#include "replication/slot.h"
114#include "storage/ipc.h"
115#include "storage/lmgr.h"
116#include "utils/acl.h"
117#include "utils/array.h"
118#include "utils/builtins.h"
119#include "utils/lsyscache.h"
120#include "utils/rls.h"
121#include "utils/snapmgr.h"
122#include "utils/syscache.h"
123#include "utils/usercontext.h"
124
126
128
129/*
130 * Wait until the relation sync state is set in the catalog to the expected
131 * one; return true when it happens.
132 *
133 * Returns false if the table sync worker or the table itself have
134 * disappeared, or the table state has been reset.
135 *
136 * Currently, this is used in the apply worker when transitioning from
137 * CATCHUP state to SYNCDONE.
138 */
139static bool
141{
142 char state;
143
144 for (;;)
145 {
146 LogicalRepWorker *worker;
147 XLogRecPtr statelsn;
148
150
153 relid, &statelsn);
154
156 break;
157
158 if (state == expected_state)
159 return true;
160
161 /* Check if the sync worker is still running and bail if not. */
165 false);
167 if (!worker)
168 break;
169
173
175 }
176
177 return false;
178}
179
180/*
181 * Wait until the apply worker changes the state of our synchronization
182 * worker to the expected one.
183 *
184 * Used when transitioning from SYNCWAIT state to CATCHUP.
185 *
186 * Returns false if the apply worker has disappeared.
187 */
188static bool
190{
191 int rc;
192
193 for (;;)
194 {
195 LogicalRepWorker *worker;
196
198
199 /*
200 * Done if already in correct state. (We assume this fetch is atomic
201 * enough to not give a misleading answer if we do it with no lock.)
202 */
204 return true;
205
206 /*
207 * Bail out if the apply worker has died, else signal it we're
208 * waiting.
209 */
213 false);
214 if (worker && worker->proc)
217 if (!worker)
218 break;
219
220 /*
221 * Wait. We expect to get a latch signal back from the apply worker,
222 * but use a timeout in case it dies without sending one.
223 */
224 rc = WaitLatch(MyLatch,
227
228 if (rc & WL_LATCH_SET)
230 }
231
232 return false;
233}
234
235/*
236 * Handle table synchronization cooperation from the synchronization
237 * worker.
238 *
239 * If the sync worker is in CATCHUP state and reached (or passed) the
240 * predetermined synchronization point in the WAL stream, mark the table as
241 * SYNCDONE and finish.
242 */
243void
245{
247
250 {
251 TimeLineID tli;
252 char syncslotname[NAMEDATALEN] = {0};
253 char originname[NAMEDATALEN] = {0};
254
257
259
260 /*
261 * UpdateSubscriptionRelState must be called within a transaction.
262 */
263 if (!IsTransactionState())
265
270 false);
271
272 /*
273 * End streaming so that LogRepWorkerWalRcvConn can be used to drop
274 * the slot.
275 */
277
278 /*
279 * Cleanup the tablesync slot.
280 *
281 * This has to be done after updating the state because otherwise if
282 * there is an error while doing the database operations we won't be
283 * able to rollback dropped slot.
284 */
288 sizeof(syncslotname));
289
290 /*
291 * It is important to give an error if we are unable to drop the slot,
292 * otherwise, it won't be dropped till the corresponding subscription
293 * is dropped. So passing missing_ok = false.
294 */
296
298 pgstat_report_stat(false);
299
300 /*
301 * Start a new transaction to clean up the tablesync origin tracking.
302 * This transaction will be ended within the FinishSyncWorker(). Now,
303 * even, if we fail to remove this here, the apply worker will ensure
304 * to clean it up afterward.
305 *
306 * We need to do this after the table state is set to SYNCDONE.
307 * Otherwise, if an error occurs while performing the database
308 * operation, the worker will be restarted and the in-memory state of
309 * replication progress (remote_lsn) won't be rolled-back which would
310 * have been cleared before restart. So, the restarted worker will use
311 * invalid replication progress state resulting in replay of
312 * transactions that have already been applied.
313 */
315
319 sizeof(originname));
320
321 /*
322 * Resetting the origin session removes the ownership of the slot.
323 * This is needed to allow the origin to be dropped.
324 */
329
330 /*
331 * Drop the tablesync's origin tracking if exists.
332 *
333 * There is a chance that the user is concurrently performing refresh
334 * for the subscription where we remove the table state and its origin
335 * or the apply worker would have removed this origin. So passing
336 * missing_ok = true.
337 */
339
341 }
342 else
344}
345
346/*
347 * Handle table synchronization cooperation from the apply worker.
348 *
349 * Walk over all subscription tables that are individually tracked by the
350 * apply process (currently, all that have state other than
351 * SUBREL_STATE_READY) and manage synchronization for them.
352 *
353 * If there are tables that need synchronizing and are not being synchronized
354 * yet, start sync workers for them (if there are free slots for sync
355 * workers). To prevent starting the sync worker for the same relation at a
356 * high frequency after a failure, we store its last start time with each sync
357 * state info. We start the sync worker for the same relation after waiting
358 * at least wal_retrieve_retry_interval.
359 *
360 * For tables that are being synchronized already, check if sync workers
361 * either need action from the apply worker or have finished. This is the
362 * SYNCWAIT to CATCHUP transition.
363 *
364 * If the synchronization position is reached (SYNCDONE), then the table can
365 * be marked as READY and is no longer tracked.
366 */
367void
369{
371 {
372 Oid relid;
373 TimestampTz last_start_time;
374 };
375 static HTAB *last_start_times = NULL;
376 ListCell *lc;
377 bool started_tx;
378 bool should_exit = false;
379 Relation rel = NULL;
380
382
383 /* We need up-to-date sync state info for subscription tables here. */
385
386 /*
387 * Prepare a hash table for tracking last start times of workers, to avoid
388 * immediate restarts. We don't need it if there are no tables that need
389 * syncing.
390 */
392 {
393 HASHCTL ctl;
394
395 ctl.keysize = sizeof(Oid);
396 ctl.entrysize = sizeof(struct tablesync_start_time_mapping);
397 last_start_times = hash_create("Logical replication table sync worker start times",
398 256, &ctl, HASH_ELEM | HASH_BLOBS);
399 }
400
401 /*
402 * Clean up the hash table when we're done with all tables (just to
403 * release the bit of memory).
404 */
406 {
409 }
410
411 /*
412 * Process all tables that are being synchronized.
413 */
414 foreach(lc, table_states_not_ready)
415 {
417
418 if (!started_tx)
419 {
421 started_tx = true;
422 }
423
425
426 if (rstate->state == SUBREL_STATE_SYNCDONE)
427 {
428 /*
429 * Apply has caught up to the position where the table sync has
430 * finished. Mark the table as ready so that the apply will just
431 * continue to replicate it normally.
432 */
433 if (current_lsn >= rstate->lsn)
434 {
436
437 rstate->state = SUBREL_STATE_READY;
438 rstate->lsn = current_lsn;
439
440 /*
441 * Remove the tablesync origin tracking if exists.
442 *
443 * There is a chance that the user is concurrently performing
444 * refresh for the subscription where we remove the table
445 * state and its origin or the tablesync worker would have
446 * already removed this origin. We can't rely on tablesync
447 * worker to remove the origin tracking as if there is any
448 * error while dropping we won't restart it to drop the
449 * origin. So passing missing_ok = true.
450 *
451 * Lock the subscription and origin in the same order as we
452 * are doing during DDL commands to avoid deadlocks. See
453 * AlterSubscription_refresh.
454 */
456 0, AccessShareLock);
457
458 if (!rel)
460
462 rstate->relid,
464 sizeof(originname));
466
467 /*
468 * Update the state to READY only after the origin cleanup.
469 */
471 rstate->relid, rstate->state,
472 rstate->lsn, true);
473 }
474 }
475 else
476 {
478
479 /*
480 * Look for a sync worker for this relation.
481 */
483
486 rstate->relid, false);
487
488 if (syncworker)
489 {
490 /* Found one, update our copy of its state */
491 SpinLockAcquire(&syncworker->relmutex);
492 rstate->state = syncworker->relstate;
493 rstate->lsn = syncworker->relstate_lsn;
494 if (rstate->state == SUBREL_STATE_SYNCWAIT)
495 {
496 /*
497 * Sync worker is waiting for apply. Tell sync worker it
498 * can catchup now.
499 */
501 syncworker->relstate_lsn =
502 Max(syncworker->relstate_lsn, current_lsn);
503 }
504 SpinLockRelease(&syncworker->relmutex);
505
506 /* If we told worker to catch up, wait for it. */
507 if (rstate->state == SUBREL_STATE_SYNCWAIT)
508 {
509 /* Signal the sync worker, as it may be waiting for us. */
510 if (syncworker->proc)
512
513 /* Now safe to release the LWLock */
515
516 if (started_tx)
517 {
518 /*
519 * We must commit the existing transaction to release
520 * the existing locks before entering a busy loop.
521 * This is required to avoid any undetected deadlocks
522 * due to any existing lock as deadlock detector won't
523 * be able to detect the waits on the latch.
524 *
525 * Also close any tables prior to the commit.
526 */
527 if (rel)
528 {
529 table_close(rel, NoLock);
530 rel = NULL;
531 }
533 pgstat_report_stat(false);
534 }
535
536 /*
537 * Enter busy loop and wait for synchronization worker to
538 * reach expected state (or die trying).
539 */
541 started_tx = true;
542
545 }
546 else
548 }
549 else
550 {
551 /*
552 * If there is no sync worker for this table yet, count
553 * running sync workers for this subscription, while we have
554 * the lock.
555 */
556 int nsyncworkers =
559 bool found;
560
561 /* Now safe to release the LWLock */
563
565 HASH_ENTER, &found);
566 if (!found)
567 hentry->last_start_time = 0;
568
570 rstate->relid, &hentry->last_start_time);
571 }
572 }
573 }
574
575 /* Close table if opened */
576 if (rel)
577 table_close(rel, NoLock);
578
579
580 if (started_tx)
581 {
582 /*
583 * Even when the two_phase mode is requested by the user, it remains
584 * as 'pending' until all tablesyncs have reached READY state.
585 *
586 * When this happens, we restart the apply worker and (if the
587 * conditions are still ok) then the two_phase tri-state will become
588 * 'enabled' at that time.
589 *
590 * Note: If the subscription has no tables then leave the state as
591 * PENDING, which allows ALTER SUBSCRIPTION ... REFRESH PUBLICATION to
592 * work.
593 */
595 {
596 CommandCounterIncrement(); /* make updates visible */
597 if (AllTablesyncsReady())
598 {
599 ereport(LOG,
600 (errmsg("logical replication apply worker for subscription \"%s\" will restart so that two_phase can be enabled",
602 should_exit = true;
603 }
604 }
605
607 pgstat_report_stat(true);
608 }
609
610 if (should_exit)
611 {
612 /*
613 * Reset the last-start time for this worker so that the launcher will
614 * restart it without waiting for wal_retrieve_retry_interval.
615 */
617
618 proc_exit(0);
619 }
620}
621
622/*
623 * Create list of columns for COPY based on logical relation mapping.
624 */
625static List *
627{
629 int i;
630
631 for (i = 0; i < rel->remoterel.natts; i++)
632 {
635 }
636
637
638 return attnamelist;
639}
640
641/*
642 * Data source callback for the COPY FROM, which reads from the remote
643 * connection and passes the data back to our local COPY.
644 */
645static int
646copy_read_data(void *outbuf, int minread, int maxread)
647{
648 int bytesread = 0;
649 int avail;
650
651 /* If there are some leftover data from previous read, use it. */
652 avail = copybuf->len - copybuf->cursor;
653 if (avail)
654 {
655 if (avail > maxread)
656 avail = maxread;
657 memcpy(outbuf, &copybuf->data[copybuf->cursor], avail);
658 copybuf->cursor += avail;
659 maxread -= avail;
660 bytesread += avail;
661 }
662
663 while (maxread > 0 && bytesread < minread)
664 {
666 int len;
667 char *buf = NULL;
668
669 for (;;)
670 {
671 /* Try read the data. */
673
675
676 if (len == 0)
677 break;
678 else if (len < 0)
679 return bytesread;
680 else
681 {
682 /* Process the data */
683 copybuf->data = buf;
684 copybuf->len = len;
685 copybuf->cursor = 0;
686
687 avail = copybuf->len - copybuf->cursor;
688 if (avail > maxread)
689 avail = maxread;
690 memcpy(outbuf, &copybuf->data[copybuf->cursor], avail);
691 outbuf = (char *) outbuf + avail;
692 copybuf->cursor += avail;
693 maxread -= avail;
694 bytesread += avail;
695 }
696
698 return bytesread;
699 }
700
701 /*
702 * Wait for more data or latch.
703 */
708
710 }
711
712 return bytesread;
713}
714
715
716/*
717 * Get information about remote relation in similar fashion the RELATION
718 * message provides during replication.
719 *
720 * This function also returns (a) the relation qualifications to be used in
721 * the COPY command, and (b) whether the remote relation has published any
722 * generated column.
723 */
724static void
726 List **qual, bool *gencol_published)
727{
728 WalRcvExecResult *res;
729 StringInfoData cmd;
730 TupleTableSlot *slot;
733 Oid qualRow[] = {TEXTOID};
734 bool isnull;
735 int natt;
736 StringInfo pub_names = NULL;
739
740 lrel->nspname = nspname;
741 lrel->relname = relname;
742
743 /* First fetch Oid and replica identity. */
744 initStringInfo(&cmd);
745 appendStringInfo(&cmd, "SELECT c.oid, c.relreplident, c.relkind"
746 " FROM pg_catalog.pg_class c"
747 " INNER JOIN pg_catalog.pg_namespace n"
748 " ON (c.relnamespace = n.oid)"
749 " WHERE n.nspname = %s"
750 " AND c.relname = %s",
751 quote_literal_cstr(nspname),
755
756 if (res->status != WALRCV_OK_TUPLES)
759 errmsg("could not fetch table info for table \"%s.%s\" from publisher: %s",
760 nspname, relname, res->err)));
761
763 if (!tuplestore_gettupleslot(res->tuplestore, true, false, slot))
766 errmsg("table \"%s.%s\" not found on publisher",
767 nspname, relname)));
768
769 lrel->remoteid = DatumGetObjectId(slot_getattr(slot, 1, &isnull));
770 Assert(!isnull);
771 lrel->replident = DatumGetChar(slot_getattr(slot, 2, &isnull));
772 Assert(!isnull);
773 lrel->relkind = DatumGetChar(slot_getattr(slot, 3, &isnull));
774 Assert(!isnull);
775
778
779
780 /*
781 * Get column lists for each relation.
782 *
783 * We need to do this before fetching info about column names and types,
784 * so that we can skip columns that should not be replicated.
785 */
786 if (server_version >= 150000)
787 {
791
792 /* Build the pub_names comma-separated string. */
793 pub_names = makeStringInfo();
795
796 /*
797 * Fetch info about column lists for the relation (from all the
798 * publications).
799 */
800 resetStringInfo(&cmd);
801 appendStringInfo(&cmd,
802 "SELECT DISTINCT"
803 " (CASE WHEN (array_length(gpt.attrs, 1) = c.relnatts)"
804 " THEN NULL ELSE gpt.attrs END)"
805 " FROM pg_publication p,"
806 " LATERAL pg_get_publication_tables(p.pubname) gpt,"
807 " pg_class c"
808 " WHERE gpt.relid = %u AND c.oid = gpt.relid"
809 " AND p.pubname IN ( %s )",
810 lrel->remoteid,
811 pub_names->data);
812
815
816 if (pubres->status != WALRCV_OK_TUPLES)
819 errmsg("could not fetch column list info for table \"%s.%s\" from publisher: %s",
820 nspname, relname, pubres->err)));
821
822 /*
823 * We don't support the case where the column list is different for
824 * the same table when combining publications. See comments atop
825 * fetch_relation_list. So there should be only one row returned.
826 * Although we already checked this when creating the subscription, we
827 * still need to check here in case the column list was changed after
828 * creating the subscription and before the sync worker is started.
829 */
830 if (tuplestore_tuple_count(pubres->tuplestore) > 1)
833 errmsg("cannot use different column lists for table \"%s.%s\" in different publications",
834 nspname, relname));
835
836 /*
837 * Get the column list and build a single bitmap with the attnums.
838 *
839 * If we find a NULL value, it means all the columns should be
840 * replicated.
841 */
843 if (tuplestore_gettupleslot(pubres->tuplestore, true, false, tslot))
844 {
845 Datum cfval = slot_getattr(tslot, 1, &isnull);
846
847 if (!isnull)
848 {
849 ArrayType *arr;
850 int nelems;
851 int16 *elems;
852
854 nelems = ARR_DIMS(arr)[0];
855 elems = (int16 *) ARR_DATA_PTR(arr);
856
857 for (natt = 0; natt < nelems; natt++)
859 }
860
862 }
864
866 }
867
868 /*
869 * Now fetch column names and types.
870 */
871 resetStringInfo(&cmd);
873 "SELECT a.attnum,"
874 " a.attname,"
875 " a.atttypid,"
876 " a.attnum = ANY(i.indkey)");
877
878 /* Generated columns can be replicated since version 18. */
879 if (server_version >= 180000)
880 appendStringInfoString(&cmd, ", a.attgenerated != ''");
881
882 appendStringInfo(&cmd,
883 " FROM pg_catalog.pg_attribute a"
884 " LEFT JOIN pg_catalog.pg_index i"
885 " ON (i.indexrelid = pg_get_replica_identity_index(%u))"
886 " WHERE a.attnum > 0::pg_catalog.int2"
887 " AND NOT a.attisdropped %s"
888 " AND a.attrelid = %u"
889 " ORDER BY a.attnum",
890 lrel->remoteid,
891 (server_version >= 120000 && server_version < 180000 ?
892 "AND a.attgenerated = ''" : ""),
893 lrel->remoteid);
896
897 if (res->status != WALRCV_OK_TUPLES)
900 errmsg("could not fetch table info for table \"%s.%s\" from publisher: %s",
901 nspname, relname, res->err)));
902
903 /* We don't know the number of rows coming, so allocate enough space. */
904 lrel->attnames = palloc0(MaxTupleAttributeNumber * sizeof(char *));
905 lrel->atttyps = palloc0(MaxTupleAttributeNumber * sizeof(Oid));
906 lrel->attkeys = NULL;
907
908 /*
909 * Store the columns as a list of names. Ignore those that are not
910 * present in the column list, if there is one.
911 */
912 natt = 0;
914 while (tuplestore_gettupleslot(res->tuplestore, true, false, slot))
915 {
916 char *rel_colname;
918
919 attnum = DatumGetInt16(slot_getattr(slot, 1, &isnull));
920 Assert(!isnull);
921
922 /* If the column is not in the column list, skip it. */
924 {
925 ExecClearTuple(slot);
926 continue;
927 }
928
929 rel_colname = TextDatumGetCString(slot_getattr(slot, 2, &isnull));
930 Assert(!isnull);
931
932 lrel->attnames[natt] = rel_colname;
933 lrel->atttyps[natt] = DatumGetObjectId(slot_getattr(slot, 3, &isnull));
934 Assert(!isnull);
935
936 if (DatumGetBool(slot_getattr(slot, 4, &isnull)))
937 lrel->attkeys = bms_add_member(lrel->attkeys, natt);
938
939 /* Remember if the remote table has published any generated column. */
940 if (server_version >= 180000 && !(*gencol_published))
941 {
942 *gencol_published = DatumGetBool(slot_getattr(slot, 5, &isnull));
943 Assert(!isnull);
944 }
945
946 /* Should never happen. */
948 elog(ERROR, "too many columns in remote table \"%s.%s\"",
949 nspname, relname);
950
951 ExecClearTuple(slot);
952 }
954
955 lrel->natts = natt;
956
958
959 /*
960 * Get relation's row filter expressions. DISTINCT avoids the same
961 * expression of a table in multiple publications from being included
962 * multiple times in the final expression.
963 *
964 * We need to copy the row even if it matches just one of the
965 * publications, so we later combine all the quals with OR.
966 *
967 * For initial synchronization, row filtering can be ignored in following
968 * cases:
969 *
970 * 1) one of the subscribed publications for the table hasn't specified
971 * any row filter
972 *
973 * 2) one of the subscribed publications has puballtables set to true
974 *
975 * 3) one of the subscribed publications is declared as TABLES IN SCHEMA
976 * that includes this relation
977 */
978 if (server_version >= 150000)
979 {
980 /* Reuse the already-built pub_names. */
981 Assert(pub_names != NULL);
982
983 /* Check for row filters. */
984 resetStringInfo(&cmd);
985 appendStringInfo(&cmd,
986 "SELECT DISTINCT pg_get_expr(gpt.qual, gpt.relid)"
987 " FROM pg_publication p,"
988 " LATERAL pg_get_publication_tables(p.pubname) gpt"
989 " WHERE gpt.relid = %u"
990 " AND p.pubname IN ( %s )",
991 lrel->remoteid,
992 pub_names->data);
993
995
996 if (res->status != WALRCV_OK_TUPLES)
998 (errmsg("could not fetch table WHERE clause info for table \"%s.%s\" from publisher: %s",
999 nspname, relname, res->err)));
1000
1001 /*
1002 * Multiple row filter expressions for the same table will be combined
1003 * by COPY using OR. If any of the filter expressions for this table
1004 * are null, it means the whole table will be copied. In this case it
1005 * is not necessary to construct a unified row filter expression at
1006 * all.
1007 */
1009 while (tuplestore_gettupleslot(res->tuplestore, true, false, slot))
1010 {
1011 Datum rf = slot_getattr(slot, 1, &isnull);
1012
1013 if (!isnull)
1014 *qual = lappend(*qual, makeString(TextDatumGetCString(rf)));
1015 else
1016 {
1017 /* Ignore filters and cleanup as necessary. */
1018 if (*qual)
1019 {
1020 list_free_deep(*qual);
1021 *qual = NIL;
1022 }
1023 break;
1024 }
1025
1026 ExecClearTuple(slot);
1027 }
1029
1031 destroyStringInfo(pub_names);
1032 }
1033
1034 pfree(cmd.data);
1035}
1036
1037/*
1038 * Copy existing data of a table from publisher.
1039 *
1040 * Caller is responsible for locking the local relation.
1041 */
1042static void
1044{
1045 LogicalRepRelMapEntry *relmapentry;
1047 List *qual = NIL;
1048 WalRcvExecResult *res;
1049 StringInfoData cmd;
1050 CopyFromState cstate;
1052 ParseState *pstate;
1053 List *options = NIL;
1054 bool gencol_published = false;
1055
1056 /* Get the publisher relation info. */
1058 RelationGetRelationName(rel), &lrel, &qual,
1060
1061 /* Put the relation into relmap. */
1063
1064 /* Map the publisher relation to local one. */
1065 relmapentry = logicalrep_rel_open(lrel.remoteid, NoLock);
1066 Assert(rel == relmapentry->localrel);
1067
1068 /* Start copy on the publisher. */
1069 initStringInfo(&cmd);
1070
1071 /* Regular or partitioned table with no row filter or generated columns */
1072 if ((lrel.relkind == RELKIND_RELATION || lrel.relkind == RELKIND_PARTITIONED_TABLE)
1073 && qual == NIL && !gencol_published)
1074 {
1075 appendStringInfo(&cmd, "COPY %s",
1076 quote_qualified_identifier(lrel.nspname, lrel.relname));
1077
1078 /* If the table has columns, then specify the columns */
1079 if (lrel.natts)
1080 {
1081 appendStringInfoString(&cmd, " (");
1082
1083 /*
1084 * XXX Do we need to list the columns in all cases? Maybe we're
1085 * replicating all columns?
1086 */
1087 for (int i = 0; i < lrel.natts; i++)
1088 {
1089 if (i > 0)
1090 appendStringInfoString(&cmd, ", ");
1091
1093 }
1094
1095 appendStringInfoChar(&cmd, ')');
1096 }
1097
1098 appendStringInfoString(&cmd, " TO STDOUT");
1099 }
1100 else
1101 {
1102 /*
1103 * For non-tables and tables with row filters, we need to do COPY
1104 * (SELECT ...), but we can't just do SELECT * because we may need to
1105 * copy only subset of columns including generated columns. For tables
1106 * with any row filters, build a SELECT query with OR'ed row filters
1107 * for COPY.
1108 *
1109 * We also need to use this same COPY (SELECT ...) syntax when
1110 * generated columns are published, because copy of generated columns
1111 * is not supported by the normal COPY.
1112 */
1113 appendStringInfoString(&cmd, "COPY (SELECT ");
1114 for (int i = 0; i < lrel.natts; i++)
1115 {
1117 if (i < lrel.natts - 1)
1118 appendStringInfoString(&cmd, ", ");
1119 }
1120
1121 appendStringInfoString(&cmd, " FROM ");
1122
1123 /*
1124 * For regular tables, make sure we don't copy data from a child that
1125 * inherits the named table as those will be copied separately.
1126 */
1127 if (lrel.relkind == RELKIND_RELATION)
1128 appendStringInfoString(&cmd, "ONLY ");
1129
1131 /* list of OR'ed filters */
1132 if (qual != NIL)
1133 {
1134 ListCell *lc;
1135 char *q = strVal(linitial(qual));
1136
1137 appendStringInfo(&cmd, " WHERE %s", q);
1138 for_each_from(lc, qual, 1)
1139 {
1140 q = strVal(lfirst(lc));
1141 appendStringInfo(&cmd, " OR %s", q);
1142 }
1143 list_free_deep(qual);
1144 }
1145
1146 appendStringInfoString(&cmd, ") TO STDOUT");
1147 }
1148
1149 /*
1150 * Prior to v16, initial table synchronization will use text format even
1151 * if the binary option is enabled for a subscription.
1152 */
1155 {
1156 appendStringInfoString(&cmd, " WITH (FORMAT binary)");
1157 options = list_make1(makeDefElem("format",
1158 (Node *) makeString("binary"), -1));
1159 }
1160
1162 pfree(cmd.data);
1163 if (res->status != WALRCV_OK_COPY_OUT)
1164 ereport(ERROR,
1166 errmsg("could not start initial contents copy for table \"%s.%s\": %s",
1167 lrel.nspname, lrel.relname, res->err)));
1169
1171
1172 pstate = make_parsestate(NULL);
1174 NULL, false, false);
1175
1176 attnamelist = make_copy_attnamelist(relmapentry);
1177 cstate = BeginCopyFrom(pstate, rel, NULL, NULL, false, copy_read_data, attnamelist, options);
1178
1179 /* Do the copy */
1180 (void) CopyFrom(cstate);
1181
1182 logicalrep_rel_close(relmapentry, NoLock);
1183}
1184
1185/*
1186 * Determine the tablesync slot name.
1187 *
1188 * The name must not exceed NAMEDATALEN - 1 because of remote node constraints
1189 * on slot name length. We append system_identifier to avoid slot_name
1190 * collision with subscriptions in other clusters. With the current scheme
1191 * pg_%u_sync_%u_UINT64_FORMAT (3 + 10 + 6 + 10 + 20 + '\0'), the maximum
1192 * length of slot_name will be 50.
1193 *
1194 * The returned slot name is stored in the supplied buffer (syncslotname) with
1195 * the given size.
1196 *
1197 * Note: We don't use the subscription slot name as part of tablesync slot name
1198 * because we are responsible for cleaning up these slots and it could become
1199 * impossible to recalculate what name to cleanup if the subscription slot name
1200 * had changed.
1201 */
1202void
1209
1210/*
1211 * Start syncing the table in the sync worker.
1212 *
1213 * If nothing needs to be done to sync the table, we exit the worker without
1214 * any further action.
1215 *
1216 * The returned slot name is palloc'ed in current memory context.
1217 */
1218static char *
1220{
1221 char *slotname;
1222 char *err;
1223 char relstate;
1224 XLogRecPtr relstate_lsn;
1225 Relation rel;
1227 WalRcvExecResult *res;
1228 char originname[NAMEDATALEN];
1231 bool must_use_password;
1232 bool run_as_owner;
1233
1234 /* Check the state of the table synchronization. */
1238 &relstate_lsn);
1240
1241 /* Is the use of a password mandatory? */
1244
1246 MyLogicalRepWorker->relstate = relstate;
1247 MyLogicalRepWorker->relstate_lsn = relstate_lsn;
1249
1250 /*
1251 * If synchronization is already done or no longer necessary, exit now
1252 * that we've updated shared memory state.
1253 */
1254 switch (relstate)
1255 {
1257 case SUBREL_STATE_READY:
1259 FinishSyncWorker(); /* doesn't return */
1260 }
1261
1262 /* Calculate the name of the tablesync slot. */
1263 slotname = (char *) palloc(NAMEDATALEN);
1266 slotname,
1267 NAMEDATALEN);
1268
1269 /*
1270 * Here we use the slot name instead of the subscription name as the
1271 * application_name, so that it is different from the leader apply worker,
1272 * so that synchronous replication can distinguish them.
1273 */
1277 slotname, &err);
1279 ereport(ERROR,
1281 errmsg("table synchronization worker for subscription \"%s\" could not connect to the publisher: %s",
1282 MySubscription->name, err)));
1283
1287
1288 /* Assign the origin tracking record name. */
1291 originname,
1292 sizeof(originname));
1293
1295 {
1296 /*
1297 * We have previously errored out before finishing the copy so the
1298 * replication slot might exist. We want to remove the slot if it
1299 * already exists and proceed.
1300 *
1301 * XXX We could also instead try to drop the slot, last time we failed
1302 * but for that, we might need to clean up the copy state as it might
1303 * be in the middle of fetching the rows. Also, if there is a network
1304 * breakdown then it wouldn't have succeeded so trying it next time
1305 * seems like a better bet.
1306 */
1308 }
1310 {
1311 /*
1312 * The COPY phase was previously done, but tablesync then crashed
1313 * before it was able to finish normally.
1314 */
1316
1317 /*
1318 * The origin tracking name must already exist. It was created first
1319 * time this tablesync was launched.
1320 */
1325
1327
1328 goto copy_table_done;
1329 }
1330
1335
1336 /*
1337 * Update the state, create the replication origin, and make them visible
1338 * to others.
1339 */
1345 false);
1346
1347 /*
1348 * Create the replication origin in a separate transaction from the one
1349 * that sets up the origin in shared memory. This prevents the risk that
1350 * changes to the origin in shared memory cannot be rolled back if the
1351 * transaction aborts.
1352 */
1354 if (!OidIsValid(originid))
1356
1358 pgstat_report_stat(true);
1359
1361
1362 /*
1363 * Use a standard write lock here. It might be better to disallow access
1364 * to the table while it's being synchronized. But we don't want to block
1365 * the main apply process from working and it has to open the relation in
1366 * RowExclusiveLock when remapping remote relation id to local one.
1367 */
1369
1370 /*
1371 * Start a transaction in the remote node in REPEATABLE READ mode. This
1372 * ensures that both the replication slot we create (see below) and the
1373 * COPY are consistent with each other.
1374 */
1376 "BEGIN READ ONLY ISOLATION LEVEL REPEATABLE READ",
1377 0, NULL);
1378 if (res->status != WALRCV_OK_COMMAND)
1379 ereport(ERROR,
1381 errmsg("table copy could not start transaction on publisher: %s",
1382 res->err)));
1384
1385 /*
1386 * Create a new permanent logical decoding slot. This slot will be used
1387 * for the catchup phase after COPY is done, so tell it to use the
1388 * snapshot to make the final data consistent.
1389 */
1391 slotname, false /* permanent */ , false /* two_phase */ ,
1394
1395 /*
1396 * Advance the origin to the LSN got from walrcv_create_slot and then set
1397 * up the origin. The advancement is WAL logged for the purpose of
1398 * recovery. Locks are to prevent the replication origin from vanishing
1399 * while advancing.
1400 *
1401 * The purpose of doing these before the copy is to avoid doing the copy
1402 * again due to any error in advancing or setting up origin tracking.
1403 */
1406 true /* go backward */ , true /* WAL log */ );
1408
1411
1412 /*
1413 * If the user did not opt to run as the owner of the subscription
1414 * ('run_as_owner'), then copy the table as the owner of the table.
1415 */
1417 if (!run_as_owner)
1418 SwitchToUntrustedUser(rel->rd_rel->relowner, &ucxt);
1419
1420 /*
1421 * Check that our table sync worker has permission to insert into the
1422 * target table.
1423 */
1425 ACL_INSERT);
1426 if (aclresult != ACLCHECK_OK)
1428 get_relkind_objtype(rel->rd_rel->relkind),
1430
1431 /*
1432 * COPY FROM does not honor RLS policies. That is not a problem for
1433 * subscriptions owned by roles with BYPASSRLS privilege (or superuser,
1434 * who has it implicitly), but other roles should not be able to
1435 * circumvent RLS. Disallow logical replication into RLS enabled
1436 * relations for such roles.
1437 */
1439 ereport(ERROR,
1441 errmsg("user \"%s\" cannot replicate into relation with row-level security enabled: \"%s\"",
1444
1445 /* Now do the initial data copy */
1447 copy_table(rel);
1449
1450 res = walrcv_exec(LogRepWorkerWalRcvConn, "COMMIT", 0, NULL);
1451 if (res->status != WALRCV_OK_COMMAND)
1452 ereport(ERROR,
1454 errmsg("table copy could not finish transaction on publisher: %s",
1455 res->err)));
1457
1458 if (!run_as_owner)
1460
1461 table_close(rel, NoLock);
1462
1463 /* Make the copy visible. */
1465
1466 /*
1467 * Update the persisted state to indicate the COPY phase is done; make it
1468 * visible to others.
1469 */
1474 false);
1475
1477
1479
1480 elog(DEBUG1,
1481 "LogicalRepSyncTableStart: '%s' origin_startpos lsn %X/%08X",
1483
1484 /*
1485 * We are done with the initial data synchronization, update the state.
1486 */
1491
1492 /*
1493 * Finally, wait until the leader apply worker tells us to catch up and
1494 * then return to let LogicalRepApplyLoop do it.
1495 */
1497 return slotname;
1498}
1499
1500/*
1501 * Execute the initial sync with error handling. Disable the subscription,
1502 * if it's required.
1503 *
1504 * Allocate the slot name in long-lived context on return. Note that we don't
1505 * handle FATAL errors which are probably because of system resource error and
1506 * are not repeatable.
1507 */
1508static void
1510{
1511 char *sync_slotname = NULL;
1512
1514
1515 PG_TRY();
1516 {
1517 /* Call initial sync. */
1519 }
1520 PG_CATCH();
1521 {
1524 else
1525 {
1526 /*
1527 * Report the worker failed during table synchronization. Abort
1528 * the current transaction so that the stats message is sent in an
1529 * idle state.
1530 */
1534
1535 PG_RE_THROW();
1536 }
1537 }
1538 PG_END_TRY();
1539
1540 /* allocate slot name in long-lived context */
1543}
1544
1545/*
1546 * Runs the tablesync worker.
1547 *
1548 * It starts syncing tables. After a successful sync, sets streaming options
1549 * and starts streaming to catchup with apply worker.
1550 */
1551static void
1553{
1554 char originname[NAMEDATALEN];
1556 char *slotname = NULL;
1558
1559 start_table_sync(&origin_startpos, &slotname);
1560
1563 originname,
1564 sizeof(originname));
1565
1567
1569
1571
1572 /* Apply the changes till we catchup with the apply worker. */
1574}
1575
1576/* Logical Replication Tablesync worker entry point */
1577void
1588
1589/*
1590 * If the subscription has no tables then return false.
1591 *
1592 * Otherwise, are all tablesyncs READY?
1593 *
1594 * Note: This function is not suitable to be called from outside of apply or
1595 * tablesync workers because MySubscription needs to be already initialized.
1596 */
1597bool
1599{
1600 bool started_tx;
1601 bool has_tables;
1602
1603 /* We need up-to-date sync state info for subscription tables here. */
1605
1606 if (started_tx)
1607 {
1609 pgstat_report_stat(true);
1610 }
1611
1612 /*
1613 * Return false when there are no tables in subscription or not all tables
1614 * are in ready state; true otherwise.
1615 */
1616 return has_tables && (table_states_not_ready == NIL);
1617}
1618
1619/*
1620 * Return whether the subscription currently has any tables.
1621 *
1622 * Note: Unlike HasSubscriptionTables(), this function relies on cached
1623 * information for subscription tables. Additionally, it should not be
1624 * invoked outside of apply or tablesync workers, as MySubscription must be
1625 * initialized first.
1626 */
1627bool
1629{
1630 bool started_tx;
1631 bool has_tables;
1632
1633 /* We need up-to-date subscription tables info here */
1635
1636 if (started_tx)
1637 {
1639 pgstat_report_stat(true);
1640 }
1641
1642 return has_tables;
1643}
1644
1645/*
1646 * Update the two_phase state of the specified subscription in pg_subscription.
1647 */
1648void
1650{
1651 Relation rel;
1652 HeapTuple tup;
1653 bool nulls[Natts_pg_subscription];
1656
1660
1663 if (!HeapTupleIsValid(tup))
1664 elog(ERROR,
1665 "cache lookup failed for subscription oid %u",
1666 suboid);
1667
1668 /* Form a new tuple. */
1669 memset(values, 0, sizeof(values));
1670 memset(nulls, false, sizeof(nulls));
1671 memset(replaces, false, sizeof(replaces));
1672
1673 /* And update/set two_phase state */
1676
1678 values, nulls, replaces);
1679 CatalogTupleUpdate(rel, &tup->t_self, tup);
1680
1683}
AclResult
Definition acl.h:182
@ ACLCHECK_OK
Definition acl.h:183
void aclcheck_error(AclResult aclerr, ObjectType objtype, const char *objectname)
Definition aclchk.c:2654
AclResult pg_class_aclcheck(Oid table_oid, Oid roleid, AclMode mode)
Definition aclchk.c:4039
#define ARR_DATA_PTR(a)
Definition array.h:322
#define DatumGetArrayTypeP(X)
Definition array.h:261
#define ARR_DIMS(a)
Definition array.h:294
int16 AttrNumber
Definition attnum.h:21
void set_stream_options(WalRcvStreamOptions *options, char *slotname, XLogRecPtr *origin_startpos)
Definition worker.c:5514
void start_apply(XLogRecPtr origin_startpos)
Definition worker.c:5583
void DisableSubscriptionAndExit(void)
Definition worker.c:5947
void ReplicationOriginNameForLogicalRep(Oid suboid, Oid relid, char *originname, Size szoriginname)
Definition worker.c:641
void set_apply_error_context_origin(char *originname)
Definition worker.c:6305
MemoryContext ApplyContext
Definition worker.c:472
void SetupApplyOrSyncWorker(int worker_slot)
Definition worker.c:5886
WalReceiverConn * LogRepWorkerWalRcvConn
Definition worker.c:477
Subscription * MySubscription
Definition worker.c:479
bool bms_is_member(int x, const Bitmapset *a)
Definition bitmapset.c:510
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition bitmapset.c:814
static Datum values[MAXATTR]
Definition bootstrap.c:155
#define TextDatumGetCString(d)
Definition builtins.h:98
#define Max(x, y)
Definition c.h:1001
#define Assert(condition)
Definition c.h:883
#define UINT64_FORMAT
Definition c.h:575
int16_t int16
Definition c.h:551
#define lengthof(array)
Definition c.h:813
#define OidIsValid(objectId)
Definition c.h:798
size_t Size
Definition c.h:629
CopyFromState BeginCopyFrom(ParseState *pstate, Relation rel, Node *whereClause, const char *filename, bool is_program, copy_data_source_cb data_source_cb, List *attnamelist, List *options)
Definition copyfrom.c:1529
uint64 CopyFrom(CopyFromState cstate)
Definition copyfrom.c:779
int64 TimestampTz
Definition timestamp.h:39
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition dynahash.c:952
HTAB * hash_create(const char *tabname, int64 nelem, const HASHCTL *info, int flags)
Definition dynahash.c:358
void hash_destroy(HTAB *hashp)
Definition dynahash.c:865
int errcode(int sqlerrcode)
Definition elog.c:863
int errmsg(const char *fmt,...)
Definition elog.c:1080
#define LOG
Definition elog.h:31
#define PG_RE_THROW()
Definition elog.h:405
#define PG_TRY(...)
Definition elog.h:372
#define PG_END_TRY(...)
Definition elog.h:397
#define DEBUG1
Definition elog.h:30
#define ERROR
Definition elog.h:39
#define PG_CATCH(...)
Definition elog.h:382
#define elog(elevel,...)
Definition elog.h:226
#define ereport(elevel,...)
Definition elog.h:150
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
struct Latch * MyLatch
Definition globals.c:63
HeapTuple heap_modify_tuple(HeapTuple tuple, TupleDesc tupleDesc, const Datum *replValues, const bool *replIsnull, const bool *doReplace)
Definition heaptuple.c:1210
void heap_freetuple(HeapTuple htup)
Definition heaptuple.c:1435
@ HASH_ENTER
Definition hsearch.h:114
#define HASH_ELEM
Definition hsearch.h:95
#define HASH_BLOBS
Definition hsearch.h:97
#define HeapTupleIsValid(tuple)
Definition htup.h:78
#define MaxTupleAttributeNumber
void CatalogTupleUpdate(Relation heapRel, const ItemPointerData *otid, HeapTuple tup)
Definition indexing.c:313
void proc_exit(int code)
Definition ipc.c:105
int i
Definition isn.c:77
int WaitLatchOrSocket(Latch *latch, int wakeEvents, pgsocket sock, long timeout, uint32 wait_event_info)
Definition latch.c:223
void ResetLatch(Latch *latch)
Definition latch.c:374
int WaitLatch(Latch *latch, int wakeEvents, long timeout, uint32 wait_event_info)
Definition latch.c:172
void logicalrep_worker_wakeup_ptr(LogicalRepWorker *worker)
Definition launcher.c:746
LogicalRepWorker * logicalrep_worker_find(LogicalRepWorkerType wtype, Oid subid, Oid relid, bool only_running)
Definition launcher.c:258
static dshash_table * last_start_times
Definition launcher.c:91
LogicalRepWorker * MyLogicalRepWorker
Definition launcher.c:56
int logicalrep_sync_worker_count(Oid subid)
Definition launcher.c:927
void ApplyLauncherForgetWorkerStartTime(Oid subid)
Definition launcher.c:1154
List * lappend(List *list, void *datum)
Definition list.c:339
void list_free_deep(List *list)
Definition list.c:1560
void LockSharedObject(Oid classid, Oid objid, uint16 objsubid, LOCKMODE lockmode)
Definition lmgr.c:1088
void UnlockRelationOid(Oid relid, LOCKMODE lockmode)
Definition lmgr.c:229
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition lmgr.c:107
#define NoLock
Definition lockdefs.h:34
#define AccessShareLock
Definition lockdefs.h:36
#define RowExclusiveLock
Definition lockdefs.h:38
char get_rel_relkind(Oid relid)
Definition lsyscache.c:2153
char * get_namespace_name(Oid nspid)
Definition lsyscache.c:3516
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition lwlock.c:1176
void LWLockRelease(LWLock *lock)
Definition lwlock.c:1793
@ LW_SHARED
Definition lwlock.h:113
DefElem * makeDefElem(char *name, Node *arg, int location)
Definition makefuncs.c:637
char * MemoryContextStrdup(MemoryContext context, const char *string)
Definition mcxt.c:1768
void pfree(void *pointer)
Definition mcxt.c:1616
void * palloc0(Size size)
Definition mcxt.c:1417
void * palloc(Size size)
Definition mcxt.c:1387
#define CHECK_FOR_INTERRUPTS()
Definition miscadmin.h:123
Oid GetUserId(void)
Definition miscinit.c:469
char * GetUserNameFromId(Oid roleid, bool noerr)
Definition miscinit.c:988
ObjectType get_relkind_objtype(char relkind)
TimestampTz replorigin_session_origin_timestamp
Definition origin.c:168
RepOriginId replorigin_by_name(const char *roname, bool missing_ok)
Definition origin.c:229
RepOriginId replorigin_create(const char *roname)
Definition origin.c:260
void replorigin_session_reset(void)
Definition origin.c:1274
void replorigin_drop_by_name(const char *name, bool missing_ok, bool nowait)
Definition origin.c:445
RepOriginId replorigin_session_origin
Definition origin.c:166
void replorigin_advance(RepOriginId node, XLogRecPtr remote_commit, XLogRecPtr local_commit, bool go_backward, bool wal_log)
Definition origin.c:916
void replorigin_session_setup(RepOriginId node, int acquired_by)
Definition origin.c:1144
XLogRecPtr replorigin_session_get_progress(bool flush)
Definition origin.c:1326
XLogRecPtr replorigin_session_origin_lsn
Definition origin.c:167
#define InvalidRepOriginId
Definition origin.h:33
ParseState * make_parsestate(ParseState *parentParseState)
Definition parse_node.c:39
ParseNamespaceItem * addRangeTableEntryForRelation(ParseState *pstate, Relation rel, int lockmode, Alias *alias, bool inh, bool inFromCl)
#define ACL_INSERT
Definition parsenodes.h:76
int16 attnum
NameData relname
Definition pg_class.h:38
#define NAMEDATALEN
const void size_t len
static int server_version
Definition pg_dumpall.c:109
#define lfirst(lc)
Definition pg_list.h:172
#define NIL
Definition pg_list.h:68
#define list_make1(x1)
Definition pg_list.h:212
#define for_each_from(cell, lst, N)
Definition pg_list.h:414
#define linitial(l)
Definition pg_list.h:178
void UpdateSubscriptionRelState(Oid subid, Oid relid, char state, XLogRecPtr sublsn, bool already_locked)
char GetSubscriptionRelState(Oid subid, Oid relid, XLogRecPtr *sublsn)
void GetPublicationsStr(List *publications, StringInfo dest, bool quote_literal)
static char buf[DEFAULT_XLOG_SEG_SIZE]
long pgstat_report_stat(bool force)
Definition pgstat.c:704
void pgstat_report_subscription_error(Oid subid, LogicalRepWorkerType wtype)
int pgsocket
Definition port.h:29
#define snprintf
Definition port.h:260
#define PGINVALID_SOCKET
Definition port.h:31
static bool DatumGetBool(Datum X)
Definition postgres.h:100
static Oid DatumGetObjectId(Datum X)
Definition postgres.h:252
static Datum ObjectIdGetDatum(Oid X)
Definition postgres.h:262
uint64_t Datum
Definition postgres.h:70
static char DatumGetChar(Datum X)
Definition postgres.h:122
static int16 DatumGetInt16(Datum X)
Definition postgres.h:172
static int32 DatumGetInt32(Datum X)
Definition postgres.h:212
static Datum CharGetDatum(char X)
Definition postgres.h:132
#define InvalidOid
unsigned int Oid
static int fd(const char *x, int i)
static int fb(int x)
char * quote_literal_cstr(const char *rawstr)
Definition quote.c:101
tree ctl
Definition radixtree.h:1838
#define RelationGetRelid(relation)
Definition rel.h:514
#define RelationGetDescr(relation)
Definition rel.h:540
#define RelationGetRelationName(relation)
Definition rel.h:548
#define RelationGetNamespace(relation)
Definition rel.h:555
int check_enable_rls(Oid relid, Oid checkAsUser, bool noError)
Definition rls.c:52
@ RLS_ENABLED
Definition rls.h:45
char * quote_qualified_identifier(const char *qualifier, const char *ident)
const char * quote_identifier(const char *ident)
Snapshot GetTransactionSnapshot(void)
Definition snapmgr.c:272
void PushActiveSnapshot(Snapshot snapshot)
Definition snapmgr.c:682
void PopActiveSnapshot(void)
Definition snapmgr.c:775
void InvalidateCatalogSnapshot(void)
Definition snapmgr.c:455
#define SpinLockRelease(lock)
Definition spin.h:61
#define SpinLockAcquire(lock)
Definition spin.h:59
void logicalrep_relmap_update(LogicalRepRelation *remoterel)
Definition relation.c:165
void logicalrep_rel_close(LogicalRepRelMapEntry *rel, LOCKMODE lockmode)
Definition relation.c:518
LogicalRepRelMapEntry * logicalrep_rel_open(LogicalRepRelId remoteid, LOCKMODE lockmode)
Definition relation.c:362
void destroyStringInfo(StringInfo str)
Definition stringinfo.c:409
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 appendStringInfoChar(StringInfo str, char ch)
Definition stringinfo.c:242
void initStringInfo(StringInfo str)
Definition stringinfo.c:97
Size keysize
Definition hsearch.h:75
Definition pg_list.h:54
LogicalRepRelation remoterel
XLogRecPtr relstate_lsn
Definition nodes.h:135
Form_pg_class rd_rel
Definition rel.h:111
Tuplestorestate * tuplestore
TupleDesc tupledesc
WalRcvExecStatus status
void ReplicationSlotDropAtPubNode(WalReceiverConn *wrconn, char *slotname, bool missing_ok)
void launch_sync_worker(LogicalRepWorkerType wtype, int nsyncworkers, Oid relid, TimestampTz *last_start_time)
Definition syncutils.c:117
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:202
#define SearchSysCacheCopy1(cacheId, key1)
Definition syscache.h:91
void table_close(Relation relation, LOCKMODE lockmode)
Definition table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition table.c:40
List * table_states_not_ready
Definition tablesync.c:125
bool AllTablesyncsReady(void)
Definition tablesync.c:1598
static bool wait_for_worker_state_change(char expected_state)
Definition tablesync.c:189
static bool wait_for_table_state_change(Oid relid, char expected_state)
Definition tablesync.c:140
static void run_tablesync_worker(void)
Definition tablesync.c:1552
void ProcessSyncingTablesForSync(XLogRecPtr current_lsn)
Definition tablesync.c:244
static List * make_copy_attnamelist(LogicalRepRelMapEntry *rel)
Definition tablesync.c:626
bool HasSubscriptionTablesCached(void)
Definition tablesync.c:1628
void TableSyncWorkerMain(Datum main_arg)
Definition tablesync.c:1578
static void fetch_remote_table_info(char *nspname, char *relname, LogicalRepRelation *lrel, List **qual, bool *gencol_published)
Definition tablesync.c:725
void ReplicationSlotNameForTablesync(Oid suboid, Oid relid, char *syncslotname, Size szslot)
Definition tablesync.c:1203
static int copy_read_data(void *outbuf, int minread, int maxread)
Definition tablesync.c:646
static char * LogicalRepSyncTableStart(XLogRecPtr *origin_startpos)
Definition tablesync.c:1219
static void copy_table(Relation rel)
Definition tablesync.c:1043
void ProcessSyncingTablesForApply(XLogRecPtr current_lsn)
Definition tablesync.c:368
static void start_table_sync(XLogRecPtr *origin_startpos, char **slotname)
Definition tablesync.c:1509
static StringInfo copybuf
Definition tablesync.c:127
void UpdateTwoPhaseState(Oid suboid, char new_state)
Definition tablesync.c:1649
bool tuplestore_gettupleslot(Tuplestorestate *state, bool forward, bool copy, TupleTableSlot *slot)
int64 tuplestore_tuple_count(Tuplestorestate *state)
Definition tuplestore.c:580
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition tuptable.h:398
static TupleTableSlot * ExecClearTuple(TupleTableSlot *slot)
Definition tuptable.h:457
void SwitchToUntrustedUser(Oid userid, UserContext *context)
Definition usercontext.c:33
void RestoreUserContext(UserContext *context)
Definition usercontext.c:87
String * makeString(char *str)
Definition value.c:63
#define strVal(v)
Definition value.h:82
#define WL_SOCKET_READABLE
#define WL_TIMEOUT
#define WL_EXIT_ON_PM_DEATH
#define WL_LATCH_SET
#define walrcv_startstreaming(conn, options)
#define walrcv_connect(conninfo, replication, logical, must_use_password, appname, err)
@ WALRCV_OK_COMMAND
@ WALRCV_OK_TUPLES
@ WALRCV_OK_COPY_OUT
#define walrcv_create_slot(conn, slotname, temporary, two_phase, failover, snapshot_action, lsn)
static void walrcv_clear_result(WalRcvExecResult *walres)
#define walrcv_server_version(conn)
#define walrcv_endstreaming(conn, next_tli)
#define walrcv_exec(conn, exec, nRetTypes, retTypes)
#define walrcv_receive(conn, buffer, wait_fd)
@ CRS_USE_SNAPSHOT
Definition walsender.h:24
@ WORKERTYPE_TABLESYNC
@ WORKERTYPE_APPLY
static bool am_tablesync_worker(void)
bool IsTransactionState(void)
Definition xact.c:388
void CommandCounterIncrement(void)
Definition xact.c:1101
void StartTransactionCommand(void)
Definition xact.c:3080
void CommitTransactionCommand(void)
Definition xact.c:3178
void AbortOutOfAnyTransaction(void)
Definition xact.c:4884
uint64 GetSystemIdentifier(void)
Definition xlog.c:4628
#define LSN_FORMAT_ARGS(lsn)
Definition xlogdefs.h:47
uint16 RepOriginId
Definition xlogdefs.h:69
uint64 XLogRecPtr
Definition xlogdefs.h:21
#define InvalidXLogRecPtr
Definition xlogdefs.h:28
uint32 TimeLineID
Definition xlogdefs.h:63