| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | #ifndef PLANNER_H |
| | #define PLANNER_H |
| |
|
| | #include "nodes/pathnodes.h" |
| | #include "nodes/plannodes.h" |
| |
|
| |
|
| | |
| | typedef PlannedStmt *(*planner_hook_type) (Query *parse, |
| | const char *query_string, |
| | int cursorOptions, |
| | ParamListInfo boundParams); |
| | extern PGDLLIMPORT planner_hook_type planner_hook; |
| |
|
| | |
| | typedef void (*create_upper_paths_hook_type) (PlannerInfo *root, |
| | UpperRelationKind stage, |
| | RelOptInfo *input_rel, |
| | RelOptInfo *output_rel, |
| | void *extra); |
| | extern PGDLLIMPORT create_upper_paths_hook_type create_upper_paths_hook; |
| |
|
| |
|
| | extern PlannedStmt *standard_planner(Query *parse, const char *query_string, |
| | int cursorOptions, |
| | ParamListInfo boundParams); |
| |
|
| | extern PlannerInfo *subquery_planner(PlannerGlobal *glob, Query *parse, |
| | PlannerInfo *parent_root, |
| | bool hasRecursion, double tuple_fraction, |
| | SetOperationStmt *setops); |
| |
|
| | extern RowMarkType select_rowmark_type(RangeTblEntry *rte, |
| | LockClauseStrength strength); |
| |
|
| | extern bool limit_needed(Query *parse); |
| |
|
| | extern void mark_partial_aggref(Aggref *agg, AggSplit aggsplit); |
| |
|
| | extern Path *get_cheapest_fractional_path(RelOptInfo *rel, |
| | double tuple_fraction); |
| |
|
| | extern Expr *preprocess_phv_expression(PlannerInfo *root, Expr *expr); |
| |
|
| | #endif |
| |
|