pathnodes.h File Reference

#include "access/sdir.h"
#include "lib/stringinfo.h"
#include "nodes/params.h"
#include "nodes/parsenodes.h"
#include "storage/block.h"

Include dependency graph for pathnodes.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	QualCost
struct	AggClauseCosts
struct	PlannerGlobal
struct	PlannerInfo
struct	PartitionSchemeData
struct	RelOptInfo
struct	IndexOptInfo
struct	ForeignKeyOptInfo
struct	StatisticExtInfo
struct	EquivalenceClass
struct	EquivalenceMember
struct	PathKey
struct	PathTarget
struct	ParamPathInfo
struct	Path
struct	IndexPath
struct	IndexClause
struct	BitmapHeapPath
struct	BitmapAndPath
struct	BitmapOrPath
struct	TidPath
struct	SubqueryScanPath
struct	ForeignPath
struct	CustomPath
struct	AppendPath
struct	MergeAppendPath
struct	GroupResultPath
struct	MaterialPath
struct	UniquePath
struct	GatherPath
struct	GatherMergePath
struct	JoinPath
struct	MergePath
struct	HashPath
struct	ProjectionPath
struct	ProjectSetPath
struct	SortPath
struct	IncrementalSortPath
struct	GroupPath
struct	UpperUniquePath
struct	AggPath
struct	GroupingSetData
struct	RollupData
struct	GroupingSetsPath
struct	MinMaxAggPath
struct	WindowAggPath
struct	SetOpPath
struct	RecursiveUnionPath
struct	LockRowsPath
struct	ModifyTablePath
struct	LimitPath
struct	RestrictInfo
struct	MergeScanSelCache
struct	PlaceHolderVar
struct	SpecialJoinInfo
struct	AppendRelInfo
struct	PlaceHolderInfo
struct	MinMaxAggInfo
struct	PlannerParamItem
struct	SemiAntiJoinFactors
struct	JoinPathExtraData
struct	GroupPathExtraData
struct	FinalPathExtraData
struct	JoinCostWorkspace
struct	AggInfo
struct	AggTransInfo

Macros
#define	planner_subplan_get_plan(root, subplan)   ((Plan *) list_nth((root)->glob->subplans, (subplan)->plan_id - 1))
#define	HAVE_PLANNERINFO_TYPEDEF   1
#define	planner_rt_fetch(rti, root)
#define	IS_SIMPLE_REL(rel)
#define	IS_JOIN_REL(rel)
#define	IS_UPPER_REL(rel)
#define	IS_OTHER_REL(rel)
#define	IS_PARTITIONED_REL(rel)
#define	REL_HAS_ALL_PART_PROPS(rel)
#define	HAVE_INDEXOPTINFO_TYPEDEF   1
#define	EC_MUST_BE_REDUNDANT(eclass)   ((eclass)->ec_has_const && !(eclass)->ec_below_outer_join)
#define	get_pathtarget_sortgroupref(target, colno)   ((target)->sortgrouprefs ? (target)->sortgrouprefs[colno] : (Index) 0)
#define	PATH_REQ_OUTER(path)   ((path)->param_info ? (path)->param_info->ppi_req_outer : (Relids) NULL)
#define	IS_DUMMY_APPEND(p)   (IsA((p), AppendPath) && ((AppendPath *) (p))->subpaths == NIL)
#define	IS_DUMMY_REL(r)   is_dummy_rel(r)
#define	RINFO_IS_PUSHED_DOWN(rinfo, joinrelids)
#define	HAVE_SPECIALJOININFO_TYPEDEF   1
#define	GROUPING_CAN_USE_SORT   0x0001
#define	GROUPING_CAN_USE_HASH   0x0002
#define	GROUPING_CAN_PARTIAL_AGG   0x0004

Typedefs
typedef Bitmapset *	Relids
typedef enum CostSelector	CostSelector
typedef struct QualCost	QualCost
typedef struct AggClauseCosts	AggClauseCosts
typedef enum UpperRelationKind	UpperRelationKind
typedef enum InheritanceKind	InheritanceKind
typedef struct PlannerGlobal	PlannerGlobal
typedef struct PlannerInfo	PlannerInfo
typedef struct PartitionSchemeData	PartitionSchemeData
typedef struct PartitionSchemeData *	PartitionScheme
typedef enum RelOptKind	RelOptKind
typedef struct RelOptInfo	RelOptInfo
typedef struct IndexOptInfo	IndexOptInfo
typedef struct ForeignKeyOptInfo	ForeignKeyOptInfo
typedef struct StatisticExtInfo	StatisticExtInfo
typedef struct EquivalenceClass	EquivalenceClass
typedef struct EquivalenceMember	EquivalenceMember
typedef struct PathKey	PathKey
typedef struct PathTarget	PathTarget
typedef struct ParamPathInfo	ParamPathInfo
typedef struct Path	Path
typedef struct IndexPath	IndexPath
typedef struct IndexClause	IndexClause
typedef struct BitmapHeapPath	BitmapHeapPath
typedef struct BitmapAndPath	BitmapAndPath
typedef struct BitmapOrPath	BitmapOrPath
typedef struct TidPath	TidPath
typedef struct SubqueryScanPath	SubqueryScanPath
typedef struct ForeignPath	ForeignPath
typedef struct CustomPath	CustomPath
typedef struct AppendPath	AppendPath
typedef struct MergeAppendPath	MergeAppendPath
typedef struct GroupResultPath	GroupResultPath
typedef struct MaterialPath	MaterialPath
typedef struct UniquePath	UniquePath
typedef struct GatherPath	GatherPath
typedef struct GatherMergePath	GatherMergePath
typedef struct JoinPath	JoinPath
typedef JoinPath	NestPath
typedef struct MergePath	MergePath
typedef struct HashPath	HashPath
typedef struct ProjectionPath	ProjectionPath
typedef struct ProjectSetPath	ProjectSetPath
typedef struct SortPath	SortPath
typedef struct IncrementalSortPath	IncrementalSortPath
typedef struct GroupPath	GroupPath
typedef struct UpperUniquePath	UpperUniquePath
typedef struct AggPath	AggPath
typedef struct GroupingSetData	GroupingSetData
typedef struct RollupData	RollupData
typedef struct GroupingSetsPath	GroupingSetsPath
typedef struct MinMaxAggPath	MinMaxAggPath
typedef struct WindowAggPath	WindowAggPath
typedef struct SetOpPath	SetOpPath
typedef struct RecursiveUnionPath	RecursiveUnionPath
typedef struct LockRowsPath	LockRowsPath
typedef struct ModifyTablePath	ModifyTablePath
typedef struct LimitPath	LimitPath
typedef struct RestrictInfo	RestrictInfo
typedef struct MergeScanSelCache	MergeScanSelCache
typedef struct PlaceHolderVar	PlaceHolderVar
typedef struct SpecialJoinInfo	SpecialJoinInfo
typedef struct AppendRelInfo	AppendRelInfo
typedef struct PlaceHolderInfo	PlaceHolderInfo
typedef struct MinMaxAggInfo	MinMaxAggInfo
typedef struct PlannerParamItem	PlannerParamItem
typedef struct SemiAntiJoinFactors	SemiAntiJoinFactors
typedef struct JoinPathExtraData	JoinPathExtraData
typedef struct JoinCostWorkspace	JoinCostWorkspace
typedef struct AggInfo	AggInfo
typedef struct AggTransInfo	AggTransInfo

Enumerations
enum	CostSelector { STARTUP_COST, TOTAL_COST }
enum	UpperRelationKind {   UPPERREL_SETOP, UPPERREL_PARTIAL_GROUP_AGG, UPPERREL_GROUP_AGG, UPPERREL_WINDOW,   UPPERREL_DISTINCT, UPPERREL_ORDERED, UPPERREL_FINAL }
enum	InheritanceKind { INHKIND_NONE, INHKIND_INHERITED, INHKIND_PARTITIONED }
enum	RelOptKind {   RELOPT_BASEREL, RELOPT_JOINREL, RELOPT_OTHER_MEMBER_REL, RELOPT_OTHER_JOINREL,   RELOPT_UPPER_REL, RELOPT_OTHER_UPPER_REL, RELOPT_DEADREL }
enum	UniquePathMethod { UNIQUE_PATH_NOOP, UNIQUE_PATH_HASH, UNIQUE_PATH_SORT }
enum	PartitionwiseAggregateType { PARTITIONWISE_AGGREGATE_NONE, PARTITIONWISE_AGGREGATE_FULL, PARTITIONWISE_AGGREGATE_PARTIAL }

Functions
bool	is_dummy_rel (RelOptInfo *rel)

Macro Definition Documentation

EC_MUST_BE_REDUNDANT

#define EC_MUST_BE_REDUNDANT

(

eclass

)

((eclass)->ec_has_const && !(eclass)->ec_below_outer_join)

Definition at line 987 of file pathnodes.h.

Referenced by pathkey_is_redundant(), and select_mergejoin_clauses().

get_pathtarget_sortgroupref

#define get_pathtarget_sortgroupref	(		target,
			colno
	)		((target)->sortgrouprefs ? (target)->sortgrouprefs[colno] : (Index) 0)

Definition at line 1085 of file pathnodes.h.

Referenced by add_sp_item_to_pathtarget(), find_em_expr_for_input_target(), foreign_grouping_ok(), make_group_input_target(), make_partial_grouping_target(), make_sort_input_target(), make_window_input_target(), and split_pathtarget_at_srfs().

GROUPING_CAN_PARTIAL_AGG

#define GROUPING_CAN_PARTIAL_AGG   0x0004

Definition at line 2458 of file pathnodes.h.

Referenced by create_grouping_paths(), and create_ordinary_grouping_paths().

GROUPING_CAN_USE_HASH

#define GROUPING_CAN_USE_HASH   0x0002

Definition at line 2457 of file pathnodes.h.

Referenced by add_paths_to_grouping_rel(), create_grouping_paths(), and create_partial_grouping_paths().

GROUPING_CAN_USE_SORT

#define GROUPING_CAN_USE_SORT   0x0001

Definition at line 2456 of file pathnodes.h.

Referenced by add_paths_to_grouping_rel(), create_grouping_paths(), and create_partial_grouping_paths().

HAVE_INDEXOPTINFO_TYPEDEF

#define HAVE_INDEXOPTINFO_TYPEDEF   1

Definition at line 811 of file pathnodes.h.

HAVE_PLANNERINFO_TYPEDEF

#define HAVE_PLANNERINFO_TYPEDEF   1

Definition at line 166 of file pathnodes.h.

HAVE_SPECIALJOININFO_TYPEDEF

#define HAVE_SPECIALJOININFO_TYPEDEF   1

Definition at line 2178 of file pathnodes.h.

IS_DUMMY_APPEND

#define IS_DUMMY_APPEND

(

p

)

(IsA((p), AppendPath) && ((AppendPath *) (p))->subpaths == NIL)

Definition at line 1415 of file pathnodes.h.

Referenced by is_dummy_rel(), and is_projection_capable_path().

IS_DUMMY_REL

#define IS_DUMMY_REL

(

r

)

is_dummy_rel(r)

Definition at line 1423 of file pathnodes.h.

Referenced by add_rtes_to_flat_rtable(), apply_scanjoin_target_to_paths(), approximate_joinrel_size(), create_partitionwise_grouping_paths(), generate_partitionwise_join_paths(), get_loop_count(), inheritance_planner(), is_dummy_partition(), make_one_rel(), set_append_rel_pathlist(), set_append_rel_size(), set_rel_pathlist(), set_rel_size(), set_subquery_pathlist(), and try_partitionwise_join().

IS_JOIN_REL

#define IS_JOIN_REL

(

rel

)

Value:

((rel)->reloptkind == RELOPT_JOINREL || \
     (rel)->reloptkind == RELOPT_OTHER_JOINREL)

Definition at line 644 of file pathnodes.h.

Referenced by add_child_join_rel_equivalences(), deparseFromExpr(), deparseFromExprForRel(), deparseLockingClause(), deparseRangeTblRef(), deparseSelectSql(), deparseSelectStmtForRel(), deparseSubqueryTargetList(), estimate_path_cost_size(), generate_partitionwise_join_paths(), GetExistingLocalJoinPath(), is_subquery_var(), and postgresGetForeignPlan().

IS_OTHER_REL

#define IS_OTHER_REL

(

rel

)

Value:

((rel)->reloptkind == RELOPT_OTHER_MEMBER_REL || \
     (rel)->reloptkind == RELOPT_OTHER_JOINREL || \
     (rel)->reloptkind == RELOPT_OTHER_UPPER_REL)

Definition at line 654 of file pathnodes.h.

Referenced by apply_scanjoin_target_to_paths(), build_child_join_rel(), build_join_rel(), create_incrementalsort_plan(), create_sort_plan(), eclass_useful_for_merging(), foreign_join_ok(), generate_join_implied_equalities(), generate_join_implied_equalities_broken(), generate_join_implied_equalities_for_ecs(), get_useful_ecs_for_relation(), and make_grouping_rel().

IS_PARTITIONED_REL

#define IS_PARTITIONED_REL

(

rel

)

Value:

((rel)->part_scheme && (rel)->boundinfo && (rel)->nparts > 0 && \
     (rel)->part_rels && !IS_DUMMY_REL(rel))

Definition at line 766 of file pathnodes.h.

Referenced by apply_scanjoin_target_to_paths(), build_joinrel_partition_info(), create_ordinary_grouping_paths(), generate_partitionwise_join_paths(), and try_partitionwise_join().

IS_SIMPLE_REL

#define IS_SIMPLE_REL

(

rel

)

Value:

((rel)->reloptkind == RELOPT_BASEREL || \
     (rel)->reloptkind == RELOPT_OTHER_MEMBER_REL)

Definition at line 639 of file pathnodes.h.

Referenced by add_child_rel_equivalences(), add_paths_with_pathkeys_for_rel(), build_partition_pathkeys(), check_index_predicates(), create_foreignscan_path(), deparseFromExpr(), deparseRangeTblRef(), deparseSelectStmtForRel(), deparseSubqueryTargetList(), estimate_num_groups(), generate_implied_equalities_for_column(), generate_orderedappend_paths(), get_matching_part_pairs(), is_subquery_var(), make_one_rel(), make_partition_pruneinfo(), match_eclasses_to_foreign_key_col(), postgresGetForeignPlan(), relation_excluded_by_constraints(), set_append_rel_size(), set_baserel_partition_key_exprs(), set_rel_consider_parallel(), and try_partitionwise_join().

IS_UPPER_REL

#define IS_UPPER_REL

(

rel

)

Value:

((rel)->reloptkind == RELOPT_UPPER_REL || \
     (rel)->reloptkind == RELOPT_OTHER_UPPER_REL)

Definition at line 649 of file pathnodes.h.

Referenced by build_tlist_to_deparse(), deparseFromExpr(), deparseSelectSql(), deparseSelectStmtForRel(), estimate_path_cost_size(), foreign_expr_walker(), is_foreign_expr(), is_foreign_param(), and postgresGetForeignPlan().

PATH_REQ_OUTER

#define PATH_REQ_OUTER

(

path

)

((path)->param_info ? (path)->param_info->ppi_req_outer : (Relids) NULL)

Definition at line 1167 of file pathnodes.h.

Referenced by add_path(), add_path_precheck(), add_paths_to_append_rel(), bitmap_scan_cost_est(), calc_non_nestloop_required_outer(), create_append_path(), create_bitmap_and_path(), create_bitmap_or_path(), create_index_paths(), create_merge_append_path(), create_nestloop_path(), get_cheapest_fractional_path_for_pathkeys(), get_cheapest_parallel_safe_total_inner(), get_cheapest_parameterized_child_path(), get_cheapest_path_for_pathkeys(), get_joinrel_parampathinfo(), reparameterize_path(), reparameterize_path_by_child(), set_cheapest(), and try_nestloop_path().

planner_rt_fetch

#define planner_rt_fetch	(		rti,
			root
	)

Value:

((root)->simple_rte_array ? (root)->simple_rte_array[rti] : \
     rt_fetch(rti, (root)->parse->rtable))

Definition at line 377 of file pathnodes.h.

Referenced by brincostestimate(), btcostestimate(), build_physical_tlist(), cost_functionscan(), cost_samplescan(), cost_tablefuncscan(), create_ctescan_plan(), create_foreignscan_plan(), create_functionscan_plan(), create_namedtuplestorescan_plan(), create_resultscan_plan(), create_samplescan_plan(), create_tablefuncscan_plan(), create_unique_path(), create_valuesscan_plan(), create_worktablescan_plan(), deparseDirectDeleteSql(), deparseDirectUpdateSql(), deparseFromExprForRel(), deparseSelectSql(), deparseVar(), examine_simple_variable(), examine_variable(), expand_inherited_rtentry(), has_row_triggers(), has_stored_generated_columns(), make_modifytable(), make_partitionedrel_pruneinfo(), postgresGetForeignRelSize(), postgresPlanForeignModify(), preprocess_minmax_aggregates(), set_cte_size_estimates(), set_function_size_estimates(), set_namedtuplestore_size_estimates(), set_rel_width(), set_result_size_estimates(), set_subquery_size_estimates(), set_tablefunc_size_estimates(), and set_values_size_estimates().

planner_subplan_get_plan

#define planner_subplan_get_plan	(		root,
			subplan
	)		((Plan *) list_nth((root)->glob->subplans, (subplan)->plan_id - 1))

Definition at line 147 of file pathnodes.h.

Referenced by finalize_plan(), and finalize_primnode().

REL_HAS_ALL_PART_PROPS

#define REL_HAS_ALL_PART_PROPS

(

rel

)

Value:

((rel)->part_scheme && (rel)->boundinfo && (rel)->nparts > 0 && \
     (rel)->part_rels && (rel)->partexprs && (rel)->nullable_partexprs)

Definition at line 774 of file pathnodes.h.

Referenced by try_partitionwise_join().

RINFO_IS_PUSHED_DOWN

#define RINFO_IS_PUSHED_DOWN	(		rinfo,
			joinrelids
	)

Value:

((rinfo)->is_pushed_down || \
     !bms_is_subset((rinfo)->required_relids, joinrelids))

Definition at line 2071 of file pathnodes.h.

Referenced by calc_joinrel_size_estimate(), compute_semi_anti_join_factors(), extract_actual_join_clauses(), foreign_join_ok(), hash_inner_and_outer(), have_partkey_equi_join(), is_innerrel_unique_for(), join_is_removable(), remove_rel_from_query(), restriction_is_constant_false(), and select_mergejoin_clauses().

Typedef Documentation

AggClauseCosts

typedef struct AggClauseCosts AggClauseCosts

AggInfo

typedef struct AggInfo AggInfo

AggPath

typedef struct AggPath AggPath

AggTransInfo

typedef struct AggTransInfo AggTransInfo

AppendPath

typedef struct AppendPath AppendPath

AppendRelInfo

typedef struct AppendRelInfo AppendRelInfo

BitmapAndPath

typedef struct BitmapAndPath BitmapAndPath

BitmapHeapPath

typedef struct BitmapHeapPath BitmapHeapPath

BitmapOrPath

typedef struct BitmapOrPath BitmapOrPath

CostSelector

typedef enum CostSelector CostSelector

CustomPath

typedef struct CustomPath CustomPath

EquivalenceClass

typedef struct EquivalenceClass EquivalenceClass

EquivalenceMember

typedef struct EquivalenceMember EquivalenceMember

ForeignKeyOptInfo

typedef struct ForeignKeyOptInfo ForeignKeyOptInfo

ForeignPath

typedef struct ForeignPath ForeignPath

GatherMergePath

typedef struct GatherMergePath GatherMergePath

GatherPath

typedef struct GatherPath GatherPath

GroupingSetData

typedef struct GroupingSetData GroupingSetData

GroupingSetsPath

typedef struct GroupingSetsPath GroupingSetsPath

GroupPath

typedef struct GroupPath GroupPath

GroupResultPath

typedef struct GroupResultPath GroupResultPath

HashPath

typedef struct HashPath HashPath

IncrementalSortPath

typedef struct IncrementalSortPath IncrementalSortPath

IndexClause

typedef struct IndexClause IndexClause

IndexOptInfo

typedef struct IndexOptInfo IndexOptInfo

Definition at line 810 of file pathnodes.h.

IndexPath

typedef struct IndexPath IndexPath

InheritanceKind

typedef enum InheritanceKind InheritanceKind

JoinCostWorkspace

typedef struct JoinCostWorkspace JoinCostWorkspace

JoinPath

typedef struct JoinPath JoinPath

JoinPathExtraData

typedef struct JoinPathExtraData JoinPathExtraData

LimitPath

typedef struct LimitPath LimitPath

LockRowsPath

typedef struct LockRowsPath LockRowsPath

MaterialPath

typedef struct MaterialPath MaterialPath

MergeAppendPath

typedef struct MergeAppendPath MergeAppendPath

MergePath

typedef struct MergePath MergePath

MergeScanSelCache

typedef struct MergeScanSelCache MergeScanSelCache

MinMaxAggInfo

typedef struct MinMaxAggInfo MinMaxAggInfo

MinMaxAggPath

typedef struct MinMaxAggPath MinMaxAggPath

ModifyTablePath

typedef struct ModifyTablePath ModifyTablePath

NestPath

typedef JoinPath NestPath

Definition at line 1547 of file pathnodes.h.

ParamPathInfo

typedef struct ParamPathInfo ParamPathInfo

PartitionScheme

typedef struct PartitionSchemeData* PartitionScheme

Definition at line 411 of file pathnodes.h.

PartitionSchemeData

typedef struct PartitionSchemeData PartitionSchemeData

Path

typedef struct Path Path

PathKey

typedef struct PathKey PathKey

PathTarget

typedef struct PathTarget PathTarget

PlaceHolderInfo

typedef struct PlaceHolderInfo PlaceHolderInfo

PlaceHolderVar

typedef struct PlaceHolderVar PlaceHolderVar

PlannerGlobal

typedef struct PlannerGlobal PlannerGlobal

PlannerInfo

typedef struct PlannerInfo PlannerInfo

Definition at line 165 of file pathnodes.h.

PlannerParamItem

typedef struct PlannerParamItem PlannerParamItem

ProjectionPath

typedef struct ProjectionPath ProjectionPath

ProjectSetPath

typedef struct ProjectSetPath ProjectSetPath

QualCost

typedef struct QualCost QualCost

RecursiveUnionPath

typedef struct RecursiveUnionPath RecursiveUnionPath

Relids

typedef Bitmapset* Relids

Definition at line 28 of file pathnodes.h.

RelOptInfo

typedef struct RelOptInfo RelOptInfo

RelOptKind

typedef enum RelOptKind RelOptKind

RestrictInfo

typedef struct RestrictInfo RestrictInfo

RollupData

typedef struct RollupData RollupData

SemiAntiJoinFactors

typedef struct SemiAntiJoinFactors SemiAntiJoinFactors

SetOpPath

typedef struct SetOpPath SetOpPath

SortPath

typedef struct SortPath SortPath

SpecialJoinInfo

typedef struct SpecialJoinInfo SpecialJoinInfo

Definition at line 2177 of file pathnodes.h.

StatisticExtInfo

typedef struct StatisticExtInfo StatisticExtInfo

SubqueryScanPath

typedef struct SubqueryScanPath SubqueryScanPath

TidPath

typedef struct TidPath TidPath

UniquePath

typedef struct UniquePath UniquePath

UpperRelationKind

typedef enum UpperRelationKind UpperRelationKind

UpperUniquePath

typedef struct UpperUniquePath UpperUniquePath

WindowAggPath

typedef struct WindowAggPath WindowAggPath

Enumeration Type Documentation

CostSelector

enum CostSelector

Enumerator
STARTUP_COST
TOTAL_COST

Definition at line 34 of file pathnodes.h.

{
    STARTUP_COST, TOTAL_COST
} CostSelector;

InheritanceKind

enum InheritanceKind

Enumerator
INHKIND_NONE
INHKIND_INHERITED
INHKIND_PARTITIONED

Definition at line 85 of file pathnodes.h.

{
    INHKIND_NONE,
    INHKIND_INHERITED,
    INHKIND_PARTITIONED
} InheritanceKind;

PartitionwiseAggregateType

enum PartitionwiseAggregateType

Enumerator
PARTITIONWISE_AGGREGATE_NONE
PARTITIONWISE_AGGREGATE_FULL
PARTITIONWISE_AGGREGATE_PARTIAL

Definition at line 2471 of file pathnodes.h.

{
    PARTITIONWISE_AGGREGATE_NONE,
    PARTITIONWISE_AGGREGATE_FULL,
    PARTITIONWISE_AGGREGATE_PARTIAL
} PartitionwiseAggregateType;

RelOptKind

enum RelOptKind

Enumerator
RELOPT_BASEREL
RELOPT_JOINREL
RELOPT_OTHER_MEMBER_REL
RELOPT_OTHER_JOINREL
RELOPT_UPPER_REL
RELOPT_OTHER_UPPER_REL
RELOPT_DEADREL

Definition at line 624 of file pathnodes.h.

{
    RELOPT_BASEREL,
    RELOPT_JOINREL,
    RELOPT_OTHER_MEMBER_REL,
    RELOPT_OTHER_JOINREL,
    RELOPT_UPPER_REL,
    RELOPT_OTHER_UPPER_REL,
    RELOPT_DEADREL
} RelOptKind;

UniquePathMethod

enum UniquePathMethod

Enumerator
UNIQUE_PATH_NOOP
UNIQUE_PATH_HASH
UNIQUE_PATH_SORT

Definition at line 1477 of file pathnodes.h.

{
    UNIQUE_PATH_NOOP,           /* input is known unique already */
    UNIQUE_PATH_HASH,           /* use hashing */
    UNIQUE_PATH_SORT            /* use sorting */
} UniquePathMethod;

UpperRelationKind

enum UpperRelationKind

Enumerator
UPPERREL_SETOP
UPPERREL_PARTIAL_GROUP_AGG
UPPERREL_GROUP_AGG
UPPERREL_WINDOW
UPPERREL_DISTINCT
UPPERREL_ORDERED
UPPERREL_FINAL

Definition at line 67 of file pathnodes.h.

{
    UPPERREL_SETOP,             /* result of UNION/INTERSECT/EXCEPT, if any */
    UPPERREL_PARTIAL_GROUP_AGG, /* result of partial grouping/aggregation, if
                                 * any */
    UPPERREL_GROUP_AGG,         /* result of grouping/aggregation, if any */
    UPPERREL_WINDOW,            /* result of window functions, if any */
    UPPERREL_DISTINCT,          /* result of "SELECT DISTINCT", if any */
    UPPERREL_ORDERED,           /* result of ORDER BY, if any */
    UPPERREL_FINAL              /* result of any remaining top-level actions */
    /* NB: UPPERREL_FINAL must be last enum entry; it's used to size arrays */
} UpperRelationKind;

Function Documentation

is_dummy_rel()

bool is_dummy_rel

(

RelOptInfo *

rel

)

Definition at line 1212 of file joinrels.c.

References IS_DUMMY_APPEND, IsA, linitial, NIL, RelOptInfo::pathlist, and subpath().

Referenced by make_join_rel(), mark_dummy_rel(), and populate_joinrel_with_paths().

{
    Path       *path;

    /*
     * A rel that is known dummy will have just one path that is a childless
     * Append.  (Even if somehow it has more paths, a childless Append will
     * have cost zero and hence should be at the front of the pathlist.)
     */
    if (rel->pathlist == NIL)
        return false;
    path = (Path *) linitial(rel->pathlist);

    /*
     * Initially, a dummy path will just be a childless Append.  But in later
     * planning stages we might stick a ProjectSetPath and/or ProjectionPath
     * on top, since Append can't project.  Rather than make assumptions about
     * which combinations can occur, just descend through whatever we find.
     */
    for (;;)
    {
        if (IsA(path, ProjectionPath))
            path = ((ProjectionPath *) path)->subpath;
        else if (IsA(path, ProjectSetPath))
            path = ((ProjectSetPath *) path)->subpath;
        else
            break;
    }
    if (IS_DUMMY_APPEND(path))
        return true;
    return false;
}