pg_query 2.2.0 → 6.1.0

data/ext/pg_query/include/nodes/print.h

@@ -1,34 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * print.h
- *	  definitions for nodes/print.c
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/nodes/print.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef PRINT_H
-#define PRINT_H
-
-#include "executor/tuptable.h"
-
-
-#define nodeDisplay(x)		pprint(x)
-
-extern void print(const void *obj);
-extern void pprint(const void *obj);
-extern void elog_node_display(int lev, const char *title,
-							  const void *obj, bool pretty);
-extern char *format_node_dump(const char *dump);
-extern char *pretty_format_node_dump(const char *dump);
-extern void print_rt(const List *rtable);
-extern void print_expr(const Node *expr, const List *rtable);
-extern void print_pathkeys(const List *pathkeys, const List *rtable);
-extern void print_tl(const List *tlist, const List *rtable);
-extern void print_slot(TupleTableSlot *slot);
-
-#endif							/* PRINT_H */

data/ext/pg_query/include/nodes/tidbitmap.h

@@ -1,75 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * tidbitmap.h
- *	  PostgreSQL tuple-id (TID) bitmap package
- *
- * This module provides bitmap data structures that are spiritually
- * similar to Bitmapsets, but are specially adapted to store sets of
- * tuple identifiers (TIDs), or ItemPointers.  In particular, the division
- * of an ItemPointer into BlockNumber and OffsetNumber is catered for.
- * Also, since we wish to be able to store very large tuple sets in
- * memory with this data structure, we support "lossy" storage, in which
- * we no longer remember individual tuple offsets on a page but only the
- * fact that a particular page needs to be visited.
- *
- *
- * Copyright (c) 2003-2020, PostgreSQL Global Development Group
- *
- * src/include/nodes/tidbitmap.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef TIDBITMAP_H
-#define TIDBITMAP_H
-
-#include "storage/itemptr.h"
-#include "utils/dsa.h"
-
-
-/*
- * Actual bitmap representation is private to tidbitmap.c.  Callers can
- * do IsA(x, TIDBitmap) on it, but nothing else.
- */
-typedef struct TIDBitmap TIDBitmap;
-
-/* Likewise, TBMIterator is private */
-typedef struct TBMIterator TBMIterator;
-typedef struct TBMSharedIterator TBMSharedIterator;
-
-/* Result structure for tbm_iterate */
-typedef struct TBMIterateResult
-{
-	BlockNumber blockno;		/* page number containing tuples */
-	int			ntuples;		/* -1 indicates lossy result */
-	bool		recheck;		/* should the tuples be rechecked? */
-	/* Note: recheck is always true if ntuples < 0 */
-	OffsetNumber offsets[FLEXIBLE_ARRAY_MEMBER];
-} TBMIterateResult;
-
-/* function prototypes in nodes/tidbitmap.c */
-
-extern TIDBitmap *tbm_create(long maxbytes, dsa_area *dsa);
-extern void tbm_free(TIDBitmap *tbm);
-extern void tbm_free_shared_area(dsa_area *dsa, dsa_pointer dp);
-
-extern void tbm_add_tuples(TIDBitmap *tbm,
-						   const ItemPointer tids, int ntids,
-						   bool recheck);
-extern void tbm_add_page(TIDBitmap *tbm, BlockNumber pageno);
-
-extern void tbm_union(TIDBitmap *a, const TIDBitmap *b);
-extern void tbm_intersect(TIDBitmap *a, const TIDBitmap *b);
-
-extern bool tbm_is_empty(const TIDBitmap *tbm);
-
-extern TBMIterator *tbm_begin_iterate(TIDBitmap *tbm);
-extern dsa_pointer tbm_prepare_shared_iterate(TIDBitmap *tbm);
-extern TBMIterateResult *tbm_iterate(TBMIterator *iterator);
-extern TBMIterateResult *tbm_shared_iterate(TBMSharedIterator *iterator);
-extern void tbm_end_iterate(TBMIterator *iterator);
-extern void tbm_end_shared_iterate(TBMSharedIterator *iterator);
-extern TBMSharedIterator *tbm_attach_shared_iterate(dsa_area *dsa,
-													dsa_pointer dp);
-extern long tbm_calculate_entries(double maxbytes);
-
-#endif							/* TIDBITMAP_H */

data/ext/pg_query/include/nodes/value.h

@@ -1,61 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * value.h
- *	  interface for Value nodes
- *
- *
- * Copyright (c) 2003-2020, PostgreSQL Global Development Group
- *
- * src/include/nodes/value.h
- *
- *-------------------------------------------------------------------------
- */
-
-#ifndef VALUE_H
-#define VALUE_H
-
-#include "nodes/nodes.h"
-
-/*----------------------
- *		Value node
- *
- * The same Value struct is used for five node types: T_Integer,
- * T_Float, T_String, T_BitString, T_Null.
- *
- * Integral values are actually represented by a machine integer,
- * but both floats and strings are represented as strings.
- * Using T_Float as the node type simply indicates that
- * the contents of the string look like a valid numeric literal.
- *
- * (Before Postgres 7.0, we used a double to represent T_Float,
- * but that creates loss-of-precision problems when the value is
- * ultimately destined to be converted to NUMERIC.  Since Value nodes
- * are only used in the parsing process, not for runtime data, it's
- * better to use the more general representation.)
- *
- * Note that an integer-looking string will get lexed as T_Float if
- * the value is too large to fit in an 'int'.
- *
- * Nulls, of course, don't need the value part at all.
- *----------------------
- */
-typedef struct Value
-{
-	NodeTag		type;			/* tag appropriately (eg. T_String) */
-	union ValUnion
-	{
-		int			ival;		/* machine integer */
-		char	   *str;		/* string */
-	}			val;
-} Value;
-
-#define intVal(v)		(((Value *)(v))->val.ival)
-#define floatVal(v)		atof(((Value *)(v))->val.str)
-#define strVal(v)		(((Value *)(v))->val.str)
-
-extern Value *makeInteger(int i);
-extern Value *makeFloat(char *numericStr);
-extern Value *makeString(char *str);
-extern Value *makeBitString(char *str);
-
-#endif							/* VALUE_H */

data/ext/pg_query/include/optimizer/cost.h

@@ -1,206 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * cost.h
- *	  prototypes for costsize.c and clausesel.c.
- *
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/optimizer/cost.h
- *
- *-------------------------------------------------------------------------
- */
-#ifndef COST_H
-#define COST_H
-
-#include "nodes/pathnodes.h"
-#include "nodes/plannodes.h"
-
-
-/* defaults for costsize.c's Cost parameters */
-/* NB: cost-estimation code should use the variables, not these constants! */
-/* If you change these, update backend/utils/misc/postgresql.sample.conf */
-#define DEFAULT_SEQ_PAGE_COST  1.0
-#define DEFAULT_RANDOM_PAGE_COST  4.0
-#define DEFAULT_CPU_TUPLE_COST	0.01
-#define DEFAULT_CPU_INDEX_TUPLE_COST 0.005
-#define DEFAULT_CPU_OPERATOR_COST  0.0025
-#define DEFAULT_PARALLEL_TUPLE_COST 0.1
-#define DEFAULT_PARALLEL_SETUP_COST  1000.0
-
-#define DEFAULT_EFFECTIVE_CACHE_SIZE  524288	/* measured in pages */
-
-typedef enum
-{
-	CONSTRAINT_EXCLUSION_OFF,	/* do not use c_e */
-	CONSTRAINT_EXCLUSION_ON,	/* apply c_e to all rels */
-	CONSTRAINT_EXCLUSION_PARTITION	/* apply c_e to otherrels only */
-}			ConstraintExclusionType;
-
-
-/*
- * prototypes for costsize.c
- *	  routines to compute costs and sizes
- */
-
-/* parameter variables and flags (see also optimizer.h) */
-extern PGDLLIMPORT Cost disable_cost;
-extern PGDLLIMPORT int max_parallel_workers_per_gather;
-extern PGDLLIMPORT bool enable_seqscan;
-extern PGDLLIMPORT bool enable_indexscan;
-extern PGDLLIMPORT bool enable_indexonlyscan;
-extern PGDLLIMPORT bool enable_bitmapscan;
-extern PGDLLIMPORT bool enable_tidscan;
-extern PGDLLIMPORT bool enable_sort;
-extern PGDLLIMPORT bool enable_incremental_sort;
-extern PGDLLIMPORT bool enable_hashagg;
-extern PGDLLIMPORT bool enable_nestloop;
-extern PGDLLIMPORT bool enable_material;
-extern PGDLLIMPORT bool enable_mergejoin;
-extern PGDLLIMPORT bool enable_hashjoin;
-extern PGDLLIMPORT bool enable_gathermerge;
-extern PGDLLIMPORT bool enable_partitionwise_join;
-extern PGDLLIMPORT bool enable_partitionwise_aggregate;
-extern PGDLLIMPORT bool enable_parallel_append;
-extern PGDLLIMPORT bool enable_parallel_hash;
-extern PGDLLIMPORT bool enable_partition_pruning;
-extern PGDLLIMPORT int constraint_exclusion;
-
-extern double index_pages_fetched(double tuples_fetched, BlockNumber pages,
-								  double index_pages, PlannerInfo *root);
-extern void cost_seqscan(Path *path, PlannerInfo *root, RelOptInfo *baserel,
-						 ParamPathInfo *param_info);
-extern void cost_samplescan(Path *path, PlannerInfo *root, RelOptInfo *baserel,
-							ParamPathInfo *param_info);
-extern void cost_index(IndexPath *path, PlannerInfo *root,
-					   double loop_count, bool partial_path);
-extern void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel,
-								  ParamPathInfo *param_info,
-								  Path *bitmapqual, double loop_count);
-extern void cost_bitmap_and_node(BitmapAndPath *path, PlannerInfo *root);
-extern void cost_bitmap_or_node(BitmapOrPath *path, PlannerInfo *root);
-extern void cost_bitmap_tree_node(Path *path, Cost *cost, Selectivity *selec);
-extern void cost_tidscan(Path *path, PlannerInfo *root,
-						 RelOptInfo *baserel, List *tidquals, ParamPathInfo *param_info);
-extern void cost_subqueryscan(SubqueryScanPath *path, PlannerInfo *root,
-							  RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_functionscan(Path *path, PlannerInfo *root,
-							  RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_valuesscan(Path *path, PlannerInfo *root,
-							RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_tablefuncscan(Path *path, PlannerInfo *root,
-							   RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_ctescan(Path *path, PlannerInfo *root,
-						 RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_namedtuplestorescan(Path *path, PlannerInfo *root,
-									 RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_resultscan(Path *path, PlannerInfo *root,
-							RelOptInfo *baserel, ParamPathInfo *param_info);
-extern void cost_recursive_union(Path *runion, Path *nrterm, Path *rterm);
-extern void cost_sort(Path *path, PlannerInfo *root,
-					  List *pathkeys, Cost input_cost, double tuples, int width,
-					  Cost comparison_cost, int sort_mem,
-					  double limit_tuples);
-extern void cost_incremental_sort(Path *path,
-								  PlannerInfo *root, List *pathkeys, int presorted_keys,
-								  Cost input_startup_cost, Cost input_total_cost,
-								  double input_tuples, int width, Cost comparison_cost, int sort_mem,
-								  double limit_tuples);
-extern void cost_append(AppendPath *path);
-extern void cost_merge_append(Path *path, PlannerInfo *root,
-							  List *pathkeys, int n_streams,
-							  Cost input_startup_cost, Cost input_total_cost,
-							  double tuples);
-extern void cost_material(Path *path,
-						  Cost input_startup_cost, Cost input_total_cost,
-						  double tuples, int width);
-extern void cost_agg(Path *path, PlannerInfo *root,
-					 AggStrategy aggstrategy, const AggClauseCosts *aggcosts,
-					 int numGroupCols, double numGroups,
-					 List *quals,
-					 Cost input_startup_cost, Cost input_total_cost,
-					 double input_tuples, double input_width);
-extern void cost_windowagg(Path *path, PlannerInfo *root,
-						   List *windowFuncs, int numPartCols, int numOrderCols,
-						   Cost input_startup_cost, Cost input_total_cost,
-						   double input_tuples);
-extern void cost_group(Path *path, PlannerInfo *root,
-					   int numGroupCols, double numGroups,
-					   List *quals,
-					   Cost input_startup_cost, Cost input_total_cost,
-					   double input_tuples);
-extern void initial_cost_nestloop(PlannerInfo *root,
-								  JoinCostWorkspace *workspace,
-								  JoinType jointype,
-								  Path *outer_path, Path *inner_path,
-								  JoinPathExtraData *extra);
-extern void final_cost_nestloop(PlannerInfo *root, NestPath *path,
-								JoinCostWorkspace *workspace,
-								JoinPathExtraData *extra);
-extern void initial_cost_mergejoin(PlannerInfo *root,
-								   JoinCostWorkspace *workspace,
-								   JoinType jointype,
-								   List *mergeclauses,
-								   Path *outer_path, Path *inner_path,
-								   List *outersortkeys, List *innersortkeys,
-								   JoinPathExtraData *extra);
-extern void final_cost_mergejoin(PlannerInfo *root, MergePath *path,
-								 JoinCostWorkspace *workspace,
-								 JoinPathExtraData *extra);
-extern void initial_cost_hashjoin(PlannerInfo *root,
-								  JoinCostWorkspace *workspace,
-								  JoinType jointype,
-								  List *hashclauses,
-								  Path *outer_path, Path *inner_path,
-								  JoinPathExtraData *extra,
-								  bool parallel_hash);
-extern void final_cost_hashjoin(PlannerInfo *root, HashPath *path,
-								JoinCostWorkspace *workspace,
-								JoinPathExtraData *extra);
-extern void cost_gather(GatherPath *path, PlannerInfo *root,
-						RelOptInfo *baserel, ParamPathInfo *param_info, double *rows);
-extern void cost_gather_merge(GatherMergePath *path, PlannerInfo *root,
-							  RelOptInfo *rel, ParamPathInfo *param_info,
-							  Cost input_startup_cost, Cost input_total_cost,
-							  double *rows);
-extern void cost_subplan(PlannerInfo *root, SubPlan *subplan, Plan *plan);
-extern void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root);
-extern void cost_qual_eval_node(QualCost *cost, Node *qual, PlannerInfo *root);
-extern void compute_semi_anti_join_factors(PlannerInfo *root,
-										   RelOptInfo *joinrel,
-										   RelOptInfo *outerrel,
-										   RelOptInfo *innerrel,
-										   JoinType jointype,
-										   SpecialJoinInfo *sjinfo,
-										   List *restrictlist,
-										   SemiAntiJoinFactors *semifactors);
-extern void set_baserel_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern double get_parameterized_baserel_size(PlannerInfo *root,
-											 RelOptInfo *rel,
-											 List *param_clauses);
-extern double get_parameterized_joinrel_size(PlannerInfo *root,
-											 RelOptInfo *rel,
-											 Path *outer_path,
-											 Path *inner_path,
-											 SpecialJoinInfo *sjinfo,
-											 List *restrict_clauses);
-extern void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel,
-									   RelOptInfo *outer_rel,
-									   RelOptInfo *inner_rel,
-									   SpecialJoinInfo *sjinfo,
-									   List *restrictlist);
-extern void set_subquery_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern void set_function_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern void set_values_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern void set_cte_size_estimates(PlannerInfo *root, RelOptInfo *rel,
-								   double cte_rows);
-extern void set_tablefunc_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern void set_namedtuplestore_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern void set_result_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern void set_foreign_size_estimates(PlannerInfo *root, RelOptInfo *rel);
-extern PathTarget *set_pathtarget_cost_width(PlannerInfo *root, PathTarget *target);
-extern double compute_bitmap_pages(PlannerInfo *root, RelOptInfo *baserel,
-								   Path *bitmapqual, int loop_count, Cost *cost, double *tuple);
-
-#endif							/* COST_H */

data/ext/pg_query/include/optimizer/geqo.h

@@ -1,88 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * geqo.h
- *	  prototypes for various files in optimizer/geqo
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/optimizer/geqo.h
- *
- *-------------------------------------------------------------------------
- */
-
-/* contributed by:
-   =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
-   *  Martin Utesch				 * Institute of Automatic Control	   *
-   =							 = University of Mining and Technology =
-   *  utesch@aut.tu-freiberg.de  * Freiberg, Germany				   *
-   =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
- */
-
-#ifndef GEQO_H
-#define GEQO_H
-
-#include "nodes/pathnodes.h"
-#include "optimizer/geqo_gene.h"
-
-
-/* GEQO debug flag */
-/*
- #define GEQO_DEBUG
- */
-
-/* choose one recombination mechanism here */
-/*
- #define ERX
- #define PMX
- #define CX
- #define PX
- #define OX1
- #define OX2
- */
-#define ERX
-
-
-/*
- * Configuration options
- *
- * If you change these, update backend/utils/misc/postgresql.conf.sample
- */
-extern int	Geqo_effort;		/* 1 .. 10, knob for adjustment of defaults */
-
-#define DEFAULT_GEQO_EFFORT 5
-#define MIN_GEQO_EFFORT 1
-#define MAX_GEQO_EFFORT 10
-
-extern int	Geqo_pool_size;		/* 2 .. inf, or 0 to use default */
-
-extern int	Geqo_generations;	/* 1 .. inf, or 0 to use default */
-
-extern double Geqo_selection_bias;
-
-#define DEFAULT_GEQO_SELECTION_BIAS 2.0
-#define MIN_GEQO_SELECTION_BIAS 1.5
-#define MAX_GEQO_SELECTION_BIAS 2.0
-
-extern double Geqo_seed;		/* 0 .. 1 */
-
-
-/*
- * Private state for a GEQO run --- accessible via root->join_search_private
- */
-typedef struct
-{
-	List	   *initial_rels;	/* the base relations we are joining */
-	unsigned short random_state[3]; /* state for pg_erand48() */
-} GeqoPrivateData;
-
-
-/* routines in geqo_main.c */
-extern RelOptInfo *geqo(PlannerInfo *root,
-						int number_of_rels, List *initial_rels);
-
-/* routines in geqo_eval.c */
-extern Cost geqo_eval(PlannerInfo *root, Gene *tour, int num_gene);
-extern RelOptInfo *gimme_tree(PlannerInfo *root, Gene *tour, int num_gene);
-
-#endif							/* GEQO_H */

data/ext/pg_query/include/optimizer/geqo_gene.h

@@ -1,45 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * geqo_gene.h
- *	  genome representation in optimizer/geqo
- *
- * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- * src/include/optimizer/geqo_gene.h
- *
- *-------------------------------------------------------------------------
- */
-
-/* contributed by:
-   =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
-   *  Martin Utesch				 * Institute of Automatic Control	   *
-   =							 = University of Mining and Technology =
-   *  utesch@aut.tu-freiberg.de  * Freiberg, Germany				   *
-   =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
- */
-
-
-#ifndef GEQO_GENE_H
-#define GEQO_GENE_H
-
-#include "nodes/nodes.h"
-
-/* we presume that int instead of Relid
-   is o.k. for Gene; so don't change it! */
-typedef int Gene;
-
-typedef struct Chromosome
-{
-	Gene	   *string;
-	Cost		worth;
-} Chromosome;
-
-typedef struct Pool
-{
-	Chromosome *data;
-	int			size;
-	int			string_length;
-} Pool;
-
-#endif							/* GEQO_GENE_H */