#include "access/generic_xlog.h"
#include "access/itup.h"
#include "access/xlog.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "fmgr.h"
/* Support procedures numbers */
#include "foreign/foreign.h"
#include "lib/stringinfo.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "utils/relcache.h"
#include "libpq-fe.h"
#include "executor/nodeValuesscan.h"
#include "executor/nodeWindowAgg.h"
#include "executor/nodeWorktablescan.h"
+#include "nodes/extensible.h"
#include "nodes/nodeFuncs.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "utils/rel.h"
#include "utils/syscache.h"
#include "executor/executor.h"
#include "executor/nodeCustom.h"
#include "nodes/execnodes.h"
+#include "nodes/extensible.h"
#include "nodes/plannodes.h"
#include "miscadmin.h"
#include "parser/parsetree.h"
nodes.h - define node tags (NodeTag)
primnodes.h - primitive nodes
parsenodes.h - parse tree nodes
+ pathnodes.h - path tree nodes and planner internal structures
plannodes.h - plan tree nodes
- relation.h - planner internal nodes
execnodes.h - executor nodes
memnodes.h - memory nodes
pg_list.h - generic list
#include "miscadmin.h"
#include "nodes/extensible.h"
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
#include "utils/datum.h"
#include "utils/rel.h"
}
/* ****************************************************************
- * relation.h copy functions
+ * pathnodes.h copy functions
*
* We don't support copying RelOptInfo, IndexOptInfo, or Path nodes.
* There are some subsidiary structs that are useful to copy, though.
#include "miscadmin.h"
#include "nodes/extensible.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "utils/datum.h"
}
/*
- * Stuff from relation.h
+ * Stuff from pathnodes.h
*/
static bool
#include "nodes/makefuncs.h"
#include "nodes/execnodes.h"
#include "nodes/nodeFuncs.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "lib/stringinfo.h"
#include "miscadmin.h"
#include "nodes/extensible.h"
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
#include "utils/datum.h"
#include "utils/rel.h"
/*****************************************************************************
*
- * Stuff from relation.h.
+ * Stuff from pathnodes.h.
*
*****************************************************************************/
#include "access/printtup.h"
#include "lib/stringinfo.h"
#include "nodes/nodeFuncs.h"
+#include "nodes/pathnodes.h"
#include "nodes/print.h"
-#include "nodes/relation.h"
#include "parser/parsetree.h"
#include "utils/lsyscache.h"
* for scanning the index, as well as the selectivity of the index (ie,
* the fraction of main-table tuples we will have to retrieve) and its
* correlation to the main-table tuple order. We need a cast here because
- * relation.h uses a weak function type to avoid including amapi.h.
+ * pathnodes.h uses a weak function type to avoid including amapi.h.
*/
amcostestimate = (amcostestimate_function) index->amcostestimate;
amcostestimate(root, path, loop_count,
* sjinfo: SpecialJoinInfo relevant to this join
* restrictlist: join quals
* Output parameters:
- * *semifactors is filled in (see relation.h for field definitions)
+ * *semifactors is filled in (see pathnodes.h for field definitions)
*/
void
compute_semi_anti_join_factors(PlannerInfo *root,
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "optimizer/optimizer.h"
#include "utils/array.h"
#include "utils/inval.h"
#include "catalog/pg_type.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
#include "parser/parse_coerce.h"
#include "parser/parse_relation.h"
#include "parser/parsetree.h"
#include "optimizer/clauses.h"
#include "optimizer/optimizer.h"
#include "nodes/nodes.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "statistics/extended_stats_internal.h"
#include "statistics/statistics.h"
#include "utils/bytea.h"
#include "catalog/indexing.h"
#include "catalog/pg_collation.h"
#include "catalog/pg_statistic_ext.h"
-#include "nodes/relation.h"
#include "postmaster/autovacuum.h"
#include "statistics/extended_stats_internal.h"
#include "statistics/statistics.h"
#define TSMAPI_H
#include "nodes/execnodes.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
/*
/*
* prototypes from functions in execAmi.c
*/
-struct Path; /* avoid including relation.h here */
+struct Path; /* avoid including pathnodes.h here */
extern void ExecReScan(PlanState *node);
extern void ExecMarkPos(PlanState *node);
#include "access/parallel.h"
#include "nodes/execnodes.h"
-#include "nodes/extensible.h"
/*
* General executor code
#include "access/parallel.h"
#include "nodes/execnodes.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
/* To avoid including explain.h here, reference ExplainState thus: */
struct ExplainState;
#include "access/parallel.h"
#include "commands/explain.h"
#include "nodes/execnodes.h"
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
/* maximum length of an extensible node identifier */
#define EXTNODENAME_MAX_LEN 64
T_DomainConstraintState,
/*
- * TAGS FOR PLANNER NODES (relation.h)
+ * TAGS FOR PLANNER NODES (pathnodes.h)
*/
T_PlannerInfo,
T_PlannerGlobal,
* AggStrategy -
* overall execution strategies for Agg plan nodes
*
- * This is needed in both plannodes.h and relation.h, so put it here...
+ * This is needed in both pathnodes.h and plannodes.h, so put it here...
*/
typedef enum AggStrategy
{
* AggSplit -
* splitting (partial aggregation) modes for Agg plan nodes
*
- * This is needed in both plannodes.h and relation.h, so put it here...
+ * This is needed in both pathnodes.h and plannodes.h, so put it here...
*/
/* Primitive options supported by nodeAgg.c: */
* SetOpCmd and SetOpStrategy -
* overall semantics and execution strategies for SetOp plan nodes
*
- * This is needed in both plannodes.h and relation.h, so put it here...
+ * This is needed in both pathnodes.h and plannodes.h, so put it here...
*/
typedef enum SetOpCmd
{
/*-------------------------------------------------------------------------
*
- * relation.h
- * Definitions for planner's internal data structures.
+ * pathnodes.h
+ * Definitions for planner's internal data structures, especially Paths.
*
*
* Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
- * src/include/nodes/relation.h
+ * src/include/nodes/pathnodes.h
*
*-------------------------------------------------------------------------
*/
-#ifndef RELATION_H
-#define RELATION_H
+#ifndef PATHNODES_H
+#define PATHNODES_H
#include "access/sdir.h"
#include "fmgr.h"
double inner_rows_total;
} JoinCostWorkspace;
-#endif /* RELATION_H */
+#endif /* PATHNODES_H */
#ifndef APPENDINFO_H
#define APPENDINFO_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "utils/relcache.h"
extern AppendRelInfo *make_append_rel_info(Relation parentrel,
#define CLAUSES_H
#include "access/htup.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
typedef struct
{
#ifndef COST_H
#define COST_H
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
/* defaults for costsize.c's Cost parameters */
#ifndef GEQO_H
#define GEQO_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "optimizer/geqo_gene.h"
#ifndef INHERIT_H
#define INHERIT_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
extern void expand_inherited_tables(PlannerInfo *root);
#ifndef JOININFO_H
#define JOININFO_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
extern bool have_relevant_joinclause(PlannerInfo *root,
#include "nodes/parsenodes.h"
/*
- * We don't want to include nodes/relation.h here, because non-planner
+ * We don't want to include nodes/pathnodes.h here, because non-planner
* code should generally treat PlannerInfo as an opaque typedef.
* But we'd like such code to use that typedef name, so define the
- * typedef either here or in relation.h, whichever is read first.
+ * typedef either here or in pathnodes.h, whichever is read first.
*/
#ifndef HAVE_PLANNERINFO_TYPEDEF
typedef struct PlannerInfo PlannerInfo;
#ifndef ORCLAUSES_H
#define ORCLAUSES_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
extern void extract_restriction_or_clauses(PlannerInfo *root);
#ifndef PARAMASSIGN_H
#define PARAMASSIGN_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
extern Param *replace_outer_var(PlannerInfo *root, Var *var);
extern Param *replace_outer_placeholdervar(PlannerInfo *root,
#define PATHNODE_H
#include "nodes/bitmapset.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
/*
#ifndef PATHS_H
#define PATHS_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
/*
#ifndef PLACEHOLDER_H
#define PLACEHOLDER_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
extern PlaceHolderVar *make_placeholder_expr(PlannerInfo *root, Expr *expr,
#ifndef PLANCAT_H
#define PLANCAT_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#include "utils/relcache.h"
/* Hook for plugins to get control in get_relation_info() */
#ifndef PLANMAIN_H
#define PLANMAIN_H
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
/* GUC parameters */
#define DEFAULT_CURSOR_TUPLE_FRACTION 0.1
#ifndef PLANNER_H
#define PLANNER_H
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
/* Hook for plugins to get control in planner() */
#ifndef PREP_H
#define PREP_H
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
/*
#ifndef RESTRICTINFO_H
#define RESTRICTINFO_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
/* Convenience macro for the common case of a valid-everywhere qual */
#ifndef SUBSELECT_H
#define SUBSELECT_H
+#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
-#include "nodes/relation.h"
extern void SS_process_ctes(PlannerInfo *root);
extern JoinExpr *convert_ANY_sublink_to_join(PlannerInfo *root,
#ifndef TLIST_H
#define TLIST_H
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
extern TargetEntry *tlist_member(Expr *node, List *targetlist);
#define PARTPRUNE_H
#include "nodes/execnodes.h"
-#include "nodes/relation.h"
+struct PlannerInfo; /* avoid including pathnodes.h here */
+struct RelOptInfo;
/*
#define PruneCxtStateIdx(partnatts, step_id, keyno) \
((partnatts) * (step_id) + (keyno))
-extern PartitionPruneInfo *make_partition_pruneinfo(PlannerInfo *root,
- RelOptInfo *parentrel,
+extern PartitionPruneInfo *make_partition_pruneinfo(struct PlannerInfo *root,
+ struct RelOptInfo *parentrel,
List *subpaths,
List *partitioned_rels,
List *prunequal);
-extern Relids prune_append_rel_partitions(RelOptInfo *rel);
+extern Bitmapset *prune_append_rel_partitions(struct RelOptInfo *rel);
extern Bitmapset *get_matching_partitions(PartitionPruneContext *context,
List *pruning_steps);
#define STATISTICS_H
#include "commands/vacuum.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
#define STATS_MAX_DIMENSIONS 8 /* max number of attributes */
#include "fmgr.h"
#include "access/htup.h"
-#include "nodes/relation.h"
+#include "nodes/pathnodes.h"
/*