PostgreSQL Source Code git master
Loading...
Searching...
No Matches
decode.c
Go to the documentation of this file.
1/* -------------------------------------------------------------------------
2 *
3 * decode.c
4 * This module decodes WAL records read using xlogreader.h's APIs for the
5 * purpose of logical decoding by passing information to the
6 * reorderbuffer module (containing the actual changes) and to the
7 * snapbuild module to build a fitting catalog snapshot (to be able to
8 * properly decode the changes in the reorderbuffer).
9 *
10 * NOTE:
11 * This basically tries to handle all low level xlog stuff for
12 * reorderbuffer.c and snapbuild.c. There's some minor leakage where a
13 * specific record's struct is used to pass data along, but those just
14 * happen to contain the right amount of data in a convenient
15 * format. There isn't and shouldn't be much intelligence about the
16 * contents of records in here except turning them into a more usable
17 * format.
18 *
19 * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
20 * Portions Copyright (c) 1994, Regents of the University of California
21 *
22 * IDENTIFICATION
23 * src/backend/replication/logical/decode.c
24 *
25 * -------------------------------------------------------------------------
26 */
27#include "postgres.h"
28
29#include "access/heapam_xlog.h"
30#include "access/transam.h"
31#include "access/xact.h"
33#include "access/xlogreader.h"
34#include "access/xlogrecord.h"
35#include "catalog/pg_control.h"
36#include "commands/repack.h"
37#include "replication/decode.h"
38#include "replication/logical.h"
39#include "replication/message.h"
42#include "storage/standbydefs.h"
43
44/* individual record(group)'s handlers */
51
54 bool two_phase);
57 bool two_phase);
60
61
62/* common function to decode tuples */
63static void DecodeXLogTuple(char *data, Size len, HeapTuple tuple);
64
65/* helper functions for decoding transactions */
66static inline bool FilterPrepare(LogicalDecodingContext *ctx,
67 TransactionId xid, const char *gid);
70 ReplOriginId origin_id);
71
72/*
73 * Take every XLogReadRecord()ed record and perform the actions required to
74 * decode it using the output plugin already setup in the logical decoding
75 * context.
76 *
77 * NB: Note that every record's xid needs to be processed by reorderbuffer
78 * (xids contained in the content of records are not relevant for this rule).
79 * That means that for records which'd otherwise not go through the
80 * reorderbuffer ReorderBufferProcessXid() has to be called. We don't want to
81 * call ReorderBufferProcessXid for each record type by default, because
82 * e.g. empty xacts can be handled more efficiently if there's no previous
83 * state for them.
84 *
85 * We also support the ability to fast forward thru records, skipping some
86 * record types completely - see individual record types for details.
87 */
88void
90{
94
95 buf.origptr = ctx->reader->ReadRecPtr;
96 buf.endptr = ctx->reader->EndRecPtr;
97 buf.record = record;
98
99 txid = XLogRecGetTopXid(record);
100
101 /*
102 * If the top-level xid is valid, we need to assign the subxact to the
103 * top-level xact. We need to do this for all records, hence we do it
104 * before the switch.
105 */
107 {
109 txid,
110 XLogRecGetXid(record),
111 buf.origptr);
112 }
113
114 rmgr = GetRmgr(XLogRecGetRmid(record));
115
116 if (rmgr.rm_decode != NULL)
117 rmgr.rm_decode(ctx, &buf);
118 else
119 {
120 /* just deal with xid, and done */
122 buf.origptr);
123 }
124}
125
126/*
127 * Handle rmgr XLOG_ID records for LogicalDecodingProcessRecord().
128 */
129void
131{
132 SnapBuild *builder = ctx->snapshot_builder;
133 uint8 info = XLogRecGetInfo(buf->record) & ~XLR_INFO_MASK;
134
136 buf->origptr);
137
138 switch (info)
139 {
140 /* this is also used in END_OF_RECOVERY checkpoints */
143 SnapBuildSerializationPoint(builder, buf->origptr);
144
145 break;
147
148 /*
149 * a RUNNING_XACTS record will have been logged near to this, we
150 * can restart from there.
151 */
152 break;
154 {
155 bool logical_decoding;
156
157 memcpy(&logical_decoding, XLogRecGetData(buf->record), sizeof(bool));
158
159 /*
160 * Error out as we should not decode this WAL record.
161 *
162 * Logical decoding is disabled, and existing logical slots on
163 * the standby are invalidated when this WAL record is
164 * replayed. No logical decoder can process this WAL record
165 * until replay completes, and by then the slots are already
166 * invalidated. Furthermore, no new logical slots can be
167 * created while logical decoding is disabled. This cannot
168 * occur even on primary either, since it will not restart
169 * with wal_level < replica if any logical slots exist.
170 */
171 elog(ERROR, "unexpected logical decoding status change %d",
173
174 break;
175 }
176 case XLOG_NOOP:
177 case XLOG_NEXTOID:
178 case XLOG_SWITCH:
179 case XLOG_BACKUP_END:
182 case XLOG_FPW_CHANGE:
184 case XLOG_FPI:
187 break;
188 default:
189 elog(ERROR, "unexpected RM_XLOG_ID record type: %u", info);
190 }
191}
192
193void
195{
196 uint8 info = XLogRecGetInfo(buf->record) & ~XLR_INFO_MASK;
197
198 ReorderBufferProcessXid(ctx->reorder, XLogRecGetXid(buf->record), buf->origptr);
199
200 switch (info)
201 {
202 case XLOG2_CHECKSUMS:
203 break;
204 default:
205 elog(ERROR, "unexpected RM_XLOG2_ID record type: %u", info);
206 }
207}
208
209/*
210 * Handle rmgr XACT_ID records for LogicalDecodingProcessRecord().
211 */
212void
214{
215 SnapBuild *builder = ctx->snapshot_builder;
216 ReorderBuffer *reorder = ctx->reorder;
219
220 /*
221 * If the snapshot isn't yet fully built, we cannot decode anything, so
222 * bail out.
223 */
225 return;
226
227 switch (info)
228 {
229 case XLOG_XACT_COMMIT:
231 {
234 TransactionId xid;
235 bool two_phase = false;
236
239
240 if (!TransactionIdIsValid(parsed.twophase_xid))
241 xid = XLogRecGetXid(r);
242 else
243 xid = parsed.twophase_xid;
244
245 /*
246 * We would like to process the transaction in a two-phase
247 * manner iff output plugin supports two-phase commits and
248 * doesn't filter the transaction at prepare time.
249 */
250 if (info == XLOG_XACT_COMMIT_PREPARED)
251 two_phase = !(FilterPrepare(ctx, xid,
252 parsed.twophase_gid));
253
254 DecodeCommit(ctx, buf, &parsed, xid, two_phase);
255 break;
256 }
257 case XLOG_XACT_ABORT:
259 {
262 TransactionId xid;
263 bool two_phase = false;
264
267
268 if (!TransactionIdIsValid(parsed.twophase_xid))
269 xid = XLogRecGetXid(r);
270 else
271 xid = parsed.twophase_xid;
272
273 /*
274 * We would like to process the transaction in a two-phase
275 * manner iff output plugin supports two-phase commits and
276 * doesn't filter the transaction at prepare time.
277 */
278 if (info == XLOG_XACT_ABORT_PREPARED)
279 two_phase = !(FilterPrepare(ctx, xid,
280 parsed.twophase_gid));
281
282 DecodeAbort(ctx, buf, &parsed, xid, two_phase);
283 break;
284 }
286
287 /*
288 * We assign subxact to the toplevel xact while processing each
289 * record if required. So, we don't need to do anything here. See
290 * LogicalDecodingProcessRecord.
291 */
292 break;
294 {
295 TransactionId xid;
297
298 xid = XLogRecGetXid(r);
300
301 /*
302 * Execute the invalidations for xid-less transactions,
303 * otherwise, accumulate them so that they can be processed at
304 * the commit time.
305 */
306 if (TransactionIdIsValid(xid))
307 {
308 if (!ctx->fast_forward)
310 buf->origptr,
311 invals->nmsgs,
312 invals->msgs);
314 buf->origptr);
315 }
316 else if (!ctx->fast_forward)
318 invals->nmsgs,
319 invals->msgs);
320
321 break;
322 }
324 {
327
328 /* ok, parse it */
331 xlrec, &parsed);
332
333 /*
334 * We would like to process the transaction in a two-phase
335 * manner iff output plugin supports two-phase commits and
336 * doesn't filter the transaction at prepare time.
337 */
338 if (FilterPrepare(ctx, parsed.twophase_xid,
339 parsed.twophase_gid))
340 {
341 ReorderBufferProcessXid(reorder, parsed.twophase_xid,
342 buf->origptr);
343 break;
344 }
345
346 /*
347 * Note that if the prepared transaction has locked [user]
348 * catalog tables exclusively then decoding prepare can block
349 * till the main transaction is committed because it needs to
350 * lock the catalog tables.
351 *
352 * XXX Now, this can even lead to a deadlock if the prepare
353 * transaction is waiting to get it logically replicated for
354 * distributed 2PC. This can be avoided by disallowing
355 * preparing transactions that have locked [user] catalog
356 * tables exclusively but as of now, we ask users not to do
357 * such an operation.
358 */
359 DecodePrepare(ctx, buf, &parsed);
360 break;
361 }
362 default:
363 elog(ERROR, "unexpected RM_XACT_ID record type: %u", info);
364 }
365}
366
367/*
368 * Handle rmgr STANDBY_ID records for LogicalDecodingProcessRecord().
369 */
370void
372{
373 SnapBuild *builder = ctx->snapshot_builder;
376
378
379 switch (info)
380 {
382 {
384
385 /*
386 * Update this decoder's idea of transactions currently
387 * running. In doing so we will determine whether we have
388 * reached consistent status.
389 */
390 SnapBuildProcessRunningXacts(builder, buf->origptr, running);
391
392 /*
393 * Abort all transactions that we keep track of, that are
394 * older than the record's oldestRunningXid. This is the most
395 * convenient spot for doing so since, in contrast to shutdown
396 * or end-of-recovery checkpoints, we have information about
397 * all running transactions which includes prepared ones,
398 * while shutdown checkpoints just know that no non-prepared
399 * transactions are in progress.
400 */
402 }
403 break;
405 break;
407
408 /*
409 * We are processing the invalidations at the command level via
410 * XLOG_XACT_INVALIDATIONS. So we don't need to do anything here.
411 */
412 break;
413 default:
414 elog(ERROR, "unexpected RM_STANDBY_ID record type: %u", info);
415 }
416}
417
418/*
419 * Handle rmgr HEAP2_ID records for LogicalDecodingProcessRecord().
420 */
421void
423{
424 uint8 info = XLogRecGetInfo(buf->record) & XLOG_HEAP_OPMASK;
425 TransactionId xid = XLogRecGetXid(buf->record);
426 SnapBuild *builder = ctx->snapshot_builder;
427
428 ReorderBufferProcessXid(ctx->reorder, xid, buf->origptr);
429
430 /*
431 * If we don't have snapshot or we are just fast-forwarding, there is no
432 * point in decoding data changes. However, it's crucial to build the base
433 * snapshot during fast-forward mode (as is done in
434 * SnapBuildProcessChange()) because we require the snapshot's xmin when
435 * determining the candidate catalog_xmin for the replication slot. See
436 * SnapBuildProcessRunningXacts().
437 */
439 return;
440
441 switch (info)
442 {
444 if (SnapBuildProcessChange(builder, xid, buf->origptr) &&
445 !ctx->fast_forward &&
448 break;
450 if (!ctx->fast_forward)
451 {
453
455 SnapBuildProcessNewCid(builder, xid, buf->origptr, xlrec);
456 }
457 break;
459
460 /*
461 * Although these records only exist to serve the needs of logical
462 * decoding, all the work happens as part of crash or archive
463 * recovery, so we don't need to do anything here.
464 */
465 break;
466
467 /*
468 * Everything else here is just low level physical stuff we're not
469 * interested in.
470 */
475 break;
476 default:
477 elog(ERROR, "unexpected RM_HEAP2_ID record type: %u", info);
478 }
479}
480
481/*
482 * Handle rmgr HEAP_ID records for LogicalDecodingProcessRecord().
483 */
484void
486{
487 uint8 info = XLogRecGetInfo(buf->record) & XLOG_HEAP_OPMASK;
488 TransactionId xid = XLogRecGetXid(buf->record);
489 SnapBuild *builder = ctx->snapshot_builder;
490
491 ReorderBufferProcessXid(ctx->reorder, xid, buf->origptr);
492
493 /*
494 * If we don't have snapshot or we are just fast-forwarding, there is no
495 * point in decoding data changes. However, it's crucial to build the base
496 * snapshot during fast-forward mode (as is done in
497 * SnapBuildProcessChange()) because we require the snapshot's xmin when
498 * determining the candidate catalog_xmin for the replication slot. See
499 * SnapBuildProcessRunningXacts().
500 */
502 return;
503
504 switch (info)
505 {
506 case XLOG_HEAP_INSERT:
507 if (SnapBuildProcessChange(builder, xid, buf->origptr) &&
508 !ctx->fast_forward &&
510 DecodeInsert(ctx, buf);
511 break;
512
513 /*
514 * Treat HOT update as normal updates. There is no useful
515 * information in the fact that we could make it a HOT update
516 * locally and the WAL layout is compatible.
517 */
519 case XLOG_HEAP_UPDATE:
520 if (SnapBuildProcessChange(builder, xid, buf->origptr) &&
521 !ctx->fast_forward &&
523 DecodeUpdate(ctx, buf);
524 break;
525
526 case XLOG_HEAP_DELETE:
527 if (SnapBuildProcessChange(builder, xid, buf->origptr) &&
528 !ctx->fast_forward &&
530 DecodeDelete(ctx, buf);
531 break;
532
534 if (SnapBuildProcessChange(builder, xid, buf->origptr) &&
535 !ctx->fast_forward &&
537 DecodeTruncate(ctx, buf);
538 break;
539
541
542 /*
543 * Inplace updates are only ever performed on catalog tuples and
544 * can, per definition, not change tuple visibility. Since we
545 * also don't decode catalog tuples, we're not interested in the
546 * record's contents.
547 */
548 break;
549
551 if (SnapBuildProcessChange(builder, xid, buf->origptr) &&
552 !ctx->fast_forward &&
555 break;
556
557 case XLOG_HEAP_LOCK:
558 /* we don't care about row level locks for now */
559 break;
560
561 default:
562 elog(ERROR, "unexpected RM_HEAP_ID record type: %u", info);
563 break;
564 }
565}
566
567/*
568 * Ask output plugin whether we want to skip this PREPARE and send
569 * this transaction as a regular commit later.
570 */
571static inline bool
573 const char *gid)
574{
575 /*
576 * Skip if decoding of two-phase transactions at PREPARE time is not
577 * enabled. In that case, all two-phase transactions are considered
578 * filtered out and will be applied as regular transactions at COMMIT
579 * PREPARED.
580 */
581 if (!ctx->twophase)
582 return true;
583
584 /*
585 * The filter_prepare callback is optional. When not supplied, all
586 * prepared transactions should go through.
587 */
588 if (ctx->callbacks.filter_prepare_cb == NULL)
589 return false;
590
591 return filter_prepare_cb_wrapper(ctx, xid, gid);
592}
593
594static inline bool
596{
598 return false;
599
600 return filter_by_origin_cb_wrapper(ctx, origin_id);
601}
602
603/*
604 * Handle rmgr LOGICALMSG_ID records for LogicalDecodingProcessRecord().
605 */
606void
608{
609 SnapBuild *builder = ctx->snapshot_builder;
613 ReplOriginId origin_id = XLogRecGetOrigin(r);
614 Snapshot snapshot = NULL;
615 xl_logical_message *message;
616
617 if (info != XLOG_LOGICAL_MESSAGE)
618 elog(ERROR, "unexpected RM_LOGICALMSG_ID record type: %u", info);
619
621
622 /* If we don't have snapshot, there is no point in decoding messages */
624 return;
625
626 message = (xl_logical_message *) XLogRecGetData(r);
627
628 if (message->dbId != ctx->slot->data.database ||
629 FilterByOrigin(ctx, origin_id))
630 return;
631
632 if (message->transactional &&
633 !SnapBuildProcessChange(builder, xid, buf->origptr))
634 return;
635 else if (!message->transactional &&
637 SnapBuildXactNeedsSkip(builder, buf->origptr)))
638 return;
639
640 /*
641 * We also skip decoding in fast_forward mode. This check must be last
642 * because we don't want to set the processing_required flag unless we
643 * have a decodable message.
644 */
645 if (ctx->fast_forward)
646 {
647 /*
648 * We need to set processing_required flag to notify the message's
649 * existence to the caller. Usually, the flag is set when either the
650 * COMMIT or ABORT records are decoded, but this must be turned on
651 * here because the non-transactional logical message is decoded
652 * without waiting for these records.
653 */
654 if (!message->transactional)
655 ctx->processing_required = true;
656
657 return;
658 }
659
660 /*
661 * If this is a non-transactional change, get the snapshot we're expected
662 * to use. We only get here when the snapshot is consistent, and the
663 * change is not meant to be skipped.
664 *
665 * For transactional changes we don't need a snapshot, we'll use the
666 * regular snapshot maintained by ReorderBuffer. We just leave it NULL.
667 */
668 if (!message->transactional)
669 snapshot = SnapBuildGetOrBuildSnapshot(builder);
670
671 ReorderBufferQueueMessage(ctx->reorder, xid, snapshot, buf->endptr,
672 message->transactional,
673 message->message, /* first part of message is
674 * prefix */
675 message->message_size,
676 message->message + message->prefix_size);
677}
678
679/*
680 * Consolidated commit record handling between the different form of commit
681 * records.
682 *
683 * 'two_phase' indicates that caller wants to process the transaction in two
684 * phases, first process prepare if not already done and then process
685 * commit_prepared.
686 */
687static void
690 bool two_phase)
691{
692 XLogRecPtr origin_lsn = InvalidXLogRecPtr;
693 TimestampTz commit_time = parsed->xact_time;
694 ReplOriginId origin_id = XLogRecGetOrigin(buf->record);
695 int i;
696
697 if (parsed->xinfo & XACT_XINFO_HAS_ORIGIN)
698 {
699 origin_lsn = parsed->origin_lsn;
700 commit_time = parsed->origin_timestamp;
701 }
702
703 SnapBuildCommitTxn(ctx->snapshot_builder, buf->origptr, xid,
704 parsed->nsubxacts, parsed->subxacts,
705 parsed->xinfo);
706
707 /* ----
708 * Check whether we are interested in this specific transaction, and tell
709 * the reorderbuffer to forget the content of the (sub-)transactions
710 * if not.
711 *
712 * We can't just use ReorderBufferAbort() here, because we need to execute
713 * the transaction's invalidations. This currently won't be needed if
714 * we're just skipping over the transaction because currently we only do
715 * so during startup, to get to the first transaction the client needs. As
716 * we have reset the catalog caches before starting to read WAL, and we
717 * haven't yet touched any catalogs, there can't be anything to invalidate.
718 * But if we're "forgetting" this commit because it happened in another
719 * database, the invalidations might be important, because they could be
720 * for shared catalogs and we might have loaded data into the relevant
721 * syscaches.
722 * ---
723 */
724 if (DecodeTXNNeedSkip(ctx, buf, parsed->dbId, origin_id))
725 {
726 for (i = 0; i < parsed->nsubxacts; i++)
727 {
728 ReorderBufferForget(ctx->reorder, parsed->subxacts[i], buf->origptr);
729 }
730 ReorderBufferForget(ctx->reorder, xid, buf->origptr);
731
732 return;
733 }
734
735 /* tell the reorderbuffer about the surviving subtransactions */
736 for (i = 0; i < parsed->nsubxacts; i++)
737 {
738 ReorderBufferCommitChild(ctx->reorder, xid, parsed->subxacts[i],
739 buf->origptr, buf->endptr);
740 }
741
742 /*
743 * Send the final commit record if the transaction data is already
744 * decoded, otherwise, process the entire transaction.
745 */
746 if (two_phase)
747 {
748 ReorderBufferFinishPrepared(ctx->reorder, xid, buf->origptr, buf->endptr,
750 commit_time, origin_id, origin_lsn,
751 parsed->twophase_gid, true);
752 }
753 else
754 {
755 ReorderBufferCommit(ctx->reorder, xid, buf->origptr, buf->endptr,
756 commit_time, origin_id, origin_lsn);
757 }
758
759 /*
760 * Update the decoding stats at transaction prepare/commit/abort.
761 * Additionally we send the stats when we spill or stream the changes to
762 * avoid losing them in case the decoding is interrupted. It is not clear
763 * that sending more or less frequently than this would be better.
764 */
766}
767
768/*
769 * Decode PREPARE record. Similar logic as in DecodeCommit.
770 *
771 * Note that we don't skip prepare even if have detected concurrent abort
772 * because it is quite possible that we had already sent some changes before we
773 * detect abort in which case we need to abort those changes in the subscriber.
774 * To abort such changes, we do send the prepare and then the rollback prepared
775 * which is what happened on the publisher-side as well. Now, we can invent a
776 * new abort API wherein in such cases we send abort and skip sending prepared
777 * and rollback prepared but then it is not that straightforward because we
778 * might have streamed this transaction by that time in which case it is
779 * handled when the rollback is encountered. It is not impossible to optimize
780 * the concurrent abort case but it can introduce design complexity w.r.t
781 * handling different cases so leaving it for now as it doesn't seem worth it.
782 */
783static void
786{
787 SnapBuild *builder = ctx->snapshot_builder;
788 XLogRecPtr origin_lsn = parsed->origin_lsn;
789 TimestampTz prepare_time = parsed->xact_time;
790 ReplOriginId origin_id = XLogRecGetOrigin(buf->record);
791 int i;
792 TransactionId xid = parsed->twophase_xid;
793
794 if (parsed->origin_timestamp != 0)
795 prepare_time = parsed->origin_timestamp;
796
797 /*
798 * Remember the prepare info for a txn so that it can be used later in
799 * commit prepared if required. See ReorderBufferFinishPrepared.
800 */
801 if (!ReorderBufferRememberPrepareInfo(ctx->reorder, xid, buf->origptr,
802 buf->endptr, prepare_time, origin_id,
803 origin_lsn))
804 return;
805
806 /* We can't start streaming unless a consistent state is reached. */
808 {
810 return;
811 }
812
813 /*
814 * Check whether we need to process this transaction. See
815 * DecodeTXNNeedSkip for the reasons why we sometimes want to skip the
816 * transaction.
817 *
818 * We can't call ReorderBufferForget as we did in DecodeCommit as the txn
819 * hasn't yet been committed, removing this txn before a commit might
820 * result in the computation of an incorrect restart_lsn. See
821 * SnapBuildProcessRunningXacts. But we need to process cache
822 * invalidations if there are any for the reasons mentioned in
823 * DecodeCommit.
824 */
825 if (DecodeTXNNeedSkip(ctx, buf, parsed->dbId, origin_id))
826 {
828 ReorderBufferInvalidate(ctx->reorder, xid, buf->origptr);
829 return;
830 }
831
832 /* Tell the reorderbuffer about the surviving subtransactions. */
833 for (i = 0; i < parsed->nsubxacts; i++)
834 {
835 ReorderBufferCommitChild(ctx->reorder, xid, parsed->subxacts[i],
836 buf->origptr, buf->endptr);
837 }
838
839 /* replay actions of all transaction + subtransactions in order */
840 ReorderBufferPrepare(ctx->reorder, xid, parsed->twophase_gid);
841
842 /*
843 * Update the decoding stats at transaction prepare/commit/abort.
844 * Additionally we send the stats when we spill or stream the changes to
845 * avoid losing them in case the decoding is interrupted. It is not clear
846 * that sending more or less frequently than this would be better.
847 */
849}
850
851
852/*
853 * Get the data from the various forms of abort records and pass it on to
854 * snapbuild.c and reorderbuffer.c.
855 *
856 * 'two_phase' indicates to finish prepared transaction.
857 */
858static void
861 bool two_phase)
862{
863 int i;
864 XLogRecPtr origin_lsn = InvalidXLogRecPtr;
865 TimestampTz abort_time = parsed->xact_time;
866 ReplOriginId origin_id = XLogRecGetOrigin(buf->record);
867 bool skip_xact;
868
869 if (parsed->xinfo & XACT_XINFO_HAS_ORIGIN)
870 {
871 origin_lsn = parsed->origin_lsn;
872 abort_time = parsed->origin_timestamp;
873 }
874
875 /*
876 * Check whether we need to process this transaction. See
877 * DecodeTXNNeedSkip for the reasons why we sometimes want to skip the
878 * transaction.
879 */
880 skip_xact = DecodeTXNNeedSkip(ctx, buf, parsed->dbId, origin_id);
881
882 /*
883 * Send the final rollback record for a prepared transaction unless we
884 * need to skip it. For non-two-phase xacts, simply forget the xact.
885 */
886 if (two_phase && !skip_xact)
887 {
888 ReorderBufferFinishPrepared(ctx->reorder, xid, buf->origptr, buf->endptr,
890 abort_time, origin_id, origin_lsn,
891 parsed->twophase_gid, false);
892 }
893 else
894 {
895 for (i = 0; i < parsed->nsubxacts; i++)
896 {
897 ReorderBufferAbort(ctx->reorder, parsed->subxacts[i],
898 buf->record->EndRecPtr, abort_time);
899 }
900
901 ReorderBufferAbort(ctx->reorder, xid, buf->record->EndRecPtr,
902 abort_time);
903 }
904
905 /* update the decoding stats */
907}
908
909/*
910 * Parse XLOG_HEAP_INSERT (not MULTI_INSERT!) records into tuplebufs.
911 *
912 * Inserts can contain the new tuple.
913 */
914static void
916{
917 Size datalen;
918 char *tupledata;
922 ReorderBufferChange *change;
923 RelFileLocator target_locator;
924
926
927 /*
928 * Ignore insert records without new tuples (this does happen when
929 * raw_heap_insert marks the TOAST record as HEAP_INSERT_NO_LOGICAL).
930 */
931 if (!(xlrec->flags & XLH_INSERT_CONTAINS_NEW_TUPLE))
932 return;
933
934 /* only interested in our database */
935 XLogRecGetBlockTag(r, 0, &target_locator, NULL, NULL);
936 if (target_locator.dbOid != ctx->slot->data.database)
937 return;
938
939 /* output plugin doesn't look for this origin, no need to queue */
940 if (FilterByOrigin(ctx, XLogRecGetOrigin(r)))
941 return;
942
943 change = ReorderBufferAllocChange(ctx->reorder);
944 if (!(xlrec->flags & XLH_INSERT_IS_SPECULATIVE))
946 else
948 change->origin_id = XLogRecGetOrigin(r);
949
950 memcpy(&change->data.tp.rlocator, &target_locator, sizeof(RelFileLocator));
951
952 tupledata = XLogRecGetBlockData(r, 0, &datalen);
953 tuplelen = datalen - SizeOfHeapHeader;
954
955 change->data.tp.newtuple =
957
958 DecodeXLogTuple(tupledata, datalen, change->data.tp.newtuple);
959
960 change->data.tp.clear_toast_afterwards = true;
961
963 change,
965}
966
967/*
968 * Parse XLOG_HEAP_UPDATE and XLOG_HEAP_HOT_UPDATE, which have the same layout
969 * in the record, from wal into proper tuplebufs.
970 *
971 * Updates can possibly contain a new tuple and the old primary key.
972 */
973static void
975{
978 ReorderBufferChange *change;
979 char *data;
980 RelFileLocator target_locator;
981
983
984 /* only interested in our database */
985 XLogRecGetBlockTag(r, 0, &target_locator, NULL, NULL);
986 if (target_locator.dbOid != ctx->slot->data.database)
987 return;
988
989 /* output plugin doesn't look for this origin, no need to queue */
990 if (FilterByOrigin(ctx, XLogRecGetOrigin(r)))
991 return;
992
993 change = ReorderBufferAllocChange(ctx->reorder);
995 change->origin_id = XLogRecGetOrigin(r);
996 memcpy(&change->data.tp.rlocator, &target_locator, sizeof(RelFileLocator));
997
999 {
1000 Size datalen;
1001 Size tuplelen;
1002
1003 data = XLogRecGetBlockData(r, 0, &datalen);
1004
1005 tuplelen = datalen - SizeOfHeapHeader;
1006
1007 change->data.tp.newtuple =
1009
1010 DecodeXLogTuple(data, datalen, change->data.tp.newtuple);
1011 }
1012
1013 if (xlrec->flags & XLH_UPDATE_CONTAINS_OLD)
1014 {
1015 Size datalen;
1016 Size tuplelen;
1017
1018 /* caution, remaining data in record is not aligned */
1020 datalen = XLogRecGetDataLen(r) - SizeOfHeapUpdate;
1021 tuplelen = datalen - SizeOfHeapHeader;
1022
1023 change->data.tp.oldtuple =
1025
1026 DecodeXLogTuple(data, datalen, change->data.tp.oldtuple);
1027 }
1028
1029 change->data.tp.clear_toast_afterwards = true;
1030
1032 change, false);
1033}
1034
1035/*
1036 * Parse XLOG_HEAP_DELETE from wal into proper tuplebufs.
1037 *
1038 * Deletes can possibly contain the old primary key.
1039 */
1040static void
1042{
1045 ReorderBufferChange *change;
1046 RelFileLocator target_locator;
1047
1049
1050 /*
1051 * Skip changes that were marked as ignorable at origin.
1052 *
1053 * (This is used for changes that affect relations not visible to other
1054 * transactions, such as the transient table during concurrent repack.)
1055 */
1056 if (xlrec->flags & XLH_DELETE_NO_LOGICAL)
1057 return;
1058
1059 /* only interested in our database */
1060 XLogRecGetBlockTag(r, 0, &target_locator, NULL, NULL);
1061 if (target_locator.dbOid != ctx->slot->data.database)
1062 return;
1063
1064 /* output plugin doesn't look for this origin, no need to queue */
1065 if (FilterByOrigin(ctx, XLogRecGetOrigin(r)))
1066 return;
1067
1068 change = ReorderBufferAllocChange(ctx->reorder);
1069
1070 if (xlrec->flags & XLH_DELETE_IS_SUPER)
1072 else
1074
1075 change->origin_id = XLogRecGetOrigin(r);
1076
1077 memcpy(&change->data.tp.rlocator, &target_locator, sizeof(RelFileLocator));
1078
1079 /* old primary key stored */
1080 if (xlrec->flags & XLH_DELETE_CONTAINS_OLD)
1081 {
1083 Size tuplelen = datalen - SizeOfHeapHeader;
1084
1086
1087 change->data.tp.oldtuple =
1089
1091 datalen, change->data.tp.oldtuple);
1092 }
1093
1094 change->data.tp.clear_toast_afterwards = true;
1095
1097 change, false);
1098}
1099
1100/*
1101 * Parse XLOG_HEAP_TRUNCATE from wal
1102 */
1103static void
1105{
1108 ReorderBufferChange *change;
1109
1111
1112 /* only interested in our database */
1113 if (xlrec->dbId != ctx->slot->data.database)
1114 return;
1115
1116 /* output plugin doesn't look for this origin, no need to queue */
1117 if (FilterByOrigin(ctx, XLogRecGetOrigin(r)))
1118 return;
1119
1120 change = ReorderBufferAllocChange(ctx->reorder);
1122 change->origin_id = XLogRecGetOrigin(r);
1123 if (xlrec->flags & XLH_TRUNCATE_CASCADE)
1124 change->data.truncate.cascade = true;
1125 if (xlrec->flags & XLH_TRUNCATE_RESTART_SEQS)
1126 change->data.truncate.restart_seqs = true;
1127 change->data.truncate.nrelids = xlrec->nrelids;
1129 xlrec->nrelids);
1130 memcpy(change->data.truncate.relids, xlrec->relids,
1131 xlrec->nrelids * sizeof(Oid));
1133 buf->origptr, change, false);
1134}
1135
1136/*
1137 * Decode XLOG_HEAP2_MULTI_INSERT record into multiple tuplebufs.
1138 *
1139 * Currently MULTI_INSERT will always contain the full tuples.
1140 */
1141static void
1143{
1146 int i;
1147 char *data;
1148 char *tupledata;
1149 Size tuplelen;
1150 RelFileLocator rlocator;
1151
1153
1154 /*
1155 * Ignore insert records without new tuples. This happens when a
1156 * multi_insert is done on a catalog or on a non-persistent relation.
1157 */
1158 if (!(xlrec->flags & XLH_INSERT_CONTAINS_NEW_TUPLE))
1159 return;
1160
1161 /* only interested in our database */
1162 XLogRecGetBlockTag(r, 0, &rlocator, NULL, NULL);
1163 if (rlocator.dbOid != ctx->slot->data.database)
1164 return;
1165
1166 /* output plugin doesn't look for this origin, no need to queue */
1167 if (FilterByOrigin(ctx, XLogRecGetOrigin(r)))
1168 return;
1169
1170 /*
1171 * We know that this multi_insert isn't for a catalog, so the block should
1172 * always have data even if a full-page write of it is taken.
1173 */
1174 tupledata = XLogRecGetBlockData(r, 0, &tuplelen);
1175 Assert(tupledata != NULL);
1176
1177 data = tupledata;
1178 for (i = 0; i < xlrec->ntuples; i++)
1179 {
1180 ReorderBufferChange *change;
1182 int datalen;
1183 HeapTuple tuple;
1184 HeapTupleHeader header;
1185
1186 change = ReorderBufferAllocChange(ctx->reorder);
1188 change->origin_id = XLogRecGetOrigin(r);
1189
1190 memcpy(&change->data.tp.rlocator, &rlocator, sizeof(RelFileLocator));
1191
1193 data = ((char *) xlhdr) + SizeOfMultiInsertTuple;
1194 datalen = xlhdr->datalen;
1195
1196 change->data.tp.newtuple =
1197 ReorderBufferAllocTupleBuf(ctx->reorder, datalen);
1198
1199 tuple = change->data.tp.newtuple;
1200 header = tuple->t_data;
1201
1202 /* not a disk based tuple */
1204
1205 /*
1206 * We can only figure this out after reassembling the transactions.
1207 */
1208 tuple->t_tableOid = InvalidOid;
1209
1210 tuple->t_len = datalen + SizeofHeapTupleHeader;
1211
1212 memset(header, 0, SizeofHeapTupleHeader);
1213
1214 memcpy((char *) tuple->t_data + SizeofHeapTupleHeader, data, datalen);
1215 header->t_infomask = xlhdr->t_infomask;
1216 header->t_infomask2 = xlhdr->t_infomask2;
1217 header->t_hoff = xlhdr->t_hoff;
1218
1219 /*
1220 * Reset toast reassembly state only after the last row in the last
1221 * xl_multi_insert_tuple record emitted by one heap_multi_insert()
1222 * call.
1223 */
1224 if (xlrec->flags & XLH_INSERT_LAST_IN_MULTI &&
1225 (i + 1) == xlrec->ntuples)
1226 change->data.tp.clear_toast_afterwards = true;
1227 else
1228 change->data.tp.clear_toast_afterwards = false;
1229
1231 buf->origptr, change, false);
1232
1233 /* move to the next xl_multi_insert_tuple entry */
1234 data += datalen;
1235 }
1236 Assert(data == tupledata + tuplelen);
1237}
1238
1239/*
1240 * Parse XLOG_HEAP_CONFIRM from wal into a confirmation change.
1241 *
1242 * This is pretty trivial, all the state essentially already setup by the
1243 * speculative insertion.
1244 */
1245static void
1247{
1249 ReorderBufferChange *change;
1250 RelFileLocator target_locator;
1251
1252 /* only interested in our database */
1253 XLogRecGetBlockTag(r, 0, &target_locator, NULL, NULL);
1254 if (target_locator.dbOid != ctx->slot->data.database)
1255 return;
1256
1257 /* output plugin doesn't look for this origin, no need to queue */
1258 if (FilterByOrigin(ctx, XLogRecGetOrigin(r)))
1259 return;
1260
1261 change = ReorderBufferAllocChange(ctx->reorder);
1263 change->origin_id = XLogRecGetOrigin(r);
1264
1265 memcpy(&change->data.tp.rlocator, &target_locator, sizeof(RelFileLocator));
1266
1267 change->data.tp.clear_toast_afterwards = true;
1268
1270 change, false);
1271}
1272
1273
1274/*
1275 * Read a HeapTuple as WAL logged by heap_insert, heap_update and heap_delete
1276 * (but not by heap_multi_insert) into a tuplebuf.
1277 *
1278 * The size 'len' and the pointer 'data' in the record need to be
1279 * computed outside as they are record specific.
1280 */
1281static void
1283{
1285 int datalen = len - SizeOfHeapHeader;
1286 HeapTupleHeader header;
1287
1288 Assert(datalen >= 0);
1289
1290 tuple->t_len = datalen + SizeofHeapTupleHeader;
1291 header = tuple->t_data;
1292
1293 /* not a disk based tuple */
1295
1296 /* we can only figure this out after reassembling the transactions */
1297 tuple->t_tableOid = InvalidOid;
1298
1299 /* data is not stored aligned, copy to aligned storage */
1301
1302 memset(header, 0, SizeofHeapTupleHeader);
1303
1304 memcpy(((char *) tuple->t_data) + SizeofHeapTupleHeader,
1306 datalen);
1307
1308 header->t_infomask = xlhdr.t_infomask;
1309 header->t_infomask2 = xlhdr.t_infomask2;
1310 header->t_hoff = xlhdr.t_hoff;
1311}
1312
1313/*
1314 * Check whether we are interested in this specific transaction.
1315 *
1316 * There can be several reasons we might not be interested in this
1317 * transaction:
1318 * 1) We might not be interested in decoding transactions up to this
1319 * LSN. This can happen because we previously decoded it and now just
1320 * are restarting or if we haven't assembled a consistent snapshot yet.
1321 * 2) The transaction happened in another database.
1322 * 3) The output plugin is not interested in the origin.
1323 * 4) We are doing fast-forwarding
1324 */
1325static bool
1327 Oid txn_dbid, ReplOriginId origin_id)
1328{
1329 if (SnapBuildXactNeedsSkip(ctx->snapshot_builder, buf->origptr) ||
1330 (txn_dbid != InvalidOid && txn_dbid != ctx->slot->data.database) ||
1331 FilterByOrigin(ctx, origin_id))
1332 return true;
1333
1334 /*
1335 * We also skip decoding in fast_forward mode. In passing set the
1336 * processing_required flag to indicate that if it were not for
1337 * fast_forward mode, processing would have been required.
1338 */
1339 if (ctx->fast_forward)
1340 {
1341 ctx->processing_required = true;
1342 return true;
1343 }
1344
1345 return false;
1346}
uint8_t uint8
Definition c.h:622
#define Assert(condition)
Definition c.h:943
#define SHORTALIGN(LEN)
Definition c.h:892
uint32 TransactionId
Definition c.h:736
size_t Size
Definition c.h:689
memcpy(sums, checksumBaseOffsets, sizeof(checksumBaseOffsets))
int64 TimestampTz
Definition timestamp.h:39
void heap2_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:422
static void DecodeAbort(LogicalDecodingContext *ctx, XLogRecordBuffer *buf, xl_xact_parsed_abort *parsed, TransactionId xid, bool two_phase)
Definition decode.c:859
void xlog2_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:194
static bool FilterPrepare(LogicalDecodingContext *ctx, TransactionId xid, const char *gid)
Definition decode.c:572
static void DecodeMultiInsert(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:1142
void LogicalDecodingProcessRecord(LogicalDecodingContext *ctx, XLogReaderState *record)
Definition decode.c:89
static void DecodeCommit(LogicalDecodingContext *ctx, XLogRecordBuffer *buf, xl_xact_parsed_commit *parsed, TransactionId xid, bool two_phase)
Definition decode.c:688
static bool FilterByOrigin(LogicalDecodingContext *ctx, ReplOriginId origin_id)
Definition decode.c:595
static void DecodeDelete(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:1041
void heap_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:485
static void DecodeXLogTuple(char *data, Size len, HeapTuple tuple)
Definition decode.c:1282
void xlog_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:130
void xact_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:213
void standby_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:371
static void DecodeInsert(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:915
static void DecodeTruncate(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:1104
void logicalmsg_decode(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:607
static void DecodeUpdate(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:974
static void DecodePrepare(LogicalDecodingContext *ctx, XLogRecordBuffer *buf, xl_xact_parsed_prepare *parsed)
Definition decode.c:784
static bool DecodeTXNNeedSkip(LogicalDecodingContext *ctx, XLogRecordBuffer *buf, Oid txn_dbid, ReplOriginId origin_id)
Definition decode.c:1326
static void DecodeSpecConfirm(LogicalDecodingContext *ctx, XLogRecordBuffer *buf)
Definition decode.c:1246
#define ERROR
Definition elog.h:40
#define elog(elevel,...)
Definition elog.h:228
#define XLH_INSERT_ON_TOAST_RELATION
Definition heapam_xlog.h:76
#define XLOG_HEAP2_MULTI_INSERT
Definition heapam_xlog.h:64
#define SizeOfHeapUpdate
#define XLOG_HEAP_HOT_UPDATE
Definition heapam_xlog.h:37
#define XLOG_HEAP_DELETE
Definition heapam_xlog.h:34
#define XLH_INSERT_IS_SPECULATIVE
Definition heapam_xlog.h:74
#define XLOG_HEAP2_REWRITE
Definition heapam_xlog.h:59
#define XLOG_HEAP_TRUNCATE
Definition heapam_xlog.h:36
#define XLH_UPDATE_CONTAINS_NEW_TUPLE
Definition heapam_xlog.h:90
#define XLH_INSERT_LAST_IN_MULTI
Definition heapam_xlog.h:73
#define XLOG_HEAP_OPMASK
Definition heapam_xlog.h:42
#define XLH_UPDATE_CONTAINS_OLD
Definition heapam_xlog.h:95
#define XLH_TRUNCATE_RESTART_SEQS
#define XLOG_HEAP_UPDATE
Definition heapam_xlog.h:35
#define XLH_DELETE_CONTAINS_OLD
#define SizeOfHeapHeader
#define XLOG_HEAP2_PRUNE_VACUUM_SCAN
Definition heapam_xlog.h:61
#define XLOG_HEAP_INPLACE
Definition heapam_xlog.h:40
#define XLOG_HEAP2_LOCK_UPDATED
Definition heapam_xlog.h:65
#define SizeOfMultiInsertTuple
#define XLOG_HEAP2_PRUNE_ON_ACCESS
Definition heapam_xlog.h:60
#define XLOG_HEAP2_NEW_CID
Definition heapam_xlog.h:66
#define XLOG_HEAP_LOCK
Definition heapam_xlog.h:39
#define XLOG_HEAP2_PRUNE_VACUUM_CLEANUP
Definition heapam_xlog.h:62
#define XLH_TRUNCATE_CASCADE
#define XLOG_HEAP_INSERT
Definition heapam_xlog.h:33
#define SizeOfHeapDelete
#define XLH_DELETE_IS_SUPER
#define XLH_DELETE_NO_LOGICAL
#define XLH_INSERT_CONTAINS_NEW_TUPLE
Definition heapam_xlog.h:75
#define XLOG_HEAP_CONFIRM
Definition heapam_xlog.h:38
#define SizeofHeapTupleHeader
int i
Definition isn.c:77
static void ItemPointerSetInvalid(ItemPointerData *pointer)
Definition itemptr.h:184
void UpdateDecodingStats(LogicalDecodingContext *ctx)
Definition logical.c:1951
bool filter_prepare_cb_wrapper(LogicalDecodingContext *ctx, TransactionId xid, const char *gid)
Definition logical.c:1160
bool filter_by_origin_cb_wrapper(LogicalDecodingContext *ctx, ReplOriginId origin_id)
Definition logical.c:1192
#define XLOG_LOGICAL_MESSAGE
Definition message.h:37
#define XLOG_RESTORE_POINT
Definition pg_control.h:79
#define XLOG_FPW_CHANGE
Definition pg_control.h:80
#define XLOG_CHECKPOINT_REDO
Definition pg_control.h:86
#define XLOG_OVERWRITE_CONTRECORD
Definition pg_control.h:85
#define XLOG_FPI
Definition pg_control.h:83
#define XLOG_FPI_FOR_HINT
Definition pg_control.h:82
#define XLOG2_CHECKSUMS
Definition pg_control.h:90
#define XLOG_NEXTOID
Definition pg_control.h:75
#define XLOG_NOOP
Definition pg_control.h:74
#define XLOG_CHECKPOINT_SHUTDOWN
Definition pg_control.h:72
#define XLOG_SWITCH
Definition pg_control.h:76
#define XLOG_BACKUP_END
Definition pg_control.h:77
#define XLOG_PARAMETER_CHANGE
Definition pg_control.h:78
#define XLOG_LOGICAL_DECODING_STATUS_CHANGE
Definition pg_control.h:87
#define XLOG_CHECKPOINT_ONLINE
Definition pg_control.h:73
#define XLOG_END_OF_RECOVERY
Definition pg_control.h:81
const void size_t len
const void * data
static bool two_phase
static char buf[DEFAULT_XLOG_SEG_SIZE]
#define InvalidOid
unsigned int Oid
static int fb(int x)
void ReorderBufferXidSetCatalogChanges(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn)
void ReorderBufferAbort(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn, TimestampTz abort_time)
void ReorderBufferInvalidate(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn)
void ReorderBufferQueueChange(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn, ReorderBufferChange *change, bool toast_insert)
void ReorderBufferPrepare(ReorderBuffer *rb, TransactionId xid, char *gid)
void ReorderBufferForget(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn)
void ReorderBufferCommitChild(ReorderBuffer *rb, TransactionId xid, TransactionId subxid, XLogRecPtr commit_lsn, XLogRecPtr end_lsn)
void ReorderBufferSkipPrepare(ReorderBuffer *rb, TransactionId xid)
bool ReorderBufferRememberPrepareInfo(ReorderBuffer *rb, TransactionId xid, XLogRecPtr prepare_lsn, XLogRecPtr end_lsn, TimestampTz prepare_time, ReplOriginId origin_id, XLogRecPtr origin_lsn)
void ReorderBufferFinishPrepared(ReorderBuffer *rb, TransactionId xid, XLogRecPtr commit_lsn, XLogRecPtr end_lsn, XLogRecPtr two_phase_at, TimestampTz commit_time, ReplOriginId origin_id, XLogRecPtr origin_lsn, char *gid, bool is_commit)
void ReorderBufferAddInvalidations(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn, Size nmsgs, SharedInvalidationMessage *msgs)
void ReorderBufferCommit(ReorderBuffer *rb, TransactionId xid, XLogRecPtr commit_lsn, XLogRecPtr end_lsn, TimestampTz commit_time, ReplOriginId origin_id, XLogRecPtr origin_lsn)
void ReorderBufferQueueMessage(ReorderBuffer *rb, TransactionId xid, Snapshot snap, XLogRecPtr lsn, bool transactional, const char *prefix, Size message_size, const char *message)
HeapTuple ReorderBufferAllocTupleBuf(ReorderBuffer *rb, Size tuple_len)
ReorderBufferChange * ReorderBufferAllocChange(ReorderBuffer *rb)
void ReorderBufferImmediateInvalidation(ReorderBuffer *rb, uint32 ninvalidations, SharedInvalidationMessage *invalidations)
Oid * ReorderBufferAllocRelids(ReorderBuffer *rb, int nrelids)
void ReorderBufferProcessXid(ReorderBuffer *rb, TransactionId xid, XLogRecPtr lsn)
void ReorderBufferAssignChild(ReorderBuffer *rb, TransactionId xid, TransactionId subxid, XLogRecPtr lsn)
void ReorderBufferAbortOld(ReorderBuffer *rb, TransactionId oldestRunningXid)
@ REORDER_BUFFER_CHANGE_INTERNAL_SPEC_CONFIRM
@ REORDER_BUFFER_CHANGE_INSERT
@ REORDER_BUFFER_CHANGE_INTERNAL_SPEC_ABORT
@ REORDER_BUFFER_CHANGE_INTERNAL_SPEC_INSERT
@ REORDER_BUFFER_CHANGE_TRUNCATE
@ REORDER_BUFFER_CHANGE_DELETE
@ REORDER_BUFFER_CHANGE_UPDATE
bool change_useless_for_repack(XLogRecordBuffer *buf)
bool SnapBuildXactNeedsSkip(SnapBuild *builder, XLogRecPtr ptr)
Definition snapbuild.c:308
bool SnapBuildProcessChange(SnapBuild *builder, TransactionId xid, XLogRecPtr lsn)
Definition snapbuild.c:642
XLogRecPtr SnapBuildGetTwoPhaseAt(SnapBuild *builder)
Definition snapbuild.c:290
SnapBuildState SnapBuildCurrentState(SnapBuild *builder)
Definition snapbuild.c:281
Snapshot SnapBuildGetOrBuildSnapshot(SnapBuild *builder)
Definition snapbuild.c:582
void SnapBuildSerializationPoint(SnapBuild *builder, XLogRecPtr lsn)
Definition snapbuild.c:1488
void SnapBuildCommitTxn(SnapBuild *builder, XLogRecPtr lsn, TransactionId xid, int nsubxacts, TransactionId *subxacts, uint32 xinfo)
Definition snapbuild.c:944
void SnapBuildProcessNewCid(SnapBuild *builder, TransactionId xid, XLogRecPtr lsn, xl_heap_new_cid *xlrec)
Definition snapbuild.c:692
void SnapBuildProcessRunningXacts(SnapBuild *builder, XLogRecPtr lsn, xl_running_xacts *running)
Definition snapbuild.c:1140
@ SNAPBUILD_FULL_SNAPSHOT
Definition snapbuild.h:51
@ SNAPBUILD_CONSISTENT
Definition snapbuild.h:58
#define XLOG_INVALIDATIONS
Definition standbydefs.h:36
#define XLOG_STANDBY_LOCK
Definition standbydefs.h:34
#define XLOG_RUNNING_XACTS
Definition standbydefs.h:35
ItemPointerData t_self
Definition htup.h:65
uint32 t_len
Definition htup.h:64
HeapTupleHeader t_data
Definition htup.h:68
Oid t_tableOid
Definition htup.h:66
XLogReaderState * reader
Definition logical.h:42
struct SnapBuild * snapshot_builder
Definition logical.h:44
OutputPluginCallbacks callbacks
Definition logical.h:53
ReplicationSlot * slot
Definition logical.h:39
struct ReorderBuffer * reorder
Definition logical.h:43
LogicalDecodeFilterPrepareCB filter_prepare_cb
LogicalDecodeFilterByOriginCB filter_by_origin_cb
ReorderBufferChangeType action
RelFileLocator rlocator
struct ReorderBufferChange::@118::@120 truncate
ReplOriginId origin_id
struct ReorderBufferChange::@118::@119 tp
union ReorderBufferChange::@118 data
ReplicationSlotPersistentData data
Definition slot.h:213
DecodedXLogRecord * record
Definition xlogreader.h:235
XLogRecPtr EndRecPtr
Definition xlogreader.h:206
XLogRecPtr ReadRecPtr
Definition xlogreader.h:205
char message[FLEXIBLE_ARRAY_MEMBER]
Definition message.h:27
TransactionId oldestRunningXid
Definition standbydefs.h:53
#define TransactionIdIsValid(xid)
Definition transam.h:41
#define XLOG_XACT_COMMIT_PREPARED
Definition xact.h:173
#define XLOG_XACT_INVALIDATIONS
Definition xact.h:176
#define XACT_XINFO_HAS_ORIGIN
Definition xact.h:194
#define XLOG_XACT_PREPARE
Definition xact.h:171
#define XLOG_XACT_COMMIT
Definition xact.h:170
#define XLOG_XACT_OPMASK
Definition xact.h:180
#define XLOG_XACT_ABORT
Definition xact.h:172
#define XLOG_XACT_ASSIGNMENT
Definition xact.h:175
#define XLOG_XACT_ABORT_PREPARED
Definition xact.h:174
void ParseCommitRecord(uint8 info, xl_xact_commit *xlrec, xl_xact_parsed_commit *parsed)
Definition xactdesc.c:35
void ParseAbortRecord(uint8 info, xl_xact_abort *xlrec, xl_xact_parsed_abort *parsed)
Definition xactdesc.c:141
void ParsePrepareRecord(uint8 info, xl_xact_prepare *xlrec, xl_xact_parsed_prepare *parsed)
Definition xactdesc.c:239
static RmgrData GetRmgr(RmgrId rmid)
uint16 ReplOriginId
Definition xlogdefs.h:69
uint64 XLogRecPtr
Definition xlogdefs.h:21
#define InvalidXLogRecPtr
Definition xlogdefs.h:28
char * XLogRecGetBlockData(XLogReaderState *record, uint8 block_id, Size *len)
void XLogRecGetBlockTag(XLogReaderState *record, uint8 block_id, RelFileLocator *rlocator, ForkNumber *forknum, BlockNumber *blknum)
#define XLogRecGetOrigin(decoder)
Definition xlogreader.h:413
#define XLogRecGetDataLen(decoder)
Definition xlogreader.h:416
#define XLogRecGetInfo(decoder)
Definition xlogreader.h:410
#define XLogRecGetRmid(decoder)
Definition xlogreader.h:411
#define XLogRecGetData(decoder)
Definition xlogreader.h:415
#define XLogRecGetXid(decoder)
Definition xlogreader.h:412
#define XLogRecGetTopXid(decoder)
Definition xlogreader.h:414