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 */
327
328 /*
329 * Drop the tablesync's origin tracking if exists.
330 *
331 * There is a chance that the user is concurrently performing refresh
332 * for the subscription where we remove the table state and its origin
333 * or the apply worker would have removed this origin. So passing
334 * missing_ok = true.
335 */
337
339 }
340 else
342}
343
344/*
345 * Handle table synchronization cooperation from the apply worker.
346 *
347 * Walk over all subscription tables that are individually tracked by the
348 * apply process (currently, all that have state other than
349 * SUBREL_STATE_READY) and manage synchronization for them.
350 *
351 * If there are tables that need synchronizing and are not being synchronized
352 * yet, start sync workers for them (if there are free slots for sync
353 * workers). To prevent starting the sync worker for the same relation at a
354 * high frequency after a failure, we store its last start time with each sync
355 * state info. We start the sync worker for the same relation after waiting
356 * at least wal_retrieve_retry_interval.
357 *
358 * For tables that are being synchronized already, check if sync workers
359 * either need action from the apply worker or have finished. This is the
360 * SYNCWAIT to CATCHUP transition.
361 *
362 * If the synchronization position is reached (SYNCDONE), then the table can
363 * be marked as READY and is no longer tracked.
364 */
365void
367{
369 {
370 Oid relid;
371 TimestampTz last_start_time;
372 };
373 static HTAB *last_start_times = NULL;
374 ListCell *lc;
375 bool started_tx;
376 bool should_exit = false;
377 Relation rel = NULL;
378
380
381 /* We need up-to-date sync state info for subscription tables here. */
383
384 /*
385 * Prepare a hash table for tracking last start times of workers, to avoid
386 * immediate restarts. We don't need it if there are no tables that need
387 * syncing.
388 */
390 {
391 HASHCTL ctl;
392
393 ctl.keysize = sizeof(Oid);
394 ctl.entrysize = sizeof(struct tablesync_start_time_mapping);
395 last_start_times = hash_create("Logical replication table sync worker start times",
396 256, &ctl, HASH_ELEM | HASH_BLOBS);
397 }
398
399 /*
400 * Clean up the hash table when we're done with all tables (just to
401 * release the bit of memory).
402 */
404 {
407 }
408
409 /*
410 * Process all tables that are being synchronized.
411 */
412 foreach(lc, table_states_not_ready)
413 {
415
416 if (!started_tx)
417 {
419 started_tx = true;
420 }
421
423
424 if (rstate->state == SUBREL_STATE_SYNCDONE)
425 {
426 /*
427 * Apply has caught up to the position where the table sync has
428 * finished. Mark the table as ready so that the apply will just
429 * continue to replicate it normally.
430 */
431 if (current_lsn >= rstate->lsn)
432 {
434
435 rstate->state = SUBREL_STATE_READY;
436 rstate->lsn = current_lsn;
437
438 /*
439 * Remove the tablesync origin tracking if exists.
440 *
441 * There is a chance that the user is concurrently performing
442 * refresh for the subscription where we remove the table
443 * state and its origin or the tablesync worker would have
444 * already removed this origin. We can't rely on tablesync
445 * worker to remove the origin tracking as if there is any
446 * error while dropping we won't restart it to drop the
447 * origin. So passing missing_ok = true.
448 *
449 * Lock the subscription and origin in the same order as we
450 * are doing during DDL commands to avoid deadlocks. See
451 * AlterSubscription_refresh.
452 */
454 0, AccessShareLock);
455
456 if (!rel)
458
460 rstate->relid,
462 sizeof(originname));
464
465 /*
466 * Update the state to READY only after the origin cleanup.
467 */
469 rstate->relid, rstate->state,
470 rstate->lsn, true);
471 }
472 }
473 else
474 {
476
477 /*
478 * Look for a sync worker for this relation.
479 */
481
484 rstate->relid, false);
485
486 if (syncworker)
487 {
488 /* Found one, update our copy of its state */
489 SpinLockAcquire(&syncworker->relmutex);
490 rstate->state = syncworker->relstate;
491 rstate->lsn = syncworker->relstate_lsn;
492 if (rstate->state == SUBREL_STATE_SYNCWAIT)
493 {
494 /*
495 * Sync worker is waiting for apply. Tell sync worker it
496 * can catchup now.
497 */
499 syncworker->relstate_lsn =
500 Max(syncworker->relstate_lsn, current_lsn);
501 }
502 SpinLockRelease(&syncworker->relmutex);
503
504 /* If we told worker to catch up, wait for it. */
505 if (rstate->state == SUBREL_STATE_SYNCWAIT)
506 {
507 /* Signal the sync worker, as it may be waiting for us. */
508 if (syncworker->proc)
510
511 /* Now safe to release the LWLock */
513
514 if (started_tx)
515 {
516 /*
517 * We must commit the existing transaction to release
518 * the existing locks before entering a busy loop.
519 * This is required to avoid any undetected deadlocks
520 * due to any existing lock as deadlock detector won't
521 * be able to detect the waits on the latch.
522 *
523 * Also close any tables prior to the commit.
524 */
525 if (rel)
526 {
527 table_close(rel, NoLock);
528 rel = NULL;
529 }
531 pgstat_report_stat(false);
532 }
533
534 /*
535 * Enter busy loop and wait for synchronization worker to
536 * reach expected state (or die trying).
537 */
539 started_tx = true;
540
543 }
544 else
546 }
547 else
548 {
549 /*
550 * If there is no sync worker for this table yet, count
551 * running sync workers for this subscription, while we have
552 * the lock.
553 */
554 int nsyncworkers =
557 bool found;
558
559 /* Now safe to release the LWLock */
561
563 HASH_ENTER, &found);
564 if (!found)
565 hentry->last_start_time = 0;
566
568 rstate->relid, &hentry->last_start_time);
569 }
570 }
571 }
572
573 /* Close table if opened */
574 if (rel)
575 table_close(rel, NoLock);
576
577
578 if (started_tx)
579 {
580 /*
581 * Even when the two_phase mode is requested by the user, it remains
582 * as 'pending' until all tablesyncs have reached READY state.
583 *
584 * When this happens, we restart the apply worker and (if the
585 * conditions are still ok) then the two_phase tri-state will become
586 * 'enabled' at that time.
587 *
588 * Note: If the subscription has no tables then leave the state as
589 * PENDING, which allows ALTER SUBSCRIPTION ... REFRESH PUBLICATION to
590 * work.
591 */
593 {
594 CommandCounterIncrement(); /* make updates visible */
595 if (AllTablesyncsReady())
596 {
597 ereport(LOG,
598 (errmsg("logical replication apply worker for subscription \"%s\" will restart so that two_phase can be enabled",
600 should_exit = true;
601 }
602 }
603
605 pgstat_report_stat(true);
606 }
607
608 if (should_exit)
609 {
610 /*
611 * Reset the last-start time for this worker so that the launcher will
612 * restart it without waiting for wal_retrieve_retry_interval.
613 */
615
616 proc_exit(0);
617 }
618}
619
620/*
621 * Create list of columns for COPY based on logical relation mapping.
622 */
623static List *
625{
627 int i;
628
629 for (i = 0; i < rel->remoterel.natts; i++)
630 {
633 }
634
635
636 return attnamelist;
637}
638
639/*
640 * Data source callback for the COPY FROM, which reads from the remote
641 * connection and passes the data back to our local COPY.
642 */
643static int
644copy_read_data(void *outbuf, int minread, int maxread)
645{
646 int bytesread = 0;
647 int avail;
648
649 /* If there are some leftover data from previous read, use it. */
650 avail = copybuf->len - copybuf->cursor;
651 if (avail)
652 {
653 if (avail > maxread)
654 avail = maxread;
655 memcpy(outbuf, &copybuf->data[copybuf->cursor], avail);
656 copybuf->cursor += avail;
657 maxread -= avail;
658 bytesread += avail;
659 }
660
661 while (maxread > 0 && bytesread < minread)
662 {
664 int len;
665 char *buf = NULL;
666
667 for (;;)
668 {
669 /* Try read the data. */
671
673
674 if (len == 0)
675 break;
676 else if (len < 0)
677 return bytesread;
678 else
679 {
680 /* Process the data */
681 copybuf->data = buf;
682 copybuf->len = len;
683 copybuf->cursor = 0;
684
685 avail = copybuf->len - copybuf->cursor;
686 if (avail > maxread)
687 avail = maxread;
688 memcpy(outbuf, &copybuf->data[copybuf->cursor], avail);
689 outbuf = (char *) outbuf + avail;
690 copybuf->cursor += avail;
691 maxread -= avail;
692 bytesread += avail;
693 }
694
696 return bytesread;
697 }
698
699 /*
700 * Wait for more data or latch.
701 */
706
708 }
709
710 return bytesread;
711}
712
713
714/*
715 * Get information about remote relation in similar fashion the RELATION
716 * message provides during replication.
717 *
718 * This function also returns (a) the relation qualifications to be used in
719 * the COPY command, and (b) whether the remote relation has published any
720 * generated column.
721 */
722static void
724 List **qual, bool *gencol_published)
725{
726 WalRcvExecResult *res;
727 StringInfoData cmd;
728 TupleTableSlot *slot;
731 Oid qualRow[] = {TEXTOID};
732 bool isnull;
733 int natt;
734 StringInfo pub_names = NULL;
737
738 lrel->nspname = nspname;
739 lrel->relname = relname;
740
741 /* First fetch Oid and replica identity. */
742 initStringInfo(&cmd);
743 appendStringInfo(&cmd, "SELECT c.oid, c.relreplident, c.relkind"
744 " FROM pg_catalog.pg_class c"
745 " INNER JOIN pg_catalog.pg_namespace n"
746 " ON (c.relnamespace = n.oid)"
747 " WHERE n.nspname = %s"
748 " AND c.relname = %s",
749 quote_literal_cstr(nspname),
753
754 if (res->status != WALRCV_OK_TUPLES)
757 errmsg("could not fetch table info for table \"%s.%s\" from publisher: %s",
758 nspname, relname, res->err)));
759
761 if (!tuplestore_gettupleslot(res->tuplestore, true, false, slot))
764 errmsg("table \"%s.%s\" not found on publisher",
765 nspname, relname)));
766
767 lrel->remoteid = DatumGetObjectId(slot_getattr(slot, 1, &isnull));
768 Assert(!isnull);
769 lrel->replident = DatumGetChar(slot_getattr(slot, 2, &isnull));
770 Assert(!isnull);
771 lrel->relkind = DatumGetChar(slot_getattr(slot, 3, &isnull));
772 Assert(!isnull);
773
776
777
778 /*
779 * Get column lists for each relation.
780 *
781 * We need to do this before fetching info about column names and types,
782 * so that we can skip columns that should not be replicated.
783 */
784 if (server_version >= 150000)
785 {
789
790 /* Build the pub_names comma-separated string. */
791 pub_names = makeStringInfo();
793
794 /*
795 * Fetch info about column lists for the relation (from all the
796 * publications).
797 */
798 resetStringInfo(&cmd);
799 appendStringInfo(&cmd,
800 "SELECT DISTINCT"
801 " (CASE WHEN (array_length(gpt.attrs, 1) = c.relnatts)"
802 " THEN NULL ELSE gpt.attrs END)"
803 " FROM pg_publication p,"
804 " LATERAL pg_get_publication_tables(p.pubname) gpt,"
805 " pg_class c"
806 " WHERE gpt.relid = %u AND c.oid = gpt.relid"
807 " AND p.pubname IN ( %s )",
808 lrel->remoteid,
809 pub_names->data);
810
813
814 if (pubres->status != WALRCV_OK_TUPLES)
817 errmsg("could not fetch column list info for table \"%s.%s\" from publisher: %s",
818 nspname, relname, pubres->err)));
819
820 /*
821 * We don't support the case where the column list is different for
822 * the same table when combining publications. See comments atop
823 * fetch_relation_list. So there should be only one row returned.
824 * Although we already checked this when creating the subscription, we
825 * still need to check here in case the column list was changed after
826 * creating the subscription and before the sync worker is started.
827 */
828 if (tuplestore_tuple_count(pubres->tuplestore) > 1)
831 errmsg("cannot use different column lists for table \"%s.%s\" in different publications",
832 nspname, relname));
833
834 /*
835 * Get the column list and build a single bitmap with the attnums.
836 *
837 * If we find a NULL value, it means all the columns should be
838 * replicated.
839 */
841 if (tuplestore_gettupleslot(pubres->tuplestore, true, false, tslot))
842 {
843 Datum cfval = slot_getattr(tslot, 1, &isnull);
844
845 if (!isnull)
846 {
847 ArrayType *arr;
848 int nelems;
849 int16 *elems;
850
852 nelems = ARR_DIMS(arr)[0];
853 elems = (int16 *) ARR_DATA_PTR(arr);
854
855 for (natt = 0; natt < nelems; natt++)
857 }
858
860 }
862
864 }
865
866 /*
867 * Now fetch column names and types.
868 */
869 resetStringInfo(&cmd);
871 "SELECT a.attnum,"
872 " a.attname,"
873 " a.atttypid,"
874 " a.attnum = ANY(i.indkey)");
875
876 /* Generated columns can be replicated since version 18. */
877 if (server_version >= 180000)
878 appendStringInfoString(&cmd, ", a.attgenerated != ''");
879
880 appendStringInfo(&cmd,
881 " FROM pg_catalog.pg_attribute a"
882 " LEFT JOIN pg_catalog.pg_index i"
883 " ON (i.indexrelid = pg_get_replica_identity_index(%u))"
884 " WHERE a.attnum > 0::pg_catalog.int2"
885 " AND NOT a.attisdropped %s"
886 " AND a.attrelid = %u"
887 " ORDER BY a.attnum",
888 lrel->remoteid,
889 (server_version >= 120000 && server_version < 180000 ?
890 "AND a.attgenerated = ''" : ""),
891 lrel->remoteid);
894
895 if (res->status != WALRCV_OK_TUPLES)
898 errmsg("could not fetch table info for table \"%s.%s\" from publisher: %s",
899 nspname, relname, res->err)));
900
901 /* We don't know the number of rows coming, so allocate enough space. */
902 lrel->attnames = palloc0(MaxTupleAttributeNumber * sizeof(char *));
903 lrel->atttyps = palloc0(MaxTupleAttributeNumber * sizeof(Oid));
904 lrel->attkeys = NULL;
905
906 /*
907 * Store the columns as a list of names. Ignore those that are not
908 * present in the column list, if there is one.
909 */
910 natt = 0;
912 while (tuplestore_gettupleslot(res->tuplestore, true, false, slot))
913 {
914 char *rel_colname;
916
917 attnum = DatumGetInt16(slot_getattr(slot, 1, &isnull));
918 Assert(!isnull);
919
920 /* If the column is not in the column list, skip it. */
922 {
923 ExecClearTuple(slot);
924 continue;
925 }
926
927 rel_colname = TextDatumGetCString(slot_getattr(slot, 2, &isnull));
928 Assert(!isnull);
929
930 lrel->attnames[natt] = rel_colname;
931 lrel->atttyps[natt] = DatumGetObjectId(slot_getattr(slot, 3, &isnull));
932 Assert(!isnull);
933
934 if (DatumGetBool(slot_getattr(slot, 4, &isnull)))
935 lrel->attkeys = bms_add_member(lrel->attkeys, natt);
936
937 /* Remember if the remote table has published any generated column. */
938 if (server_version >= 180000 && !(*gencol_published))
939 {
940 *gencol_published = DatumGetBool(slot_getattr(slot, 5, &isnull));
941 Assert(!isnull);
942 }
943
944 /* Should never happen. */
946 elog(ERROR, "too many columns in remote table \"%s.%s\"",
947 nspname, relname);
948
949 ExecClearTuple(slot);
950 }
952
953 lrel->natts = natt;
954
956
957 /*
958 * Get relation's row filter expressions. DISTINCT avoids the same
959 * expression of a table in multiple publications from being included
960 * multiple times in the final expression.
961 *
962 * We need to copy the row even if it matches just one of the
963 * publications, so we later combine all the quals with OR.
964 *
965 * For initial synchronization, row filtering can be ignored in following
966 * cases:
967 *
968 * 1) one of the subscribed publications for the table hasn't specified
969 * any row filter
970 *
971 * 2) one of the subscribed publications has puballtables set to true
972 *
973 * 3) one of the subscribed publications is declared as TABLES IN SCHEMA
974 * that includes this relation
975 */
976 if (server_version >= 150000)
977 {
978 /* Reuse the already-built pub_names. */
979 Assert(pub_names != NULL);
980
981 /* Check for row filters. */
982 resetStringInfo(&cmd);
983 appendStringInfo(&cmd,
984 "SELECT DISTINCT pg_get_expr(gpt.qual, gpt.relid)"
985 " FROM pg_publication p,"
986 " LATERAL pg_get_publication_tables(p.pubname) gpt"
987 " WHERE gpt.relid = %u"
988 " AND p.pubname IN ( %s )",
989 lrel->remoteid,
990 pub_names->data);
991
993
994 if (res->status != WALRCV_OK_TUPLES)
996 (errmsg("could not fetch table WHERE clause info for table \"%s.%s\" from publisher: %s",
997 nspname, relname, res->err)));
998
999 /*
1000 * Multiple row filter expressions for the same table will be combined
1001 * by COPY using OR. If any of the filter expressions for this table
1002 * are null, it means the whole table will be copied. In this case it
1003 * is not necessary to construct a unified row filter expression at
1004 * all.
1005 */
1007 while (tuplestore_gettupleslot(res->tuplestore, true, false, slot))
1008 {
1009 Datum rf = slot_getattr(slot, 1, &isnull);
1010
1011 if (!isnull)
1012 *qual = lappend(*qual, makeString(TextDatumGetCString(rf)));
1013 else
1014 {
1015 /* Ignore filters and cleanup as necessary. */
1016 if (*qual)
1017 {
1018 list_free_deep(*qual);
1019 *qual = NIL;
1020 }
1021 break;
1022 }
1023
1024 ExecClearTuple(slot);
1025 }
1027
1029 destroyStringInfo(pub_names);
1030 }
1031
1032 pfree(cmd.data);
1033}
1034
1035/*
1036 * Copy existing data of a table from publisher.
1037 *
1038 * Caller is responsible for locking the local relation.
1039 */
1040static void
1042{
1043 LogicalRepRelMapEntry *relmapentry;
1045 List *qual = NIL;
1046 WalRcvExecResult *res;
1047 StringInfoData cmd;
1048 CopyFromState cstate;
1050 ParseState *pstate;
1051 List *options = NIL;
1052 bool gencol_published = false;
1053
1054 /* Get the publisher relation info. */
1056 RelationGetRelationName(rel), &lrel, &qual,
1058
1059 /* Put the relation into relmap. */
1061
1062 /* Map the publisher relation to local one. */
1063 relmapentry = logicalrep_rel_open(lrel.remoteid, NoLock);
1064 Assert(rel == relmapentry->localrel);
1065
1066 /* Start copy on the publisher. */
1067 initStringInfo(&cmd);
1068
1069 /* Regular or partitioned table with no row filter or generated columns */
1070 if ((lrel.relkind == RELKIND_RELATION || lrel.relkind == RELKIND_PARTITIONED_TABLE)
1071 && qual == NIL && !gencol_published)
1072 {
1073 appendStringInfo(&cmd, "COPY %s",
1074 quote_qualified_identifier(lrel.nspname, lrel.relname));
1075
1076 /* If the table has columns, then specify the columns */
1077 if (lrel.natts)
1078 {
1079 appendStringInfoString(&cmd, " (");
1080
1081 /*
1082 * XXX Do we need to list the columns in all cases? Maybe we're
1083 * replicating all columns?
1084 */
1085 for (int i = 0; i < lrel.natts; i++)
1086 {
1087 if (i > 0)
1088 appendStringInfoString(&cmd, ", ");
1089
1091 }
1092
1093 appendStringInfoChar(&cmd, ')');
1094 }
1095
1096 appendStringInfoString(&cmd, " TO STDOUT");
1097 }
1098 else
1099 {
1100 /*
1101 * For non-tables and tables with row filters, we need to do COPY
1102 * (SELECT ...), but we can't just do SELECT * because we may need to
1103 * copy only subset of columns including generated columns. For tables
1104 * with any row filters, build a SELECT query with OR'ed row filters
1105 * for COPY.
1106 *
1107 * We also need to use this same COPY (SELECT ...) syntax when
1108 * generated columns are published, because copy of generated columns
1109 * is not supported by the normal COPY.
1110 */
1111 appendStringInfoString(&cmd, "COPY (SELECT ");
1112 for (int i = 0; i < lrel.natts; i++)
1113 {
1115 if (i < lrel.natts - 1)
1116 appendStringInfoString(&cmd, ", ");
1117 }
1118
1119 appendStringInfoString(&cmd, " FROM ");
1120
1121 /*
1122 * For regular tables, make sure we don't copy data from a child that
1123 * inherits the named table as those will be copied separately.
1124 */
1125 if (lrel.relkind == RELKIND_RELATION)
1126 appendStringInfoString(&cmd, "ONLY ");
1127
1129 /* list of OR'ed filters */
1130 if (qual != NIL)
1131 {
1132 ListCell *lc;
1133 char *q = strVal(linitial(qual));
1134
1135 appendStringInfo(&cmd, " WHERE %s", q);
1136 for_each_from(lc, qual, 1)
1137 {
1138 q = strVal(lfirst(lc));
1139 appendStringInfo(&cmd, " OR %s", q);
1140 }
1141 list_free_deep(qual);
1142 }
1143
1144 appendStringInfoString(&cmd, ") TO STDOUT");
1145 }
1146
1147 /*
1148 * Prior to v16, initial table synchronization will use text format even
1149 * if the binary option is enabled for a subscription.
1150 */
1153 {
1154 appendStringInfoString(&cmd, " WITH (FORMAT binary)");
1155 options = list_make1(makeDefElem("format",
1156 (Node *) makeString("binary"), -1));
1157 }
1158
1160 pfree(cmd.data);
1161 if (res->status != WALRCV_OK_COPY_OUT)
1162 ereport(ERROR,
1164 errmsg("could not start initial contents copy for table \"%s.%s\": %s",
1165 lrel.nspname, lrel.relname, res->err)));
1167
1169
1170 pstate = make_parsestate(NULL);
1172 NULL, false, false);
1173
1174 attnamelist = make_copy_attnamelist(relmapentry);
1175 cstate = BeginCopyFrom(pstate, rel, NULL, NULL, false, copy_read_data, attnamelist, options);
1176
1177 /* Do the copy */
1178 (void) CopyFrom(cstate);
1179
1180 logicalrep_rel_close(relmapentry, NoLock);
1181}
1182
1183/*
1184 * Determine the tablesync slot name.
1185 *
1186 * The name must not exceed NAMEDATALEN - 1 because of remote node constraints
1187 * on slot name length. We append system_identifier to avoid slot_name
1188 * collision with subscriptions in other clusters. With the current scheme
1189 * pg_%u_sync_%u_UINT64_FORMAT (3 + 10 + 6 + 10 + 20 + '\0'), the maximum
1190 * length of slot_name will be 50.
1191 *
1192 * The returned slot name is stored in the supplied buffer (syncslotname) with
1193 * the given size.
1194 *
1195 * Note: We don't use the subscription slot name as part of tablesync slot name
1196 * because we are responsible for cleaning up these slots and it could become
1197 * impossible to recalculate what name to cleanup if the subscription slot name
1198 * had changed.
1199 */
1200void
1207
1208/*
1209 * Start syncing the table in the sync worker.
1210 *
1211 * If nothing needs to be done to sync the table, we exit the worker without
1212 * any further action.
1213 *
1214 * The returned slot name is palloc'ed in current memory context.
1215 */
1216static char *
1218{
1219 char *slotname;
1220 char *err;
1221 char relstate;
1222 XLogRecPtr relstate_lsn;
1223 Relation rel;
1225 WalRcvExecResult *res;
1226 char originname[NAMEDATALEN];
1229 bool must_use_password;
1230 bool run_as_owner;
1231
1232 /* Check the state of the table synchronization. */
1236 &relstate_lsn);
1238
1239 /* Is the use of a password mandatory? */
1242
1244 MyLogicalRepWorker->relstate = relstate;
1245 MyLogicalRepWorker->relstate_lsn = relstate_lsn;
1247
1248 /*
1249 * If synchronization is already done or no longer necessary, exit now
1250 * that we've updated shared memory state.
1251 */
1252 switch (relstate)
1253 {
1255 case SUBREL_STATE_READY:
1257 FinishSyncWorker(); /* doesn't return */
1258 }
1259
1260 /* Calculate the name of the tablesync slot. */
1261 slotname = (char *) palloc(NAMEDATALEN);
1264 slotname,
1265 NAMEDATALEN);
1266
1267 /*
1268 * Here we use the slot name instead of the subscription name as the
1269 * application_name, so that it is different from the leader apply worker,
1270 * so that synchronous replication can distinguish them.
1271 */
1275 slotname, &err);
1277 ereport(ERROR,
1279 errmsg("table synchronization worker for subscription \"%s\" could not connect to the publisher: %s",
1280 MySubscription->name, err)));
1281
1285
1286 /* Assign the origin tracking record name. */
1289 originname,
1290 sizeof(originname));
1291
1293 {
1294 /*
1295 * We have previously errored out before finishing the copy so the
1296 * replication slot might exist. We want to remove the slot if it
1297 * already exists and proceed.
1298 *
1299 * XXX We could also instead try to drop the slot, last time we failed
1300 * but for that, we might need to clean up the copy state as it might
1301 * be in the middle of fetching the rows. Also, if there is a network
1302 * breakdown then it wouldn't have succeeded so trying it next time
1303 * seems like a better bet.
1304 */
1306 }
1308 {
1309 /*
1310 * The COPY phase was previously done, but tablesync then crashed
1311 * before it was able to finish normally.
1312 */
1314
1315 /*
1316 * The origin tracking name must already exist. It was created first
1317 * time this tablesync was launched.
1318 */
1323
1325
1326 goto copy_table_done;
1327 }
1328
1333
1334 /*
1335 * Update the state, create the replication origin, and make them visible
1336 * to others.
1337 */
1343 false);
1344
1345 /*
1346 * Create the replication origin in a separate transaction from the one
1347 * that sets up the origin in shared memory. This prevents the risk that
1348 * changes to the origin in shared memory cannot be rolled back if the
1349 * transaction aborts.
1350 */
1352 if (!OidIsValid(originid))
1354
1356 pgstat_report_stat(true);
1357
1359
1360 /*
1361 * Use a standard write lock here. It might be better to disallow access
1362 * to the table while it's being synchronized. But we don't want to block
1363 * the main apply process from working and it has to open the relation in
1364 * RowExclusiveLock when remapping remote relation id to local one.
1365 */
1367
1368 /*
1369 * Start a transaction in the remote node in REPEATABLE READ mode. This
1370 * ensures that both the replication slot we create (see below) and the
1371 * COPY are consistent with each other.
1372 */
1374 "BEGIN READ ONLY ISOLATION LEVEL REPEATABLE READ",
1375 0, NULL);
1376 if (res->status != WALRCV_OK_COMMAND)
1377 ereport(ERROR,
1379 errmsg("table copy could not start transaction on publisher: %s",
1380 res->err)));
1382
1383 /*
1384 * Create a new permanent logical decoding slot. This slot will be used
1385 * for the catchup phase after COPY is done, so tell it to use the
1386 * snapshot to make the final data consistent.
1387 */
1389 slotname, false /* permanent */ , false /* two_phase */ ,
1392
1393 /*
1394 * Advance the origin to the LSN got from walrcv_create_slot and then set
1395 * up the origin. The advancement is WAL logged for the purpose of
1396 * recovery. Locks are to prevent the replication origin from vanishing
1397 * while advancing.
1398 *
1399 * The purpose of doing these before the copy is to avoid doing the copy
1400 * again due to any error in advancing or setting up origin tracking.
1401 */
1404 true /* go backward */ , true /* WAL log */ );
1406
1409
1410 /*
1411 * If the user did not opt to run as the owner of the subscription
1412 * ('run_as_owner'), then copy the table as the owner of the table.
1413 */
1415 if (!run_as_owner)
1416 SwitchToUntrustedUser(rel->rd_rel->relowner, &ucxt);
1417
1418 /*
1419 * Check that our table sync worker has permission to insert into the
1420 * target table.
1421 */
1423 ACL_INSERT);
1424 if (aclresult != ACLCHECK_OK)
1426 get_relkind_objtype(rel->rd_rel->relkind),
1428
1429 /*
1430 * COPY FROM does not honor RLS policies. That is not a problem for
1431 * subscriptions owned by roles with BYPASSRLS privilege (or superuser,
1432 * who has it implicitly), but other roles should not be able to
1433 * circumvent RLS. Disallow logical replication into RLS enabled
1434 * relations for such roles.
1435 */
1437 ereport(ERROR,
1439 errmsg("user \"%s\" cannot replicate into relation with row-level security enabled: \"%s\"",
1442
1443 /* Now do the initial data copy */
1445 copy_table(rel);
1447
1448 res = walrcv_exec(LogRepWorkerWalRcvConn, "COMMIT", 0, NULL);
1449 if (res->status != WALRCV_OK_COMMAND)
1450 ereport(ERROR,
1452 errmsg("table copy could not finish transaction on publisher: %s",
1453 res->err)));
1455
1456 if (!run_as_owner)
1458
1459 table_close(rel, NoLock);
1460
1461 /* Make the copy visible. */
1463
1464 /*
1465 * Update the persisted state to indicate the COPY phase is done; make it
1466 * visible to others.
1467 */
1472 false);
1473
1475
1477
1478 elog(DEBUG1,
1479 "LogicalRepSyncTableStart: '%s' origin_startpos lsn %X/%08X",
1481
1482 /*
1483 * We are done with the initial data synchronization, update the state.
1484 */
1489
1490 /*
1491 * Finally, wait until the leader apply worker tells us to catch up and
1492 * then return to let LogicalRepApplyLoop do it.
1493 */
1495 return slotname;
1496}
1497
1498/*
1499 * Execute the initial sync with error handling. Disable the subscription,
1500 * if it's required.
1501 *
1502 * Allocate the slot name in long-lived context on return. Note that we don't
1503 * handle FATAL errors which are probably because of system resource error and
1504 * are not repeatable.
1505 */
1506static void
1508{
1509 char *sync_slotname = NULL;
1510
1512
1513 PG_TRY();
1514 {
1515 /* Call initial sync. */
1517 }
1518 PG_CATCH();
1519 {
1522 else
1523 {
1524 /*
1525 * Report the worker failed during table synchronization. Abort
1526 * the current transaction so that the stats message is sent in an
1527 * idle state.
1528 */
1532
1533 PG_RE_THROW();
1534 }
1535 }
1536 PG_END_TRY();
1537
1538 /* allocate slot name in long-lived context */
1541}
1542
1543/*
1544 * Runs the tablesync worker.
1545 *
1546 * It starts syncing tables. After a successful sync, sets streaming options
1547 * and starts streaming to catchup with apply worker.
1548 */
1549static void
1551{
1552 char originname[NAMEDATALEN];
1554 char *slotname = NULL;
1556
1557 start_table_sync(&origin_startpos, &slotname);
1558
1561 originname,
1562 sizeof(originname));
1563
1565
1567
1569
1570 /* Apply the changes till we catchup with the apply worker. */
1572}
1573
1574/* Logical Replication Tablesync worker entry point */
1575void
1586
1587/*
1588 * If the subscription has no tables then return false.
1589 *
1590 * Otherwise, are all tablesyncs READY?
1591 *
1592 * Note: This function is not suitable to be called from outside of apply or
1593 * tablesync workers because MySubscription needs to be already initialized.
1594 */
1595bool
1597{
1598 bool started_tx;
1599 bool has_tables;
1600
1601 /* We need up-to-date sync state info for subscription tables here. */
1603
1604 if (started_tx)
1605 {
1607 pgstat_report_stat(true);
1608 }
1609
1610 /*
1611 * Return false when there are no tables in subscription or not all tables
1612 * are in ready state; true otherwise.
1613 */
1614 return has_tables && (table_states_not_ready == NIL);
1615}
1616
1617/*
1618 * Return whether the subscription currently has any tables.
1619 *
1620 * Note: Unlike HasSubscriptionTables(), this function relies on cached
1621 * information for subscription tables. Additionally, it should not be
1622 * invoked outside of apply or tablesync workers, as MySubscription must be
1623 * initialized first.
1624 */
1625bool
1627{
1628 bool started_tx;
1629 bool has_tables;
1630
1631 /* We need up-to-date subscription tables info here */
1633
1634 if (started_tx)
1635 {
1637 pgstat_report_stat(true);
1638 }
1639
1640 return has_tables;
1641}
1642
1643/*
1644 * Update the two_phase state of the specified subscription in pg_subscription.
1645 */
1646void
1648{
1649 Relation rel;
1650 HeapTuple tup;
1651 bool nulls[Natts_pg_subscription];
1654
1658
1661 if (!HeapTupleIsValid(tup))
1662 elog(ERROR,
1663 "cache lookup failed for subscription oid %u",
1664 suboid);
1665
1666 /* Form a new tuple. */
1667 memset(values, 0, sizeof(values));
1668 memset(nulls, false, sizeof(nulls));
1669 memset(replaces, false, sizeof(replaces));
1670
1671 /* And update/set two_phase state */
1674
1676 values, nulls, replaces);
1677 CatalogTupleUpdate(rel, &tup->t_self, tup);
1678
1681}
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:5945
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:6303
MemoryContext ApplyContext
Definition worker.c:472
void SetupApplyOrSyncWorker(int worker_slot)
Definition worker.c:5884
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:991
#define Assert(condition)
Definition c.h:873
#define UINT64_FORMAT
Definition c.h:565
int16_t int16
Definition c.h:541
#define lengthof(array)
Definition c.h:803
#define OidIsValid(objectId)
Definition c.h:788
size_t Size
Definition c.h:619
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)
ReplOriginId replorigin_create(const char *roname)
Definition origin.c:262
ReplOriginXactState replorigin_xact_state
Definition origin.c:166
ReplOriginId replorigin_by_name(const char *roname, bool missing_ok)
Definition origin.c:231
void replorigin_advance(ReplOriginId node, XLogRecPtr remote_commit, XLogRecPtr local_commit, bool go_backward, bool wal_log)
Definition origin.c:918
void replorigin_session_reset(void)
Definition origin.c:1276
void replorigin_drop_by_name(const char *name, bool missing_ok, bool nowait)
Definition origin.c:447
XLogRecPtr replorigin_session_get_progress(bool flush)
Definition origin.c:1328
void replorigin_xact_clear(bool clear_origin)
Definition origin.c:1352
void replorigin_session_setup(ReplOriginId node, int acquired_by)
Definition origin.c:1146
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
ReplOriginId origin
Definition origin.h:45
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:1596
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:1550
void ProcessSyncingTablesForSync(XLogRecPtr current_lsn)
Definition tablesync.c:244
static List * make_copy_attnamelist(LogicalRepRelMapEntry *rel)
Definition tablesync.c:624
bool HasSubscriptionTablesCached(void)
Definition tablesync.c:1626
void TableSyncWorkerMain(Datum main_arg)
Definition tablesync.c:1576
static void fetch_remote_table_info(char *nspname, char *relname, LogicalRepRelation *lrel, List **qual, bool *gencol_published)
Definition tablesync.c:723
void ReplicationSlotNameForTablesync(Oid suboid, Oid relid, char *syncslotname, Size szslot)
Definition tablesync.c:1201
static int copy_read_data(void *outbuf, int minread, int maxread)
Definition tablesync.c:644
static char * LogicalRepSyncTableStart(XLogRecPtr *origin_startpos)
Definition tablesync.c:1217
static void copy_table(Relation rel)
Definition tablesync.c:1041
void ProcessSyncingTablesForApply(XLogRecPtr current_lsn)
Definition tablesync.c:366
static void start_table_sync(XLogRecPtr *origin_startpos, char **slotname)
Definition tablesync.c:1507
static StringInfo copybuf
Definition tablesync.c:127
void UpdateTwoPhaseState(Oid suboid, char new_state)
Definition tablesync.c:1647
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:4627
#define LSN_FORMAT_ARGS(lsn)
Definition xlogdefs.h:47
uint16 ReplOriginId
Definition xlogdefs.h:69
uint64 XLogRecPtr
Definition xlogdefs.h:21
#define InvalidXLogRecPtr
Definition xlogdefs.h:28
uint32 TimeLineID
Definition xlogdefs.h:63