pg_query 4.2.1 → 6.1.0

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

@@ -1,291 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * tuplesort.h
- *	  Generalized tuple sorting routines.
- *
- * This module handles sorting of heap tuples, index tuples, or single
- * Datums (and could easily support other kinds of sortable objects,
- * if necessary).  It works efficiently for both small and large amounts
- * of data.  Small amounts are sorted in-memory using qsort().  Large
- * amounts are sorted using temporary files and a standard external sort
- * algorithm.  Parallel sorts use a variant of this external sort
- * algorithm, and are typically only used for large amounts of data.
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/tuplesort.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef TUPLESORT_H
-#define TUPLESORT_H
-
-#include "access/itup.h"
-#include "executor/tuptable.h"
-#include "storage/dsm.h"
-#include "utils/relcache.h"
-
-
-/*
- * Tuplesortstate and Sharedsort are opaque types whose details are not
- * known outside tuplesort.c.
- */
-typedef struct Tuplesortstate Tuplesortstate;
-typedef struct Sharedsort Sharedsort;
-
-/*
- * Tuplesort parallel coordination state, allocated by each participant in
- * local memory.  Participant caller initializes everything.  See usage notes
- * below.
- */
-typedef struct SortCoordinateData
-{
-	/* Worker process?  If not, must be leader. */
-	bool		isWorker;
-
-	/*
-	 * Leader-process-passed number of participants known launched (workers
-	 * set this to -1).  Includes state within leader needed for it to
-	 * participate as a worker, if any.
-	 */
-	int			nParticipants;
-
-	/* Private opaque state (points to shared memory) */
-	Sharedsort *sharedsort;
-}			SortCoordinateData;
-
-typedef struct SortCoordinateData *SortCoordinate;
-
-/*
- * Data structures for reporting sort statistics.  Note that
- * TuplesortInstrumentation can't contain any pointers because we
- * sometimes put it in shared memory.
- *
- * The parallel-sort infrastructure relies on having a zero TuplesortMethod
- * to indicate that a worker never did anything, so we assign zero to
- * SORT_TYPE_STILL_IN_PROGRESS.  The other values of this enum can be
- * OR'ed together to represent a situation where different workers used
- * different methods, so we need a separate bit for each one.  Keep the
- * NUM_TUPLESORTMETHODS constant in sync with the number of bits!
- */
-typedef enum
-{
-	SORT_TYPE_STILL_IN_PROGRESS = 0,
-	SORT_TYPE_TOP_N_HEAPSORT = 1 << 0,
-	SORT_TYPE_QUICKSORT = 1 << 1,
-	SORT_TYPE_EXTERNAL_SORT = 1 << 2,
-	SORT_TYPE_EXTERNAL_MERGE = 1 << 3
-} TuplesortMethod;
-
-#define NUM_TUPLESORTMETHODS 4
-
-typedef enum
-{
-	SORT_SPACE_TYPE_DISK,
-	SORT_SPACE_TYPE_MEMORY
-} TuplesortSpaceType;
-
-/* Bitwise option flags for tuple sorts */
-#define TUPLESORT_NONE					0
-
-/* specifies whether non-sequential access to the sort result is required */
-#define	TUPLESORT_RANDOMACCESS			(1 << 0)
-
-/* specifies if the tuplesort is able to support bounded sorts */
-#define TUPLESORT_ALLOWBOUNDED			(1 << 1)
-
-typedef struct TuplesortInstrumentation
-{
-	TuplesortMethod sortMethod; /* sort algorithm used */
-	TuplesortSpaceType spaceType;	/* type of space spaceUsed represents */
-	int64		spaceUsed;		/* space consumption, in kB */
-} TuplesortInstrumentation;
-
-
-/*
- * We provide multiple interfaces to what is essentially the same code,
- * since different callers have different data to be sorted and want to
- * specify the sort key information differently.  There are two APIs for
- * sorting HeapTuples and two more for sorting IndexTuples.  Yet another
- * API supports sorting bare Datums.
- *
- * Serial sort callers should pass NULL for their coordinate argument.
- *
- * The "heap" API actually stores/sorts MinimalTuples, which means it doesn't
- * preserve the system columns (tuple identity and transaction visibility
- * info).  The sort keys are specified by column numbers within the tuples
- * and sort operator OIDs.  We save some cycles by passing and returning the
- * tuples in TupleTableSlots, rather than forming actual HeapTuples (which'd
- * have to be converted to MinimalTuples).  This API works well for sorts
- * executed as parts of plan trees.
- *
- * The "cluster" API stores/sorts full HeapTuples including all visibility
- * info. The sort keys are specified by reference to a btree index that is
- * defined on the relation to be sorted.  Note that putheaptuple/getheaptuple
- * go with this API, not the "begin_heap" one!
- *
- * The "index_btree" API stores/sorts IndexTuples (preserving all their
- * header fields).  The sort keys are specified by a btree index definition.
- *
- * The "index_hash" API is similar to index_btree, but the tuples are
- * actually sorted by their hash codes not the raw data.
- *
- * Parallel sort callers are required to coordinate multiple tuplesort states
- * in a leader process and one or more worker processes.  The leader process
- * must launch workers, and have each perform an independent "partial"
- * tuplesort, typically fed by the parallel heap interface.  The leader later
- * produces the final output (internally, it merges runs output by workers).
- *
- * Callers must do the following to perform a sort in parallel using multiple
- * worker processes:
- *
- * 1. Request tuplesort-private shared memory for n workers.  Use
- *    tuplesort_estimate_shared() to get the required size.
- * 2. Have leader process initialize allocated shared memory using
- *    tuplesort_initialize_shared().  Launch workers.
- * 3. Initialize a coordinate argument within both the leader process, and
- *    for each worker process.  This has a pointer to the shared
- *    tuplesort-private structure, as well as some caller-initialized fields.
- *    Leader's coordinate argument reliably indicates number of workers
- *    launched (this is unused by workers).
- * 4. Begin a tuplesort using some appropriate tuplesort_begin* routine,
- *    (passing the coordinate argument) within each worker.  The workMem
- *    arguments need not be identical.  All other arguments should match
- *    exactly, though.
- * 5. tuplesort_attach_shared() should be called by all workers.  Feed tuples
- *    to each worker, and call tuplesort_performsort() within each when input
- *    is exhausted.
- * 6. Call tuplesort_end() in each worker process.  Worker processes can shut
- *    down once tuplesort_end() returns.
- * 7. Begin a tuplesort in the leader using the same tuplesort_begin*
- *    routine, passing a leader-appropriate coordinate argument (this can
- *    happen as early as during step 3, actually, since we only need to know
- *    the number of workers successfully launched).  The leader must now wait
- *    for workers to finish.  Caller must use own mechanism for ensuring that
- *    next step isn't reached until all workers have called and returned from
- *    tuplesort_performsort().  (Note that it's okay if workers have already
- *    also called tuplesort_end() by then.)
- * 8. Call tuplesort_performsort() in leader.  Consume output using the
- *    appropriate tuplesort_get* routine.  Leader can skip this step if
- *    tuplesort turns out to be unnecessary.
- * 9. Call tuplesort_end() in leader.
- *
- * This division of labor assumes nothing about how input tuples are produced,
- * but does require that caller combine the state of multiple tuplesorts for
- * any purpose other than producing the final output.  For example, callers
- * must consider that tuplesort_get_stats() reports on only one worker's role
- * in a sort (or the leader's role), and not statistics for the sort as a
- * whole.
- *
- * Note that callers may use the leader process to sort runs as if it was an
- * independent worker process (prior to the process performing a leader sort
- * to produce the final sorted output).  Doing so only requires a second
- * "partial" tuplesort within the leader process, initialized like that of a
- * worker process.  The steps above don't touch on this directly.  The only
- * difference is that the tuplesort_attach_shared() call is never needed within
- * leader process, because the backend as a whole holds the shared fileset
- * reference.  A worker Tuplesortstate in leader is expected to do exactly the
- * same amount of total initial processing work as a worker process
- * Tuplesortstate, since the leader process has nothing else to do before
- * workers finish.
- *
- * Note that only a very small amount of memory will be allocated prior to
- * the leader state first consuming input, and that workers will free the
- * vast majority of their memory upon returning from tuplesort_performsort().
- * Callers can rely on this to arrange for memory to be used in a way that
- * respects a workMem-style budget across an entire parallel sort operation.
- *
- * Callers are responsible for parallel safety in general.  However, they
- * can at least rely on there being no parallel safety hazards within
- * tuplesort, because tuplesort thinks of the sort as several independent
- * sorts whose results are combined.  Since, in general, the behavior of
- * sort operators is immutable, caller need only worry about the parallel
- * safety of whatever the process is through which input tuples are
- * generated (typically, caller uses a parallel heap scan).
- */
-
-extern Tuplesortstate *tuplesort_begin_heap(TupleDesc tupDesc,
-											int nkeys, AttrNumber *attNums,
-											Oid *sortOperators, Oid *sortCollations,
-											bool *nullsFirstFlags,
-											int workMem, SortCoordinate coordinate,
-											int sortopt);
-extern Tuplesortstate *tuplesort_begin_cluster(TupleDesc tupDesc,
-											   Relation indexRel, int workMem,
-											   SortCoordinate coordinate,
-											   int sortopt);
-extern Tuplesortstate *tuplesort_begin_index_btree(Relation heapRel,
-												   Relation indexRel,
-												   bool enforceUnique,
-												   bool uniqueNullsNotDistinct,
-												   int workMem, SortCoordinate coordinate,
-												   int sortopt);
-extern Tuplesortstate *tuplesort_begin_index_hash(Relation heapRel,
-												  Relation indexRel,
-												  uint32 high_mask,
-												  uint32 low_mask,
-												  uint32 max_buckets,
-												  int workMem, SortCoordinate coordinate,
-												  int sortopt);
-extern Tuplesortstate *tuplesort_begin_index_gist(Relation heapRel,
-												  Relation indexRel,
-												  int workMem, SortCoordinate coordinate,
-												  int sortopt);
-extern Tuplesortstate *tuplesort_begin_datum(Oid datumType,
-											 Oid sortOperator, Oid sortCollation,
-											 bool nullsFirstFlag,
-											 int workMem, SortCoordinate coordinate,
-											 int sortopt);
-
-extern void tuplesort_set_bound(Tuplesortstate *state, int64 bound);
-extern bool tuplesort_used_bound(Tuplesortstate *state);
-
-extern void tuplesort_puttupleslot(Tuplesortstate *state,
-								   TupleTableSlot *slot);
-extern void tuplesort_putheaptuple(Tuplesortstate *state, HeapTuple tup);
-extern void tuplesort_putindextuplevalues(Tuplesortstate *state,
-										  Relation rel, ItemPointer self,
-										  Datum *values, bool *isnull);
-extern void tuplesort_putdatum(Tuplesortstate *state, Datum val,
-							   bool isNull);
-
-extern void tuplesort_performsort(Tuplesortstate *state);
-
-extern bool tuplesort_gettupleslot(Tuplesortstate *state, bool forward,
-								   bool copy, TupleTableSlot *slot, Datum *abbrev);
-extern HeapTuple tuplesort_getheaptuple(Tuplesortstate *state, bool forward);
-extern IndexTuple tuplesort_getindextuple(Tuplesortstate *state, bool forward);
-extern bool tuplesort_getdatum(Tuplesortstate *state, bool forward,
-							   Datum *val, bool *isNull, Datum *abbrev);
-
-extern bool tuplesort_skiptuples(Tuplesortstate *state, int64 ntuples,
-								 bool forward);
-
-extern void tuplesort_end(Tuplesortstate *state);
-
-extern void tuplesort_reset(Tuplesortstate *state);
-
-extern void tuplesort_get_stats(Tuplesortstate *state,
-								TuplesortInstrumentation *stats);
-extern const char *tuplesort_method_name(TuplesortMethod m);
-extern const char *tuplesort_space_type_name(TuplesortSpaceType t);
-
-extern int	tuplesort_merge_order(int64 allowedMem);
-
-extern Size tuplesort_estimate_shared(int nworkers);
-extern void tuplesort_initialize_shared(Sharedsort *shared, int nWorkers,
-										dsm_segment *seg);
-extern void tuplesort_attach_shared(Sharedsort *shared, dsm_segment *seg);
-
-/*
- * These routines may only be called if TUPLESORT_RANDOMACCESS was specified
- * during tuplesort_begin_*.  Additionally backwards scan in gettuple/getdatum
- * also require TUPLESORT_RANDOMACCESS.  Note that parallel sorts do not
- * support random access.
- */
-extern void tuplesort_rescan(Tuplesortstate *state);
-extern void tuplesort_markpos(Tuplesortstate *state);
-extern void tuplesort_restorepos(Tuplesortstate *state);
-
-#endif							/* TUPLESORT_H */

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

@@ -1,91 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * tuplestore.h
- *	  Generalized routines for temporary tuple storage.
- *
- * This module handles temporary storage of tuples for purposes such
- * as Materialize nodes, hashjoin batch files, etc.  It is essentially
- * a dumbed-down version of tuplesort.c; it does no sorting of tuples
- * but can only store and regurgitate a sequence of tuples.  However,
- * because no sort is required, it is allowed to start reading the sequence
- * before it has all been written.  This is particularly useful for cursors,
- * because it allows random access within the already-scanned portion of
- * a query without having to process the underlying scan to completion.
- * Also, it is possible to support multiple independent read pointers.
- *
- * A temporary file is used to handle the data if it exceeds the
- * space limit specified by the caller.
- *
- * Beginning in Postgres 8.2, what is stored is just MinimalTuples;
- * callers cannot expect valid system columns in regurgitated tuples.
- * Also, we have changed the API to return tuples in TupleTableSlots,
- * so that there is a check to prevent attempted access to system columns.
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/tuplestore.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef TUPLESTORE_H
-#define TUPLESTORE_H
-
-#include "executor/tuptable.h"
-
-
-/* Tuplestorestate is an opaque type whose details are not known outside
- * tuplestore.c.
- */
-typedef struct Tuplestorestate Tuplestorestate;
-
-/*
- * Currently we only need to store MinimalTuples, but it would be easy
- * to support the same behavior for IndexTuples and/or bare Datums.
- */
-
-extern Tuplestorestate *tuplestore_begin_heap(bool randomAccess,
-											  bool interXact,
-											  int maxKBytes);
-
-extern void tuplestore_set_eflags(Tuplestorestate *state, int eflags);
-
-extern void tuplestore_puttupleslot(Tuplestorestate *state,
-									TupleTableSlot *slot);
-extern void tuplestore_puttuple(Tuplestorestate *state, HeapTuple tuple);
-extern void tuplestore_putvalues(Tuplestorestate *state, TupleDesc tdesc,
-								 Datum *values, bool *isnull);
-
-/* Backwards compatibility macro */
-#define tuplestore_donestoring(state)	((void) 0)
-
-extern int	tuplestore_alloc_read_pointer(Tuplestorestate *state, int eflags);
-
-extern void tuplestore_select_read_pointer(Tuplestorestate *state, int ptr);
-
-extern void tuplestore_copy_read_pointer(Tuplestorestate *state,
-										 int srcptr, int destptr);
-
-extern void tuplestore_trim(Tuplestorestate *state);
-
-extern bool tuplestore_in_memory(Tuplestorestate *state);
-
-extern bool tuplestore_gettupleslot(Tuplestorestate *state, bool forward,
-									bool copy, TupleTableSlot *slot);
-
-extern bool tuplestore_advance(Tuplestorestate *state, bool forward);
-
-extern bool tuplestore_skiptuples(Tuplestorestate *state,
-								  int64 ntuples, bool forward);
-
-extern int64 tuplestore_tuple_count(Tuplestorestate *state);
-
-extern bool tuplestore_ateof(Tuplestorestate *state);
-
-extern void tuplestore_rescan(Tuplestorestate *state);
-
-extern void tuplestore_clear(Tuplestorestate *state);
-
-extern void tuplestore_end(Tuplestorestate *state);
-
-#endif							/* TUPLESTORE_H */

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

@@ -1,209 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * typcache.h
- *	  Type cache definitions.
- *
- * The type cache exists to speed lookup of certain information about data
- * types that is not directly available from a type's pg_type row.
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/typcache.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef TYPCACHE_H
-#define TYPCACHE_H
-
-#include "access/tupdesc.h"
-#include "fmgr.h"
-#include "storage/dsm.h"
-#include "utils/dsa.h"
-
-
-/* DomainConstraintCache is an opaque struct known only within typcache.c */
-typedef struct DomainConstraintCache DomainConstraintCache;
-
-/* TypeCacheEnumData is an opaque struct known only within typcache.c */
-struct TypeCacheEnumData;
-
-typedef struct TypeCacheEntry
-{
-	/* typeId is the hash lookup key and MUST BE FIRST */
-	Oid			type_id;		/* OID of the data type */
-
-	uint32		type_id_hash;	/* hashed value of the OID */
-
-	/* some subsidiary information copied from the pg_type row */
-	int16		typlen;
-	bool		typbyval;
-	char		typalign;
-	char		typstorage;
-	char		typtype;
-	Oid			typrelid;
-	Oid			typsubscript;
-	Oid			typelem;
-	Oid			typcollation;
-
-	/*
-	 * Information obtained from opfamily entries
-	 *
-	 * These will be InvalidOid if no match could be found, or if the
-	 * information hasn't yet been requested.  Also note that for array and
-	 * composite types, typcache.c checks that the contained types are
-	 * comparable or hashable before allowing eq_opr etc to become set.
-	 */
-	Oid			btree_opf;		/* the default btree opclass' family */
-	Oid			btree_opintype; /* the default btree opclass' opcintype */
-	Oid			hash_opf;		/* the default hash opclass' family */
-	Oid			hash_opintype;	/* the default hash opclass' opcintype */
-	Oid			eq_opr;			/* the equality operator */
-	Oid			lt_opr;			/* the less-than operator */
-	Oid			gt_opr;			/* the greater-than operator */
-	Oid			cmp_proc;		/* the btree comparison function */
-	Oid			hash_proc;		/* the hash calculation function */
-	Oid			hash_extended_proc; /* the extended hash calculation function */
-
-	/*
-	 * Pre-set-up fmgr call info for the equality operator, the btree
-	 * comparison function, and the hash calculation function.  These are kept
-	 * in the type cache to avoid problems with memory leaks in repeated calls
-	 * to functions such as array_eq, array_cmp, hash_array.  There is not
-	 * currently a need to maintain call info for the lt_opr or gt_opr.
-	 */
-	FmgrInfo	eq_opr_finfo;
-	FmgrInfo	cmp_proc_finfo;
-	FmgrInfo	hash_proc_finfo;
-	FmgrInfo	hash_extended_proc_finfo;
-
-	/*
-	 * Tuple descriptor if it's a composite type (row type).  NULL if not
-	 * composite or information hasn't yet been requested.  (NOTE: this is a
-	 * reference-counted tupledesc.)
-	 *
-	 * To simplify caching dependent info, tupDesc_identifier is an identifier
-	 * for this tupledesc that is unique for the life of the process, and
-	 * changes anytime the tupledesc does.  Zero if not yet determined.
-	 */
-	TupleDesc	tupDesc;
-	uint64		tupDesc_identifier;
-
-	/*
-	 * Fields computed when TYPECACHE_RANGE_INFO is requested.  Zeroes if not
-	 * a range type or information hasn't yet been requested.  Note that
-	 * rng_cmp_proc_finfo could be different from the element type's default
-	 * btree comparison function.
-	 */
-	struct TypeCacheEntry *rngelemtype; /* range's element type */
-	Oid			rng_collation;	/* collation for comparisons, if any */
-	FmgrInfo	rng_cmp_proc_finfo; /* comparison function */
-	FmgrInfo	rng_canonical_finfo;	/* canonicalization function, if any */
-	FmgrInfo	rng_subdiff_finfo;	/* difference function, if any */
-
-	/*
-	 * Fields computed when TYPECACHE_MULTIRANGE_INFO is required.
-	 */
-	struct TypeCacheEntry *rngtype; /* multirange's range underlying type */
-
-	/*
-	 * Domain's base type and typmod if it's a domain type.  Zeroes if not
-	 * domain, or if information hasn't been requested.
-	 */
-	Oid			domainBaseType;
-	int32		domainBaseTypmod;
-
-	/*
-	 * Domain constraint data if it's a domain type.  NULL if not domain, or
-	 * if domain has no constraints, or if information hasn't been requested.
-	 */
-	DomainConstraintCache *domainData;
-
-	/* Private data, for internal use of typcache.c only */
-	int			flags;			/* flags about what we've computed */
-
-	/*
-	 * Private information about an enum type.  NULL if not enum or
-	 * information hasn't been requested.
-	 */
-	struct TypeCacheEnumData *enumData;
-
-	/* We also maintain a list of all known domain-type cache entries */
-	struct TypeCacheEntry *nextDomain;
-} TypeCacheEntry;
-
-/* Bit flags to indicate which fields a given caller needs to have set */
-#define TYPECACHE_EQ_OPR			0x00001
-#define TYPECACHE_LT_OPR			0x00002
-#define TYPECACHE_GT_OPR			0x00004
-#define TYPECACHE_CMP_PROC			0x00008
-#define TYPECACHE_HASH_PROC			0x00010
-#define TYPECACHE_EQ_OPR_FINFO		0x00020
-#define TYPECACHE_CMP_PROC_FINFO	0x00040
-#define TYPECACHE_HASH_PROC_FINFO	0x00080
-#define TYPECACHE_TUPDESC			0x00100
-#define TYPECACHE_BTREE_OPFAMILY	0x00200
-#define TYPECACHE_HASH_OPFAMILY		0x00400
-#define TYPECACHE_RANGE_INFO		0x00800
-#define TYPECACHE_DOMAIN_BASE_INFO			0x01000
-#define TYPECACHE_DOMAIN_CONSTR_INFO		0x02000
-#define TYPECACHE_HASH_EXTENDED_PROC		0x04000
-#define TYPECACHE_HASH_EXTENDED_PROC_FINFO	0x08000
-#define TYPECACHE_MULTIRANGE_INFO			0x10000
-
-/* This value will not equal any valid tupledesc identifier, nor 0 */
-#define INVALID_TUPLEDESC_IDENTIFIER ((uint64) 1)
-
-/*
- * Callers wishing to maintain a long-lived reference to a domain's constraint
- * set must store it in one of these.  Use InitDomainConstraintRef() and
- * UpdateDomainConstraintRef() to manage it.  Note: DomainConstraintState is
- * considered an executable expression type, so it's defined in execnodes.h.
- */
-typedef struct DomainConstraintRef
-{
-	List	   *constraints;	/* list of DomainConstraintState nodes */
-	MemoryContext refctx;		/* context holding DomainConstraintRef */
-	TypeCacheEntry *tcache;		/* typcache entry for domain type */
-	bool		need_exprstate; /* does caller need check_exprstate? */
-
-	/* Management data --- treat these fields as private to typcache.c */
-	DomainConstraintCache *dcc; /* current constraints, or NULL if none */
-	MemoryContextCallback callback; /* used to release refcount when done */
-} DomainConstraintRef;
-
-typedef struct SharedRecordTypmodRegistry SharedRecordTypmodRegistry;
-
-extern TypeCacheEntry *lookup_type_cache(Oid type_id, int flags);
-
-extern void InitDomainConstraintRef(Oid type_id, DomainConstraintRef *ref,
-									MemoryContext refctx, bool need_exprstate);
-
-extern void UpdateDomainConstraintRef(DomainConstraintRef *ref);
-
-extern bool DomainHasConstraints(Oid type_id);
-
-extern TupleDesc lookup_rowtype_tupdesc(Oid type_id, int32 typmod);
-
-extern TupleDesc lookup_rowtype_tupdesc_noerror(Oid type_id, int32 typmod,
-												bool noError);
-
-extern TupleDesc lookup_rowtype_tupdesc_copy(Oid type_id, int32 typmod);
-
-extern TupleDesc lookup_rowtype_tupdesc_domain(Oid type_id, int32 typmod,
-											   bool noError);
-
-extern void assign_record_type_typmod(TupleDesc tupDesc);
-
-extern uint64 assign_record_type_identifier(Oid type_id, int32 typmod);
-
-extern int	compare_values_of_enum(TypeCacheEntry *tcache, Oid arg1, Oid arg2);
-
-extern size_t SharedRecordTypmodRegistryEstimate(void);
-
-extern void SharedRecordTypmodRegistryInit(SharedRecordTypmodRegistry *,
-										   dsm_segment *segment, dsa_area *area);
-
-extern void SharedRecordTypmodRegistryAttach(SharedRecordTypmodRegistry *);
-
-#endif							/* TYPCACHE_H */

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

@@ -1,39 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * tzparser.h
- *	  Timezone offset file parsing definitions.
- *
- * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/utils/tzparser.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef TZPARSER_H
-#define TZPARSER_H
-
-#include "utils/datetime.h"
-
-/*
- * The result of parsing a timezone configuration file is an array of
- * these structs, in order by abbrev.  We export this because datetime.c
- * needs it.
- */
-typedef struct tzEntry
-{
-	/* the actual data */
-	char	   *abbrev;			/* TZ abbreviation (downcased) */
-	char	   *zone;			/* zone name if dynamic abbrev, else NULL */
-	/* for a dynamic abbreviation, offset/is_dst are not used */
-	int			offset;			/* offset in seconds from UTC */
-	bool		is_dst;			/* true if a DST abbreviation */
-	/* source information (for error messages) */
-	int			lineno;
-	const char *filename;
-} tzEntry;
-
-
-extern TimeZoneAbbrevTable *load_tzoffsets(const char *filename);
-
-#endif							/* TZPARSER_H */

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

@@ -1,41 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * varlena.h
- *	  Functions for the variable-length 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/varlena.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef VARLENA_H
-#define VARLENA_H
-
-#include "nodes/pg_list.h"
-#include "utils/sortsupport.h"
-
-extern int	varstr_cmp(const char *arg1, int len1, const char *arg2, int len2, Oid collid);
-extern void varstr_sortsupport(SortSupport ssup, Oid typid, Oid collid);
-extern int	varstr_levenshtein(const char *source, int slen,
-							   const char *target, int tlen,
-							   int ins_c, int del_c, int sub_c,
-							   bool trusted);
-extern int	varstr_levenshtein_less_equal(const char *source, int slen,
-										  const char *target, int tlen,
-										  int ins_c, int del_c, int sub_c,
-										  int max_d, bool trusted);
-extern List *textToQualifiedNameList(text *textval);
-extern bool SplitIdentifierString(char *rawstring, char separator,
-								  List **namelist);
-extern bool SplitDirectoriesString(char *rawstring, char separator,
-								   List **namelist);
-extern bool SplitGUCList(char *rawstring, char separator,
-						 List **namelist);
-extern text *replace_text_regexp(text *src_text, text *pattern_text,
-								 text *replace_text,
-								 int cflags, Oid collation,
-								 int search_start, int n);
-
-#endif