pg_query 2.0.3 → 5.1.0

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

@@ -1,467 +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 changes concern
- * "speculative insertions", and their confirmation 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
-};
-
-/* 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/storage/relfilenode.h

@@ -1,99 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * relfilenode.h
- *	  Physical access information for relations.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/storage/relfilenode.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef RELFILENODE_H
-#define RELFILENODE_H
-
-#include "common/relpath.h"
-#include "storage/backendid.h"
-
-/*
- * RelFileNode must provide all that we need to know to physically access
- * a relation, with the exception of the backend ID, which can be provided
- * separately. Note, however, that a "physical" relation is comprised of
- * multiple files on the filesystem, as each fork is stored as a separate
- * file, and each fork can be divided into multiple segments. See md.c.
- *
- * spcNode identifies the tablespace of the relation.  It corresponds to
- * pg_tablespace.oid.
- *
- * dbNode identifies the database of the relation.  It is zero for
- * "shared" relations (those common to all databases of a cluster).
- * Nonzero dbNode values correspond to pg_database.oid.
- *
- * relNode identifies the specific relation.  relNode corresponds to
- * pg_class.relfilenode (NOT pg_class.oid, because we need to be able
- * to assign new physical files to relations in some situations).
- * Notice that relNode is only unique within a database in a particular
- * tablespace.
- *
- * Note: spcNode must be GLOBALTABLESPACE_OID if and only if dbNode is
- * zero.  We support shared relations only in the "global" tablespace.
- *
- * Note: in pg_class we allow reltablespace == 0 to denote that the
- * relation is stored in its database's "default" tablespace (as
- * identified by pg_database.dattablespace).  However this shorthand
- * is NOT allowed in RelFileNode structs --- the real tablespace ID
- * must be supplied when setting spcNode.
- *
- * Note: in pg_class, relfilenode can be zero to denote that the relation
- * is a "mapped" relation, whose current true filenode number is available
- * from relmapper.c.  Again, this case is NOT allowed in RelFileNodes.
- *
- * Note: various places use RelFileNode in hashtable keys.  Therefore,
- * there *must not* be any unused padding bytes in this struct.  That
- * should be safe as long as all the fields are of type Oid.
- */
-typedef struct RelFileNode
-{
-	Oid			spcNode;		/* tablespace */
-	Oid			dbNode;			/* database */
-	Oid			relNode;		/* relation */
-} RelFileNode;
-
-/*
- * Augmenting a relfilenode with the backend ID provides all the information
- * we need to locate the physical storage.  The backend ID is InvalidBackendId
- * for regular relations (those accessible to more than one backend), or the
- * owning backend's ID for backend-local relations.  Backend-local relations
- * are always transient and removed in case of a database crash; they are
- * never WAL-logged or fsync'd.
- */
-typedef struct RelFileNodeBackend
-{
-	RelFileNode node;
-	BackendId	backend;
-} RelFileNodeBackend;
-
-#define RelFileNodeBackendIsTemp(rnode) \
-	((rnode).backend != InvalidBackendId)
-
-/*
- * Note: RelFileNodeEquals and RelFileNodeBackendEquals compare relNode first
- * since that is most likely to be different in two unequal RelFileNodes.  It
- * is probably redundant to compare spcNode if the other fields are found equal,
- * but do it anyway to be sure.  Likewise for checking the backend ID in
- * RelFileNodeBackendEquals.
- */
-#define RelFileNodeEquals(node1, node2) \
-	((node1).relNode == (node2).relNode && \
-	 (node1).dbNode == (node2).dbNode && \
-	 (node1).spcNode == (node2).spcNode)
-
-#define RelFileNodeBackendEquals(node1, node2) \
-	((node1).node.relNode == (node2).node.relNode && \
-	 (node1).node.dbNode == (node2).node.dbNode && \
-	 (node1).backend == (node2).backend && \
-	 (node1).node.spcNode == (node2).node.spcNode)
-
-#endif							/* RELFILENODE_H */

data/ext/pg_query/include/utils/dynahash.h

@@ -1,19 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * dynahash
- *	  POSTGRES dynahash.h file definitions
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/dynahash.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef DYNAHASH_H
-#define DYNAHASH_H
-
-extern int	my_log2(long num);
-
-#endif							/* DYNAHASH_H */

data/ext/pg_query/include/utils/pg_lsn.h

@@ -1,29 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * pg_lsn.h
- *		Declarations for operations on log sequence numbers (LSNs) of
- *		PostgreSQL.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/pg_lsn.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef PG_LSN_H
-#define PG_LSN_H
-
-#include "access/xlogdefs.h"
-#include "fmgr.h"
-
-#define DatumGetLSN(X) ((XLogRecPtr) DatumGetInt64(X))
-#define LSNGetDatum(X) (Int64GetDatum((int64) (X)))
-
-#define PG_GETARG_LSN(n)	 DatumGetLSN(PG_GETARG_DATUM(n))
-#define PG_RETURN_LSN(x)	 return LSNGetDatum(x)
-
-extern XLogRecPtr pg_lsn_in_internal(const char *str, bool *have_error);
-
-#endif							/* PG_LSN_H */

data/ext/pg_query/include/utils/pidfile.h

@@ -1,56 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * pidfile.h
- *	  Declarations describing the data directory lock file (postmaster.pid)
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/pidfile.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef UTILS_PIDFILE_H
-#define UTILS_PIDFILE_H
-
-/*
- * As of Postgres 10, the contents of the data-directory lock file are:
- *
- * line #
- *		1	postmaster PID (or negative of a standalone backend's PID)
- *		2	data directory path
- *		3	postmaster start timestamp (time_t representation)
- *		4	port number
- *		5	first Unix socket directory path (empty if none)
- *		6	first listen_address (IP address or "*"; empty if no TCP port)
- *		7	shared memory key (empty on Windows)
- *		8	postmaster status (see values below)
- *
- * Lines 6 and up are added via AddToDataDirLockFile() after initial file
- * creation; also, line 5 is initially empty and is changed after the first
- * Unix socket is opened.  Onlookers should not assume that lines 4 and up
- * are filled in any particular order.
- *
- * Socket lock file(s), if used, have the same contents as lines 1-5, with
- * line 5 being their own directory.
- */
-#define LOCK_FILE_LINE_PID			1
-#define LOCK_FILE_LINE_DATA_DIR		2
-#define LOCK_FILE_LINE_START_TIME	3
-#define LOCK_FILE_LINE_PORT			4
-#define LOCK_FILE_LINE_SOCKET_DIR	5
-#define LOCK_FILE_LINE_LISTEN_ADDR	6
-#define LOCK_FILE_LINE_SHMEM_KEY	7
-#define LOCK_FILE_LINE_PM_STATUS	8
-
-/*
- * The PM_STATUS line may contain one of these values.  All these strings
- * must be the same length, per comments for AddToDataDirLockFile().
- * We pad with spaces as needed to make that true.
- */
-#define PM_STATUS_STARTING		"starting"	/* still starting up */
-#define PM_STATUS_STOPPING		"stopping"	/* in shutdown sequence */
-#define PM_STATUS_READY			"ready   "	/* ready for connections */
-#define PM_STATUS_STANDBY		"standby "	/* up, won't accept connections */
-
-#endif							/* UTILS_PIDFILE_H */

data/ext/pg_query/include/utils/ps_status.h

@@ -1,25 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * ps_status.h
- *
- * Declarations for backend/utils/misc/ps_status.c
- *
- * src/include/utils/ps_status.h
- *
- *-------------------------------------------------------------------------
- */
-
-#ifndef PS_STATUS_H
-#define PS_STATUS_H
-
-extern bool update_process_title;
-
-extern char **save_ps_display_args(int argc, char **argv);
-
-extern void init_ps_display(const char *fixed_part);
-
-extern void set_ps_display(const char *activity);
-
-extern const char *get_ps_display(int *displen);
-
-#endif							/* PS_STATUS_H */