pg_query 4.2.1 → 6.1.0

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

@@ -1,321 +0,0 @@
-/* ----------
- * backend_status.h
- *	  Definitions related to backend status reporting
- *
- * Copyright (c) 2001-2022, PostgreSQL Global Development Group
- *
- * src/include/utils/backend_status.h
- * ----------
- */
-#ifndef BACKEND_STATUS_H
-#define BACKEND_STATUS_H
-
-#include "datatype/timestamp.h"
-#include "libpq/pqcomm.h"
-#include "miscadmin.h"			/* for BackendType */
-#include "utils/backend_progress.h"
-
-
-/* ----------
- * Backend states
- * ----------
- */
-typedef enum BackendState
-{
-	STATE_UNDEFINED,
-	STATE_IDLE,
-	STATE_RUNNING,
-	STATE_IDLEINTRANSACTION,
-	STATE_FASTPATH,
-	STATE_IDLEINTRANSACTION_ABORTED,
-	STATE_DISABLED
-} BackendState;
-
-
-/* ----------
- * Shared-memory data structures
- * ----------
- */
-
-/*
- * PgBackendSSLStatus
- *
- * For each backend, we keep the SSL status in a separate struct, that
- * is only filled in if SSL is enabled.
- *
- * All char arrays must be null-terminated.
- */
-typedef struct PgBackendSSLStatus
-{
-	/* Information about SSL connection */
-	int			ssl_bits;
-	char		ssl_version[NAMEDATALEN];
-	char		ssl_cipher[NAMEDATALEN];
-	char		ssl_client_dn[NAMEDATALEN];
-
-	/*
-	 * serial number is max "20 octets" per RFC 5280, so this size should be
-	 * fine
-	 */
-	char		ssl_client_serial[NAMEDATALEN];
-
-	char		ssl_issuer_dn[NAMEDATALEN];
-} PgBackendSSLStatus;
-
-/*
- * PgBackendGSSStatus
- *
- * For each backend, we keep the GSS status in a separate struct, that
- * is only filled in if GSS is enabled.
- *
- * All char arrays must be null-terminated.
- */
-typedef struct PgBackendGSSStatus
-{
-	/* Information about GSSAPI connection */
-	char		gss_princ[NAMEDATALEN]; /* GSSAPI Principal used to auth */
-	bool		gss_auth;		/* If GSSAPI authentication was used */
-	bool		gss_enc;		/* If encryption is being used */
-
-} PgBackendGSSStatus;
-
-
-/* ----------
- * PgBackendStatus
- *
- * Each live backend maintains a PgBackendStatus struct in shared memory
- * showing its current activity.  (The structs are allocated according to
- * BackendId, but that is not critical.)  Note that this is unrelated to the
- * cumulative stats system (i.e. pgstat.c et al).
- *
- * Each auxiliary process also maintains a PgBackendStatus struct in shared
- * memory.
- * ----------
- */
-typedef struct PgBackendStatus
-{
-	/*
-	 * To avoid locking overhead, we use the following protocol: a backend
-	 * increments st_changecount before modifying its entry, and again after
-	 * finishing a modification.  A would-be reader should note the value of
-	 * st_changecount, copy the entry into private memory, then check
-	 * st_changecount again.  If the value hasn't changed, and if it's even,
-	 * the copy is valid; otherwise start over.  This makes updates cheap
-	 * while reads are potentially expensive, but that's the tradeoff we want.
-	 *
-	 * The above protocol needs memory barriers to ensure that the apparent
-	 * order of execution is as it desires.  Otherwise, for example, the CPU
-	 * might rearrange the code so that st_changecount is incremented twice
-	 * before the modification on a machine with weak memory ordering.  Hence,
-	 * use the macros defined below for manipulating st_changecount, rather
-	 * than touching it directly.
-	 */
-	int			st_changecount;
-
-	/* The entry is valid iff st_procpid > 0, unused if st_procpid == 0 */
-	int			st_procpid;
-
-	/* Type of backends */
-	BackendType st_backendType;
-
-	/* Times when current backend, transaction, and activity started */
-	TimestampTz st_proc_start_timestamp;
-	TimestampTz st_xact_start_timestamp;
-	TimestampTz st_activity_start_timestamp;
-	TimestampTz st_state_start_timestamp;
-
-	/* Database OID, owning user's OID, connection client address */
-	Oid			st_databaseid;
-	Oid			st_userid;
-	SockAddr	st_clientaddr;
-	char	   *st_clienthostname;	/* MUST be null-terminated */
-
-	/* Information about SSL connection */
-	bool		st_ssl;
-	PgBackendSSLStatus *st_sslstatus;
-
-	/* Information about GSSAPI connection */
-	bool		st_gss;
-	PgBackendGSSStatus *st_gssstatus;
-
-	/* current state */
-	BackendState st_state;
-
-	/* application name; MUST be null-terminated */
-	char	   *st_appname;
-
-	/*
-	 * Current command string; MUST be null-terminated. Note that this string
-	 * possibly is truncated in the middle of a multi-byte character. As
-	 * activity strings are stored more frequently than read, that allows to
-	 * move the cost of correct truncation to the display side. Use
-	 * pgstat_clip_activity() to truncate correctly.
-	 */
-	char	   *st_activity_raw;
-
-	/*
-	 * Command progress reporting.  Any command which wishes can advertise
-	 * that it is running by setting st_progress_command,
-	 * st_progress_command_target, and st_progress_param[].
-	 * st_progress_command_target should be the OID of the relation which the
-	 * command targets (we assume there's just one, as this is meant for
-	 * utility commands), but the meaning of each element in the
-	 * st_progress_param array is command-specific.
-	 */
-	ProgressCommandType st_progress_command;
-	Oid			st_progress_command_target;
-	int64		st_progress_param[PGSTAT_NUM_PROGRESS_PARAM];
-
-	/* query identifier, optionally computed using post_parse_analyze_hook */
-	uint64		st_query_id;
-} PgBackendStatus;
-
-
-/*
- * Macros to load and store st_changecount with appropriate memory barriers.
- *
- * Use PGSTAT_BEGIN_WRITE_ACTIVITY() before, and PGSTAT_END_WRITE_ACTIVITY()
- * after, modifying the current process's PgBackendStatus data.  Note that,
- * since there is no mechanism for cleaning up st_changecount after an error,
- * THESE MACROS FORM A CRITICAL SECTION.  Any error between them will be
- * promoted to PANIC, causing a database restart to clean up shared memory!
- * Hence, keep the critical section as short and straight-line as possible.
- * Aside from being safer, that minimizes the window in which readers will
- * have to loop.
- *
- * Reader logic should follow this sketch:
- *
- *		for (;;)
- *		{
- *			int before_ct, after_ct;
- *
- *			pgstat_begin_read_activity(beentry, before_ct);
- *			... copy beentry data to local memory ...
- *			pgstat_end_read_activity(beentry, after_ct);
- *			if (pgstat_read_activity_complete(before_ct, after_ct))
- *				break;
- *			CHECK_FOR_INTERRUPTS();
- *		}
- *
- * For extra safety, we generally use volatile beentry pointers, although
- * the memory barriers should theoretically be sufficient.
- */
-#define PGSTAT_BEGIN_WRITE_ACTIVITY(beentry) \
-	do { \
-		START_CRIT_SECTION(); \
-		(beentry)->st_changecount++; \
-		pg_write_barrier(); \
-	} while (0)
-
-#define PGSTAT_END_WRITE_ACTIVITY(beentry) \
-	do { \
-		pg_write_barrier(); \
-		(beentry)->st_changecount++; \
-		Assert(((beentry)->st_changecount & 1) == 0); \
-		END_CRIT_SECTION(); \
-	} while (0)
-
-#define pgstat_begin_read_activity(beentry, before_changecount) \
-	do { \
-		(before_changecount) = (beentry)->st_changecount; \
-		pg_read_barrier(); \
-	} while (0)
-
-#define pgstat_end_read_activity(beentry, after_changecount) \
-	do { \
-		pg_read_barrier(); \
-		(after_changecount) = (beentry)->st_changecount; \
-	} while (0)
-
-#define pgstat_read_activity_complete(before_changecount, after_changecount) \
-	((before_changecount) == (after_changecount) && \
-	 ((before_changecount) & 1) == 0)
-
-
-/* ----------
- * LocalPgBackendStatus
- *
- * When we build the backend status array, we use LocalPgBackendStatus to be
- * able to add new values to the struct when needed without adding new fields
- * to the shared memory. It contains the backend status as a first member.
- * ----------
- */
-typedef struct LocalPgBackendStatus
-{
-	/*
-	 * Local version of the backend status entry.
-	 */
-	PgBackendStatus backendStatus;
-
-	/*
-	 * The xid of the current transaction if available, InvalidTransactionId
-	 * if not.
-	 */
-	TransactionId backend_xid;
-
-	/*
-	 * The xmin of the current session if available, InvalidTransactionId if
-	 * not.
-	 */
-	TransactionId backend_xmin;
-} LocalPgBackendStatus;
-
-
-/* ----------
- * GUC parameters
- * ----------
- */
-extern PGDLLIMPORT bool pgstat_track_activities;
-extern PGDLLIMPORT int pgstat_track_activity_query_size;
-
-
-/* ----------
- * Other global variables
- * ----------
- */
-extern PGDLLIMPORT PgBackendStatus *MyBEEntry;
-
-
-/* ----------
- * Functions called from postmaster
- * ----------
- */
-extern Size BackendStatusShmemSize(void);
-extern void CreateSharedBackendStatus(void);
-
-
-/* ----------
- * Functions called from backends
- * ----------
- */
-
-/* Initialization functions */
-extern void pgstat_beinit(void);
-extern void pgstat_bestart(void);
-
-extern void pgstat_clear_backend_activity_snapshot(void);
-
-/* Activity reporting functions */
-extern void pgstat_report_activity(BackendState state, const char *cmd_str);
-extern void pgstat_report_query_id(uint64 query_id, bool force);
-extern void pgstat_report_tempfile(size_t filesize);
-extern void pgstat_report_appname(const char *appname);
-extern void pgstat_report_xact_timestamp(TimestampTz tstamp);
-extern const char *pgstat_get_backend_current_activity(int pid, bool checkUser);
-extern const char *pgstat_get_crashed_backend_activity(int pid, char *buffer,
-													   int buflen);
-extern uint64 pgstat_get_my_query_id(void);
-
-
-/* ----------
- * Support functions for the SQL-callable functions to
- * generate the pgstat* views.
- * ----------
- */
-extern int	pgstat_fetch_stat_numbackends(void);
-extern PgBackendStatus *pgstat_fetch_stat_beentry(int beid);
-extern LocalPgBackendStatus *pgstat_fetch_stat_local_beentry(int beid);
-extern char *pgstat_clip_activity(const char *raw_activity);
-
-
-#endif							/* BACKEND_STATUS_H */

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

@@ -1,127 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * builtins.h
- *	  Declarations for operations on built-in types.
- *
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/builtins.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef BUILTINS_H
-#define BUILTINS_H
-
-#include "fmgr.h"
-#include "nodes/nodes.h"
-#include "utils/fmgrprotos.h"
-
-/* Sign + the most decimal digits an 8-byte number could have */
-#define MAXINT8LEN 20
-
-/* bool.c */
-extern bool parse_bool(const char *value, bool *result);
-extern bool parse_bool_with_len(const char *value, size_t len, bool *result);
-
-/* domains.c */
-extern void domain_check(Datum value, bool isnull, Oid domainType,
-						 void **extra, MemoryContext mcxt);
-extern int	errdatatype(Oid datatypeOid);
-extern int	errdomainconstraint(Oid datatypeOid, const char *conname);
-
-/* encode.c */
-extern uint64 hex_encode(const char *src, size_t len, char *dst);
-extern uint64 hex_decode(const char *src, size_t len, char *dst);
-
-/* int.c */
-extern int2vector *buildint2vector(const int16 *int2s, int n);
-
-/* name.c */
-extern void namestrcpy(Name name, const char *str);
-extern int	namestrcmp(Name name, const char *str);
-
-/* numutils.c */
-extern int16 pg_strtoint16(const char *s);
-extern int32 pg_strtoint32(const char *s);
-extern int64 pg_strtoint64(const char *s);
-extern int	pg_itoa(int16 i, char *a);
-extern int	pg_ultoa_n(uint32 l, char *a);
-extern int	pg_ulltoa_n(uint64 l, char *a);
-extern int	pg_ltoa(int32 l, char *a);
-extern int	pg_lltoa(int64 ll, char *a);
-extern char *pg_ultostr_zeropad(char *str, uint32 value, int32 minwidth);
-extern char *pg_ultostr(char *str, uint32 value);
-
-/* oid.c */
-extern oidvector *buildoidvector(const Oid *oids, int n);
-extern Oid	oidparse(Node *node);
-extern int	oid_cmp(const void *p1, const void *p2);
-
-/* regexp.c */
-extern char *regexp_fixed_prefix(text *text_re, bool case_insensitive,
-								 Oid collation, bool *exact);
-
-/* ruleutils.c */
-extern PGDLLIMPORT __thread  bool quote_all_identifiers;
-extern const char *quote_identifier(const char *ident);
-extern char *quote_qualified_identifier(const char *qualifier,
-										const char *ident);
-extern void generate_operator_clause(fmStringInfo buf,
-									 const char *leftop, Oid leftoptype,
-									 Oid opoid,
-									 const char *rightop, Oid rightoptype);
-
-/* varchar.c */
-extern int	bpchartruelen(char *s, int len);
-
-/* popular functions from varlena.c */
-extern text *cstring_to_text(const char *s);
-extern text *cstring_to_text_with_len(const char *s, int len);
-extern char *text_to_cstring(const text *t);
-extern void text_to_cstring_buffer(const text *src, char *dst, size_t dst_len);
-
-#define CStringGetTextDatum(s) PointerGetDatum(cstring_to_text(s))
-#define TextDatumGetCString(d) text_to_cstring((text *) DatumGetPointer(d))
-
-/* xid.c */
-extern int	xidComparator(const void *arg1, const void *arg2);
-extern int	xidLogicalComparator(const void *arg1, const void *arg2);
-
-/* inet_cidr_ntop.c */
-extern char *pg_inet_cidr_ntop(int af, const void *src, int bits,
-							   char *dst, size_t size);
-
-/* inet_net_pton.c */
-extern int	pg_inet_net_pton(int af, const char *src,
-							 void *dst, size_t size);
-
-/* network.c */
-extern double convert_network_to_scalar(Datum value, Oid typid, bool *failure);
-extern Datum network_scan_first(Datum in);
-extern Datum network_scan_last(Datum in);
-extern void clean_ipv6_addr(int addr_family, char *addr);
-
-/* numeric.c */
-extern Datum numeric_float8_no_overflow(PG_FUNCTION_ARGS);
-
-/* format_type.c */
-
-/* Control flags for format_type_extended */
-#define FORMAT_TYPE_TYPEMOD_GIVEN	0x01	/* typemod defined by caller */
-#define FORMAT_TYPE_ALLOW_INVALID	0x02	/* allow invalid types */
-#define FORMAT_TYPE_FORCE_QUALIFY	0x04	/* force qualification of type */
-#define FORMAT_TYPE_INVALID_AS_NULL	0x08	/* NULL if undefined */
-extern char *format_type_extended(Oid type_oid, int32 typemod, bits16 flags);
-
-extern char *format_type_be(Oid type_oid);
-extern char *format_type_be_qualified(Oid type_oid);
-extern char *format_type_with_typemod(Oid type_oid, int32 typemod);
-
-extern int32 type_maximum_size(Oid type_oid, int32 typemod);
-
-/* quote.c */
-extern char *quote_literal_cstr(const char *rawstr);
-
-#endif							/* BUILTINS_H */

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

@@ -1,28 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * bytea.h
- *	  Declarations for BYTEA data type support.
- *
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/bytea.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef BYTEA_H
-#define BYTEA_H
-
-
-
-typedef enum
-{
-	BYTEA_OUTPUT_ESCAPE,
-	BYTEA_OUTPUT_HEX
-}			ByteaOutputType;
-
-extern PGDLLIMPORT int bytea_output;	/* ByteaOutputType, but int for GUC
-										 * enum */
-
-#endif							/* BYTEA_H */

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

@@ -1,231 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * catcache.h
- *	  Low-level catalog cache definitions.
- *
- * NOTE: every catalog cache must have a corresponding unique index on
- * the system table that it caches --- ie, the index must match the keys
- * used to do lookups in this cache.  All cache fetches are done with
- * indexscans (under normal conditions).  The index should be unique to
- * guarantee that there can only be one matching row for a key combination.
- *
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/catcache.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef CATCACHE_H
-#define CATCACHE_H
-
-#include "access/htup.h"
-#include "access/skey.h"
-#include "lib/ilist.h"
-#include "utils/relcache.h"
-
-/*
- *		struct catctup:			individual tuple in the cache.
- *		struct catclist:		list of tuples matching a partial key.
- *		struct catcache:		information for managing a cache.
- *		struct catcacheheader:	information for managing all the caches.
- */
-
-#define CATCACHE_MAXKEYS		4
-
-
-/* function computing a datum's hash */
-typedef uint32 (*CCHashFN) (Datum datum);
-
-/* function computing equality of two datums */
-typedef bool (*CCFastEqualFN) (Datum a, Datum b);
-
-typedef struct catcache
-{
-	int			id;				/* cache identifier --- see syscache.h */
-	int			cc_nbuckets;	/* # of hash buckets in this cache */
-	TupleDesc	cc_tupdesc;		/* tuple descriptor (copied from reldesc) */
-	dlist_head *cc_bucket;		/* hash buckets */
-	CCHashFN	cc_hashfunc[CATCACHE_MAXKEYS];	/* hash function for each key */
-	CCFastEqualFN cc_fastequal[CATCACHE_MAXKEYS];	/* fast equal function for
-													 * each key */
-	int			cc_keyno[CATCACHE_MAXKEYS]; /* AttrNumber of each key */
-	dlist_head	cc_lists;		/* list of CatCList structs */
-	int			cc_ntup;		/* # of tuples currently in this cache */
-	int			cc_nkeys;		/* # of keys (1..CATCACHE_MAXKEYS) */
-	const char *cc_relname;		/* name of relation the tuples come from */
-	Oid			cc_reloid;		/* OID of relation the tuples come from */
-	Oid			cc_indexoid;	/* OID of index matching cache keys */
-	bool		cc_relisshared; /* is relation shared across databases? */
-	slist_node	cc_next;		/* list link */
-	ScanKeyData cc_skey[CATCACHE_MAXKEYS];	/* precomputed key info for heap
-											 * scans */
-
-	/*
-	 * Keep these at the end, so that compiling catcache.c with CATCACHE_STATS
-	 * doesn't break ABI for other modules
-	 */
-#ifdef CATCACHE_STATS
-	long		cc_searches;	/* total # searches against this cache */
-	long		cc_hits;		/* # of matches against existing entry */
-	long		cc_neg_hits;	/* # of matches against negative entry */
-	long		cc_newloads;	/* # of successful loads of new entry */
-
-	/*
-	 * cc_searches - (cc_hits + cc_neg_hits + cc_newloads) is number of failed
-	 * searches, each of which will result in loading a negative entry
-	 */
-	long		cc_invals;		/* # of entries invalidated from cache */
-	long		cc_lsearches;	/* total # list-searches */
-	long		cc_lhits;		/* # of matches against existing lists */
-#endif
-} CatCache;
-
-
-typedef struct catctup
-{
-	int			ct_magic;		/* for identifying CatCTup entries */
-#define CT_MAGIC   0x57261502
-
-	uint32		hash_value;		/* hash value for this tuple's keys */
-
-	/*
-	 * Lookup keys for the entry. By-reference datums point into the tuple for
-	 * positive cache entries, and are separately allocated for negative ones.
-	 */
-	Datum		keys[CATCACHE_MAXKEYS];
-
-	/*
-	 * Each tuple in a cache is a member of a dlist that stores the elements
-	 * of its hash bucket.  We keep each dlist in LRU order to speed repeated
-	 * lookups.
-	 */
-	dlist_node	cache_elem;		/* list member of per-bucket list */
-
-	/*
-	 * A tuple marked "dead" must not be returned by subsequent searches.
-	 * However, it won't be physically deleted from the cache until its
-	 * refcount goes to zero.  (If it's a member of a CatCList, the list's
-	 * refcount must go to zero, too; also, remember to mark the list dead at
-	 * the same time the tuple is marked.)
-	 *
-	 * A negative cache entry is an assertion that there is no tuple matching
-	 * a particular key.  This is just as useful as a normal entry so far as
-	 * avoiding catalog searches is concerned.  Management of positive and
-	 * negative entries is identical.
-	 */
-	int			refcount;		/* number of active references */
-	bool		dead;			/* dead but not yet removed? */
-	bool		negative;		/* negative cache entry? */
-	HeapTupleData tuple;		/* tuple management header */
-
-	/*
-	 * The tuple may also be a member of at most one CatCList.  (If a single
-	 * catcache is list-searched with varying numbers of keys, we may have to
-	 * make multiple entries for the same tuple because of this restriction.
-	 * Currently, that's not expected to be common, so we accept the potential
-	 * inefficiency.)
-	 */
-	struct catclist *c_list;	/* containing CatCList, or NULL if none */
-
-	CatCache   *my_cache;		/* link to owning catcache */
-	/* properly aligned tuple data follows, unless a negative entry */
-} CatCTup;
-
-
-/*
- * A CatCList describes the result of a partial search, ie, a search using
- * only the first K key columns of an N-key cache.  We store the keys used
- * into the keys attribute to represent the stored key set.  The CatCList
- * object contains links to cache entries for all the table rows satisfying
- * the partial key.  (Note: none of these will be negative cache entries.)
- *
- * A CatCList is only a member of a per-cache list; we do not currently
- * divide them into hash buckets.
- *
- * A list marked "dead" must not be returned by subsequent searches.
- * However, it won't be physically deleted from the cache until its
- * refcount goes to zero.  (A list should be marked dead if any of its
- * member entries are dead.)
- *
- * If "ordered" is true then the member tuples appear in the order of the
- * cache's underlying index.  This will be true in normal operation, but
- * might not be true during bootstrap or recovery operations. (namespace.c
- * is able to save some cycles when it is true.)
- */
-typedef struct catclist
-{
-	int			cl_magic;		/* for identifying CatCList entries */
-#define CL_MAGIC   0x52765103
-
-	uint32		hash_value;		/* hash value for lookup keys */
-
-	dlist_node	cache_elem;		/* list member of per-catcache list */
-
-	/*
-	 * Lookup keys for the entry, with the first nkeys elements being valid.
-	 * All by-reference are separately allocated.
-	 */
-	Datum		keys[CATCACHE_MAXKEYS];
-
-	int			refcount;		/* number of active references */
-	bool		dead;			/* dead but not yet removed? */
-	bool		ordered;		/* members listed in index order? */
-	short		nkeys;			/* number of lookup keys specified */
-	int			n_members;		/* number of member tuples */
-	CatCache   *my_cache;		/* link to owning catcache */
-	CatCTup    *members[FLEXIBLE_ARRAY_MEMBER]; /* members */
-} CatCList;
-
-
-typedef struct catcacheheader
-{
-	slist_head	ch_caches;		/* head of list of CatCache structs */
-	int			ch_ntup;		/* # of tuples in all caches */
-} CatCacheHeader;
-
-
-/* this extern duplicates utils/memutils.h... */
-extern PGDLLIMPORT MemoryContext CacheMemoryContext;
-
-extern void CreateCacheMemoryContext(void);
-
-extern CatCache *InitCatCache(int id, Oid reloid, Oid indexoid,
-							  int nkeys, const int *key,
-							  int nbuckets);
-extern void InitCatCachePhase2(CatCache *cache, bool touch_index);
-
-extern HeapTuple SearchCatCache(CatCache *cache,
-								Datum v1, Datum v2, Datum v3, Datum v4);
-extern HeapTuple SearchCatCache1(CatCache *cache,
-								 Datum v1);
-extern HeapTuple SearchCatCache2(CatCache *cache,
-								 Datum v1, Datum v2);
-extern HeapTuple SearchCatCache3(CatCache *cache,
-								 Datum v1, Datum v2, Datum v3);
-extern HeapTuple SearchCatCache4(CatCache *cache,
-								 Datum v1, Datum v2, Datum v3, Datum v4);
-extern void ReleaseCatCache(HeapTuple tuple);
-
-extern uint32 GetCatCacheHashValue(CatCache *cache,
-								   Datum v1, Datum v2,
-								   Datum v3, Datum v4);
-
-extern CatCList *SearchCatCacheList(CatCache *cache, int nkeys,
-									Datum v1, Datum v2,
-									Datum v3);
-extern void ReleaseCatCacheList(CatCList *list);
-
-extern void ResetCatalogCaches(void);
-extern void CatalogCacheFlushCatalog(Oid catId);
-extern void CatCacheInvalidate(CatCache *cache, uint32 hashValue);
-extern void PrepareToInvalidateCacheTuple(Relation relation,
-										  HeapTuple tuple,
-										  HeapTuple newtuple,
-										  void (*function) (int, uint32, Oid));
-
-extern void PrintCatCacheLeakWarning(HeapTuple tuple);
-extern void PrintCatCacheListLeakWarning(CatCList *list);
-
-#endif							/* CATCACHE_H */