47 #define STD_FUZZ_FACTOR 1.01
119 if (fraction <= 0.0 || fraction >= 1.0)
164 #define CONSIDER_PATH_STARTUP_COST(p) \
165 ((p)->param_info == NULL ? (p)->parent->consider_startup : (p)->parent->consider_param_startup)
209 #undef CONSIDER_PATH_STARTUP_COST
242 Path *cheapest_startup_path;
243 Path *cheapest_total_path;
244 Path *best_param_path;
245 List *parameterized_paths;
251 elog(
ERROR,
"could not devise a query plan for the given query");
253 cheapest_startup_path = cheapest_total_path = best_param_path = NULL;
254 parameterized_paths =
NIL;
261 if (path->param_info)
264 parameterized_paths =
lappend(parameterized_paths, path);
270 if (cheapest_total_path)
278 if (best_param_path == NULL)
279 best_param_path = path;
289 best_param_path = path;
293 best_param_path = path;
312 if (cheapest_total_path == NULL)
314 cheapest_startup_path = cheapest_total_path = path;
330 cheapest_startup_path = path;
337 cheapest_total_path = path;
342 if (cheapest_total_path)
343 parameterized_paths =
lcons(cheapest_total_path, parameterized_paths);
349 if (cheapest_total_path == NULL)
350 cheapest_total_path = best_param_path;
351 Assert(cheapest_total_path != NULL);
420 bool accept_new =
true;
422 List *new_path_pathkeys;
432 new_path_pathkeys = new_path->param_info ?
NIL : new_path->
pathkeys;
442 bool remove_old =
false;
467 List *old_path_pathkeys;
469 old_path_pathkeys = old_path->param_info ?
NIL : old_path->
pathkeys;
520 else if (new_path->
rows < old_path->
rows)
522 else if (new_path->
rows > old_path->
rows)
644 List *new_path_pathkeys;
645 bool consider_startup;
649 new_path_pathkeys = required_outer ?
NIL : pathkeys;
674 List *old_path_pathkeys;
676 old_path_pathkeys = old_path->param_info ?
NIL : old_path->
pathkeys;
747 bool accept_new =
true;
767 bool remove_old =
false;
926 Relids required_outer,
int parallel_workers)
931 pathnode->parent = rel;
940 cost_seqscan(pathnode, root, rel, pathnode->param_info);
955 pathnode->parent = rel;
995 List *indexorderbycols,
1006 pathnode->
path.
pathtype = indexonly ? T_IndexOnlyScan : T_IndexScan;
1007 pathnode->
path.parent = rel;
1022 cost_index(pathnode, root, loop_count, partial_path);
1045 int parallel_degree)
1050 pathnode->
path.parent = rel;
1062 pathnode->
path.param_info,
1063 bitmapqual, loop_count);
1078 Relids required_outer = NULL;
1082 pathnode->
path.parent = rel;
1090 foreach(lc, bitmapquals)
1130 Relids required_outer = NULL;
1134 pathnode->
path.parent = rel;
1142 foreach(lc, bitmapquals)
1183 pathnode->
path.parent = rel;
1195 pathnode->
path.param_info);
1212 pathnode->
path.parent = rel;
1224 pathnode->
path.param_info);
1244 List *subpaths,
List *partial_subpaths,
1246 int parallel_workers,
bool parallel_aware,
1252 Assert(!parallel_aware || parallel_workers > 0);
1255 pathnode->
path.parent = rel;
1382 return bms_compare(path1->parent->relids, path2->parent->relids);
1404 return bms_compare(path1->parent->relids, path2->parent->relids);
1420 Cost input_startup_cost;
1421 Cost input_total_cost;
1425 pathnode->
path.parent = rel;
1448 input_startup_cost = 0;
1449 input_total_cost = 0;
1450 foreach(l, subpaths)
1461 input_startup_cost +=
subpath->startup_cost;
1462 input_total_cost +=
subpath->total_cost;
1502 input_startup_cost, input_total_cost,
1522 pathnode->
path.parent = rel;
1523 pathnode->
path.pathtarget = target;
1524 pathnode->
path.param_info = NULL;
1529 pathnode->
quals = havingqual;
1571 pathnode->
path.parent = rel;
1597 List *param_exprs,
List *hash_operators,
1598 bool singlerow,
bool binary_mode,
double calls)
1605 pathnode->
path.parent = rel;
1619 pathnode->
calls = calls;
1691 pathnode->
path.parent = rel;
1753 List *sub_tlist_colnos;
1758 if (sub_tlist_colnos &&
1814 int hashentrysize =
subpath->pathtarget->width + 64;
1880 Relids required_outer,
double *rows)
1883 Cost input_startup_cost = 0;
1884 Cost input_total_cost = 0;
1890 pathnode->
path.parent = rel;
1898 pathnode->
path.pathtarget = target ? target : rel->
reltarget;
1904 input_startup_cost +=
subpath->startup_cost;
1905 input_total_cost +=
subpath->total_cost;
1926 input_startup_cost, input_total_cost, rows);
1952 if (!var || !
IsA(var,
Var) ||
1953 var->
varno != relid)
1977 pathnode->
path.parent = rel;
1978 pathnode->
path.pathtarget = target;
2014 bool trivial_pathtarget,
2020 pathnode->
path.parent = rel;
2032 trivial_pathtarget);
2048 pathnode->
pathtype = T_FunctionScan;
2049 pathnode->parent = rel;
2074 pathnode->
pathtype = T_TableFuncScan;
2075 pathnode->parent = rel;
2101 pathnode->parent = rel;
2126 pathnode->parent = rel;
2135 cost_ctescan(pathnode, root, rel, pathnode->param_info);
2151 pathnode->
pathtype = T_NamedTuplestoreScan;
2152 pathnode->parent = rel;
2178 pathnode->parent = rel;
2203 pathnode->
pathtype = T_WorkTableScan;
2204 pathnode->parent = rel;
2214 cost_ctescan(pathnode, root, rel, pathnode->param_info);
2233 double rows,
Cost startup_cost,
Cost total_cost,
2236 Path *fdw_outerpath,
2237 List *fdw_restrictinfo,
2246 pathnode->
path.parent = rel;
2247 pathnode->
path.pathtarget = target ? target : rel->
reltarget;
2279 double rows,
Cost startup_cost,
Cost total_cost,
2282 Path *fdw_outerpath,
2283 List *fdw_restrictinfo,
2296 elog(
ERROR,
"parameterized foreign joins are not supported yet");
2299 pathnode->
path.parent = rel;
2300 pathnode->
path.pathtarget = target ? target : rel->
reltarget;
2301 pathnode->
path.param_info = NULL;
2331 double rows,
Cost startup_cost,
Cost total_cost,
2333 Path *fdw_outerpath,
2334 List *fdw_restrictinfo,
2346 pathnode->
path.parent = rel;
2347 pathnode->
path.pathtarget = target ? target : rel->
reltarget;
2348 pathnode->
path.param_info = NULL;
2384 if (!inner_paramrels)
2387 required_outer =
bms_union(outer_paramrels, inner_paramrels);
2391 return required_outer;
2416 if (inner_path->parent->top_parent_relids)
2417 innerrelids = inner_path->parent->top_parent_relids;
2419 innerrelids = inner_path->parent->relids;
2421 if (outer_path->parent->top_parent_relids)
2422 outerrelids = outer_path->parent->top_parent_relids;
2424 outerrelids = outer_path->parent->relids;
2430 required_outer =
bms_union(outer_paramrels, inner_paramrels);
2432 return required_outer;
2460 List *restrict_clauses,
2475 if (
bms_overlap(inner_req_outer, outer_path->parent->relids))
2481 foreach(lc, restrict_clauses)
2486 jclauses =
lappend(jclauses, rinfo);
2488 restrict_clauses = jclauses;
2491 pathnode->
jpath.path.pathtype = T_NestLoop;
2492 pathnode->
jpath.path.parent = joinrel;
2494 pathnode->
jpath.path.param_info =
2502 pathnode->
jpath.path.parallel_aware =
false;
2507 pathnode->
jpath.path.pathkeys = pathkeys;
2546 List *restrict_clauses,
2550 List *outersortkeys,
2551 List *innersortkeys)
2555 pathnode->
jpath.path.pathtype = T_MergeJoin;
2556 pathnode->
jpath.path.parent = joinrel;
2558 pathnode->
jpath.path.param_info =
2566 pathnode->
jpath.path.parallel_aware =
false;
2571 pathnode->
jpath.path.pathkeys = pathkeys;
2613 List *restrict_clauses,
2619 pathnode->
jpath.path.pathtype = T_HashJoin;
2620 pathnode->
jpath.path.parent = joinrel;
2622 pathnode->
jpath.path.param_info =
2630 pathnode->
jpath.path.parallel_aware =
2648 pathnode->
jpath.path.pathkeys =
NIL;
2696 pathnode->
path.parent = rel;
2697 pathnode->
path.pathtarget = target;
2699 pathnode->
path.param_info = NULL;
2719 oldtarget =
subpath->pathtarget;
2797 oldcost = path->pathtarget->cost;
2798 path->pathtarget = target;
2878 pathnode->
path.parent = rel;
2879 pathnode->
path.pathtarget = target;
2881 pathnode->
path.param_info = NULL;
2897 foreach(lc, target->
exprs)
2903 if (tlist_rows < itemrows)
2904 tlist_rows = itemrows;
2942 double limit_tuples)
2948 pathnode->
path.parent = rel;
2952 pathnode->
path.param_info = NULL;
2962 root, pathkeys, presorted_keys,
2970 sort->nPresortedCols = presorted_keys;
2990 double limit_tuples)
2995 pathnode->
path.parent = rel;
2999 pathnode->
path.param_info = NULL;
3041 pathnode->
path.parent = rel;
3042 pathnode->
path.pathtarget = target;
3044 pathnode->
path.param_info = NULL;
3055 pathnode->
qual = qual;
3098 pathnode->
path.parent = rel;
3102 pathnode->
path.param_info = NULL;
3155 pathnode->
path.parent = rel;
3156 pathnode->
path.pathtarget = target;
3158 pathnode->
path.param_info = NULL;
3190 pathnode->
qual = qual;
3193 aggstrategy, aggcosts,
3234 bool is_first =
true;
3235 bool is_first_sort =
true;
3239 pathnode->
path.parent = rel;
3240 pathnode->
path.pathtarget = target;
3273 pathnode->
qual = having_qual;
3280 foreach(lc, rollups)
3310 is_first_sort =
false;
3333 is_first_sort =
false;
3395 pathnode->
path.parent = rel;
3396 pathnode->
path.pathtarget = target;
3398 pathnode->
path.param_info = NULL;
3407 pathnode->
quals = quals;
3411 foreach(lc, mmaggregates)
3485 pathnode->
path.parent = rel;
3486 pathnode->
path.pathtarget = target;
3488 pathnode->
path.param_info = NULL;
3498 pathnode->
qual = qual;
3552 pathnode->
path.parent = rel;
3556 pathnode->
path.param_info = NULL;
3566 pathnode->
cmd = cmd;
3612 pathnode->
path.parent = rel;
3613 pathnode->
path.pathtarget = target;
3615 pathnode->
path.param_info = NULL;
3651 pathnode->
path.parent = rel;
3655 pathnode->
path.param_info = NULL;
3709 CmdType operation,
bool canSetTag,
3711 bool partColsUpdated,
3712 List *resultRelations,
3713 List *updateColnosLists,
3714 List *withCheckOptionLists,
List *returningLists,
3716 List *mergeActionLists,
int epqParam)
3723 updateColnosLists ==
NIL));
3730 pathnode->
path.parent = rel;
3734 pathnode->
path.param_info = NULL;
3752 if (returningLists !=
NIL)
3762 pathnode->
path.pathtarget->width =
subpath->pathtarget->width;
3767 pathnode->
path.pathtarget->width = 0;
3808 Node *limitOffset,
Node *limitCount,
3810 int64 offset_est, int64 count_est)
3815 pathnode->
path.parent = rel;
3819 pathnode->
path.param_info = NULL;
3839 offset_est, count_est);
3867 double input_rows = *rows;
3868 Cost input_startup_cost = *startup_cost;
3869 Cost input_total_cost = *total_cost;
3871 if (offset_est != 0)
3876 offset_rows = (double) offset_est;
3879 if (offset_rows > *rows)
3880 offset_rows = *rows;
3883 (input_total_cost - input_startup_cost)
3884 * offset_rows / input_rows;
3885 *rows -= offset_rows;
3895 count_rows = (double) count_est;
3898 if (count_rows > *rows)
3901 *total_cost = *startup_cost +
3902 (input_total_cost - input_startup_cost)
3903 * count_rows / input_rows;
3945 case T_IndexOnlyScan:
3957 memcpy(newpath, ipath,
sizeof(
IndexPath));
3958 newpath->
path.param_info =
3960 cost_index(newpath, root, loop_count,
false);
3961 return (
Path *) newpath;
3963 case T_BitmapHeapScan:
3973 case T_SubqueryScan:
3977 bool trivial_pathtarget;
3986 trivial_pathtarget =
4021 if (i < apath->first_partial_path)
4022 childpaths =
lappend(childpaths, spath);
4024 partialpaths =
lappend(partialpaths, spath);
4094 #define FLAT_COPY_PATH(newnode, node, nodetype) \
4095 ( (newnode) = makeNode(nodetype), \
4096 memcpy((newnode), (node), sizeof(nodetype)) )
4098 #define ADJUST_CHILD_ATTRS(node) \
4100 (List *) adjust_appendrel_attrs_multilevel(root, (Node *) (node), \
4102 child_rel->top_parent))
4104 #define REPARAMETERIZE_CHILD_PATH(path) \
4106 (path) = reparameterize_path_by_child(root, (path), child_rel); \
4107 if ((path) == NULL) \
4111 #define REPARAMETERIZE_CHILD_PATH_LIST(pathlist) \
4113 if ((pathlist) != NIL) \
4115 (pathlist) = reparameterize_pathlist_by_child(root, (pathlist), \
4117 if ((pathlist) == NIL) \
4131 if (!path->param_info ||
4159 new_path = (
Path *) ipath;
4163 case T_BitmapHeapPath:
4169 new_path = (
Path *) bhpath;
4173 case T_BitmapAndPath:
4179 new_path = (
Path *) bapath;
4183 case T_BitmapOrPath:
4189 new_path = (
Path *) bopath;
4206 path->parent->fdwroutine->ReparameterizeForeignPathByChild;
4210 new_path = (
Path *) fpath;
4228 new_path = (
Path *) cpath;
4243 new_path = (
Path *) npath;
4259 new_path = (
Path *) mpath;
4275 new_path = (
Path *) hpath;
4285 new_path = (
Path *) apath;
4289 case T_MaterialPath:
4295 new_path = (
Path *) mpath;
4306 new_path = (
Path *) mpath;
4316 new_path = (
Path *) gpath;
4331 old_ppi = new_path->param_info;
4335 child_rel->top_parent);
4345 if (new_ppi == NULL)
4364 new_path->param_info = new_ppi;
4393 foreach(lc, pathlist)
4404 result =
lappend(result, path);
Datum sort(PG_FUNCTION_ARGS)
bool query_is_distinct_for(Query *query, List *colnos, List *opids)
bool query_supports_distinctness(Query *query)
Relids adjust_child_relids_multilevel(PlannerInfo *root, Relids relids, RelOptInfo *childrel, RelOptInfo *parentrel)
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
BMS_Comparison bms_subset_compare(const Bitmapset *a, const Bitmapset *b)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
void bms_free(Bitmapset *a)
bool bms_is_member(int x, const Bitmapset *a)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
int bms_compare(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_copy(const Bitmapset *a)
#define PG_USED_FOR_ASSERTS_ONLY
bool is_parallel_safe(PlannerInfo *root, Node *node)
double expression_returns_set_rows(PlannerInfo *root, Node *clause)
void final_cost_hashjoin(PlannerInfo *root, HashPath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
void final_cost_mergejoin(PlannerInfo *root, MergePath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
void cost_functionscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_material(Path *path, Cost input_startup_cost, Cost input_total_cost, double tuples, int width)
void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info, Path *bitmapqual, double loop_count)
void cost_tidrangescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, List *tidrangequals, ParamPathInfo *param_info)
void cost_merge_append(Path *path, PlannerInfo *root, List *pathkeys, int n_streams, Cost input_startup_cost, Cost input_total_cost, double tuples)
void final_cost_nestloop(PlannerInfo *root, NestPath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
void cost_recursive_union(Path *runion, Path *nrterm, Path *rterm)
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)
void cost_tablefuncscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_samplescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_gather(GatherPath *path, PlannerInfo *root, RelOptInfo *rel, ParamPathInfo *param_info, double *rows)
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)
void cost_namedtuplestorescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_seqscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_valuesscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root)
void cost_resultscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_windowagg(Path *path, PlannerInfo *root, List *windowFuncs, WindowClause *winclause, Cost input_startup_cost, Cost input_total_cost, double input_tuples)
void cost_bitmap_and_node(BitmapAndPath *path, PlannerInfo *root)
void cost_gather_merge(GatherMergePath *path, PlannerInfo *root, RelOptInfo *rel, ParamPathInfo *param_info, Cost input_startup_cost, Cost input_total_cost, double *rows)
void cost_tidscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, List *tidquals, ParamPathInfo *param_info)
double clamp_row_est(double nrows)
void cost_subqueryscan(SubqueryScanPath *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info, bool trivial_pathtarget)
void cost_append(AppendPath *apath)
void cost_ctescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
void cost_bitmap_or_node(BitmapOrPath *path, PlannerInfo *root)
void cost_index(IndexPath *path, PlannerInfo *root, double loop_count, bool partial_path)
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)
void cost_group(Path *path, PlannerInfo *root, int numGroupCols, double numGroups, List *quals, Cost input_startup_cost, Cost input_total_cost, double input_tuples)
bool is_projection_capable_path(Path *path)
bool equal(const void *a, const void *b)
List *(* ReparameterizeForeignPathByChild_function)(PlannerInfo *root, List *fdw_private, RelOptInfo *child_rel)
bool relation_has_unique_index_for(PlannerInfo *root, RelOptInfo *rel, List *restrictlist, List *exprlist, List *oprlist)
if(TABLE==NULL||TABLE_index==NULL)
Assert(fmt[strlen(fmt) - 1] !='\n')
void list_sort(List *list, list_sort_comparator cmp)
List * list_insert_nth(List *list, int pos, void *datum)
List * lappend(List *list, void *datum)
List * list_copy_head(const List *oldlist, int len)
List * lappend_int(List *list, int datum)
void list_free(List *list)
List * list_concat(List *list1, const List *list2)
List * lcons(void *datum, List *list)
Datum subpath(PG_FUNCTION_ARGS)
void pfree(void *pointer)
MemoryContext GetMemoryChunkContext(void *pointer)
#define CHECK_FOR_INTERRUPTS()
size_t get_hash_memory_limit(void)
#define IsA(nodeptr, _type_)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
bool pathkeys_contained_in(List *keys1, List *keys2)
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
#define REPARAMETERIZE_CHILD_PATH_LIST(pathlist)
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, List *pathkeys, Relids required_outer, int parallel_workers, bool parallel_aware, double rows)
static int append_startup_cost_compare(const ListCell *a, const ListCell *b)
SortPath * create_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, double limit_tuples)
TidPath * create_tidscan_path(PlannerInfo *root, RelOptInfo *rel, List *tidquals, Relids required_outer)
#define REPARAMETERIZE_CHILD_PATH(path)
GroupResultPath * create_group_result_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *havingqual)
NestPath * create_nestloop_path(PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, JoinPathExtraData *extra, Path *outer_path, Path *inner_path, List *restrict_clauses, List *pathkeys, Relids required_outer)
Relids calc_non_nestloop_required_outer(Path *outer_path, Path *inner_path)
UniquePath * create_unique_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, SpecialJoinInfo *sjinfo)
static PathCostComparison compare_path_costs_fuzzily(Path *path1, Path *path2, double fuzz_factor)
WindowAggPath * create_windowagg_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *windowFuncs, WindowClause *winclause, List *qual, bool topwindow)
IndexPath * create_index_path(PlannerInfo *root, IndexOptInfo *index, List *indexclauses, List *indexorderbys, List *indexorderbycols, List *pathkeys, ScanDirection indexscandir, bool indexonly, Relids required_outer, double loop_count, bool partial_path)
LimitPath * create_limit_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, Node *limitOffset, Node *limitCount, LimitOption limitOption, int64 offset_est, int64 count_est)
ProjectionPath * create_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
GatherMergePath * create_gather_merge_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
UpperUniquePath * create_upper_unique_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, int numCols, double numGroups)
Relids calc_nestloop_required_outer(Relids outerrelids, Relids outer_paramrels, Relids innerrelids, Relids inner_paramrels)
Path * create_tablefuncscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Path * create_namedtuplestorescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
#define FLAT_COPY_PATH(newnode, node, nodetype)
LockRowsPath * create_lockrows_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *rowMarks, int epqParam)
Path * reparameterize_path_by_child(PlannerInfo *root, Path *path, RelOptInfo *child_rel)
MergePath * create_mergejoin_path(PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, JoinPathExtraData *extra, Path *outer_path, Path *inner_path, List *restrict_clauses, List *pathkeys, Relids required_outer, List *mergeclauses, List *outersortkeys, List *innersortkeys)
static List * reparameterize_pathlist_by_child(PlannerInfo *root, List *pathlist, RelOptInfo *child_rel)
GatherPath * create_gather_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, Relids required_outer, double *rows)
Path * create_resultscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Path * create_samplescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
MemoizePath * create_memoize_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *param_exprs, List *hash_operators, bool singlerow, bool binary_mode, double calls)
MergeAppendPath * create_merge_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *pathkeys, Relids required_outer)
void set_cheapest(RelOptInfo *parent_rel)
Path * reparameterize_path(PlannerInfo *root, Path *path, Relids required_outer, double loop_count)
ProjectSetPath * create_set_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
SubqueryScanPath * create_subqueryscan_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, bool trivial_pathtarget, List *pathkeys, Relids required_outer)
ForeignPath * create_foreignscan_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer, Path *fdw_outerpath, List *fdw_restrictinfo, List *fdw_private)
Path * create_ctescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
ForeignPath * create_foreign_upper_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, Cost startup_cost, Cost total_cost, List *pathkeys, Path *fdw_outerpath, List *fdw_restrictinfo, List *fdw_private)
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
MaterialPath * create_material_path(RelOptInfo *rel, Path *subpath)
Path * create_functionscan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
#define ADJUST_CHILD_ATTRS(node)
BitmapOrPath * create_bitmap_or_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
int compare_fractional_path_costs(Path *path1, Path *path2, double fraction)
GroupPath * create_group_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *groupClause, List *qual, double numGroups)
HashPath * create_hashjoin_path(PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, JoinPathExtraData *extra, Path *outer_path, Path *inner_path, bool parallel_hash, List *restrict_clauses, Relids required_outer, List *hashclauses)
bool add_partial_path_precheck(RelOptInfo *parent_rel, Cost total_cost, List *pathkeys)
GroupingSetsPath * create_groupingsets_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *having_qual, AggStrategy aggstrategy, List *rollups, const AggClauseCosts *agg_costs)
SetOpPath * create_setop_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, SetOpCmd cmd, SetOpStrategy strategy, List *distinctList, AttrNumber flagColIdx, int firstFlag, double numGroups, double outputRows)
RecursiveUnionPath * create_recursiveunion_path(PlannerInfo *root, RelOptInfo *rel, Path *leftpath, Path *rightpath, PathTarget *target, List *distinctList, int wtParam, double numGroups)
IncrementalSortPath * create_incremental_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, int presorted_keys, double limit_tuples)
MinMaxAggPath * create_minmaxagg_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *mmaggregates, List *quals)
ModifyTablePath * create_modifytable_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, CmdType operation, bool canSetTag, Index nominalRelation, Index rootRelation, bool partColsUpdated, List *resultRelations, List *updateColnosLists, List *withCheckOptionLists, List *returningLists, List *rowMarks, OnConflictExpr *onconflict, List *mergeActionLists, int epqParam)
Path * create_worktablescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
#define CONSIDER_PATH_STARTUP_COST(p)
AggPath * create_agg_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, AggStrategy aggstrategy, AggSplit aggsplit, List *groupClause, List *qual, const AggClauseCosts *aggcosts, double numGroups)
void add_path(RelOptInfo *parent_rel, Path *new_path)
Path * create_valuesscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Path * apply_projection_to_path(PlannerInfo *root, RelOptInfo *rel, Path *path, PathTarget *target)
static int append_total_cost_compare(const ListCell *a, const ListCell *b)
BitmapAndPath * create_bitmap_and_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
TidRangePath * create_tidrangescan_path(PlannerInfo *root, RelOptInfo *rel, List *tidrangequals, Relids required_outer)
Path * create_seqscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer, int parallel_workers)
void adjust_limit_rows_costs(double *rows, Cost *startup_cost, Cost *total_cost, int64 offset_est, int64 count_est)
ForeignPath * create_foreign_join_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer, Path *fdw_outerpath, List *fdw_restrictinfo, List *fdw_private)
static List * translate_sub_tlist(List *tlist, int relid)
bool add_path_precheck(RelOptInfo *parent_rel, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer)
BitmapHeapPath * create_bitmap_heap_path(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual, Relids required_outer, double loop_count, int parallel_degree)
#define IS_SIMPLE_REL(rel)
#define PATH_REQ_OUTER(path)
#define planner_rt_fetch(rti, root)
static int list_length(const List *l)
#define foreach_current_index(var_or_cell)
#define foreach_delete_current(lst, var_or_cell)
static int cmp(const chr *x, const chr *y, size_t len)
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
ParamPathInfo * get_joinrel_parampathinfo(PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
ParamPathInfo * find_param_path_info(RelOptInfo *rel, Relids required_outer)
Bitmapset * get_param_path_clause_serials(Path *path)
double estimate_num_groups(PlannerInfo *root, List *groupExprs, double input_rows, List **pgset, EstimationInfo *estinfo)
struct List *(* ReparameterizeCustomPathByChild)(PlannerInfo *root, List *custom_private, RelOptInfo *child_rel)
const struct CustomPathMethods * methods
List * custom_restrictinfo
ScanDirection indexscandir
List * withCheckOptionLists
OnConflictExpr * onconflict
bool consider_param_startup
struct PathTarget * reltarget
List * cheapest_parameterized_paths
struct Path * cheapest_unique_path
struct Path * cheapest_startup_path
struct Path * cheapest_total_path
PathTarget * copy_pathtarget(PathTarget *src)