pg_query 5.0.0 → 6.0.0

data/ext/pg_query/include/access/genam.h

@@ -1,233 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * genam.h
- *	  POSTGRES generalized index access method definitions.
- *
- *
- * Portions Copyright (c) 1996-2023, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/genam.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef GENAM_H
-#define GENAM_H
-
-#include "access/sdir.h"
-#include "access/skey.h"
-#include "nodes/tidbitmap.h"
-#include "storage/lockdefs.h"
-#include "utils/relcache.h"
-#include "utils/snapshot.h"
-
-/* We don't want this file to depend on execnodes.h. */
-struct IndexInfo;
-
-/*
- * Struct for statistics returned by ambuild
- */
-typedef struct IndexBuildResult
-{
-	double		heap_tuples;	/* # of tuples seen in parent table */
-	double		index_tuples;	/* # of tuples inserted into index */
-} IndexBuildResult;
-
-/*
- * Struct for input arguments passed to ambulkdelete and amvacuumcleanup
- *
- * num_heap_tuples is accurate only when estimated_count is false;
- * otherwise it's just an estimate (currently, the estimate is the
- * prior value of the relation's pg_class.reltuples field, so it could
- * even be -1).  It will always just be an estimate during ambulkdelete.
- */
-typedef struct IndexVacuumInfo
-{
-	Relation	index;			/* the index being vacuumed */
-	Relation	heaprel;		/* the heap relation the index belongs to */
-	bool		analyze_only;	/* ANALYZE (without any actual vacuum) */
-	bool		report_progress;	/* emit progress.h status reports */
-	bool		estimated_count;	/* num_heap_tuples is an estimate */
-	int			message_level;	/* ereport level for progress messages */
-	double		num_heap_tuples;	/* tuples remaining in heap */
-	BufferAccessStrategy strategy;	/* access strategy for reads */
-} IndexVacuumInfo;
-
-/*
- * Struct for statistics returned by ambulkdelete and amvacuumcleanup
- *
- * This struct is normally allocated by the first ambulkdelete call and then
- * passed along through subsequent ones until amvacuumcleanup; however,
- * amvacuumcleanup must be prepared to allocate it in the case where no
- * ambulkdelete calls were made (because no tuples needed deletion).
- * Note that an index AM could choose to return a larger struct
- * of which this is just the first field; this provides a way for ambulkdelete
- * to communicate additional private data to amvacuumcleanup.
- *
- * Note: pages_newly_deleted is the number of pages in the index that were
- * deleted by the current vacuum operation.  pages_deleted and pages_free
- * refer to free space within the index file.
- *
- * Note: Some index AMs may compute num_index_tuples by reference to
- * num_heap_tuples, in which case they should copy the estimated_count field
- * from IndexVacuumInfo.
- */
-typedef struct IndexBulkDeleteResult
-{
-	BlockNumber num_pages;		/* pages remaining in index */
-	bool		estimated_count;	/* num_index_tuples is an estimate */
-	double		num_index_tuples;	/* tuples remaining */
-	double		tuples_removed; /* # removed during vacuum operation */
-	BlockNumber pages_newly_deleted;	/* # pages marked deleted by us  */
-	BlockNumber pages_deleted;	/* # pages marked deleted (could be by us) */
-	BlockNumber pages_free;		/* # pages available for reuse */
-} IndexBulkDeleteResult;
-
-/* Typedef for callback function to determine if a tuple is bulk-deletable */
-typedef bool (*IndexBulkDeleteCallback) (ItemPointer itemptr, void *state);
-
-/* struct definitions appear in relscan.h */
-typedef struct IndexScanDescData *IndexScanDesc;
-typedef struct SysScanDescData *SysScanDesc;
-
-typedef struct ParallelIndexScanDescData *ParallelIndexScanDesc;
-
-/*
- * Enumeration specifying the type of uniqueness check to perform in
- * index_insert().
- *
- * UNIQUE_CHECK_YES is the traditional Postgres immediate check, possibly
- * blocking to see if a conflicting transaction commits.
- *
- * For deferrable unique constraints, UNIQUE_CHECK_PARTIAL is specified at
- * insertion time.  The index AM should test if the tuple is unique, but
- * should not throw error, block, or prevent the insertion if the tuple
- * appears not to be unique.  We'll recheck later when it is time for the
- * constraint to be enforced.  The AM must return true if the tuple is
- * known unique, false if it is possibly non-unique.  In the "true" case
- * it is safe to omit the later recheck.
- *
- * When it is time to recheck the deferred constraint, a pseudo-insertion
- * call is made with UNIQUE_CHECK_EXISTING.  The tuple is already in the
- * index in this case, so it should not be inserted again.  Rather, just
- * check for conflicting live tuples (possibly blocking).
- */
-typedef enum IndexUniqueCheck
-{
-	UNIQUE_CHECK_NO,			/* Don't do any uniqueness checking */
-	UNIQUE_CHECK_YES,			/* Enforce uniqueness at insertion time */
-	UNIQUE_CHECK_PARTIAL,		/* Test uniqueness, but no error */
-	UNIQUE_CHECK_EXISTING		/* Check if existing tuple is unique */
-} IndexUniqueCheck;
-
-
-/* Nullable "ORDER BY col op const" distance */
-typedef struct IndexOrderByDistance
-{
-	double		value;
-	bool		isnull;
-} IndexOrderByDistance;
-
-/*
- * generalized index_ interface routines (in indexam.c)
- */
-
-/*
- * IndexScanIsValid
- *		True iff the index scan is valid.
- */
-#define IndexScanIsValid(scan) PointerIsValid(scan)
-
-extern Relation index_open(Oid relationId, LOCKMODE lockmode);
-extern void index_close(Relation relation, LOCKMODE lockmode);
-
-extern bool index_insert(Relation indexRelation,
-						 Datum *values, bool *isnull,
-						 ItemPointer heap_t_ctid,
-						 Relation heapRelation,
-						 IndexUniqueCheck checkUnique,
-						 bool indexUnchanged,
-						 struct IndexInfo *indexInfo);
-
-extern IndexScanDesc index_beginscan(Relation heapRelation,
-									 Relation indexRelation,
-									 Snapshot snapshot,
-									 int nkeys, int norderbys);
-extern IndexScanDesc index_beginscan_bitmap(Relation indexRelation,
-											Snapshot snapshot,
-											int nkeys);
-extern void index_rescan(IndexScanDesc scan,
-						 ScanKey keys, int nkeys,
-						 ScanKey orderbys, int norderbys);
-extern void index_endscan(IndexScanDesc scan);
-extern void index_markpos(IndexScanDesc scan);
-extern void index_restrpos(IndexScanDesc scan);
-extern Size index_parallelscan_estimate(Relation indexRelation, Snapshot snapshot);
-extern void index_parallelscan_initialize(Relation heapRelation,
-										  Relation indexRelation, Snapshot snapshot,
-										  ParallelIndexScanDesc target);
-extern void index_parallelrescan(IndexScanDesc scan);
-extern IndexScanDesc index_beginscan_parallel(Relation heaprel,
-											  Relation indexrel, int nkeys, int norderbys,
-											  ParallelIndexScanDesc pscan);
-extern ItemPointer index_getnext_tid(IndexScanDesc scan,
-									 ScanDirection direction);
-struct TupleTableSlot;
-extern bool index_fetch_heap(IndexScanDesc scan, struct TupleTableSlot *slot);
-extern bool index_getnext_slot(IndexScanDesc scan, ScanDirection direction,
-							   struct TupleTableSlot *slot);
-extern int64 index_getbitmap(IndexScanDesc scan, TIDBitmap *bitmap);
-
-extern IndexBulkDeleteResult *index_bulk_delete(IndexVacuumInfo *info,
-												IndexBulkDeleteResult *istat,
-												IndexBulkDeleteCallback callback,
-												void *callback_state);
-extern IndexBulkDeleteResult *index_vacuum_cleanup(IndexVacuumInfo *info,
-												   IndexBulkDeleteResult *istat);
-extern bool index_can_return(Relation indexRelation, int attno);
-extern RegProcedure index_getprocid(Relation irel, AttrNumber attnum,
-									uint16 procnum);
-extern FmgrInfo *index_getprocinfo(Relation irel, AttrNumber attnum,
-								   uint16 procnum);
-extern void index_store_float8_orderby_distances(IndexScanDesc scan,
-												 Oid *orderByTypes,
-												 IndexOrderByDistance *distances,
-												 bool recheckOrderBy);
-extern bytea *index_opclass_options(Relation indrel, AttrNumber attnum,
-									Datum attoptions, bool validate);
-
-
-/*
- * index access method support routines (in genam.c)
- */
-extern IndexScanDesc RelationGetIndexScan(Relation indexRelation,
-										  int nkeys, int norderbys);
-extern void IndexScanEnd(IndexScanDesc scan);
-extern char *BuildIndexValueDescription(Relation indexRelation,
-										Datum *values, bool *isnull);
-extern TransactionId index_compute_xid_horizon_for_tuples(Relation irel,
-														  Relation hrel,
-														  Buffer ibuf,
-														  OffsetNumber *itemnos,
-														  int nitems);
-
-/*
- * heap-or-index access to system catalogs (in genam.c)
- */
-extern SysScanDesc systable_beginscan(Relation heapRelation,
-									  Oid indexId,
-									  bool indexOK,
-									  Snapshot snapshot,
-									  int nkeys, ScanKey key);
-extern HeapTuple systable_getnext(SysScanDesc sysscan);
-extern bool systable_recheck_tuple(SysScanDesc sysscan, HeapTuple tup);
-extern void systable_endscan(SysScanDesc sysscan);
-extern SysScanDesc systable_beginscan_ordered(Relation heapRelation,
-											  Relation indexRelation,
-											  Snapshot snapshot,
-											  int nkeys, ScanKey key);
-extern HeapTuple systable_getnext_ordered(SysScanDesc sysscan,
-										  ScanDirection direction);
-extern void systable_endscan_ordered(SysScanDesc sysscan);
-
-#endif							/* GENAM_H */

data/ext/pg_query/include/access/gin.h

@@ -1,91 +0,0 @@
-/*--------------------------------------------------------------------------
- * gin.h
- *	  Public header file for Generalized Inverted Index access method.
- *
- *	Copyright (c) 2006-2023, PostgreSQL Global Development Group
- *
- *	src/include/access/gin.h
- *--------------------------------------------------------------------------
- */
-#ifndef GIN_H
-#define GIN_H
-
-#include "access/xlogreader.h"
-#include "lib/stringinfo.h"
-#include "storage/block.h"
-#include "utils/relcache.h"
-
-
-/*
- * amproc indexes for inverted indexes.
- */
-#define GIN_COMPARE_PROC			   1
-#define GIN_EXTRACTVALUE_PROC		   2
-#define GIN_EXTRACTQUERY_PROC		   3
-#define GIN_CONSISTENT_PROC			   4
-#define GIN_COMPARE_PARTIAL_PROC	   5
-#define GIN_TRICONSISTENT_PROC		   6
-#define GIN_OPTIONS_PROC	   7
-#define GINNProcs					   7
-
-/*
- * searchMode settings for extractQueryFn.
- */
-#define GIN_SEARCH_MODE_DEFAULT			0
-#define GIN_SEARCH_MODE_INCLUDE_EMPTY	1
-#define GIN_SEARCH_MODE_ALL				2
-#define GIN_SEARCH_MODE_EVERYTHING		3	/* for internal use only */
-
-/*
- * GinStatsData represents stats data for planner use
- */
-typedef struct GinStatsData
-{
-	BlockNumber nPendingPages;
-	BlockNumber nTotalPages;
-	BlockNumber nEntryPages;
-	BlockNumber nDataPages;
-	int64		nEntries;
-	int32		ginVersion;
-} GinStatsData;
-
-/*
- * A ternary value used by tri-consistent functions.
- *
- * This must be of the same size as a bool because some code will cast a
- * pointer to a bool to a pointer to a GinTernaryValue.
- */
-typedef char GinTernaryValue;
-
-StaticAssertDecl(sizeof(GinTernaryValue) == sizeof(bool),
-				 "sizes of GinTernaryValue and bool are not equal");
-
-#define GIN_FALSE		0		/* item is not present / does not match */
-#define GIN_TRUE		1		/* item is present / matches */
-#define GIN_MAYBE		2		/* don't know if item is present / don't know
-								 * if matches */
-
-static inline GinTernaryValue
-DatumGetGinTernaryValue(Datum X)
-{
-	return (GinTernaryValue) X;
-}
-
-static inline Datum
-GinTernaryValueGetDatum(GinTernaryValue X)
-{
-	return (Datum) X;
-}
-
-#define PG_RETURN_GIN_TERNARY_VALUE(x) return GinTernaryValueGetDatum(x)
-
-/* GUC parameters */
-extern PGDLLIMPORT int GinFuzzySearchLimit;
-extern PGDLLIMPORT int gin_pending_list_limit;
-
-/* ginutil.c */
-extern void ginGetStats(Relation index, GinStatsData *stats);
-extern void ginUpdateStats(Relation index, const GinStatsData *stats,
-						   bool is_build);
-
-#endif							/* GIN_H */

data/ext/pg_query/include/access/htup.h

@@ -1,89 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * htup.h
- *	  POSTGRES heap tuple definitions.
- *
- *
- * Portions Copyright (c) 1996-2023, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/access/htup.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef HTUP_H
-#define HTUP_H
-
-#include "storage/itemptr.h"
-
-/* typedefs and forward declarations for structs defined in htup_details.h */
-
-typedef struct HeapTupleHeaderData HeapTupleHeaderData;
-
-typedef HeapTupleHeaderData *HeapTupleHeader;
-
-typedef struct MinimalTupleData MinimalTupleData;
-
-typedef MinimalTupleData *MinimalTuple;
-
-
-/*
- * HeapTupleData is an in-memory data structure that points to a tuple.
- *
- * There are several ways in which this data structure is used:
- *
- * * Pointer to a tuple in a disk buffer: t_data points directly into the
- *	 buffer (which the code had better be holding a pin on, but this is not
- *	 reflected in HeapTupleData itself).
- *
- * * Pointer to nothing: t_data is NULL.  This is used as a failure indication
- *	 in some functions.
- *
- * * Part of a palloc'd tuple: the HeapTupleData itself and the tuple
- *	 form a single palloc'd chunk.  t_data points to the memory location
- *	 immediately following the HeapTupleData struct (at offset HEAPTUPLESIZE).
- *	 This is the output format of heap_form_tuple and related routines.
- *
- * * Separately allocated tuple: t_data points to a palloc'd chunk that
- *	 is not adjacent to the HeapTupleData.  (This case is deprecated since
- *	 it's difficult to tell apart from case #1.  It should be used only in
- *	 limited contexts where the code knows that case #1 will never apply.)
- *
- * * Separately allocated minimal tuple: t_data points MINIMAL_TUPLE_OFFSET
- *	 bytes before the start of a MinimalTuple.  As with the previous case,
- *	 this can't be told apart from case #1 by inspection; code setting up
- *	 or destroying this representation has to know what it's doing.
- *
- * t_len should always be valid, except in the pointer-to-nothing case.
- * t_self and t_tableOid should be valid if the HeapTupleData points to
- * a disk buffer, or if it represents a copy of a tuple on disk.  They
- * should be explicitly set invalid in manufactured tuples.
- */
-typedef struct HeapTupleData
-{
-	uint32		t_len;			/* length of *t_data */
-	ItemPointerData t_self;		/* SelfItemPointer */
-	Oid			t_tableOid;		/* table the tuple came from */
-#define FIELDNO_HEAPTUPLEDATA_DATA 3
-	HeapTupleHeader t_data;		/* -> tuple header and data */
-} HeapTupleData;
-
-typedef HeapTupleData *HeapTuple;
-
-#define HEAPTUPLESIZE	MAXALIGN(sizeof(HeapTupleData))
-
-/*
- * Accessor macros to be used with HeapTuple pointers.
- */
-#define HeapTupleIsValid(tuple) PointerIsValid(tuple)
-
-/* HeapTupleHeader functions implemented in utils/time/combocid.c */
-extern CommandId HeapTupleHeaderGetCmin(HeapTupleHeader tup);
-extern CommandId HeapTupleHeaderGetCmax(HeapTupleHeader tup);
-extern void HeapTupleHeaderAdjustCmax(HeapTupleHeader tup,
-									  CommandId *cmax, bool *iscombo);
-
-/* Prototype for HeapTupleHeader accessors in heapam.c */
-extern TransactionId HeapTupleGetUpdateXid(HeapTupleHeader tuple);
-
-#endif							/* HTUP_H */