pg_query 2.2.0 → 6.1.0

data/ext/pg_query/include/replication/reorderbuffer.h

@@ -1,468 +0,0 @@
-/*
- * reorderbuffer.h
- *	  PostgreSQL logical replay/reorder buffer management.
- *
- * Copyright (c) 2012-2020, PostgreSQL Global Development Group
- *
- * src/include/replication/reorderbuffer.h
- */
-#ifndef REORDERBUFFER_H
-#define REORDERBUFFER_H
-
-#include "access/htup_details.h"
-#include "lib/ilist.h"
-#include "storage/sinval.h"
-#include "utils/hsearch.h"
-#include "utils/relcache.h"
-#include "utils/snapshot.h"
-#include "utils/timestamp.h"
-
-extern PGDLLIMPORT int logical_decoding_work_mem;
-
-/* an individual tuple, stored in one chunk of memory */
-typedef struct ReorderBufferTupleBuf
-{
-	/* position in preallocated list */
-	slist_node	node;
-
-	/* tuple header, the interesting bit for users of logical decoding */
-	HeapTupleData tuple;
-
-	/* pre-allocated size of tuple buffer, different from tuple size */
-	Size		alloc_tuple_size;
-
-	/* actual tuple data follows */
-} ReorderBufferTupleBuf;
-
-/* pointer to the data stored in a TupleBuf */
-#define ReorderBufferTupleBufData(p) \
-	((HeapTupleHeader) MAXALIGN(((char *) p) + sizeof(ReorderBufferTupleBuf)))
-
-/*
- * Types of the change passed to a 'change' callback.
- *
- * For efficiency and simplicity reasons we want to keep Snapshots, CommandIds
- * and ComboCids in the same list with the user visible INSERT/UPDATE/DELETE
- * changes. Users of the decoding facilities will never see changes with
- * *_INTERNAL_* actions.
- *
- * The INTERNAL_SPEC_INSERT and INTERNAL_SPEC_CONFIRM, and INTERNAL_SPEC_ABORT
- * changes concern "speculative insertions", their confirmation, and abort
- * respectively.  They're used by INSERT .. ON CONFLICT .. UPDATE.  Users of
- * logical decoding don't have to care about these.
- */
-enum ReorderBufferChangeType
-{
-	REORDER_BUFFER_CHANGE_INSERT,
-	REORDER_BUFFER_CHANGE_UPDATE,
-	REORDER_BUFFER_CHANGE_DELETE,
-	REORDER_BUFFER_CHANGE_MESSAGE,
-	REORDER_BUFFER_CHANGE_INTERNAL_SNAPSHOT,
-	REORDER_BUFFER_CHANGE_INTERNAL_COMMAND_ID,
-	REORDER_BUFFER_CHANGE_INTERNAL_TUPLECID,
-	REORDER_BUFFER_CHANGE_INTERNAL_SPEC_INSERT,
-	REORDER_BUFFER_CHANGE_INTERNAL_SPEC_CONFIRM,
-	REORDER_BUFFER_CHANGE_TRUNCATE,
-	REORDER_BUFFER_CHANGE_INTERNAL_SPEC_ABORT
-};
-
-/* forward declaration */
-struct ReorderBufferTXN;
-
-/*
- * a single 'change', can be an insert (with one tuple), an update (old, new),
- * or a delete (old).
- *
- * The same struct is also used internally for other purposes but that should
- * never be visible outside reorderbuffer.c.
- */
-typedef struct ReorderBufferChange
-{
-	XLogRecPtr	lsn;
-
-	/* The type of change. */
-	enum ReorderBufferChangeType action;
-
-	/* Transaction this change belongs to. */
-	struct ReorderBufferTXN *txn;
-
-	RepOriginId origin_id;
-
-	/*
-	 * Context data for the change. Which part of the union is valid depends
-	 * on action.
-	 */
-	union
-	{
-		/* Old, new tuples when action == *_INSERT|UPDATE|DELETE */
-		struct
-		{
-			/* relation that has been changed */
-			RelFileNode relnode;
-
-			/* no previously reassembled toast chunks are necessary anymore */
-			bool		clear_toast_afterwards;
-
-			/* valid for DELETE || UPDATE */
-			ReorderBufferTupleBuf *oldtuple;
-			/* valid for INSERT || UPDATE */
-			ReorderBufferTupleBuf *newtuple;
-		}			tp;
-
-		/*
-		 * Truncate data for REORDER_BUFFER_CHANGE_TRUNCATE representing one
-		 * set of relations to be truncated.
-		 */
-		struct
-		{
-			Size		nrelids;
-			bool		cascade;
-			bool		restart_seqs;
-			Oid		   *relids;
-		}			truncate;
-
-		/* Message with arbitrary data. */
-		struct
-		{
-			char	   *prefix;
-			Size		message_size;
-			char	   *message;
-		}			msg;
-
-		/* New snapshot, set when action == *_INTERNAL_SNAPSHOT */
-		Snapshot	snapshot;
-
-		/*
-		 * New command id for existing snapshot in a catalog changing tx. Set
-		 * when action == *_INTERNAL_COMMAND_ID.
-		 */
-		CommandId	command_id;
-
-		/*
-		 * New cid mapping for catalog changing transaction, set when action
-		 * == *_INTERNAL_TUPLECID.
-		 */
-		struct
-		{
-			RelFileNode node;
-			ItemPointerData tid;
-			CommandId	cmin;
-			CommandId	cmax;
-			CommandId	combocid;
-		}			tuplecid;
-	}			data;
-
-	/*
-	 * While in use this is how a change is linked into a transactions,
-	 * otherwise it's the preallocated list.
-	 */
-	dlist_node	node;
-} ReorderBufferChange;
-
-/* ReorderBufferTXN txn_flags */
-#define RBTXN_HAS_CATALOG_CHANGES 0x0001
-#define RBTXN_IS_SUBXACT          0x0002
-#define RBTXN_IS_SERIALIZED       0x0004
-
-/* Does the transaction have catalog changes? */
-#define rbtxn_has_catalog_changes(txn) \
-( \
-	 ((txn)->txn_flags & RBTXN_HAS_CATALOG_CHANGES) != 0 \
-)
-
-/* Is the transaction known as a subxact? */
-#define rbtxn_is_known_subxact(txn) \
-( \
-	((txn)->txn_flags & RBTXN_IS_SUBXACT) != 0 \
-)
-
-/* Has this transaction been spilled to disk? */
-#define rbtxn_is_serialized(txn) \
-( \
-	((txn)->txn_flags & RBTXN_IS_SERIALIZED) != 0 \
-)
-
-typedef struct ReorderBufferTXN
-{
-	/* See above */
-	bits32		txn_flags;
-
-	/* The transaction's transaction id, can be a toplevel or sub xid. */
-	TransactionId xid;
-
-	/* Xid of top-level transaction, if known */
-	TransactionId toplevel_xid;
-
-	/*
-	 * LSN of the first data carrying, WAL record with knowledge about this
-	 * xid. This is allowed to *not* be first record adorned with this xid, if
-	 * the previous records aren't relevant for logical decoding.
-	 */
-	XLogRecPtr	first_lsn;
-
-	/* ----
-	 * LSN of the record that lead to this xact to be committed or
-	 * aborted. This can be a
-	 * * plain commit record
-	 * * plain commit record, of a parent transaction
-	 * * prepared transaction commit
-	 * * plain abort record
-	 * * prepared transaction abort
-	 *
-	 * This can also become set to earlier values than transaction end when
-	 * a transaction is spilled to disk; specifically it's set to the LSN of
-	 * the latest change written to disk so far.
-	 * ----
-	 */
-	XLogRecPtr	final_lsn;
-
-	/*
-	 * LSN pointing to the end of the commit record + 1.
-	 */
-	XLogRecPtr	end_lsn;
-
-	/*
-	 * LSN of the last lsn at which snapshot information reside, so we can
-	 * restart decoding from there and fully recover this transaction from
-	 * WAL.
-	 */
-	XLogRecPtr	restart_decoding_lsn;
-
-	/* origin of the change that caused this transaction */
-	RepOriginId origin_id;
-	XLogRecPtr	origin_lsn;
-
-	/*
-	 * Commit time, only known when we read the actual commit record.
-	 */
-	TimestampTz commit_time;
-
-	/*
-	 * The base snapshot is used to decode all changes until either this
-	 * transaction modifies the catalog, or another catalog-modifying
-	 * transaction commits.
-	 */
-	Snapshot	base_snapshot;
-	XLogRecPtr	base_snapshot_lsn;
-	dlist_node	base_snapshot_node; /* link in txns_by_base_snapshot_lsn */
-
-	/*
-	 * How many ReorderBufferChange's do we have in this txn.
-	 *
-	 * Changes in subtransactions are *not* included but tracked separately.
-	 */
-	uint64		nentries;
-
-	/*
-	 * How many of the above entries are stored in memory in contrast to being
-	 * spilled to disk.
-	 */
-	uint64		nentries_mem;
-
-	/*
-	 * List of ReorderBufferChange structs, including new Snapshots and new
-	 * CommandIds
-	 */
-	dlist_head	changes;
-
-	/*
-	 * List of (relation, ctid) => (cmin, cmax) mappings for catalog tuples.
-	 * Those are always assigned to the toplevel transaction. (Keep track of
-	 * #entries to create a hash of the right size)
-	 */
-	dlist_head	tuplecids;
-	uint64		ntuplecids;
-
-	/*
-	 * On-demand built hash for looking up the above values.
-	 */
-	HTAB	   *tuplecid_hash;
-
-	/*
-	 * Hash containing (potentially partial) toast entries. NULL if no toast
-	 * tuples have been found for the current change.
-	 */
-	HTAB	   *toast_hash;
-
-	/*
-	 * non-hierarchical list of subtransactions that are *not* aborted. Only
-	 * used in toplevel transactions.
-	 */
-	dlist_head	subtxns;
-	uint32		nsubtxns;
-
-	/*
-	 * Stored cache invalidations. This is not a linked list because we get
-	 * all the invalidations at once.
-	 */
-	uint32		ninvalidations;
-	SharedInvalidationMessage *invalidations;
-
-	/* ---
-	 * Position in one of three lists:
-	 * * list of subtransactions if we are *known* to be subxact
-	 * * list of toplevel xacts (can be an as-yet unknown subxact)
-	 * * list of preallocated ReorderBufferTXNs (if unused)
-	 * ---
-	 */
-	dlist_node	node;
-
-	/*
-	 * Size of this transaction (changes currently in memory, in bytes).
-	 */
-	Size		size;
-} ReorderBufferTXN;
-
-/* so we can define the callbacks used inside struct ReorderBuffer itself */
-typedef struct ReorderBuffer ReorderBuffer;
-
-/* change callback signature */
-typedef void (*ReorderBufferApplyChangeCB) (ReorderBuffer *rb,
-											ReorderBufferTXN *txn,
-											Relation relation,
-											ReorderBufferChange *change);
-
-/* truncate callback signature */
-typedef void (*ReorderBufferApplyTruncateCB) (ReorderBuffer *rb,
-											  ReorderBufferTXN *txn,
-											  int nrelations,
-											  Relation relations[],
-											  ReorderBufferChange *change);
-
-/* begin callback signature */
-typedef void (*ReorderBufferBeginCB) (ReorderBuffer *rb,
-									  ReorderBufferTXN *txn);
-
-/* commit callback signature */
-typedef void (*ReorderBufferCommitCB) (ReorderBuffer *rb,
-									   ReorderBufferTXN *txn,
-									   XLogRecPtr commit_lsn);
-
-/* message callback signature */
-typedef void (*ReorderBufferMessageCB) (ReorderBuffer *rb,
-										ReorderBufferTXN *txn,
-										XLogRecPtr message_lsn,
-										bool transactional,
-										const char *prefix, Size sz,
-										const char *message);
-
-struct ReorderBuffer
-{
-	/*
-	 * xid => ReorderBufferTXN lookup table
-	 */
-	HTAB	   *by_txn;
-
-	/*
-	 * Transactions that could be a toplevel xact, ordered by LSN of the first
-	 * record bearing that xid.
-	 */
-	dlist_head	toplevel_by_lsn;
-
-	/*
-	 * Transactions and subtransactions that have a base snapshot, ordered by
-	 * LSN of the record which caused us to first obtain the base snapshot.
-	 * This is not the same as toplevel_by_lsn, because we only set the base
-	 * snapshot on the first logical-decoding-relevant record (eg. heap
-	 * writes), whereas the initial LSN could be set by other operations.
-	 */
-	dlist_head	txns_by_base_snapshot_lsn;
-
-	/*
-	 * one-entry sized cache for by_txn. Very frequently the same txn gets
-	 * looked up over and over again.
-	 */
-	TransactionId by_txn_last_xid;
-	ReorderBufferTXN *by_txn_last_txn;
-
-	/*
-	 * Callbacks to be called when a transactions commits.
-	 */
-	ReorderBufferBeginCB begin;
-	ReorderBufferApplyChangeCB apply_change;
-	ReorderBufferApplyTruncateCB apply_truncate;
-	ReorderBufferCommitCB commit;
-	ReorderBufferMessageCB message;
-
-	/*
-	 * Pointer that will be passed untouched to the callbacks.
-	 */
-	void	   *private_data;
-
-	/*
-	 * Saved output plugin option
-	 */
-	bool		output_rewrites;
-
-	/*
-	 * Private memory context.
-	 */
-	MemoryContext context;
-
-	/*
-	 * Memory contexts for specific types objects
-	 */
-	MemoryContext change_context;
-	MemoryContext txn_context;
-	MemoryContext tup_context;
-
-	XLogRecPtr	current_restart_decoding_lsn;
-
-	/* buffer for disk<->memory conversions */
-	char	   *outbuf;
-	Size		outbufsize;
-
-	/* memory accounting */
-	Size		size;
-};
-
-
-ReorderBuffer *ReorderBufferAllocate(void);
-void		ReorderBufferFree(ReorderBuffer *);
-
-ReorderBufferTupleBuf *ReorderBufferGetTupleBuf(ReorderBuffer *, Size tuple_len);
-void		ReorderBufferReturnTupleBuf(ReorderBuffer *, ReorderBufferTupleBuf *tuple);
-ReorderBufferChange *ReorderBufferGetChange(ReorderBuffer *);
-void		ReorderBufferReturnChange(ReorderBuffer *, ReorderBufferChange *);
-
-Oid		   *ReorderBufferGetRelids(ReorderBuffer *, int nrelids);
-void		ReorderBufferReturnRelids(ReorderBuffer *, Oid *relids);
-
-void		ReorderBufferQueueChange(ReorderBuffer *, TransactionId, XLogRecPtr lsn, ReorderBufferChange *);
-void		ReorderBufferQueueMessage(ReorderBuffer *, TransactionId, Snapshot snapshot, XLogRecPtr lsn,
-									  bool transactional, const char *prefix,
-									  Size message_size, const char *message);
-void		ReorderBufferCommit(ReorderBuffer *, TransactionId,
-								XLogRecPtr commit_lsn, XLogRecPtr end_lsn,
-								TimestampTz commit_time, RepOriginId origin_id, XLogRecPtr origin_lsn);
-void		ReorderBufferAssignChild(ReorderBuffer *, TransactionId, TransactionId, XLogRecPtr commit_lsn);
-void		ReorderBufferCommitChild(ReorderBuffer *, TransactionId, TransactionId,
-									 XLogRecPtr commit_lsn, XLogRecPtr end_lsn);
-void		ReorderBufferAbort(ReorderBuffer *, TransactionId, XLogRecPtr lsn);
-void		ReorderBufferAbortOld(ReorderBuffer *, TransactionId xid);
-void		ReorderBufferForget(ReorderBuffer *, TransactionId, XLogRecPtr lsn);
-
-void		ReorderBufferSetBaseSnapshot(ReorderBuffer *, TransactionId, XLogRecPtr lsn, struct SnapshotData *snap);
-void		ReorderBufferAddSnapshot(ReorderBuffer *, TransactionId, XLogRecPtr lsn, struct SnapshotData *snap);
-void		ReorderBufferAddNewCommandId(ReorderBuffer *, TransactionId, XLogRecPtr lsn,
-										 CommandId cid);
-void		ReorderBufferAddNewTupleCids(ReorderBuffer *, TransactionId, XLogRecPtr lsn,
-										 RelFileNode node, ItemPointerData pt,
-										 CommandId cmin, CommandId cmax, CommandId combocid);
-void		ReorderBufferAddInvalidations(ReorderBuffer *, TransactionId, XLogRecPtr lsn,
-										  Size nmsgs, SharedInvalidationMessage *msgs);
-void		ReorderBufferImmediateInvalidation(ReorderBuffer *, uint32 ninvalidations,
-											   SharedInvalidationMessage *invalidations);
-void		ReorderBufferProcessXid(ReorderBuffer *, TransactionId xid, XLogRecPtr lsn);
-void		ReorderBufferXidSetCatalogChanges(ReorderBuffer *, TransactionId xid, XLogRecPtr lsn);
-bool		ReorderBufferXidHasCatalogChanges(ReorderBuffer *, TransactionId xid);
-bool		ReorderBufferXidHasBaseSnapshot(ReorderBuffer *, TransactionId xid);
-
-ReorderBufferTXN *ReorderBufferGetOldestTXN(ReorderBuffer *);
-TransactionId ReorderBufferGetOldestXmin(ReorderBuffer *rb);
-
-void		ReorderBufferSetRestartPoint(ReorderBuffer *, XLogRecPtr ptr);
-
-void		StartupReorderBuffer(void);
-
-#endif

data/ext/pg_query/include/replication/slot.h

@@ -1,219 +0,0 @@
-/*-------------------------------------------------------------------------
- * slot.h
- *	   Replication slot management.
- *
- * Copyright (c) 2012-2020, PostgreSQL Global Development Group
- *
- *-------------------------------------------------------------------------
- */
-#ifndef SLOT_H
-#define SLOT_H
-
-#include "access/xlog.h"
-#include "access/xlogreader.h"
-#include "storage/condition_variable.h"
-#include "storage/lwlock.h"
-#include "storage/shmem.h"
-#include "storage/spin.h"
-
-/*
- * Behaviour of replication slots, upon release or crash.
- *
- * Slots marked as PERSISTENT are crash-safe and will not be dropped when
- * released. Slots marked as EPHEMERAL will be dropped when released or after
- * restarts.  Slots marked TEMPORARY will be dropped at the end of a session
- * or on error.
- *
- * EPHEMERAL is used as a not-quite-ready state when creating persistent
- * slots.  EPHEMERAL slots can be made PERSISTENT by calling
- * ReplicationSlotPersist().  For a slot that goes away at the end of a
- * session, TEMPORARY is the appropriate choice.
- */
-typedef enum ReplicationSlotPersistency
-{
-	RS_PERSISTENT,
-	RS_EPHEMERAL,
-	RS_TEMPORARY
-} ReplicationSlotPersistency;
-
-/* For ReplicationSlotAcquire, q.v. */
-typedef enum SlotAcquireBehavior
-{
-	SAB_Error,
-	SAB_Block,
-	SAB_Inquire
-} SlotAcquireBehavior;
-
-/*
- * On-Disk data of a replication slot, preserved across restarts.
- */
-typedef struct ReplicationSlotPersistentData
-{
-	/* The slot's identifier */
-	NameData	name;
-
-	/* database the slot is active on */
-	Oid			database;
-
-	/*
-	 * The slot's behaviour when being dropped (or restored after a crash).
-	 */
-	ReplicationSlotPersistency persistency;
-
-	/*
-	 * xmin horizon for data
-	 *
-	 * NB: This may represent a value that hasn't been written to disk yet;
-	 * see notes for effective_xmin, below.
-	 */
-	TransactionId xmin;
-
-	/*
-	 * xmin horizon for catalog tuples
-	 *
-	 * NB: This may represent a value that hasn't been written to disk yet;
-	 * see notes for effective_xmin, below.
-	 */
-	TransactionId catalog_xmin;
-
-	/* oldest LSN that might be required by this replication slot */
-	XLogRecPtr	restart_lsn;
-
-	/* restart_lsn is copied here when the slot is invalidated */
-	XLogRecPtr	invalidated_at;
-
-	/*
-	 * Oldest LSN that the client has acked receipt for.  This is used as the
-	 * start_lsn point in case the client doesn't specify one, and also as a
-	 * safety measure to jump forwards in case the client specifies a
-	 * start_lsn that's further in the past than this value.
-	 */
-	XLogRecPtr	confirmed_flush;
-
-	/* plugin name */
-	NameData	plugin;
-} ReplicationSlotPersistentData;
-
-/*
- * Shared memory state of a single replication slot.
- *
- * The in-memory data of replication slots follows a locking model based
- * on two linked concepts:
- * - A replication slot's in_use flag is switched when added or discarded using
- * the LWLock ReplicationSlotControlLock, which needs to be hold in exclusive
- * mode when updating the flag by the backend owning the slot and doing the
- * operation, while readers (concurrent backends not owning the slot) need
- * to hold it in shared mode when looking at replication slot data.
- * - Individual fields are protected by mutex where only the backend owning
- * the slot is authorized to update the fields from its own slot.  The
- * backend owning the slot does not need to take this lock when reading its
- * own fields, while concurrent backends not owning this slot should take the
- * lock when reading this slot's data.
- */
-typedef struct ReplicationSlot
-{
-	/* lock, on same cacheline as effective_xmin */
-	slock_t		mutex;
-
-	/* is this slot defined */
-	bool		in_use;
-
-	/* Who is streaming out changes for this slot? 0 in unused slots. */
-	pid_t		active_pid;
-
-	/* any outstanding modifications? */
-	bool		just_dirtied;
-	bool		dirty;
-
-	/*
-	 * For logical decoding, it's extremely important that we never remove any
-	 * data that's still needed for decoding purposes, even after a crash;
-	 * otherwise, decoding will produce wrong answers.  Ordinary streaming
-	 * replication also needs to prevent old row versions from being removed
-	 * too soon, but the worst consequence we might encounter there is
-	 * unwanted query cancellations on the standby.  Thus, for logical
-	 * decoding, this value represents the latest xmin that has actually been
-	 * written to disk, whereas for streaming replication, it's just the same
-	 * as the persistent value (data.xmin).
-	 */
-	TransactionId effective_xmin;
-	TransactionId effective_catalog_xmin;
-
-	/* data surviving shutdowns and crashes */
-	ReplicationSlotPersistentData data;
-
-	/* is somebody performing io on this slot? */
-	LWLock		io_in_progress_lock;
-
-	/* Condition variable signaled when active_pid changes */
-	ConditionVariable active_cv;
-
-	/* all the remaining data is only used for logical slots */
-
-	/*
-	 * When the client has confirmed flushes >= candidate_xmin_lsn we can
-	 * advance the catalog xmin.  When restart_valid has been passed,
-	 * restart_lsn can be increased.
-	 */
-	TransactionId candidate_catalog_xmin;
-	XLogRecPtr	candidate_xmin_lsn;
-	XLogRecPtr	candidate_restart_valid;
-	XLogRecPtr	candidate_restart_lsn;
-} ReplicationSlot;
-
-#define SlotIsPhysical(slot) ((slot)->data.database == InvalidOid)
-#define SlotIsLogical(slot) ((slot)->data.database != InvalidOid)
-
-/*
- * Shared memory control area for all of replication slots.
- */
-typedef struct ReplicationSlotCtlData
-{
-	/*
-	 * This array should be declared [FLEXIBLE_ARRAY_MEMBER], but for some
-	 * reason you can't do that in an otherwise-empty struct.
-	 */
-	ReplicationSlot replication_slots[1];
-} ReplicationSlotCtlData;
-
-/*
- * Pointers to shared memory
- */
-extern PGDLLIMPORT ReplicationSlotCtlData *ReplicationSlotCtl;
-extern PGDLLIMPORT ReplicationSlot *MyReplicationSlot;
-
-/* GUCs */
-extern PGDLLIMPORT int max_replication_slots;
-
-/* shmem initialization functions */
-extern Size ReplicationSlotsShmemSize(void);
-extern void ReplicationSlotsShmemInit(void);
-
-/* management of individual slots */
-extern void ReplicationSlotCreate(const char *name, bool db_specific,
-								  ReplicationSlotPersistency p);
-extern void ReplicationSlotPersist(void);
-extern void ReplicationSlotDrop(const char *name, bool nowait);
-
-extern int	ReplicationSlotAcquire(const char *name, SlotAcquireBehavior behavior);
-extern void ReplicationSlotRelease(void);
-extern void ReplicationSlotCleanup(void);
-extern void ReplicationSlotSave(void);
-extern void ReplicationSlotMarkDirty(void);
-
-/* misc stuff */
-extern bool ReplicationSlotValidateName(const char *name, int elevel);
-extern void ReplicationSlotReserveWal(void);
-extern void ReplicationSlotsComputeRequiredXmin(bool already_locked);
-extern void ReplicationSlotsComputeRequiredLSN(void);
-extern XLogRecPtr ReplicationSlotsComputeLogicalRestartLSN(void);
-extern bool ReplicationSlotsCountDBSlots(Oid dboid, int *nslots, int *nactive);
-extern void ReplicationSlotsDropDBSlots(Oid dboid);
-extern bool InvalidateObsoleteReplicationSlots(XLogSegNo oldestSegno);
-
-extern void StartupReplicationSlots(void);
-extern void CheckPointReplicationSlots(void);
-
-extern void CheckSlotRequirements(void);
-
-#endif							/* SLOT_H */