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 double calls);
95 Path *subpath, SpecialJoinInfo *sjinfo);
97 RelOptInfo *rel, Path *subpath, PathTarget *target,
98 Relids required_outer, double *rows);
100 RelOptInfo *rel,
101 Path *subpath,
102 PathTarget *target,
103 List *pathkeys,
104 Relids required_outer,
105 double *rows);
107 RelOptInfo *rel,
108 Path *subpath,
109 bool trivial_pathtarget,
110 List *pathkeys,
111 Relids required_outer);
113 List *pathkeys, Relids required_outer);
115 Relids required_outer);
117 Relids required_outer);
119 List *pathkeys, Relids required_outer);
121 Relids required_outer);
123 Relids required_outer);
125 Relids required_outer);
127 PathTarget *target,
128 double rows, int disabled_nodes,
129 Cost startup_cost, Cost total_cost,
130 List *pathkeys,
131 Relids required_outer,
132 Path *fdw_outerpath,
133 List *fdw_restrictinfo,
134 List *fdw_private);
136 PathTarget *target,
137 double rows, int disabled_nodes,
138 Cost startup_cost, Cost total_cost,
139 List *pathkeys,
140 Relids required_outer,
141 Path *fdw_outerpath,
142 List *fdw_restrictinfo,
143 List *fdw_private);
145 PathTarget *target,
146 double rows, int disabled_nodes,
147 Cost startup_cost, Cost total_cost,
148 List *pathkeys,
149 Path *fdw_outerpath,
150 List *fdw_restrictinfo,
151 List *fdw_private);
152
154 Relids outer_paramrels,
155 Relids innerrelids,
156 Relids inner_paramrels);
157extern Relids calc_non_nestloop_required_outer(Path *outer_path, Path *inner_path);
158
160 RelOptInfo *joinrel,
161 JoinType jointype,
162 JoinCostWorkspace *workspace,
163 JoinPathExtraData *extra,
164 Path *outer_path,
165 Path *inner_path,
166 List *restrict_clauses,
167 List *pathkeys,
168 Relids required_outer);
169
171 RelOptInfo *joinrel,
172 JoinType jointype,
173 JoinCostWorkspace *workspace,
174 JoinPathExtraData *extra,
175 Path *outer_path,
176 Path *inner_path,
177 List *restrict_clauses,
178 List *pathkeys,
179 Relids required_outer,
180 List *mergeclauses,
181 List *outersortkeys,
182 List *innersortkeys);
183
185 RelOptInfo *joinrel,
186 JoinType jointype,
187 JoinCostWorkspace *workspace,
188 JoinPathExtraData *extra,
189 Path *outer_path,
190 Path *inner_path,
191 bool parallel_hash,
192 List *restrict_clauses,
193 Relids required_outer,
194 List *hashclauses);
195
197 RelOptInfo *rel,
198 Path *subpath,
199 PathTarget *target);
201 RelOptInfo *rel,
202 Path *path,
203 PathTarget *target);
205 RelOptInfo *rel,
206 Path *subpath,
207 PathTarget *target);
209 RelOptInfo *rel,
210 Path *subpath,
211 List *pathkeys,
212 double limit_tuples);
214 RelOptInfo *rel,
215 Path *subpath,
216 List *pathkeys,
217 int presorted_keys,
218 double limit_tuples);
220 RelOptInfo *rel,
221 Path *subpath,
222 List *groupClause,
223 List *qual,
224 double numGroups);
226 RelOptInfo *rel,
227 Path *subpath,
228 int numCols,
229 double numGroups);
231 RelOptInfo *rel,
232 Path *subpath,
233 PathTarget *target,
234 AggStrategy aggstrategy,
235 AggSplit aggsplit,
236 List *groupClause,
237 List *qual,
238 const AggClauseCosts *aggcosts,
239 double numGroups);
241 RelOptInfo *rel,
242 Path *subpath,
243 List *having_qual,
244 AggStrategy aggstrategy,
245 List *rollups,
246 const AggClauseCosts *agg_costs);
248 RelOptInfo *rel,
249 PathTarget *target,
250 List *mmaggregates,
251 List *quals);
253 RelOptInfo *rel,
254 Path *subpath,
255 PathTarget *target,
256 List *windowFuncs,
257 List *runCondition,
258 WindowClause *winclause,
259 List *qual,
260 bool topwindow);
262 RelOptInfo *rel,
263 Path *leftpath,
264 Path *rightpath,
265 SetOpCmd cmd,
266 SetOpStrategy strategy,
267 List *groupList,
268 double numGroups,
269 double outputRows);
271 RelOptInfo *rel,
272 Path *leftpath,
273 Path *rightpath,
274 PathTarget *target,
275 List *distinctList,
276 int wtParam,
277 double numGroups);
279 Path *subpath, List *rowMarks, int epqParam);
281 RelOptInfo *rel,
282 Path *subpath,
283 CmdType operation, bool canSetTag,
284 Index nominalRelation, Index rootRelation,
285 bool partColsUpdated,
286 List *resultRelations,
287 List *updateColnosLists,
288 List *withCheckOptionLists, List *returningLists,
289 List *rowMarks, OnConflictExpr *onconflict,
290 List *mergeActionLists, List *mergeJoinConditions,
291 int epqParam);
293 Path *subpath,
294 Node *limitOffset, Node *limitCount,
295 LimitOption limitOption,
296 int64 offset_est, int64 count_est);
297extern void adjust_limit_rows_costs(double *rows,
298 Cost *startup_cost, Cost *total_cost,
299 int64 offset_est, int64 count_est);
300
302 Relids required_outer,
303 double loop_count);
305 RelOptInfo *child_rel);
307 RelOptInfo *child_rel);
308
309/*
310 * prototypes for relnode.c
311 */
314extern RelOptInfo *build_simple_rel(PlannerInfo *root, int relid,
315 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
355#endif /* PATHNODE_H */
int64_t int64
Definition: c.h:485
unsigned int Index
Definition: c.h:571
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:308
SetOpCmd
Definition: nodes.h:397
SetOpStrategy
Definition: nodes.h:405
double Cost
Definition: nodes.h:251
CmdType
Definition: nodes.h:263
AggStrategy
Definition: nodes.h:353
AggSplit
Definition: nodes.h:375
LimitOption
Definition: nodes.h:430
JoinType
Definition: nodes.h:288
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:414
void setup_simple_rel_arrays(PlannerInfo *root)
Definition: relnode.c:94
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1856
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:2483
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:2409
BitmapAndPath * create_bitmap_and_path(PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
Definition: pathnode.c:1131
Path * create_functionscan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
Definition: pathnode.c:2118
bool path_is_reparameterizable_by_child(Path *path, RelOptInfo *child_rel)
Definition: pathnode.c:4565
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:882
Path * create_valuesscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2170
MinMaxAggPath * create_minmaxagg_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *mmaggregates, List *quals)
Definition: pathnode.c:3486
Path * create_worktablescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2274
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:3650
Relids calc_nestloop_required_outer(Relids outerrelids, Relids outer_paramrels, Relids innerrelids, Relids inner_paramrels)
Definition: pathnode.c:2456
RelOptInfo * find_base_rel_noerr(PlannerInfo *root, int relid)
Definition: relnode.c:436
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:1022
MemoizePath * create_memoize_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *param_exprs, List *hash_operators, bool singlerow, bool binary_mode, double calls)
Definition: pathnode.c:1667
ProjectSetPath * create_set_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
Definition: pathnode.c:2962
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:527
ProjectionPath * create_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
Definition: pathnode.c:2763
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:1659
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:3577
Path * reparameterize_path_by_child(PlannerInfo *root, Path *path, RelOptInfo *child_rel)
Definition: pathnode.c:4269
LockRowsPath * create_lockrows_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *rowMarks, int epqParam)
Definition: pathnode.c:3813
Path * apply_projection_to_path(PlannerInfo *root, RelOptInfo *rel, Path *path, PathTarget *target)
Definition: pathnode.c:2873
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:1962
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:2697
UniquePath * create_unique_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, SpecialJoinInfo *sjinfo)
Definition: pathnode.c:1727
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:269
Relids find_childrel_parents(PlannerInfo *root, RelOptInfo *rel)
Definition: relnode.c:1509
void expand_planner_arrays(PlannerInfo *root, int add_size)
Definition: relnode.c:163
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1545
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:3979
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:1458
Path * create_namedtuplestorescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2222
SubqueryScanPath * create_subqueryscan_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, bool trivial_pathtarget, List *pathkeys, Relids required_outer)
Definition: pathnode.c:2088
int compare_fractional_path_costs(Path *path1, Path *path2, double fraction)
Definition: pathnode.c:124
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:665
IncrementalSortPath * create_incremental_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, int presorted_keys, double limit_tuples)
Definition: pathnode.c:3032
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
Definition: relnode.c:192
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:3323
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:1889
Path * create_tablefuncscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2144
SortPath * create_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, double limit_tuples)
Definition: pathnode.c:3082
GroupPath * create_group_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *groupClause, List *qual, double numGroups)
Definition: pathnode.c:3127
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:2307
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:2044
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:1634
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:2355
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:69
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:2248
Bitmapset * get_param_path_clause_serials(Path *path)
Definition: relnode.c:1910
UpperUniquePath * create_upper_unique_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, int numCols, double numGroups)
Definition: pathnode.c:3187
void adjust_limit_rows_costs(double *rows, Cost *startup_cost, Cost *total_cost, int64 offset_est, int64 count_est)
Definition: pathnode.c:4035
Path * create_ctescan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
Definition: pathnode.c:2196
RelOptInfo * find_base_rel_ignore_join(PlannerInfo *root, int relid)
Definition: relnode.c:454
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:3240
bool add_partial_path_precheck(RelOptInfo *parent_rel, int disabled_nodes, Cost total_cost, List *pathkeys)
Definition: pathnode.c:921
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, List *mergeJoinConditions, int epqParam)
Definition: pathnode.c:3877
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)
Definition: pathnode.c:2631
RecursiveUnionPath * create_recursiveunion_path(PlannerInfo *root, RelOptInfo *rel, Path *leftpath, Path *rightpath, PathTarget *target, List *distinctList, int wtParam, double numGroups)
Definition: pathnode.c:3768
GroupResultPath * create_group_result_path(PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *havingqual)
Definition: pathnode.c:1586
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:4103
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:2535
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:488
Definition: pg_list.h:54
Definition: nodes.h:129
Definition: type.h:96