21 #define DEFAULT_CURSOR_TUPLE_FRACTION 0.1
44 List *fdw_scan_tlist,
List *fdw_recheck_quals,
47 bool tlist_parallel_safe);
56 int numGroupCols,
AttrNumber *grpColIdx,
Oid *grpOperators,
Oid *grpCollations,
57 List *groupingSets,
List *chain,
double dNumGroups,
58 Size transitionSpace,
Plan *lefttree);
98 Index security_level);
110 JoinType jointype,
List *restrictlist,
bool force_cache);
List * remove_useless_joins(PlannerInfo *root, List *joinlist)
Sort * make_sort_from_sortclauses(List *sortcls, Plan *lefttree)
void record_plan_type_dependency(PlannerInfo *root, Oid typid)
void preprocess_minmax_aggregates(PlannerInfo *root)
Agg * make_agg(List *tlist, List *qual, AggStrategy aggstrategy, AggSplit aggsplit, int numGroupCols, AttrNumber *grpColIdx, Oid *grpOperators, Oid *grpCollations, List *groupingSets, List *chain, double dNumGroups, Size transitionSpace, Plan *lefttree)
bool innerrel_is_unique(PlannerInfo *root, Relids joinrelids, Relids outerrelids, RelOptInfo *innerrel, JoinType jointype, List *restrictlist, bool force_cache)
List * deconstruct_jointree(PlannerInfo *root)
PGDLLIMPORT int join_collapse_limit
Plan * create_plan(PlannerInfo *root, Path *best_path)
void distribute_restrictinfo_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo)
void record_plan_function_dependency(PlannerInfo *root, Oid funcid)
bool is_projection_capable_path(Path *path)
void match_foreign_keys_to_quals(PlannerInfo *root)
void find_lateral_references(PlannerInfo *root)
void(* query_pathkeys_callback)(PlannerInfo *root, void *extra)
bool query_is_distinct_for(Query *query, List *colnos, List *opids)
void add_base_rels_to_query(PlannerInfo *root, Node *jtnode)
void build_base_rel_tlists(PlannerInfo *root, List *final_tlist)
bool trivial_subqueryscan(SubqueryScan *plan)
bool restriction_is_always_true(PlannerInfo *root, RestrictInfo *restrictinfo)
bool is_projection_capable_plan(Plan *plan)
void add_vars_to_targetlist(PlannerInfo *root, List *vars, Relids where_needed)
ForeignScan * make_foreignscan(List *qptlist, List *qpqual, Index scanrelid, List *fdw_exprs, List *fdw_private, List *fdw_scan_tlist, List *fdw_recheck_quals, Plan *outer_plan)
bool restriction_is_always_false(PlannerInfo *root, RestrictInfo *restrictinfo)
RestrictInfo * build_implied_join_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level)
bool query_supports_distinctness(Query *query)
PGDLLIMPORT double cursor_tuple_fraction
Plan * materialize_finished_plan(Plan *subplan)
RelOptInfo * query_planner(PlannerInfo *root, query_pathkeys_callback qp_callback, void *qp_extra)
Plan * set_plan_references(PlannerInfo *root, Plan *plan)
void add_other_rels_to_query(PlannerInfo *root)
bool extract_query_dependencies_walker(Node *node, PlannerInfo *context)
void reduce_unique_semijoins(PlannerInfo *root)
void create_lateral_join_info(PlannerInfo *root)
Plan * change_plan_targetlist(Plan *subplan, List *tlist, bool tlist_parallel_safe)
Param * find_minmax_agg_replacement_param(PlannerInfo *root, Aggref *aggref)
PGDLLIMPORT int from_collapse_limit
RestrictInfo * process_implied_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level, bool both_const)
Limit * make_limit(Plan *lefttree, Node *limitOffset, Node *limitCount, LimitOption limitOption, int uniqNumCols, AttrNumber *uniqColIdx, Oid *uniqOperators, Oid *uniqCollations)