Branch data Line data Source code
1 : : /*-------------------------------------------------------------------------
2 : : *
3 : : * pathnode.c
4 : : * Routines to manipulate pathlists and create path nodes
5 : : *
6 : : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
7 : : * Portions Copyright (c) 1994, Regents of the University of California
8 : : *
9 : : *
10 : : * IDENTIFICATION
11 : : * src/backend/optimizer/util/pathnode.c
12 : : *
13 : : *-------------------------------------------------------------------------
14 : : */
15 : : #include "postgres.h"
16 : :
17 : : #include "access/htup_details.h"
18 : : #include "executor/nodeSetOp.h"
19 : : #include "foreign/fdwapi.h"
20 : : #include "miscadmin.h"
21 : : #include "nodes/extensible.h"
22 : : #include "optimizer/appendinfo.h"
23 : : #include "optimizer/clauses.h"
24 : : #include "optimizer/cost.h"
25 : : #include "optimizer/optimizer.h"
26 : : #include "optimizer/pathnode.h"
27 : : #include "optimizer/paths.h"
28 : : #include "optimizer/planmain.h"
29 : : #include "optimizer/tlist.h"
30 : : #include "parser/parsetree.h"
31 : : #include "utils/memutils.h"
32 : : #include "utils/selfuncs.h"
33 : :
34 : : typedef enum
35 : : {
36 : : COSTS_EQUAL, /* path costs are fuzzily equal */
37 : : COSTS_BETTER1, /* first path is cheaper than second */
38 : : COSTS_BETTER2, /* second path is cheaper than first */
39 : : COSTS_DIFFERENT, /* neither path dominates the other on cost */
40 : : } PathCostComparison;
41 : :
42 : : /*
43 : : * STD_FUZZ_FACTOR is the normal fuzz factor for compare_path_costs_fuzzily.
44 : : * XXX is it worth making this user-controllable? It provides a tradeoff
45 : : * between planner runtime and the accuracy of path cost comparisons.
46 : : */
47 : : #define STD_FUZZ_FACTOR 1.01
48 : :
49 : : static int append_total_cost_compare(const ListCell *a, const ListCell *b);
50 : : static int append_startup_cost_compare(const ListCell *a, const ListCell *b);
51 : : static List *reparameterize_pathlist_by_child(PlannerInfo *root,
52 : : List *pathlist,
53 : : RelOptInfo *child_rel);
54 : : static bool pathlist_is_reparameterizable_by_child(List *pathlist,
55 : : RelOptInfo *child_rel);
56 : :
57 : :
58 : : /*****************************************************************************
59 : : * MISC. PATH UTILITIES
60 : : *****************************************************************************/
61 : :
62 : : /*
63 : : * compare_path_costs
64 : : * Return -1, 0, or +1 according as path1 is cheaper, the same cost,
65 : : * or more expensive than path2 for the specified criterion.
66 : : */
67 : : int
68 : 875504 : compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
69 : : {
70 : : /* Number of disabled nodes, if different, trumps all else. */
71 [ + + ]: 875504 : if (unlikely(path1->disabled_nodes != path2->disabled_nodes))
72 : : {
73 [ + + ]: 74000 : if (path1->disabled_nodes < path2->disabled_nodes)
74 : 73992 : return -1;
75 : : else
76 : 8 : return +1;
77 : : }
78 : :
79 [ + + ]: 801504 : if (criterion == STARTUP_COST)
80 : : {
81 [ + + ]: 408463 : if (path1->startup_cost < path2->startup_cost)
82 : 241664 : return -1;
83 [ + + ]: 166799 : if (path1->startup_cost > path2->startup_cost)
84 : 79424 : return +1;
85 : :
86 : : /*
87 : : * If paths have the same startup cost (not at all unlikely), order
88 : : * them by total cost.
89 : : */
90 [ + + ]: 87375 : if (path1->total_cost < path2->total_cost)
91 : 42403 : return -1;
92 [ + + ]: 44972 : if (path1->total_cost > path2->total_cost)
93 : 4443 : return +1;
94 : : }
95 : : else
96 : : {
97 [ + + ]: 393041 : if (path1->total_cost < path2->total_cost)
98 : 365403 : return -1;
99 [ + + ]: 27638 : if (path1->total_cost > path2->total_cost)
100 : 7266 : return +1;
101 : :
102 : : /*
103 : : * If paths have the same total cost, order them by startup cost.
104 : : */
105 [ + + ]: 20372 : if (path1->startup_cost < path2->startup_cost)
106 : 1493 : return -1;
107 [ + + ]: 18879 : if (path1->startup_cost > path2->startup_cost)
108 : 67 : return +1;
109 : : }
110 : 59341 : return 0;
111 : : }
112 : :
113 : : /*
114 : : * compare_fractional_path_costs
115 : : * Return -1, 0, or +1 according as path1 is cheaper, the same cost,
116 : : * or more expensive than path2 for fetching the specified fraction
117 : : * of the total tuples.
118 : : *
119 : : * If fraction is <= 0 or > 1, we interpret it as 1, ie, we select the
120 : : * path with the cheaper total_cost.
121 : : */
122 : : int
123 : 3850 : compare_fractional_path_costs(Path *path1, Path *path2,
124 : : double fraction)
125 : : {
126 : : Cost cost1,
127 : : cost2;
128 : :
129 : : /* Number of disabled nodes, if different, trumps all else. */
130 [ + + ]: 3850 : if (unlikely(path1->disabled_nodes != path2->disabled_nodes))
131 : : {
132 [ + - ]: 42 : if (path1->disabled_nodes < path2->disabled_nodes)
133 : 42 : return -1;
134 : : else
135 : 0 : return +1;
136 : : }
137 : :
138 [ + - + + ]: 3808 : if (fraction <= 0.0 || fraction >= 1.0)
139 : 1106 : return compare_path_costs(path1, path2, TOTAL_COST);
140 : 2702 : cost1 = path1->startup_cost +
141 : 2702 : fraction * (path1->total_cost - path1->startup_cost);
142 : 2702 : cost2 = path2->startup_cost +
143 : 2702 : fraction * (path2->total_cost - path2->startup_cost);
144 [ + + ]: 2702 : if (cost1 < cost2)
145 : 2280 : return -1;
146 [ + - ]: 422 : if (cost1 > cost2)
147 : 422 : return +1;
148 : 0 : return 0;
149 : : }
150 : :
151 : : /*
152 : : * compare_path_costs_fuzzily
153 : : * Compare the costs of two paths to see if either can be said to
154 : : * dominate the other.
155 : : *
156 : : * We use fuzzy comparisons so that add_path() can avoid keeping both of
157 : : * a pair of paths that really have insignificantly different cost.
158 : : *
159 : : * The fuzz_factor argument must be 1.0 plus delta, where delta is the
160 : : * fraction of the smaller cost that is considered to be a significant
161 : : * difference. For example, fuzz_factor = 1.01 makes the fuzziness limit
162 : : * be 1% of the smaller cost.
163 : : *
164 : : * The two paths are said to have "equal" costs if both startup and total
165 : : * costs are fuzzily the same. Path1 is said to be better than path2 if
166 : : * it has fuzzily better startup cost and fuzzily no worse total cost,
167 : : * or if it has fuzzily better total cost and fuzzily no worse startup cost.
168 : : * Path2 is better than path1 if the reverse holds. Finally, if one path
169 : : * is fuzzily better than the other on startup cost and fuzzily worse on
170 : : * total cost, we just say that their costs are "different", since neither
171 : : * dominates the other across the whole performance spectrum.
172 : : *
173 : : * This function also enforces a policy rule that paths for which the relevant
174 : : * one of parent->consider_startup and parent->consider_param_startup is false
175 : : * cannot survive comparisons solely on the grounds of good startup cost, so
176 : : * we never return COSTS_DIFFERENT when that is true for the total-cost loser.
177 : : * (But if total costs are fuzzily equal, we compare startup costs anyway,
178 : : * in hopes of eliminating one path or the other.)
179 : : */
180 : : static PathCostComparison
181 : 3615100 : compare_path_costs_fuzzily(Path *path1, Path *path2, double fuzz_factor)
182 : : {
183 : : #define CONSIDER_PATH_STARTUP_COST(p) \
184 : : ((p)->param_info == NULL ? (p)->parent->consider_startup : (p)->parent->consider_param_startup)
185 : :
186 : : /* Number of disabled nodes, if different, trumps all else. */
187 [ + + ]: 3615100 : if (unlikely(path1->disabled_nodes != path2->disabled_nodes))
188 : : {
189 [ + + ]: 173080 : if (path1->disabled_nodes < path2->disabled_nodes)
190 : 63049 : return COSTS_BETTER1;
191 : : else
192 : 110031 : return COSTS_BETTER2;
193 : : }
194 : :
195 : : /*
196 : : * Check total cost first since it's more likely to be different; many
197 : : * paths have zero startup cost.
198 : : */
199 [ + + ]: 3442020 : if (path1->total_cost > path2->total_cost * fuzz_factor)
200 : : {
201 : : /* path1 fuzzily worse on total cost */
202 [ + + + + ]: 1770040 : if (CONSIDER_PATH_STARTUP_COST(path1) &&
203 [ + + ]: 76891 : path2->startup_cost > path1->startup_cost * fuzz_factor)
204 : : {
205 : : /* ... but path2 fuzzily worse on startup, so DIFFERENT */
206 : 48118 : return COSTS_DIFFERENT;
207 : : }
208 : : /* else path2 dominates */
209 : 1721922 : return COSTS_BETTER2;
210 : : }
211 [ + + ]: 1671980 : if (path2->total_cost > path1->total_cost * fuzz_factor)
212 : : {
213 : : /* path2 fuzzily worse on total cost */
214 [ + + + + ]: 848634 : if (CONSIDER_PATH_STARTUP_COST(path2) &&
215 [ + + ]: 32858 : path1->startup_cost > path2->startup_cost * fuzz_factor)
216 : : {
217 : : /* ... but path1 fuzzily worse on startup, so DIFFERENT */
218 : 21218 : return COSTS_DIFFERENT;
219 : : }
220 : : /* else path1 dominates */
221 : 827416 : return COSTS_BETTER1;
222 : : }
223 : : /* fuzzily the same on total cost ... */
224 [ + + ]: 823346 : if (path1->startup_cost > path2->startup_cost * fuzz_factor)
225 : : {
226 : : /* ... but path1 fuzzily worse on startup, so path2 wins */
227 : 263458 : return COSTS_BETTER2;
228 : : }
229 [ + + ]: 559888 : if (path2->startup_cost > path1->startup_cost * fuzz_factor)
230 : : {
231 : : /* ... but path2 fuzzily worse on startup, so path1 wins */
232 : 44726 : return COSTS_BETTER1;
233 : : }
234 : : /* fuzzily the same on both costs */
235 : 515162 : return COSTS_EQUAL;
236 : :
237 : : #undef CONSIDER_PATH_STARTUP_COST
238 : : }
239 : :
240 : : /*
241 : : * set_cheapest
242 : : * Find the minimum-cost paths from among a relation's paths,
243 : : * and save them in the rel's cheapest-path fields.
244 : : *
245 : : * cheapest_total_path is normally the cheapest-total-cost unparameterized
246 : : * path; but if there are no unparameterized paths, we assign it to be the
247 : : * best (cheapest least-parameterized) parameterized path. However, only
248 : : * unparameterized paths are considered candidates for cheapest_startup_path,
249 : : * so that will be NULL if there are no unparameterized paths.
250 : : *
251 : : * The cheapest_parameterized_paths list collects all parameterized paths
252 : : * that have survived the add_path() tournament for this relation. (Since
253 : : * add_path ignores pathkeys for a parameterized path, these will be paths
254 : : * that have best cost or best row count for their parameterization. We
255 : : * may also have both a parallel-safe and a non-parallel-safe path in some
256 : : * cases for the same parameterization in some cases, but this should be
257 : : * relatively rare since, most typically, all paths for the same relation
258 : : * will be parallel-safe or none of them will.)
259 : : *
260 : : * cheapest_parameterized_paths always includes the cheapest-total
261 : : * unparameterized path, too, if there is one; the users of that list find
262 : : * it more convenient if that's included.
263 : : *
264 : : * This is normally called only after we've finished constructing the path
265 : : * list for the rel node.
266 : : */
267 : : void
268 : 1592995 : set_cheapest(RelOptInfo *parent_rel)
269 : : {
270 : : Path *cheapest_startup_path;
271 : : Path *cheapest_total_path;
272 : : Path *best_param_path;
273 : : List *parameterized_paths;
274 : : ListCell *p;
275 : :
276 : : Assert(IsA(parent_rel, RelOptInfo));
277 : :
278 [ - + ]: 1592995 : if (parent_rel->pathlist == NIL)
279 [ # # ]: 0 : elog(ERROR, "could not devise a query plan for the given query");
280 : :
281 : 1592995 : cheapest_startup_path = cheapest_total_path = best_param_path = NULL;
282 : 1592995 : parameterized_paths = NIL;
283 : :
284 [ + - + + : 3640349 : foreach(p, parent_rel->pathlist)
+ + ]
285 : : {
286 : 2047354 : Path *path = (Path *) lfirst(p);
287 : : int cmp;
288 : :
289 [ + + ]: 2047354 : if (path->param_info)
290 : : {
291 : : /* Parameterized path, so add it to parameterized_paths */
292 : 109142 : parameterized_paths = lappend(parameterized_paths, path);
293 : :
294 : : /*
295 : : * If we have an unparameterized cheapest-total, we no longer care
296 : : * about finding the best parameterized path, so move on.
297 : : */
298 [ + + ]: 109142 : if (cheapest_total_path)
299 : 24276 : continue;
300 : :
301 : : /*
302 : : * Otherwise, track the best parameterized path, which is the one
303 : : * with least total cost among those of the minimum
304 : : * parameterization.
305 : : */
306 [ + + ]: 84866 : if (best_param_path == NULL)
307 : 75817 : best_param_path = path;
308 : : else
309 : : {
310 [ + - + + : 9049 : switch (bms_subset_compare(PATH_REQ_OUTER(path),
+ + - ]
311 [ + - ]: 9049 : PATH_REQ_OUTER(best_param_path)))
312 : : {
313 : 45 : case BMS_EQUAL:
314 : : /* keep the cheaper one */
315 [ - + ]: 45 : if (compare_path_costs(path, best_param_path,
316 : : TOTAL_COST) < 0)
317 : 0 : best_param_path = path;
318 : 45 : break;
319 : 987 : case BMS_SUBSET1:
320 : : /* new path is less-parameterized */
321 : 987 : best_param_path = path;
322 : 987 : break;
323 : 20 : case BMS_SUBSET2:
324 : : /* old path is less-parameterized, keep it */
325 : 20 : break;
326 : 7997 : case BMS_DIFFERENT:
327 : :
328 : : /*
329 : : * This means that neither path has the least possible
330 : : * parameterization for the rel. We'll sit on the old
331 : : * path until something better comes along.
332 : : */
333 : 7997 : break;
334 : : }
335 : : }
336 : : }
337 : : else
338 : : {
339 : : /* Unparameterized path, so consider it for cheapest slots */
340 [ + + ]: 1938212 : if (cheapest_total_path == NULL)
341 : : {
342 : 1584287 : cheapest_startup_path = cheapest_total_path = path;
343 : 1584287 : continue;
344 : : }
345 : :
346 : : /*
347 : : * If we find two paths of identical costs, try to keep the
348 : : * better-sorted one. The paths might have unrelated sort
349 : : * orderings, in which case we can only guess which might be
350 : : * better to keep, but if one is superior then we definitely
351 : : * should keep that one.
352 : : */
353 : 353925 : cmp = compare_path_costs(cheapest_startup_path, path, STARTUP_COST);
354 [ + + + + ]: 353925 : if (cmp > 0 ||
355 [ - + ]: 1408 : (cmp == 0 &&
356 : 1408 : compare_pathkeys(cheapest_startup_path->pathkeys,
357 : : path->pathkeys) == PATHKEYS_BETTER2))
358 : 59883 : cheapest_startup_path = path;
359 : :
360 : 353925 : cmp = compare_path_costs(cheapest_total_path, path, TOTAL_COST);
361 [ + - + + ]: 353925 : if (cmp > 0 ||
362 [ - + ]: 974 : (cmp == 0 &&
363 : 974 : compare_pathkeys(cheapest_total_path->pathkeys,
364 : : path->pathkeys) == PATHKEYS_BETTER2))
365 : 0 : cheapest_total_path = path;
366 : : }
367 : : }
368 : :
369 : : /* Add cheapest unparameterized path, if any, to parameterized_paths */
370 [ + + ]: 1592995 : if (cheapest_total_path)
371 : 1584287 : parameterized_paths = lcons(cheapest_total_path, parameterized_paths);
372 : :
373 : : /*
374 : : * If there is no unparameterized path, use the best parameterized path as
375 : : * cheapest_total_path (but not as cheapest_startup_path).
376 : : */
377 [ + + ]: 1592995 : if (cheapest_total_path == NULL)
378 : 8708 : cheapest_total_path = best_param_path;
379 : : Assert(cheapest_total_path != NULL);
380 : :
381 : 1592995 : parent_rel->cheapest_startup_path = cheapest_startup_path;
382 : 1592995 : parent_rel->cheapest_total_path = cheapest_total_path;
383 : 1592995 : parent_rel->cheapest_parameterized_paths = parameterized_paths;
384 : 1592995 : }
385 : :
386 : : /*
387 : : * add_path
388 : : * Consider a potential implementation path for the specified parent rel,
389 : : * and add it to the rel's pathlist if it is worthy of consideration.
390 : : *
391 : : * A path is worthy if it has a better sort order (better pathkeys) or
392 : : * cheaper cost (as defined below), or generates fewer rows, than any
393 : : * existing path that has the same or superset parameterization rels. We
394 : : * also consider parallel-safe paths more worthy than others.
395 : : *
396 : : * Cheaper cost can mean either a cheaper total cost or a cheaper startup
397 : : * cost; if one path is cheaper in one of these aspects and another is
398 : : * cheaper in the other, we keep both. However, when some path type is
399 : : * disabled (e.g. due to enable_seqscan=false), the number of times that
400 : : * a disabled path type is used is considered to be a higher-order
401 : : * component of the cost. Hence, if path A uses no disabled path type,
402 : : * and path B uses 1 or more disabled path types, A is cheaper, no matter
403 : : * what we estimate for the startup and total costs. The startup and total
404 : : * cost essentially act as a tiebreak when comparing paths that use equal
405 : : * numbers of disabled path nodes; but in practice this tiebreak is almost
406 : : * always used, since normally no path types are disabled.
407 : : *
408 : : * In addition to possibly adding new_path, we also remove from the rel's
409 : : * pathlist any old paths that are dominated by new_path --- that is,
410 : : * new_path is cheaper, at least as well ordered, generates no more rows,
411 : : * requires no outer rels not required by the old path, and is no less
412 : : * parallel-safe.
413 : : *
414 : : * In most cases, a path with a superset parameterization will generate
415 : : * fewer rows (since it has more join clauses to apply), so that those two
416 : : * figures of merit move in opposite directions; this means that a path of
417 : : * one parameterization can seldom dominate a path of another. But such
418 : : * cases do arise, so we make the full set of checks anyway.
419 : : *
420 : : * There are two policy decisions embedded in this function, along with
421 : : * its sibling add_path_precheck. First, we treat all parameterized paths
422 : : * as having NIL pathkeys, so that they cannot win comparisons on the
423 : : * basis of sort order. This is to reduce the number of parameterized
424 : : * paths that are kept; see discussion in src/backend/optimizer/README.
425 : : *
426 : : * Second, we only consider cheap startup cost to be interesting if
427 : : * parent_rel->consider_startup is true for an unparameterized path, or
428 : : * parent_rel->consider_param_startup is true for a parameterized one.
429 : : * Again, this allows discarding useless paths sooner.
430 : : *
431 : : * The pathlist is kept sorted by disabled_nodes and then by total_cost,
432 : : * with cheaper paths at the front. Within this routine, that's simply a
433 : : * speed hack: doing it that way makes it more likely that we will reject
434 : : * an inferior path after a few comparisons, rather than many comparisons.
435 : : * However, add_path_precheck relies on this ordering to exit early
436 : : * when possible.
437 : : *
438 : : * NOTE: discarded Path objects are immediately pfree'd to reduce planner
439 : : * memory consumption. We dare not try to free the substructure of a Path,
440 : : * since much of it may be shared with other Paths or the query tree itself;
441 : : * but just recycling discarded Path nodes is a very useful savings in
442 : : * a large join tree. We can recycle the List nodes of pathlist, too.
443 : : *
444 : : * As noted in optimizer/README, deleting a previously-accepted Path is
445 : : * safe because we know that Paths of this rel cannot yet be referenced
446 : : * from any other rel, such as a higher-level join. However, in some cases
447 : : * it is possible that a Path is referenced by another Path for its own
448 : : * rel; we must not delete such a Path, even if it is dominated by the new
449 : : * Path. Currently this occurs only for IndexPath objects, which may be
450 : : * referenced as children of BitmapHeapPaths as well as being paths in
451 : : * their own right. Hence, we don't pfree IndexPaths when rejecting them.
452 : : *
453 : : * 'parent_rel' is the relation entry to which the path corresponds.
454 : : * 'new_path' is a potential path for parent_rel.
455 : : *
456 : : * Returns nothing, but modifies parent_rel->pathlist.
457 : : */
458 : : void
459 : 3483359 : add_path(RelOptInfo *parent_rel, Path *new_path)
460 : : {
461 : 3483359 : bool accept_new = true; /* unless we find a superior old path */
462 : 3483359 : int insert_at = 0; /* where to insert new item */
463 : : List *new_path_pathkeys;
464 : : ListCell *p1;
465 : :
466 : : /*
467 : : * This is a convenient place to check for query cancel --- no part of the
468 : : * planner goes very long without calling add_path().
469 : : */
470 [ + + ]: 3483359 : CHECK_FOR_INTERRUPTS();
471 : :
472 : : /* Pretend parameterized paths have no pathkeys, per comment above */
473 [ + + ]: 3483359 : new_path_pathkeys = new_path->param_info ? NIL : new_path->pathkeys;
474 : :
475 : : /*
476 : : * Loop to check proposed new path against old paths. Note it is possible
477 : : * for more than one old path to be tossed out because new_path dominates
478 : : * it.
479 : : */
480 [ + + + + : 5316597 : foreach(p1, parent_rel->pathlist)
+ + ]
481 : : {
482 : 3121343 : Path *old_path = (Path *) lfirst(p1);
483 : 3121343 : bool remove_old = false; /* unless new proves superior */
484 : : PathCostComparison costcmp;
485 : : PathKeysComparison keyscmp;
486 : : BMS_Comparison outercmp;
487 : :
488 : : /*
489 : : * Do a fuzzy cost comparison with standard fuzziness limit.
490 : : */
491 : 3121343 : costcmp = compare_path_costs_fuzzily(new_path, old_path,
492 : : STD_FUZZ_FACTOR);
493 : :
494 : : /*
495 : : * If the two paths compare differently for startup and total cost,
496 : : * then we want to keep both, and we can skip comparing pathkeys and
497 : : * required_outer rels. If they compare the same, proceed with the
498 : : * other comparisons. Row count is checked last. (We make the tests
499 : : * in this order because the cost comparison is most likely to turn
500 : : * out "different", and the pathkeys comparison next most likely. As
501 : : * explained above, row count very seldom makes a difference, so even
502 : : * though it's cheap to compare there's not much point in checking it
503 : : * earlier.)
504 : : */
505 [ + + ]: 3121343 : if (costcmp != COSTS_DIFFERENT)
506 : : {
507 : : /* Similarly check to see if either dominates on pathkeys */
508 : : List *old_path_pathkeys;
509 : :
510 [ + + ]: 3052462 : old_path_pathkeys = old_path->param_info ? NIL : old_path->pathkeys;
511 : 3052462 : keyscmp = compare_pathkeys(new_path_pathkeys,
512 : : old_path_pathkeys);
513 [ + + ]: 3052462 : if (keyscmp != PATHKEYS_DIFFERENT)
514 : : {
515 [ + + + - : 2915506 : switch (costcmp)
- ]
516 : : {
517 : 302469 : case COSTS_EQUAL:
518 [ + + ]: 302469 : outercmp = bms_subset_compare(PATH_REQ_OUTER(new_path),
519 [ + + ]: 302469 : PATH_REQ_OUTER(old_path));
520 [ + + ]: 302469 : if (keyscmp == PATHKEYS_BETTER1)
521 : : {
522 [ + + + - ]: 6780 : if ((outercmp == BMS_EQUAL ||
523 : 6780 : outercmp == BMS_SUBSET1) &&
524 [ + + ]: 6780 : new_path->rows <= old_path->rows &&
525 [ + - ]: 6725 : new_path->parallel_safe >= old_path->parallel_safe)
526 : 6725 : remove_old = true; /* new dominates old */
527 : : }
528 [ + + ]: 295689 : else if (keyscmp == PATHKEYS_BETTER2)
529 : : {
530 [ + + + - ]: 17396 : if ((outercmp == BMS_EQUAL ||
531 : 17396 : outercmp == BMS_SUBSET2) &&
532 [ + + ]: 17396 : new_path->rows >= old_path->rows &&
533 [ + - ]: 13721 : new_path->parallel_safe <= old_path->parallel_safe)
534 : 13721 : accept_new = false; /* old dominates new */
535 : : }
536 : : else /* keyscmp == PATHKEYS_EQUAL */
537 : : {
538 [ + + ]: 278293 : if (outercmp == BMS_EQUAL)
539 : : {
540 : : /*
541 : : * Same pathkeys and outer rels, and fuzzily
542 : : * the same cost, so keep just one; to decide
543 : : * which, first check parallel-safety, then
544 : : * rows, then do a fuzzy cost comparison with
545 : : * very small fuzz limit. (We used to do an
546 : : * exact cost comparison, but that results in
547 : : * annoying platform-specific plan variations
548 : : * due to roundoff in the cost estimates.) If
549 : : * things are still tied, arbitrarily keep
550 : : * only the old path. Notice that we will
551 : : * keep only the old path even if the
552 : : * less-fuzzy comparison decides the startup
553 : : * and total costs compare differently.
554 : : */
555 : 274194 : if (new_path->parallel_safe >
556 [ + + ]: 274194 : old_path->parallel_safe)
557 : 28 : remove_old = true; /* new dominates old */
558 : 274166 : else if (new_path->parallel_safe <
559 [ + + ]: 274166 : old_path->parallel_safe)
560 : 36 : accept_new = false; /* old dominates new */
561 [ + + ]: 274130 : else if (new_path->rows < old_path->rows)
562 : 39 : remove_old = true; /* new dominates old */
563 [ + + ]: 274091 : else if (new_path->rows > old_path->rows)
564 : 109 : accept_new = false; /* old dominates new */
565 [ + + ]: 273982 : else if (compare_path_costs_fuzzily(new_path,
566 : : old_path,
567 : : 1.0000000001) == COSTS_BETTER1)
568 : 11742 : remove_old = true; /* new dominates old */
569 : : else
570 : 262240 : accept_new = false; /* old equals or
571 : : * dominates new */
572 : : }
573 [ + + ]: 4099 : else if (outercmp == BMS_SUBSET1 &&
574 [ + + ]: 653 : new_path->rows <= old_path->rows &&
575 [ + - ]: 639 : new_path->parallel_safe >= old_path->parallel_safe)
576 : 639 : remove_old = true; /* new dominates old */
577 [ + + ]: 3460 : else if (outercmp == BMS_SUBSET2 &&
578 [ + + ]: 2690 : new_path->rows >= old_path->rows &&
579 [ + - ]: 2508 : new_path->parallel_safe <= old_path->parallel_safe)
580 : 2508 : accept_new = false; /* old dominates new */
581 : : /* else different parameterizations, keep both */
582 : : }
583 : 302469 : break;
584 : 834645 : case COSTS_BETTER1:
585 [ + + ]: 834645 : if (keyscmp != PATHKEYS_BETTER2)
586 : : {
587 [ + + ]: 567806 : outercmp = bms_subset_compare(PATH_REQ_OUTER(new_path),
588 [ + + ]: 567806 : PATH_REQ_OUTER(old_path));
589 [ + + + + ]: 567806 : if ((outercmp == BMS_EQUAL ||
590 : 487981 : outercmp == BMS_SUBSET1) &&
591 [ + + ]: 487981 : new_path->rows <= old_path->rows &&
592 [ + + ]: 484165 : new_path->parallel_safe >= old_path->parallel_safe)
593 : 481517 : remove_old = true; /* new dominates old */
594 : : }
595 : 834645 : break;
596 : 1778392 : case COSTS_BETTER2:
597 [ + + ]: 1778392 : if (keyscmp != PATHKEYS_BETTER1)
598 : : {
599 [ + + ]: 1144169 : outercmp = bms_subset_compare(PATH_REQ_OUTER(new_path),
600 [ + + ]: 1144169 : PATH_REQ_OUTER(old_path));
601 [ + + + + ]: 1144169 : if ((outercmp == BMS_EQUAL ||
602 : 1077518 : outercmp == BMS_SUBSET2) &&
603 [ + + ]: 1077518 : new_path->rows >= old_path->rows &&
604 [ + + ]: 1011127 : new_path->parallel_safe <= old_path->parallel_safe)
605 : 1009491 : accept_new = false; /* old dominates new */
606 : : }
607 : 1778392 : break;
608 : 0 : case COSTS_DIFFERENT:
609 : :
610 : : /*
611 : : * can't get here, but keep this case to keep compiler
612 : : * quiet
613 : : */
614 : 0 : break;
615 : : }
616 : : }
617 : : }
618 : :
619 : : /*
620 : : * Remove current element from pathlist if dominated by new.
621 : : */
622 [ + + ]: 3121343 : if (remove_old)
623 : : {
624 : 500690 : parent_rel->pathlist = foreach_delete_current(parent_rel->pathlist,
625 : : p1);
626 : :
627 : : /*
628 : : * Delete the data pointed-to by the deleted cell, if possible
629 : : */
630 [ + + ]: 500690 : if (!IsA(old_path, IndexPath))
631 : 480263 : pfree(old_path);
632 : : }
633 : : else
634 : : {
635 : : /*
636 : : * new belongs after this old path if it has more disabled nodes
637 : : * or if it has the same number of nodes but a greater total cost
638 : : */
639 [ + + ]: 2620653 : if (new_path->disabled_nodes > old_path->disabled_nodes ||
640 [ + + ]: 2513403 : (new_path->disabled_nodes == old_path->disabled_nodes &&
641 [ + + ]: 2501213 : new_path->total_cost >= old_path->total_cost))
642 : 2183957 : insert_at = foreach_current_index(p1) + 1;
643 : : }
644 : :
645 : : /*
646 : : * If we found an old path that dominates new_path, we can quit
647 : : * scanning the pathlist; we will not add new_path, and we assume
648 : : * new_path cannot dominate any other elements of the pathlist.
649 : : */
650 [ + + ]: 3121343 : if (!accept_new)
651 : 1288105 : break;
652 : : }
653 : :
654 [ + + ]: 3483359 : if (accept_new)
655 : : {
656 : : /* Accept the new path: insert it at proper place in pathlist */
657 : 2195254 : parent_rel->pathlist =
658 : 2195254 : list_insert_nth(parent_rel->pathlist, insert_at, new_path);
659 : : }
660 : : else
661 : : {
662 : : /* Reject and recycle the new path */
663 [ + + ]: 1288105 : if (!IsA(new_path, IndexPath))
664 : 1201910 : pfree(new_path);
665 : : }
666 : 3483359 : }
667 : :
668 : : /*
669 : : * add_path_precheck
670 : : * Check whether a proposed new path could possibly get accepted.
671 : : * We assume we know the path's pathkeys and parameterization accurately,
672 : : * and have lower bounds for its costs.
673 : : *
674 : : * Note that we do not know the path's rowcount, since getting an estimate for
675 : : * that is too expensive to do before prechecking. We assume here that paths
676 : : * of a superset parameterization will generate fewer rows; if that holds,
677 : : * then paths with different parameterizations cannot dominate each other
678 : : * and so we can simply ignore existing paths of another parameterization.
679 : : * (In the infrequent cases where that rule of thumb fails, add_path will
680 : : * get rid of the inferior path.)
681 : : *
682 : : * At the time this is called, we haven't actually built a Path structure,
683 : : * so the required information has to be passed piecemeal.
684 : : */
685 : : bool
686 : 3801574 : add_path_precheck(RelOptInfo *parent_rel, int disabled_nodes,
687 : : Cost startup_cost, Cost total_cost,
688 : : List *pathkeys, Relids required_outer)
689 : : {
690 : : List *new_path_pathkeys;
691 : : bool consider_startup;
692 : : ListCell *p1;
693 : :
694 : : /* Pretend parameterized paths have no pathkeys, per add_path policy */
695 [ + + ]: 3801574 : new_path_pathkeys = required_outer ? NIL : pathkeys;
696 : :
697 : : /* Decide whether new path's startup cost is interesting */
698 [ + + ]: 3801574 : consider_startup = required_outer ? parent_rel->consider_param_startup : parent_rel->consider_startup;
699 : :
700 [ + + + + : 4751760 : foreach(p1, parent_rel->pathlist)
+ + ]
701 : : {
702 : 4473022 : Path *old_path = (Path *) lfirst(p1);
703 : : PathKeysComparison keyscmp;
704 : :
705 : : /*
706 : : * Since the pathlist is sorted by disabled_nodes and then by
707 : : * total_cost, we can stop looking once we reach a path with more
708 : : * disabled nodes, or the same number of disabled nodes plus a
709 : : * total_cost larger than the new path's.
710 : : */
711 [ + + ]: 4473022 : if (unlikely(old_path->disabled_nodes != disabled_nodes))
712 : : {
713 [ + + ]: 110766 : if (disabled_nodes < old_path->disabled_nodes)
714 : 14014 : break;
715 : : }
716 [ + + ]: 4362256 : else if (total_cost <= old_path->total_cost * STD_FUZZ_FACTOR)
717 : 1365392 : break;
718 : :
719 : : /*
720 : : * We are looking for an old_path with the same parameterization (and
721 : : * by assumption the same rowcount) that dominates the new path on
722 : : * pathkeys as well as both cost metrics. If we find one, we can
723 : : * reject the new path.
724 : : *
725 : : * Cost comparisons here should match compare_path_costs_fuzzily.
726 : : */
727 : : /* new path can win on startup cost only if consider_startup */
728 [ + + ]: 3093616 : if (startup_cost > old_path->startup_cost * STD_FUZZ_FACTOR ||
729 [ + + ]: 1465942 : !consider_startup)
730 : : {
731 : : /* new path loses on cost, so check pathkeys... */
732 : : List *old_path_pathkeys;
733 : :
734 [ + + ]: 3041645 : old_path_pathkeys = old_path->param_info ? NIL : old_path->pathkeys;
735 : 3041645 : keyscmp = compare_pathkeys(new_path_pathkeys,
736 : : old_path_pathkeys);
737 [ + + + + ]: 3041645 : if (keyscmp == PATHKEYS_EQUAL ||
738 : : keyscmp == PATHKEYS_BETTER2)
739 : : {
740 : : /* new path does not win on pathkeys... */
741 [ + + + + ]: 2195802 : if (bms_equal(required_outer, PATH_REQ_OUTER(old_path)))
742 : : {
743 : : /* Found an old path that dominates the new one */
744 : 2143430 : return false;
745 : : }
746 : : }
747 : : }
748 : : }
749 : :
750 : 1658144 : return true;
751 : : }
752 : :
753 : : /*
754 : : * add_partial_path
755 : : * Like add_path, our goal here is to consider whether a path is worthy
756 : : * of being kept around, but the considerations here are a bit different.
757 : : * A partial path is one which can be executed in any number of workers in
758 : : * parallel such that each worker will generate a subset of the path's
759 : : * overall result.
760 : : *
761 : : * As in add_path, the partial_pathlist is kept sorted first by smallest
762 : : * number of disabled nodes and then by lowest total cost. This is depended
763 : : * on by multiple places, which just take the front entry as the cheapest
764 : : * path without searching.
765 : : *
766 : : * We don't generate parameterized partial paths for several reasons. Most
767 : : * importantly, they're not safe to execute, because there's nothing to
768 : : * make sure that a parallel scan within the parameterized portion of the
769 : : * plan is running with the same value in every worker at the same time.
770 : : * Fortunately, it seems unlikely to be worthwhile anyway, because having
771 : : * each worker scan the entire outer relation and a subset of the inner
772 : : * relation will generally be a terrible plan. The inner (parameterized)
773 : : * side of the plan will be small anyway. There could be rare cases where
774 : : * this wins big - e.g. if join order constraints put a 1-row relation on
775 : : * the outer side of the topmost join with a parameterized plan on the inner
776 : : * side - but we'll have to be content not to handle such cases until
777 : : * somebody builds an executor infrastructure that can cope with them.
778 : : *
779 : : * Because we don't consider parameterized paths here, we also don't
780 : : * need to consider the row counts as a measure of quality: every path will
781 : : * produce the same number of rows. However, we do need to consider the
782 : : * startup costs: this partial path could be used beneath a Limit node,
783 : : * so a fast-start plan could be correct.
784 : : *
785 : : * As with add_path, we pfree paths that are found to be dominated by
786 : : * another partial path; this requires that there be no other references to
787 : : * such paths yet. Hence, GatherPaths must not be created for a rel until
788 : : * we're done creating all partial paths for it. Unlike add_path, we don't
789 : : * take an exception for IndexPaths as partial index paths won't be
790 : : * referenced by partial BitmapHeapPaths.
791 : : */
792 : : void
793 : 242842 : add_partial_path(RelOptInfo *parent_rel, Path *new_path)
794 : : {
795 : 242842 : bool accept_new = true; /* unless we find a superior old path */
796 : 242842 : int insert_at = 0; /* where to insert new item */
797 : : ListCell *p1;
798 : :
799 : : /* Check for query cancel. */
800 [ - + ]: 242842 : CHECK_FOR_INTERRUPTS();
801 : :
802 : : /* Path to be added must be parallel safe. */
803 : : Assert(new_path->parallel_safe);
804 : :
805 : : /* Relation should be OK for parallelism, too. */
806 : : Assert(parent_rel->consider_parallel);
807 : :
808 : : /*
809 : : * As in add_path, throw out any paths which are dominated by the new
810 : : * path, but throw out the new path if some existing path dominates it.
811 : : */
812 [ + + + + : 339501 : foreach(p1, parent_rel->partial_pathlist)
+ + ]
813 : : {
814 : 193101 : Path *old_path = (Path *) lfirst(p1);
815 : 193101 : bool remove_old = false; /* unless new proves superior */
816 : : PathKeysComparison keyscmp;
817 : :
818 : : /* Compare pathkeys. */
819 : 193101 : keyscmp = compare_pathkeys(new_path->pathkeys, old_path->pathkeys);
820 : :
821 : : /*
822 : : * Unless pathkeys are incompatible, see if one of the paths dominates
823 : : * the other (both in startup and total cost). It may happen that one
824 : : * path has lower startup cost, the other has lower total cost.
825 : : */
826 [ + + ]: 193101 : if (keyscmp != PATHKEYS_DIFFERENT)
827 : : {
828 : : PathCostComparison costcmp;
829 : :
830 : : /*
831 : : * Do a fuzzy cost comparison with standard fuzziness limit.
832 : : */
833 : 192934 : costcmp = compare_path_costs_fuzzily(new_path, old_path,
834 : : STD_FUZZ_FACTOR);
835 [ + + ]: 192934 : if (costcmp == COSTS_BETTER1)
836 : : {
837 [ + + ]: 68927 : if (keyscmp != PATHKEYS_BETTER2)
838 : 27596 : remove_old = true;
839 : : }
840 [ + + ]: 124007 : else if (costcmp == COSTS_BETTER2)
841 : : {
842 [ + + ]: 95601 : if (keyscmp != PATHKEYS_BETTER1)
843 : 68701 : accept_new = false;
844 : : }
845 [ + + ]: 28406 : else if (costcmp == COSTS_EQUAL)
846 : : {
847 [ + + ]: 27985 : if (keyscmp == PATHKEYS_BETTER1)
848 : 32 : remove_old = true;
849 [ + + ]: 27953 : else if (keyscmp == PATHKEYS_BETTER2)
850 : 1112 : accept_new = false;
851 [ + + ]: 26841 : else if (compare_path_costs_fuzzily(new_path, old_path,
852 : : 1.0000000001) == COSTS_BETTER1)
853 : 212 : remove_old = true;
854 : : else
855 : 26629 : accept_new = false;
856 : : }
857 : : }
858 : :
859 : : /*
860 : : * Remove current element from partial_pathlist if dominated by new.
861 : : */
862 [ + + ]: 193101 : if (remove_old)
863 : : {
864 : 27840 : parent_rel->partial_pathlist =
865 : 27840 : foreach_delete_current(parent_rel->partial_pathlist, p1);
866 : 27840 : pfree(old_path);
867 : : }
868 : : else
869 : : {
870 : : /*
871 : : * new belongs after this old path if it has more disabled nodes
872 : : * or if it has the same number of nodes but a greater total cost
873 : : */
874 [ + + ]: 165261 : if (new_path->disabled_nodes > old_path->disabled_nodes ||
875 [ + + ]: 162479 : (new_path->disabled_nodes == old_path->disabled_nodes &&
876 [ + + ]: 161514 : new_path->total_cost >= old_path->total_cost))
877 : 123391 : insert_at = foreach_current_index(p1) + 1;
878 : : }
879 : :
880 : : /*
881 : : * If we found an old path that dominates new_path, we can quit
882 : : * scanning the partial_pathlist; we will not add new_path, and we
883 : : * assume new_path cannot dominate any later path.
884 : : */
885 [ + + ]: 193101 : if (!accept_new)
886 : 96442 : break;
887 : : }
888 : :
889 [ + + ]: 242842 : if (accept_new)
890 : : {
891 : : /* Accept the new path: insert it at proper place */
892 : 146400 : parent_rel->partial_pathlist =
893 : 146400 : list_insert_nth(parent_rel->partial_pathlist, insert_at, new_path);
894 : : }
895 : : else
896 : : {
897 : : /* Reject and recycle the new path */
898 : 96442 : pfree(new_path);
899 : : }
900 : 242842 : }
901 : :
902 : : /*
903 : : * add_partial_path_precheck
904 : : * Check whether a proposed new partial path could possibly get accepted.
905 : : *
906 : : * Unlike add_path_precheck, we can ignore parameterization, since it doesn't
907 : : * matter for partial paths (see add_partial_path). But we do want to make
908 : : * sure we don't add a partial path if there's already a complete path that
909 : : * dominates it, since in that case the proposed path is surely a loser.
910 : : */
911 : : bool
912 : 342240 : add_partial_path_precheck(RelOptInfo *parent_rel, int disabled_nodes,
913 : : Cost startup_cost, Cost total_cost, List *pathkeys)
914 : : {
915 : 342240 : bool consider_startup = parent_rel->consider_startup;
916 : : ListCell *p1;
917 : :
918 : : /*
919 : : * Our goal here is twofold. First, we want to find out whether this path
920 : : * is clearly inferior to some existing partial path. If so, we want to
921 : : * reject it immediately. Second, we want to find out whether this path
922 : : * is clearly superior to some existing partial path -- at least, modulo
923 : : * final cost computations. If so, we definitely want to consider it.
924 : : *
925 : : * Unlike add_path(), we never try to exit this loop early. This is
926 : : * because we expect partial_pathlist to be very short, and getting a
927 : : * definitive answer at this stage avoids the need to call
928 : : * add_path_precheck.
929 : : */
930 [ + + + + : 427942 : foreach(p1, parent_rel->partial_pathlist)
+ + ]
931 : : {
932 : 349084 : Path *old_path = (Path *) lfirst(p1);
933 : : PathCostComparison costcmp;
934 : : PathKeysComparison keyscmp;
935 : :
936 : : /*
937 : : * First, compare costs and disabled nodes. This logic should be
938 : : * identical to compare_path_costs_fuzzily, except that one of the
939 : : * paths hasn't been created yet, and the fuzz factor is always
940 : : * STD_FUZZ_FACTOR.
941 : : */
942 [ + + ]: 349084 : if (unlikely(old_path->disabled_nodes != disabled_nodes))
943 : : {
944 [ + + ]: 9437 : if (disabled_nodes < old_path->disabled_nodes)
945 : 3906 : costcmp = COSTS_BETTER1;
946 : : else
947 : 5531 : costcmp = COSTS_BETTER2;
948 : : }
949 [ + + ]: 339647 : else if (total_cost > old_path->total_cost * STD_FUZZ_FACTOR)
950 : : {
951 [ + + ]: 206320 : if (consider_startup &&
952 [ + + ]: 338 : old_path->startup_cost > startup_cost * STD_FUZZ_FACTOR)
953 : 248 : costcmp = COSTS_DIFFERENT;
954 : : else
955 : 206072 : costcmp = COSTS_BETTER2;
956 : : }
957 [ + + ]: 133327 : else if (old_path->total_cost > total_cost * STD_FUZZ_FACTOR)
958 : : {
959 [ + + ]: 129630 : if (consider_startup &&
960 [ + + ]: 528 : startup_cost > old_path->startup_cost * STD_FUZZ_FACTOR)
961 : 392 : costcmp = COSTS_DIFFERENT;
962 : : else
963 : 129238 : costcmp = COSTS_BETTER1;
964 : : }
965 [ + + ]: 3697 : else if (startup_cost > old_path->startup_cost * STD_FUZZ_FACTOR)
966 : 2383 : costcmp = COSTS_BETTER2;
967 [ + + ]: 1314 : else if (old_path->startup_cost > startup_cost * STD_FUZZ_FACTOR)
968 : 487 : costcmp = COSTS_BETTER1;
969 : : else
970 : 827 : costcmp = COSTS_EQUAL;
971 : :
972 : : /*
973 : : * If one path wins on startup cost and the other on total cost, we
974 : : * can't say for sure which is better.
975 : : */
976 [ + + ]: 349084 : if (costcmp == COSTS_DIFFERENT)
977 : 640 : continue;
978 : :
979 : : /*
980 : : * If the two paths have different pathkeys, we can't say for sure
981 : : * which is better.
982 : : */
983 : 348444 : keyscmp = compare_pathkeys(pathkeys, old_path->pathkeys);
984 [ + + ]: 348444 : if (keyscmp == PATHKEYS_DIFFERENT)
985 : 152 : continue;
986 : :
987 : : /*
988 : : * If the existing path is cheaper and the pathkeys are equal or
989 : : * worse, the new path is not interesting.
990 : : */
991 [ + + + + ]: 348292 : if (costcmp == COSTS_BETTER2 && keyscmp != PATHKEYS_BETTER1)
992 : 263382 : return false;
993 : :
994 : : /*
995 : : * If the new path is cheaper and the pathkeys are equal or better, it
996 : : * is definitely interesting.
997 : : */
998 [ + + + + ]: 175101 : if (costcmp == COSTS_BETTER1 && keyscmp != PATHKEYS_BETTER2)
999 : 90191 : return true;
1000 : : }
1001 : :
1002 : : /*
1003 : : * This path is neither clearly inferior to an existing partial path nor
1004 : : * clearly good enough that it might replace one. Compare it to
1005 : : * non-parallel plans. If it loses even before accounting for the cost of
1006 : : * the Gather node, we should definitely reject it.
1007 : : */
1008 [ + + ]: 78858 : if (!add_path_precheck(parent_rel, disabled_nodes, startup_cost,
1009 : : total_cost, pathkeys, NULL))
1010 : 1692 : return false;
1011 : :
1012 : 77166 : return true;
1013 : : }
1014 : :
1015 : :
1016 : : /*****************************************************************************
1017 : : * PATH NODE CREATION ROUTINES
1018 : : *****************************************************************************/
1019 : :
1020 : : /*
1021 : : * create_seqscan_path
1022 : : * Creates a path corresponding to a sequential scan, returning the
1023 : : * pathnode.
1024 : : */
1025 : : Path *
1026 : 338310 : create_seqscan_path(PlannerInfo *root, RelOptInfo *rel,
1027 : : Relids required_outer, int parallel_workers)
1028 : : {
1029 : 338310 : Path *pathnode = makeNode(Path);
1030 : :
1031 : 338310 : pathnode->pathtype = T_SeqScan;
1032 : 338310 : pathnode->parent = rel;
1033 : 338310 : pathnode->pathtarget = rel->reltarget;
1034 : 338310 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
1035 : : required_outer);
1036 : 338310 : pathnode->parallel_aware = (parallel_workers > 0);
1037 : 338310 : pathnode->parallel_safe = rel->consider_parallel;
1038 : 338310 : pathnode->parallel_workers = parallel_workers;
1039 : 338310 : pathnode->pathkeys = NIL; /* seqscan has unordered result */
1040 : :
1041 : 338310 : cost_seqscan(pathnode, root, rel, pathnode->param_info);
1042 : :
1043 : 338310 : return pathnode;
1044 : : }
1045 : :
1046 : : /*
1047 : : * create_samplescan_path
1048 : : * Creates a path node for a sampled table scan.
1049 : : */
1050 : : Path *
1051 : 245 : create_samplescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
1052 : : {
1053 : 245 : Path *pathnode = makeNode(Path);
1054 : :
1055 : 245 : pathnode->pathtype = T_SampleScan;
1056 : 245 : pathnode->parent = rel;
1057 : 245 : pathnode->pathtarget = rel->reltarget;
1058 : 245 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
1059 : : required_outer);
1060 : 245 : pathnode->parallel_aware = false;
1061 : 245 : pathnode->parallel_safe = rel->consider_parallel;
1062 : 245 : pathnode->parallel_workers = 0;
1063 : 245 : pathnode->pathkeys = NIL; /* samplescan has unordered result */
1064 : :
1065 : 245 : cost_samplescan(pathnode, root, rel, pathnode->param_info);
1066 : :
1067 : 245 : return pathnode;
1068 : : }
1069 : :
1070 : : /*
1071 : : * create_index_path
1072 : : * Creates a path node for an index scan.
1073 : : *
1074 : : * 'index' is a usable index.
1075 : : * 'indexclauses' is a list of IndexClause nodes representing clauses
1076 : : * to be enforced as qual conditions in the scan.
1077 : : * 'indexorderbys' is a list of bare expressions (no RestrictInfos)
1078 : : * to be used as index ordering operators in the scan.
1079 : : * 'indexorderbycols' is an integer list of index column numbers (zero based)
1080 : : * the ordering operators can be used with.
1081 : : * 'pathkeys' describes the ordering of the path.
1082 : : * 'indexscandir' is either ForwardScanDirection or BackwardScanDirection.
1083 : : * 'indexonly' is true if an index-only scan is wanted.
1084 : : * 'required_outer' is the set of outer relids for a parameterized path.
1085 : : * 'loop_count' is the number of repetitions of the indexscan to factor into
1086 : : * estimates of caching behavior.
1087 : : * 'partial_path' is true if constructing a parallel index scan path.
1088 : : *
1089 : : * Returns the new path node.
1090 : : */
1091 : : IndexPath *
1092 : 644060 : create_index_path(PlannerInfo *root,
1093 : : IndexOptInfo *index,
1094 : : List *indexclauses,
1095 : : List *indexorderbys,
1096 : : List *indexorderbycols,
1097 : : List *pathkeys,
1098 : : ScanDirection indexscandir,
1099 : : bool indexonly,
1100 : : Relids required_outer,
1101 : : double loop_count,
1102 : : bool partial_path)
1103 : : {
1104 : 644060 : IndexPath *pathnode = makeNode(IndexPath);
1105 : 644060 : RelOptInfo *rel = index->rel;
1106 : :
1107 [ + + ]: 644060 : pathnode->path.pathtype = indexonly ? T_IndexOnlyScan : T_IndexScan;
1108 : 644060 : pathnode->path.parent = rel;
1109 : 644060 : pathnode->path.pathtarget = rel->reltarget;
1110 : 644060 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1111 : : required_outer);
1112 : 644060 : pathnode->path.parallel_aware = false;
1113 : 644060 : pathnode->path.parallel_safe = rel->consider_parallel;
1114 : 644060 : pathnode->path.parallel_workers = 0;
1115 : 644060 : pathnode->path.pathkeys = pathkeys;
1116 : :
1117 : 644060 : pathnode->indexinfo = index;
1118 : 644060 : pathnode->indexclauses = indexclauses;
1119 : 644060 : pathnode->indexorderbys = indexorderbys;
1120 : 644060 : pathnode->indexorderbycols = indexorderbycols;
1121 : 644060 : pathnode->indexscandir = indexscandir;
1122 : :
1123 : 644060 : cost_index(pathnode, root, loop_count, partial_path);
1124 : :
1125 : : /*
1126 : : * cost_index will set disabled_nodes to 1 if this rel is not allowed to
1127 : : * use index scans in general, but it doesn't have the IndexOptInfo to
1128 : : * know whether this specific index has been disabled.
1129 : : */
1130 [ + + ]: 644060 : if (index->disabled)
1131 : 8406 : pathnode->path.disabled_nodes = 1;
1132 : :
1133 : 644060 : return pathnode;
1134 : : }
1135 : :
1136 : : /*
1137 : : * create_bitmap_heap_path
1138 : : * Creates a path node for a bitmap scan.
1139 : : *
1140 : : * 'bitmapqual' is a tree of IndexPath, BitmapAndPath, and BitmapOrPath nodes.
1141 : : * 'required_outer' is the set of outer relids for a parameterized path.
1142 : : * 'loop_count' is the number of repetitions of the indexscan to factor into
1143 : : * estimates of caching behavior.
1144 : : *
1145 : : * loop_count should match the value used when creating the component
1146 : : * IndexPaths.
1147 : : */
1148 : : BitmapHeapPath *
1149 : 271187 : create_bitmap_heap_path(PlannerInfo *root,
1150 : : RelOptInfo *rel,
1151 : : Path *bitmapqual,
1152 : : Relids required_outer,
1153 : : double loop_count,
1154 : : int parallel_degree)
1155 : : {
1156 : 271187 : BitmapHeapPath *pathnode = makeNode(BitmapHeapPath);
1157 : :
1158 : 271187 : pathnode->path.pathtype = T_BitmapHeapScan;
1159 : 271187 : pathnode->path.parent = rel;
1160 : 271187 : pathnode->path.pathtarget = rel->reltarget;
1161 : 271187 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1162 : : required_outer);
1163 : 271187 : pathnode->path.parallel_aware = (parallel_degree > 0);
1164 : 271187 : pathnode->path.parallel_safe = rel->consider_parallel;
1165 : 271187 : pathnode->path.parallel_workers = parallel_degree;
1166 : 271187 : pathnode->path.pathkeys = NIL; /* always unordered */
1167 : :
1168 : 271187 : pathnode->bitmapqual = bitmapqual;
1169 : :
1170 : 271187 : cost_bitmap_heap_scan(&pathnode->path, root, rel,
1171 : : pathnode->path.param_info,
1172 : : bitmapqual, loop_count);
1173 : :
1174 : 271187 : return pathnode;
1175 : : }
1176 : :
1177 : : /*
1178 : : * create_bitmap_and_path
1179 : : * Creates a path node representing a BitmapAnd.
1180 : : */
1181 : : BitmapAndPath *
1182 : 41142 : create_bitmap_and_path(PlannerInfo *root,
1183 : : RelOptInfo *rel,
1184 : : List *bitmapquals)
1185 : : {
1186 : 41142 : BitmapAndPath *pathnode = makeNode(BitmapAndPath);
1187 : 41142 : Relids required_outer = NULL;
1188 : : ListCell *lc;
1189 : :
1190 : 41142 : pathnode->path.pathtype = T_BitmapAnd;
1191 : 41142 : pathnode->path.parent = rel;
1192 : 41142 : pathnode->path.pathtarget = rel->reltarget;
1193 : :
1194 : : /*
1195 : : * Identify the required outer rels as the union of what the child paths
1196 : : * depend on. (Alternatively, we could insist that the caller pass this
1197 : : * in, but it's more convenient and reliable to compute it here.)
1198 : : */
1199 [ + - + + : 123426 : foreach(lc, bitmapquals)
+ + ]
1200 : : {
1201 : 82284 : Path *bitmapqual = (Path *) lfirst(lc);
1202 : :
1203 : 82284 : required_outer = bms_add_members(required_outer,
1204 [ + + ]: 82284 : PATH_REQ_OUTER(bitmapqual));
1205 : : }
1206 : 41142 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1207 : : required_outer);
1208 : :
1209 : : /*
1210 : : * Currently, a BitmapHeapPath, BitmapAndPath, or BitmapOrPath will be
1211 : : * parallel-safe if and only if rel->consider_parallel is set. So, we can
1212 : : * set the flag for this path based only on the relation-level flag,
1213 : : * without actually iterating over the list of children.
1214 : : */
1215 : 41142 : pathnode->path.parallel_aware = false;
1216 : 41142 : pathnode->path.parallel_safe = rel->consider_parallel;
1217 : 41142 : pathnode->path.parallel_workers = 0;
1218 : :
1219 : 41142 : pathnode->path.pathkeys = NIL; /* always unordered */
1220 : :
1221 : 41142 : pathnode->bitmapquals = bitmapquals;
1222 : :
1223 : : /* this sets bitmapselectivity as well as the regular cost fields: */
1224 : 41142 : cost_bitmap_and_node(pathnode, root);
1225 : :
1226 : 41142 : return pathnode;
1227 : : }
1228 : :
1229 : : /*
1230 : : * create_bitmap_or_path
1231 : : * Creates a path node representing a BitmapOr.
1232 : : */
1233 : : BitmapOrPath *
1234 : 1752 : create_bitmap_or_path(PlannerInfo *root,
1235 : : RelOptInfo *rel,
1236 : : List *bitmapquals)
1237 : : {
1238 : 1752 : BitmapOrPath *pathnode = makeNode(BitmapOrPath);
1239 : 1752 : Relids required_outer = NULL;
1240 : : ListCell *lc;
1241 : :
1242 : 1752 : pathnode->path.pathtype = T_BitmapOr;
1243 : 1752 : pathnode->path.parent = rel;
1244 : 1752 : pathnode->path.pathtarget = rel->reltarget;
1245 : :
1246 : : /*
1247 : : * Identify the required outer rels as the union of what the child paths
1248 : : * depend on. (Alternatively, we could insist that the caller pass this
1249 : : * in, but it's more convenient and reliable to compute it here.)
1250 : : */
1251 [ + - + + : 4097 : foreach(lc, bitmapquals)
+ + ]
1252 : : {
1253 : 2345 : Path *bitmapqual = (Path *) lfirst(lc);
1254 : :
1255 : 2345 : required_outer = bms_add_members(required_outer,
1256 [ + + ]: 2345 : PATH_REQ_OUTER(bitmapqual));
1257 : : }
1258 : 1752 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1259 : : required_outer);
1260 : :
1261 : : /*
1262 : : * Currently, a BitmapHeapPath, BitmapAndPath, or BitmapOrPath will be
1263 : : * parallel-safe if and only if rel->consider_parallel is set. So, we can
1264 : : * set the flag for this path based only on the relation-level flag,
1265 : : * without actually iterating over the list of children.
1266 : : */
1267 : 1752 : pathnode->path.parallel_aware = false;
1268 : 1752 : pathnode->path.parallel_safe = rel->consider_parallel;
1269 : 1752 : pathnode->path.parallel_workers = 0;
1270 : :
1271 : 1752 : pathnode->path.pathkeys = NIL; /* always unordered */
1272 : :
1273 : 1752 : pathnode->bitmapquals = bitmapquals;
1274 : :
1275 : : /* this sets bitmapselectivity as well as the regular cost fields: */
1276 : 1752 : cost_bitmap_or_node(pathnode, root);
1277 : :
1278 : 1752 : return pathnode;
1279 : : }
1280 : :
1281 : : /*
1282 : : * create_tidscan_path
1283 : : * Creates a path corresponding to a scan by TID, returning the pathnode.
1284 : : */
1285 : : TidPath *
1286 : 636 : create_tidscan_path(PlannerInfo *root, RelOptInfo *rel, List *tidquals,
1287 : : Relids required_outer)
1288 : : {
1289 : 636 : TidPath *pathnode = makeNode(TidPath);
1290 : :
1291 : 636 : pathnode->path.pathtype = T_TidScan;
1292 : 636 : pathnode->path.parent = rel;
1293 : 636 : pathnode->path.pathtarget = rel->reltarget;
1294 : 636 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1295 : : required_outer);
1296 : 636 : pathnode->path.parallel_aware = false;
1297 : 636 : pathnode->path.parallel_safe = rel->consider_parallel;
1298 : 636 : pathnode->path.parallel_workers = 0;
1299 : 636 : pathnode->path.pathkeys = NIL; /* always unordered */
1300 : :
1301 : 636 : pathnode->tidquals = tidquals;
1302 : :
1303 : 636 : cost_tidscan(&pathnode->path, root, rel, tidquals,
1304 : : pathnode->path.param_info);
1305 : :
1306 : 636 : return pathnode;
1307 : : }
1308 : :
1309 : : /*
1310 : : * create_tidrangescan_path
1311 : : * Creates a path corresponding to a scan by a range of TIDs, returning
1312 : : * the pathnode.
1313 : : */
1314 : : TidRangePath *
1315 : 1703 : create_tidrangescan_path(PlannerInfo *root, RelOptInfo *rel,
1316 : : List *tidrangequals, Relids required_outer,
1317 : : int parallel_workers)
1318 : : {
1319 : 1703 : TidRangePath *pathnode = makeNode(TidRangePath);
1320 : :
1321 : 1703 : pathnode->path.pathtype = T_TidRangeScan;
1322 : 1703 : pathnode->path.parent = rel;
1323 : 1703 : pathnode->path.pathtarget = rel->reltarget;
1324 : 1703 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1325 : : required_outer);
1326 : 1703 : pathnode->path.parallel_aware = (parallel_workers > 0);
1327 : 1703 : pathnode->path.parallel_safe = rel->consider_parallel;
1328 : 1703 : pathnode->path.parallel_workers = parallel_workers;
1329 : 1703 : pathnode->path.pathkeys = NIL; /* always unordered */
1330 : :
1331 : 1703 : pathnode->tidrangequals = tidrangequals;
1332 : :
1333 : 1703 : cost_tidrangescan(&pathnode->path, root, rel, tidrangequals,
1334 : : pathnode->path.param_info);
1335 : :
1336 : 1703 : return pathnode;
1337 : : }
1338 : :
1339 : : /*
1340 : : * create_append_path
1341 : : * Creates a path corresponding to an Append plan, returning the
1342 : : * pathnode.
1343 : : *
1344 : : * Note that we must handle subpaths = NIL, representing a dummy access path.
1345 : : * Also, there are callers that pass root = NULL.
1346 : : *
1347 : : * 'rows', when passed as a non-negative number, will be used to overwrite the
1348 : : * returned path's row estimate. Otherwise, the row estimate is calculated
1349 : : * by totalling the row estimates from the 'subpaths' list.
1350 : : */
1351 : : AppendPath *
1352 : 74058 : create_append_path(PlannerInfo *root,
1353 : : RelOptInfo *rel,
1354 : : AppendPathInput input,
1355 : : List *pathkeys, Relids required_outer,
1356 : : int parallel_workers, bool parallel_aware,
1357 : : double rows)
1358 : : {
1359 : 74058 : AppendPath *pathnode = makeNode(AppendPath);
1360 : : ListCell *l;
1361 : :
1362 : : Assert(!parallel_aware || parallel_workers > 0);
1363 : :
1364 : 74058 : pathnode->child_append_relid_sets = input.child_append_relid_sets;
1365 : 74058 : pathnode->path.pathtype = T_Append;
1366 : 74058 : pathnode->path.parent = rel;
1367 : 74058 : pathnode->path.pathtarget = rel->reltarget;
1368 : :
1369 : : /*
1370 : : * If this is for a baserel (not a join or non-leaf partition), we prefer
1371 : : * to apply get_baserel_parampathinfo to construct a full ParamPathInfo
1372 : : * for the path. This supports building a Memoize path atop this path,
1373 : : * and if this is a partitioned table the info may be useful for run-time
1374 : : * pruning (cf make_partition_pruneinfo()).
1375 : : *
1376 : : * However, if we don't have "root" then that won't work and we fall back
1377 : : * on the simpler get_appendrel_parampathinfo. There's no point in doing
1378 : : * the more expensive thing for a dummy path, either.
1379 : : */
1380 [ + + + + : 74058 : if (rel->reloptkind == RELOPT_BASEREL && root && input.subpaths != NIL)
+ + ]
1381 : 32119 : pathnode->path.param_info = get_baserel_parampathinfo(root,
1382 : : rel,
1383 : : required_outer);
1384 : : else
1385 : 41939 : pathnode->path.param_info = get_appendrel_parampathinfo(rel,
1386 : : required_outer);
1387 : :
1388 : 74058 : pathnode->path.parallel_aware = parallel_aware;
1389 : 74058 : pathnode->path.parallel_safe = rel->consider_parallel;
1390 : 74058 : pathnode->path.parallel_workers = parallel_workers;
1391 : 74058 : pathnode->path.pathkeys = pathkeys;
1392 : :
1393 : : /*
1394 : : * For parallel append, non-partial paths are sorted by descending total
1395 : : * costs. That way, the total time to finish all non-partial paths is
1396 : : * minimized. Also, the partial paths are sorted by descending startup
1397 : : * costs. There may be some paths that require to do startup work by a
1398 : : * single worker. In such case, it's better for workers to choose the
1399 : : * expensive ones first, whereas the leader should choose the cheapest
1400 : : * startup plan.
1401 : : */
1402 [ + + ]: 74058 : if (pathnode->path.parallel_aware)
1403 : : {
1404 : : /*
1405 : : * We mustn't fiddle with the order of subpaths when the Append has
1406 : : * pathkeys. The order they're listed in is critical to keeping the
1407 : : * pathkeys valid.
1408 : : */
1409 : : Assert(pathkeys == NIL);
1410 : :
1411 : 26421 : list_sort(input.subpaths, append_total_cost_compare);
1412 : 26421 : list_sort(input.partial_subpaths, append_startup_cost_compare);
1413 : : }
1414 : 74058 : pathnode->first_partial_path = list_length(input.subpaths);
1415 : 74058 : pathnode->subpaths = list_concat(input.subpaths, input.partial_subpaths);
1416 : :
1417 : : /*
1418 : : * Apply query-wide LIMIT if known and path is for sole base relation.
1419 : : * (Handling this at this low level is a bit klugy.)
1420 : : */
1421 [ + + + + ]: 74058 : if (root != NULL && bms_equal(rel->relids, root->all_query_rels))
1422 : 35589 : pathnode->limit_tuples = root->limit_tuples;
1423 : : else
1424 : 38469 : pathnode->limit_tuples = -1.0;
1425 : :
1426 [ + + + + : 257147 : foreach(l, pathnode->subpaths)
+ + ]
1427 : : {
1428 : 183089 : Path *subpath = (Path *) lfirst(l);
1429 : :
1430 [ + + ]: 333112 : pathnode->path.parallel_safe = pathnode->path.parallel_safe &&
1431 [ + + ]: 333112 : subpath->parallel_safe;
1432 : :
1433 : : /* All child paths must have same parameterization */
1434 : : Assert(bms_equal(PATH_REQ_OUTER(subpath), required_outer));
1435 : : }
1436 : :
1437 : : Assert(!parallel_aware || pathnode->path.parallel_safe);
1438 : :
1439 : : /*
1440 : : * If there's exactly one child path then the output of the Append is
1441 : : * necessarily ordered the same as the child's, so we can inherit the
1442 : : * child's pathkeys if any, overriding whatever the caller might've said.
1443 : : * Furthermore, if the child's parallel awareness matches the Append's,
1444 : : * then the Append is a no-op and will be discarded later (in setrefs.c).
1445 : : * Then we can inherit the child's size and cost too, effectively charging
1446 : : * zero for the Append. Otherwise, we must do the normal costsize
1447 : : * calculation.
1448 : : */
1449 [ + + ]: 74058 : if (list_length(pathnode->subpaths) == 1)
1450 : : {
1451 : 15722 : Path *child = (Path *) linitial(pathnode->subpaths);
1452 : :
1453 [ + + ]: 15722 : if (child->parallel_aware == parallel_aware)
1454 : : {
1455 : 15352 : pathnode->path.rows = child->rows;
1456 : 15352 : pathnode->path.startup_cost = child->startup_cost;
1457 : 15352 : pathnode->path.total_cost = child->total_cost;
1458 : : }
1459 : : else
1460 : 370 : cost_append(pathnode, root);
1461 : : /* Must do this last, else cost_append complains */
1462 : 15722 : pathnode->path.pathkeys = child->pathkeys;
1463 : : }
1464 : : else
1465 : 58336 : cost_append(pathnode, root);
1466 : :
1467 : : /* If the caller provided a row estimate, override the computed value. */
1468 [ + + ]: 74058 : if (rows >= 0)
1469 : 500 : pathnode->path.rows = rows;
1470 : :
1471 : 74058 : return pathnode;
1472 : : }
1473 : :
1474 : : /*
1475 : : * append_total_cost_compare
1476 : : * list_sort comparator for sorting append child paths
1477 : : * by total_cost descending
1478 : : *
1479 : : * For equal total costs, we fall back to comparing startup costs; if those
1480 : : * are equal too, break ties using bms_compare on the paths' relids.
1481 : : * (This is to avoid getting unpredictable results from list_sort.)
1482 : : */
1483 : : static int
1484 : 13637 : append_total_cost_compare(const ListCell *a, const ListCell *b)
1485 : : {
1486 : 13637 : Path *path1 = (Path *) lfirst(a);
1487 : 13637 : Path *path2 = (Path *) lfirst(b);
1488 : : int cmp;
1489 : :
1490 : 13637 : cmp = compare_path_costs(path1, path2, TOTAL_COST);
1491 [ + + ]: 13637 : if (cmp != 0)
1492 : 12368 : return -cmp;
1493 : 1269 : return bms_compare(path1->parent->relids, path2->parent->relids);
1494 : : }
1495 : :
1496 : : /*
1497 : : * append_startup_cost_compare
1498 : : * list_sort comparator for sorting append child paths
1499 : : * by startup_cost descending
1500 : : *
1501 : : * For equal startup costs, we fall back to comparing total costs; if those
1502 : : * are equal too, break ties using bms_compare on the paths' relids.
1503 : : * (This is to avoid getting unpredictable results from list_sort.)
1504 : : */
1505 : : static int
1506 : 39467 : append_startup_cost_compare(const ListCell *a, const ListCell *b)
1507 : : {
1508 : 39467 : Path *path1 = (Path *) lfirst(a);
1509 : 39467 : Path *path2 = (Path *) lfirst(b);
1510 : : int cmp;
1511 : :
1512 : 39467 : cmp = compare_path_costs(path1, path2, STARTUP_COST);
1513 [ + + ]: 39467 : if (cmp != 0)
1514 : 18581 : return -cmp;
1515 : 20886 : return bms_compare(path1->parent->relids, path2->parent->relids);
1516 : : }
1517 : :
1518 : : /*
1519 : : * create_merge_append_path
1520 : : * Creates a path corresponding to a MergeAppend plan, returning the
1521 : : * pathnode.
1522 : : */
1523 : : MergeAppendPath *
1524 : 7465 : create_merge_append_path(PlannerInfo *root,
1525 : : RelOptInfo *rel,
1526 : : List *subpaths,
1527 : : List *child_append_relid_sets,
1528 : : List *pathkeys,
1529 : : Relids required_outer)
1530 : : {
1531 : 7465 : MergeAppendPath *pathnode = makeNode(MergeAppendPath);
1532 : : int input_disabled_nodes;
1533 : : Cost input_startup_cost;
1534 : : Cost input_total_cost;
1535 : : ListCell *l;
1536 : :
1537 : : /*
1538 : : * We don't currently support parameterized MergeAppend paths, as
1539 : : * explained in the comments for generate_orderedappend_paths.
1540 : : */
1541 : : Assert(bms_is_empty(rel->lateral_relids) && bms_is_empty(required_outer));
1542 : :
1543 : 7465 : pathnode->child_append_relid_sets = child_append_relid_sets;
1544 : 7465 : pathnode->path.pathtype = T_MergeAppend;
1545 : 7465 : pathnode->path.parent = rel;
1546 : 7465 : pathnode->path.pathtarget = rel->reltarget;
1547 : 7465 : pathnode->path.param_info = NULL;
1548 : 7465 : pathnode->path.parallel_aware = false;
1549 : 7465 : pathnode->path.parallel_safe = rel->consider_parallel;
1550 : 7465 : pathnode->path.parallel_workers = 0;
1551 : 7465 : pathnode->path.pathkeys = pathkeys;
1552 : 7465 : pathnode->subpaths = subpaths;
1553 : :
1554 : : /*
1555 : : * Apply query-wide LIMIT if known and path is for sole base relation.
1556 : : * (Handling this at this low level is a bit klugy.)
1557 : : */
1558 [ + + ]: 7465 : if (bms_equal(rel->relids, root->all_query_rels))
1559 : 3463 : pathnode->limit_tuples = root->limit_tuples;
1560 : : else
1561 : 4002 : pathnode->limit_tuples = -1.0;
1562 : :
1563 : : /*
1564 : : * Add up the sizes and costs of the input paths.
1565 : : */
1566 : 7465 : pathnode->path.rows = 0;
1567 : 7465 : input_disabled_nodes = 0;
1568 : 7465 : input_startup_cost = 0;
1569 : 7465 : input_total_cost = 0;
1570 [ + - + + : 27088 : foreach(l, subpaths)
+ + ]
1571 : : {
1572 : 19623 : Path *subpath = (Path *) lfirst(l);
1573 : : int presorted_keys;
1574 : : Path sort_path; /* dummy for result of
1575 : : * cost_sort/cost_incremental_sort */
1576 : :
1577 : : /* All child paths should be unparameterized */
1578 : : Assert(bms_is_empty(PATH_REQ_OUTER(subpath)));
1579 : :
1580 : 19623 : pathnode->path.rows += subpath->rows;
1581 [ + + ]: 37112 : pathnode->path.parallel_safe = pathnode->path.parallel_safe &&
1582 [ + + ]: 17489 : subpath->parallel_safe;
1583 : :
1584 [ + + ]: 19623 : if (!pathkeys_count_contained_in(pathkeys, subpath->pathkeys,
1585 : : &presorted_keys))
1586 : : {
1587 : : /*
1588 : : * We'll need to insert a Sort node, so include costs for that. We
1589 : : * choose to use incremental sort if it is enabled and there are
1590 : : * presorted keys; otherwise we use full sort.
1591 : : *
1592 : : * We can use the parent's LIMIT if any, since we certainly won't
1593 : : * pull more than that many tuples from any child.
1594 : : */
1595 [ + - + + ]: 494 : if (enable_incremental_sort && presorted_keys > 0)
1596 : : {
1597 : 15 : cost_incremental_sort(&sort_path,
1598 : : root,
1599 : : pathkeys,
1600 : : presorted_keys,
1601 : : subpath->disabled_nodes,
1602 : : subpath->startup_cost,
1603 : : subpath->total_cost,
1604 : : subpath->rows,
1605 : 15 : subpath->pathtarget->width,
1606 : : 0.0,
1607 : : work_mem,
1608 : : pathnode->limit_tuples);
1609 : : }
1610 : : else
1611 : : {
1612 : 479 : cost_sort(&sort_path,
1613 : : root,
1614 : : pathkeys,
1615 : : subpath->disabled_nodes,
1616 : : subpath->total_cost,
1617 : : subpath->rows,
1618 : 479 : subpath->pathtarget->width,
1619 : : 0.0,
1620 : : work_mem,
1621 : : pathnode->limit_tuples);
1622 : : }
1623 : :
1624 : 494 : subpath = &sort_path;
1625 : : }
1626 : :
1627 : 19623 : input_disabled_nodes += subpath->disabled_nodes;
1628 : 19623 : input_startup_cost += subpath->startup_cost;
1629 : 19623 : input_total_cost += subpath->total_cost;
1630 : : }
1631 : :
1632 : : /*
1633 : : * Now we can compute total costs of the MergeAppend. If there's exactly
1634 : : * one child path and its parallel awareness matches that of the
1635 : : * MergeAppend, then the MergeAppend is a no-op and will be discarded
1636 : : * later (in setrefs.c); otherwise we do the normal cost calculation.
1637 : : */
1638 [ + + ]: 7465 : if (list_length(subpaths) == 1 &&
1639 : 95 : ((Path *) linitial(subpaths))->parallel_aware ==
1640 [ + - ]: 95 : pathnode->path.parallel_aware)
1641 : : {
1642 : 95 : pathnode->path.disabled_nodes = input_disabled_nodes;
1643 : 95 : pathnode->path.startup_cost = input_startup_cost;
1644 : 95 : pathnode->path.total_cost = input_total_cost;
1645 : : }
1646 : : else
1647 : 7370 : cost_merge_append(&pathnode->path, root,
1648 : : pathkeys, list_length(subpaths),
1649 : : input_disabled_nodes,
1650 : : input_startup_cost, input_total_cost,
1651 : : pathnode->path.rows);
1652 : :
1653 : 7465 : return pathnode;
1654 : : }
1655 : :
1656 : : /*
1657 : : * create_group_result_path
1658 : : * Creates a path representing a Result-and-nothing-else plan.
1659 : : *
1660 : : * This is only used for degenerate grouping cases, in which we know we
1661 : : * need to produce one result row, possibly filtered by a HAVING qual.
1662 : : */
1663 : : GroupResultPath *
1664 : 138240 : create_group_result_path(PlannerInfo *root, RelOptInfo *rel,
1665 : : PathTarget *target, List *havingqual)
1666 : : {
1667 : 138240 : GroupResultPath *pathnode = makeNode(GroupResultPath);
1668 : :
1669 : 138240 : pathnode->path.pathtype = T_Result;
1670 : 138240 : pathnode->path.parent = rel;
1671 : 138240 : pathnode->path.pathtarget = target;
1672 : 138240 : pathnode->path.param_info = NULL; /* there are no other rels... */
1673 : 138240 : pathnode->path.parallel_aware = false;
1674 : 138240 : pathnode->path.parallel_safe = rel->consider_parallel;
1675 : 138240 : pathnode->path.parallel_workers = 0;
1676 : 138240 : pathnode->path.pathkeys = NIL;
1677 : 138240 : pathnode->quals = havingqual;
1678 : :
1679 : : /*
1680 : : * We can't quite use cost_resultscan() because the quals we want to
1681 : : * account for are not baserestrict quals of the rel. Might as well just
1682 : : * hack it here.
1683 : : */
1684 : 138240 : pathnode->path.rows = 1;
1685 : 138240 : pathnode->path.startup_cost = target->cost.startup;
1686 : 138240 : pathnode->path.total_cost = target->cost.startup +
1687 : 138240 : cpu_tuple_cost + target->cost.per_tuple;
1688 : :
1689 : : /*
1690 : : * Add cost of qual, if any --- but we ignore its selectivity, since our
1691 : : * rowcount estimate should be 1 no matter what the qual is.
1692 : : */
1693 [ + + ]: 138240 : if (havingqual)
1694 : : {
1695 : : QualCost qual_cost;
1696 : :
1697 : 512 : cost_qual_eval(&qual_cost, havingqual, root);
1698 : : /* havingqual is evaluated once at startup */
1699 : 512 : pathnode->path.startup_cost += qual_cost.startup + qual_cost.per_tuple;
1700 : 512 : pathnode->path.total_cost += qual_cost.startup + qual_cost.per_tuple;
1701 : : }
1702 : :
1703 : 138240 : return pathnode;
1704 : : }
1705 : :
1706 : : /*
1707 : : * create_material_path
1708 : : * Creates a path corresponding to a Material plan, returning the
1709 : : * pathnode.
1710 : : */
1711 : : MaterialPath *
1712 : 478268 : create_material_path(RelOptInfo *rel, Path *subpath, bool enabled)
1713 : : {
1714 : 478268 : MaterialPath *pathnode = makeNode(MaterialPath);
1715 : :
1716 : : Assert(subpath->parent == rel);
1717 : :
1718 : 478268 : pathnode->path.pathtype = T_Material;
1719 : 478268 : pathnode->path.parent = rel;
1720 : 478268 : pathnode->path.pathtarget = rel->reltarget;
1721 : 478268 : pathnode->path.param_info = subpath->param_info;
1722 : 478268 : pathnode->path.parallel_aware = false;
1723 [ + + ]: 915408 : pathnode->path.parallel_safe = rel->consider_parallel &&
1724 [ + + ]: 437140 : subpath->parallel_safe;
1725 : 478268 : pathnode->path.parallel_workers = subpath->parallel_workers;
1726 : 478268 : pathnode->path.pathkeys = subpath->pathkeys;
1727 : :
1728 : 478268 : pathnode->subpath = subpath;
1729 : :
1730 : 478268 : cost_material(&pathnode->path,
1731 : : enabled,
1732 : : subpath->disabled_nodes,
1733 : : subpath->startup_cost,
1734 : : subpath->total_cost,
1735 : : subpath->rows,
1736 : 478268 : subpath->pathtarget->width);
1737 : :
1738 : 478268 : return pathnode;
1739 : : }
1740 : :
1741 : : /*
1742 : : * create_memoize_path
1743 : : * Creates a path corresponding to a Memoize plan, returning the pathnode.
1744 : : */
1745 : : MemoizePath *
1746 : 198483 : create_memoize_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath,
1747 : : List *param_exprs, List *hash_operators,
1748 : : bool singlerow, bool binary_mode, Cardinality est_calls)
1749 : : {
1750 : 198483 : MemoizePath *pathnode = makeNode(MemoizePath);
1751 : :
1752 : : Assert(subpath->parent == rel);
1753 : :
1754 : 198483 : pathnode->path.pathtype = T_Memoize;
1755 : 198483 : pathnode->path.parent = rel;
1756 : 198483 : pathnode->path.pathtarget = rel->reltarget;
1757 : 198483 : pathnode->path.param_info = subpath->param_info;
1758 : 198483 : pathnode->path.parallel_aware = false;
1759 [ + + ]: 386908 : pathnode->path.parallel_safe = rel->consider_parallel &&
1760 [ + + ]: 188425 : subpath->parallel_safe;
1761 : 198483 : pathnode->path.parallel_workers = subpath->parallel_workers;
1762 : 198483 : pathnode->path.pathkeys = subpath->pathkeys;
1763 : :
1764 : 198483 : pathnode->subpath = subpath;
1765 : 198483 : pathnode->hash_operators = hash_operators;
1766 : 198483 : pathnode->param_exprs = param_exprs;
1767 : 198483 : pathnode->singlerow = singlerow;
1768 : 198483 : pathnode->binary_mode = binary_mode;
1769 : :
1770 : : /*
1771 : : * For now we set est_entries to 0. cost_memoize_rescan() does all the
1772 : : * hard work to determine how many cache entries there are likely to be,
1773 : : * so it seems best to leave it up to that function to fill this field in.
1774 : : * If left at 0, the executor will make a guess at a good value.
1775 : : */
1776 : 198483 : pathnode->est_entries = 0;
1777 : :
1778 : 198483 : pathnode->est_calls = clamp_row_est(est_calls);
1779 : :
1780 : : /* These will also be set later in cost_memoize_rescan() */
1781 : 198483 : pathnode->est_unique_keys = 0.0;
1782 : 198483 : pathnode->est_hit_ratio = 0.0;
1783 : :
1784 : : /*
1785 : : * We should not be asked to generate this path type when memoization is
1786 : : * disabled, so set our count of disabled nodes equal to the subpath's
1787 : : * count.
1788 : : *
1789 : : * It would be nice to also Assert that memoization is enabled, but the
1790 : : * value of enable_memoize is not controlling: what we would need to check
1791 : : * is that the JoinPathExtraData's pgs_mask included PGS_NESTLOOP_MEMOIZE.
1792 : : */
1793 : 198483 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
1794 : :
1795 : : /*
1796 : : * Add a small additional charge for caching the first entry. All the
1797 : : * harder calculations for rescans are performed in cost_memoize_rescan().
1798 : : */
1799 : 198483 : pathnode->path.startup_cost = subpath->startup_cost + cpu_tuple_cost;
1800 : 198483 : pathnode->path.total_cost = subpath->total_cost + cpu_tuple_cost;
1801 : 198483 : pathnode->path.rows = subpath->rows;
1802 : :
1803 : 198483 : return pathnode;
1804 : : }
1805 : :
1806 : : /*
1807 : : * create_gather_merge_path
1808 : : *
1809 : : * Creates a path corresponding to a gather merge scan, returning
1810 : : * the pathnode.
1811 : : */
1812 : : GatherMergePath *
1813 : 15763 : create_gather_merge_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath,
1814 : : PathTarget *target, List *pathkeys,
1815 : : Relids required_outer, double *rows)
1816 : : {
1817 : 15763 : GatherMergePath *pathnode = makeNode(GatherMergePath);
1818 : 15763 : int input_disabled_nodes = 0;
1819 : 15763 : Cost input_startup_cost = 0;
1820 : 15763 : Cost input_total_cost = 0;
1821 : :
1822 : : Assert(subpath->parallel_safe);
1823 : : Assert(pathkeys);
1824 : :
1825 : : /*
1826 : : * The subpath should guarantee that it is adequately ordered either by
1827 : : * adding an explicit sort node or by using presorted input. We cannot
1828 : : * add an explicit Sort node for the subpath in createplan.c on additional
1829 : : * pathkeys, because we can't guarantee the sort would be safe. For
1830 : : * example, expressions may be volatile or otherwise parallel unsafe.
1831 : : */
1832 [ - + ]: 15763 : if (!pathkeys_contained_in(pathkeys, subpath->pathkeys))
1833 [ # # ]: 0 : elog(ERROR, "gather merge input not sufficiently sorted");
1834 : :
1835 : 15763 : pathnode->path.pathtype = T_GatherMerge;
1836 : 15763 : pathnode->path.parent = rel;
1837 : 15763 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1838 : : required_outer);
1839 : 15763 : pathnode->path.parallel_aware = false;
1840 : :
1841 : 15763 : pathnode->subpath = subpath;
1842 : 15763 : pathnode->num_workers = subpath->parallel_workers;
1843 : 15763 : pathnode->path.pathkeys = pathkeys;
1844 [ - + ]: 15763 : pathnode->path.pathtarget = target ? target : rel->reltarget;
1845 : :
1846 : 15763 : input_disabled_nodes += subpath->disabled_nodes;
1847 : 15763 : input_startup_cost += subpath->startup_cost;
1848 : 15763 : input_total_cost += subpath->total_cost;
1849 : :
1850 : 15763 : cost_gather_merge(pathnode, root, rel, pathnode->path.param_info,
1851 : : input_disabled_nodes, input_startup_cost,
1852 : : input_total_cost, rows);
1853 : :
1854 : 15763 : return pathnode;
1855 : : }
1856 : :
1857 : : /*
1858 : : * create_gather_path
1859 : : * Creates a path corresponding to a gather scan, returning the
1860 : : * pathnode.
1861 : : *
1862 : : * 'rows' may optionally be set to override row estimates from other sources.
1863 : : */
1864 : : GatherPath *
1865 : 21888 : create_gather_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath,
1866 : : PathTarget *target, Relids required_outer, double *rows)
1867 : : {
1868 : 21888 : GatherPath *pathnode = makeNode(GatherPath);
1869 : :
1870 : : Assert(subpath->parallel_safe);
1871 : :
1872 : 21888 : pathnode->path.pathtype = T_Gather;
1873 : 21888 : pathnode->path.parent = rel;
1874 : 21888 : pathnode->path.pathtarget = target;
1875 : 21888 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1876 : : required_outer);
1877 : 21888 : pathnode->path.parallel_aware = false;
1878 : 21888 : pathnode->path.parallel_safe = false;
1879 : 21888 : pathnode->path.parallel_workers = 0;
1880 : 21888 : pathnode->path.pathkeys = NIL; /* Gather has unordered result */
1881 : :
1882 : 21888 : pathnode->subpath = subpath;
1883 : 21888 : pathnode->num_workers = subpath->parallel_workers;
1884 : 21888 : pathnode->single_copy = false;
1885 : :
1886 [ - + ]: 21888 : if (pathnode->num_workers == 0)
1887 : : {
1888 : 0 : pathnode->path.pathkeys = subpath->pathkeys;
1889 : 0 : pathnode->num_workers = 1;
1890 : 0 : pathnode->single_copy = true;
1891 : : }
1892 : :
1893 : 21888 : cost_gather(pathnode, root, rel, pathnode->path.param_info, rows);
1894 : :
1895 : 21888 : return pathnode;
1896 : : }
1897 : :
1898 : : /*
1899 : : * create_subqueryscan_path
1900 : : * Creates a path corresponding to a scan of a subquery,
1901 : : * returning the pathnode.
1902 : : *
1903 : : * Caller must pass trivial_pathtarget = true if it believes rel->reltarget to
1904 : : * be trivial, ie just a fetch of all the subquery output columns in order.
1905 : : * While we could determine that here, the caller can usually do it more
1906 : : * efficiently (or at least amortize it over multiple calls).
1907 : : */
1908 : : SubqueryScanPath *
1909 : 48334 : create_subqueryscan_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath,
1910 : : bool trivial_pathtarget,
1911 : : List *pathkeys, Relids required_outer)
1912 : : {
1913 : 48334 : SubqueryScanPath *pathnode = makeNode(SubqueryScanPath);
1914 : :
1915 : 48334 : pathnode->path.pathtype = T_SubqueryScan;
1916 : 48334 : pathnode->path.parent = rel;
1917 : 48334 : pathnode->path.pathtarget = rel->reltarget;
1918 : 48334 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1919 : : required_outer);
1920 : 48334 : pathnode->path.parallel_aware = false;
1921 [ + + ]: 81018 : pathnode->path.parallel_safe = rel->consider_parallel &&
1922 [ + + ]: 32684 : subpath->parallel_safe;
1923 : 48334 : pathnode->path.parallel_workers = subpath->parallel_workers;
1924 : 48334 : pathnode->path.pathkeys = pathkeys;
1925 : 48334 : pathnode->subpath = subpath;
1926 : :
1927 : 48334 : cost_subqueryscan(pathnode, root, rel, pathnode->path.param_info,
1928 : : trivial_pathtarget);
1929 : :
1930 : 48334 : return pathnode;
1931 : : }
1932 : :
1933 : : /*
1934 : : * create_functionscan_path
1935 : : * Creates a path corresponding to a sequential scan of a function,
1936 : : * returning the pathnode.
1937 : : */
1938 : : Path *
1939 : 34905 : create_functionscan_path(PlannerInfo *root, RelOptInfo *rel,
1940 : : List *pathkeys, Relids required_outer)
1941 : : {
1942 : 34905 : Path *pathnode = makeNode(Path);
1943 : :
1944 : 34905 : pathnode->pathtype = T_FunctionScan;
1945 : 34905 : pathnode->parent = rel;
1946 : 34905 : pathnode->pathtarget = rel->reltarget;
1947 : 34905 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
1948 : : required_outer);
1949 : 34905 : pathnode->parallel_aware = false;
1950 : 34905 : pathnode->parallel_safe = rel->consider_parallel;
1951 : 34905 : pathnode->parallel_workers = 0;
1952 : 34905 : pathnode->pathkeys = pathkeys;
1953 : :
1954 : 34905 : cost_functionscan(pathnode, root, rel, pathnode->param_info);
1955 : :
1956 : 34905 : return pathnode;
1957 : : }
1958 : :
1959 : : /*
1960 : : * create_tablefuncscan_path
1961 : : * Creates a path corresponding to a sequential scan of a table function,
1962 : : * returning the pathnode.
1963 : : */
1964 : : Path *
1965 : 519 : create_tablefuncscan_path(PlannerInfo *root, RelOptInfo *rel,
1966 : : Relids required_outer)
1967 : : {
1968 : 519 : Path *pathnode = makeNode(Path);
1969 : :
1970 : 519 : pathnode->pathtype = T_TableFuncScan;
1971 : 519 : pathnode->parent = rel;
1972 : 519 : pathnode->pathtarget = rel->reltarget;
1973 : 519 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
1974 : : required_outer);
1975 : 519 : pathnode->parallel_aware = false;
1976 : 519 : pathnode->parallel_safe = rel->consider_parallel;
1977 : 519 : pathnode->parallel_workers = 0;
1978 : 519 : pathnode->pathkeys = NIL; /* result is always unordered */
1979 : :
1980 : 519 : cost_tablefuncscan(pathnode, root, rel, pathnode->param_info);
1981 : :
1982 : 519 : return pathnode;
1983 : : }
1984 : :
1985 : : /*
1986 : : * create_valuesscan_path
1987 : : * Creates a path corresponding to a scan of a VALUES list,
1988 : : * returning the pathnode.
1989 : : */
1990 : : Path *
1991 : 6962 : create_valuesscan_path(PlannerInfo *root, RelOptInfo *rel,
1992 : : Relids required_outer)
1993 : : {
1994 : 6962 : Path *pathnode = makeNode(Path);
1995 : :
1996 : 6962 : pathnode->pathtype = T_ValuesScan;
1997 : 6962 : pathnode->parent = rel;
1998 : 6962 : pathnode->pathtarget = rel->reltarget;
1999 : 6962 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
2000 : : required_outer);
2001 : 6962 : pathnode->parallel_aware = false;
2002 : 6962 : pathnode->parallel_safe = rel->consider_parallel;
2003 : 6962 : pathnode->parallel_workers = 0;
2004 : 6962 : pathnode->pathkeys = NIL; /* result is always unordered */
2005 : :
2006 : 6962 : cost_valuesscan(pathnode, root, rel, pathnode->param_info);
2007 : :
2008 : 6962 : return pathnode;
2009 : : }
2010 : :
2011 : : /*
2012 : : * create_ctescan_path
2013 : : * Creates a path corresponding to a scan of a non-self-reference CTE,
2014 : : * returning the pathnode.
2015 : : */
2016 : : Path *
2017 : 2860 : create_ctescan_path(PlannerInfo *root, RelOptInfo *rel,
2018 : : List *pathkeys, Relids required_outer)
2019 : : {
2020 : 2860 : Path *pathnode = makeNode(Path);
2021 : :
2022 : 2860 : pathnode->pathtype = T_CteScan;
2023 : 2860 : pathnode->parent = rel;
2024 : 2860 : pathnode->pathtarget = rel->reltarget;
2025 : 2860 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
2026 : : required_outer);
2027 : 2860 : pathnode->parallel_aware = false;
2028 : 2860 : pathnode->parallel_safe = rel->consider_parallel;
2029 : 2860 : pathnode->parallel_workers = 0;
2030 : 2860 : pathnode->pathkeys = pathkeys;
2031 : :
2032 : 2860 : cost_ctescan(pathnode, root, rel, pathnode->param_info);
2033 : :
2034 : 2860 : return pathnode;
2035 : : }
2036 : :
2037 : : /*
2038 : : * create_namedtuplestorescan_path
2039 : : * Creates a path corresponding to a scan of a named tuplestore, returning
2040 : : * the pathnode.
2041 : : */
2042 : : Path *
2043 : 431 : create_namedtuplestorescan_path(PlannerInfo *root, RelOptInfo *rel,
2044 : : Relids required_outer)
2045 : : {
2046 : 431 : Path *pathnode = makeNode(Path);
2047 : :
2048 : 431 : pathnode->pathtype = T_NamedTuplestoreScan;
2049 : 431 : pathnode->parent = rel;
2050 : 431 : pathnode->pathtarget = rel->reltarget;
2051 : 431 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
2052 : : required_outer);
2053 : 431 : pathnode->parallel_aware = false;
2054 : 431 : pathnode->parallel_safe = rel->consider_parallel;
2055 : 431 : pathnode->parallel_workers = 0;
2056 : 431 : pathnode->pathkeys = NIL; /* result is always unordered */
2057 : :
2058 : 431 : cost_namedtuplestorescan(pathnode, root, rel, pathnode->param_info);
2059 : :
2060 : 431 : return pathnode;
2061 : : }
2062 : :
2063 : : /*
2064 : : * create_resultscan_path
2065 : : * Creates a path corresponding to a scan of an RTE_RESULT relation,
2066 : : * returning the pathnode.
2067 : : */
2068 : : Path *
2069 : 3681 : create_resultscan_path(PlannerInfo *root, RelOptInfo *rel,
2070 : : Relids required_outer)
2071 : : {
2072 : 3681 : Path *pathnode = makeNode(Path);
2073 : :
2074 : 3681 : pathnode->pathtype = T_Result;
2075 : 3681 : pathnode->parent = rel;
2076 : 3681 : pathnode->pathtarget = rel->reltarget;
2077 : 3681 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
2078 : : required_outer);
2079 : 3681 : pathnode->parallel_aware = false;
2080 : 3681 : pathnode->parallel_safe = rel->consider_parallel;
2081 : 3681 : pathnode->parallel_workers = 0;
2082 : 3681 : pathnode->pathkeys = NIL; /* result is always unordered */
2083 : :
2084 : 3681 : cost_resultscan(pathnode, root, rel, pathnode->param_info);
2085 : :
2086 : 3681 : return pathnode;
2087 : : }
2088 : :
2089 : : /*
2090 : : * create_worktablescan_path
2091 : : * Creates a path corresponding to a scan of a self-reference CTE,
2092 : : * returning the pathnode.
2093 : : */
2094 : : Path *
2095 : 637 : create_worktablescan_path(PlannerInfo *root, RelOptInfo *rel,
2096 : : Relids required_outer)
2097 : : {
2098 : 637 : Path *pathnode = makeNode(Path);
2099 : :
2100 : 637 : pathnode->pathtype = T_WorkTableScan;
2101 : 637 : pathnode->parent = rel;
2102 : 637 : pathnode->pathtarget = rel->reltarget;
2103 : 637 : pathnode->param_info = get_baserel_parampathinfo(root, rel,
2104 : : required_outer);
2105 : 637 : pathnode->parallel_aware = false;
2106 : 637 : pathnode->parallel_safe = rel->consider_parallel;
2107 : 637 : pathnode->parallel_workers = 0;
2108 : 637 : pathnode->pathkeys = NIL; /* result is always unordered */
2109 : :
2110 : : /* Cost is the same as for a regular CTE scan */
2111 : 637 : cost_ctescan(pathnode, root, rel, pathnode->param_info);
2112 : :
2113 : 637 : return pathnode;
2114 : : }
2115 : :
2116 : : /*
2117 : : * create_foreignscan_path
2118 : : * Creates a path corresponding to a scan of a foreign base table,
2119 : : * returning the pathnode.
2120 : : *
2121 : : * This function is never called from core Postgres; rather, it's expected
2122 : : * to be called by the GetForeignPaths function of a foreign data wrapper.
2123 : : * We make the FDW supply all fields of the path, since we do not have any way
2124 : : * to calculate them in core. However, there is a usually-sane default for
2125 : : * the pathtarget (rel->reltarget), so we let a NULL for "target" select that.
2126 : : */
2127 : : ForeignPath *
2128 : 1901 : create_foreignscan_path(PlannerInfo *root, RelOptInfo *rel,
2129 : : PathTarget *target,
2130 : : double rows, int disabled_nodes,
2131 : : Cost startup_cost, Cost total_cost,
2132 : : List *pathkeys,
2133 : : Relids required_outer,
2134 : : Path *fdw_outerpath,
2135 : : List *fdw_restrictinfo,
2136 : : List *fdw_private)
2137 : : {
2138 : 1901 : ForeignPath *pathnode = makeNode(ForeignPath);
2139 : :
2140 : : /* Historically some FDWs were confused about when to use this */
2141 : : Assert(IS_SIMPLE_REL(rel));
2142 : :
2143 : 1901 : pathnode->path.pathtype = T_ForeignScan;
2144 : 1901 : pathnode->path.parent = rel;
2145 [ + - ]: 1901 : pathnode->path.pathtarget = target ? target : rel->reltarget;
2146 : 1901 : pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
2147 : : required_outer);
2148 : 1901 : pathnode->path.parallel_aware = false;
2149 : 1901 : pathnode->path.parallel_safe = rel->consider_parallel;
2150 : 1901 : pathnode->path.parallel_workers = 0;
2151 : 1901 : pathnode->path.rows = rows;
2152 : 1901 : pathnode->path.disabled_nodes = disabled_nodes;
2153 : 1901 : pathnode->path.startup_cost = startup_cost;
2154 : 1901 : pathnode->path.total_cost = total_cost;
2155 : 1901 : pathnode->path.pathkeys = pathkeys;
2156 : :
2157 : 1901 : pathnode->fdw_outerpath = fdw_outerpath;
2158 : 1901 : pathnode->fdw_restrictinfo = fdw_restrictinfo;
2159 : 1901 : pathnode->fdw_private = fdw_private;
2160 : :
2161 : 1901 : return pathnode;
2162 : : }
2163 : :
2164 : : /*
2165 : : * create_foreign_join_path
2166 : : * Creates a path corresponding to a scan of a foreign join,
2167 : : * returning the pathnode.
2168 : : *
2169 : : * This function is never called from core Postgres; rather, it's expected
2170 : : * to be called by the GetForeignJoinPaths function of a foreign data wrapper.
2171 : : * We make the FDW supply all fields of the path, since we do not have any way
2172 : : * to calculate them in core. However, there is a usually-sane default for
2173 : : * the pathtarget (rel->reltarget), so we let a NULL for "target" select that.
2174 : : */
2175 : : ForeignPath *
2176 : 607 : create_foreign_join_path(PlannerInfo *root, RelOptInfo *rel,
2177 : : PathTarget *target,
2178 : : double rows, int disabled_nodes,
2179 : : Cost startup_cost, Cost total_cost,
2180 : : List *pathkeys,
2181 : : Relids required_outer,
2182 : : Path *fdw_outerpath,
2183 : : List *fdw_restrictinfo,
2184 : : List *fdw_private)
2185 : : {
2186 : 607 : ForeignPath *pathnode = makeNode(ForeignPath);
2187 : :
2188 : : /*
2189 : : * We should use get_joinrel_parampathinfo to handle parameterized paths,
2190 : : * but the API of this function doesn't support it, and existing
2191 : : * extensions aren't yet trying to build such paths anyway. For the
2192 : : * moment just throw an error if someone tries it; eventually we should
2193 : : * revisit this.
2194 : : */
2195 [ + - - + ]: 607 : if (!bms_is_empty(required_outer) || !bms_is_empty(rel->lateral_relids))
2196 [ # # ]: 0 : elog(ERROR, "parameterized foreign joins are not supported yet");
2197 : :
2198 : 607 : pathnode->path.pathtype = T_ForeignScan;
2199 : 607 : pathnode->path.parent = rel;
2200 [ + - ]: 607 : pathnode->path.pathtarget = target ? target : rel->reltarget;
2201 : 607 : pathnode->path.param_info = NULL; /* XXX see above */
2202 : 607 : pathnode->path.parallel_aware = false;
2203 : 607 : pathnode->path.parallel_safe = rel->consider_parallel;
2204 : 607 : pathnode->path.parallel_workers = 0;
2205 : 607 : pathnode->path.rows = rows;
2206 : 607 : pathnode->path.disabled_nodes = disabled_nodes;
2207 : 607 : pathnode->path.startup_cost = startup_cost;
2208 : 607 : pathnode->path.total_cost = total_cost;
2209 : 607 : pathnode->path.pathkeys = pathkeys;
2210 : :
2211 : 607 : pathnode->fdw_outerpath = fdw_outerpath;
2212 : 607 : pathnode->fdw_restrictinfo = fdw_restrictinfo;
2213 : 607 : pathnode->fdw_private = fdw_private;
2214 : :
2215 : 607 : return pathnode;
2216 : : }
2217 : :
2218 : : /*
2219 : : * create_foreign_upper_path
2220 : : * Creates a path corresponding to an upper relation that's computed
2221 : : * directly by an FDW, returning the pathnode.
2222 : : *
2223 : : * This function is never called from core Postgres; rather, it's expected to
2224 : : * be called by the GetForeignUpperPaths function of a foreign data wrapper.
2225 : : * We make the FDW supply all fields of the path, since we do not have any way
2226 : : * to calculate them in core. However, there is a usually-sane default for
2227 : : * the pathtarget (rel->reltarget), so we let a NULL for "target" select that.
2228 : : */
2229 : : ForeignPath *
2230 : 296 : create_foreign_upper_path(PlannerInfo *root, RelOptInfo *rel,
2231 : : PathTarget *target,
2232 : : double rows, int disabled_nodes,
2233 : : Cost startup_cost, Cost total_cost,
2234 : : List *pathkeys,
2235 : : Path *fdw_outerpath,
2236 : : List *fdw_restrictinfo,
2237 : : List *fdw_private)
2238 : : {
2239 : 296 : ForeignPath *pathnode = makeNode(ForeignPath);
2240 : :
2241 : : /*
2242 : : * Upper relations should never have any lateral references, since joining
2243 : : * is complete.
2244 : : */
2245 : : Assert(bms_is_empty(rel->lateral_relids));
2246 : :
2247 : 296 : pathnode->path.pathtype = T_ForeignScan;
2248 : 296 : pathnode->path.parent = rel;
2249 [ - + ]: 296 : pathnode->path.pathtarget = target ? target : rel->reltarget;
2250 : 296 : pathnode->path.param_info = NULL;
2251 : 296 : pathnode->path.parallel_aware = false;
2252 : 296 : pathnode->path.parallel_safe = rel->consider_parallel;
2253 : 296 : pathnode->path.parallel_workers = 0;
2254 : 296 : pathnode->path.rows = rows;
2255 : 296 : pathnode->path.disabled_nodes = disabled_nodes;
2256 : 296 : pathnode->path.startup_cost = startup_cost;
2257 : 296 : pathnode->path.total_cost = total_cost;
2258 : 296 : pathnode->path.pathkeys = pathkeys;
2259 : :
2260 : 296 : pathnode->fdw_outerpath = fdw_outerpath;
2261 : 296 : pathnode->fdw_restrictinfo = fdw_restrictinfo;
2262 : 296 : pathnode->fdw_private = fdw_private;
2263 : :
2264 : 296 : return pathnode;
2265 : : }
2266 : :
2267 : : /*
2268 : : * calc_nestloop_required_outer
2269 : : * Compute the required_outer set for a nestloop join path
2270 : : *
2271 : : * Note: when considering a child join, the inputs nonetheless use top-level
2272 : : * parent relids
2273 : : *
2274 : : * Note: result must not share storage with either input
2275 : : */
2276 : : Relids
2277 : 2471140 : calc_nestloop_required_outer(Relids outerrelids,
2278 : : Relids outer_paramrels,
2279 : : Relids innerrelids,
2280 : : Relids inner_paramrels)
2281 : : {
2282 : : Relids required_outer;
2283 : :
2284 : : /* inner_path can require rels from outer path, but not vice versa */
2285 : : Assert(!bms_overlap(outer_paramrels, innerrelids));
2286 : : /* easy case if inner path is not parameterized */
2287 [ + + ]: 2471140 : if (!inner_paramrels)
2288 : 1739448 : return bms_copy(outer_paramrels);
2289 : : /* else, form the union ... */
2290 : 731692 : required_outer = bms_union(outer_paramrels, inner_paramrels);
2291 : : /* ... and remove any mention of now-satisfied outer rels */
2292 : 731692 : required_outer = bms_del_members(required_outer,
2293 : : outerrelids);
2294 : 731692 : return required_outer;
2295 : : }
2296 : :
2297 : : /*
2298 : : * calc_non_nestloop_required_outer
2299 : : * Compute the required_outer set for a merge or hash join path
2300 : : *
2301 : : * Note: result must not share storage with either input
2302 : : */
2303 : : Relids
2304 : 1579388 : calc_non_nestloop_required_outer(Path *outer_path, Path *inner_path)
2305 : : {
2306 [ + + ]: 1579388 : Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
2307 [ + + ]: 1579388 : Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
2308 : : Relids innerrelids PG_USED_FOR_ASSERTS_ONLY;
2309 : : Relids outerrelids PG_USED_FOR_ASSERTS_ONLY;
2310 : : Relids required_outer;
2311 : :
2312 : : /*
2313 : : * Any parameterization of the input paths refers to topmost parents of
2314 : : * the relevant relations, because reparameterize_path_by_child() hasn't
2315 : : * been called yet. So we must consider topmost parents of the relations
2316 : : * being joined, too, while checking for disallowed parameterization
2317 : : * cases.
2318 : : */
2319 [ + + ]: 1579388 : if (inner_path->parent->top_parent_relids)
2320 : 115969 : innerrelids = inner_path->parent->top_parent_relids;
2321 : : else
2322 : 1463419 : innerrelids = inner_path->parent->relids;
2323 : :
2324 [ + + ]: 1579388 : if (outer_path->parent->top_parent_relids)
2325 : 115969 : outerrelids = outer_path->parent->top_parent_relids;
2326 : : else
2327 : 1463419 : outerrelids = outer_path->parent->relids;
2328 : :
2329 : : /* neither path can require rels from the other */
2330 : : Assert(!bms_overlap(outer_paramrels, innerrelids));
2331 : : Assert(!bms_overlap(inner_paramrels, outerrelids));
2332 : : /* form the union ... */
2333 : 1579388 : required_outer = bms_union(outer_paramrels, inner_paramrels);
2334 : : /* we do not need an explicit test for empty; bms_union gets it right */
2335 : 1579388 : return required_outer;
2336 : : }
2337 : :
2338 : : /*
2339 : : * create_nestloop_path
2340 : : * Creates a pathnode corresponding to a nestloop join between two
2341 : : * relations.
2342 : : *
2343 : : * 'joinrel' is the join relation.
2344 : : * 'jointype' is the type of join required
2345 : : * 'workspace' is the result from initial_cost_nestloop
2346 : : * 'extra' contains various information about the join
2347 : : * 'outer_path' is the outer path
2348 : : * 'inner_path' is the inner path
2349 : : * 'restrict_clauses' are the RestrictInfo nodes to apply at the join
2350 : : * 'pathkeys' are the path keys of the new join path
2351 : : * 'required_outer' is the set of required outer rels
2352 : : *
2353 : : * Returns the resulting path node.
2354 : : */
2355 : : NestPath *
2356 : 1080160 : create_nestloop_path(PlannerInfo *root,
2357 : : RelOptInfo *joinrel,
2358 : : JoinType jointype,
2359 : : JoinCostWorkspace *workspace,
2360 : : JoinPathExtraData *extra,
2361 : : Path *outer_path,
2362 : : Path *inner_path,
2363 : : List *restrict_clauses,
2364 : : List *pathkeys,
2365 : : Relids required_outer)
2366 : : {
2367 : 1080160 : NestPath *pathnode = makeNode(NestPath);
2368 [ + + ]: 1080160 : Relids inner_req_outer = PATH_REQ_OUTER(inner_path);
2369 : : Relids outerrelids;
2370 : :
2371 : : /*
2372 : : * Paths are parameterized by top-level parents, so run parameterization
2373 : : * tests on the parent relids.
2374 : : */
2375 [ + + ]: 1080160 : if (outer_path->parent->top_parent_relids)
2376 : 66149 : outerrelids = outer_path->parent->top_parent_relids;
2377 : : else
2378 : 1014011 : outerrelids = outer_path->parent->relids;
2379 : :
2380 : : /*
2381 : : * If the inner path is parameterized by the outer, we must drop any
2382 : : * restrict_clauses that are due to be moved into the inner path. We have
2383 : : * to do this now, rather than postpone the work till createplan time,
2384 : : * because the restrict_clauses list can affect the size and cost
2385 : : * estimates for this path. We detect such clauses by checking for serial
2386 : : * number match to clauses already enforced in the inner path.
2387 : : */
2388 [ + + ]: 1080160 : if (bms_overlap(inner_req_outer, outerrelids))
2389 : : {
2390 : 277076 : Bitmapset *enforced_serials = get_param_path_clause_serials(inner_path);
2391 : 277076 : List *jclauses = NIL;
2392 : : ListCell *lc;
2393 : :
2394 [ + + + + : 607341 : foreach(lc, restrict_clauses)
+ + ]
2395 : : {
2396 : 330265 : RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
2397 : :
2398 [ + + ]: 330265 : if (!bms_is_member(rinfo->rinfo_serial, enforced_serials))
2399 : 43565 : jclauses = lappend(jclauses, rinfo);
2400 : : }
2401 : 277076 : restrict_clauses = jclauses;
2402 : : }
2403 : :
2404 : 1080160 : pathnode->jpath.path.pathtype = T_NestLoop;
2405 : 1080160 : pathnode->jpath.path.parent = joinrel;
2406 : 1080160 : pathnode->jpath.path.pathtarget = joinrel->reltarget;
2407 : 1080160 : pathnode->jpath.path.param_info =
2408 : 1080160 : get_joinrel_parampathinfo(root,
2409 : : joinrel,
2410 : : outer_path,
2411 : : inner_path,
2412 : : extra->sjinfo,
2413 : : required_outer,
2414 : : &restrict_clauses);
2415 : 1080160 : pathnode->jpath.path.parallel_aware = false;
2416 : 3138229 : pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2417 [ + + + + : 1080160 : outer_path->parallel_safe && inner_path->parallel_safe;
+ + ]
2418 : : /* This is a foolish way to estimate parallel_workers, but for now... */
2419 : 1080160 : pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2420 : 1080160 : pathnode->jpath.path.pathkeys = pathkeys;
2421 : 1080160 : pathnode->jpath.jointype = jointype;
2422 : 1080160 : pathnode->jpath.inner_unique = extra->inner_unique;
2423 : 1080160 : pathnode->jpath.outerjoinpath = outer_path;
2424 : 1080160 : pathnode->jpath.innerjoinpath = inner_path;
2425 : 1080160 : pathnode->jpath.joinrestrictinfo = restrict_clauses;
2426 : :
2427 : 1080160 : final_cost_nestloop(root, pathnode, workspace, extra);
2428 : :
2429 : 1080160 : return pathnode;
2430 : : }
2431 : :
2432 : : /*
2433 : : * create_mergejoin_path
2434 : : * Creates a pathnode corresponding to a mergejoin join between
2435 : : * two relations
2436 : : *
2437 : : * 'joinrel' is the join relation
2438 : : * 'jointype' is the type of join required
2439 : : * 'workspace' is the result from initial_cost_mergejoin
2440 : : * 'extra' contains various information about the join
2441 : : * 'outer_path' is the outer path
2442 : : * 'inner_path' is the inner path
2443 : : * 'restrict_clauses' are the RestrictInfo nodes to apply at the join
2444 : : * 'pathkeys' are the path keys of the new join path
2445 : : * 'required_outer' is the set of required outer rels
2446 : : * 'mergeclauses' are the RestrictInfo nodes to use as merge clauses
2447 : : * (this should be a subset of the restrict_clauses list)
2448 : : * 'outersortkeys' are the sort varkeys for the outer relation
2449 : : * 'innersortkeys' are the sort varkeys for the inner relation
2450 : : * 'outer_presorted_keys' is the number of presorted keys of the outer path
2451 : : */
2452 : : MergePath *
2453 : 330441 : create_mergejoin_path(PlannerInfo *root,
2454 : : RelOptInfo *joinrel,
2455 : : JoinType jointype,
2456 : : JoinCostWorkspace *workspace,
2457 : : JoinPathExtraData *extra,
2458 : : Path *outer_path,
2459 : : Path *inner_path,
2460 : : List *restrict_clauses,
2461 : : List *pathkeys,
2462 : : Relids required_outer,
2463 : : List *mergeclauses,
2464 : : List *outersortkeys,
2465 : : List *innersortkeys,
2466 : : int outer_presorted_keys)
2467 : : {
2468 : 330441 : MergePath *pathnode = makeNode(MergePath);
2469 : :
2470 : 330441 : pathnode->jpath.path.pathtype = T_MergeJoin;
2471 : 330441 : pathnode->jpath.path.parent = joinrel;
2472 : 330441 : pathnode->jpath.path.pathtarget = joinrel->reltarget;
2473 : 330441 : pathnode->jpath.path.param_info =
2474 : 330441 : get_joinrel_parampathinfo(root,
2475 : : joinrel,
2476 : : outer_path,
2477 : : inner_path,
2478 : : extra->sjinfo,
2479 : : required_outer,
2480 : : &restrict_clauses);
2481 : 330441 : pathnode->jpath.path.parallel_aware = false;
2482 : 965950 : pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2483 [ + + + + : 330441 : outer_path->parallel_safe && inner_path->parallel_safe;
+ + ]
2484 : : /* This is a foolish way to estimate parallel_workers, but for now... */
2485 : 330441 : pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2486 : 330441 : pathnode->jpath.path.pathkeys = pathkeys;
2487 : 330441 : pathnode->jpath.jointype = jointype;
2488 : 330441 : pathnode->jpath.inner_unique = extra->inner_unique;
2489 : 330441 : pathnode->jpath.outerjoinpath = outer_path;
2490 : 330441 : pathnode->jpath.innerjoinpath = inner_path;
2491 : 330441 : pathnode->jpath.joinrestrictinfo = restrict_clauses;
2492 : 330441 : pathnode->path_mergeclauses = mergeclauses;
2493 : 330441 : pathnode->outersortkeys = outersortkeys;
2494 : 330441 : pathnode->innersortkeys = innersortkeys;
2495 : 330441 : pathnode->outer_presorted_keys = outer_presorted_keys;
2496 : : /* pathnode->skip_mark_restore will be set by final_cost_mergejoin */
2497 : : /* pathnode->materialize_inner will be set by final_cost_mergejoin */
2498 : :
2499 : 330441 : final_cost_mergejoin(root, pathnode, workspace, extra);
2500 : :
2501 : 330441 : return pathnode;
2502 : : }
2503 : :
2504 : : /*
2505 : : * create_hashjoin_path
2506 : : * Creates a pathnode corresponding to a hash join between two relations.
2507 : : *
2508 : : * 'joinrel' is the join relation
2509 : : * 'jointype' is the type of join required
2510 : : * 'workspace' is the result from initial_cost_hashjoin
2511 : : * 'extra' contains various information about the join
2512 : : * 'outer_path' is the cheapest outer path
2513 : : * 'inner_path' is the cheapest inner path
2514 : : * 'parallel_hash' to select Parallel Hash of inner path (shared hash table)
2515 : : * 'restrict_clauses' are the RestrictInfo nodes to apply at the join
2516 : : * 'required_outer' is the set of required outer rels
2517 : : * 'hashclauses' are the RestrictInfo nodes to use as hash clauses
2518 : : * (this should be a subset of the restrict_clauses list)
2519 : : */
2520 : : HashPath *
2521 : 337744 : create_hashjoin_path(PlannerInfo *root,
2522 : : RelOptInfo *joinrel,
2523 : : JoinType jointype,
2524 : : JoinCostWorkspace *workspace,
2525 : : JoinPathExtraData *extra,
2526 : : Path *outer_path,
2527 : : Path *inner_path,
2528 : : bool parallel_hash,
2529 : : List *restrict_clauses,
2530 : : Relids required_outer,
2531 : : List *hashclauses)
2532 : : {
2533 : 337744 : HashPath *pathnode = makeNode(HashPath);
2534 : :
2535 : 337744 : pathnode->jpath.path.pathtype = T_HashJoin;
2536 : 337744 : pathnode->jpath.path.parent = joinrel;
2537 : 337744 : pathnode->jpath.path.pathtarget = joinrel->reltarget;
2538 : 337744 : pathnode->jpath.path.param_info =
2539 : 337744 : get_joinrel_parampathinfo(root,
2540 : : joinrel,
2541 : : outer_path,
2542 : : inner_path,
2543 : : extra->sjinfo,
2544 : : required_outer,
2545 : : &restrict_clauses);
2546 : 337744 : pathnode->jpath.path.parallel_aware =
2547 [ + + + + ]: 337744 : joinrel->consider_parallel && parallel_hash;
2548 : 986552 : pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2549 [ + + + + : 337744 : outer_path->parallel_safe && inner_path->parallel_safe;
+ + ]
2550 : : /* This is a foolish way to estimate parallel_workers, but for now... */
2551 : 337744 : pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2552 : :
2553 : : /*
2554 : : * A hashjoin never has pathkeys, since its output ordering is
2555 : : * unpredictable due to possible batching. XXX If the inner relation is
2556 : : * small enough, we could instruct the executor that it must not batch,
2557 : : * and then we could assume that the output inherits the outer relation's
2558 : : * ordering, which might save a sort step. However there is considerable
2559 : : * downside if our estimate of the inner relation size is badly off. For
2560 : : * the moment we don't risk it. (Note also that if we wanted to take this
2561 : : * seriously, joinpath.c would have to consider many more paths for the
2562 : : * outer rel than it does now.)
2563 : : */
2564 : 337744 : pathnode->jpath.path.pathkeys = NIL;
2565 : 337744 : pathnode->jpath.jointype = jointype;
2566 : 337744 : pathnode->jpath.inner_unique = extra->inner_unique;
2567 : 337744 : pathnode->jpath.outerjoinpath = outer_path;
2568 : 337744 : pathnode->jpath.innerjoinpath = inner_path;
2569 : 337744 : pathnode->jpath.joinrestrictinfo = restrict_clauses;
2570 : 337744 : pathnode->path_hashclauses = hashclauses;
2571 : : /* final_cost_hashjoin will fill in pathnode->num_batches */
2572 : :
2573 : 337744 : final_cost_hashjoin(root, pathnode, workspace, extra);
2574 : :
2575 : 337744 : return pathnode;
2576 : : }
2577 : :
2578 : : /*
2579 : : * create_projection_path
2580 : : * Creates a pathnode that represents performing a projection.
2581 : : *
2582 : : * 'rel' is the parent relation associated with the result
2583 : : * 'subpath' is the path representing the source of data
2584 : : * 'target' is the PathTarget to be computed
2585 : : */
2586 : : ProjectionPath *
2587 : 312636 : create_projection_path(PlannerInfo *root,
2588 : : RelOptInfo *rel,
2589 : : Path *subpath,
2590 : : PathTarget *target)
2591 : : {
2592 : 312636 : ProjectionPath *pathnode = makeNode(ProjectionPath);
2593 : : PathTarget *oldtarget;
2594 : :
2595 : : /*
2596 : : * We mustn't put a ProjectionPath directly above another; it's useless
2597 : : * and will confuse create_projection_plan. Rather than making sure all
2598 : : * callers handle that, let's implement it here, by stripping off any
2599 : : * ProjectionPath in what we're given. Given this rule, there won't be
2600 : : * more than one.
2601 : : */
2602 [ + + ]: 312636 : if (IsA(subpath, ProjectionPath))
2603 : : {
2604 : 20 : ProjectionPath *subpp = (ProjectionPath *) subpath;
2605 : :
2606 : : Assert(subpp->path.parent == rel);
2607 : 20 : subpath = subpp->subpath;
2608 : : Assert(!IsA(subpath, ProjectionPath));
2609 : : }
2610 : :
2611 : 312636 : pathnode->path.pathtype = T_Result;
2612 : 312636 : pathnode->path.parent = rel;
2613 : 312636 : pathnode->path.pathtarget = target;
2614 : 312636 : pathnode->path.param_info = subpath->param_info;
2615 : 312636 : pathnode->path.parallel_aware = false;
2616 : 737341 : pathnode->path.parallel_safe = rel->consider_parallel &&
2617 [ + + + + : 417483 : subpath->parallel_safe &&
+ - ]
2618 : 104847 : is_parallel_safe(root, (Node *) target->exprs);
2619 : 312636 : pathnode->path.parallel_workers = subpath->parallel_workers;
2620 : : /* Projection does not change the sort order */
2621 : 312636 : pathnode->path.pathkeys = subpath->pathkeys;
2622 : :
2623 : 312636 : pathnode->subpath = subpath;
2624 : :
2625 : : /*
2626 : : * We might not need a separate Result node. If the input plan node type
2627 : : * can project, we can just tell it to project something else. Or, if it
2628 : : * can't project but the desired target has the same expression list as
2629 : : * what the input will produce anyway, we can still give it the desired
2630 : : * tlist (possibly changing its ressortgroupref labels, but nothing else).
2631 : : * Note: in the latter case, create_projection_plan has to recheck our
2632 : : * conclusion; see comments therein.
2633 : : */
2634 : 312636 : oldtarget = subpath->pathtarget;
2635 [ + + + + ]: 326725 : if (is_projection_capable_path(subpath) ||
2636 : 14089 : equal(oldtarget->exprs, target->exprs))
2637 : : {
2638 : : /* No separate Result node needed */
2639 : 300034 : pathnode->dummypp = true;
2640 : :
2641 : : /*
2642 : : * Set cost of plan as subpath's cost, adjusted for tlist replacement.
2643 : : */
2644 : 300034 : pathnode->path.rows = subpath->rows;
2645 : 300034 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
2646 : 300034 : pathnode->path.startup_cost = subpath->startup_cost +
2647 : 300034 : (target->cost.startup - oldtarget->cost.startup);
2648 : 300034 : pathnode->path.total_cost = subpath->total_cost +
2649 : 300034 : (target->cost.startup - oldtarget->cost.startup) +
2650 : 300034 : (target->cost.per_tuple - oldtarget->cost.per_tuple) * subpath->rows;
2651 : : }
2652 : : else
2653 : : {
2654 : : /* We really do need the Result node */
2655 : 12602 : pathnode->dummypp = false;
2656 : :
2657 : : /*
2658 : : * The Result node's cost is cpu_tuple_cost per row, plus the cost of
2659 : : * evaluating the tlist. There is no qual to worry about.
2660 : : */
2661 : 12602 : pathnode->path.rows = subpath->rows;
2662 : 12602 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
2663 : 12602 : pathnode->path.startup_cost = subpath->startup_cost +
2664 : 12602 : target->cost.startup;
2665 : 12602 : pathnode->path.total_cost = subpath->total_cost +
2666 : 12602 : target->cost.startup +
2667 : 12602 : (cpu_tuple_cost + target->cost.per_tuple) * subpath->rows;
2668 : : }
2669 : :
2670 : 312636 : return pathnode;
2671 : : }
2672 : :
2673 : : /*
2674 : : * apply_projection_to_path
2675 : : * Add a projection step, or just apply the target directly to given path.
2676 : : *
2677 : : * This has the same net effect as create_projection_path(), except that if
2678 : : * a separate Result plan node isn't needed, we just replace the given path's
2679 : : * pathtarget with the desired one. This must be used only when the caller
2680 : : * knows that the given path isn't referenced elsewhere and so can be modified
2681 : : * in-place.
2682 : : *
2683 : : * If the input path is a GatherPath or GatherMergePath, we try to push the
2684 : : * new target down to its input as well; this is a yet more invasive
2685 : : * modification of the input path, which create_projection_path() can't do.
2686 : : *
2687 : : * Note that we mustn't change the source path's parent link; so when it is
2688 : : * add_path'd to "rel" things will be a bit inconsistent. So far that has
2689 : : * not caused any trouble.
2690 : : *
2691 : : * 'rel' is the parent relation associated with the result
2692 : : * 'path' is the path representing the source of data
2693 : : * 'target' is the PathTarget to be computed
2694 : : */
2695 : : Path *
2696 : 11639 : apply_projection_to_path(PlannerInfo *root,
2697 : : RelOptInfo *rel,
2698 : : Path *path,
2699 : : PathTarget *target)
2700 : : {
2701 : : QualCost oldcost;
2702 : :
2703 : : /*
2704 : : * If given path can't project, we might need a Result node, so make a
2705 : : * separate ProjectionPath.
2706 : : */
2707 [ + + ]: 11639 : if (!is_projection_capable_path(path))
2708 : 1078 : return (Path *) create_projection_path(root, rel, path, target);
2709 : :
2710 : : /*
2711 : : * We can just jam the desired tlist into the existing path, being sure to
2712 : : * update its cost estimates appropriately.
2713 : : */
2714 : 10561 : oldcost = path->pathtarget->cost;
2715 : 10561 : path->pathtarget = target;
2716 : :
2717 : 10561 : path->startup_cost += target->cost.startup - oldcost.startup;
2718 : 10561 : path->total_cost += target->cost.startup - oldcost.startup +
2719 : 10561 : (target->cost.per_tuple - oldcost.per_tuple) * path->rows;
2720 : :
2721 : : /*
2722 : : * If the path happens to be a Gather or GatherMerge path, we'd like to
2723 : : * arrange for the subpath to return the required target list so that
2724 : : * workers can help project. But if there is something that is not
2725 : : * parallel-safe in the target expressions, then we can't.
2726 : : */
2727 [ + - + + : 10581 : if ((IsA(path, GatherPath) || IsA(path, GatherMergePath)) &&
+ - ]
2728 : 20 : is_parallel_safe(root, (Node *) target->exprs))
2729 : : {
2730 : : /*
2731 : : * We always use create_projection_path here, even if the subpath is
2732 : : * projection-capable, so as to avoid modifying the subpath in place.
2733 : : * It seems unlikely at present that there could be any other
2734 : : * references to the subpath, but better safe than sorry.
2735 : : *
2736 : : * Note that we don't change the parallel path's cost estimates; it
2737 : : * might be appropriate to do so, to reflect the fact that the bulk of
2738 : : * the target evaluation will happen in workers.
2739 : : */
2740 [ - + ]: 20 : if (IsA(path, GatherPath))
2741 : : {
2742 : 0 : GatherPath *gpath = (GatherPath *) path;
2743 : :
2744 : 0 : gpath->subpath = (Path *)
2745 : 0 : create_projection_path(root,
2746 : 0 : gpath->subpath->parent,
2747 : : gpath->subpath,
2748 : : target);
2749 : : }
2750 : : else
2751 : : {
2752 : 20 : GatherMergePath *gmpath = (GatherMergePath *) path;
2753 : :
2754 : 20 : gmpath->subpath = (Path *)
2755 : 20 : create_projection_path(root,
2756 : 20 : gmpath->subpath->parent,
2757 : : gmpath->subpath,
2758 : : target);
2759 : : }
2760 : : }
2761 [ + + ]: 10541 : else if (path->parallel_safe &&
2762 [ + + ]: 3722 : !is_parallel_safe(root, (Node *) target->exprs))
2763 : : {
2764 : : /*
2765 : : * We're inserting a parallel-restricted target list into a path
2766 : : * currently marked parallel-safe, so we have to mark it as no longer
2767 : : * safe.
2768 : : */
2769 : 10 : path->parallel_safe = false;
2770 : : }
2771 : :
2772 : 10561 : return path;
2773 : : }
2774 : :
2775 : : /*
2776 : : * create_set_projection_path
2777 : : * Creates a pathnode that represents performing a projection that
2778 : : * includes set-returning functions.
2779 : : *
2780 : : * 'rel' is the parent relation associated with the result
2781 : : * 'subpath' is the path representing the source of data
2782 : : * 'target' is the PathTarget to be computed
2783 : : */
2784 : : ProjectSetPath *
2785 : 10286 : create_set_projection_path(PlannerInfo *root,
2786 : : RelOptInfo *rel,
2787 : : Path *subpath,
2788 : : PathTarget *target)
2789 : : {
2790 : 10286 : ProjectSetPath *pathnode = makeNode(ProjectSetPath);
2791 : : double tlist_rows;
2792 : : ListCell *lc;
2793 : :
2794 : 10286 : pathnode->path.pathtype = T_ProjectSet;
2795 : 10286 : pathnode->path.parent = rel;
2796 : 10286 : pathnode->path.pathtarget = target;
2797 : : /* For now, assume we are above any joins, so no parameterization */
2798 : 10286 : pathnode->path.param_info = NULL;
2799 : 10286 : pathnode->path.parallel_aware = false;
2800 : 24156 : pathnode->path.parallel_safe = rel->consider_parallel &&
2801 [ + + + + : 13841 : subpath->parallel_safe &&
+ - ]
2802 : 3555 : is_parallel_safe(root, (Node *) target->exprs);
2803 : 10286 : pathnode->path.parallel_workers = subpath->parallel_workers;
2804 : : /* Projection does not change the sort order XXX? */
2805 : 10286 : pathnode->path.pathkeys = subpath->pathkeys;
2806 : :
2807 : 10286 : pathnode->subpath = subpath;
2808 : :
2809 : : /*
2810 : : * Estimate number of rows produced by SRFs for each row of input; if
2811 : : * there's more than one in this node, use the maximum.
2812 : : */
2813 : 10286 : tlist_rows = 1;
2814 [ + - + + : 22486 : foreach(lc, target->exprs)
+ + ]
2815 : : {
2816 : 12200 : Node *node = (Node *) lfirst(lc);
2817 : : double itemrows;
2818 : :
2819 : 12200 : itemrows = expression_returns_set_rows(root, node);
2820 [ + + ]: 12200 : if (tlist_rows < itemrows)
2821 : 9913 : tlist_rows = itemrows;
2822 : : }
2823 : :
2824 : : /*
2825 : : * In addition to the cost of evaluating the tlist, charge cpu_tuple_cost
2826 : : * per input row, and half of cpu_tuple_cost for each added output row.
2827 : : * This is slightly bizarre maybe, but it's what 9.6 did; we may revisit
2828 : : * this estimate later.
2829 : : */
2830 : 10286 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
2831 : 10286 : pathnode->path.rows = subpath->rows * tlist_rows;
2832 : 10286 : pathnode->path.startup_cost = subpath->startup_cost +
2833 : 10286 : target->cost.startup;
2834 : 10286 : pathnode->path.total_cost = subpath->total_cost +
2835 : 10286 : target->cost.startup +
2836 : 10286 : (cpu_tuple_cost + target->cost.per_tuple) * subpath->rows +
2837 : 10286 : (pathnode->path.rows - subpath->rows) * cpu_tuple_cost / 2;
2838 : :
2839 : 10286 : return pathnode;
2840 : : }
2841 : :
2842 : : /*
2843 : : * create_incremental_sort_path
2844 : : * Creates a pathnode that represents performing an incremental sort.
2845 : : *
2846 : : * 'rel' is the parent relation associated with the result
2847 : : * 'subpath' is the path representing the source of data
2848 : : * 'pathkeys' represents the desired sort order
2849 : : * 'presorted_keys' is the number of keys by which the input path is
2850 : : * already sorted
2851 : : * 'limit_tuples' is the estimated bound on the number of output tuples,
2852 : : * or -1 if no LIMIT or couldn't estimate
2853 : : */
2854 : : IncrementalSortPath *
2855 : 7951 : create_incremental_sort_path(PlannerInfo *root,
2856 : : RelOptInfo *rel,
2857 : : Path *subpath,
2858 : : List *pathkeys,
2859 : : int presorted_keys,
2860 : : double limit_tuples)
2861 : : {
2862 : 7951 : IncrementalSortPath *sort = makeNode(IncrementalSortPath);
2863 : 7951 : SortPath *pathnode = &sort->spath;
2864 : :
2865 : 7951 : pathnode->path.pathtype = T_IncrementalSort;
2866 : 7951 : pathnode->path.parent = rel;
2867 : : /* Sort doesn't project, so use source path's pathtarget */
2868 : 7951 : pathnode->path.pathtarget = subpath->pathtarget;
2869 : 7951 : pathnode->path.param_info = subpath->param_info;
2870 : 7951 : pathnode->path.parallel_aware = false;
2871 [ + + ]: 11993 : pathnode->path.parallel_safe = rel->consider_parallel &&
2872 [ + + ]: 4042 : subpath->parallel_safe;
2873 : 7951 : pathnode->path.parallel_workers = subpath->parallel_workers;
2874 : 7951 : pathnode->path.pathkeys = pathkeys;
2875 : :
2876 : 7951 : pathnode->subpath = subpath;
2877 : :
2878 : 7951 : cost_incremental_sort(&pathnode->path,
2879 : : root, pathkeys, presorted_keys,
2880 : : subpath->disabled_nodes,
2881 : : subpath->startup_cost,
2882 : : subpath->total_cost,
2883 : : subpath->rows,
2884 : 7951 : subpath->pathtarget->width,
2885 : : 0.0, /* XXX comparison_cost shouldn't be 0? */
2886 : : work_mem, limit_tuples);
2887 : :
2888 : 7951 : sort->nPresortedCols = presorted_keys;
2889 : :
2890 : 7951 : return sort;
2891 : : }
2892 : :
2893 : : /*
2894 : : * create_sort_path
2895 : : * Creates a pathnode that represents performing an explicit sort.
2896 : : *
2897 : : * 'rel' is the parent relation associated with the result
2898 : : * 'subpath' is the path representing the source of data
2899 : : * 'pathkeys' represents the desired sort order
2900 : : * 'limit_tuples' is the estimated bound on the number of output tuples,
2901 : : * or -1 if no LIMIT or couldn't estimate
2902 : : */
2903 : : SortPath *
2904 : 96523 : create_sort_path(PlannerInfo *root,
2905 : : RelOptInfo *rel,
2906 : : Path *subpath,
2907 : : List *pathkeys,
2908 : : double limit_tuples)
2909 : : {
2910 : 96523 : SortPath *pathnode = makeNode(SortPath);
2911 : :
2912 : 96523 : pathnode->path.pathtype = T_Sort;
2913 : 96523 : pathnode->path.parent = rel;
2914 : : /* Sort doesn't project, so use source path's pathtarget */
2915 : 96523 : pathnode->path.pathtarget = subpath->pathtarget;
2916 : 96523 : pathnode->path.param_info = subpath->param_info;
2917 : 96523 : pathnode->path.parallel_aware = false;
2918 [ + + ]: 168827 : pathnode->path.parallel_safe = rel->consider_parallel &&
2919 [ + + ]: 72304 : subpath->parallel_safe;
2920 : 96523 : pathnode->path.parallel_workers = subpath->parallel_workers;
2921 : 96523 : pathnode->path.pathkeys = pathkeys;
2922 : :
2923 : 96523 : pathnode->subpath = subpath;
2924 : :
2925 : 96523 : cost_sort(&pathnode->path, root, pathkeys,
2926 : : subpath->disabled_nodes,
2927 : : subpath->total_cost,
2928 : : subpath->rows,
2929 : 96523 : subpath->pathtarget->width,
2930 : : 0.0, /* XXX comparison_cost shouldn't be 0? */
2931 : : work_mem, limit_tuples);
2932 : :
2933 : 96523 : return pathnode;
2934 : : }
2935 : :
2936 : : /*
2937 : : * create_group_path
2938 : : * Creates a pathnode that represents performing grouping of presorted input
2939 : : *
2940 : : * 'rel' is the parent relation associated with the result
2941 : : * 'subpath' is the path representing the source of data
2942 : : * 'target' is the PathTarget to be computed
2943 : : * 'groupClause' is a list of SortGroupClause's representing the grouping
2944 : : * 'qual' is the HAVING quals if any
2945 : : * 'numGroups' is the estimated number of groups
2946 : : */
2947 : : GroupPath *
2948 : 1053 : create_group_path(PlannerInfo *root,
2949 : : RelOptInfo *rel,
2950 : : Path *subpath,
2951 : : List *groupClause,
2952 : : List *qual,
2953 : : double numGroups)
2954 : : {
2955 : 1053 : GroupPath *pathnode = makeNode(GroupPath);
2956 : 1053 : PathTarget *target = rel->reltarget;
2957 : :
2958 : 1053 : pathnode->path.pathtype = T_Group;
2959 : 1053 : pathnode->path.parent = rel;
2960 : 1053 : pathnode->path.pathtarget = target;
2961 : : /* For now, assume we are above any joins, so no parameterization */
2962 : 1053 : pathnode->path.param_info = NULL;
2963 : 1053 : pathnode->path.parallel_aware = false;
2964 [ + + ]: 1687 : pathnode->path.parallel_safe = rel->consider_parallel &&
2965 [ + + ]: 634 : subpath->parallel_safe;
2966 : 1053 : pathnode->path.parallel_workers = subpath->parallel_workers;
2967 : : /* Group doesn't change sort ordering */
2968 : 1053 : pathnode->path.pathkeys = subpath->pathkeys;
2969 : :
2970 : 1053 : pathnode->subpath = subpath;
2971 : :
2972 : 1053 : pathnode->groupClause = groupClause;
2973 : 1053 : pathnode->qual = qual;
2974 : :
2975 : 1053 : cost_group(&pathnode->path, root,
2976 : : list_length(groupClause),
2977 : : numGroups,
2978 : : qual,
2979 : : subpath->disabled_nodes,
2980 : : subpath->startup_cost, subpath->total_cost,
2981 : : subpath->rows);
2982 : :
2983 : : /* add tlist eval cost for each output row */
2984 : 1053 : pathnode->path.startup_cost += target->cost.startup;
2985 : 1053 : pathnode->path.total_cost += target->cost.startup +
2986 : 1053 : target->cost.per_tuple * pathnode->path.rows;
2987 : :
2988 : 1053 : return pathnode;
2989 : : }
2990 : :
2991 : : /*
2992 : : * create_unique_path
2993 : : * Creates a pathnode that represents performing an explicit Unique step
2994 : : * on presorted input.
2995 : : *
2996 : : * 'rel' is the parent relation associated with the result
2997 : : * 'subpath' is the path representing the source of data
2998 : : * 'numCols' is the number of grouping columns
2999 : : * 'numGroups' is the estimated number of groups
3000 : : *
3001 : : * The input path must be sorted on the grouping columns, plus possibly
3002 : : * additional columns; so the first numCols pathkeys are the grouping columns
3003 : : */
3004 : : UniquePath *
3005 : 17783 : create_unique_path(PlannerInfo *root,
3006 : : RelOptInfo *rel,
3007 : : Path *subpath,
3008 : : int numCols,
3009 : : double numGroups)
3010 : : {
3011 : 17783 : UniquePath *pathnode = makeNode(UniquePath);
3012 : :
3013 : 17783 : pathnode->path.pathtype = T_Unique;
3014 : 17783 : pathnode->path.parent = rel;
3015 : : /* Unique doesn't project, so use source path's pathtarget */
3016 : 17783 : pathnode->path.pathtarget = subpath->pathtarget;
3017 : 17783 : pathnode->path.param_info = subpath->param_info;
3018 : 17783 : pathnode->path.parallel_aware = false;
3019 [ + + ]: 32150 : pathnode->path.parallel_safe = rel->consider_parallel &&
3020 [ + + ]: 14367 : subpath->parallel_safe;
3021 : 17783 : pathnode->path.parallel_workers = subpath->parallel_workers;
3022 : : /* Unique doesn't change the input ordering */
3023 : 17783 : pathnode->path.pathkeys = subpath->pathkeys;
3024 : :
3025 : 17783 : pathnode->subpath = subpath;
3026 : 17783 : pathnode->numkeys = numCols;
3027 : :
3028 : : /*
3029 : : * Charge one cpu_operator_cost per comparison per input tuple. We assume
3030 : : * all columns get compared at most of the tuples. (XXX probably this is
3031 : : * an overestimate.)
3032 : : */
3033 : 17783 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
3034 : 17783 : pathnode->path.startup_cost = subpath->startup_cost;
3035 : 17783 : pathnode->path.total_cost = subpath->total_cost +
3036 : 17783 : cpu_operator_cost * subpath->rows * numCols;
3037 : 17783 : pathnode->path.rows = numGroups;
3038 : :
3039 : 17783 : return pathnode;
3040 : : }
3041 : :
3042 : : /*
3043 : : * create_agg_path
3044 : : * Creates a pathnode that represents performing aggregation/grouping
3045 : : *
3046 : : * 'rel' is the parent relation associated with the result
3047 : : * 'subpath' is the path representing the source of data
3048 : : * 'target' is the PathTarget to be computed
3049 : : * 'aggstrategy' is the Agg node's basic implementation strategy
3050 : : * 'aggsplit' is the Agg node's aggregate-splitting mode
3051 : : * 'groupClause' is a list of SortGroupClause's representing the grouping
3052 : : * 'qual' is the HAVING quals if any
3053 : : * 'aggcosts' contains cost info about the aggregate functions to be computed
3054 : : * 'numGroups' is the estimated number of groups (1 if not grouping)
3055 : : */
3056 : : AggPath *
3057 : 69108 : create_agg_path(PlannerInfo *root,
3058 : : RelOptInfo *rel,
3059 : : Path *subpath,
3060 : : PathTarget *target,
3061 : : AggStrategy aggstrategy,
3062 : : AggSplit aggsplit,
3063 : : List *groupClause,
3064 : : List *qual,
3065 : : const AggClauseCosts *aggcosts,
3066 : : double numGroups)
3067 : : {
3068 : 69108 : AggPath *pathnode = makeNode(AggPath);
3069 : :
3070 : 69108 : pathnode->path.pathtype = T_Agg;
3071 : 69108 : pathnode->path.parent = rel;
3072 : 69108 : pathnode->path.pathtarget = target;
3073 : 69108 : pathnode->path.param_info = subpath->param_info;
3074 : 69108 : pathnode->path.parallel_aware = false;
3075 [ + + ]: 119599 : pathnode->path.parallel_safe = rel->consider_parallel &&
3076 [ + + ]: 50491 : subpath->parallel_safe;
3077 : 69108 : pathnode->path.parallel_workers = subpath->parallel_workers;
3078 : :
3079 [ + + ]: 69108 : if (aggstrategy == AGG_SORTED)
3080 : : {
3081 : : /*
3082 : : * Attempt to preserve the order of the subpath. Additional pathkeys
3083 : : * may have been added in adjust_group_pathkeys_for_groupagg() to
3084 : : * support ORDER BY / DISTINCT aggregates. Pathkeys added there
3085 : : * belong to columns within the aggregate function, so we must strip
3086 : : * these additional pathkeys off as those columns are unavailable
3087 : : * above the aggregate node.
3088 : : */
3089 [ + + ]: 11856 : if (list_length(subpath->pathkeys) > root->num_groupby_pathkeys)
3090 : 636 : pathnode->path.pathkeys = list_copy_head(subpath->pathkeys,
3091 : : root->num_groupby_pathkeys);
3092 : : else
3093 : 11220 : pathnode->path.pathkeys = subpath->pathkeys; /* preserves order */
3094 : : }
3095 : : else
3096 : 57252 : pathnode->path.pathkeys = NIL; /* output is unordered */
3097 : :
3098 : 69108 : pathnode->subpath = subpath;
3099 : :
3100 : 69108 : pathnode->aggstrategy = aggstrategy;
3101 : 69108 : pathnode->aggsplit = aggsplit;
3102 : 69108 : pathnode->numGroups = numGroups;
3103 [ + + ]: 69108 : pathnode->transitionSpace = aggcosts ? aggcosts->transitionSpace : 0;
3104 : 69108 : pathnode->groupClause = groupClause;
3105 : 69108 : pathnode->qual = qual;
3106 : :
3107 : 69108 : cost_agg(&pathnode->path, root,
3108 : : aggstrategy, aggcosts,
3109 : : list_length(groupClause), numGroups,
3110 : : qual,
3111 : : subpath->disabled_nodes,
3112 : : subpath->startup_cost, subpath->total_cost,
3113 : 69108 : subpath->rows, subpath->pathtarget->width);
3114 : :
3115 : : /* add tlist eval cost for each output row */
3116 : 69108 : pathnode->path.startup_cost += target->cost.startup;
3117 : 69108 : pathnode->path.total_cost += target->cost.startup +
3118 : 69108 : target->cost.per_tuple * pathnode->path.rows;
3119 : :
3120 : 69108 : return pathnode;
3121 : : }
3122 : :
3123 : : /*
3124 : : * create_groupingsets_path
3125 : : * Creates a pathnode that represents performing GROUPING SETS aggregation
3126 : : *
3127 : : * GroupingSetsPath represents sorted grouping with one or more grouping sets.
3128 : : * The input path's result must be sorted to match the last entry in
3129 : : * rollup_groupclauses.
3130 : : *
3131 : : * 'rel' is the parent relation associated with the result
3132 : : * 'subpath' is the path representing the source of data
3133 : : * 'target' is the PathTarget to be computed
3134 : : * 'having_qual' is the HAVING quals if any
3135 : : * 'rollups' is a list of RollupData nodes
3136 : : * 'agg_costs' contains cost info about the aggregate functions to be computed
3137 : : */
3138 : : GroupingSetsPath *
3139 : 2244 : create_groupingsets_path(PlannerInfo *root,
3140 : : RelOptInfo *rel,
3141 : : Path *subpath,
3142 : : List *having_qual,
3143 : : AggStrategy aggstrategy,
3144 : : List *rollups,
3145 : : const AggClauseCosts *agg_costs)
3146 : : {
3147 : 2244 : GroupingSetsPath *pathnode = makeNode(GroupingSetsPath);
3148 : 2244 : PathTarget *target = rel->reltarget;
3149 : : ListCell *lc;
3150 : 2244 : bool is_first = true;
3151 : 2244 : bool is_first_sort = true;
3152 : :
3153 : : /* The topmost generated Plan node will be an Agg */
3154 : 2244 : pathnode->path.pathtype = T_Agg;
3155 : 2244 : pathnode->path.parent = rel;
3156 : 2244 : pathnode->path.pathtarget = target;
3157 : 2244 : pathnode->path.param_info = subpath->param_info;
3158 : 2244 : pathnode->path.parallel_aware = false;
3159 [ + + ]: 3425 : pathnode->path.parallel_safe = rel->consider_parallel &&
3160 [ + + ]: 1181 : subpath->parallel_safe;
3161 : 2244 : pathnode->path.parallel_workers = subpath->parallel_workers;
3162 : 2244 : pathnode->subpath = subpath;
3163 : :
3164 : : /*
3165 : : * Simplify callers by downgrading AGG_SORTED to AGG_PLAIN, and AGG_MIXED
3166 : : * to AGG_HASHED, here if possible.
3167 : : */
3168 [ + + + + ]: 3195 : if (aggstrategy == AGG_SORTED &&
3169 : 951 : list_length(rollups) == 1 &&
3170 [ + + ]: 445 : ((RollupData *) linitial(rollups))->groupClause == NIL)
3171 : 50 : aggstrategy = AGG_PLAIN;
3172 : :
3173 [ + + - + ]: 3210 : if (aggstrategy == AGG_MIXED &&
3174 : 966 : list_length(rollups) == 1)
3175 : 0 : aggstrategy = AGG_HASHED;
3176 : :
3177 : : /*
3178 : : * Output will be in sorted order by group_pathkeys if, and only if, there
3179 : : * is a single rollup operation on a non-empty list of grouping
3180 : : * expressions.
3181 : : */
3182 [ + + + + ]: 2244 : if (aggstrategy == AGG_SORTED && list_length(rollups) == 1)
3183 : 395 : pathnode->path.pathkeys = root->group_pathkeys;
3184 : : else
3185 : 1849 : pathnode->path.pathkeys = NIL;
3186 : :
3187 : 2244 : pathnode->aggstrategy = aggstrategy;
3188 : 2244 : pathnode->rollups = rollups;
3189 : 2244 : pathnode->qual = having_qual;
3190 [ + - ]: 2244 : pathnode->transitionSpace = agg_costs ? agg_costs->transitionSpace : 0;
3191 : :
3192 : : Assert(rollups != NIL);
3193 : : Assert(aggstrategy != AGG_PLAIN || list_length(rollups) == 1);
3194 : : Assert(aggstrategy != AGG_MIXED || list_length(rollups) > 1);
3195 : :
3196 [ + - + + : 7560 : foreach(lc, rollups)
+ + ]
3197 : : {
3198 : 5316 : RollupData *rollup = lfirst(lc);
3199 : 5316 : List *gsets = rollup->gsets;
3200 : 5316 : int numGroupCols = list_length(linitial(gsets));
3201 : :
3202 : : /*
3203 : : * In AGG_SORTED or AGG_PLAIN mode, the first rollup takes the
3204 : : * (already-sorted) input, and following ones do their own sort.
3205 : : *
3206 : : * In AGG_HASHED mode, there is one rollup for each grouping set.
3207 : : *
3208 : : * In AGG_MIXED mode, the first rollups are hashed, the first
3209 : : * non-hashed one takes the (already-sorted) input, and following ones
3210 : : * do their own sort.
3211 : : */
3212 [ + + ]: 5316 : if (is_first)
3213 : : {
3214 : 2244 : cost_agg(&pathnode->path, root,
3215 : : aggstrategy,
3216 : : agg_costs,
3217 : : numGroupCols,
3218 : : rollup->numGroups,
3219 : : having_qual,
3220 : : subpath->disabled_nodes,
3221 : : subpath->startup_cost,
3222 : : subpath->total_cost,
3223 : : subpath->rows,
3224 : 2244 : subpath->pathtarget->width);
3225 : 2244 : is_first = false;
3226 [ + + ]: 2244 : if (!rollup->is_hashed)
3227 : 951 : is_first_sort = false;
3228 : : }
3229 : : else
3230 : : {
3231 : : Path sort_path; /* dummy for result of cost_sort */
3232 : : Path agg_path; /* dummy for result of cost_agg */
3233 : :
3234 [ + + + + ]: 3072 : if (rollup->is_hashed || is_first_sort)
3235 : : {
3236 : : /*
3237 : : * Account for cost of aggregation, but don't charge input
3238 : : * cost again
3239 : : */
3240 : 2316 : cost_agg(&agg_path, root,
3241 : 2316 : rollup->is_hashed ? AGG_HASHED : AGG_SORTED,
3242 : : agg_costs,
3243 : : numGroupCols,
3244 : : rollup->numGroups,
3245 : : having_qual,
3246 : : 0, 0.0, 0.0,
3247 : : subpath->rows,
3248 [ + + ]: 2316 : subpath->pathtarget->width);
3249 [ + + ]: 2316 : if (!rollup->is_hashed)
3250 : 966 : is_first_sort = false;
3251 : : }
3252 : : else
3253 : : {
3254 : : /* Account for cost of sort, but don't charge input cost again */
3255 : 756 : cost_sort(&sort_path, root, NIL, 0,
3256 : : 0.0,
3257 : : subpath->rows,
3258 : 756 : subpath->pathtarget->width,
3259 : : 0.0,
3260 : : work_mem,
3261 : : -1.0);
3262 : :
3263 : : /* Account for cost of aggregation */
3264 : :
3265 : 756 : cost_agg(&agg_path, root,
3266 : : AGG_SORTED,
3267 : : agg_costs,
3268 : : numGroupCols,
3269 : : rollup->numGroups,
3270 : : having_qual,
3271 : : sort_path.disabled_nodes,
3272 : : sort_path.startup_cost,
3273 : : sort_path.total_cost,
3274 : : sort_path.rows,
3275 : 756 : subpath->pathtarget->width);
3276 : : }
3277 : :
3278 : 3072 : pathnode->path.disabled_nodes += agg_path.disabled_nodes;
3279 : 3072 : pathnode->path.total_cost += agg_path.total_cost;
3280 : 3072 : pathnode->path.rows += agg_path.rows;
3281 : : }
3282 : : }
3283 : :
3284 : : /* add tlist eval cost for each output row */
3285 : 2244 : pathnode->path.startup_cost += target->cost.startup;
3286 : 2244 : pathnode->path.total_cost += target->cost.startup +
3287 : 2244 : target->cost.per_tuple * pathnode->path.rows;
3288 : :
3289 : 2244 : return pathnode;
3290 : : }
3291 : :
3292 : : /*
3293 : : * create_minmaxagg_path
3294 : : * Creates a pathnode that represents computation of MIN/MAX aggregates
3295 : : *
3296 : : * 'rel' is the parent relation associated with the result
3297 : : * 'target' is the PathTarget to be computed
3298 : : * 'mmaggregates' is a list of MinMaxAggInfo structs
3299 : : * 'quals' is the HAVING quals if any
3300 : : */
3301 : : MinMaxAggPath *
3302 : 331 : create_minmaxagg_path(PlannerInfo *root,
3303 : : RelOptInfo *rel,
3304 : : PathTarget *target,
3305 : : List *mmaggregates,
3306 : : List *quals)
3307 : : {
3308 : 331 : MinMaxAggPath *pathnode = makeNode(MinMaxAggPath);
3309 : : Cost initplan_cost;
3310 : 331 : int initplan_disabled_nodes = 0;
3311 : : ListCell *lc;
3312 : :
3313 : : /* The topmost generated Plan node will be a Result */
3314 : 331 : pathnode->path.pathtype = T_Result;
3315 : 331 : pathnode->path.parent = rel;
3316 : 331 : pathnode->path.pathtarget = target;
3317 : : /* For now, assume we are above any joins, so no parameterization */
3318 : 331 : pathnode->path.param_info = NULL;
3319 : 331 : pathnode->path.parallel_aware = false;
3320 : 331 : pathnode->path.parallel_safe = true; /* might change below */
3321 : 331 : pathnode->path.parallel_workers = 0;
3322 : : /* Result is one unordered row */
3323 : 331 : pathnode->path.rows = 1;
3324 : 331 : pathnode->path.pathkeys = NIL;
3325 : :
3326 : 331 : pathnode->mmaggregates = mmaggregates;
3327 : 331 : pathnode->quals = quals;
3328 : :
3329 : : /* Calculate cost of all the initplans, and check parallel safety */
3330 : 331 : initplan_cost = 0;
3331 [ + - + + : 696 : foreach(lc, mmaggregates)
+ + ]
3332 : : {
3333 : 365 : MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);
3334 : :
3335 : 365 : initplan_disabled_nodes += mminfo->path->disabled_nodes;
3336 : 365 : initplan_cost += mminfo->pathcost;
3337 [ + + ]: 365 : if (!mminfo->path->parallel_safe)
3338 : 83 : pathnode->path.parallel_safe = false;
3339 : : }
3340 : :
3341 : : /* add tlist eval cost for each output row, plus cpu_tuple_cost */
3342 : 331 : pathnode->path.disabled_nodes = initplan_disabled_nodes;
3343 : 331 : pathnode->path.startup_cost = initplan_cost + target->cost.startup;
3344 : 331 : pathnode->path.total_cost = initplan_cost + target->cost.startup +
3345 : 331 : target->cost.per_tuple + cpu_tuple_cost;
3346 : :
3347 : : /*
3348 : : * Add cost of qual, if any --- but we ignore its selectivity, since our
3349 : : * rowcount estimate should be 1 no matter what the qual is.
3350 : : */
3351 [ - + ]: 331 : if (quals)
3352 : : {
3353 : : QualCost qual_cost;
3354 : :
3355 : 0 : cost_qual_eval(&qual_cost, quals, root);
3356 : 0 : pathnode->path.startup_cost += qual_cost.startup;
3357 : 0 : pathnode->path.total_cost += qual_cost.startup + qual_cost.per_tuple;
3358 : : }
3359 : :
3360 : : /*
3361 : : * If the initplans were all parallel-safe, also check safety of the
3362 : : * target and quals. (The Result node itself isn't parallelizable, but if
3363 : : * we are in a subquery then it can be useful for the outer query to know
3364 : : * that this one is parallel-safe.)
3365 : : */
3366 [ + + ]: 331 : if (pathnode->path.parallel_safe)
3367 : 252 : pathnode->path.parallel_safe =
3368 [ + - + - ]: 504 : is_parallel_safe(root, (Node *) target->exprs) &&
3369 : 504 : is_parallel_safe(root, (Node *) quals);
3370 : :
3371 : 331 : return pathnode;
3372 : : }
3373 : :
3374 : : /*
3375 : : * create_windowagg_path
3376 : : * Creates a pathnode that represents computation of window functions
3377 : : *
3378 : : * 'rel' is the parent relation associated with the result
3379 : : * 'subpath' is the path representing the source of data
3380 : : * 'target' is the PathTarget to be computed
3381 : : * 'windowFuncs' is a list of WindowFunc structs
3382 : : * 'runCondition' is a list of OpExprs to short-circuit WindowAgg execution
3383 : : * 'winclause' is a WindowClause that is common to all the WindowFuncs
3384 : : * 'qual' WindowClause.runconditions from lower-level WindowAggPaths.
3385 : : * Must always be NIL when topwindow == false
3386 : : * 'topwindow' pass as true only for the top-level WindowAgg. False for all
3387 : : * intermediate WindowAggs.
3388 : : *
3389 : : * The input must be sorted according to the WindowClause's PARTITION keys
3390 : : * plus ORDER BY keys.
3391 : : */
3392 : : WindowAggPath *
3393 : 2544 : create_windowagg_path(PlannerInfo *root,
3394 : : RelOptInfo *rel,
3395 : : Path *subpath,
3396 : : PathTarget *target,
3397 : : List *windowFuncs,
3398 : : List *runCondition,
3399 : : WindowClause *winclause,
3400 : : List *qual,
3401 : : bool topwindow)
3402 : : {
3403 : 2544 : WindowAggPath *pathnode = makeNode(WindowAggPath);
3404 : :
3405 : : /* qual can only be set for the topwindow */
3406 : : Assert(qual == NIL || topwindow);
3407 : :
3408 : 2544 : pathnode->path.pathtype = T_WindowAgg;
3409 : 2544 : pathnode->path.parent = rel;
3410 : 2544 : pathnode->path.pathtarget = target;
3411 : : /* For now, assume we are above any joins, so no parameterization */
3412 : 2544 : pathnode->path.param_info = NULL;
3413 : 2544 : pathnode->path.parallel_aware = false;
3414 [ - + ]: 2544 : pathnode->path.parallel_safe = rel->consider_parallel &&
3415 [ # # ]: 0 : subpath->parallel_safe;
3416 : 2544 : pathnode->path.parallel_workers = subpath->parallel_workers;
3417 : : /* WindowAgg preserves the input sort order */
3418 : 2544 : pathnode->path.pathkeys = subpath->pathkeys;
3419 : :
3420 : 2544 : pathnode->subpath = subpath;
3421 : 2544 : pathnode->winclause = winclause;
3422 : 2544 : pathnode->qual = qual;
3423 : 2544 : pathnode->runCondition = runCondition;
3424 : 2544 : pathnode->topwindow = topwindow;
3425 : :
3426 : : /*
3427 : : * For costing purposes, assume that there are no redundant partitioning
3428 : : * or ordering columns; it's not worth the trouble to deal with that
3429 : : * corner case here. So we just pass the unmodified list lengths to
3430 : : * cost_windowagg.
3431 : : */
3432 : 2544 : cost_windowagg(&pathnode->path, root,
3433 : : windowFuncs,
3434 : : winclause,
3435 : : subpath->disabled_nodes,
3436 : : subpath->startup_cost,
3437 : : subpath->total_cost,
3438 : : subpath->rows);
3439 : :
3440 : : /* add tlist eval cost for each output row */
3441 : 2544 : pathnode->path.startup_cost += target->cost.startup;
3442 : 2544 : pathnode->path.total_cost += target->cost.startup +
3443 : 2544 : target->cost.per_tuple * pathnode->path.rows;
3444 : :
3445 : 2544 : return pathnode;
3446 : : }
3447 : :
3448 : : /*
3449 : : * create_setop_path
3450 : : * Creates a pathnode that represents computation of INTERSECT or EXCEPT
3451 : : *
3452 : : * 'rel' is the parent relation associated with the result
3453 : : * 'leftpath' is the path representing the left-hand source of data
3454 : : * 'rightpath' is the path representing the right-hand source of data
3455 : : * 'cmd' is the specific semantics (INTERSECT or EXCEPT, with/without ALL)
3456 : : * 'strategy' is the implementation strategy (sorted or hashed)
3457 : : * 'groupList' is a list of SortGroupClause's representing the grouping
3458 : : * 'numGroups' is the estimated number of distinct groups in left-hand input
3459 : : * 'outputRows' is the estimated number of output rows
3460 : : *
3461 : : * leftpath and rightpath must produce the same columns. Moreover, if
3462 : : * strategy is SETOP_SORTED, leftpath and rightpath must both be sorted
3463 : : * by all the grouping columns.
3464 : : */
3465 : : SetOpPath *
3466 : 1148 : create_setop_path(PlannerInfo *root,
3467 : : RelOptInfo *rel,
3468 : : Path *leftpath,
3469 : : Path *rightpath,
3470 : : SetOpCmd cmd,
3471 : : SetOpStrategy strategy,
3472 : : List *groupList,
3473 : : double numGroups,
3474 : : double outputRows)
3475 : : {
3476 : 1148 : SetOpPath *pathnode = makeNode(SetOpPath);
3477 : :
3478 : 1148 : pathnode->path.pathtype = T_SetOp;
3479 : 1148 : pathnode->path.parent = rel;
3480 : 1148 : pathnode->path.pathtarget = rel->reltarget;
3481 : : /* For now, assume we are above any joins, so no parameterization */
3482 : 1148 : pathnode->path.param_info = NULL;
3483 : 1148 : pathnode->path.parallel_aware = false;
3484 : 2296 : pathnode->path.parallel_safe = rel->consider_parallel &&
3485 [ - + - - : 1148 : leftpath->parallel_safe && rightpath->parallel_safe;
- - ]
3486 : 1148 : pathnode->path.parallel_workers =
3487 : 1148 : leftpath->parallel_workers + rightpath->parallel_workers;
3488 : : /* SetOp preserves the input sort order if in sort mode */
3489 : 1148 : pathnode->path.pathkeys =
3490 [ + + ]: 1148 : (strategy == SETOP_SORTED) ? leftpath->pathkeys : NIL;
3491 : :
3492 : 1148 : pathnode->leftpath = leftpath;
3493 : 1148 : pathnode->rightpath = rightpath;
3494 : 1148 : pathnode->cmd = cmd;
3495 : 1148 : pathnode->strategy = strategy;
3496 : 1148 : pathnode->groupList = groupList;
3497 : 1148 : pathnode->numGroups = numGroups;
3498 : :
3499 : : /*
3500 : : * Compute cost estimates. As things stand, we end up with the same total
3501 : : * cost in this node for sort and hash methods, but different startup
3502 : : * costs. This could be refined perhaps, but it'll do for now.
3503 : : */
3504 : 1148 : pathnode->path.disabled_nodes =
3505 : 1148 : leftpath->disabled_nodes + rightpath->disabled_nodes;
3506 [ + + ]: 1148 : if (strategy == SETOP_SORTED)
3507 : : {
3508 : : /*
3509 : : * In sorted mode, we can emit output incrementally. Charge one
3510 : : * cpu_operator_cost per comparison per input tuple. Like cost_group,
3511 : : * we assume all columns get compared at most of the tuples.
3512 : : */
3513 : 599 : pathnode->path.startup_cost =
3514 : 599 : leftpath->startup_cost + rightpath->startup_cost;
3515 : 599 : pathnode->path.total_cost =
3516 : 1198 : leftpath->total_cost + rightpath->total_cost +
3517 : 599 : cpu_operator_cost * (leftpath->rows + rightpath->rows) * list_length(groupList);
3518 : :
3519 : : /*
3520 : : * Also charge a small amount per extracted tuple. Like cost_sort,
3521 : : * charge only operator cost not cpu_tuple_cost, since SetOp does no
3522 : : * qual-checking or projection.
3523 : : */
3524 : 599 : pathnode->path.total_cost += cpu_operator_cost * outputRows;
3525 : : }
3526 : : else
3527 : : {
3528 : : Size hashtablesize;
3529 : :
3530 : : /*
3531 : : * In hashed mode, we must read all the input before we can emit
3532 : : * anything. Also charge comparison costs to represent the cost of
3533 : : * hash table lookups.
3534 : : */
3535 : 549 : pathnode->path.startup_cost =
3536 : 1098 : leftpath->total_cost + rightpath->total_cost +
3537 : 549 : cpu_operator_cost * (leftpath->rows + rightpath->rows) * list_length(groupList);
3538 : 549 : pathnode->path.total_cost = pathnode->path.startup_cost;
3539 : :
3540 : : /*
3541 : : * Also charge a small amount per extracted tuple. Like cost_sort,
3542 : : * charge only operator cost not cpu_tuple_cost, since SetOp does no
3543 : : * qual-checking or projection.
3544 : : */
3545 : 549 : pathnode->path.total_cost += cpu_operator_cost * outputRows;
3546 : :
3547 : : /*
3548 : : * Mark the path as disabled if enable_hashagg is off. While this
3549 : : * isn't exactly a HashAgg node, it seems close enough to justify
3550 : : * letting that switch control it.
3551 : : */
3552 [ + + ]: 549 : if (!enable_hashagg)
3553 : 95 : pathnode->path.disabled_nodes++;
3554 : :
3555 : : /*
3556 : : * Also disable if it doesn't look like the hashtable will fit into
3557 : : * hash_mem. (Note: reject on equality, to ensure that an estimate of
3558 : : * SIZE_MAX disables hashing regardless of the hash_mem limit.)
3559 : : */
3560 : 549 : hashtablesize = EstimateSetOpHashTableSpace(numGroups,
3561 : 549 : leftpath->pathtarget->width);
3562 [ - + ]: 549 : if (hashtablesize >= get_hash_memory_limit())
3563 : 0 : pathnode->path.disabled_nodes++;
3564 : : }
3565 : 1148 : pathnode->path.rows = outputRows;
3566 : :
3567 : 1148 : return pathnode;
3568 : : }
3569 : :
3570 : : /*
3571 : : * create_recursiveunion_path
3572 : : * Creates a pathnode that represents a recursive UNION node
3573 : : *
3574 : : * 'rel' is the parent relation associated with the result
3575 : : * 'leftpath' is the source of data for the non-recursive term
3576 : : * 'rightpath' is the source of data for the recursive term
3577 : : * 'target' is the PathTarget to be computed
3578 : : * 'distinctList' is a list of SortGroupClause's representing the grouping
3579 : : * 'wtParam' is the ID of Param representing work table
3580 : : * 'numGroups' is the estimated number of groups
3581 : : *
3582 : : * For recursive UNION ALL, distinctList is empty and numGroups is zero
3583 : : */
3584 : : RecursiveUnionPath *
3585 : 633 : create_recursiveunion_path(PlannerInfo *root,
3586 : : RelOptInfo *rel,
3587 : : Path *leftpath,
3588 : : Path *rightpath,
3589 : : PathTarget *target,
3590 : : List *distinctList,
3591 : : int wtParam,
3592 : : double numGroups)
3593 : : {
3594 : 633 : RecursiveUnionPath *pathnode = makeNode(RecursiveUnionPath);
3595 : :
3596 : 633 : pathnode->path.pathtype = T_RecursiveUnion;
3597 : 633 : pathnode->path.parent = rel;
3598 : 633 : pathnode->path.pathtarget = target;
3599 : : /* For now, assume we are above any joins, so no parameterization */
3600 : 633 : pathnode->path.param_info = NULL;
3601 : 633 : pathnode->path.parallel_aware = false;
3602 : 1266 : pathnode->path.parallel_safe = rel->consider_parallel &&
3603 [ - + - - : 633 : leftpath->parallel_safe && rightpath->parallel_safe;
- - ]
3604 : : /* Foolish, but we'll do it like joins for now: */
3605 : 633 : pathnode->path.parallel_workers = leftpath->parallel_workers;
3606 : : /* RecursiveUnion result is always unsorted */
3607 : 633 : pathnode->path.pathkeys = NIL;
3608 : :
3609 : 633 : pathnode->leftpath = leftpath;
3610 : 633 : pathnode->rightpath = rightpath;
3611 : 633 : pathnode->distinctList = distinctList;
3612 : 633 : pathnode->wtParam = wtParam;
3613 : 633 : pathnode->numGroups = numGroups;
3614 : :
3615 : 633 : cost_recursive_union(&pathnode->path, leftpath, rightpath);
3616 : :
3617 : 633 : return pathnode;
3618 : : }
3619 : :
3620 : : /*
3621 : : * create_lockrows_path
3622 : : * Creates a pathnode that represents acquiring row locks
3623 : : *
3624 : : * 'rel' is the parent relation associated with the result
3625 : : * 'subpath' is the path representing the source of data
3626 : : * 'rowMarks' is a list of PlanRowMark's
3627 : : * 'epqParam' is the ID of Param for EvalPlanQual re-eval
3628 : : */
3629 : : LockRowsPath *
3630 : 6831 : create_lockrows_path(PlannerInfo *root, RelOptInfo *rel,
3631 : : Path *subpath, List *rowMarks, int epqParam)
3632 : : {
3633 : 6831 : LockRowsPath *pathnode = makeNode(LockRowsPath);
3634 : :
3635 : 6831 : pathnode->path.pathtype = T_LockRows;
3636 : 6831 : pathnode->path.parent = rel;
3637 : : /* LockRows doesn't project, so use source path's pathtarget */
3638 : 6831 : pathnode->path.pathtarget = subpath->pathtarget;
3639 : : /* For now, assume we are above any joins, so no parameterization */
3640 : 6831 : pathnode->path.param_info = NULL;
3641 : 6831 : pathnode->path.parallel_aware = false;
3642 : 6831 : pathnode->path.parallel_safe = false;
3643 : 6831 : pathnode->path.parallel_workers = 0;
3644 : 6831 : pathnode->path.rows = subpath->rows;
3645 : :
3646 : : /*
3647 : : * The result cannot be assumed sorted, since locking might cause the sort
3648 : : * key columns to be replaced with new values.
3649 : : */
3650 : 6831 : pathnode->path.pathkeys = NIL;
3651 : :
3652 : 6831 : pathnode->subpath = subpath;
3653 : 6831 : pathnode->rowMarks = rowMarks;
3654 : 6831 : pathnode->epqParam = epqParam;
3655 : :
3656 : : /*
3657 : : * We should charge something extra for the costs of row locking and
3658 : : * possible refetches, but it's hard to say how much. For now, use
3659 : : * cpu_tuple_cost per row.
3660 : : */
3661 : 6831 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
3662 : 6831 : pathnode->path.startup_cost = subpath->startup_cost;
3663 : 6831 : pathnode->path.total_cost = subpath->total_cost +
3664 : 6831 : cpu_tuple_cost * subpath->rows;
3665 : :
3666 : 6831 : return pathnode;
3667 : : }
3668 : :
3669 : : /*
3670 : : * create_modifytable_path
3671 : : * Creates a pathnode that represents performing INSERT/UPDATE/DELETE/MERGE
3672 : : * mods
3673 : : *
3674 : : * 'rel' is the parent relation associated with the result
3675 : : * 'subpath' is a Path producing source data
3676 : : * 'operation' is the operation type
3677 : : * 'canSetTag' is true if we set the command tag/es_processed
3678 : : * 'nominalRelation' is the parent RT index for use of EXPLAIN
3679 : : * 'rootRelation' is the partitioned/inherited table root RTI, or 0 if none
3680 : : * 'resultRelations' is an integer list of actual RT indexes of target rel(s)
3681 : : * 'updateColnosLists' is a list of UPDATE target column number lists
3682 : : * (one sublist per rel); or NIL if not an UPDATE
3683 : : * 'withCheckOptionLists' is a list of WCO lists (one per rel)
3684 : : * 'returningLists' is a list of RETURNING tlists (one per rel)
3685 : : * 'rowMarks' is a list of PlanRowMarks (non-locking only)
3686 : : * 'onconflict' is the ON CONFLICT clause, or NULL
3687 : : * 'epqParam' is the ID of Param for EvalPlanQual re-eval
3688 : : * 'mergeActionLists' is a list of lists of MERGE actions (one per rel)
3689 : : * 'mergeJoinConditions' is a list of join conditions for MERGE (one per rel)
3690 : : */
3691 : : ModifyTablePath *
3692 : 62474 : create_modifytable_path(PlannerInfo *root, RelOptInfo *rel,
3693 : : Path *subpath,
3694 : : CmdType operation, bool canSetTag,
3695 : : Index nominalRelation, Index rootRelation,
3696 : : List *resultRelations,
3697 : : List *updateColnosLists,
3698 : : List *withCheckOptionLists, List *returningLists,
3699 : : List *rowMarks, OnConflictExpr *onconflict,
3700 : : List *mergeActionLists, List *mergeJoinConditions,
3701 : : ForPortionOfExpr *forPortionOf, int epqParam)
3702 : : {
3703 : 62474 : ModifyTablePath *pathnode = makeNode(ModifyTablePath);
3704 : :
3705 : : Assert(operation == CMD_MERGE ||
3706 : : (operation == CMD_UPDATE ?
3707 : : list_length(resultRelations) == list_length(updateColnosLists) :
3708 : : updateColnosLists == NIL));
3709 : : Assert(withCheckOptionLists == NIL ||
3710 : : list_length(resultRelations) == list_length(withCheckOptionLists));
3711 : : Assert(returningLists == NIL ||
3712 : : list_length(resultRelations) == list_length(returningLists));
3713 : :
3714 : 62474 : pathnode->path.pathtype = T_ModifyTable;
3715 : 62474 : pathnode->path.parent = rel;
3716 : : /* pathtarget is not interesting, just make it minimally valid */
3717 : 62474 : pathnode->path.pathtarget = rel->reltarget;
3718 : : /* For now, assume we are above any joins, so no parameterization */
3719 : 62474 : pathnode->path.param_info = NULL;
3720 : 62474 : pathnode->path.parallel_aware = false;
3721 : 62474 : pathnode->path.parallel_safe = false;
3722 : 62474 : pathnode->path.parallel_workers = 0;
3723 : 62474 : pathnode->path.pathkeys = NIL;
3724 : :
3725 : : /*
3726 : : * Compute cost & rowcount as subpath cost & rowcount (if RETURNING)
3727 : : *
3728 : : * Currently, we don't charge anything extra for the actual table
3729 : : * modification work, nor for the WITH CHECK OPTIONS or RETURNING
3730 : : * expressions if any. It would only be window dressing, since
3731 : : * ModifyTable is always a top-level node and there is no way for the
3732 : : * costs to change any higher-level planning choices. But we might want
3733 : : * to make it look better sometime.
3734 : : */
3735 : 62474 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
3736 : 62474 : pathnode->path.startup_cost = subpath->startup_cost;
3737 : 62474 : pathnode->path.total_cost = subpath->total_cost;
3738 [ + + ]: 62474 : if (returningLists != NIL)
3739 : : {
3740 : 2590 : pathnode->path.rows = subpath->rows;
3741 : :
3742 : : /*
3743 : : * Set width to match the subpath output. XXX this is totally wrong:
3744 : : * we should return an average of the RETURNING tlist widths. But
3745 : : * it's what happened historically, and improving it is a task for
3746 : : * another day. (Again, it's mostly window dressing.)
3747 : : */
3748 : 2590 : pathnode->path.pathtarget->width = subpath->pathtarget->width;
3749 : : }
3750 : : else
3751 : : {
3752 : 59884 : pathnode->path.rows = 0;
3753 : 59884 : pathnode->path.pathtarget->width = 0;
3754 : : }
3755 : :
3756 : 62474 : pathnode->subpath = subpath;
3757 : 62474 : pathnode->operation = operation;
3758 : 62474 : pathnode->canSetTag = canSetTag;
3759 : 62474 : pathnode->nominalRelation = nominalRelation;
3760 : 62474 : pathnode->rootRelation = rootRelation;
3761 : 62474 : pathnode->resultRelations = resultRelations;
3762 : 62474 : pathnode->updateColnosLists = updateColnosLists;
3763 : 62474 : pathnode->withCheckOptionLists = withCheckOptionLists;
3764 : 62474 : pathnode->returningLists = returningLists;
3765 : 62474 : pathnode->rowMarks = rowMarks;
3766 : 62474 : pathnode->onconflict = onconflict;
3767 : 62474 : pathnode->forPortionOf = forPortionOf;
3768 : 62474 : pathnode->epqParam = epqParam;
3769 : 62474 : pathnode->mergeActionLists = mergeActionLists;
3770 : 62474 : pathnode->mergeJoinConditions = mergeJoinConditions;
3771 : :
3772 : 62474 : return pathnode;
3773 : : }
3774 : :
3775 : : /*
3776 : : * create_limit_path
3777 : : * Creates a pathnode that represents performing LIMIT/OFFSET
3778 : : *
3779 : : * In addition to providing the actual OFFSET and LIMIT expressions,
3780 : : * the caller must provide estimates of their values for costing purposes.
3781 : : * The estimates are as computed by preprocess_limit(), ie, 0 represents
3782 : : * the clause not being present, and -1 means it's present but we could
3783 : : * not estimate its value.
3784 : : *
3785 : : * 'rel' is the parent relation associated with the result
3786 : : * 'subpath' is the path representing the source of data
3787 : : * 'limitOffset' is the actual OFFSET expression, or NULL
3788 : : * 'limitCount' is the actual LIMIT expression, or NULL
3789 : : * 'offset_est' is the estimated value of the OFFSET expression
3790 : : * 'count_est' is the estimated value of the LIMIT expression
3791 : : */
3792 : : LimitPath *
3793 : 4309 : create_limit_path(PlannerInfo *root, RelOptInfo *rel,
3794 : : Path *subpath,
3795 : : Node *limitOffset, Node *limitCount,
3796 : : LimitOption limitOption,
3797 : : int64 offset_est, int64 count_est)
3798 : : {
3799 : 4309 : LimitPath *pathnode = makeNode(LimitPath);
3800 : :
3801 : 4309 : pathnode->path.pathtype = T_Limit;
3802 : 4309 : pathnode->path.parent = rel;
3803 : : /* Limit doesn't project, so use source path's pathtarget */
3804 : 4309 : pathnode->path.pathtarget = subpath->pathtarget;
3805 : : /* For now, assume we are above any joins, so no parameterization */
3806 : 4309 : pathnode->path.param_info = NULL;
3807 : 4309 : pathnode->path.parallel_aware = false;
3808 [ + + ]: 6019 : pathnode->path.parallel_safe = rel->consider_parallel &&
3809 [ + + ]: 1710 : subpath->parallel_safe;
3810 : 4309 : pathnode->path.parallel_workers = subpath->parallel_workers;
3811 : 4309 : pathnode->path.rows = subpath->rows;
3812 : 4309 : pathnode->path.disabled_nodes = subpath->disabled_nodes;
3813 : 4309 : pathnode->path.startup_cost = subpath->startup_cost;
3814 : 4309 : pathnode->path.total_cost = subpath->total_cost;
3815 : 4309 : pathnode->path.pathkeys = subpath->pathkeys;
3816 : 4309 : pathnode->subpath = subpath;
3817 : 4309 : pathnode->limitOffset = limitOffset;
3818 : 4309 : pathnode->limitCount = limitCount;
3819 : 4309 : pathnode->limitOption = limitOption;
3820 : :
3821 : : /*
3822 : : * Adjust the output rows count and costs according to the offset/limit.
3823 : : */
3824 : 4309 : adjust_limit_rows_costs(&pathnode->path.rows,
3825 : : &pathnode->path.startup_cost,
3826 : : &pathnode->path.total_cost,
3827 : : offset_est, count_est);
3828 : :
3829 : 4309 : return pathnode;
3830 : : }
3831 : :
3832 : : /*
3833 : : * adjust_limit_rows_costs
3834 : : * Adjust the size and cost estimates for a LimitPath node according to the
3835 : : * offset/limit.
3836 : : *
3837 : : * This is only a cosmetic issue if we are at top level, but if we are
3838 : : * building a subquery then it's important to report correct info to the outer
3839 : : * planner.
3840 : : *
3841 : : * When the offset or count couldn't be estimated, use 10% of the estimated
3842 : : * number of rows emitted from the subpath.
3843 : : *
3844 : : * XXX we don't bother to add eval costs of the offset/limit expressions
3845 : : * themselves to the path costs. In theory we should, but in most cases those
3846 : : * expressions are trivial and it's just not worth the trouble.
3847 : : */
3848 : : void
3849 : 4401 : adjust_limit_rows_costs(double *rows, /* in/out parameter */
3850 : : Cost *startup_cost, /* in/out parameter */
3851 : : Cost *total_cost, /* in/out parameter */
3852 : : int64 offset_est,
3853 : : int64 count_est)
3854 : : {
3855 : 4401 : double input_rows = *rows;
3856 : 4401 : Cost input_startup_cost = *startup_cost;
3857 : 4401 : Cost input_total_cost = *total_cost;
3858 : :
3859 [ + + ]: 4401 : if (offset_est != 0)
3860 : : {
3861 : : double offset_rows;
3862 : :
3863 [ + + ]: 403 : if (offset_est > 0)
3864 : 383 : offset_rows = (double) offset_est;
3865 : : else
3866 : 20 : offset_rows = clamp_row_est(input_rows * 0.10);
3867 [ + + ]: 403 : if (offset_rows > *rows)
3868 : 23 : offset_rows = *rows;
3869 [ + - ]: 403 : if (input_rows > 0)
3870 : 403 : *startup_cost +=
3871 : 403 : (input_total_cost - input_startup_cost)
3872 : 403 : * offset_rows / input_rows;
3873 : 403 : *rows -= offset_rows;
3874 [ + + ]: 403 : if (*rows < 1)
3875 : 27 : *rows = 1;
3876 : : }
3877 : :
3878 [ + + ]: 4401 : if (count_est != 0)
3879 : : {
3880 : : double count_rows;
3881 : :
3882 [ + + ]: 4345 : if (count_est > 0)
3883 : 4340 : count_rows = (double) count_est;
3884 : : else
3885 : 5 : count_rows = clamp_row_est(input_rows * 0.10);
3886 [ + + ]: 4345 : if (count_rows > *rows)
3887 : 141 : count_rows = *rows;
3888 [ + - ]: 4345 : if (input_rows > 0)
3889 : 4345 : *total_cost = *startup_cost +
3890 : 4345 : (input_total_cost - input_startup_cost)
3891 : 4345 : * count_rows / input_rows;
3892 : 4345 : *rows = count_rows;
3893 [ - + ]: 4345 : if (*rows < 1)
3894 : 0 : *rows = 1;
3895 : : }
3896 : 4401 : }
3897 : :
3898 : :
3899 : : /*
3900 : : * reparameterize_path
3901 : : * Attempt to modify a Path to have greater parameterization
3902 : : *
3903 : : * We use this to attempt to bring all child paths of an appendrel to the
3904 : : * same parameterization level, ensuring that they all enforce the same set
3905 : : * of join quals (and thus that that parameterization can be attributed to
3906 : : * an append path built from such paths). Currently, only a few path types
3907 : : * are supported here, though more could be added at need. We return NULL
3908 : : * if we can't reparameterize the given path.
3909 : : *
3910 : : * Note: we intentionally do not pass created paths to add_path(); it would
3911 : : * possibly try to delete them on the grounds of being cost-inferior to the
3912 : : * paths they were made from, and we don't want that. Paths made here are
3913 : : * not necessarily of general-purpose usefulness, but they can be useful
3914 : : * as members of an append path.
3915 : : */
3916 : : Path *
3917 : 858 : reparameterize_path(PlannerInfo *root, Path *path,
3918 : : Relids required_outer,
3919 : : double loop_count)
3920 : : {
3921 : 858 : RelOptInfo *rel = path->parent;
3922 : :
3923 : : /* Can only increase, not decrease, path's parameterization */
3924 [ - + - + ]: 858 : if (!bms_is_subset(PATH_REQ_OUTER(path), required_outer))
3925 : 0 : return NULL;
3926 [ + - - - : 858 : switch (path->pathtype)
- + + - -
+ ]
3927 : : {
3928 : 730 : case T_SeqScan:
3929 : 730 : return create_seqscan_path(root, rel, required_outer, 0);
3930 : 0 : case T_SampleScan:
3931 : 0 : return create_samplescan_path(root, rel, required_outer);
3932 : 0 : case T_IndexScan:
3933 : : case T_IndexOnlyScan:
3934 : : {
3935 : 0 : IndexPath *ipath = (IndexPath *) path;
3936 : 0 : IndexPath *newpath = makeNode(IndexPath);
3937 : :
3938 : : /*
3939 : : * We can't use create_index_path directly, and would not want
3940 : : * to because it would re-compute the indexqual conditions
3941 : : * which is wasted effort. Instead we hack things a bit:
3942 : : * flat-copy the path node, revise its param_info, and redo
3943 : : * the cost estimate.
3944 : : */
3945 : 0 : memcpy(newpath, ipath, sizeof(IndexPath));
3946 : 0 : newpath->path.param_info =
3947 : 0 : get_baserel_parampathinfo(root, rel, required_outer);
3948 : 0 : cost_index(newpath, root, loop_count, false);
3949 : 0 : return (Path *) newpath;
3950 : : }
3951 : 0 : case T_BitmapHeapScan:
3952 : : {
3953 : 0 : BitmapHeapPath *bpath = (BitmapHeapPath *) path;
3954 : :
3955 : 0 : return (Path *) create_bitmap_heap_path(root,
3956 : : rel,
3957 : : bpath->bitmapqual,
3958 : : required_outer,
3959 : : loop_count, 0);
3960 : : }
3961 : 0 : case T_SubqueryScan:
3962 : : {
3963 : 0 : SubqueryScanPath *spath = (SubqueryScanPath *) path;
3964 : 0 : Path *subpath = spath->subpath;
3965 : : bool trivial_pathtarget;
3966 : :
3967 : : /*
3968 : : * If existing node has zero extra cost, we must have decided
3969 : : * its target is trivial. (The converse is not true, because
3970 : : * it might have a trivial target but quals to enforce; but in
3971 : : * that case the new node will too, so it doesn't matter
3972 : : * whether we get the right answer here.)
3973 : : */
3974 : 0 : trivial_pathtarget =
3975 : 0 : (subpath->total_cost == spath->path.total_cost);
3976 : :
3977 : 0 : return (Path *) create_subqueryscan_path(root,
3978 : : rel,
3979 : : subpath,
3980 : : trivial_pathtarget,
3981 : : spath->path.pathkeys,
3982 : : required_outer);
3983 : : }
3984 : 65 : case T_Result:
3985 : : /* Supported only for RTE_RESULT scan paths */
3986 [ + - ]: 65 : if (IsA(path, Path))
3987 : 65 : return create_resultscan_path(root, rel, required_outer);
3988 : 0 : break;
3989 : 5 : case T_Append:
3990 : : {
3991 : 5 : AppendPath *apath = (AppendPath *) path;
3992 : 5 : AppendPathInput new_append = {0};
3993 : : int i;
3994 : : ListCell *lc;
3995 : :
3996 : 5 : new_append.child_append_relid_sets = apath->child_append_relid_sets;
3997 : :
3998 : : /* Reparameterize the children */
3999 : 5 : i = 0;
4000 [ + - + + : 10 : foreach(lc, apath->subpaths)
+ + ]
4001 : : {
4002 : 5 : Path *spath = (Path *) lfirst(lc);
4003 : :
4004 : 5 : spath = reparameterize_path(root, spath,
4005 : : required_outer,
4006 : : loop_count);
4007 [ - + ]: 5 : if (spath == NULL)
4008 : 0 : return NULL;
4009 : : /* We have to re-split the regular and partial paths */
4010 [ + - ]: 5 : if (i < apath->first_partial_path)
4011 : 5 : new_append.subpaths = lappend(new_append.subpaths, spath);
4012 : : else
4013 : 0 : new_append.partial_subpaths = lappend(new_append.partial_subpaths, spath);
4014 : 5 : i++;
4015 : : }
4016 : 5 : return (Path *)
4017 : 5 : create_append_path(root, rel, new_append,
4018 : : apath->path.pathkeys, required_outer,
4019 : : apath->path.parallel_workers,
4020 : 5 : apath->path.parallel_aware,
4021 : : -1);
4022 : : }
4023 : 0 : case T_Material:
4024 : : {
4025 : 0 : MaterialPath *mpath = (MaterialPath *) path;
4026 : 0 : Path *spath = mpath->subpath;
4027 : : bool enabled;
4028 : :
4029 : 0 : spath = reparameterize_path(root, spath,
4030 : : required_outer,
4031 : : loop_count);
4032 [ # # ]: 0 : if (spath == NULL)
4033 : 0 : return NULL;
4034 : 0 : enabled =
4035 : 0 : (mpath->path.disabled_nodes <= spath->disabled_nodes);
4036 : 0 : return (Path *) create_material_path(rel, spath, enabled);
4037 : : }
4038 : 0 : case T_Memoize:
4039 : : {
4040 : 0 : MemoizePath *mpath = (MemoizePath *) path;
4041 : 0 : Path *spath = mpath->subpath;
4042 : :
4043 : 0 : spath = reparameterize_path(root, spath,
4044 : : required_outer,
4045 : : loop_count);
4046 [ # # ]: 0 : if (spath == NULL)
4047 : 0 : return NULL;
4048 : 0 : return (Path *) create_memoize_path(root, rel,
4049 : : spath,
4050 : : mpath->param_exprs,
4051 : : mpath->hash_operators,
4052 : 0 : mpath->singlerow,
4053 : 0 : mpath->binary_mode,
4054 : : mpath->est_calls);
4055 : : }
4056 : 58 : default:
4057 : 58 : break;
4058 : : }
4059 : 58 : return NULL;
4060 : : }
4061 : :
4062 : : /*
4063 : : * reparameterize_path_by_child
4064 : : * Given a path parameterized by the parent of the given child relation,
4065 : : * translate the path to be parameterized by the given child relation.
4066 : : *
4067 : : * Most fields in the path are not changed, but any expressions must be
4068 : : * adjusted to refer to the correct varnos, and any subpaths must be
4069 : : * recursively reparameterized. Other fields that refer to specific relids
4070 : : * also need adjustment.
4071 : : *
4072 : : * The cost, number of rows, width and parallel path properties depend upon
4073 : : * path->parent, which does not change during the translation. So we need
4074 : : * not change those.
4075 : : *
4076 : : * Currently, only a few path types are supported here, though more could be
4077 : : * added at need. We return NULL if we can't reparameterize the given path.
4078 : : *
4079 : : * Note that this function can change referenced RangeTblEntries, RelOptInfos
4080 : : * and IndexOptInfos as well as the Path structures. Therefore, it's only safe
4081 : : * to call during create_plan(), when we have made a final choice of which Path
4082 : : * to use for each RangeTblEntry/RelOptInfo/IndexOptInfo.
4083 : : *
4084 : : * Keep this code in sync with path_is_reparameterizable_by_child()!
4085 : : */
4086 : : Path *
4087 : 73161 : reparameterize_path_by_child(PlannerInfo *root, Path *path,
4088 : : RelOptInfo *child_rel)
4089 : : {
4090 : : Path *new_path;
4091 : : ParamPathInfo *new_ppi;
4092 : : ParamPathInfo *old_ppi;
4093 : : Relids required_outer;
4094 : :
4095 : : #define ADJUST_CHILD_ATTRS(node) \
4096 : : ((node) = (void *) adjust_appendrel_attrs_multilevel(root, \
4097 : : (Node *) (node), \
4098 : : child_rel, \
4099 : : child_rel->top_parent))
4100 : :
4101 : : #define REPARAMETERIZE_CHILD_PATH(path) \
4102 : : do { \
4103 : : (path) = reparameterize_path_by_child(root, (path), child_rel); \
4104 : : if ((path) == NULL) \
4105 : : return NULL; \
4106 : : } while(0)
4107 : :
4108 : : #define REPARAMETERIZE_CHILD_PATH_LIST(pathlist) \
4109 : : do { \
4110 : : if ((pathlist) != NIL) \
4111 : : { \
4112 : : (pathlist) = reparameterize_pathlist_by_child(root, (pathlist), \
4113 : : child_rel); \
4114 : : if ((pathlist) == NIL) \
4115 : : return NULL; \
4116 : : } \
4117 : : } while(0)
4118 : :
4119 : : /*
4120 : : * If the path is not parameterized by the parent of the given relation,
4121 : : * it doesn't need reparameterization.
4122 : : */
4123 [ + + ]: 73161 : if (!path->param_info ||
4124 [ + - + + ]: 35203 : !bms_overlap(PATH_REQ_OUTER(path), child_rel->top_parent_relids))
4125 : 72314 : return path;
4126 : :
4127 : : /*
4128 : : * If possible, reparameterize the given path.
4129 : : *
4130 : : * This function is currently only applied to the inner side of a nestloop
4131 : : * join that is being partitioned by the partitionwise-join code. Hence,
4132 : : * we need only support path types that plausibly arise in that context.
4133 : : * (In particular, supporting sorted path types would be a waste of code
4134 : : * and cycles: even if we translated them here, they'd just lose in
4135 : : * subsequent cost comparisons.) If we do see an unsupported path type,
4136 : : * that just means we won't be able to generate a partitionwise-join plan
4137 : : * using that path type.
4138 : : */
4139 [ + + + + : 847 : switch (nodeTag(path))
+ - - + -
+ + - + -
- ]
4140 : : {
4141 : 190 : case T_Path:
4142 : 190 : new_path = path;
4143 : 190 : ADJUST_CHILD_ATTRS(new_path->parent->baserestrictinfo);
4144 [ + + ]: 190 : if (path->pathtype == T_SampleScan)
4145 : : {
4146 : 40 : Index scan_relid = path->parent->relid;
4147 : : RangeTblEntry *rte;
4148 : :
4149 : : /* it should be a base rel with a tablesample clause... */
4150 : : Assert(scan_relid > 0);
4151 [ + - ]: 40 : rte = planner_rt_fetch(scan_relid, root);
4152 : : Assert(rte->rtekind == RTE_RELATION);
4153 : : Assert(rte->tablesample != NULL);
4154 : :
4155 : 40 : ADJUST_CHILD_ATTRS(rte->tablesample);
4156 : : }
4157 : 190 : break;
4158 : :
4159 : 447 : case T_IndexPath:
4160 : : {
4161 : 447 : IndexPath *ipath = (IndexPath *) path;
4162 : :
4163 : 447 : ADJUST_CHILD_ATTRS(ipath->indexinfo->indrestrictinfo);
4164 : 447 : ADJUST_CHILD_ATTRS(ipath->indexclauses);
4165 : 447 : new_path = (Path *) ipath;
4166 : : }
4167 : 447 : break;
4168 : :
4169 : 40 : case T_BitmapHeapPath:
4170 : : {
4171 : 40 : BitmapHeapPath *bhpath = (BitmapHeapPath *) path;
4172 : :
4173 : 40 : ADJUST_CHILD_ATTRS(bhpath->path.parent->baserestrictinfo);
4174 [ - + ]: 40 : REPARAMETERIZE_CHILD_PATH(bhpath->bitmapqual);
4175 : 40 : new_path = (Path *) bhpath;
4176 : : }
4177 : 40 : break;
4178 : :
4179 : 20 : case T_BitmapAndPath:
4180 : : {
4181 : 20 : BitmapAndPath *bapath = (BitmapAndPath *) path;
4182 : :
4183 [ + - - + ]: 20 : REPARAMETERIZE_CHILD_PATH_LIST(bapath->bitmapquals);
4184 : 20 : new_path = (Path *) bapath;
4185 : : }
4186 : 20 : break;
4187 : :
4188 : 20 : case T_BitmapOrPath:
4189 : : {
4190 : 20 : BitmapOrPath *bopath = (BitmapOrPath *) path;
4191 : :
4192 [ + - - + ]: 20 : REPARAMETERIZE_CHILD_PATH_LIST(bopath->bitmapquals);
4193 : 20 : new_path = (Path *) bopath;
4194 : : }
4195 : 20 : break;
4196 : :
4197 : 0 : case T_ForeignPath:
4198 : : {
4199 : 0 : ForeignPath *fpath = (ForeignPath *) path;
4200 : : ReparameterizeForeignPathByChild_function rfpc_func;
4201 : :
4202 : 0 : ADJUST_CHILD_ATTRS(fpath->path.parent->baserestrictinfo);
4203 [ # # ]: 0 : if (fpath->fdw_outerpath)
4204 [ # # ]: 0 : REPARAMETERIZE_CHILD_PATH(fpath->fdw_outerpath);
4205 [ # # ]: 0 : if (fpath->fdw_restrictinfo)
4206 : 0 : ADJUST_CHILD_ATTRS(fpath->fdw_restrictinfo);
4207 : :
4208 : : /* Hand over to FDW if needed. */
4209 : 0 : rfpc_func =
4210 : 0 : path->parent->fdwroutine->ReparameterizeForeignPathByChild;
4211 [ # # ]: 0 : if (rfpc_func)
4212 : 0 : fpath->fdw_private = rfpc_func(root, fpath->fdw_private,
4213 : : child_rel);
4214 : 0 : new_path = (Path *) fpath;
4215 : : }
4216 : 0 : break;
4217 : :
4218 : 0 : case T_CustomPath:
4219 : : {
4220 : 0 : CustomPath *cpath = (CustomPath *) path;
4221 : :
4222 : 0 : ADJUST_CHILD_ATTRS(cpath->path.parent->baserestrictinfo);
4223 [ # # # # ]: 0 : REPARAMETERIZE_CHILD_PATH_LIST(cpath->custom_paths);
4224 [ # # ]: 0 : if (cpath->custom_restrictinfo)
4225 : 0 : ADJUST_CHILD_ATTRS(cpath->custom_restrictinfo);
4226 [ # # ]: 0 : if (cpath->methods &&
4227 [ # # ]: 0 : cpath->methods->ReparameterizeCustomPathByChild)
4228 : 0 : cpath->custom_private =
4229 : 0 : cpath->methods->ReparameterizeCustomPathByChild(root,
4230 : : cpath->custom_private,
4231 : : child_rel);
4232 : 0 : new_path = (Path *) cpath;
4233 : : }
4234 : 0 : break;
4235 : :
4236 : 30 : case T_NestPath:
4237 : : {
4238 : 30 : NestPath *npath = (NestPath *) path;
4239 : 30 : JoinPath *jpath = (JoinPath *) npath;
4240 : :
4241 [ - + ]: 30 : REPARAMETERIZE_CHILD_PATH(jpath->outerjoinpath);
4242 [ - + ]: 30 : REPARAMETERIZE_CHILD_PATH(jpath->innerjoinpath);
4243 : 30 : ADJUST_CHILD_ATTRS(jpath->joinrestrictinfo);
4244 : 30 : new_path = (Path *) npath;
4245 : : }
4246 : 30 : break;
4247 : :
4248 : 0 : case T_MergePath:
4249 : : {
4250 : 0 : MergePath *mpath = (MergePath *) path;
4251 : 0 : JoinPath *jpath = (JoinPath *) mpath;
4252 : :
4253 [ # # ]: 0 : REPARAMETERIZE_CHILD_PATH(jpath->outerjoinpath);
4254 [ # # ]: 0 : REPARAMETERIZE_CHILD_PATH(jpath->innerjoinpath);
4255 : 0 : ADJUST_CHILD_ATTRS(jpath->joinrestrictinfo);
4256 : 0 : ADJUST_CHILD_ATTRS(mpath->path_mergeclauses);
4257 : 0 : new_path = (Path *) mpath;
4258 : : }
4259 : 0 : break;
4260 : :
4261 : 40 : case T_HashPath:
4262 : : {
4263 : 40 : HashPath *hpath = (HashPath *) path;
4264 : 40 : JoinPath *jpath = (JoinPath *) hpath;
4265 : :
4266 [ - + ]: 40 : REPARAMETERIZE_CHILD_PATH(jpath->outerjoinpath);
4267 [ - + ]: 40 : REPARAMETERIZE_CHILD_PATH(jpath->innerjoinpath);
4268 : 40 : ADJUST_CHILD_ATTRS(jpath->joinrestrictinfo);
4269 : 40 : ADJUST_CHILD_ATTRS(hpath->path_hashclauses);
4270 : 40 : new_path = (Path *) hpath;
4271 : : }
4272 : 40 : break;
4273 : :
4274 : 20 : case T_AppendPath:
4275 : : {
4276 : 20 : AppendPath *apath = (AppendPath *) path;
4277 : :
4278 [ + - - + ]: 20 : REPARAMETERIZE_CHILD_PATH_LIST(apath->subpaths);
4279 : 20 : new_path = (Path *) apath;
4280 : : }
4281 : 20 : break;
4282 : :
4283 : 0 : case T_MaterialPath:
4284 : : {
4285 : 0 : MaterialPath *mpath = (MaterialPath *) path;
4286 : :
4287 [ # # ]: 0 : REPARAMETERIZE_CHILD_PATH(mpath->subpath);
4288 : 0 : new_path = (Path *) mpath;
4289 : : }
4290 : 0 : break;
4291 : :
4292 : 40 : case T_MemoizePath:
4293 : : {
4294 : 40 : MemoizePath *mpath = (MemoizePath *) path;
4295 : :
4296 [ - + ]: 40 : REPARAMETERIZE_CHILD_PATH(mpath->subpath);
4297 : 40 : ADJUST_CHILD_ATTRS(mpath->param_exprs);
4298 : 40 : new_path = (Path *) mpath;
4299 : : }
4300 : 40 : break;
4301 : :
4302 : 0 : case T_GatherPath:
4303 : : {
4304 : 0 : GatherPath *gpath = (GatherPath *) path;
4305 : :
4306 [ # # ]: 0 : REPARAMETERIZE_CHILD_PATH(gpath->subpath);
4307 : 0 : new_path = (Path *) gpath;
4308 : : }
4309 : 0 : break;
4310 : :
4311 : 0 : default:
4312 : : /* We don't know how to reparameterize this path. */
4313 : 0 : return NULL;
4314 : : }
4315 : :
4316 : : /*
4317 : : * Adjust the parameterization information, which refers to the topmost
4318 : : * parent. The topmost parent can be multiple levels away from the given
4319 : : * child, hence use multi-level expression adjustment routines.
4320 : : */
4321 : 847 : old_ppi = new_path->param_info;
4322 : : required_outer =
4323 : 847 : adjust_child_relids_multilevel(root, old_ppi->ppi_req_outer,
4324 : : child_rel,
4325 : 847 : child_rel->top_parent);
4326 : :
4327 : : /* If we already have a PPI for this parameterization, just return it */
4328 : 847 : new_ppi = find_param_path_info(new_path->parent, required_outer);
4329 : :
4330 : : /*
4331 : : * If not, build a new one and link it to the list of PPIs. For the same
4332 : : * reason as explained in mark_dummy_rel(), allocate new PPI in the same
4333 : : * context the given RelOptInfo is in.
4334 : : */
4335 [ + + ]: 847 : if (new_ppi == NULL)
4336 : : {
4337 : : MemoryContext oldcontext;
4338 : 727 : RelOptInfo *rel = path->parent;
4339 : :
4340 : 727 : oldcontext = MemoryContextSwitchTo(GetMemoryChunkContext(rel));
4341 : :
4342 : 727 : new_ppi = makeNode(ParamPathInfo);
4343 : 727 : new_ppi->ppi_req_outer = bms_copy(required_outer);
4344 : 727 : new_ppi->ppi_rows = old_ppi->ppi_rows;
4345 : 727 : new_ppi->ppi_clauses = old_ppi->ppi_clauses;
4346 : 727 : ADJUST_CHILD_ATTRS(new_ppi->ppi_clauses);
4347 : 727 : new_ppi->ppi_serials = bms_copy(old_ppi->ppi_serials);
4348 : 727 : rel->ppilist = lappend(rel->ppilist, new_ppi);
4349 : :
4350 : 727 : MemoryContextSwitchTo(oldcontext);
4351 : : }
4352 : 847 : bms_free(required_outer);
4353 : :
4354 : 847 : new_path->param_info = new_ppi;
4355 : :
4356 : : /*
4357 : : * Adjust the path target if the parent of the outer relation is
4358 : : * referenced in the targetlist. This can happen when only the parent of
4359 : : * outer relation is laterally referenced in this relation.
4360 : : */
4361 [ + + ]: 847 : if (bms_overlap(path->parent->lateral_relids,
4362 : 847 : child_rel->top_parent_relids))
4363 : : {
4364 : 400 : new_path->pathtarget = copy_pathtarget(new_path->pathtarget);
4365 : 400 : ADJUST_CHILD_ATTRS(new_path->pathtarget->exprs);
4366 : : }
4367 : :
4368 : 847 : return new_path;
4369 : : }
4370 : :
4371 : : /*
4372 : : * path_is_reparameterizable_by_child
4373 : : * Given a path parameterized by the parent of the given child relation,
4374 : : * see if it can be translated to be parameterized by the child relation.
4375 : : *
4376 : : * This must return true if and only if reparameterize_path_by_child()
4377 : : * would succeed on this path. Currently it's sufficient to verify that
4378 : : * the path and all of its subpaths (if any) are of the types handled by
4379 : : * that function. However, subpaths that are not parameterized can be
4380 : : * disregarded since they won't require translation.
4381 : : */
4382 : : bool
4383 : 27929 : path_is_reparameterizable_by_child(Path *path, RelOptInfo *child_rel)
4384 : : {
4385 : : #define REJECT_IF_PATH_NOT_REPARAMETERIZABLE(path) \
4386 : : do { \
4387 : : if (!path_is_reparameterizable_by_child(path, child_rel)) \
4388 : : return false; \
4389 : : } while(0)
4390 : :
4391 : : #define REJECT_IF_PATH_LIST_NOT_REPARAMETERIZABLE(pathlist) \
4392 : : do { \
4393 : : if (!pathlist_is_reparameterizable_by_child(pathlist, child_rel)) \
4394 : : return false; \
4395 : : } while(0)
4396 : :
4397 : : /*
4398 : : * If the path is not parameterized by the parent of the given relation,
4399 : : * it doesn't need reparameterization.
4400 : : */
4401 [ + + ]: 27929 : if (!path->param_info ||
4402 [ + - + + ]: 27553 : !bms_overlap(PATH_REQ_OUTER(path), child_rel->top_parent_relids))
4403 : 784 : return true;
4404 : :
4405 : : /*
4406 : : * Check that the path type is one that reparameterize_path_by_child() can
4407 : : * handle, and recursively check subpaths.
4408 : : */
4409 [ + + + + : 27145 : switch (nodeTag(path))
+ - + + -
+ - - ]
4410 : : {
4411 : 18911 : case T_Path:
4412 : : case T_IndexPath:
4413 : 18911 : break;
4414 : :
4415 : 40 : case T_BitmapHeapPath:
4416 : : {
4417 : 40 : BitmapHeapPath *bhpath = (BitmapHeapPath *) path;
4418 : :
4419 [ - + ]: 40 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(bhpath->bitmapqual);
4420 : : }
4421 : 40 : break;
4422 : :
4423 : 20 : case T_BitmapAndPath:
4424 : : {
4425 : 20 : BitmapAndPath *bapath = (BitmapAndPath *) path;
4426 : :
4427 [ - + ]: 20 : REJECT_IF_PATH_LIST_NOT_REPARAMETERIZABLE(bapath->bitmapquals);
4428 : : }
4429 : 20 : break;
4430 : :
4431 : 20 : case T_BitmapOrPath:
4432 : : {
4433 : 20 : BitmapOrPath *bopath = (BitmapOrPath *) path;
4434 : :
4435 [ - + ]: 20 : REJECT_IF_PATH_LIST_NOT_REPARAMETERIZABLE(bopath->bitmapquals);
4436 : : }
4437 : 20 : break;
4438 : :
4439 : 74 : case T_ForeignPath:
4440 : : {
4441 : 74 : ForeignPath *fpath = (ForeignPath *) path;
4442 : :
4443 [ - + ]: 74 : if (fpath->fdw_outerpath)
4444 [ # # ]: 0 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(fpath->fdw_outerpath);
4445 : : }
4446 : 74 : break;
4447 : :
4448 : 0 : case T_CustomPath:
4449 : : {
4450 : 0 : CustomPath *cpath = (CustomPath *) path;
4451 : :
4452 [ # # ]: 0 : REJECT_IF_PATH_LIST_NOT_REPARAMETERIZABLE(cpath->custom_paths);
4453 : : }
4454 : 0 : break;
4455 : :
4456 : 1004 : case T_NestPath:
4457 : : case T_MergePath:
4458 : : case T_HashPath:
4459 : : {
4460 : 1004 : JoinPath *jpath = (JoinPath *) path;
4461 : :
4462 [ - + ]: 1004 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(jpath->outerjoinpath);
4463 [ - + ]: 1004 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(jpath->innerjoinpath);
4464 : : }
4465 : 1004 : break;
4466 : :
4467 : 160 : case T_AppendPath:
4468 : : {
4469 : 160 : AppendPath *apath = (AppendPath *) path;
4470 : :
4471 [ - + ]: 160 : REJECT_IF_PATH_LIST_NOT_REPARAMETERIZABLE(apath->subpaths);
4472 : : }
4473 : 160 : break;
4474 : :
4475 : 0 : case T_MaterialPath:
4476 : : {
4477 : 0 : MaterialPath *mpath = (MaterialPath *) path;
4478 : :
4479 [ # # ]: 0 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(mpath->subpath);
4480 : : }
4481 : 0 : break;
4482 : :
4483 : 6916 : case T_MemoizePath:
4484 : : {
4485 : 6916 : MemoizePath *mpath = (MemoizePath *) path;
4486 : :
4487 [ - + ]: 6916 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(mpath->subpath);
4488 : : }
4489 : 6916 : break;
4490 : :
4491 : 0 : case T_GatherPath:
4492 : : {
4493 : 0 : GatherPath *gpath = (GatherPath *) path;
4494 : :
4495 [ # # ]: 0 : REJECT_IF_PATH_NOT_REPARAMETERIZABLE(gpath->subpath);
4496 : : }
4497 : 0 : break;
4498 : :
4499 : 0 : default:
4500 : : /* We don't know how to reparameterize this path. */
4501 : 0 : return false;
4502 : : }
4503 : :
4504 : 27145 : return true;
4505 : : }
4506 : :
4507 : : /*
4508 : : * reparameterize_pathlist_by_child
4509 : : * Helper function to reparameterize a list of paths by given child rel.
4510 : : *
4511 : : * Returns NIL to indicate failure, so pathlist had better not be NIL.
4512 : : */
4513 : : static List *
4514 : 60 : reparameterize_pathlist_by_child(PlannerInfo *root,
4515 : : List *pathlist,
4516 : : RelOptInfo *child_rel)
4517 : : {
4518 : : ListCell *lc;
4519 : 60 : List *result = NIL;
4520 : :
4521 [ + - + + : 180 : foreach(lc, pathlist)
+ + ]
4522 : : {
4523 : 120 : Path *path = reparameterize_path_by_child(root, lfirst(lc),
4524 : : child_rel);
4525 : :
4526 [ - + ]: 120 : if (path == NULL)
4527 : : {
4528 : 0 : list_free(result);
4529 : 0 : return NIL;
4530 : : }
4531 : :
4532 : 120 : result = lappend(result, path);
4533 : : }
4534 : :
4535 : 60 : return result;
4536 : : }
4537 : :
4538 : : /*
4539 : : * pathlist_is_reparameterizable_by_child
4540 : : * Helper function to check if a list of paths can be reparameterized.
4541 : : */
4542 : : static bool
4543 : 200 : pathlist_is_reparameterizable_by_child(List *pathlist, RelOptInfo *child_rel)
4544 : : {
4545 : : ListCell *lc;
4546 : :
4547 [ + - + + : 600 : foreach(lc, pathlist)
+ + ]
4548 : : {
4549 : 400 : Path *path = (Path *) lfirst(lc);
4550 : :
4551 [ - + ]: 400 : if (!path_is_reparameterizable_by_child(path, child_rel))
4552 : 0 : return false;
4553 : : }
4554 : :
4555 : 200 : return true;
4556 : : }
|
