Age Owner Branch data TLA Line data Source code
1 : : /*-------------------------------------------------------------------------
2 : : *
3 : : * setrefs.c
4 : : * Post-processing of a completed plan tree: fix references to subplan
5 : : * vars, compute regproc values for operators, etc
6 : : *
7 : : * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
8 : : * Portions Copyright (c) 1994, Regents of the University of California
9 : : *
10 : : *
11 : : * IDENTIFICATION
12 : : * src/backend/optimizer/plan/setrefs.c
13 : : *
14 : : *-------------------------------------------------------------------------
15 : : */
16 : : #include "postgres.h"
17 : :
18 : : #include "access/transam.h"
19 : : #include "catalog/pg_type.h"
20 : : #include "nodes/makefuncs.h"
21 : : #include "nodes/nodeFuncs.h"
22 : : #include "optimizer/optimizer.h"
23 : : #include "optimizer/pathnode.h"
24 : : #include "optimizer/planmain.h"
25 : : #include "optimizer/planner.h"
26 : : #include "optimizer/subselect.h"
27 : : #include "optimizer/tlist.h"
28 : : #include "parser/parse_relation.h"
29 : : #include "rewrite/rewriteManip.h"
30 : : #include "tcop/utility.h"
31 : : #include "utils/syscache.h"
32 : :
33 : :
34 : : typedef enum
35 : : {
36 : : NRM_EQUAL, /* expect exact match of nullingrels */
37 : : NRM_SUBSET, /* actual Var may have a subset of input */
38 : : NRM_SUPERSET, /* actual Var may have a superset of input */
39 : : } NullingRelsMatch;
40 : :
41 : : typedef struct
42 : : {
43 : : int varno; /* RT index of Var */
44 : : AttrNumber varattno; /* attr number of Var */
45 : : AttrNumber resno; /* TLE position of Var */
46 : : Bitmapset *varnullingrels; /* Var's varnullingrels */
47 : : } tlist_vinfo;
48 : :
49 : : typedef struct
50 : : {
51 : : List *tlist; /* underlying target list */
52 : : int num_vars; /* number of plain Var tlist entries */
53 : : bool has_ph_vars; /* are there PlaceHolderVar entries? */
54 : : bool has_non_vars; /* are there other entries? */
55 : : tlist_vinfo vars[FLEXIBLE_ARRAY_MEMBER]; /* has num_vars entries */
56 : : } indexed_tlist;
57 : :
58 : : typedef struct
59 : : {
60 : : PlannerInfo *root;
61 : : int rtoffset;
62 : : double num_exec;
63 : : } fix_scan_expr_context;
64 : :
65 : : typedef struct
66 : : {
67 : : PlannerInfo *root;
68 : : indexed_tlist *outer_itlist;
69 : : indexed_tlist *inner_itlist;
70 : : Index acceptable_rel;
71 : : int rtoffset;
72 : : NullingRelsMatch nrm_match;
73 : : double num_exec;
74 : : } fix_join_expr_context;
75 : :
76 : : typedef struct
77 : : {
78 : : PlannerInfo *root;
79 : : indexed_tlist *subplan_itlist;
80 : : int newvarno;
81 : : int rtoffset;
82 : : NullingRelsMatch nrm_match;
83 : : double num_exec;
84 : : } fix_upper_expr_context;
85 : :
86 : : typedef struct
87 : : {
88 : : PlannerInfo *root;
89 : : indexed_tlist *subplan_itlist;
90 : : int newvarno;
91 : : } fix_windowagg_cond_context;
92 : :
93 : : /* Context info for flatten_rtes_walker() */
94 : : typedef struct
95 : : {
96 : : PlannerGlobal *glob;
97 : : Query *query;
98 : : } flatten_rtes_walker_context;
99 : :
100 : : /*
101 : : * Selecting the best alternative in an AlternativeSubPlan expression requires
102 : : * estimating how many times that expression will be evaluated. For an
103 : : * expression in a plan node's targetlist, the plan's estimated number of
104 : : * output rows is clearly what to use, but for an expression in a qual it's
105 : : * far less clear. Since AlternativeSubPlans aren't heavily used, we don't
106 : : * want to expend a lot of cycles making such estimates. What we use is twice
107 : : * the number of output rows. That's not entirely unfounded: we know that
108 : : * clause_selectivity() would fall back to a default selectivity estimate
109 : : * of 0.5 for any SubPlan, so if the qual containing the SubPlan is the last
110 : : * to be applied (which it likely would be, thanks to order_qual_clauses()),
111 : : * this matches what we could have estimated in a far more laborious fashion.
112 : : * Obviously there are many other scenarios, but it's probably not worth the
113 : : * trouble to try to improve on this estimate, especially not when we don't
114 : : * have a better estimate for the selectivity of the SubPlan qual itself.
115 : : */
116 : : #define NUM_EXEC_TLIST(parentplan) ((parentplan)->plan_rows)
117 : : #define NUM_EXEC_QUAL(parentplan) ((parentplan)->plan_rows * 2.0)
118 : :
119 : : /*
120 : : * Check if a Const node is a regclass value. We accept plain OID too,
121 : : * since a regclass Const will get folded to that type if it's an argument
122 : : * to oideq or similar operators. (This might result in some extraneous
123 : : * values in a plan's list of relation dependencies, but the worst result
124 : : * would be occasional useless replans.)
125 : : */
126 : : #define ISREGCLASSCONST(con) \
127 : : (((con)->consttype == REGCLASSOID || (con)->consttype == OIDOID) && \
128 : : !(con)->constisnull)
129 : :
130 : : #define fix_scan_list(root, lst, rtoffset, num_exec) \
131 : : ((List *) fix_scan_expr(root, (Node *) (lst), rtoffset, num_exec))
132 : :
133 : : static void add_rtes_to_flat_rtable(PlannerInfo *root, bool recursing);
134 : : static void flatten_unplanned_rtes(PlannerGlobal *glob, RangeTblEntry *rte);
135 : : static bool flatten_rtes_walker(Node *node, flatten_rtes_walker_context *cxt);
136 : : static void add_rte_to_flat_rtable(PlannerGlobal *glob, List *rteperminfos,
137 : : RangeTblEntry *rte);
138 : : static Plan *set_plan_refs(PlannerInfo *root, Plan *plan, int rtoffset);
139 : : static Plan *set_indexonlyscan_references(PlannerInfo *root,
140 : : IndexOnlyScan *plan,
141 : : int rtoffset);
142 : : static Plan *set_subqueryscan_references(PlannerInfo *root,
143 : : SubqueryScan *plan,
144 : : int rtoffset);
145 : : static Plan *clean_up_removed_plan_level(Plan *parent, Plan *child);
146 : : static void set_foreignscan_references(PlannerInfo *root,
147 : : ForeignScan *fscan,
148 : : int rtoffset);
149 : : static void set_customscan_references(PlannerInfo *root,
150 : : CustomScan *cscan,
151 : : int rtoffset);
152 : : static Plan *set_append_references(PlannerInfo *root,
153 : : Append *aplan,
154 : : int rtoffset);
155 : : static Plan *set_mergeappend_references(PlannerInfo *root,
156 : : MergeAppend *mplan,
157 : : int rtoffset);
158 : : static void set_hash_references(PlannerInfo *root, Plan *plan, int rtoffset);
159 : : static Relids offset_relid_set(Relids relids, int rtoffset);
160 : : static Node *fix_scan_expr(PlannerInfo *root, Node *node,
161 : : int rtoffset, double num_exec);
162 : : static Node *fix_scan_expr_mutator(Node *node, fix_scan_expr_context *context);
163 : : static bool fix_scan_expr_walker(Node *node, fix_scan_expr_context *context);
164 : : static void set_join_references(PlannerInfo *root, Join *join, int rtoffset);
165 : : static void set_upper_references(PlannerInfo *root, Plan *plan, int rtoffset);
166 : : static void set_param_references(PlannerInfo *root, Plan *plan);
167 : : static Node *convert_combining_aggrefs(Node *node, void *context);
168 : : static void set_dummy_tlist_references(Plan *plan, int rtoffset);
169 : : static indexed_tlist *build_tlist_index(List *tlist);
170 : : static Var *search_indexed_tlist_for_var(Var *var,
171 : : indexed_tlist *itlist,
172 : : int newvarno,
173 : : int rtoffset,
174 : : NullingRelsMatch nrm_match);
175 : : static Var *search_indexed_tlist_for_phv(PlaceHolderVar *phv,
176 : : indexed_tlist *itlist,
177 : : int newvarno,
178 : : NullingRelsMatch nrm_match);
179 : : static Var *search_indexed_tlist_for_non_var(Expr *node,
180 : : indexed_tlist *itlist,
181 : : int newvarno);
182 : : static Var *search_indexed_tlist_for_sortgroupref(Expr *node,
183 : : Index sortgroupref,
184 : : indexed_tlist *itlist,
185 : : int newvarno);
186 : : static List *fix_join_expr(PlannerInfo *root,
187 : : List *clauses,
188 : : indexed_tlist *outer_itlist,
189 : : indexed_tlist *inner_itlist,
190 : : Index acceptable_rel,
191 : : int rtoffset,
192 : : NullingRelsMatch nrm_match,
193 : : double num_exec);
194 : : static Node *fix_join_expr_mutator(Node *node,
195 : : fix_join_expr_context *context);
196 : : static Node *fix_upper_expr(PlannerInfo *root,
197 : : Node *node,
198 : : indexed_tlist *subplan_itlist,
199 : : int newvarno,
200 : : int rtoffset,
201 : : NullingRelsMatch nrm_match,
202 : : double num_exec);
203 : : static Node *fix_upper_expr_mutator(Node *node,
204 : : fix_upper_expr_context *context);
205 : : static List *set_returning_clause_references(PlannerInfo *root,
206 : : List *rlist,
207 : : Plan *topplan,
208 : : Index resultRelation,
209 : : int rtoffset);
210 : : static List *set_windowagg_runcondition_references(PlannerInfo *root,
211 : : List *runcondition,
212 : : Plan *plan);
213 : :
214 : :
215 : : /*****************************************************************************
216 : : *
217 : : * SUBPLAN REFERENCES
218 : : *
219 : : *****************************************************************************/
220 : :
221 : : /*
222 : : * set_plan_references
223 : : *
224 : : * This is the final processing pass of the planner/optimizer. The plan
225 : : * tree is complete; we just have to adjust some representational details
226 : : * for the convenience of the executor:
227 : : *
228 : : * 1. We flatten the various subquery rangetables into a single list, and
229 : : * zero out RangeTblEntry fields that are not useful to the executor.
230 : : *
231 : : * 2. We adjust Vars in scan nodes to be consistent with the flat rangetable.
232 : : *
233 : : * 3. We adjust Vars in upper plan nodes to refer to the outputs of their
234 : : * subplans.
235 : : *
236 : : * 4. Aggrefs in Agg plan nodes need to be adjusted in some cases involving
237 : : * partial aggregation or minmax aggregate optimization.
238 : : *
239 : : * 5. PARAM_MULTIEXPR Params are replaced by regular PARAM_EXEC Params,
240 : : * now that we have finished planning all MULTIEXPR subplans.
241 : : *
242 : : * 6. AlternativeSubPlan expressions are replaced by just one of their
243 : : * alternatives, using an estimate of how many times they'll be executed.
244 : : *
245 : : * 7. We compute regproc OIDs for operators (ie, we look up the function
246 : : * that implements each op).
247 : : *
248 : : * 8. We create lists of specific objects that the plan depends on.
249 : : * This will be used by plancache.c to drive invalidation of cached plans.
250 : : * Relation dependencies are represented by OIDs, and everything else by
251 : : * PlanInvalItems (this distinction is motivated by the shared-inval APIs).
252 : : * Currently, relations, user-defined functions, and domains are the only
253 : : * types of objects that are explicitly tracked this way.
254 : : *
255 : : * 9. We assign every plan node in the tree a unique ID.
256 : : *
257 : : * We also perform one final optimization step, which is to delete
258 : : * SubqueryScan, Append, and MergeAppend plan nodes that aren't doing
259 : : * anything useful. The reason for doing this last is that
260 : : * it can't readily be done before set_plan_references, because it would
261 : : * break set_upper_references: the Vars in the child plan's top tlist
262 : : * wouldn't match up with the Vars in the outer plan tree. A SubqueryScan
263 : : * serves a necessary function as a buffer between outer query and subquery
264 : : * variable numbering ... but after we've flattened the rangetable this is
265 : : * no longer a problem, since then there's only one rtindex namespace.
266 : : * Likewise, Append and MergeAppend buffer between the parent and child vars
267 : : * of an appendrel, but we don't need to worry about that once we've done
268 : : * set_plan_references.
269 : : *
270 : : * set_plan_references recursively traverses the whole plan tree.
271 : : *
272 : : * The return value is normally the same Plan node passed in, but can be
273 : : * different when the passed-in Plan is a node we decide isn't needed.
274 : : *
275 : : * The flattened rangetable entries are appended to root->glob->finalrtable.
276 : : * Also, rowmarks entries are appended to root->glob->finalrowmarks, and the
277 : : * RT indexes of ModifyTable result relations to root->glob->resultRelations,
278 : : * and flattened AppendRelInfos are appended to root->glob->appendRelations.
279 : : * Plan dependencies are appended to root->glob->relationOids (for relations)
280 : : * and root->glob->invalItems (for everything else).
281 : : *
282 : : * Notice that we modify Plan nodes in-place, but use expression_tree_mutator
283 : : * to process targetlist and qual expressions. We can assume that the Plan
284 : : * nodes were just built by the planner and are not multiply referenced, but
285 : : * it's not so safe to assume that for expression tree nodes.
286 : : */
287 : : Plan *
5168 tgl@sss.pgh.pa.us 288 :CBC 259392 : set_plan_references(PlannerInfo *root, Plan *plan)
289 : : {
290 : : Plan *result;
291 : 259392 : PlannerGlobal *glob = root->glob;
6822 292 : 259392 : int rtoffset = list_length(glob->finalrtable);
293 : : ListCell *lc;
294 : :
295 : : /*
296 : : * Add all the query's RTEs to the flattened rangetable. The live ones
297 : : * will have their rangetable indexes increased by rtoffset. (Additional
298 : : * RTEs, not referenced by the Plan tree, might get added after those.)
299 : : */
4555 300 : 259392 : add_rtes_to_flat_rtable(root, false);
301 : :
302 : : /*
303 : : * Adjust RT indexes of PlanRowMarks and add to final rowmarks list
304 : : */
5168 305 [ + + + + : 265976 : foreach(lc, root->rowMarks)
+ + ]
306 : : {
3122 307 : 6584 : PlanRowMark *rc = lfirst_node(PlanRowMark, lc);
308 : : PlanRowMark *newrc;
309 : :
310 : : /* sanity check on existing row marks */
64 akorotkov@postgresql 311 [ + - - + ]: 6584 : Assert(root->simple_rel_array[rc->rti] != NULL &&
312 : : root->simple_rte_array[rc->rti] != NULL);
313 : :
314 : : /* flat copy is enough since all fields are scalars */
5845 tgl@sss.pgh.pa.us 315 : 6584 : newrc = (PlanRowMark *) palloc(sizeof(PlanRowMark));
316 : 6584 : memcpy(newrc, rc, sizeof(PlanRowMark));
317 : :
318 : : /* adjust indexes ... but *not* the rowmarkId */
5859 319 : 6584 : newrc->rti += rtoffset;
320 : 6584 : newrc->prti += rtoffset;
321 : :
322 : 6584 : glob->finalrowmarks = lappend(glob->finalrowmarks, newrc);
323 : : }
324 : :
325 : : /*
326 : : * Adjust RT indexes of AppendRelInfos and add to final appendrels list.
327 : : * We assume the AppendRelInfos were built during planning and don't need
328 : : * to be copied.
329 : : */
2147 330 [ + + + + : 288339 : foreach(lc, root->append_rel_list)
+ + ]
331 : : {
332 : 28947 : AppendRelInfo *appinfo = lfirst_node(AppendRelInfo, lc);
333 : :
334 : : /* adjust RT indexes */
335 : 28947 : appinfo->parent_relid += rtoffset;
336 : 28947 : appinfo->child_relid += rtoffset;
337 : :
338 : : /*
339 : : * Rather than adjust the translated_vars entries, just drop 'em.
340 : : * Neither the executor nor EXPLAIN currently need that data.
341 : : */
342 : 28947 : appinfo->translated_vars = NIL;
343 : :
344 : 28947 : glob->appendRelations = lappend(glob->appendRelations, appinfo);
345 : : }
346 : :
347 : : /* If needed, create workspace for processing AlternativeSubPlans */
1504 348 [ + + ]: 259392 : if (root->hasAlternativeSubPlans)
349 : : {
350 : 547 : root->isAltSubplan = (bool *)
351 : 547 : palloc0(list_length(glob->subplans) * sizeof(bool));
352 : 547 : root->isUsedSubplan = (bool *)
353 : 547 : palloc0(list_length(glob->subplans) * sizeof(bool));
354 : : }
355 : :
356 : : /* Now fix the Plan tree */
357 : 259392 : result = set_plan_refs(root, plan, rtoffset);
358 : :
359 : : /*
360 : : * If we have AlternativeSubPlans, it is likely that we now have some
361 : : * unreferenced subplans in glob->subplans. To avoid expending cycles on
362 : : * those subplans later, get rid of them by setting those list entries to
363 : : * NULL. (Note: we can't do this immediately upon processing an
364 : : * AlternativeSubPlan, because there may be multiple copies of the
365 : : * AlternativeSubPlan, and they can get resolved differently.)
366 : : */
367 [ + + ]: 259392 : if (root->hasAlternativeSubPlans)
368 : : {
369 [ + - + + : 2657 : foreach(lc, glob->subplans)
+ + ]
370 : : {
371 : 2110 : int ndx = foreach_current_index(lc);
372 : :
373 : : /*
374 : : * If it was used by some AlternativeSubPlan in this query level,
375 : : * but wasn't selected as best by any AlternativeSubPlan, then we
376 : : * don't need it. Do not touch subplans that aren't parts of
377 : : * AlternativeSubPlans.
378 : : */
379 [ + + + + ]: 2110 : if (root->isAltSubplan[ndx] && !root->isUsedSubplan[ndx])
380 : 840 : lfirst(lc) = NULL;
381 : : }
382 : : }
383 : :
384 : 259392 : return result;
385 : : }
386 : :
387 : : /*
388 : : * Extract RangeTblEntries from the plan's rangetable, and add to flat rtable
389 : : *
390 : : * This can recurse into subquery plans; "recursing" is true if so.
391 : : *
392 : : * This also seems like a good place to add the query's RTEPermissionInfos to
393 : : * the flat rteperminfos.
394 : : */
395 : : static void
4555 396 : 259524 : add_rtes_to_flat_rtable(PlannerInfo *root, bool recursing)
397 : : {
398 : 259524 : PlannerGlobal *glob = root->glob;
399 : : Index rti;
400 : : ListCell *lc;
401 : :
402 : : /*
403 : : * Add the query's own RTEs to the flattened rangetable.
404 : : *
405 : : * At top level, we must add all RTEs so that their indexes in the
406 : : * flattened rangetable match up with their original indexes. When
407 : : * recursing, we only care about extracting relation RTEs (and subquery
408 : : * RTEs that were once relation RTEs).
409 : : */
410 [ + - + + : 730941 : foreach(lc, root->parse->rtable)
+ + ]
411 : : {
412 : 471417 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
413 : :
1013 414 [ + + + + ]: 471417 : if (!recursing || rte->rtekind == RTE_RELATION ||
415 [ + + - + ]: 123 : (rte->rtekind == RTE_SUBQUERY && OidIsValid(rte->relid)))
1056 alvherre@alvh.no-ip. 416 : 471294 : add_rte_to_flat_rtable(glob, root->parse->rteperminfos, rte);
417 : : }
418 : :
419 : : /*
420 : : * If there are any dead subqueries, they are not referenced in the Plan
421 : : * tree, so we must add RTEs contained in them to the flattened rtable
422 : : * separately. (If we failed to do this, the executor would not perform
423 : : * expected permission checks for tables mentioned in such subqueries.)
424 : : *
425 : : * Note: this pass over the rangetable can't be combined with the previous
426 : : * one, because that would mess up the numbering of the live RTEs in the
427 : : * flattened rangetable.
428 : : */
4555 tgl@sss.pgh.pa.us 429 : 259524 : rti = 1;
430 [ + - + + : 730941 : foreach(lc, root->parse->rtable)
+ + ]
431 : : {
432 : 471417 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
433 : :
434 : : /*
435 : : * We should ignore inheritance-parent RTEs: their contents have been
436 : : * pulled up into our rangetable already. Also ignore any subquery
437 : : * RTEs without matching RelOptInfos, as they likewise have been
438 : : * pulled up.
439 : : */
4335 440 [ + + + + ]: 471417 : if (rte->rtekind == RTE_SUBQUERY && !rte->inh &&
441 [ + - ]: 35023 : rti < root->simple_rel_array_size)
442 : : {
4555 443 : 35023 : RelOptInfo *rel = root->simple_rel_array[rti];
444 : :
445 [ + + ]: 35023 : if (rel != NULL)
446 : : {
3050 447 [ - + ]: 16842 : Assert(rel->relid == rti); /* sanity check on array */
448 : :
449 : : /*
450 : : * The subquery might never have been planned at all, if it
451 : : * was excluded on the basis of self-contradictory constraints
452 : : * in our query level. In this case apply
453 : : * flatten_unplanned_rtes.
454 : : *
455 : : * If it was planned but the result rel is dummy, we assume
456 : : * that it has been omitted from our plan tree (see
457 : : * set_subquery_pathlist), and recurse to pull up its RTEs.
458 : : *
459 : : * Otherwise, it should be represented by a SubqueryScan node
460 : : * somewhere in our plan tree, and we'll pull up its RTEs when
461 : : * we process that plan node.
462 : : *
463 : : * However, if we're recursing, then we should pull up RTEs
464 : : * whether the subquery is dummy or not, because we've found
465 : : * that some upper query level is treating this one as dummy,
466 : : * and so we won't scan this level's plan tree at all.
467 : : */
3521 468 [ + + ]: 16842 : if (rel->subroot == NULL)
4555 469 : 12 : flatten_unplanned_rtes(glob, rte);
3521 470 [ + + + + ]: 33636 : else if (recursing ||
471 : 16806 : IS_DUMMY_REL(fetch_upper_rel(rel->subroot,
472 : : UPPERREL_FINAL, NULL)))
4555 473 : 132 : add_rtes_to_flat_rtable(rel->subroot, true);
474 : : }
475 : : }
476 : 471417 : rti++;
477 : : }
478 : 259524 : }
479 : :
480 : : /*
481 : : * Extract RangeTblEntries from a subquery that was never planned at all
482 : : */
483 : :
484 : : static void
485 : 12 : flatten_unplanned_rtes(PlannerGlobal *glob, RangeTblEntry *rte)
486 : : {
1056 alvherre@alvh.no-ip. 487 : 12 : flatten_rtes_walker_context cxt = {glob, rte->subquery};
488 : :
489 : : /* Use query_tree_walker to find all RTEs in the parse tree */
4555 tgl@sss.pgh.pa.us 490 : 12 : (void) query_tree_walker(rte->subquery,
491 : : flatten_rtes_walker,
492 : : &cxt,
493 : : QTW_EXAMINE_RTES_BEFORE);
494 : 12 : }
495 : :
496 : : static bool
1056 alvherre@alvh.no-ip. 497 : 300 : flatten_rtes_walker(Node *node, flatten_rtes_walker_context *cxt)
498 : : {
4555 tgl@sss.pgh.pa.us 499 [ + + ]: 300 : if (node == NULL)
500 : 174 : return false;
501 [ + + ]: 126 : if (IsA(node, RangeTblEntry))
502 : : {
503 : 9 : RangeTblEntry *rte = (RangeTblEntry *) node;
504 : :
505 : : /* As above, we need only save relation RTEs and former relations */
1013 506 [ - + ]: 9 : if (rte->rtekind == RTE_RELATION ||
1013 tgl@sss.pgh.pa.us 507 [ # # # # ]:UBC 0 : (rte->rtekind == RTE_SUBQUERY && OidIsValid(rte->relid)))
1056 alvherre@alvh.no-ip. 508 :CBC 9 : add_rte_to_flat_rtable(cxt->glob, cxt->query->rteperminfos, rte);
4555 tgl@sss.pgh.pa.us 509 : 9 : return false;
510 : : }
511 [ + + ]: 117 : if (IsA(node, Query))
512 : : {
513 : : /*
514 : : * Recurse into subselects. Must update cxt->query to this query so
515 : : * that the rtable and rteperminfos correspond with each other.
516 : : */
987 517 : 3 : Query *save_query = cxt->query;
518 : : bool result;
519 : :
1056 alvherre@alvh.no-ip. 520 : 3 : cxt->query = (Query *) node;
987 tgl@sss.pgh.pa.us 521 : 3 : result = query_tree_walker((Query *) node,
522 : : flatten_rtes_walker,
523 : : cxt,
524 : : QTW_EXAMINE_RTES_BEFORE);
525 : 3 : cxt->query = save_query;
526 : 3 : return result;
527 : : }
333 peter@eisentraut.org 528 : 114 : return expression_tree_walker(node, flatten_rtes_walker, cxt);
529 : : }
530 : :
531 : : /*
532 : : * Add (a copy of) the given RTE to the final rangetable and also the
533 : : * corresponding RTEPermissionInfo, if any, to final rteperminfos.
534 : : *
535 : : * In the flat rangetable, we zero out substructure pointers that are not
536 : : * needed by the executor; this reduces the storage space and copying cost
537 : : * for cached plans. We keep only the ctename, alias, eref Alias fields,
538 : : * which are needed by EXPLAIN, and perminfoindex which is needed by the
539 : : * executor to fetch the RTE's RTEPermissionInfo.
540 : : */
541 : : static void
1056 alvherre@alvh.no-ip. 542 : 471303 : add_rte_to_flat_rtable(PlannerGlobal *glob, List *rteperminfos,
543 : : RangeTblEntry *rte)
544 : : {
545 : : RangeTblEntry *newrte;
546 : :
547 : : /* flat copy to duplicate all the scalar fields */
4555 tgl@sss.pgh.pa.us 548 : 471303 : newrte = (RangeTblEntry *) palloc(sizeof(RangeTblEntry));
549 : 471303 : memcpy(newrte, rte, sizeof(RangeTblEntry));
550 : :
551 : : /* zap unneeded sub-structure */
3747 552 : 471303 : newrte->tablesample = NULL;
4555 553 : 471303 : newrte->subquery = NULL;
554 : 471303 : newrte->joinaliasvars = NIL;
2118 555 : 471303 : newrte->joinleftcols = NIL;
556 : 471303 : newrte->joinrightcols = NIL;
1671 peter@eisentraut.org 557 : 471303 : newrte->join_using_alias = NULL;
4358 tgl@sss.pgh.pa.us 558 : 471303 : newrte->functions = NIL;
3155 alvherre@alvh.no-ip. 559 : 471303 : newrte->tablefunc = NULL;
4555 tgl@sss.pgh.pa.us 560 : 471303 : newrte->values_lists = NIL;
3245 561 : 471303 : newrte->coltypes = NIL;
562 : 471303 : newrte->coltypmods = NIL;
563 : 471303 : newrte->colcollations = NIL;
412 rguo@postgresql.org 564 : 471303 : newrte->groupexprs = NIL;
3751 tgl@sss.pgh.pa.us 565 : 471303 : newrte->securityQuals = NIL;
566 : :
4555 567 : 471303 : glob->finalrtable = lappend(glob->finalrtable, newrte);
568 : :
569 : : /*
570 : : * If it's a plain relation RTE (or a subquery that was once a view
571 : : * reference), add the relation OID to relationOids. Also add its new RT
572 : : * index to the set of relations to be potentially accessed during
573 : : * execution.
574 : : *
575 : : * We do this even though the RTE might be unreferenced in the plan tree;
576 : : * this would correspond to cases such as views that were expanded, child
577 : : * tables that were eliminated by constraint exclusion, etc. Schema
578 : : * invalidation on such a rel must still force rebuilding of the plan.
579 : : *
580 : : * Note we don't bother to avoid making duplicate list entries. We could,
581 : : * but it would probably cost more cycles than it would save.
582 : : */
1013 583 [ + + ]: 471303 : if (newrte->rtekind == RTE_RELATION ||
584 [ + + + + ]: 214779 : (newrte->rtekind == RTE_SUBQUERY && OidIsValid(newrte->relid)))
585 : : {
4555 586 : 264419 : glob->relationOids = lappend_oid(glob->relationOids, newrte->relid);
262 amitlan@postgresql.o 587 : 264419 : glob->allRelids = bms_add_member(glob->allRelids,
588 : 264419 : list_length(glob->finalrtable));
589 : : }
590 : :
591 : : /*
592 : : * Add a copy of the RTEPermissionInfo, if any, corresponding to this RTE
593 : : * to the flattened global list.
594 : : */
1056 alvherre@alvh.no-ip. 595 [ + + ]: 471303 : if (rte->perminfoindex > 0)
596 : : {
597 : : RTEPermissionInfo *perminfo;
598 : : RTEPermissionInfo *newperminfo;
599 : :
600 : : /* Get the existing one from this query's rteperminfos. */
601 : 243268 : perminfo = getRTEPermissionInfo(rteperminfos, newrte);
602 : :
603 : : /*
604 : : * Add a new one to finalrteperminfos and copy the contents of the
605 : : * existing one into it. Note that addRTEPermissionInfo() also
606 : : * updates newrte->perminfoindex to point to newperminfo in
607 : : * finalrteperminfos.
608 : : */
609 : 243268 : newrte->perminfoindex = 0; /* expected by addRTEPermissionInfo() */
610 : 243268 : newperminfo = addRTEPermissionInfo(&glob->finalrteperminfos, newrte);
611 : 243268 : memcpy(newperminfo, perminfo, sizeof(RTEPermissionInfo));
612 : : }
4555 tgl@sss.pgh.pa.us 613 : 471303 : }
614 : :
615 : : /*
616 : : * set_plan_refs: recurse through the Plan nodes of a single subquery level
617 : : */
618 : : static Plan *
5168 619 : 1391751 : set_plan_refs(PlannerInfo *root, Plan *plan, int rtoffset)
620 : : {
621 : : ListCell *l;
622 : :
10277 bruce@momjian.us 623 [ + + ]: 1391751 : if (plan == NULL)
7463 tgl@sss.pgh.pa.us 624 : 803808 : return NULL;
625 : :
626 : : /* Assign this node a unique ID. */
3682 rhaas@postgresql.org 627 : 587943 : plan->plan_node_id = root->glob->lastPlanNodeId++;
628 : :
629 : : /*
630 : : * Plan-type-specific fixes
631 : : */
9563 tgl@sss.pgh.pa.us 632 [ + + + + : 587943 : switch (nodeTag(plan))
+ + + + +
+ + + + +
+ + - + +
+ + + + +
+ + + + +
+ + + + +
+ - ]
633 : : {
634 : 109479 : case T_SeqScan:
635 : : {
6556 bruce@momjian.us 636 : 109479 : SeqScan *splan = (SeqScan *) plan;
637 : :
1541 peter@eisentraut.org 638 : 109479 : splan->scan.scanrelid += rtoffset;
639 : 109479 : splan->scan.plan.targetlist =
640 : 109479 : fix_scan_list(root, splan->scan.plan.targetlist,
641 : : rtoffset, NUM_EXEC_TLIST(plan));
642 : 109479 : splan->scan.plan.qual =
643 : 109479 : fix_scan_list(root, splan->scan.plan.qual,
644 : : rtoffset, NUM_EXEC_QUAL(plan));
645 : : }
9563 tgl@sss.pgh.pa.us 646 : 109479 : break;
3818 simon@2ndQuadrant.co 647 : 153 : case T_SampleScan:
648 : : {
3810 bruce@momjian.us 649 : 153 : SampleScan *splan = (SampleScan *) plan;
650 : :
3747 tgl@sss.pgh.pa.us 651 : 153 : splan->scan.scanrelid += rtoffset;
652 : 153 : splan->scan.plan.targetlist =
1856 653 : 153 : fix_scan_list(root, splan->scan.plan.targetlist,
654 : : rtoffset, NUM_EXEC_TLIST(plan));
3747 655 : 153 : splan->scan.plan.qual =
1856 656 : 153 : fix_scan_list(root, splan->scan.plan.qual,
657 : : rtoffset, NUM_EXEC_QUAL(plan));
3747 658 : 153 : splan->tablesample = (TableSampleClause *)
1856 659 : 153 : fix_scan_expr(root, (Node *) splan->tablesample,
660 : : rtoffset, 1);
661 : : }
3818 simon@2ndQuadrant.co 662 : 153 : break;
9563 tgl@sss.pgh.pa.us 663 : 72521 : case T_IndexScan:
664 : : {
6556 bruce@momjian.us 665 : 72521 : IndexScan *splan = (IndexScan *) plan;
666 : :
6822 tgl@sss.pgh.pa.us 667 : 72521 : splan->scan.scanrelid += rtoffset;
668 : 72521 : splan->scan.plan.targetlist =
1856 669 : 72521 : fix_scan_list(root, splan->scan.plan.targetlist,
670 : : rtoffset, NUM_EXEC_TLIST(plan));
6822 671 : 72521 : splan->scan.plan.qual =
1856 672 : 72521 : fix_scan_list(root, splan->scan.plan.qual,
673 : : rtoffset, NUM_EXEC_QUAL(plan));
6822 674 : 72521 : splan->indexqual =
1856 675 : 72521 : fix_scan_list(root, splan->indexqual,
676 : : rtoffset, 1);
6822 677 : 72521 : splan->indexqualorig =
1856 678 : 72521 : fix_scan_list(root, splan->indexqualorig,
679 : : rtoffset, NUM_EXEC_QUAL(plan));
5443 680 : 72521 : splan->indexorderby =
1856 681 : 72521 : fix_scan_list(root, splan->indexorderby,
682 : : rtoffset, 1);
5443 683 : 72521 : splan->indexorderbyorig =
1856 684 : 72521 : fix_scan_list(root, splan->indexorderbyorig,
685 : : rtoffset, NUM_EXEC_QUAL(plan));
686 : : }
9276 687 : 72521 : break;
5130 688 : 8378 : case T_IndexOnlyScan:
689 : : {
4887 bruce@momjian.us 690 : 8378 : IndexOnlyScan *splan = (IndexOnlyScan *) plan;
691 : :
5130 tgl@sss.pgh.pa.us 692 : 8378 : return set_indexonlyscan_references(root, splan, rtoffset);
693 : : }
694 : : break;
7496 695 : 10188 : case T_BitmapIndexScan:
696 : : {
6822 697 : 10188 : BitmapIndexScan *splan = (BitmapIndexScan *) plan;
698 : :
699 : 10188 : splan->scan.scanrelid += rtoffset;
700 : : /* no need to fix targetlist and qual */
701 [ - + ]: 10188 : Assert(splan->scan.plan.targetlist == NIL);
702 [ - + ]: 10188 : Assert(splan->scan.plan.qual == NIL);
703 : 10188 : splan->indexqual =
1856 704 : 10188 : fix_scan_list(root, splan->indexqual, rtoffset, 1);
6822 705 : 10188 : splan->indexqualorig =
1856 706 : 10188 : fix_scan_list(root, splan->indexqualorig,
707 : : rtoffset, NUM_EXEC_QUAL(plan));
708 : : }
7496 709 : 10188 : break;
710 : 9855 : case T_BitmapHeapScan:
711 : : {
6822 712 : 9855 : BitmapHeapScan *splan = (BitmapHeapScan *) plan;
713 : :
714 : 9855 : splan->scan.scanrelid += rtoffset;
715 : 9855 : splan->scan.plan.targetlist =
1856 716 : 9855 : fix_scan_list(root, splan->scan.plan.targetlist,
717 : : rtoffset, NUM_EXEC_TLIST(plan));
6822 718 : 9855 : splan->scan.plan.qual =
1856 719 : 9855 : fix_scan_list(root, splan->scan.plan.qual,
720 : : rtoffset, NUM_EXEC_QUAL(plan));
6822 721 : 9855 : splan->bitmapqualorig =
1856 722 : 9855 : fix_scan_list(root, splan->bitmapqualorig,
723 : : rtoffset, NUM_EXEC_QUAL(plan));
724 : : }
7496 725 : 9855 : break;
9276 726 : 378 : case T_TidScan:
727 : : {
6556 bruce@momjian.us 728 : 378 : TidScan *splan = (TidScan *) plan;
729 : :
6822 tgl@sss.pgh.pa.us 730 : 378 : splan->scan.scanrelid += rtoffset;
731 : 378 : splan->scan.plan.targetlist =
1856 732 : 378 : fix_scan_list(root, splan->scan.plan.targetlist,
733 : : rtoffset, NUM_EXEC_TLIST(plan));
6822 734 : 378 : splan->scan.plan.qual =
1856 735 : 378 : fix_scan_list(root, splan->scan.plan.qual,
736 : : rtoffset, NUM_EXEC_QUAL(plan));
6822 737 : 378 : splan->tidquals =
1856 738 : 378 : fix_scan_list(root, splan->tidquals,
739 : : rtoffset, 1);
740 : : }
9563 741 : 378 : break;
1703 drowley@postgresql.o 742 : 970 : case T_TidRangeScan:
743 : : {
744 : 970 : TidRangeScan *splan = (TidRangeScan *) plan;
745 : :
746 : 970 : splan->scan.scanrelid += rtoffset;
747 : 970 : splan->scan.plan.targetlist =
748 : 970 : fix_scan_list(root, splan->scan.plan.targetlist,
749 : : rtoffset, NUM_EXEC_TLIST(plan));
750 : 970 : splan->scan.plan.qual =
751 : 970 : fix_scan_list(root, splan->scan.plan.qual,
752 : : rtoffset, NUM_EXEC_QUAL(plan));
753 : 970 : splan->tidrangequals =
754 : 970 : fix_scan_list(root, splan->tidrangequals,
755 : : rtoffset, 1);
756 : : }
757 : 970 : break;
9159 tgl@sss.pgh.pa.us 758 : 16680 : case T_SubqueryScan:
759 : : /* Needs special treatment, see comments below */
5168 760 : 16680 : return set_subqueryscan_references(root,
761 : : (SubqueryScan *) plan,
762 : : rtoffset);
8569 763 : 24600 : case T_FunctionScan:
764 : : {
6822 765 : 24600 : FunctionScan *splan = (FunctionScan *) plan;
766 : :
767 : 24600 : splan->scan.scanrelid += rtoffset;
768 : 24600 : splan->scan.plan.targetlist =
1856 769 : 24600 : fix_scan_list(root, splan->scan.plan.targetlist,
770 : : rtoffset, NUM_EXEC_TLIST(plan));
6822 771 : 24600 : splan->scan.plan.qual =
1856 772 : 24600 : fix_scan_list(root, splan->scan.plan.qual,
773 : : rtoffset, NUM_EXEC_QUAL(plan));
4358 774 : 24600 : splan->functions =
1856 775 : 24600 : fix_scan_list(root, splan->functions, rtoffset, 1);
776 : : }
8569 777 : 24600 : break;
3155 alvherre@alvh.no-ip. 778 : 311 : case T_TableFuncScan:
779 : : {
780 : 311 : TableFuncScan *splan = (TableFuncScan *) plan;
781 : :
782 : 311 : splan->scan.scanrelid += rtoffset;
783 : 311 : splan->scan.plan.targetlist =
1856 tgl@sss.pgh.pa.us 784 : 311 : fix_scan_list(root, splan->scan.plan.targetlist,
785 : : rtoffset, NUM_EXEC_TLIST(plan));
3155 alvherre@alvh.no-ip. 786 : 311 : splan->scan.plan.qual =
1856 tgl@sss.pgh.pa.us 787 : 311 : fix_scan_list(root, splan->scan.plan.qual,
788 : : rtoffset, NUM_EXEC_QUAL(plan));
3155 alvherre@alvh.no-ip. 789 : 311 : splan->tablefunc = (TableFunc *)
1856 tgl@sss.pgh.pa.us 790 : 311 : fix_scan_expr(root, (Node *) splan->tablefunc,
791 : : rtoffset, 1);
792 : : }
3155 alvherre@alvh.no-ip. 793 : 311 : break;
7026 mail@joeconway.com 794 : 4125 : case T_ValuesScan:
795 : : {
6822 tgl@sss.pgh.pa.us 796 : 4125 : ValuesScan *splan = (ValuesScan *) plan;
797 : :
798 : 4125 : splan->scan.scanrelid += rtoffset;
799 : 4125 : splan->scan.plan.targetlist =
1856 800 : 4125 : fix_scan_list(root, splan->scan.plan.targetlist,
801 : : rtoffset, NUM_EXEC_TLIST(plan));
6822 802 : 4125 : splan->scan.plan.qual =
1856 803 : 4125 : fix_scan_list(root, splan->scan.plan.qual,
804 : : rtoffset, NUM_EXEC_QUAL(plan));
6822 805 : 4125 : splan->values_lists =
1856 806 : 4125 : fix_scan_list(root, splan->values_lists,
807 : : rtoffset, 1);
808 : : }
7026 mail@joeconway.com 809 : 4125 : break;
6232 tgl@sss.pgh.pa.us 810 : 2120 : case T_CteScan:
811 : : {
5982 bruce@momjian.us 812 : 2120 : CteScan *splan = (CteScan *) plan;
813 : :
6232 tgl@sss.pgh.pa.us 814 : 2120 : splan->scan.scanrelid += rtoffset;
815 : 2120 : splan->scan.plan.targetlist =
1856 816 : 2120 : fix_scan_list(root, splan->scan.plan.targetlist,
817 : : rtoffset, NUM_EXEC_TLIST(plan));
6232 818 : 2120 : splan->scan.plan.qual =
1856 819 : 2120 : fix_scan_list(root, splan->scan.plan.qual,
820 : : rtoffset, NUM_EXEC_QUAL(plan));
821 : : }
6232 822 : 2120 : break;
3132 kgrittn@postgresql.o 823 : 243 : case T_NamedTuplestoreScan:
824 : : {
825 : 243 : NamedTuplestoreScan *splan = (NamedTuplestoreScan *) plan;
826 : :
827 : 243 : splan->scan.scanrelid += rtoffset;
828 : 243 : splan->scan.plan.targetlist =
1856 tgl@sss.pgh.pa.us 829 : 243 : fix_scan_list(root, splan->scan.plan.targetlist,
830 : : rtoffset, NUM_EXEC_TLIST(plan));
3132 kgrittn@postgresql.o 831 : 243 : splan->scan.plan.qual =
1856 tgl@sss.pgh.pa.us 832 : 243 : fix_scan_list(root, splan->scan.plan.qual,
833 : : rtoffset, NUM_EXEC_QUAL(plan));
834 : : }
3132 kgrittn@postgresql.o 835 : 243 : break;
6232 tgl@sss.pgh.pa.us 836 : 467 : case T_WorkTableScan:
837 : : {
838 : 467 : WorkTableScan *splan = (WorkTableScan *) plan;
839 : :
840 : 467 : splan->scan.scanrelid += rtoffset;
841 : 467 : splan->scan.plan.targetlist =
1856 842 : 467 : fix_scan_list(root, splan->scan.plan.targetlist,
843 : : rtoffset, NUM_EXEC_TLIST(plan));
6232 844 : 467 : splan->scan.plan.qual =
1856 845 : 467 : fix_scan_list(root, splan->scan.plan.qual,
846 : : rtoffset, NUM_EXEC_QUAL(plan));
847 : : }
6232 848 : 467 : break;
5363 849 : 1017 : case T_ForeignScan:
3832 rhaas@postgresql.org 850 : 1017 : set_foreignscan_references(root, (ForeignScan *) plan, rtoffset);
5363 tgl@sss.pgh.pa.us 851 : 1017 : break;
4007 rhaas@postgresql.org 852 :UBC 0 : case T_CustomScan:
3832 853 : 0 : set_customscan_references(root, (CustomScan *) plan, rtoffset);
4007 854 : 0 : break;
855 : :
9563 tgl@sss.pgh.pa.us 856 :CBC 70240 : case T_NestLoop:
857 : : case T_MergeJoin:
858 : : case T_HashJoin:
5168 859 : 70240 : set_join_references(root, (Join *) plan, rtoffset);
9563 860 : 70240 : break;
861 : :
3652 rhaas@postgresql.org 862 : 717 : case T_Gather:
863 : : case T_GatherMerge:
864 : : {
2902 865 : 717 : set_upper_references(root, plan, rtoffset);
866 : 717 : set_param_references(root, plan);
867 : : }
3652 868 : 717 : break;
869 : :
8321 tgl@sss.pgh.pa.us 870 : 17502 : case T_Hash:
2278 andres@anarazel.de 871 : 17502 : set_hash_references(root, plan, rtoffset);
872 : 17502 : break;
873 : :
1566 drowley@postgresql.o 874 : 1018 : case T_Memoize:
875 : : {
876 : 1018 : Memoize *mplan = (Memoize *) plan;
877 : :
878 : : /*
879 : : * Memoize does not evaluate its targetlist. It just uses the
880 : : * same targetlist from its outer subnode.
881 : : */
1616 882 : 1018 : set_dummy_tlist_references(plan, rtoffset);
883 : :
1566 884 : 1018 : mplan->param_exprs = fix_scan_list(root, mplan->param_exprs,
885 : : rtoffset,
886 : : NUM_EXEC_TLIST(plan));
1669 887 : 1018 : break;
888 : : }
889 : :
9563 tgl@sss.pgh.pa.us 890 : 45143 : case T_Material:
891 : : case T_Sort:
892 : : case T_IncrementalSort:
893 : : case T_Unique:
894 : : case T_SetOp:
895 : :
896 : : /*
897 : : * These plan types don't actually bother to evaluate their
898 : : * targetlists, because they just return their unmodified input
899 : : * tuples. Even though the targetlist won't be used by the
900 : : * executor, we fix it up for possible use by EXPLAIN (not to
901 : : * mention ease of debugging --- wrong varnos are very confusing).
902 : : */
6821 903 : 45143 : set_dummy_tlist_references(plan, rtoffset);
904 : :
905 : : /*
906 : : * Since these plan types don't check quals either, we should not
907 : : * find any qual expression attached to them.
908 : : */
7463 909 [ - + ]: 45143 : Assert(plan->qual == NIL);
9563 910 : 45143 : break;
5859 911 : 3927 : case T_LockRows:
912 : : {
913 : 3927 : LockRows *splan = (LockRows *) plan;
914 : :
915 : : /*
916 : : * Like the plan types above, LockRows doesn't evaluate its
917 : : * tlist or quals. But we have to fix up the RT indexes in
918 : : * its rowmarks.
919 : : */
920 : 3927 : set_dummy_tlist_references(plan, rtoffset);
921 [ - + ]: 3927 : Assert(splan->plan.qual == NIL);
922 : :
923 [ + - + + : 9041 : foreach(l, splan->rowMarks)
+ + ]
924 : : {
5845 925 : 5114 : PlanRowMark *rc = (PlanRowMark *) lfirst(l);
926 : :
5859 927 : 5114 : rc->rti += rtoffset;
928 : 5114 : rc->prti += rtoffset;
929 : : }
930 : : }
931 : 3927 : break;
7839 932 : 2413 : case T_Limit:
933 : : {
6556 bruce@momjian.us 934 : 2413 : Limit *splan = (Limit *) plan;
935 : :
936 : : /*
937 : : * Like the plan types above, Limit doesn't evaluate its tlist
938 : : * or quals. It does have live expressions for limit/offset,
939 : : * however; and those cannot contain subplan variable refs, so
940 : : * fix_scan_expr works for them.
941 : : */
6821 tgl@sss.pgh.pa.us 942 : 2413 : set_dummy_tlist_references(plan, rtoffset);
6822 943 [ - + ]: 2413 : Assert(splan->plan.qual == NIL);
944 : :
945 : 2413 : splan->limitOffset =
1856 946 : 2413 : fix_scan_expr(root, splan->limitOffset, rtoffset, 1);
6822 947 : 2413 : splan->limitCount =
1856 948 : 2413 : fix_scan_expr(root, splan->limitCount, rtoffset, 1);
949 : : }
7839 950 : 2413 : break;
9563 951 : 20459 : case T_Agg:
952 : : {
3410 953 : 20459 : Agg *agg = (Agg *) plan;
954 : :
955 : : /*
956 : : * If this node is combining partial-aggregation results, we
957 : : * must convert its Aggrefs to contain references to the
958 : : * partial-aggregate subexpressions that will be available
959 : : * from the child plan node.
960 : : */
961 [ + + ]: 20459 : if (DO_AGGSPLIT_COMBINE(agg->aggsplit))
962 : : {
963 : 679 : plan->targetlist = (List *)
964 : 679 : convert_combining_aggrefs((Node *) plan->targetlist,
965 : : NULL);
966 : 679 : plan->qual = (List *)
967 : 679 : convert_combining_aggrefs((Node *) plan->qual,
968 : : NULL);
969 : : }
970 : :
971 : 20459 : set_upper_references(root, plan, rtoffset);
972 : : }
973 : 20459 : break;
9563 974 : 123 : case T_Group:
5168 975 : 123 : set_upper_references(root, plan, rtoffset);
9563 976 : 123 : break;
5736 977 : 1375 : case T_WindowAgg:
978 : : {
5722 bruce@momjian.us 979 : 1375 : WindowAgg *wplan = (WindowAgg *) plan;
980 : :
981 : : /*
982 : : * Adjust the WindowAgg's run conditions by swapping the
983 : : * WindowFuncs references out to instead reference the Var in
984 : : * the scan slot so that when the executor evaluates the
985 : : * runCondition, it receives the WindowFunc's value from the
986 : : * slot that the result has just been stored into rather than
987 : : * evaluating the WindowFunc all over again.
988 : : */
1298 drowley@postgresql.o 989 : 1375 : wplan->runCondition = set_windowagg_runcondition_references(root,
990 : : wplan->runCondition,
991 : : (Plan *) wplan);
992 : :
5168 tgl@sss.pgh.pa.us 993 : 1375 : set_upper_references(root, plan, rtoffset);
994 : :
995 : : /*
996 : : * Like Limit node limit/offset expressions, WindowAgg has
997 : : * frame offset expressions, which cannot contain subplan
998 : : * variable refs, so fix_scan_expr works for them.
999 : : */
5736 1000 : 1375 : wplan->startOffset =
1856 1001 : 1375 : fix_scan_expr(root, wplan->startOffset, rtoffset, 1);
5736 1002 : 1375 : wplan->endOffset =
1856 1003 : 1375 : fix_scan_expr(root, wplan->endOffset, rtoffset, 1);
1298 drowley@postgresql.o 1004 : 1375 : wplan->runCondition = fix_scan_list(root,
1005 : : wplan->runCondition,
1006 : : rtoffset,
1007 : : NUM_EXEC_TLIST(plan));
1008 : 1375 : wplan->runConditionOrig = fix_scan_list(root,
1009 : : wplan->runConditionOrig,
1010 : : rtoffset,
1011 : : NUM_EXEC_TLIST(plan));
1012 : : }
5736 tgl@sss.pgh.pa.us 1013 : 1375 : break;
9563 1014 : 102511 : case T_Result:
1015 : : {
6556 bruce@momjian.us 1016 : 102511 : Result *splan = (Result *) plan;
1017 : :
1018 : : /*
1019 : : * Result may or may not have a subplan; if not, it's more
1020 : : * like a scan node than an upper node.
1021 : : */
6822 tgl@sss.pgh.pa.us 1022 [ + + ]: 102511 : if (splan->plan.lefttree != NULL)
5168 1023 : 5861 : set_upper_references(root, plan, rtoffset);
1024 : : else
1025 : : {
1026 : : /*
1027 : : * The tlist of a childless Result could contain
1028 : : * unresolved ROWID_VAR Vars, in case it's representing a
1029 : : * target relation which is completely empty because of
1030 : : * constraint exclusion. Replace any such Vars by null
1031 : : * constants, as though they'd been resolved for a leaf
1032 : : * scan node that doesn't support them. We could have
1033 : : * fix_scan_expr do this, but since the case is only
1034 : : * expected to occur here, it seems safer to special-case
1035 : : * it here and keep the assertions that ROWID_VARs
1036 : : * shouldn't be seen by fix_scan_expr.
1037 : : *
1038 : : * We also must handle the case where set operations have
1039 : : * been short-circuited resulting in a dummy Result node.
1040 : : * prepunion.c uses varno==0 for the set op targetlist.
1041 : : * See generate_setop_tlist() and generate_setop_tlist().
1042 : : * Here we rewrite these to use varno==1, which is the
1043 : : * varno of the first set-op child. Without this, EXPLAIN
1044 : : * will have trouble displaying targetlists of dummy set
1045 : : * operations.
1046 : : */
1671 1047 [ + + + + : 223249 : foreach(l, splan->plan.targetlist)
+ + ]
1048 : : {
1049 : 126599 : TargetEntry *tle = (TargetEntry *) lfirst(l);
1050 : 126599 : Var *var = (Var *) tle->expr;
1051 : :
20 drowley@postgresql.o 1052 [ + - + + ]:GNC 126599 : if (var && IsA(var, Var))
1053 : : {
1054 [ + + ]: 829 : if (var->varno == ROWID_VAR)
1055 : 36 : tle->expr = (Expr *) makeNullConst(var->vartype,
1056 : : var->vartypmod,
1057 : : var->varcollid);
1058 [ + + ]: 793 : else if (var->varno == 0)
1059 : 15 : tle->expr = (Expr *) makeVar(1,
1060 : 15 : var->varattno,
1061 : : var->vartype,
1062 : : var->vartypmod,
1063 : : var->varcollid,
1064 : : var->varlevelsup);
1065 : : }
1066 : : }
1067 : :
6822 tgl@sss.pgh.pa.us 1068 :CBC 96650 : splan->plan.targetlist =
1856 1069 : 96650 : fix_scan_list(root, splan->plan.targetlist,
1070 : : rtoffset, NUM_EXEC_TLIST(plan));
6822 1071 : 96650 : splan->plan.qual =
1856 1072 : 96650 : fix_scan_list(root, splan->plan.qual,
1073 : : rtoffset, NUM_EXEC_QUAL(plan));
1074 : : }
1075 : : /* resconstantqual can't contain any subplan variable refs */
6822 1076 : 102511 : splan->resconstantqual =
1856 1077 : 102511 : fix_scan_expr(root, splan->resconstantqual, rtoffset, 1);
1078 : : /* adjust the relids set */
34 rhaas@postgresql.org 1079 :GNC 102511 : splan->relids = offset_relid_set(splan->relids, rtoffset);
1080 : : }
9563 tgl@sss.pgh.pa.us 1081 :CBC 102511 : break;
3204 andres@anarazel.de 1082 : 5868 : case T_ProjectSet:
1083 : 5868 : set_upper_references(root, plan, rtoffset);
1084 : 5868 : break;
5861 tgl@sss.pgh.pa.us 1085 : 41950 : case T_ModifyTable:
1086 : : {
1087 : 41950 : ModifyTable *splan = (ModifyTable *) plan;
1309 alvherre@alvh.no-ip. 1088 : 41950 : Plan *subplan = outerPlan(splan);
1089 : :
4933 tgl@sss.pgh.pa.us 1090 [ - + ]: 41950 : Assert(splan->plan.targetlist == NIL);
5861 1091 [ - + ]: 41950 : Assert(splan->plan.qual == NIL);
1092 : :
4053 sfrost@snowman.net 1093 : 41950 : splan->withCheckOptionLists =
1856 tgl@sss.pgh.pa.us 1094 : 41950 : fix_scan_list(root, splan->withCheckOptionLists,
1095 : : rtoffset, 1);
1096 : :
4933 1097 [ + + ]: 41950 : if (splan->returningLists)
1098 : : {
1099 : 1449 : List *newRL = NIL;
1100 : : ListCell *lcrl,
1101 : : *lcrr;
1102 : :
1103 : : /*
1104 : : * Pass each per-resultrel returningList through
1105 : : * set_returning_clause_references().
1106 : : */
1107 [ - + ]: 1449 : Assert(list_length(splan->returningLists) == list_length(splan->resultRelations));
1671 1108 [ + - + + : 3092 : forboth(lcrl, splan->returningLists,
+ - + + +
+ + - +
+ ]
1109 : : lcrr, splan->resultRelations)
1110 : : {
4887 bruce@momjian.us 1111 : 1643 : List *rlist = (List *) lfirst(lcrl);
1112 : 1643 : Index resultrel = lfirst_int(lcrr);
1113 : :
4933 tgl@sss.pgh.pa.us 1114 : 1643 : rlist = set_returning_clause_references(root,
1115 : : rlist,
1116 : : subplan,
1117 : : resultrel,
1118 : : rtoffset);
1119 : 1643 : newRL = lappend(newRL, rlist);
1120 : : }
1121 : 1449 : splan->returningLists = newRL;
1122 : :
1123 : : /*
1124 : : * Set up the visible plan targetlist as being the same as
1125 : : * the first RETURNING list. This is mostly for the use
1126 : : * of EXPLAIN; the executor won't execute that targetlist,
1127 : : * although it does use it to prepare the node's result
1128 : : * tuple slot. We postpone this step until here so that
1129 : : * we don't have to do set_returning_clause_references()
1130 : : * twice on identical targetlists.
1131 : : */
1132 : 1449 : splan->plan.targetlist = copyObject(linitial(newRL));
1133 : : }
1134 : :
1135 : : /*
1136 : : * We treat ModifyTable with ON CONFLICT as a form of 'pseudo
1137 : : * join', where the inner side is the EXCLUDED tuple.
1138 : : * Therefore use fix_join_expr to setup the relevant variables
1139 : : * to INNER_VAR. We explicitly don't create any OUTER_VARs as
1140 : : * those are already used by RETURNING and it seems better to
1141 : : * be non-conflicting.
1142 : : */
3825 andres@anarazel.de 1143 [ + + ]: 41950 : if (splan->onConflictSet)
1144 : : {
1145 : : indexed_tlist *itlist;
1146 : :
1147 : 486 : itlist = build_tlist_index(splan->exclRelTlist);
1148 : :
1149 : 486 : splan->onConflictSet =
1150 : 972 : fix_join_expr(root, splan->onConflictSet,
1151 : : NULL, itlist,
1152 : 486 : linitial_int(splan->resultRelations),
1001 tgl@sss.pgh.pa.us 1153 : 486 : rtoffset, NRM_EQUAL, NUM_EXEC_QUAL(plan));
1154 : :
3825 andres@anarazel.de 1155 : 486 : splan->onConflictWhere = (Node *)
1156 : 972 : fix_join_expr(root, (List *) splan->onConflictWhere,
1157 : : NULL, itlist,
1158 : 486 : linitial_int(splan->resultRelations),
1001 tgl@sss.pgh.pa.us 1159 : 486 : rtoffset, NRM_EQUAL, NUM_EXEC_QUAL(plan));
1160 : :
3760 andres@anarazel.de 1161 : 486 : pfree(itlist);
1162 : :
3820 1163 : 486 : splan->exclRelTlist =
1856 tgl@sss.pgh.pa.us 1164 : 486 : fix_scan_list(root, splan->exclRelTlist, rtoffset, 1);
1165 : : }
1166 : :
1167 : : /*
1168 : : * The MERGE statement produces the target rows by performing
1169 : : * a right join between the target relation and the source
1170 : : * relation (which could be a plain relation or a subquery).
1171 : : * The INSERT and UPDATE actions of the MERGE statement
1172 : : * require access to the columns from the source relation. We
1173 : : * arrange things so that the source relation attributes are
1174 : : * available as INNER_VAR and the target relation attributes
1175 : : * are available from the scan tuple.
1176 : : */
1309 alvherre@alvh.no-ip. 1177 [ + + ]: 41950 : if (splan->mergeActionLists != NIL)
1178 : : {
576 dean.a.rasheed@gmail 1179 : 893 : List *newMJC = NIL;
1180 : : ListCell *lca,
1181 : : *lcj,
1182 : : *lcr;
1183 : :
1184 : : /*
1185 : : * Fix the targetList of individual action nodes so that
1186 : : * the so-called "source relation" Vars are referenced as
1187 : : * INNER_VAR. Note that for this to work correctly during
1188 : : * execution, the ecxt_innertuple must be set to the tuple
1189 : : * obtained by executing the subplan, which is what
1190 : : * constitutes the "source relation".
1191 : : *
1192 : : * We leave the Vars from the result relation (i.e. the
1193 : : * target relation) unchanged i.e. those Vars would be
1194 : : * picked from the scan slot. So during execution, we must
1195 : : * ensure that ecxt_scantuple is setup correctly to refer
1196 : : * to the tuple from the target relation.
1197 : : */
1198 : : indexed_tlist *itlist;
1199 : :
1309 alvherre@alvh.no-ip. 1200 : 893 : itlist = build_tlist_index(subplan->targetlist);
1201 : :
576 dean.a.rasheed@gmail 1202 [ + - + + : 1929 : forthree(lca, splan->mergeActionLists,
+ - + + +
- + + + +
+ - + - +
+ ]
1203 : : lcj, splan->mergeJoinConditions,
1204 : : lcr, splan->resultRelations)
1205 : : {
1309 alvherre@alvh.no-ip. 1206 : 1036 : List *mergeActionList = lfirst(lca);
576 dean.a.rasheed@gmail 1207 : 1036 : Node *mergeJoinCondition = lfirst(lcj);
1309 alvherre@alvh.no-ip. 1208 : 1036 : Index resultrel = lfirst_int(lcr);
1209 : :
1210 [ + - + + : 2776 : foreach(l, mergeActionList)
+ + ]
1211 : : {
1212 : 1740 : MergeAction *action = (MergeAction *) lfirst(l);
1213 : :
1214 : : /* Fix targetList of each action. */
1215 : 1740 : action->targetList = fix_join_expr(root,
1216 : : action->targetList,
1217 : : NULL, itlist,
1218 : : resultrel,
1219 : : rtoffset,
1220 : : NRM_EQUAL,
1221 : : NUM_EXEC_TLIST(plan));
1222 : :
1223 : : /* Fix quals too. */
1224 : 1740 : action->qual = (Node *) fix_join_expr(root,
1225 : 1740 : (List *) action->qual,
1226 : : NULL, itlist,
1227 : : resultrel,
1228 : : rtoffset,
1229 : : NRM_EQUAL,
1230 : 1740 : NUM_EXEC_QUAL(plan));
1231 : : }
1232 : :
1233 : : /* Fix join condition too. */
1234 : : mergeJoinCondition = (Node *)
576 dean.a.rasheed@gmail 1235 : 1036 : fix_join_expr(root,
1236 : : (List *) mergeJoinCondition,
1237 : : NULL, itlist,
1238 : : resultrel,
1239 : : rtoffset,
1240 : : NRM_EQUAL,
1241 : 1036 : NUM_EXEC_QUAL(plan));
1242 : 1036 : newMJC = lappend(newMJC, mergeJoinCondition);
1243 : : }
1244 : 893 : splan->mergeJoinConditions = newMJC;
1245 : : }
1246 : :
3905 tgl@sss.pgh.pa.us 1247 : 41950 : splan->nominalRelation += rtoffset;
2577 1248 [ + + ]: 41950 : if (splan->rootRelation)
1249 : 1436 : splan->rootRelation += rtoffset;
3825 andres@anarazel.de 1250 : 41950 : splan->exclRelRTI += rtoffset;
1251 : :
5861 tgl@sss.pgh.pa.us 1252 [ + - + + : 85146 : foreach(l, splan->resultRelations)
+ + ]
1253 : : {
1254 : 43196 : lfirst_int(l) += rtoffset;
1255 : : }
5845 1256 [ + + + + : 43400 : foreach(l, splan->rowMarks)
+ + ]
1257 : : {
1258 : 1450 : PlanRowMark *rc = (PlanRowMark *) lfirst(l);
1259 : :
1260 : 1450 : rc->rti += rtoffset;
1261 : 1450 : rc->prti += rtoffset;
1262 : : }
1263 : :
1264 : : /*
1265 : : * Append this ModifyTable node's final result relation RT
1266 : : * index(es) to the global list for the plan.
1267 : : */
5168 1268 : 83900 : root->glob->resultRelations =
1269 : 41950 : list_concat(root->glob->resultRelations,
2268 1270 : 41950 : splan->resultRelations);
2577 1271 [ + + ]: 41950 : if (splan->rootRelation)
1272 : : {
1840 heikki.linnakangas@i 1273 : 1436 : root->glob->resultRelations =
1274 : 1436 : lappend_int(root->glob->resultRelations,
2577 tgl@sss.pgh.pa.us 1275 : 1436 : splan->rootRelation);
1276 : : }
1277 : : }
5861 1278 : 41950 : break;
9563 1279 : 12132 : case T_Append:
1280 : : /* Needs special treatment, see comments below */
2408 1281 : 12132 : return set_append_references(root,
1282 : : (Append *) plan,
1283 : : rtoffset);
5492 1284 : 283 : case T_MergeAppend:
1285 : : /* Needs special treatment, see comments below */
2408 1286 : 283 : return set_mergeappend_references(root,
1287 : : (MergeAppend *) plan,
1288 : : rtoffset);
6232 1289 : 467 : case T_RecursiveUnion:
1290 : : /* This doesn't evaluate targetlist or check quals either */
1291 : 467 : set_dummy_tlist_references(plan, rtoffset);
1292 [ - + ]: 467 : Assert(plan->qual == NIL);
1293 : 467 : break;
7496 1294 : 121 : case T_BitmapAnd:
1295 : : {
6556 bruce@momjian.us 1296 : 121 : BitmapAnd *splan = (BitmapAnd *) plan;
1297 : :
1298 : : /* BitmapAnd works like Append, but has no tlist */
6822 tgl@sss.pgh.pa.us 1299 [ - + ]: 121 : Assert(splan->plan.targetlist == NIL);
1300 [ - + ]: 121 : Assert(splan->plan.qual == NIL);
1301 [ + - + + : 363 : foreach(l, splan->bitmapplans)
+ + ]
1302 : : {
5168 1303 : 242 : lfirst(l) = set_plan_refs(root,
6822 1304 : 242 : (Plan *) lfirst(l),
1305 : : rtoffset);
1306 : : }
1307 : : }
7496 1308 : 121 : break;
1309 : 209 : case T_BitmapOr:
1310 : : {
6556 bruce@momjian.us 1311 : 209 : BitmapOr *splan = (BitmapOr *) plan;
1312 : :
1313 : : /* BitmapOr works like Append, but has no tlist */
6822 tgl@sss.pgh.pa.us 1314 [ - + ]: 209 : Assert(splan->plan.targetlist == NIL);
1315 [ - + ]: 209 : Assert(splan->plan.qual == NIL);
1316 [ + - + + : 630 : foreach(l, splan->bitmapplans)
+ + ]
1317 : : {
5168 1318 : 421 : lfirst(l) = set_plan_refs(root,
6822 1319 : 421 : (Plan *) lfirst(l),
1320 : : rtoffset);
1321 : : }
1322 : : }
7496 1323 : 209 : break;
9563 tgl@sss.pgh.pa.us 1324 :UBC 0 : default:
8130 1325 [ # # ]: 0 : elog(ERROR, "unrecognized node type: %d",
1326 : : (int) nodeTag(plan));
1327 : : break;
1328 : : }
1329 : :
1330 : : /*
1331 : : * Now recurse into child plans, if any
1332 : : *
1333 : : * NOTE: it is essential that we recurse into child plans AFTER we set
1334 : : * subplan references in this plan's tlist and quals. If we did the
1335 : : * reference-adjustments bottom-up, then we would fail to match this
1336 : : * plan's var nodes against the already-modified nodes of the children.
1337 : : */
5168 tgl@sss.pgh.pa.us 1338 :CBC 550470 : plan->lefttree = set_plan_refs(root, plan->lefttree, rtoffset);
1339 : 550470 : plan->righttree = set_plan_refs(root, plan->righttree, rtoffset);
1340 : :
7463 1341 : 550470 : return plan;
1342 : : }
1343 : :
1344 : : /*
1345 : : * set_indexonlyscan_references
1346 : : * Do set_plan_references processing on an IndexOnlyScan
1347 : : *
1348 : : * This is unlike the handling of a plain IndexScan because we have to
1349 : : * convert Vars referencing the heap into Vars referencing the index.
1350 : : * We can use the fix_upper_expr machinery for that, by working from a
1351 : : * targetlist describing the index columns.
1352 : : */
1353 : : static Plan *
5130 1354 : 8378 : set_indexonlyscan_references(PlannerInfo *root,
1355 : : IndexOnlyScan *plan,
1356 : : int rtoffset)
1357 : : {
1358 : : indexed_tlist *index_itlist;
1359 : : List *stripped_indextlist;
1360 : : ListCell *lc;
1361 : :
1362 : : /*
1363 : : * Vars in the plan node's targetlist, qual, and recheckqual must only
1364 : : * reference columns that the index AM can actually return. To ensure
1365 : : * this, remove non-returnable columns (which are marked as resjunk) from
1366 : : * the indexed tlist. We can just drop them because the indexed_tlist
1367 : : * machinery pays attention to TLE resnos, not physical list position.
1368 : : */
1393 1369 : 8378 : stripped_indextlist = NIL;
1370 [ + - + + : 19137 : foreach(lc, plan->indextlist)
+ + ]
1371 : : {
1372 : 10759 : TargetEntry *indextle = (TargetEntry *) lfirst(lc);
1373 : :
1374 [ + + ]: 10759 : if (!indextle->resjunk)
1375 : 10733 : stripped_indextlist = lappend(stripped_indextlist, indextle);
1376 : : }
1377 : :
1378 : 8378 : index_itlist = build_tlist_index(stripped_indextlist);
1379 : :
5130 1380 : 8378 : plan->scan.scanrelid += rtoffset;
1381 : 8378 : plan->scan.plan.targetlist = (List *)
1382 : 8378 : fix_upper_expr(root,
1383 : 8378 : (Node *) plan->scan.plan.targetlist,
1384 : : index_itlist,
1385 : : INDEX_VAR,
1386 : : rtoffset,
1387 : : NRM_EQUAL,
1388 : : NUM_EXEC_TLIST((Plan *) plan));
1389 : 8378 : plan->scan.plan.qual = (List *)
1390 : 8378 : fix_upper_expr(root,
1391 : 8378 : (Node *) plan->scan.plan.qual,
1392 : : index_itlist,
1393 : : INDEX_VAR,
1394 : : rtoffset,
1395 : : NRM_EQUAL,
1856 1396 : 8378 : NUM_EXEC_QUAL((Plan *) plan));
1393 1397 : 8378 : plan->recheckqual = (List *)
1398 : 8378 : fix_upper_expr(root,
1399 : 8378 : (Node *) plan->recheckqual,
1400 : : index_itlist,
1401 : : INDEX_VAR,
1402 : : rtoffset,
1403 : : NRM_EQUAL,
1404 : 8378 : NUM_EXEC_QUAL((Plan *) plan));
1405 : : /* indexqual is already transformed to reference index columns */
1856 1406 : 8378 : plan->indexqual = fix_scan_list(root, plan->indexqual,
1407 : : rtoffset, 1);
1408 : : /* indexorderby is already transformed to reference index columns */
1409 : 8378 : plan->indexorderby = fix_scan_list(root, plan->indexorderby,
1410 : : rtoffset, 1);
1411 : : /* indextlist must NOT be transformed to reference index columns */
1412 : 8378 : plan->indextlist = fix_scan_list(root, plan->indextlist,
1413 : : rtoffset, NUM_EXEC_TLIST((Plan *) plan));
1414 : :
5130 1415 : 8378 : pfree(index_itlist);
1416 : :
1417 : 8378 : return (Plan *) plan;
1418 : : }
1419 : :
1420 : : /*
1421 : : * set_subqueryscan_references
1422 : : * Do set_plan_references processing on a SubqueryScan
1423 : : *
1424 : : * We try to strip out the SubqueryScan entirely; if we can't, we have
1425 : : * to do the normal processing on it.
1426 : : */
1427 : : static Plan *
5168 1428 : 16680 : set_subqueryscan_references(PlannerInfo *root,
1429 : : SubqueryScan *plan,
1430 : : int rtoffset)
1431 : : {
1432 : : RelOptInfo *rel;
1433 : : Plan *result;
1434 : :
1435 : : /* Need to look up the subquery's RelOptInfo, since we need its subroot */
1436 : 16680 : rel = find_base_rel(root, plan->scan.scanrelid);
1437 : :
1438 : : /* Recursively process the subplan */
1439 : 16680 : plan->subplan = set_plan_references(rel->subroot, plan->subplan);
1440 : :
7463 1441 [ + + ]: 16680 : if (trivial_subqueryscan(plan))
1442 : : {
1443 : : /*
1444 : : * We can omit the SubqueryScan node and just pull up the subplan.
1445 : : */
2408 1446 : 8839 : result = clean_up_removed_plan_level((Plan *) plan, plan->subplan);
1447 : : }
1448 : : else
1449 : : {
1450 : : /*
1451 : : * Keep the SubqueryScan node. We have to do the processing that
1452 : : * set_plan_references would otherwise have done on it. Notice we do
1453 : : * not do set_upper_references() here, because a SubqueryScan will
1454 : : * always have been created with correct references to its subplan's
1455 : : * outputs to begin with.
1456 : : */
6822 1457 : 7841 : plan->scan.scanrelid += rtoffset;
1458 : 7841 : plan->scan.plan.targetlist =
1856 1459 : 7841 : fix_scan_list(root, plan->scan.plan.targetlist,
1460 : : rtoffset, NUM_EXEC_TLIST((Plan *) plan));
6822 1461 : 7841 : plan->scan.plan.qual =
1856 1462 : 7841 : fix_scan_list(root, plan->scan.plan.qual,
1463 : : rtoffset, NUM_EXEC_QUAL((Plan *) plan));
1464 : :
6822 1465 : 7841 : result = (Plan *) plan;
1466 : : }
1467 : :
7463 1468 : 16680 : return result;
1469 : : }
1470 : :
1471 : : /*
1472 : : * trivial_subqueryscan
1473 : : * Detect whether a SubqueryScan can be deleted from the plan tree.
1474 : : *
1475 : : * We can delete it if it has no qual to check and the targetlist just
1476 : : * regurgitates the output of the child plan.
1477 : : *
1478 : : * This can be called from mark_async_capable_plan(), a helper function for
1479 : : * create_append_plan(), before set_subqueryscan_references(), to determine
1480 : : * triviality of a SubqueryScan that is a child of an Append node. So we
1481 : : * cache the result in the SubqueryScan node to avoid repeated computation.
1482 : : *
1483 : : * Note: when called from mark_async_capable_plan(), we determine the result
1484 : : * before running finalize_plan() on the SubqueryScan node (if needed) and
1485 : : * set_plan_references() on the subplan tree, but this would be safe, because
1486 : : * 1) finalize_plan() doesn't modify the tlist or quals for the SubqueryScan
1487 : : * node (or that for any plan node in the subplan tree), and
1488 : : * 2) set_plan_references() modifies the tlist for every plan node in the
1489 : : * subplan tree, but keeps const/resjunk columns as const/resjunk ones and
1490 : : * preserves the length and order of the tlist, and
1491 : : * 3) set_plan_references() might delete the topmost plan node like an Append
1492 : : * or MergeAppend from the subplan tree and pull up the child plan node,
1493 : : * but in that case, the tlist for the child plan node exactly matches the
1494 : : * parent.
1495 : : */
1496 : : bool
1497 : 22223 : trivial_subqueryscan(SubqueryScan *plan)
1498 : : {
1499 : : int attrno;
1500 : : ListCell *lp,
1501 : : *lc;
1502 : :
1503 : : /* We might have detected this already; in which case reuse the result */
1300 efujita@postgresql.o 1504 [ + + ]: 22223 : if (plan->scanstatus == SUBQUERY_SCAN_TRIVIAL)
1505 : 2251 : return true;
1506 [ + + ]: 19972 : if (plan->scanstatus == SUBQUERY_SCAN_NONTRIVIAL)
1507 : 3292 : return false;
1508 [ - + ]: 16680 : Assert(plan->scanstatus == SUBQUERY_SCAN_UNKNOWN);
1509 : : /* Initially, mark the SubqueryScan as non-deletable from the plan tree */
1510 : 16680 : plan->scanstatus = SUBQUERY_SCAN_NONTRIVIAL;
1511 : :
7463 tgl@sss.pgh.pa.us 1512 [ + + ]: 16680 : if (plan->scan.plan.qual != NIL)
1513 : 344 : return false;
1514 : :
7357 1515 [ + + ]: 32672 : if (list_length(plan->scan.plan.targetlist) !=
1516 : 16336 : list_length(plan->subplan->targetlist))
1517 : 3435 : return false; /* tlists not same length */
1518 : :
7463 1519 : 12901 : attrno = 1;
1520 [ + + + + : 39611 : forboth(lp, plan->scan.plan.targetlist, lc, plan->subplan->targetlist)
+ + + + +
+ + - +
+ ]
1521 : : {
1522 : 30772 : TargetEntry *ptle = (TargetEntry *) lfirst(lp);
1523 : 30772 : TargetEntry *ctle = (TargetEntry *) lfirst(lc);
1524 : :
1525 [ + + ]: 30772 : if (ptle->resjunk != ctle->resjunk)
1526 : 4062 : return false; /* tlist doesn't match junk status */
1527 : :
1528 : : /*
1529 : : * We accept either a Var referencing the corresponding element of the
1530 : : * subplan tlist, or a Const equaling the subplan element. See
1531 : : * generate_setop_tlist() for motivation.
1532 : : */
7000 1533 [ + - + + ]: 30760 : if (ptle->expr && IsA(ptle->expr, Var))
1534 : 25505 : {
6963 bruce@momjian.us 1535 : 25601 : Var *var = (Var *) ptle->expr;
1536 : :
7000 tgl@sss.pgh.pa.us 1537 [ - + ]: 25601 : Assert(var->varno == plan->scan.scanrelid);
1538 [ - + ]: 25601 : Assert(var->varlevelsup == 0);
1539 [ + + ]: 25601 : if (var->varattno != attrno)
1540 : 96 : return false; /* out of order */
1541 : : }
1542 [ + - + + ]: 5159 : else if (ptle->expr && IsA(ptle->expr, Const))
1543 : : {
1544 [ + + ]: 4413 : if (!equal(ptle->expr, ctle->expr))
1545 : 3208 : return false;
1546 : : }
1547 : : else
1548 : 746 : return false;
1549 : :
7463 1550 : 26710 : attrno++;
1551 : : }
1552 : :
1553 : : /* Re-mark the SubqueryScan as deletable from the plan tree */
1300 efujita@postgresql.o 1554 : 8839 : plan->scanstatus = SUBQUERY_SCAN_TRIVIAL;
1555 : :
7463 tgl@sss.pgh.pa.us 1556 : 8839 : return true;
1557 : : }
1558 : :
1559 : : /*
1560 : : * clean_up_removed_plan_level
1561 : : * Do necessary cleanup when we strip out a SubqueryScan, Append, etc
1562 : : *
1563 : : * We are dropping the "parent" plan in favor of returning just its "child".
1564 : : * A few small tweaks are needed.
1565 : : */
1566 : : static Plan *
2408 1567 : 12092 : clean_up_removed_plan_level(Plan *parent, Plan *child)
1568 : : {
1569 : : /*
1570 : : * We have to be sure we don't lose any initplans, so move any that were
1571 : : * attached to the parent plan to the child. If any are parallel-unsafe,
1572 : : * the child is no longer parallel-safe. As a cosmetic matter, also add
1573 : : * the initplans' run costs to the child's costs.
1574 : : */
929 1575 [ + + ]: 12092 : if (parent->initPlan)
1576 : : {
1577 : : Cost initplan_cost;
1578 : : bool unsafe_initplans;
1579 : :
837 1580 : 21 : SS_compute_initplan_cost(parent->initPlan,
1581 : : &initplan_cost, &unsafe_initplans);
1582 : 21 : child->startup_cost += initplan_cost;
1583 : 21 : child->total_cost += initplan_cost;
1584 [ + + ]: 21 : if (unsafe_initplans)
1585 : 9 : child->parallel_safe = false;
1586 : :
1587 : : /*
1588 : : * Attach plans this way so that parent's initplans are processed
1589 : : * before any pre-existing initplans of the child. Probably doesn't
1590 : : * matter, but let's preserve the ordering just in case.
1591 : : */
1592 : 21 : child->initPlan = list_concat(parent->initPlan,
1593 : 21 : child->initPlan);
1594 : : }
1595 : :
1596 : : /*
1597 : : * We also have to transfer the parent's column labeling info into the
1598 : : * child, else columns sent to client will be improperly labeled if this
1599 : : * is the topmost plan level. resjunk and so on may be important too.
1600 : : */
2408 1601 : 12092 : apply_tlist_labeling(child->targetlist, parent->targetlist);
1602 : :
1603 : 12092 : return child;
1604 : : }
1605 : :
1606 : : /*
1607 : : * set_foreignscan_references
1608 : : * Do set_plan_references processing on a ForeignScan
1609 : : */
1610 : : static void
3823 1611 : 1017 : set_foreignscan_references(PlannerInfo *root,
1612 : : ForeignScan *fscan,
1613 : : int rtoffset)
1614 : : {
1615 : : /* Adjust scanrelid if it's valid */
1616 [ + + ]: 1017 : if (fscan->scan.scanrelid > 0)
1617 : 733 : fscan->scan.scanrelid += rtoffset;
1618 : :
1619 [ + + + + ]: 1017 : if (fscan->fdw_scan_tlist != NIL || fscan->scan.scanrelid == 0)
1620 : 284 : {
1621 : : /*
1622 : : * Adjust tlist, qual, fdw_exprs, fdw_recheck_quals to reference
1623 : : * foreign scan tuple
1624 : : */
1625 : 284 : indexed_tlist *itlist = build_tlist_index(fscan->fdw_scan_tlist);
1626 : :
1627 : 284 : fscan->scan.plan.targetlist = (List *)
1628 : 284 : fix_upper_expr(root,
1629 : 284 : (Node *) fscan->scan.plan.targetlist,
1630 : : itlist,
1631 : : INDEX_VAR,
1632 : : rtoffset,
1633 : : NRM_EQUAL,
1634 : : NUM_EXEC_TLIST((Plan *) fscan));
1635 : 284 : fscan->scan.plan.qual = (List *)
1636 : 284 : fix_upper_expr(root,
1637 : 284 : (Node *) fscan->scan.plan.qual,
1638 : : itlist,
1639 : : INDEX_VAR,
1640 : : rtoffset,
1641 : : NRM_EQUAL,
1856 1642 : 284 : NUM_EXEC_QUAL((Plan *) fscan));
3823 1643 : 284 : fscan->fdw_exprs = (List *)
1644 : 284 : fix_upper_expr(root,
1645 : 284 : (Node *) fscan->fdw_exprs,
1646 : : itlist,
1647 : : INDEX_VAR,
1648 : : rtoffset,
1649 : : NRM_EQUAL,
1856 1650 : 284 : NUM_EXEC_QUAL((Plan *) fscan));
3631 rhaas@postgresql.org 1651 : 284 : fscan->fdw_recheck_quals = (List *)
1652 : 284 : fix_upper_expr(root,
1653 : 284 : (Node *) fscan->fdw_recheck_quals,
1654 : : itlist,
1655 : : INDEX_VAR,
1656 : : rtoffset,
1657 : : NRM_EQUAL,
1856 tgl@sss.pgh.pa.us 1658 : 284 : NUM_EXEC_QUAL((Plan *) fscan));
3823 1659 : 284 : pfree(itlist);
1660 : : /* fdw_scan_tlist itself just needs fix_scan_list() adjustments */
1661 : 284 : fscan->fdw_scan_tlist =
1856 1662 : 284 : fix_scan_list(root, fscan->fdw_scan_tlist,
1663 : : rtoffset, NUM_EXEC_TLIST((Plan *) fscan));
1664 : : }
1665 : : else
1666 : : {
1667 : : /*
1668 : : * Adjust tlist, qual, fdw_exprs, fdw_recheck_quals in the standard
1669 : : * way
1670 : : */
3823 1671 : 733 : fscan->scan.plan.targetlist =
1856 1672 : 733 : fix_scan_list(root, fscan->scan.plan.targetlist,
1673 : : rtoffset, NUM_EXEC_TLIST((Plan *) fscan));
3823 1674 : 733 : fscan->scan.plan.qual =
1856 1675 : 733 : fix_scan_list(root, fscan->scan.plan.qual,
1676 : : rtoffset, NUM_EXEC_QUAL((Plan *) fscan));
3823 1677 : 733 : fscan->fdw_exprs =
1856 1678 : 733 : fix_scan_list(root, fscan->fdw_exprs,
1679 : : rtoffset, NUM_EXEC_QUAL((Plan *) fscan));
3665 rhaas@postgresql.org 1680 : 733 : fscan->fdw_recheck_quals =
1856 tgl@sss.pgh.pa.us 1681 : 733 : fix_scan_list(root, fscan->fdw_recheck_quals,
1682 : : rtoffset, NUM_EXEC_QUAL((Plan *) fscan));
1683 : : }
1684 : :
2147 1685 : 1017 : fscan->fs_relids = offset_relid_set(fscan->fs_relids, rtoffset);
1001 1686 : 1017 : fscan->fs_base_relids = offset_relid_set(fscan->fs_base_relids, rtoffset);
1687 : :
1688 : : /* Adjust resultRelation if it's valid */
1839 heikki.linnakangas@i 1689 [ + + ]: 1017 : if (fscan->resultRelation > 0)
1690 : 104 : fscan->resultRelation += rtoffset;
3823 tgl@sss.pgh.pa.us 1691 : 1017 : }
1692 : :
1693 : : /*
1694 : : * set_customscan_references
1695 : : * Do set_plan_references processing on a CustomScan
1696 : : */
1697 : : static void
3823 tgl@sss.pgh.pa.us 1698 :UBC 0 : set_customscan_references(PlannerInfo *root,
1699 : : CustomScan *cscan,
1700 : : int rtoffset)
1701 : : {
1702 : : ListCell *lc;
1703 : :
1704 : : /* Adjust scanrelid if it's valid */
1705 [ # # ]: 0 : if (cscan->scan.scanrelid > 0)
1706 : 0 : cscan->scan.scanrelid += rtoffset;
1707 : :
1708 [ # # # # ]: 0 : if (cscan->custom_scan_tlist != NIL || cscan->scan.scanrelid == 0)
1709 : 0 : {
1710 : : /* Adjust tlist, qual, custom_exprs to reference custom scan tuple */
1711 : 0 : indexed_tlist *itlist = build_tlist_index(cscan->custom_scan_tlist);
1712 : :
1713 : 0 : cscan->scan.plan.targetlist = (List *)
1714 : 0 : fix_upper_expr(root,
1715 : 0 : (Node *) cscan->scan.plan.targetlist,
1716 : : itlist,
1717 : : INDEX_VAR,
1718 : : rtoffset,
1719 : : NRM_EQUAL,
1720 : : NUM_EXEC_TLIST((Plan *) cscan));
1721 : 0 : cscan->scan.plan.qual = (List *)
1722 : 0 : fix_upper_expr(root,
1723 : 0 : (Node *) cscan->scan.plan.qual,
1724 : : itlist,
1725 : : INDEX_VAR,
1726 : : rtoffset,
1727 : : NRM_EQUAL,
1856 1728 : 0 : NUM_EXEC_QUAL((Plan *) cscan));
3823 1729 : 0 : cscan->custom_exprs = (List *)
1730 : 0 : fix_upper_expr(root,
1731 : 0 : (Node *) cscan->custom_exprs,
1732 : : itlist,
1733 : : INDEX_VAR,
1734 : : rtoffset,
1735 : : NRM_EQUAL,
1856 1736 : 0 : NUM_EXEC_QUAL((Plan *) cscan));
3823 1737 : 0 : pfree(itlist);
1738 : : /* custom_scan_tlist itself just needs fix_scan_list() adjustments */
1739 : 0 : cscan->custom_scan_tlist =
1856 1740 : 0 : fix_scan_list(root, cscan->custom_scan_tlist,
1741 : : rtoffset, NUM_EXEC_TLIST((Plan *) cscan));
1742 : : }
1743 : : else
1744 : : {
1745 : : /* Adjust tlist, qual, custom_exprs in the standard way */
3823 1746 : 0 : cscan->scan.plan.targetlist =
1856 1747 : 0 : fix_scan_list(root, cscan->scan.plan.targetlist,
1748 : : rtoffset, NUM_EXEC_TLIST((Plan *) cscan));
3823 1749 : 0 : cscan->scan.plan.qual =
1856 1750 : 0 : fix_scan_list(root, cscan->scan.plan.qual,
1751 : : rtoffset, NUM_EXEC_QUAL((Plan *) cscan));
3823 1752 : 0 : cscan->custom_exprs =
1856 1753 : 0 : fix_scan_list(root, cscan->custom_exprs,
1754 : : rtoffset, NUM_EXEC_QUAL((Plan *) cscan));
1755 : : }
1756 : :
1757 : : /* Adjust child plan-nodes recursively, if needed */
3751 1758 [ # # # # : 0 : foreach(lc, cscan->custom_plans)
# # ]
1759 : : {
3776 rhaas@postgresql.org 1760 : 0 : lfirst(lc) = set_plan_refs(root, (Plan *) lfirst(lc), rtoffset);
1761 : : }
1762 : :
2147 tgl@sss.pgh.pa.us 1763 : 0 : cscan->custom_relids = offset_relid_set(cscan->custom_relids, rtoffset);
3823 1764 : 0 : }
1765 : :
1766 : : /*
1767 : : * register_partpruneinfo
1768 : : * Subroutine for set_append_references and set_mergeappend_references
1769 : : *
1770 : : * Add the PartitionPruneInfo from root->partPruneInfos at the given index
1771 : : * into PlannerGlobal->partPruneInfos and return its index there.
1772 : : *
1773 : : * Also update the RT indexes present in PartitionedRelPruneInfos to add the
1774 : : * offset.
1775 : : *
1776 : : * Finally, if there are initial pruning steps, add the RT indexes of the
1777 : : * leaf partitions to the set of relations that are prunable at execution
1778 : : * startup time.
1779 : : */
1780 : : static int
270 amitlan@postgresql.o 1781 :CBC 279 : register_partpruneinfo(PlannerInfo *root, int part_prune_index, int rtoffset)
1782 : : {
1783 : 279 : PlannerGlobal *glob = root->glob;
1784 : : PartitionPruneInfo *pinfo;
1785 : : ListCell *l;
1786 : :
1787 [ + - - + ]: 279 : Assert(part_prune_index >= 0 &&
1788 : : part_prune_index < list_length(root->partPruneInfos));
1789 : 279 : pinfo = list_nth_node(PartitionPruneInfo, root->partPruneInfos,
1790 : : part_prune_index);
1791 : :
1792 : 279 : pinfo->relids = offset_relid_set(pinfo->relids, rtoffset);
1793 [ + - + + : 564 : foreach(l, pinfo->prune_infos)
+ + ]
1794 : : {
1795 : 285 : List *prune_infos = lfirst(l);
1796 : : ListCell *l2;
1797 : :
1798 [ + - + + : 774 : foreach(l2, prune_infos)
+ + ]
1799 : : {
1800 : 489 : PartitionedRelPruneInfo *prelinfo = lfirst(l2);
1801 : : int i;
1802 : :
1803 : 489 : prelinfo->rtindex += rtoffset;
1804 : 489 : prelinfo->initial_pruning_steps =
1805 : 489 : fix_scan_list(root, prelinfo->initial_pruning_steps,
1806 : : rtoffset, 1);
1807 : 489 : prelinfo->exec_pruning_steps =
1808 : 489 : fix_scan_list(root, prelinfo->exec_pruning_steps,
1809 : : rtoffset, 1);
1810 : :
262 1811 [ + + ]: 1936 : for (i = 0; i < prelinfo->nparts; i++)
1812 : : {
1813 : : /*
1814 : : * Non-leaf partitions and partitions that do not have a
1815 : : * subplan are not included in this map as mentioned in
1816 : : * make_partitionedrel_pruneinfo().
1817 : : */
1818 [ + + ]: 1447 : if (prelinfo->leafpart_rti_map[i])
1819 : : {
1820 : 1172 : prelinfo->leafpart_rti_map[i] += rtoffset;
1821 [ + + ]: 1172 : if (prelinfo->initial_pruning_steps)
1822 : 368 : glob->prunableRelids = bms_add_member(glob->prunableRelids,
1823 : 368 : prelinfo->leafpart_rti_map[i]);
1824 : : }
1825 : : }
1826 : : }
1827 : : }
1828 : :
270 1829 : 279 : glob->partPruneInfos = lappend(glob->partPruneInfos, pinfo);
1830 : :
1831 : 279 : return list_length(glob->partPruneInfos) - 1;
1832 : : }
1833 : :
1834 : : /*
1835 : : * set_append_references
1836 : : * Do set_plan_references processing on an Append
1837 : : *
1838 : : * We try to strip out the Append entirely; if we can't, we have
1839 : : * to do the normal processing on it.
1840 : : */
1841 : : static Plan *
2408 tgl@sss.pgh.pa.us 1842 : 12132 : set_append_references(PlannerInfo *root,
1843 : : Append *aplan,
1844 : : int rtoffset)
1845 : : {
1846 : : ListCell *l;
1847 : :
1848 : : /*
1849 : : * Append, like Sort et al, doesn't actually evaluate its targetlist or
1850 : : * check quals. If it's got exactly one child plan, then it's not doing
1851 : : * anything useful at all, and we can strip it out.
1852 : : */
1853 [ - + ]: 12132 : Assert(aplan->plan.qual == NIL);
1854 : :
1855 : : /* First, we gotta recurse on the children */
1856 [ + - + + : 42095 : foreach(l, aplan->appendplans)
+ + ]
1857 : : {
1858 : 29963 : lfirst(l) = set_plan_refs(root, (Plan *) lfirst(l), rtoffset);
1859 : : }
1860 : :
1861 : : /*
1862 : : * See if it's safe to get rid of the Append entirely. For this to be
1863 : : * safe, there must be only one child plan and that child plan's parallel
1864 : : * awareness must match the Append's. The reason for the latter is that
1865 : : * if the Append is parallel aware and the child is not, then the calling
1866 : : * plan may execute the non-parallel aware child multiple times. (If you
1867 : : * change these rules, update create_append_path to match.)
1868 : : */
1196 alvherre@alvh.no-ip. 1869 [ + + ]: 12132 : if (list_length(aplan->appendplans) == 1)
1870 : : {
1871 : 3251 : Plan *p = (Plan *) linitial(aplan->appendplans);
1872 : :
1873 [ + - ]: 3251 : if (p->parallel_aware == aplan->plan.parallel_aware)
1874 : 3251 : return clean_up_removed_plan_level((Plan *) aplan, p);
1875 : : }
1876 : :
1877 : : /*
1878 : : * Otherwise, clean up the Append as needed. It's okay to do this after
1879 : : * recursing to the children, because set_dummy_tlist_references doesn't
1880 : : * look at those.
1881 : : */
2408 tgl@sss.pgh.pa.us 1882 : 8881 : set_dummy_tlist_references((Plan *) aplan, rtoffset);
1883 : :
2147 1884 : 8881 : aplan->apprelids = offset_relid_set(aplan->apprelids, rtoffset);
1885 : :
1886 : : /*
1887 : : * Add PartitionPruneInfo, if any, to PlannerGlobal and update the index.
1888 : : * Also update the RT indexes present in it to add the offset.
1889 : : */
270 amitlan@postgresql.o 1890 [ + + ]: 8881 : if (aplan->part_prune_index >= 0)
1891 : 261 : aplan->part_prune_index =
1892 : 261 : register_partpruneinfo(root, aplan->part_prune_index, rtoffset);
1893 : :
1894 : : /* We don't need to recurse to lefttree or righttree ... */
2408 tgl@sss.pgh.pa.us 1895 [ - + ]: 8881 : Assert(aplan->plan.lefttree == NULL);
1896 [ - + ]: 8881 : Assert(aplan->plan.righttree == NULL);
1897 : :
1898 : 8881 : return (Plan *) aplan;
1899 : : }
1900 : :
1901 : : /*
1902 : : * set_mergeappend_references
1903 : : * Do set_plan_references processing on a MergeAppend
1904 : : *
1905 : : * We try to strip out the MergeAppend entirely; if we can't, we have
1906 : : * to do the normal processing on it.
1907 : : */
1908 : : static Plan *
1909 : 283 : set_mergeappend_references(PlannerInfo *root,
1910 : : MergeAppend *mplan,
1911 : : int rtoffset)
1912 : : {
1913 : : ListCell *l;
1914 : :
1915 : : /*
1916 : : * MergeAppend, like Sort et al, doesn't actually evaluate its targetlist
1917 : : * or check quals. If it's got exactly one child plan, then it's not
1918 : : * doing anything useful at all, and we can strip it out.
1919 : : */
1920 [ - + ]: 283 : Assert(mplan->plan.qual == NIL);
1921 : :
1922 : : /* First, we gotta recurse on the children */
1923 [ + - + + : 1076 : foreach(l, mplan->mergeplans)
+ + ]
1924 : : {
1925 : 793 : lfirst(l) = set_plan_refs(root, (Plan *) lfirst(l), rtoffset);
1926 : : }
1927 : :
1928 : : /*
1929 : : * See if it's safe to get rid of the MergeAppend entirely. For this to
1930 : : * be safe, there must be only one child plan and that child plan's
1931 : : * parallel awareness must match the MergeAppend's. The reason for the
1932 : : * latter is that if the MergeAppend is parallel aware and the child is
1933 : : * not, then the calling plan may execute the non-parallel aware child
1934 : : * multiple times. (If you change these rules, update
1935 : : * create_merge_append_path to match.)
1936 : : */
1196 alvherre@alvh.no-ip. 1937 [ + + ]: 283 : if (list_length(mplan->mergeplans) == 1)
1938 : : {
1939 : 2 : Plan *p = (Plan *) linitial(mplan->mergeplans);
1940 : :
1941 [ + - ]: 2 : if (p->parallel_aware == mplan->plan.parallel_aware)
1942 : 2 : return clean_up_removed_plan_level((Plan *) mplan, p);
1943 : : }
1944 : :
1945 : : /*
1946 : : * Otherwise, clean up the MergeAppend as needed. It's okay to do this
1947 : : * after recursing to the children, because set_dummy_tlist_references
1948 : : * doesn't look at those.
1949 : : */
2408 tgl@sss.pgh.pa.us 1950 : 281 : set_dummy_tlist_references((Plan *) mplan, rtoffset);
1951 : :
2147 1952 : 281 : mplan->apprelids = offset_relid_set(mplan->apprelids, rtoffset);
1953 : :
1954 : : /*
1955 : : * Add PartitionPruneInfo, if any, to PlannerGlobal and update the index.
1956 : : * Also update the RT indexes present in it to add the offset.
1957 : : */
270 amitlan@postgresql.o 1958 [ + + ]: 281 : if (mplan->part_prune_index >= 0)
1959 : 18 : mplan->part_prune_index =
1960 : 18 : register_partpruneinfo(root, mplan->part_prune_index, rtoffset);
1961 : :
1962 : : /* We don't need to recurse to lefttree or righttree ... */
2408 tgl@sss.pgh.pa.us 1963 [ - + ]: 281 : Assert(mplan->plan.lefttree == NULL);
1964 [ - + ]: 281 : Assert(mplan->plan.righttree == NULL);
1965 : :
1966 : 281 : return (Plan *) mplan;
1967 : : }
1968 : :
1969 : : /*
1970 : : * set_hash_references
1971 : : * Do set_plan_references processing on a Hash node
1972 : : */
1973 : : static void
2278 andres@anarazel.de 1974 : 17502 : set_hash_references(PlannerInfo *root, Plan *plan, int rtoffset)
1975 : : {
1976 : 17502 : Hash *hplan = (Hash *) plan;
1977 : 17502 : Plan *outer_plan = plan->lefttree;
1978 : : indexed_tlist *outer_itlist;
1979 : :
1980 : : /*
1981 : : * Hash's hashkeys are used when feeding tuples into the hashtable,
1982 : : * therefore have them reference Hash's outer plan (which itself is the
1983 : : * inner plan of the HashJoin).
1984 : : */
1985 : 17502 : outer_itlist = build_tlist_index(outer_plan->targetlist);
1986 : 17502 : hplan->hashkeys = (List *)
1987 : 17502 : fix_upper_expr(root,
1988 : 17502 : (Node *) hplan->hashkeys,
1989 : : outer_itlist,
1990 : : OUTER_VAR,
1991 : : rtoffset,
1992 : : NRM_EQUAL,
1856 tgl@sss.pgh.pa.us 1993 : 17502 : NUM_EXEC_QUAL(plan));
1994 : :
1995 : : /* Hash doesn't project */
2278 andres@anarazel.de 1996 : 17502 : set_dummy_tlist_references(plan, rtoffset);
1997 : :
1998 : : /* Hash nodes don't have their own quals */
1999 [ - + ]: 17502 : Assert(plan->qual == NIL);
2000 : 17502 : }
2001 : :
2002 : : /*
2003 : : * offset_relid_set
2004 : : * Apply rtoffset to the members of a Relids set.
2005 : : */
2006 : : static Relids
2147 tgl@sss.pgh.pa.us 2007 : 113986 : offset_relid_set(Relids relids, int rtoffset)
2008 : : {
2009 : 113986 : Relids result = NULL;
2010 : : int rtindex;
2011 : :
2012 : : /* If there's no offset to apply, we needn't recompute the value */
2013 [ + + ]: 113986 : if (rtoffset == 0)
2014 : 103809 : return relids;
2015 : 10177 : rtindex = -1;
2016 [ + + ]: 15554 : while ((rtindex = bms_next_member(relids, rtindex)) >= 0)
2017 : 5377 : result = bms_add_member(result, rtindex + rtoffset);
2018 : 10177 : return result;
2019 : : }
2020 : :
2021 : : /*
2022 : : * copyVar
2023 : : * Copy a Var node.
2024 : : *
2025 : : * fix_scan_expr and friends do this enough times that it's worth having
2026 : : * a bespoke routine instead of using the generic copyObject() function.
2027 : : */
2028 : : static inline Var *
6755 2029 : 1045487 : copyVar(Var *var)
2030 : : {
2031 : 1045487 : Var *newvar = (Var *) palloc(sizeof(Var));
2032 : :
2033 : 1045487 : *newvar = *var;
2034 : 1045487 : return newvar;
2035 : : }
2036 : :
2037 : : /*
2038 : : * fix_expr_common
2039 : : * Do generic set_plan_references processing on an expression node
2040 : : *
2041 : : * This is code that is common to all variants of expression-fixing.
2042 : : * We must look up operator opcode info for OpExpr and related nodes,
2043 : : * add OIDs from regclass Const nodes into root->glob->relationOids, and
2044 : : * add PlanInvalItems for user-defined functions into root->glob->invalItems.
2045 : : * We also fill in column index lists for GROUPING() expressions.
2046 : : *
2047 : : * We assume it's okay to update opcode info in-place. So this could possibly
2048 : : * scribble on the planner's input data structures, but it's OK.
2049 : : */
2050 : : static void
5168 2051 : 7088927 : fix_expr_common(PlannerInfo *root, Node *node)
2052 : : {
2053 : : /* We assume callers won't call us on a NULL pointer */
6257 2054 [ + + ]: 7088927 : if (IsA(node, Aggref))
2055 : : {
5168 2056 : 27049 : record_plan_function_dependency(root,
2057 : : ((Aggref *) node)->aggfnoid);
2058 : : }
6147 2059 [ + + ]: 7061878 : else if (IsA(node, WindowFunc))
2060 : : {
5168 2061 : 1939 : record_plan_function_dependency(root,
2062 : : ((WindowFunc *) node)->winfnoid);
2063 : : }
6257 2064 [ + + ]: 7059939 : else if (IsA(node, FuncExpr))
2065 : : {
5168 2066 : 148623 : record_plan_function_dependency(root,
2067 : : ((FuncExpr *) node)->funcid);
2068 : : }
6257 2069 [ + + ]: 6911316 : else if (IsA(node, OpExpr))
2070 : : {
2071 : 429115 : set_opfuncid((OpExpr *) node);
5168 2072 : 429115 : record_plan_function_dependency(root,
2073 : : ((OpExpr *) node)->opfuncid);
2074 : : }
6257 2075 [ + + ]: 6482201 : else if (IsA(node, DistinctExpr))
2076 : : {
2077 : 545 : set_opfuncid((OpExpr *) node); /* rely on struct equivalence */
5168 2078 : 545 : record_plan_function_dependency(root,
2079 : : ((DistinctExpr *) node)->opfuncid);
2080 : : }
6257 2081 [ + + ]: 6481656 : else if (IsA(node, NullIfExpr))
2082 : : {
2083 : 64 : set_opfuncid((OpExpr *) node); /* rely on struct equivalence */
5168 2084 : 64 : record_plan_function_dependency(root,
2085 : : ((NullIfExpr *) node)->opfuncid);
2086 : : }
6257 2087 [ + + ]: 6481592 : else if (IsA(node, ScalarArrayOpExpr))
2088 : : {
1663 drowley@postgresql.o 2089 : 18984 : ScalarArrayOpExpr *saop = (ScalarArrayOpExpr *) node;
2090 : :
2091 : 18984 : set_sa_opfuncid(saop);
2092 : 18984 : record_plan_function_dependency(root, saop->opfuncid);
2093 : :
774 2094 [ + + ]: 18984 : if (OidIsValid(saop->hashfuncid))
1663 2095 : 330 : record_plan_function_dependency(root, saop->hashfuncid);
2096 : :
774 2097 [ + + ]: 18984 : if (OidIsValid(saop->negfuncid))
1573 2098 : 35 : record_plan_function_dependency(root, saop->negfuncid);
2099 : : }
6257 tgl@sss.pgh.pa.us 2100 [ + + ]: 6462608 : else if (IsA(node, Const))
2101 : : {
2102 : 693958 : Const *con = (Const *) node;
2103 : :
2104 : : /* Check for regclass reference */
2105 [ + + + + : 693958 : if (ISREGCLASSCONST(con))
+ + ]
5168 2106 : 134811 : root->glob->relationOids =
2107 : 134811 : lappend_oid(root->glob->relationOids,
2108 : : DatumGetObjectId(con->constvalue));
2109 : : }
3817 andres@anarazel.de 2110 [ + + ]: 5768650 : else if (IsA(node, GroupingFunc))
2111 : : {
2112 : 175 : GroupingFunc *g = (GroupingFunc *) node;
2113 : 175 : AttrNumber *grouping_map = root->grouping_map;
2114 : :
2115 : : /* If there are no grouping sets, we don't need this. */
2116 : :
2117 [ + + - + ]: 175 : Assert(grouping_map || g->cols == NIL);
2118 : :
2119 [ + + ]: 175 : if (grouping_map)
2120 : : {
2121 : : ListCell *lc;
2122 : 130 : List *cols = NIL;
2123 : :
2124 [ + - + + : 342 : foreach(lc, g->refs)
+ + ]
2125 : : {
2126 : 212 : cols = lappend_int(cols, grouping_map[lfirst_int(lc)]);
2127 : : }
2128 : :
2129 [ - + - - ]: 130 : Assert(!g->cols || equal(cols, g->cols));
2130 : :
2131 [ + - ]: 130 : if (!g->cols)
2132 : 130 : g->cols = cols;
2133 : : }
2134 : : }
6257 tgl@sss.pgh.pa.us 2135 : 7088927 : }
2136 : :
2137 : : /*
2138 : : * fix_param_node
2139 : : * Do set_plan_references processing on a Param
2140 : : *
2141 : : * If it's a PARAM_MULTIEXPR, replace it with the appropriate Param from
2142 : : * root->multiexpr_params; otherwise no change is needed.
2143 : : * Just for paranoia's sake, we make a copy of the node in either case.
2144 : : */
2145 : : static Node *
4149 2146 : 54117 : fix_param_node(PlannerInfo *root, Param *p)
2147 : : {
2148 [ + + ]: 54117 : if (p->paramkind == PARAM_MULTIEXPR)
2149 : : {
2150 : 143 : int subqueryid = p->paramid >> 16;
2151 : 143 : int colno = p->paramid & 0xFFFF;
2152 : : List *params;
2153 : :
2154 [ + - - + ]: 286 : if (subqueryid <= 0 ||
2155 : 143 : subqueryid > list_length(root->multiexpr_params))
4149 tgl@sss.pgh.pa.us 2156 [ # # ]:UBC 0 : elog(ERROR, "unexpected PARAM_MULTIEXPR ID: %d", p->paramid);
4149 tgl@sss.pgh.pa.us 2157 :CBC 143 : params = (List *) list_nth(root->multiexpr_params, subqueryid - 1);
2158 [ + - - + ]: 143 : if (colno <= 0 || colno > list_length(params))
4149 tgl@sss.pgh.pa.us 2159 [ # # ]:UBC 0 : elog(ERROR, "unexpected PARAM_MULTIEXPR ID: %d", p->paramid);
4149 tgl@sss.pgh.pa.us 2160 :CBC 143 : return copyObject(list_nth(params, colno - 1));
2161 : : }
3154 peter_e@gmx.net 2162 : 53974 : return (Node *) copyObject(p);
2163 : : }
2164 : :
2165 : : /*
2166 : : * fix_alternative_subplan
2167 : : * Do set_plan_references processing on an AlternativeSubPlan
2168 : : *
2169 : : * Choose one of the alternative implementations and return just that one,
2170 : : * discarding the rest of the AlternativeSubPlan structure.
2171 : : * Note: caller must still recurse into the result!
2172 : : *
2173 : : * We don't make any attempt to fix up cost estimates in the parent plan
2174 : : * node or higher-level nodes.
2175 : : */
2176 : : static Node *
1856 tgl@sss.pgh.pa.us 2177 : 912 : fix_alternative_subplan(PlannerInfo *root, AlternativeSubPlan *asplan,
2178 : : double num_exec)
2179 : : {
2180 : 912 : SubPlan *bestplan = NULL;
2181 : 912 : Cost bestcost = 0;
2182 : : ListCell *lc;
2183 : :
2184 : : /*
2185 : : * Compute the estimated cost of each subplan assuming num_exec
2186 : : * executions, and keep the cheapest one. In event of exact equality of
2187 : : * estimates, we prefer the later plan; this is a bit arbitrary, but in
2188 : : * current usage it biases us to break ties against fast-start subplans.
2189 : : */
2190 [ - + ]: 912 : Assert(asplan->subplans != NIL);
2191 : :
2192 [ + - + + : 2736 : foreach(lc, asplan->subplans)
+ + ]
2193 : : {
2194 : 1824 : SubPlan *curplan = (SubPlan *) lfirst(lc);
2195 : : Cost curcost;
2196 : :
2197 : 1824 : curcost = curplan->startup_cost + num_exec * curplan->per_call_cost;
1504 2198 [ + + + + ]: 1824 : if (bestplan == NULL || curcost <= bestcost)
2199 : : {
1856 2200 : 1284 : bestplan = curplan;
2201 : 1284 : bestcost = curcost;
2202 : : }
2203 : :
2204 : : /* Also mark all subplans that are in AlternativeSubPlans */
1504 2205 : 1824 : root->isAltSubplan[curplan->plan_id - 1] = true;
2206 : : }
2207 : :
2208 : : /* Mark the subplan we selected */
2209 : 912 : root->isUsedSubplan[bestplan->plan_id - 1] = true;
2210 : :
1856 2211 : 912 : return (Node *) bestplan;
2212 : : }
2213 : :
2214 : : /*
2215 : : * fix_scan_expr
2216 : : * Do set_plan_references processing on a scan-level expression
2217 : : *
2218 : : * This consists of incrementing all Vars' varnos by rtoffset,
2219 : : * replacing PARAM_MULTIEXPR Params, expanding PlaceHolderVars,
2220 : : * replacing Aggref nodes that should be replaced by initplan output Params,
2221 : : * choosing the best implementation for AlternativeSubPlans,
2222 : : * looking up operator opcode info for OpExpr and related nodes,
2223 : : * and adding OIDs from regclass Const nodes into root->glob->relationOids.
2224 : : *
2225 : : * 'node': the expression to be modified
2226 : : * 'rtoffset': how much to increment varnos by
2227 : : * 'num_exec': estimated number of executions of expression
2228 : : *
2229 : : * The expression tree is either copied-and-modified, or modified in-place
2230 : : * if that seems safe.
2231 : : */
2232 : : static Node *
2233 : 1195897 : fix_scan_expr(PlannerInfo *root, Node *node, int rtoffset, double num_exec)
2234 : : {
2235 : : fix_scan_expr_context context;
2236 : :
5168 2237 : 1195897 : context.root = root;
6822 2238 : 1195897 : context.rtoffset = rtoffset;
1856 2239 : 1195897 : context.num_exec = num_exec;
2240 : :
4149 2241 [ + + ]: 1195897 : if (rtoffset != 0 ||
2242 [ + + ]: 996463 : root->multiexpr_params != NIL ||
3521 2243 [ + + ]: 996172 : root->glob->lastPHId != 0 ||
1856 2244 [ + + ]: 990854 : root->minmax_aggs != NIL ||
2245 [ + + ]: 990467 : root->hasAlternativeSubPlans)
2246 : : {
6547 2247 : 212131 : return fix_scan_expr_mutator(node, &context);
2248 : : }
2249 : : else
2250 : : {
2251 : : /*
2252 : : * If rtoffset == 0, we don't need to change any Vars, and if there
2253 : : * are no MULTIEXPR subqueries then we don't need to replace
2254 : : * PARAM_MULTIEXPR Params, and if there are no placeholders anywhere
2255 : : * we won't need to remove them, and if there are no minmax Aggrefs we
2256 : : * won't need to replace them, and if there are no AlternativeSubPlans
2257 : : * we won't need to remove them. Then it's OK to just scribble on the
2258 : : * input node tree instead of copying (since the only change, filling
2259 : : * in any unset opfuncid fields, is harmless). This saves just enough
2260 : : * cycles to be noticeable on trivial queries.
2261 : : */
2262 : 983766 : (void) fix_scan_expr_walker(node, &context);
2263 : 983766 : return node;
2264 : : }
2265 : : }
2266 : :
2267 : : static Node *
6556 bruce@momjian.us 2268 : 1329111 : fix_scan_expr_mutator(Node *node, fix_scan_expr_context *context)
2269 : : {
7463 tgl@sss.pgh.pa.us 2270 [ + + ]: 1329111 : if (node == NULL)
6822 2271 : 83678 : return NULL;
7463 2272 [ + + ]: 1245433 : if (IsA(node, Var))
2273 : : {
6755 2274 : 436490 : Var *var = copyVar((Var *) node);
2275 : :
7463 2276 [ - + ]: 436490 : Assert(var->varlevelsup == 0);
2277 : :
2278 : : /*
2279 : : * We should not see Vars marked INNER_VAR, OUTER_VAR, or ROWID_VAR.
2280 : : * But an indexqual expression could contain INDEX_VAR Vars.
2281 : : */
5130 2282 [ - + ]: 436490 : Assert(var->varno != INNER_VAR);
2283 [ - + ]: 436490 : Assert(var->varno != OUTER_VAR);
1671 2284 [ - + ]: 436490 : Assert(var->varno != ROWID_VAR);
5130 2285 [ + + ]: 436490 : if (!IS_SPECIAL_VARNO(var->varno))
2286 : 412617 : var->varno += context->rtoffset;
2118 2287 [ + + ]: 436490 : if (var->varnosyn > 0)
2288 : 436022 : var->varnosyn += context->rtoffset;
6822 2289 : 436490 : return (Node *) var;
2290 : : }
4149 2291 [ + + ]: 808943 : if (IsA(node, Param))
2292 : 46434 : return fix_param_node(context->root, (Param *) node);
3521 2293 [ + + ]: 762509 : if (IsA(node, Aggref))
2294 : : {
2295 : 221 : Aggref *aggref = (Aggref *) node;
2296 : : Param *aggparam;
2297 : :
2298 : : /* See if the Aggref should be replaced by a Param */
837 2299 : 221 : aggparam = find_minmax_agg_replacement_param(context->root, aggref);
2300 [ + + ]: 221 : if (aggparam != NULL)
2301 : : {
2302 : : /* Make a copy of the Param for paranoia's sake */
2303 : 206 : return (Node *) copyObject(aggparam);
2304 : : }
2305 : : /* If no match, just fall through to process it normally */
2306 : : }
6713 2307 [ - + ]: 762303 : if (IsA(node, CurrentOfExpr))
2308 : : {
6713 tgl@sss.pgh.pa.us 2309 :UBC 0 : CurrentOfExpr *cexpr = (CurrentOfExpr *) copyObject(node);
2310 : :
1503 2311 [ # # ]: 0 : Assert(!IS_SPECIAL_VARNO(cexpr->cvarno));
2312 : 0 : cexpr->cvarno += context->rtoffset;
6713 2313 : 0 : return (Node *) cexpr;
2314 : : }
6215 tgl@sss.pgh.pa.us 2315 [ + + ]:CBC 762303 : if (IsA(node, PlaceHolderVar))
2316 : : {
2317 : : /* At scan level, we should always just evaluate the contained expr */
2318 : 1233 : PlaceHolderVar *phv = (PlaceHolderVar *) node;
2319 : :
2320 : : /* XXX can we assert something about phnullingrels? */
2321 : 1233 : return fix_scan_expr_mutator((Node *) phv->phexpr, context);
2322 : : }
1856 2323 [ + + ]: 761070 : if (IsA(node, AlternativeSubPlan))
2324 : 147 : return fix_scan_expr_mutator(fix_alternative_subplan(context->root,
2325 : : (AlternativeSubPlan *) node,
2326 : : context->num_exec),
2327 : : context);
5168 2328 : 760923 : fix_expr_common(context->root, node);
333 peter@eisentraut.org 2329 : 760923 : return expression_tree_mutator(node, fix_scan_expr_mutator, context);
2330 : : }
2331 : :
2332 : : static bool
6547 tgl@sss.pgh.pa.us 2333 : 5337867 : fix_scan_expr_walker(Node *node, fix_scan_expr_context *context)
2334 : : {
2335 [ + + ]: 5337867 : if (node == NULL)
2336 : 499278 : return false;
1671 2337 [ + + - + ]: 4838589 : Assert(!(IsA(node, Var) && ((Var *) node)->varno == ROWID_VAR));
6215 2338 [ - + ]: 4838589 : Assert(!IsA(node, PlaceHolderVar));
1856 2339 [ - + ]: 4838589 : Assert(!IsA(node, AlternativeSubPlan));
5168 2340 : 4838589 : fix_expr_common(context->root, node);
333 peter@eisentraut.org 2341 : 4838589 : return expression_tree_walker(node, fix_scan_expr_walker, context);
2342 : : }
2343 : :
2344 : : /*
2345 : : * set_join_references
2346 : : * Modify the target list and quals of a join node to reference its
2347 : : * subplans, by setting the varnos to OUTER_VAR or INNER_VAR and setting
2348 : : * attno values to the result domain number of either the corresponding
2349 : : * outer or inner join tuple item. Also perform opcode lookup for these
2350 : : * expressions, and add regclass OIDs to root->glob->relationOids.
2351 : : */
2352 : : static void
5168 tgl@sss.pgh.pa.us 2353 : 70240 : set_join_references(PlannerInfo *root, Join *join, int rtoffset)
2354 : : {
8321 2355 : 70240 : Plan *outer_plan = join->plan.lefttree;
2356 : 70240 : Plan *inner_plan = join->plan.righttree;
2357 : : indexed_tlist *outer_itlist;
2358 : : indexed_tlist *inner_itlist;
2359 : :
7444 2360 : 70240 : outer_itlist = build_tlist_index(outer_plan->targetlist);
2361 : 70240 : inner_itlist = build_tlist_index(inner_plan->targetlist);
2362 : :
2363 : : /*
2364 : : * First process the joinquals (including merge or hash clauses). These
2365 : : * are logically below the join so they can always use all values
2366 : : * available from the input tlists. It's okay to also handle
2367 : : * NestLoopParams now, because those couldn't refer to nullable
2368 : : * subexpressions.
2369 : : */
5168 2370 : 140480 : join->joinqual = fix_join_expr(root,
2371 : : join->joinqual,
2372 : : outer_itlist,
2373 : : inner_itlist,
2374 : : (Index) 0,
2375 : : rtoffset,
2376 : : NRM_EQUAL,
1856 2377 : 70240 : NUM_EXEC_QUAL((Plan *) join));
2378 : :
2379 : : /* Now do join-type-specific stuff */
8321 2380 [ + + ]: 70240 : if (IsA(join, NestLoop))
2381 : : {
5586 2382 : 48940 : NestLoop *nl = (NestLoop *) join;
2383 : : ListCell *lc;
2384 : :
2385 [ + + + + : 76715 : foreach(lc, nl->nestParams)
+ + ]
2386 : : {
2387 : 27775 : NestLoopParam *nlp = (NestLoopParam *) lfirst(lc);
2388 : :
2389 : : /*
2390 : : * Because we don't reparameterize parameterized paths to match
2391 : : * the outer-join level at which they are used, Vars seen in the
2392 : : * NestLoopParam expression may have nullingrels that are just a
2393 : : * subset of those in the Vars actually available from the outer
2394 : : * side. (Lateral references can also cause this, as explained in
2395 : : * the comments for identify_current_nestloop_params.) Not
2396 : : * checking this exactly is a bit grotty, but the work needed to
2397 : : * make things match up perfectly seems well out of proportion to
2398 : : * the value.
2399 : : */
5168 2400 : 55550 : nlp->paramval = (Var *) fix_upper_expr(root,
5586 2401 : 27775 : (Node *) nlp->paramval,
2402 : : outer_itlist,
2403 : : OUTER_VAR,
2404 : : rtoffset,
2405 : : NRM_SUBSET,
2406 : : NUM_EXEC_TLIST(outer_plan));
2407 : : /* Check we replaced any PlaceHolderVar with simple Var */
5107 2408 [ + - ]: 27775 : if (!(IsA(nlp->paramval, Var) &&
2409 [ - + ]: 27775 : nlp->paramval->varno == OUTER_VAR))
5107 tgl@sss.pgh.pa.us 2410 [ # # ]:UBC 0 : elog(ERROR, "NestLoopParam was not reduced to a simple Var");
2411 : : }
2412 : : }
8321 tgl@sss.pgh.pa.us 2413 [ + + ]:CBC 21300 : else if (IsA(join, MergeJoin))
2414 : : {
2415 : 3798 : MergeJoin *mj = (MergeJoin *) join;
2416 : :
5168 2417 : 3798 : mj->mergeclauses = fix_join_expr(root,
2418 : : mj->mergeclauses,
2419 : : outer_itlist,
2420 : : inner_itlist,
2421 : : (Index) 0,
2422 : : rtoffset,
2423 : : NRM_EQUAL,
1856 2424 : 3798 : NUM_EXEC_QUAL((Plan *) join));
2425 : : }
8321 2426 [ + - ]: 17502 : else if (IsA(join, HashJoin))
2427 : : {
2428 : 17502 : HashJoin *hj = (HashJoin *) join;
2429 : :
5168 2430 : 35004 : hj->hashclauses = fix_join_expr(root,
2431 : : hj->hashclauses,
2432 : : outer_itlist,
2433 : : inner_itlist,
2434 : : (Index) 0,
2435 : : rtoffset,
2436 : : NRM_EQUAL,
1856 2437 : 17502 : NUM_EXEC_QUAL((Plan *) join));
2438 : :
2439 : : /*
2440 : : * HashJoin's hashkeys are used to look for matching tuples from its
2441 : : * outer plan (not the Hash node!) in the hashtable.
2442 : : */
2278 andres@anarazel.de 2443 : 17502 : hj->hashkeys = (List *) fix_upper_expr(root,
2444 : 17502 : (Node *) hj->hashkeys,
2445 : : outer_itlist,
2446 : : OUTER_VAR,
2447 : : rtoffset,
2448 : : NRM_EQUAL,
1856 tgl@sss.pgh.pa.us 2449 : 17502 : NUM_EXEC_QUAL((Plan *) join));
2450 : : }
2451 : :
2452 : : /*
2453 : : * Now we need to fix up the targetlist and qpqual, which are logically
2454 : : * above the join. This means that, if it's not an inner join, any Vars
2455 : : * and PHVs appearing here should have nullingrels that include the
2456 : : * effects of the outer join, ie they will have nullingrels equal to the
2457 : : * input Vars' nullingrels plus the bit added by the outer join. We don't
2458 : : * currently have enough info available here to identify what that should
2459 : : * be, so we just tell fix_join_expr to accept superset nullingrels
2460 : : * matches instead of exact ones.
2461 : : */
3859 2462 : 70240 : join->plan.targetlist = fix_join_expr(root,
2463 : : join->plan.targetlist,
2464 : : outer_itlist,
2465 : : inner_itlist,
2466 : : (Index) 0,
2467 : : rtoffset,
1001 2468 [ + + ]: 70240 : (join->jointype == JOIN_INNER ? NRM_EQUAL : NRM_SUPERSET),
2469 : : NUM_EXEC_TLIST((Plan *) join));
3859 2470 : 70240 : join->plan.qual = fix_join_expr(root,
2471 : : join->plan.qual,
2472 : : outer_itlist,
2473 : : inner_itlist,
2474 : : (Index) 0,
2475 : : rtoffset,
1001 2476 : 70240 : (join->jointype == JOIN_INNER ? NRM_EQUAL : NRM_SUPERSET),
1856 2477 [ + + ]: 70240 : NUM_EXEC_QUAL((Plan *) join));
2478 : :
7444 2479 : 70240 : pfree(outer_itlist);
2480 : 70240 : pfree(inner_itlist);
10702 scrappy@hub.org 2481 : 70240 : }
2482 : :
2483 : : /*
2484 : : * set_upper_references
2485 : : * Update the targetlist and quals of an upper-level plan node
2486 : : * to refer to the tuples returned by its lefttree subplan.
2487 : : * Also perform opcode lookup for these expressions, and
2488 : : * add regclass OIDs to root->glob->relationOids.
2489 : : *
2490 : : * This is used for single-input plan types like Agg, Group, Result.
2491 : : *
2492 : : * In most cases, we have to match up individual Vars in the tlist and
2493 : : * qual expressions with elements of the subplan's tlist (which was
2494 : : * generated by flattening these selfsame expressions, so it should have all
2495 : : * the required variables). There is an important exception, however:
2496 : : * depending on where we are in the plan tree, sort/group columns may have
2497 : : * been pushed into the subplan tlist unflattened. If these values are also
2498 : : * needed in the output then we want to reference the subplan tlist element
2499 : : * rather than recomputing the expression.
2500 : : */
2501 : : static void
5168 tgl@sss.pgh.pa.us 2502 : 34403 : set_upper_references(PlannerInfo *root, Plan *plan, int rtoffset)
2503 : : {
9563 2504 : 34403 : Plan *subplan = plan->lefttree;
2505 : : indexed_tlist *subplan_itlist;
2506 : : List *output_targetlist;
2507 : : ListCell *l;
2508 : :
6821 2509 : 34403 : subplan_itlist = build_tlist_index(subplan->targetlist);
2510 : :
2511 : : /*
2512 : : * If it's a grouping node with grouping sets, any Vars and PHVs appearing
2513 : : * in the targetlist and quals should have nullingrels that include the
2514 : : * effects of the grouping step, ie they will have nullingrels equal to
2515 : : * the input Vars/PHVs' nullingrels plus the RT index of the grouping
2516 : : * step. In order to perform exact nullingrels matches, we remove the RT
2517 : : * index of the grouping step first.
2518 : : */
412 rguo@postgresql.org 2519 [ + + ]: 34403 : if (IsA(plan, Agg) &&
2520 [ + + ]: 20459 : root->group_rtindex > 0 &&
2521 [ + + ]: 3274 : ((Agg *) plan)->groupingSets)
2522 : : {
2523 : 430 : plan->targetlist = (List *)
2524 : 430 : remove_nulling_relids((Node *) plan->targetlist,
2525 : 430 : bms_make_singleton(root->group_rtindex),
2526 : : NULL);
2527 : 430 : plan->qual = (List *)
2528 : 430 : remove_nulling_relids((Node *) plan->qual,
2529 : 430 : bms_make_singleton(root->group_rtindex),
2530 : : NULL);
2531 : : }
2532 : :
8763 tgl@sss.pgh.pa.us 2533 : 34403 : output_targetlist = NIL;
2534 [ + + + + : 93449 : foreach(l, plan->targetlist)
+ + ]
2535 : : {
2536 : 59046 : TargetEntry *tle = (TargetEntry *) lfirst(l);
2537 : : Node *newexpr;
2538 : :
2539 : : /* If it's a sort/group item, first try to match by sortref */
2923 2540 [ + + ]: 59046 : if (tle->ressortgroupref != 0)
2541 : : {
2542 : : newexpr = (Node *)
3154 peter_e@gmx.net 2543 : 19356 : search_indexed_tlist_for_sortgroupref(tle->expr,
2544 : : tle->ressortgroupref,
2545 : : subplan_itlist,
2546 : : OUTER_VAR);
5824 tgl@sss.pgh.pa.us 2547 [ + + ]: 19356 : if (!newexpr)
5168 2548 : 10800 : newexpr = fix_upper_expr(root,
5824 2549 : 10800 : (Node *) tle->expr,
2550 : : subplan_itlist,
2551 : : OUTER_VAR,
2552 : : rtoffset,
2553 : : NRM_EQUAL,
2554 : : NUM_EXEC_TLIST(plan));
2555 : : }
2556 : : else
5168 2557 : 39690 : newexpr = fix_upper_expr(root,
5824 2558 : 39690 : (Node *) tle->expr,
2559 : : subplan_itlist,
2560 : : OUTER_VAR,
2561 : : rtoffset,
2562 : : NRM_EQUAL,
2563 : : NUM_EXEC_TLIST(plan));
7509 2564 : 59046 : tle = flatCopyTargetEntry(tle);
2565 : 59046 : tle->expr = (Expr *) newexpr;
2566 : 59046 : output_targetlist = lappend(output_targetlist, tle);
2567 : : }
8763 2568 : 34403 : plan->targetlist = output_targetlist;
2569 : :
9563 2570 : 34403 : plan->qual = (List *)
5168 2571 : 34403 : fix_upper_expr(root,
6591 2572 : 34403 : (Node *) plan->qual,
2573 : : subplan_itlist,
2574 : : OUTER_VAR,
2575 : : rtoffset,
2576 : : NRM_EQUAL,
1856 2577 : 34403 : NUM_EXEC_QUAL(plan));
2578 : :
7444 2579 : 34403 : pfree(subplan_itlist);
10702 scrappy@hub.org 2580 : 34403 : }
2581 : :
2582 : : /*
2583 : : * set_param_references
2584 : : * Initialize the initParam list in Gather or Gather merge node such that
2585 : : * it contains reference of all the params that needs to be evaluated
2586 : : * before execution of the node. It contains the initplan params that are
2587 : : * being passed to the plan nodes below it.
2588 : : */
2589 : : static void
2902 rhaas@postgresql.org 2590 : 717 : set_param_references(PlannerInfo *root, Plan *plan)
2591 : : {
1990 tgl@sss.pgh.pa.us 2592 [ + + - + ]: 717 : Assert(IsA(plan, Gather) || IsA(plan, GatherMerge));
2593 : :
2902 rhaas@postgresql.org 2594 [ + + ]: 717 : if (plan->lefttree->extParam)
2595 : : {
2596 : : PlannerInfo *proot;
2597 : 653 : Bitmapset *initSetParam = NULL;
2598 : : ListCell *l;
2599 : :
2600 [ + + ]: 1393 : for (proot = root; proot != NULL; proot = proot->parent_root)
2601 : : {
2602 [ + + + + : 779 : foreach(l, proot->init_plans)
+ + ]
2603 : : {
2604 : 39 : SubPlan *initsubplan = (SubPlan *) lfirst(l);
2605 : : ListCell *l2;
2606 : :
2607 [ + - + + : 78 : foreach(l2, initsubplan->setParam)
+ + ]
2608 : : {
2609 : 39 : initSetParam = bms_add_member(initSetParam, lfirst_int(l2));
2610 : : }
2611 : : }
2612 : : }
2613 : :
2614 : : /*
2615 : : * Remember the list of all external initplan params that are used by
2616 : : * the children of Gather or Gather merge node.
2617 : : */
2618 [ + + ]: 653 : if (IsA(plan, Gather))
2619 : 476 : ((Gather *) plan)->initParam =
2620 : 476 : bms_intersect(plan->lefttree->extParam, initSetParam);
2621 : : else
2622 : 177 : ((GatherMerge *) plan)->initParam =
2623 : 177 : bms_intersect(plan->lefttree->extParam, initSetParam);
2624 : : }
2625 : 717 : }
2626 : :
2627 : : /*
2628 : : * Recursively scan an expression tree and convert Aggrefs to the proper
2629 : : * intermediate form for combining aggregates. This means (1) replacing each
2630 : : * one's argument list with a single argument that is the original Aggref
2631 : : * modified to show partial aggregation and (2) changing the upper Aggref to
2632 : : * show combining aggregation.
2633 : : *
2634 : : * After this step, set_upper_references will replace the partial Aggrefs
2635 : : * with Vars referencing the lower Agg plan node's outputs, so that the final
2636 : : * form seen by the executor is a combining Aggref with a Var as input.
2637 : : *
2638 : : * It's rather messy to postpone this step until setrefs.c; ideally it'd be
2639 : : * done in createplan.c. The difficulty is that once we modify the Aggref
2640 : : * expressions, they will no longer be equal() to their original form and
2641 : : * so cross-plan-node-level matches will fail. So this has to happen after
2642 : : * the plan node above the Agg has resolved its subplan references.
2643 : : */
2644 : : static Node *
3410 tgl@sss.pgh.pa.us 2645 : 4995 : convert_combining_aggrefs(Node *node, void *context)
2646 : : {
2647 [ + + ]: 4995 : if (node == NULL)
2648 : 585 : return NULL;
2649 [ + + ]: 4410 : if (IsA(node, Aggref))
2650 : : {
2651 : 1126 : Aggref *orig_agg = (Aggref *) node;
2652 : : Aggref *child_agg;
2653 : : Aggref *parent_agg;
2654 : :
2655 : : /* Assert we've not chosen to partial-ize any unsupported cases */
3383 2656 [ - + ]: 1126 : Assert(orig_agg->aggorder == NIL);
2657 [ - + ]: 1126 : Assert(orig_agg->aggdistinct == NIL);
2658 : :
2659 : : /*
2660 : : * Since aggregate calls can't be nested, we needn't recurse into the
2661 : : * arguments. But for safety, flat-copy the Aggref node itself rather
2662 : : * than modifying it in-place.
2663 : : */
3410 2664 : 1126 : child_agg = makeNode(Aggref);
2665 : 1126 : memcpy(child_agg, orig_agg, sizeof(Aggref));
2666 : :
2667 : : /*
2668 : : * For the parent Aggref, we want to copy all the fields of the
2669 : : * original aggregate *except* the args list, which we'll replace
2670 : : * below, and the aggfilter expression, which should be applied only
2671 : : * by the child not the parent. Rather than explicitly knowing about
2672 : : * all the other fields here, we can momentarily modify child_agg to
2673 : : * provide a suitable source for copyObject.
2674 : : */
2675 : 1126 : child_agg->args = NIL;
3383 2676 : 1126 : child_agg->aggfilter = NULL;
3154 peter_e@gmx.net 2677 : 1126 : parent_agg = copyObject(child_agg);
3410 tgl@sss.pgh.pa.us 2678 : 1126 : child_agg->args = orig_agg->args;
3383 2679 : 1126 : child_agg->aggfilter = orig_agg->aggfilter;
2680 : :
2681 : : /*
2682 : : * Now, set up child_agg to represent the first phase of partial
2683 : : * aggregation. For now, assume serialization is required.
2684 : : */
3410 2685 : 1126 : mark_partial_aggref(child_agg, AGGSPLIT_INITIAL_SERIAL);
2686 : :
2687 : : /*
2688 : : * And set up parent_agg to represent the second phase.
2689 : : */
2690 : 1126 : parent_agg->args = list_make1(makeTargetEntry((Expr *) child_agg,
2691 : : 1, NULL, false));
2692 : 1126 : mark_partial_aggref(parent_agg, AGGSPLIT_FINAL_DESERIAL);
2693 : :
2694 : 1126 : return (Node *) parent_agg;
2695 : : }
333 peter@eisentraut.org 2696 : 3284 : return expression_tree_mutator(node, convert_combining_aggrefs, context);
2697 : : }
2698 : :
2699 : : /*
2700 : : * set_dummy_tlist_references
2701 : : * Replace the targetlist of an upper-level plan node with a simple
2702 : : * list of OUTER_VAR references to its child.
2703 : : *
2704 : : * This is used for plan types like Sort and Append that don't evaluate
2705 : : * their targetlists. Although the executor doesn't care at all what's in
2706 : : * the tlist, EXPLAIN needs it to be realistic.
2707 : : *
2708 : : * Note: we could almost use set_upper_references() here, but it fails for
2709 : : * Append for lack of a lefttree subplan. Single-purpose code is faster
2710 : : * anyway.
2711 : : */
2712 : : static void
6821 tgl@sss.pgh.pa.us 2713 : 79632 : set_dummy_tlist_references(Plan *plan, int rtoffset)
2714 : : {
2715 : : List *output_targetlist;
2716 : : ListCell *l;
2717 : :
2718 : 79632 : output_targetlist = NIL;
2719 [ + + + + : 352225 : foreach(l, plan->targetlist)
+ + ]
2720 : : {
2721 : 272593 : TargetEntry *tle = (TargetEntry *) lfirst(l);
2722 : 272593 : Var *oldvar = (Var *) tle->expr;
2723 : : Var *newvar;
2724 : :
2725 : : /*
2726 : : * As in search_indexed_tlist_for_non_var(), we prefer to keep Consts
2727 : : * as Consts, not Vars referencing Consts. Here, there's no speed
2728 : : * advantage to be had, but it makes EXPLAIN output look cleaner, and
2729 : : * again it avoids confusing the executor.
2730 : : */
3281 2731 [ + + ]: 272593 : if (IsA(oldvar, Const))
2732 : : {
2733 : : /* just reuse the existing TLE node */
2734 : 5585 : output_targetlist = lappend(output_targetlist, tle);
2735 : 5585 : continue;
2736 : : }
2737 : :
5130 2738 : 267008 : newvar = makeVar(OUTER_VAR,
6821 2739 : 267008 : tle->resno,
2740 : : exprType((Node *) oldvar),
2741 : : exprTypmod((Node *) oldvar),
2742 : : exprCollation((Node *) oldvar),
2743 : : 0);
2118 2744 [ + + ]: 267008 : if (IsA(oldvar, Var) &&
2745 [ + + ]: 212635 : oldvar->varnosyn > 0)
2746 : : {
2747 : 192600 : newvar->varnosyn = oldvar->varnosyn + rtoffset;
2748 : 192600 : newvar->varattnosyn = oldvar->varattnosyn;
2749 : : }
2750 : : else
2751 : : {
2752 : 74408 : newvar->varnosyn = 0; /* wasn't ever a plain Var */
2753 : 74408 : newvar->varattnosyn = 0;
2754 : : }
2755 : :
6821 2756 : 267008 : tle = flatCopyTargetEntry(tle);
2757 : 267008 : tle->expr = (Expr *) newvar;
2758 : 267008 : output_targetlist = lappend(output_targetlist, tle);
2759 : : }
2760 : 79632 : plan->targetlist = output_targetlist;
2761 : :
2762 : : /* We don't touch plan->qual here */
2763 : 79632 : }
2764 : :
2765 : :
2766 : : /*
2767 : : * build_tlist_index --- build an index data structure for a child tlist
2768 : : *
2769 : : * In most cases, subplan tlists will be "flat" tlists with only Vars,
2770 : : * so we try to optimize that case by extracting information about Vars
2771 : : * in advance. Matching a parent tlist to a child is still an O(N^2)
2772 : : * operation, but at least with a much smaller constant factor than plain
2773 : : * tlist_member() searches.
2774 : : *
2775 : : * The result of this function is an indexed_tlist struct to pass to
2776 : : * search_indexed_tlist_for_var() and siblings.
2777 : : * When done, the indexed_tlist may be freed with a single pfree().
2778 : : */
2779 : : static indexed_tlist *
7444 2780 : 203801 : build_tlist_index(List *tlist)
2781 : : {
2782 : : indexed_tlist *itlist;
2783 : : tlist_vinfo *vinfo;
2784 : : ListCell *l;
2785 : :
2786 : : /* Create data structure with enough slots for all tlist entries */
2787 : : itlist = (indexed_tlist *)
2788 : 203801 : palloc(offsetof(indexed_tlist, vars) +
2789 : 203801 : list_length(tlist) * sizeof(tlist_vinfo));
2790 : :
2791 : 203801 : itlist->tlist = tlist;
6215 2792 : 203801 : itlist->has_ph_vars = false;
7444 2793 : 203801 : itlist->has_non_vars = false;
2794 : :
2795 : : /* Find the Vars and fill in the index array */
2796 : 203801 : vinfo = itlist->vars;
8316 2797 [ + + + + : 1929296 : foreach(l, tlist)
+ + ]
2798 : : {
2799 : 1725495 : TargetEntry *tle = (TargetEntry *) lfirst(l);
2800 : :
7444 2801 [ + - + + ]: 1725495 : if (tle->expr && IsA(tle->expr, Var))
2802 : 1715622 : {
7317 bruce@momjian.us 2803 : 1715622 : Var *var = (Var *) tle->expr;
2804 : :
7444 tgl@sss.pgh.pa.us 2805 : 1715622 : vinfo->varno = var->varno;
2806 : 1715622 : vinfo->varattno = var->varattno;
2807 : 1715622 : vinfo->resno = tle->resno;
1001 2808 : 1715622 : vinfo->varnullingrels = var->varnullingrels;
7444 2809 : 1715622 : vinfo++;
2810 : : }
6215 2811 [ + - + + ]: 9873 : else if (tle->expr && IsA(tle->expr, PlaceHolderVar))
2812 : 1715 : itlist->has_ph_vars = true;
2813 : : else
7444 2814 : 8158 : itlist->has_non_vars = true;
2815 : : }
2816 : :
2817 : 203801 : itlist->num_vars = (vinfo - itlist->vars);
2818 : :
2819 : 203801 : return itlist;
2820 : : }
2821 : :
2822 : : /*
2823 : : * build_tlist_index_other_vars --- build a restricted tlist index
2824 : : *
2825 : : * This is like build_tlist_index, but we only index tlist entries that
2826 : : * are Vars belonging to some rel other than the one specified. We will set
2827 : : * has_ph_vars (allowing PlaceHolderVars to be matched), but not has_non_vars
2828 : : * (so nothing other than Vars and PlaceHolderVars can be matched).
2829 : : */
2830 : : static indexed_tlist *
1503 2831 : 1643 : build_tlist_index_other_vars(List *tlist, int ignore_rel)
2832 : : {
2833 : : indexed_tlist *itlist;
2834 : : tlist_vinfo *vinfo;
2835 : : ListCell *l;
2836 : :
2837 : : /* Create data structure with enough slots for all tlist entries */
2838 : : itlist = (indexed_tlist *)
7016 2839 : 1643 : palloc(offsetof(indexed_tlist, vars) +
2840 : 1643 : list_length(tlist) * sizeof(tlist_vinfo));
2841 : :
2842 : 1643 : itlist->tlist = tlist;
6215 2843 : 1643 : itlist->has_ph_vars = false;
7016 2844 : 1643 : itlist->has_non_vars = false;
2845 : :
2846 : : /* Find the desired Vars and fill in the index array */
2847 : 1643 : vinfo = itlist->vars;
2848 [ + + + + : 6358 : foreach(l, tlist)
+ + ]
2849 : : {
2850 : 4715 : TargetEntry *tle = (TargetEntry *) lfirst(l);
2851 : :
2852 [ + - + + ]: 4715 : if (tle->expr && IsA(tle->expr, Var))
2853 : 2706 : {
2854 : 2706 : Var *var = (Var *) tle->expr;
2855 : :
2856 [ + + ]: 2706 : if (var->varno != ignore_rel)
2857 : : {
2858 : 2073 : vinfo->varno = var->varno;
2859 : 2073 : vinfo->varattno = var->varattno;
2860 : 2073 : vinfo->resno = tle->resno;
1001 2861 : 2073 : vinfo->varnullingrels = var->varnullingrels;
7016 2862 : 2073 : vinfo++;
2863 : : }
2864 : : }
6215 2865 [ + - + + ]: 2009 : else if (tle->expr && IsA(tle->expr, PlaceHolderVar))
2866 : 45 : itlist->has_ph_vars = true;
2867 : : }
2868 : :
7016 2869 : 1643 : itlist->num_vars = (vinfo - itlist->vars);
2870 : :
2871 : 1643 : return itlist;
2872 : : }
2873 : :
2874 : : /*
2875 : : * search_indexed_tlist_for_var --- find a Var in an indexed tlist
2876 : : *
2877 : : * If a match is found, return a copy of the given Var with suitably
2878 : : * modified varno/varattno (to wit, newvarno and the resno of the TLE entry).
2879 : : * Also ensure that varnosyn is incremented by rtoffset.
2880 : : * If no match, return NULL.
2881 : : *
2882 : : * We cross-check the varnullingrels of the subplan output Var based on
2883 : : * nrm_match. Most call sites should pass NRM_EQUAL indicating we expect
2884 : : * an exact match. However, there are places where we haven't cleaned
2885 : : * things up completely, and we have to settle for allowing subset or
2886 : : * superset matches.
2887 : : */
2888 : : static Var *
6822 2889 : 781124 : search_indexed_tlist_for_var(Var *var, indexed_tlist *itlist,
2890 : : int newvarno, int rtoffset,
2891 : : NullingRelsMatch nrm_match)
2892 : : {
1503 2893 : 781124 : int varno = var->varno;
7444 2894 : 781124 : AttrNumber varattno = var->varattno;
2895 : : tlist_vinfo *vinfo;
2896 : : int i;
2897 : :
2898 : 781124 : vinfo = itlist->vars;
2899 : 781124 : i = itlist->num_vars;
2900 [ + + ]: 5620837 : while (i-- > 0)
2901 : : {
2902 [ + + + + ]: 5441749 : if (vinfo->varno == varno && vinfo->varattno == varattno)
2903 : : {
2904 : : /* Found a match */
6755 2905 : 602036 : Var *newvar = copyVar(var);
2906 : :
2907 : : /*
2908 : : * Verify that we kept all the nullingrels machinations straight.
2909 : : *
2910 : : * XXX we skip the check for system columns and whole-row Vars.
2911 : : * That's because such Vars might be row identity Vars, which are
2912 : : * generated without any varnullingrels. It'd be hard to do
2913 : : * otherwise, since they're normally made very early in planning,
2914 : : * when we haven't looked at the jointree yet and don't know which
2915 : : * joins might null such Vars. Doesn't seem worth the expense to
2916 : : * make them fully valid. (While it's slightly annoying that we
2917 : : * thereby lose checking for user-written references to such
2918 : : * columns, it seems unlikely that a bug in nullingrels logic
2919 : : * would affect only system columns.)
2920 : : */
894 2921 [ + + + + : 1187051 : if (!(varattno <= 0 ||
+ + - + ]
2922 : : (nrm_match == NRM_SUBSET ?
2923 : 27344 : bms_is_subset(var->varnullingrels, vinfo->varnullingrels) :
2924 : : nrm_match == NRM_SUPERSET ?
2925 : 181072 : bms_is_subset(vinfo->varnullingrels, var->varnullingrels) :
2926 : 376599 : bms_equal(vinfo->varnullingrels, var->varnullingrels))))
894 tgl@sss.pgh.pa.us 2927 [ # # ]:UBC 0 : elog(ERROR, "wrong varnullingrels %s (expected %s) for Var %d/%d",
2928 : : bmsToString(var->varnullingrels),
2929 : : bmsToString(vinfo->varnullingrels),
2930 : : varno, varattno);
2931 : :
7444 tgl@sss.pgh.pa.us 2932 :CBC 602036 : newvar->varno = newvarno;
2933 : 602036 : newvar->varattno = vinfo->resno;
2118 2934 [ + + ]: 602036 : if (newvar->varnosyn > 0)
2935 : 601734 : newvar->varnosyn += rtoffset;
7444 2936 : 602036 : return newvar;
2937 : : }
2938 : 4839713 : vinfo++;
2939 : : }
2940 : 179088 : return NULL; /* no match */
2941 : : }
2942 : :
2943 : : /*
2944 : : * search_indexed_tlist_for_phv --- find a PlaceHolderVar in an indexed tlist
2945 : : *
2946 : : * If a match is found, return a Var constructed to reference the tlist item.
2947 : : * If no match, return NULL.
2948 : : *
2949 : : * Cross-check phnullingrels as in search_indexed_tlist_for_var.
2950 : : *
2951 : : * NOTE: it is a waste of time to call this unless itlist->has_ph_vars.
2952 : : */
2953 : : static Var *
1001 2954 : 1781 : search_indexed_tlist_for_phv(PlaceHolderVar *phv,
2955 : : indexed_tlist *itlist, int newvarno,
2956 : : NullingRelsMatch nrm_match)
2957 : : {
2958 : : ListCell *lc;
2959 : :
2960 [ + - + + : 4524 : foreach(lc, itlist->tlist)
+ + ]
2961 : : {
2962 : 4336 : TargetEntry *tle = (TargetEntry *) lfirst(lc);
2963 : :
2964 [ + - + + ]: 4336 : if (tle->expr && IsA(tle->expr, PlaceHolderVar))
2965 : : {
2966 : 2325 : PlaceHolderVar *subphv = (PlaceHolderVar *) tle->expr;
2967 : : Var *newvar;
2968 : :
2969 : : /*
2970 : : * Analogously to search_indexed_tlist_for_var, we match on phid
2971 : : * only. We don't use equal(), partially for speed but mostly
2972 : : * because phnullingrels might not be exactly equal.
2973 : : */
2974 [ + + ]: 2325 : if (phv->phid != subphv->phid)
2975 : 732 : continue;
2976 : :
2977 : : /* Verify that we kept all the nullingrels machinations straight */
894 2978 [ + + + + : 3186 : if (!(nrm_match == NRM_SUBSET ?
- + ]
2979 : 126 : bms_is_subset(phv->phnullingrels, subphv->phnullingrels) :
2980 : : nrm_match == NRM_SUPERSET ?
2981 : 837 : bms_is_subset(subphv->phnullingrels, phv->phnullingrels) :
2982 : 630 : bms_equal(subphv->phnullingrels, phv->phnullingrels)))
894 tgl@sss.pgh.pa.us 2983 [ # # ]:UBC 0 : elog(ERROR, "wrong phnullingrels %s (expected %s) for PlaceHolderVar %d",
2984 : : bmsToString(phv->phnullingrels),
2985 : : bmsToString(subphv->phnullingrels),
2986 : : phv->phid);
2987 : :
2988 : : /* Found a matching subplan output expression */
1001 tgl@sss.pgh.pa.us 2989 :CBC 1593 : newvar = makeVarFromTargetEntry(newvarno, tle);
2990 : 1593 : newvar->varnosyn = 0; /* wasn't ever a plain Var */
2991 : 1593 : newvar->varattnosyn = 0;
2992 : 1593 : return newvar;
2993 : : }
2994 : : }
2995 : 188 : return NULL; /* no match */
2996 : : }
2997 : :
2998 : : /*
2999 : : * search_indexed_tlist_for_non_var --- find a non-Var/PHV in an indexed tlist
3000 : : *
3001 : : * If a match is found, return a Var constructed to reference the tlist item.
3002 : : * If no match, return NULL.
3003 : : *
3004 : : * NOTE: it is a waste of time to call this unless itlist->has_non_vars.
3005 : : */
3006 : : static Var *
3154 peter_e@gmx.net 3007 : 18545 : search_indexed_tlist_for_non_var(Expr *node,
3008 : : indexed_tlist *itlist, int newvarno)
3009 : : {
3010 : : TargetEntry *tle;
3011 : :
3012 : : /*
3013 : : * If it's a simple Const, replacing it with a Var is silly, even if there
3014 : : * happens to be an identical Const below; a Var is more expensive to
3015 : : * execute than a Const. What's more, replacing it could confuse some
3016 : : * places in the executor that expect to see simple Consts for, eg,
3017 : : * dropped columns.
3018 : : */
3281 tgl@sss.pgh.pa.us 3019 [ + + ]: 18545 : if (IsA(node, Const))
3020 : 969 : return NULL;
3021 : :
7444 3022 : 17576 : tle = tlist_member(node, itlist->tlist);
3023 [ + + ]: 17576 : if (tle)
3024 : : {
3025 : : /* Found a matching subplan output expression */
3026 : : Var *newvar;
3027 : :
5540 peter_e@gmx.net 3028 : 4559 : newvar = makeVarFromTargetEntry(newvarno, tle);
2118 tgl@sss.pgh.pa.us 3029 : 4559 : newvar->varnosyn = 0; /* wasn't ever a plain Var */
3030 : 4559 : newvar->varattnosyn = 0;
7444 3031 : 4559 : return newvar;
3032 : : }
3033 : 13017 : return NULL; /* no match */
3034 : : }
3035 : :
3036 : : /*
3037 : : * search_indexed_tlist_for_sortgroupref --- find a sort/group expression
3038 : : *
3039 : : * If a match is found, return a Var constructed to reference the tlist item.
3040 : : * If no match, return NULL.
3041 : : *
3042 : : * This is needed to ensure that we select the right subplan TLE in cases
3043 : : * where there are multiple textually-equal()-but-volatile sort expressions.
3044 : : * And it's also faster than search_indexed_tlist_for_non_var.
3045 : : */
3046 : : static Var *
3154 peter_e@gmx.net 3047 : 19356 : search_indexed_tlist_for_sortgroupref(Expr *node,
3048 : : Index sortgroupref,
3049 : : indexed_tlist *itlist,
3050 : : int newvarno)
3051 : : {
3052 : : ListCell *lc;
3053 : :
5824 tgl@sss.pgh.pa.us 3054 [ + + + + : 87510 : foreach(lc, itlist->tlist)
+ + ]
3055 : : {
3056 : 76710 : TargetEntry *tle = (TargetEntry *) lfirst(lc);
3057 : :
3058 : : /*
3059 : : * Usually the equal() check is redundant, but in setop plans it may
3060 : : * not be, since prepunion.c assigns ressortgroupref equal to the
3061 : : * column resno without regard to whether that matches the topmost
3062 : : * level's sortgrouprefs and without regard to whether any implicit
3063 : : * coercions are added in the setop tree. We might have to clean that
3064 : : * up someday; but for now, just ignore any false matches.
3065 : : */
3066 [ + + + + ]: 85332 : if (tle->ressortgroupref == sortgroupref &&
3067 : 8622 : equal(node, tle->expr))
3068 : : {
3069 : : /* Found a matching subplan output expression */
3070 : : Var *newvar;
3071 : :
5540 peter_e@gmx.net 3072 : 8556 : newvar = makeVarFromTargetEntry(newvarno, tle);
2118 tgl@sss.pgh.pa.us 3073 : 8556 : newvar->varnosyn = 0; /* wasn't ever a plain Var */
3074 : 8556 : newvar->varattnosyn = 0;
5824 3075 : 8556 : return newvar;
3076 : : }
3077 : : }
3078 : 10800 : return NULL; /* no match */
3079 : : }
3080 : :
3081 : : /*
3082 : : * fix_join_expr
3083 : : * Create a new set of targetlist entries or join qual clauses by
3084 : : * changing the varno/varattno values of variables in the clauses
3085 : : * to reference target list values from the outer and inner join
3086 : : * relation target lists. Also perform opcode lookup and add
3087 : : * regclass OIDs to root->glob->relationOids.
3088 : : *
3089 : : * This is used in four different scenarios:
3090 : : * 1) a normal join clause, where all the Vars in the clause *must* be
3091 : : * replaced by OUTER_VAR or INNER_VAR references. In this case
3092 : : * acceptable_rel should be zero so that any failure to match a Var will be
3093 : : * reported as an error.
3094 : : * 2) RETURNING clauses, which may contain both Vars of the target relation
3095 : : * and Vars of other relations. In this case we want to replace the
3096 : : * other-relation Vars by OUTER_VAR references, while leaving target Vars
3097 : : * alone. Thus inner_itlist = NULL and acceptable_rel = the ID of the
3098 : : * target relation should be passed.
3099 : : * 3) ON CONFLICT UPDATE SET/WHERE clauses. Here references to EXCLUDED are
3100 : : * to be replaced with INNER_VAR references, while leaving target Vars (the
3101 : : * to-be-updated relation) alone. Correspondingly inner_itlist is to be
3102 : : * EXCLUDED elements, outer_itlist = NULL and acceptable_rel the target
3103 : : * relation.
3104 : : * 4) MERGE. In this case, references to the source relation are to be
3105 : : * replaced with INNER_VAR references, leaving Vars of the target
3106 : : * relation (the to-be-modified relation) alone. So inner_itlist is to be
3107 : : * the source relation elements, outer_itlist = NULL and acceptable_rel
3108 : : * the target relation.
3109 : : *
3110 : : * 'clauses' is the targetlist or list of join clauses
3111 : : * 'outer_itlist' is the indexed target list of the outer join relation,
3112 : : * or NULL
3113 : : * 'inner_itlist' is the indexed target list of the inner join relation,
3114 : : * or NULL
3115 : : * 'acceptable_rel' is either zero or the rangetable index of a relation
3116 : : * whose Vars may appear in the clause without provoking an error
3117 : : * 'rtoffset': how much to increment varnos by
3118 : : * 'nrm_match': as for search_indexed_tlist_for_var()
3119 : : * 'num_exec': estimated number of executions of expression
3120 : : *
3121 : : * Returns the new expression tree. The original clause structure is
3122 : : * not modified.
3123 : : */
3124 : : static List *
5168 3125 : 239151 : fix_join_expr(PlannerInfo *root,
3126 : : List *clauses,
3127 : : indexed_tlist *outer_itlist,
3128 : : indexed_tlist *inner_itlist,
3129 : : Index acceptable_rel,
3130 : : int rtoffset,
3131 : : NullingRelsMatch nrm_match,
3132 : : double num_exec)
3133 : : {
3134 : : fix_join_expr_context context;
3135 : :
3136 : 239151 : context.root = root;
7444 3137 : 239151 : context.outer_itlist = outer_itlist;
3138 : 239151 : context.inner_itlist = inner_itlist;
9563 3139 : 239151 : context.acceptable_rel = acceptable_rel;
6822 3140 : 239151 : context.rtoffset = rtoffset;
1001 3141 : 239151 : context.nrm_match = nrm_match;
1856 3142 : 239151 : context.num_exec = num_exec;
6822 3143 : 239151 : return (List *) fix_join_expr_mutator((Node *) clauses, &context);
3144 : : }
3145 : :
3146 : : static Node *
6556 bruce@momjian.us 3147 : 1511969 : fix_join_expr_mutator(Node *node, fix_join_expr_context *context)
3148 : : {
3149 : : Var *newvar;
3150 : :
9576 tgl@sss.pgh.pa.us 3151 [ + + ]: 1511969 : if (node == NULL)
3152 : 149638 : return NULL;
3153 [ + + ]: 1362331 : if (IsA(node, Var))
3154 : : {
3155 : 494838 : Var *var = (Var *) node;
3156 : :
3157 : : /*
3158 : : * Verify that Vars with non-default varreturningtype only appear in
3159 : : * the RETURNING list, and refer to the target relation.
3160 : : */
284 dean.a.rasheed@gmail 3161 [ + + ]: 494838 : if (var->varreturningtype != VAR_RETURNING_DEFAULT)
3162 : : {
3163 [ + - ]: 1343 : if (context->inner_itlist != NULL ||
3164 [ + - ]: 1343 : context->outer_itlist == NULL ||
3165 [ - + ]: 1343 : context->acceptable_rel == 0)
284 dean.a.rasheed@gmail 3166 [ # # ]:UBC 0 : elog(ERROR, "variable returning old/new found outside RETURNING list");
284 dean.a.rasheed@gmail 3167 [ - + ]:CBC 1343 : if (var->varno != context->acceptable_rel)
284 dean.a.rasheed@gmail 3168 [ # # ]:UBC 0 : elog(ERROR, "wrong varno %d (expected %d) for variable returning old/new",
3169 : : var->varno, context->acceptable_rel);
3170 : : }
3171 : :
3172 : : /* Look for the var in the input tlists, first in the outer */
3825 andres@anarazel.de 3173 [ + + ]:CBC 494838 : if (context->outer_itlist)
3174 : : {
3175 : 491281 : newvar = search_indexed_tlist_for_var(var,
3176 : : context->outer_itlist,
3177 : : OUTER_VAR,
3178 : : context->rtoffset,
3179 : : context->nrm_match);
3180 [ + + ]: 491281 : if (newvar)
3181 : 313835 : return (Node *) newvar;
3182 : : }
3183 : :
3184 : : /* then in the inner. */
7444 tgl@sss.pgh.pa.us 3185 [ + + ]: 181003 : if (context->inner_itlist)
3186 : : {
3187 : 175684 : newvar = search_indexed_tlist_for_var(var,
3188 : : context->inner_itlist,
3189 : : INNER_VAR,
3190 : : context->rtoffset,
3191 : : context->nrm_match);
3192 [ + + ]: 175684 : if (newvar)
3193 : 174042 : return (Node *) newvar;
3194 : : }
3195 : :
3196 : : /* If it's for acceptable_rel, adjust and return it */
8378 3197 [ + - ]: 6961 : if (var->varno == context->acceptable_rel)
3198 : : {
6755 3199 : 6961 : var = copyVar(var);
4933 3200 : 6961 : var->varno += context->rtoffset;
2118 3201 [ + + ]: 6961 : if (var->varnosyn > 0)
3202 : 6630 : var->varnosyn += context->rtoffset;
6822 3203 : 6961 : return (Node *) var;
3204 : : }
3205 : :
3206 : : /* No referent found for Var */
8130 tgl@sss.pgh.pa.us 3207 [ # # ]:UBC 0 : elog(ERROR, "variable not found in subplan target lists");
3208 : : }
6215 tgl@sss.pgh.pa.us 3209 [ + + ]:CBC 867493 : if (IsA(node, PlaceHolderVar))
3210 : : {
3211 : 1341 : PlaceHolderVar *phv = (PlaceHolderVar *) node;
3212 : :
3213 : : /* See if the PlaceHolderVar has bubbled up from a lower plan node */
3825 andres@anarazel.de 3214 [ + + + + ]: 1341 : if (context->outer_itlist && context->outer_itlist->has_ph_vars)
3215 : : {
1001 tgl@sss.pgh.pa.us 3216 : 522 : newvar = search_indexed_tlist_for_phv(phv,
3217 : : context->outer_itlist,
3218 : : OUTER_VAR,
3219 : : context->nrm_match);
6215 3220 [ + + ]: 522 : if (newvar)
3221 : 364 : return (Node *) newvar;
3222 : : }
3223 [ + - + + ]: 977 : if (context->inner_itlist && context->inner_itlist->has_ph_vars)
3224 : : {
1001 3225 : 783 : newvar = search_indexed_tlist_for_phv(phv,
3226 : : context->inner_itlist,
3227 : : INNER_VAR,
3228 : : context->nrm_match);
6215 3229 [ + + ]: 783 : if (newvar)
3230 : 753 : return (Node *) newvar;
3231 : : }
3232 : :
3233 : : /* If not supplied by input plans, evaluate the contained expr */
3234 : : /* XXX can we assert something about phnullingrels? */
3235 : 224 : return fix_join_expr_mutator((Node *) phv->phexpr, context);
3236 : : }
3237 : : /* Try matching more complex expressions too, if tlists have any */
2614 efujita@postgresql.o 3238 [ + + + + ]: 866152 : if (context->outer_itlist && context->outer_itlist->has_non_vars)
3239 : : {
3154 peter_e@gmx.net 3240 : 675 : newvar = search_indexed_tlist_for_non_var((Expr *) node,
3241 : : context->outer_itlist,
3242 : : OUTER_VAR);
7444 tgl@sss.pgh.pa.us 3243 [ + + ]: 675 : if (newvar)
8316 3244 : 60 : return (Node *) newvar;
3245 : : }
2614 efujita@postgresql.o 3246 [ + + + + ]: 866092 : if (context->inner_itlist && context->inner_itlist->has_non_vars)
3247 : : {
3154 peter_e@gmx.net 3248 : 3229 : newvar = search_indexed_tlist_for_non_var((Expr *) node,
3249 : : context->inner_itlist,
3250 : : INNER_VAR);
7444 tgl@sss.pgh.pa.us 3251 [ + + ]: 3229 : if (newvar)
8316 3252 : 590 : return (Node *) newvar;
3253 : : }
3254 : : /* Special cases (apply only AFTER failing to match to lower tlist) */
2511 3255 [ + + ]: 865502 : if (IsA(node, Param))
3256 : 2945 : return fix_param_node(context->root, (Param *) node);
1856 3257 [ + + ]: 862557 : if (IsA(node, AlternativeSubPlan))
3258 : 750 : return fix_join_expr_mutator(fix_alternative_subplan(context->root,
3259 : : (AlternativeSubPlan *) node,
3260 : : context->num_exec),
3261 : : context);
5168 3262 : 861807 : fix_expr_common(context->root, node);
333 peter@eisentraut.org 3263 : 861807 : return expression_tree_mutator(node, fix_join_expr_mutator, context);
3264 : : }
3265 : :
3266 : : /*
3267 : : * fix_upper_expr
3268 : : * Modifies an expression tree so that all Var nodes reference outputs
3269 : : * of a subplan. Also looks for Aggref nodes that should be replaced
3270 : : * by initplan output Params. Also performs opcode lookup, and adds
3271 : : * regclass OIDs to root->glob->relationOids.
3272 : : *
3273 : : * This is used to fix up target and qual expressions of non-join upper-level
3274 : : * plan nodes, as well as index-only scan nodes.
3275 : : *
3276 : : * An error is raised if no matching var can be found in the subplan tlist
3277 : : * --- so this routine should only be applied to nodes whose subplans'
3278 : : * targetlists were generated by flattening the expressions used in the
3279 : : * parent node.
3280 : : *
3281 : : * If itlist->has_non_vars is true, then we try to match whole subexpressions
3282 : : * against elements of the subplan tlist, so that we can avoid recomputing
3283 : : * expressions that were already computed by the subplan. (This is relatively
3284 : : * expensive, so we don't want to try it in the common case where the
3285 : : * subplan tlist is just a flattened list of Vars.)
3286 : : *
3287 : : * 'node': the tree to be fixed (a target item or qual)
3288 : : * 'subplan_itlist': indexed target list for subplan (or index)
3289 : : * 'newvarno': varno to use for Vars referencing tlist elements
3290 : : * 'rtoffset': how much to increment varnos by
3291 : : * 'nrm_match': as for search_indexed_tlist_for_var()
3292 : : * 'num_exec': estimated number of executions of expression
3293 : : *
3294 : : * The resulting tree is a copy of the original in which all Var nodes have
3295 : : * varno = newvarno, varattno = resno of corresponding targetlist element.
3296 : : * The original tree is not modified.
3297 : : */
3298 : : static Node *
5168 tgl@sss.pgh.pa.us 3299 : 173942 : fix_upper_expr(PlannerInfo *root,
3300 : : Node *node,
3301 : : indexed_tlist *subplan_itlist,
3302 : : int newvarno,
3303 : : int rtoffset,
3304 : : NullingRelsMatch nrm_match,
3305 : : double num_exec)
3306 : : {
3307 : : fix_upper_expr_context context;
3308 : :
3309 : 173942 : context.root = root;
7444 3310 : 173942 : context.subplan_itlist = subplan_itlist;
5130 3311 : 173942 : context.newvarno = newvarno;
6822 3312 : 173942 : context.rtoffset = rtoffset;
1001 3313 : 173942 : context.nrm_match = nrm_match;
1856 3314 : 173942 : context.num_exec = num_exec;
6822 3315 : 173942 : return fix_upper_expr_mutator(node, &context);
3316 : : }
3317 : :
3318 : : static Node *
6556 bruce@momjian.us 3319 : 493594 : fix_upper_expr_mutator(Node *node, fix_upper_expr_context *context)
3320 : : {
3321 : : Var *newvar;
3322 : :
9576 tgl@sss.pgh.pa.us 3323 [ + + ]: 493594 : if (node == NULL)
9563 3324 : 148869 : return NULL;
9576 3325 [ + + ]: 344725 : if (IsA(node, Var))
3326 : : {
3327 : 114159 : Var *var = (Var *) node;
3328 : :
7444 3329 : 114159 : newvar = search_indexed_tlist_for_var(var,
3330 : : context->subplan_itlist,
3331 : : context->newvarno,
3332 : : context->rtoffset,
3333 : : context->nrm_match);
3334 [ - + ]: 114159 : if (!newvar)
8130 tgl@sss.pgh.pa.us 3335 [ # # ]:UBC 0 : elog(ERROR, "variable not found in subplan target list");
9563 tgl@sss.pgh.pa.us 3336 :CBC 114159 : return (Node *) newvar;
3337 : : }
6215 3338 [ + + ]: 230566 : if (IsA(node, PlaceHolderVar))
3339 : : {
3340 : 545 : PlaceHolderVar *phv = (PlaceHolderVar *) node;
3341 : :
3342 : : /* See if the PlaceHolderVar has bubbled up from a lower plan node */
3343 [ + + ]: 545 : if (context->subplan_itlist->has_ph_vars)
3344 : : {
1001 3345 : 476 : newvar = search_indexed_tlist_for_phv(phv,
3346 : : context->subplan_itlist,
3347 : : context->newvarno,
3348 : : context->nrm_match);
6215 3349 [ + - ]: 476 : if (newvar)
3350 : 476 : return (Node *) newvar;
3351 : : }
3352 : : /* If not supplied by input plan, evaluate the contained expr */
3353 : : /* XXX can we assert something about phnullingrels? */
3354 : 69 : return fix_upper_expr_mutator((Node *) phv->phexpr, context);
3355 : : }
3356 : : /* Try matching more complex expressions too, if tlist has any */
2511 3357 [ + + ]: 230021 : if (context->subplan_itlist->has_non_vars)
3358 : : {
3359 : 14551 : newvar = search_indexed_tlist_for_non_var((Expr *) node,
3360 : : context->subplan_itlist,
3361 : : context->newvarno);
3362 [ + + ]: 14551 : if (newvar)
3363 : 3819 : return (Node *) newvar;
3364 : : }
3365 : : /* Special cases (apply only AFTER failing to match to lower tlist) */
4149 3366 [ + + ]: 226202 : if (IsA(node, Param))
3367 : 4738 : return fix_param_node(context->root, (Param *) node);
3521 3368 [ + + ]: 221464 : if (IsA(node, Aggref))
3369 : : {
3370 : 23064 : Aggref *aggref = (Aggref *) node;
3371 : : Param *aggparam;
3372 : :
3373 : : /* See if the Aggref should be replaced by a Param */
837 3374 : 23064 : aggparam = find_minmax_agg_replacement_param(context->root, aggref);
3375 [ - + ]: 23064 : if (aggparam != NULL)
3376 : : {
3377 : : /* Make a copy of the Param for paranoia's sake */
837 tgl@sss.pgh.pa.us 3378 :UBC 0 : return (Node *) copyObject(aggparam);
3379 : : }
3380 : : /* If no match, just fall through to process it normally */
3381 : : }
1856 tgl@sss.pgh.pa.us 3382 [ + + ]:CBC 221464 : if (IsA(node, AlternativeSubPlan))
3383 : 15 : return fix_upper_expr_mutator(fix_alternative_subplan(context->root,
3384 : : (AlternativeSubPlan *) node,
3385 : : context->num_exec),
3386 : : context);
5168 3387 : 221449 : fix_expr_common(context->root, node);
333 peter@eisentraut.org 3388 : 221449 : return expression_tree_mutator(node, fix_upper_expr_mutator, context);
3389 : : }
3390 : :
3391 : : /*
3392 : : * set_returning_clause_references
3393 : : * Perform setrefs.c's work on a RETURNING targetlist
3394 : : *
3395 : : * If the query involves more than just the result table, we have to
3396 : : * adjust any Vars that refer to other tables to reference junk tlist
3397 : : * entries in the top subplan's targetlist. Vars referencing the result
3398 : : * table should be left alone, however (the executor will evaluate them
3399 : : * using the actual heap tuple, after firing triggers if any). In the
3400 : : * adjusted RETURNING list, result-table Vars will have their original
3401 : : * varno (plus rtoffset), but Vars for other rels will have varno OUTER_VAR.
3402 : : *
3403 : : * We also must perform opcode lookup and add regclass OIDs to
3404 : : * root->glob->relationOids.
3405 : : *
3406 : : * 'rlist': the RETURNING targetlist to be fixed
3407 : : * 'topplan': the top subplan node that will be just below the ModifyTable
3408 : : * node (note it's not yet passed through set_plan_refs)
3409 : : * 'resultRelation': RT index of the associated result relation
3410 : : * 'rtoffset': how much to increment varnos by
3411 : : *
3412 : : * Note: the given 'root' is for the parent query level, not the 'topplan'.
3413 : : * This does not matter currently since we only access the dependency-item
3414 : : * lists in root->glob, but it would need some hacking if we wanted a root
3415 : : * that actually matches the subplan.
3416 : : *
3417 : : * Note: resultRelation is not yet adjusted by rtoffset.
3418 : : */
3419 : : static List *
5168 tgl@sss.pgh.pa.us 3420 : 1643 : set_returning_clause_references(PlannerInfo *root,
3421 : : List *rlist,
3422 : : Plan *topplan,
3423 : : Index resultRelation,
3424 : : int rtoffset)
3425 : : {
3426 : : indexed_tlist *itlist;
3427 : :
3428 : : /*
3429 : : * We can perform the desired Var fixup by abusing the fix_join_expr
3430 : : * machinery that formerly handled inner indexscan fixup. We search the
3431 : : * top plan's targetlist for Vars of non-result relations, and use
3432 : : * fix_join_expr to convert RETURNING Vars into references to those tlist
3433 : : * entries, while leaving result-rel Vars as-is.
3434 : : *
3435 : : * PlaceHolderVars will also be sought in the targetlist, but no
3436 : : * more-complex expressions will be. Note that it is not possible for a
3437 : : * PlaceHolderVar to refer to the result relation, since the result is
3438 : : * never below an outer join. If that case could happen, we'd have to be
3439 : : * prepared to pick apart the PlaceHolderVar and evaluate its contained
3440 : : * expression instead.
3441 : : */
7016 3442 : 1643 : itlist = build_tlist_index_other_vars(topplan->targetlist, resultRelation);
3443 : :
5168 3444 : 1643 : rlist = fix_join_expr(root,
3445 : : rlist,
3446 : : itlist,
3447 : : NULL,
3448 : : resultRelation,
3449 : : rtoffset,
3450 : : NRM_EQUAL,
3451 : : NUM_EXEC_TLIST(topplan));
3452 : :
7016 3453 : 1643 : pfree(itlist);
3454 : :
3455 : 1643 : return rlist;
3456 : : }
3457 : :
3458 : : /*
3459 : : * fix_windowagg_condition_expr_mutator
3460 : : * Mutator function for replacing WindowFuncs with the corresponding Var
3461 : : * in the targetlist which references that WindowFunc.
3462 : : */
3463 : : static Node *
1298 drowley@postgresql.o 3464 : 1735 : fix_windowagg_condition_expr_mutator(Node *node,
3465 : : fix_windowagg_cond_context *context)
3466 : : {
3467 [ + + ]: 1735 : if (node == NULL)
3468 : 1291 : return NULL;
3469 : :
3470 [ + + ]: 444 : if (IsA(node, WindowFunc))
3471 : : {
3472 : : Var *newvar;
3473 : :
3474 : 90 : newvar = search_indexed_tlist_for_non_var((Expr *) node,
3475 : : context->subplan_itlist,
3476 : : context->newvarno);
3477 [ + - ]: 90 : if (newvar)
3478 : 90 : return (Node *) newvar;
1298 drowley@postgresql.o 3479 [ # # ]:UBC 0 : elog(ERROR, "WindowFunc not found in subplan target lists");
3480 : : }
3481 : :
1298 drowley@postgresql.o 3482 :CBC 354 : return expression_tree_mutator(node,
3483 : : fix_windowagg_condition_expr_mutator,
3484 : : context);
3485 : : }
3486 : :
3487 : : /*
3488 : : * fix_windowagg_condition_expr
3489 : : * Converts references in 'runcondition' so that any WindowFunc
3490 : : * references are swapped out for a Var which references the matching
3491 : : * WindowFunc in 'subplan_itlist'.
3492 : : */
3493 : : static List *
3494 : 1375 : fix_windowagg_condition_expr(PlannerInfo *root,
3495 : : List *runcondition,
3496 : : indexed_tlist *subplan_itlist)
3497 : : {
3498 : : fix_windowagg_cond_context context;
3499 : :
3500 : 1375 : context.root = root;
3501 : 1375 : context.subplan_itlist = subplan_itlist;
3502 : 1375 : context.newvarno = 0;
3503 : :
3504 : 1375 : return (List *) fix_windowagg_condition_expr_mutator((Node *) runcondition,
3505 : : &context);
3506 : : }
3507 : :
3508 : : /*
3509 : : * set_windowagg_runcondition_references
3510 : : * Converts references in 'runcondition' so that any WindowFunc
3511 : : * references are swapped out for a Var which references the matching
3512 : : * WindowFunc in 'plan' targetlist.
3513 : : */
3514 : : static List *
3515 : 1375 : set_windowagg_runcondition_references(PlannerInfo *root,
3516 : : List *runcondition,
3517 : : Plan *plan)
3518 : : {
3519 : : List *newlist;
3520 : : indexed_tlist *itlist;
3521 : :
3522 : 1375 : itlist = build_tlist_index(plan->targetlist);
3523 : :
3524 : 1375 : newlist = fix_windowagg_condition_expr(root, runcondition, itlist);
3525 : :
3526 : 1375 : pfree(itlist);
3527 : :
3528 : 1375 : return newlist;
3529 : : }
3530 : :
3531 : : /*
3532 : : * find_minmax_agg_replacement_param
3533 : : * If the given Aggref is one that we are optimizing into a subquery
3534 : : * (cf. planagg.c), then return the Param that should replace it.
3535 : : * Else return NULL.
3536 : : *
3537 : : * This is exported so that SS_finalize_plan can use it before setrefs.c runs.
3538 : : * Note that it will not find anything until we have built a Plan from a
3539 : : * MinMaxAggPath, as root->minmax_aggs will never be filled otherwise.
3540 : : */
3541 : : Param *
837 tgl@sss.pgh.pa.us 3542 : 31059 : find_minmax_agg_replacement_param(PlannerInfo *root, Aggref *aggref)
3543 : : {
3544 [ + + + - ]: 31543 : if (root->minmax_aggs != NIL &&
3545 : 484 : list_length(aggref->args) == 1)
3546 : : {
3547 : 484 : TargetEntry *curTarget = (TargetEntry *) linitial(aggref->args);
3548 : : ListCell *lc;
3549 : :
3550 [ + - + - : 532 : foreach(lc, root->minmax_aggs)
+ - ]
3551 : : {
3552 : 532 : MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);
3553 : :
3554 [ + + + - ]: 1016 : if (mminfo->aggfnoid == aggref->aggfnoid &&
3555 : 484 : equal(mminfo->target, curTarget->expr))
3556 : 484 : return mminfo->param;
3557 : : }
3558 : : }
3559 : 30575 : return NULL;
3560 : : }
3561 : :
3562 : :
3563 : : /*****************************************************************************
3564 : : * QUERY DEPENDENCY MANAGEMENT
3565 : : *****************************************************************************/
3566 : :
3567 : : /*
3568 : : * record_plan_function_dependency
3569 : : * Mark the current plan as depending on a particular function.
3570 : : *
3571 : : * This is exported so that the function-inlining code can record a
3572 : : * dependency on a function that it's removed from the plan tree.
3573 : : */
3574 : : void
5168 3575 : 628285 : record_plan_function_dependency(PlannerInfo *root, Oid funcid)
3576 : : {
3577 : : /*
3578 : : * For performance reasons, we don't bother to track built-in functions;
3579 : : * we just assume they'll never change (or at least not in ways that'd
3580 : : * invalidate plans using them). For this purpose we can consider a
3581 : : * built-in function to be one with OID less than FirstUnpinnedObjectId.
3582 : : * Note that the OID generator guarantees never to generate such an OID
3583 : : * after startup, even at OID wraparound.
3584 : : */
1565 3585 [ + + ]: 628285 : if (funcid >= (Oid) FirstUnpinnedObjectId)
3586 : : {
5186 3587 : 20844 : PlanInvalItem *inval_item = makeNode(PlanInvalItem);
3588 : :
3589 : : /*
3590 : : * It would work to use any syscache on pg_proc, but the easiest is
3591 : : * PROCOID since we already have the function's OID at hand. Note
3592 : : * that plancache.c knows we use PROCOID.
3593 : : */
6257 3594 : 20844 : inval_item->cacheId = PROCOID;
4982 3595 : 20844 : inval_item->hashValue = GetSysCacheHashValue1(PROCOID,
3596 : : ObjectIdGetDatum(funcid));
3597 : :
5168 3598 : 20844 : root->glob->invalItems = lappend(root->glob->invalItems, inval_item);
3599 : : }
6257 3600 : 628285 : }
3601 : :
3602 : : /*
3603 : : * record_plan_type_dependency
3604 : : * Mark the current plan as depending on a particular type.
3605 : : *
3606 : : * This is exported so that eval_const_expressions can record a
3607 : : * dependency on a domain that it's removed a CoerceToDomain node for.
3608 : : *
3609 : : * We don't currently need to record dependencies on domains that the
3610 : : * plan contains CoerceToDomain nodes for, though that might change in
3611 : : * future. Hence, this isn't actually called in this module, though
3612 : : * someday fix_expr_common might call it.
3613 : : */
3614 : : void
2482 3615 : 9129 : record_plan_type_dependency(PlannerInfo *root, Oid typid)
3616 : : {
3617 : : /*
3618 : : * As in record_plan_function_dependency, ignore the possibility that
3619 : : * someone would change a built-in domain.
3620 : : */
1565 3621 [ + - ]: 9129 : if (typid >= (Oid) FirstUnpinnedObjectId)
3622 : : {
2510 3623 : 9129 : PlanInvalItem *inval_item = makeNode(PlanInvalItem);
3624 : :
3625 : : /*
3626 : : * It would work to use any syscache on pg_type, but the easiest is
3627 : : * TYPEOID since we already have the type's OID at hand. Note that
3628 : : * plancache.c knows we use TYPEOID.
3629 : : */
3630 : 9129 : inval_item->cacheId = TYPEOID;
3631 : 9129 : inval_item->hashValue = GetSysCacheHashValue1(TYPEOID,
3632 : : ObjectIdGetDatum(typid));
3633 : :
3634 : 9129 : root->glob->invalItems = lappend(root->glob->invalItems, inval_item);
3635 : : }
3636 : 9129 : }
3637 : :
3638 : : /*
3639 : : * extract_query_dependencies
3640 : : * Given a rewritten, but not yet planned, query or queries
3641 : : * (i.e. a Query node or list of Query nodes), extract dependencies
3642 : : * just as set_plan_references would do. Also detect whether any
3643 : : * rewrite steps were affected by RLS.
3644 : : *
3645 : : * This is needed by plancache.c to handle invalidation of cached unplanned
3646 : : * queries.
3647 : : *
3648 : : * Note: this does not go through eval_const_expressions, and hence doesn't
3649 : : * reflect its additions of inlined functions and elided CoerceToDomain nodes
3650 : : * to the invalItems list. This is obviously OK for functions, since we'll
3651 : : * see them in the original query tree anyway. For domains, it's OK because
3652 : : * we don't care about domains unless they get elided. That is, a plan might
3653 : : * have domain dependencies that the query tree doesn't.
3654 : : */
3655 : : void
5764 3656 : 30537 : extract_query_dependencies(Node *query,
3657 : : List **relationOids,
3658 : : List **invalItems,
3659 : : bool *hasRowSecurity)
3660 : : {
3661 : : PlannerGlobal glob;
3662 : : PlannerInfo root;
3663 : :
3664 : : /* Make up dummy planner state so we can use this module's machinery */
6257 3665 [ + - + - : 793962 : MemSet(&glob, 0, sizeof(glob));
+ - + - +
+ ]
3666 : 30537 : glob.type = T_PlannerGlobal;
3667 : 30537 : glob.relationOids = NIL;
3668 : 30537 : glob.invalItems = NIL;
3669 : : /* Hack: we use glob.dependsOnRole to collect hasRowSecurity flags */
3391 3670 : 30537 : glob.dependsOnRole = false;
3671 : :
5168 3672 [ + - + - : 2839941 : MemSet(&root, 0, sizeof(root));
+ - + - +
+ ]
3673 : 30537 : root.type = T_PlannerInfo;
3674 : 30537 : root.glob = &glob;
3675 : :
3676 : 30537 : (void) extract_query_dependencies_walker(query, &root);
3677 : :
6257 3678 : 30537 : *relationOids = glob.relationOids;
3679 : 30537 : *invalItems = glob.invalItems;
3391 3680 : 30537 : *hasRowSecurity = glob.dependsOnRole;
6257 3681 : 30537 : }
3682 : :
3683 : : /*
3684 : : * Tree walker for extract_query_dependencies.
3685 : : *
3686 : : * This is exported so that expression_planner_with_deps can call it on
3687 : : * simple expressions (post-planning, not before planning, in that case).
3688 : : * In that usage, glob.dependsOnRole isn't meaningful, but the relationOids
3689 : : * and invalItems lists are added to as needed.
3690 : : */
3691 : : bool
5168 3692 : 832318 : extract_query_dependencies_walker(Node *node, PlannerInfo *context)
3693 : : {
6257 3694 [ + + ]: 832318 : if (node == NULL)
3695 : 393189 : return false;
6215 3696 [ - + ]: 439129 : Assert(!IsA(node, PlaceHolderVar));
6257 3697 [ + + ]: 439129 : if (IsA(node, Query))
3698 : : {
3699 : 32970 : Query *query = (Query *) node;
3700 : : ListCell *lc;
3701 : :
4870 3702 [ + + ]: 32970 : if (query->commandType == CMD_UTILITY)
3703 : : {
3704 : : /*
3705 : : * This logic must handle any utility command for which parse
3706 : : * analysis was nontrivial (cf. stmt_requires_parse_analysis).
3707 : : *
3708 : : * Notably, CALL requires its own processing.
3709 : : */
763 3710 [ + + ]: 4973 : if (IsA(query->utilityStmt, CallStmt))
3711 : : {
3712 : 58 : CallStmt *callstmt = (CallStmt *) query->utilityStmt;
3713 : :
3714 : : /* We need not examine funccall, just the transformed exprs */
3715 : 58 : (void) extract_query_dependencies_walker((Node *) callstmt->funcexpr,
3716 : : context);
3717 : 58 : (void) extract_query_dependencies_walker((Node *) callstmt->outargs,
3718 : : context);
3719 : 58 : return false;
3720 : : }
3721 : :
3722 : : /*
3723 : : * Ignore other utility statements, except those (such as EXPLAIN)
3724 : : * that contain a parsed-but-not-planned query. For those, we
3725 : : * just need to transfer our attention to the contained query.
3726 : : */
4970 3727 : 4915 : query = UtilityContainsQuery(query->utilityStmt);
3728 [ + + ]: 4915 : if (query == NULL)
5764 3729 : 18 : return false;
3730 : : }
3731 : :
3732 : : /* Remember if any Query has RLS quals applied by rewriter */
3391 3733 [ + + ]: 32894 : if (query->hasRowSecurity)
3734 : 114 : context->glob->dependsOnRole = true;
3735 : :
3736 : : /* Collect relation OIDs in this Query's rtable */
6257 3737 [ + + + + : 52271 : foreach(lc, query->rtable)
+ + ]
3738 : : {
3739 : 19377 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
3740 : :
1013 3741 [ + + ]: 19377 : if (rte->rtekind == RTE_RELATION ||
3742 [ + + + + ]: 3830 : (rte->rtekind == RTE_SUBQUERY && OidIsValid(rte->relid)) ||
3743 [ + + + - ]: 3459 : (rte->rtekind == RTE_NAMEDTUPLESTORE && OidIsValid(rte->relid)))
5168 3744 : 16160 : context->glob->relationOids =
3745 : 16160 : lappend_oid(context->glob->relationOids, rte->relid);
3746 : : }
3747 : :
3748 : : /* And recurse into the query's subexpressions */
6257 3749 : 32894 : return query_tree_walker(query, extract_query_dependencies_walker,
3750 : : context, 0);
3751 : : }
3752 : : /* Extract function dependencies and check for regclass Consts */
2510 3753 : 406159 : fix_expr_common(context, node);
6257 3754 : 406159 : return expression_tree_walker(node, extract_query_dependencies_walker,
3755 : : context);
3756 : : }
|
