PostgreSQL Source Code git master
pathnode.h
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * pathnode.h
4 * prototypes for pathnode.c, relnode.c.
5 *
6 *
7 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
9 *
10 * src/include/optimizer/pathnode.h
11 *
12 *-------------------------------------------------------------------------
13 */
14#ifndef PATHNODE_H
15#define PATHNODE_H
16
17#include "nodes/bitmapset.h"
18#include "nodes/pathnodes.h"
19
20
21/*
22 * prototypes for pathnode.c
23 */
24extern int compare_path_costs(Path *path1, Path *path2,
25 CostSelector criterion);
26extern int compare_fractional_path_costs(Path *path1, Path *path2,
27 double fraction);
28extern void set_cheapest(RelOptInfo *parent_rel);
29extern void add_path(RelOptInfo *parent_rel, Path *new_path);
30extern bool add_path_precheck(RelOptInfo *parent_rel, int disabled_nodes,
31 Cost startup_cost, Cost total_cost,
32 List *pathkeys, Relids required_outer);
33extern void add_partial_path(RelOptInfo *parent_rel, Path *new_path);
34extern bool add_partial_path_precheck(RelOptInfo *parent_rel,
35 int disabled_nodes,
36 Cost total_cost, List *pathkeys);
37
39 Relids required_outer, int parallel_workers);
41 Relids required_outer);
44 List *indexclauses,
45 List *indexorderbys,
46 List *indexorderbycols,
47 List *pathkeys,
48 ScanDirection indexscandir,
49 bool indexonly,
50 Relids required_outer,
51 double loop_count,
52 bool partial_path);
54 RelOptInfo *rel,
55 Path *bitmapqual,
56 Relids required_outer,
57 double loop_count,
58 int parallel_degree);
60 RelOptInfo *rel,
61 List *bitmapquals);
63 RelOptInfo *rel,
64 List *bitmapquals);
66 List *tidquals, Relids required_outer);
68 RelOptInfo *rel,
69 List *tidrangequals,
70 Relids required_outer);
72 List *subpaths, List *partial_subpaths,
73 List *pathkeys, Relids required_outer,
74 int parallel_workers, bool parallel_aware,
75 double rows);
77 RelOptInfo *rel,
78 List *subpaths,
79 List *pathkeys,
80 Relids required_outer);
82 RelOptInfo *rel,
83 PathTarget *target,
84 List *havingqual);
87 RelOptInfo *rel,
89 List *param_exprs,
90 List *hash_operators,
91 bool singlerow,
92 bool binary_mode,
93 Cardinality est_calls);
95 RelOptInfo *rel, Path *subpath, PathTarget *target,
96 Relids required_outer, double *rows);
98 RelOptInfo *rel,
100 PathTarget *target,
101 List *pathkeys,
102 Relids required_outer,
103 double *rows);
105 RelOptInfo *rel,
106 Path *subpath,
107 bool trivial_pathtarget,
108 List *pathkeys,
109 Relids required_outer);
111 List *pathkeys, Relids required_outer);
113 Relids required_outer);
115 Relids required_outer);
117 List *pathkeys, Relids required_outer);
119 Relids required_outer);
121 Relids required_outer);
123 Relids required_outer);
125 PathTarget *target,
126 double rows, int disabled_nodes,
127 Cost startup_cost, Cost total_cost,
128 List *pathkeys,
129 Relids required_outer,
130 Path *fdw_outerpath,
131 List *fdw_restrictinfo,
132 List *fdw_private);
134 PathTarget *target,
135 double rows, int disabled_nodes,
136 Cost startup_cost, Cost total_cost,
137 List *pathkeys,
138 Relids required_outer,
139 Path *fdw_outerpath,
140 List *fdw_restrictinfo,
141 List *fdw_private);
143 PathTarget *target,
144 double rows, int disabled_nodes,
145 Cost startup_cost, Cost total_cost,
146 List *pathkeys,
147 Path *fdw_outerpath,
148 List *fdw_restrictinfo,
149 List *fdw_private);
150
152 Relids outer_paramrels,
153 Relids innerrelids,
154 Relids inner_paramrels);
155extern Relids calc_non_nestloop_required_outer(Path *outer_path, Path *inner_path);
156
158 RelOptInfo *joinrel,
159 JoinType jointype,
160 JoinCostWorkspace *workspace,
161 JoinPathExtraData *extra,
162 Path *outer_path,
163 Path *inner_path,
164 List *restrict_clauses,
165 List *pathkeys,
166 Relids required_outer);
167
169 RelOptInfo *joinrel,
170 JoinType jointype,
171 JoinCostWorkspace *workspace,
172 JoinPathExtraData *extra,
173 Path *outer_path,
174 Path *inner_path,
175 List *restrict_clauses,
176 List *pathkeys,
177 Relids required_outer,
178 List *mergeclauses,
179 List *outersortkeys,
180 List *innersortkeys,
181 int outer_presorted_keys);
182
184 RelOptInfo *joinrel,
185 JoinType jointype,
186 JoinCostWorkspace *workspace,
187 JoinPathExtraData *extra,
188 Path *outer_path,
189 Path *inner_path,
190 bool parallel_hash,
191 List *restrict_clauses,
192 Relids required_outer,
193 List *hashclauses);
194
196 RelOptInfo *rel,
197 Path *subpath,
198 PathTarget *target);
200 RelOptInfo *rel,
201 Path *path,
202 PathTarget *target);
204 RelOptInfo *rel,
205 Path *subpath,
206 PathTarget *target);
208 RelOptInfo *rel,
209 Path *subpath,
210 List *pathkeys,
211 double limit_tuples);
213 RelOptInfo *rel,
214 Path *subpath,
215 List *pathkeys,
216 int presorted_keys,
217 double limit_tuples);
219 RelOptInfo *rel,
220 Path *subpath,
221 List *groupClause,
222 List *qual,
223 double numGroups);
225 RelOptInfo *rel,
226 Path *subpath,
227 int numCols,
228 double numGroups);
230 RelOptInfo *rel,
231 Path *subpath,
232 PathTarget *target,
233 AggStrategy aggstrategy,
234 AggSplit aggsplit,
235 List *groupClause,
236 List *qual,
237 const AggClauseCosts *aggcosts,
238 double numGroups);
240 RelOptInfo *rel,
241 Path *subpath,
242 List *having_qual,
243 AggStrategy aggstrategy,
244 List *rollups,
245 const AggClauseCosts *agg_costs);
247 RelOptInfo *rel,
248 PathTarget *target,
249 List *mmaggregates,
250 List *quals);
252 RelOptInfo *rel,
253 Path *subpath,
254 PathTarget *target,
255 List *windowFuncs,
256 List *runCondition,
257 WindowClause *winclause,
258 List *qual,
259 bool topwindow);
261 RelOptInfo *rel,
262 Path *leftpath,
263 Path *rightpath,
264 SetOpCmd cmd,
265 SetOpStrategy strategy,
266 List *groupList,
267 double numGroups,
268 double outputRows);
270 RelOptInfo *rel,
271 Path *leftpath,
272 Path *rightpath,
273 PathTarget *target,
274 List *distinctList,
275 int wtParam,
276 double numGroups);
278 Path *subpath, List *rowMarks, int epqParam);
280 RelOptInfo *rel,
281 Path *subpath,
282 CmdType operation, bool canSetTag,
283 Index nominalRelation, Index rootRelation,
284 List *resultRelations,
285 List *updateColnosLists,
286 List *withCheckOptionLists, List *returningLists,
287 List *rowMarks, OnConflictExpr *onconflict,
288 List *mergeActionLists, List *mergeJoinConditions,
289 int epqParam);
291 Path *subpath,
292 Node *limitOffset, Node *limitCount,
293 LimitOption limitOption,
294 int64 offset_est, int64 count_est);
295extern void adjust_limit_rows_costs(double *rows,
296 Cost *startup_cost, Cost *total_cost,
297 int64 offset_est, int64 count_est);
298
300 Relids required_outer,
301 double loop_count);
303 RelOptInfo *child_rel);
305 RelOptInfo *child_rel);
306
307/*
308 * prototypes for relnode.c
309 */
312extern RelOptInfo *build_simple_rel(PlannerInfo *root, int relid,
313 RelOptInfo *parent);
316extern RelOptInfo *find_base_rel(PlannerInfo *root, int relid);
321 Relids joinrelids,
322 RelOptInfo *outer_rel,
323 RelOptInfo *inner_rel,
324 SpecialJoinInfo *sjinfo,
325 List *pushed_down_joins,
326 List **restrictlist_ptr);
328 Relids joinrelids,
329 RelOptInfo *outer_rel,
330 RelOptInfo *inner_rel);
332 Relids relids);
335 RelOptInfo *baserel,
336 Relids required_outer);
338 RelOptInfo *joinrel,
339 Path *outer_path,
340 Path *inner_path,
341 SpecialJoinInfo *sjinfo,
342 Relids required_outer,
343 List **restrict_clauses);
345 Relids required_outer);
347 Relids required_outer);
350 RelOptInfo *outer_rel, RelOptInfo *inner_rel,
351 RelOptInfo *parent_joinrel, List *restrictlist,
352 SpecialJoinInfo *sjinfo,
353 int nappinfos, AppendRelInfo **appinfos);
354
356 bool calculate_grouped_rows);
357#endif /* PATHNODE_H */
int64_t int64
Definition: c.h:540
unsigned int Index
Definition: c.h:624
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:311
SetOpCmd
Definition: nodes.h:407
SetOpStrategy
Definition: nodes.h:415
double Cost
Definition: nodes.h:261
double Cardinality
Definition: nodes.h:262
CmdType
Definition: nodes.h:273
AggStrategy
Definition: nodes.h:363
AggSplit
Definition: nodes.h:385
LimitOption
Definition: nodes.h:440
JoinType
Definition: nodes.h:298
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:529
void setup_simple_rel_arrays(PlannerInfo *root)
Definition: relnode.c:108
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1978
TidRangePath * create_tidrangescan_path(PlannerInfo *root, RelOptInfo *rel, List *tidrangequals, Relids required_outer)
Definition: pathnode.c:1264
Relids calc_non_nestloop_required_outer(Path *outer_path, Path *inner_path)
Definition: pathnode.c:2241
ForeignPath * create_foreign_upper_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, int disabled_nodes, Cost startup_cost, Cost total_cost, List *pathkeys, Path *fdw_outerpath, List *fdw_restrictinfo, List *fdw_private)
Definition: pathnode.c:2167
BitmapAndPath * create_bitmap_and_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
Definition: pathnode.c:1131
RelOptInfo * build_grouped_rel(PlannerInfo *root, RelOptInfo *rel)
Definition: relnode.c:484
Path * create_functionscan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1876
bool path_is_reparameterizable_by_child(Path *path, RelOptInfo *child_rel)
Definition: pathnode.c:4315
MemoizePath * create_memoize_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *param_exprs, List *hash_operators, bool singlerow, bool binary_mode, Cardinality est_calls)
Definition: pathnode.c:1690
RelOptInfo * build_child_join_rel(PlannerInfo *root, RelOptInfo *outer_rel, RelOptInfo *inner_rel, RelOptInfo *parent_joinrel, List *restrictlist, SpecialJoinInfo *sjinfo, int nappinfos, AppendRelInfo **appinfos)
Definition: relnode.c:1001
Path * create_valuesscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1928
MinMaxAggPath * create_minmaxagg_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *mmaggregates, List *quals)
Definition: pathnode.c:3239
Path * create_worktablescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2032
SetOpPath * create_setop_path(PlannerInfo *root, RelOptInfo *rel, Path *leftpath, Path *rightpath, SetOpCmd cmd, SetOpStrategy strategy, List *groupList, double numGroups, double outputRows)
Definition: pathnode.c:3403
ModifyTablePath * create_modifytable_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, CmdType operation, bool canSetTag, Index nominalRelation, Index rootRelation, List *resultRelations, List *updateColnosLists, List *withCheckOptionLists, List *returningLists, List *rowMarks, OnConflictExpr *onconflict, List *mergeActionLists, List *mergeJoinConditions, int epqParam)
Definition: pathnode.c:3629
Relids calc_nestloop_required_outer(Relids outerrelids, Relids outer_paramrels, Relids innerrelids, Relids inner_paramrels)
Definition: pathnode.c:2214
RelOptInfo * find_base_rel_noerr(PlannerInfo *root, int relid)
Definition: relnode.c:551
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)
Definition: pathnode.c:1049
Relids min_join_parameterization(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:1145
ProjectSetPath * create_set_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
Definition: pathnode.c:2722
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:642
ProjectionPath * create_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
Definition: pathnode.c:2524
ParamPathInfo * get_joinrel_parampathinfo(PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
Definition: relnode.c:1781
WindowAggPath * create_windowagg_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *windowFuncs, List *runCondition, WindowClause *winclause, List *qual, bool topwindow)
Definition: pathnode.c:3330
Path * reparameterize_path_by_child(PlannerInfo *root, Path *path, RelOptInfo *child_rel)
Definition: pathnode.c:4019
LockRowsPath * create_lockrows_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *rowMarks, int epqParam)
Definition: pathnode.c:3567
Path * apply_projection_to_path(PlannerInfo *root, RelOptInfo *rel, Path *path, PathTarget *target)
Definition: pathnode.c:2633
Path * create_seqscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer, int parallel_workers)
Definition: pathnode.c:983
GatherMergePath * create_gather_merge_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
Definition: pathnode.c:1750
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)
Definition: pathnode.c:2458
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:270
Relids find_childrel_parents(PlannerInfo *root, RelOptInfo *rel)
Definition: relnode.c:1631
void expand_planner_arrays(PlannerInfo *root, int add_size)
Definition: relnode.c:177
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1667
RelOptInfo * build_simple_grouped_rel(PlannerInfo *root, RelOptInfo *rel)
Definition: relnode.c:433
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:795
LimitPath * create_limit_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, Node *limitOffset, Node *limitCount, LimitOption limitOption, int64 offset_est, int64 count_est)
Definition: pathnode.c:3729
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)
Definition: pathnode.c:1300
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1581
Path * create_namedtuplestorescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1980
SubqueryScanPath * create_subqueryscan_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, bool trivial_pathtarget, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1846
int compare_fractional_path_costs(Path *path1, Path *path2, double fraction)
Definition: pathnode.c:125
RelOptInfo * build_join_rel(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List *pushed_down_joins, List **restrictlist_ptr)
Definition: relnode.c:780
IncrementalSortPath * create_incremental_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, int presorted_keys, double limit_tuples)
Definition: pathnode.c:2792
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
Definition: relnode.c:206
BitmapOrPath * create_bitmap_or_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
Definition: pathnode.c:1183
GroupingSetsPath * create_groupingsets_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *having_qual, AggStrategy aggstrategy, List *rollups, const AggClauseCosts *agg_costs)
Definition: pathnode.c:3076
RelAggInfo * create_rel_agg_info(PlannerInfo *root, RelOptInfo *rel, bool calculate_grouped_rows)
Definition: relnode.c:2655
BitmapHeapPath * create_bitmap_heap_path(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual, Relids required_outer, double loop_count, int parallel_degree)
Definition: pathnode.c:1098
ParamPathInfo * find_param_path_info(RelOptInfo *rel, Relids required_outer)
Definition: relnode.c:2011
Path * create_tablefuncscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1902
SortPath * create_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, double limit_tuples)
Definition: pathnode.c:2841
GroupPath * create_group_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *groupClause, List *qual, double numGroups)
Definition: pathnode.c:2885
ForeignPath * create_foreignscan_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, int disabled_nodes, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer, Path *fdw_outerpath, List *fdw_restrictinfo, List *fdw_private)
Definition: pathnode.c:2065
TidPath * create_tidscan_path(PlannerInfo *root, RelOptInfo *rel, List *tidquals, Relids required_outer)
Definition: pathnode.c:1235
GatherPath * create_gather_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, Relids required_outer, double *rows)
Definition: pathnode.c:1802
Path * create_samplescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1008
MaterialPath * create_material_path(RelOptInfo *rel, Path *subpath)
Definition: pathnode.c:1657
ForeignPath * create_foreign_join_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, int disabled_nodes, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer, Path *fdw_outerpath, List *fdw_restrictinfo, List *fdw_private)
Definition: pathnode.c:2113
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:461
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:70
bool add_path_precheck(RelOptInfo *parent_rel, int disabled_nodes, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer)
Definition: pathnode.c:688
Path * create_resultscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2006
Bitmapset * get_param_path_clause_serials(Path *path)
Definition: relnode.c:2032
void adjust_limit_rows_costs(double *rows, Cost *startup_cost, Cost *total_cost, int64 offset_est, int64 count_est)
Definition: pathnode.c:3785
Path * create_ctescan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1954
UniquePath * create_unique_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, int numCols, double numGroups)
Definition: pathnode.c:2942
RelOptInfo * find_base_rel_ignore_join(PlannerInfo *root, int relid)
Definition: relnode.c:569
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)
Definition: pathnode.c:2994
bool add_partial_path_precheck(RelOptInfo *parent_rel, int disabled_nodes, Cost total_cost, List *pathkeys)
Definition: pathnode.c:921
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, int outer_presorted_keys)
Definition: pathnode.c:2390
RecursiveUnionPath * create_recursiveunion_path(PlannerInfo *root, RelOptInfo *rel, Path *leftpath, Path *rightpath, PathTarget *target, List *distinctList, int wtParam, double numGroups)
Definition: pathnode.c:3522
GroupResultPath * create_group_result_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *havingqual)
Definition: pathnode.c:1609
MergeAppendPath * create_merge_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1471
Path * reparameterize_path(PlannerInfo *root, Path *path, Relids required_outer, double loop_count)
Definition: pathnode.c:3853
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)
Definition: pathnode.c:2293
CostSelector
Definition: pathnodes.h:37
UpperRelationKind
Definition: pathnodes.h:70
tree ctl root
Definition: radixtree.h:1857
ScanDirection
Definition: sdir.h:25
Size add_size(Size s1, Size s2)
Definition: shmem.c:494
Definition: pg_list.h:54
Definition: nodes.h:135
Definition: type.h:96