Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * clauses.c
4 : * routines to manipulate qualification clauses
5 : *
6 : * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
7 : * Portions Copyright (c) 1994, Regents of the University of California
8 : *
9 : *
10 : * IDENTIFICATION
11 : * src/backend/optimizer/util/clauses.c
12 : *
13 : * HISTORY
14 : * AUTHOR DATE MAJOR EVENT
15 : * Andrew Yu Nov 3, 1994 clause.c and clauses.c combined
16 : *
17 : *-------------------------------------------------------------------------
18 : */
19 :
20 : #include "postgres.h"
21 :
22 : #include "access/htup_details.h"
23 : #include "catalog/pg_class.h"
24 : #include "catalog/pg_language.h"
25 : #include "catalog/pg_operator.h"
26 : #include "catalog/pg_proc.h"
27 : #include "catalog/pg_type.h"
28 : #include "executor/executor.h"
29 : #include "executor/functions.h"
30 : #include "funcapi.h"
31 : #include "miscadmin.h"
32 : #include "nodes/makefuncs.h"
33 : #include "nodes/multibitmapset.h"
34 : #include "nodes/nodeFuncs.h"
35 : #include "nodes/subscripting.h"
36 : #include "nodes/supportnodes.h"
37 : #include "optimizer/clauses.h"
38 : #include "optimizer/cost.h"
39 : #include "optimizer/optimizer.h"
40 : #include "optimizer/pathnode.h"
41 : #include "optimizer/plancat.h"
42 : #include "optimizer/planmain.h"
43 : #include "parser/analyze.h"
44 : #include "parser/parse_coerce.h"
45 : #include "parser/parse_collate.h"
46 : #include "parser/parse_func.h"
47 : #include "parser/parse_oper.h"
48 : #include "parser/parsetree.h"
49 : #include "rewrite/rewriteHandler.h"
50 : #include "rewrite/rewriteManip.h"
51 : #include "tcop/tcopprot.h"
52 : #include "utils/acl.h"
53 : #include "utils/builtins.h"
54 : #include "utils/datum.h"
55 : #include "utils/fmgroids.h"
56 : #include "utils/json.h"
57 : #include "utils/jsonb.h"
58 : #include "utils/jsonpath.h"
59 : #include "utils/lsyscache.h"
60 : #include "utils/memutils.h"
61 : #include "utils/syscache.h"
62 : #include "utils/typcache.h"
63 :
64 : typedef struct
65 : {
66 : ParamListInfo boundParams;
67 : PlannerInfo *root;
68 : List *active_fns;
69 : Node *case_val;
70 : bool estimate;
71 : } eval_const_expressions_context;
72 :
73 : typedef struct
74 : {
75 : int nargs;
76 : List *args;
77 : int *usecounts;
78 : } substitute_actual_parameters_context;
79 :
80 : typedef struct
81 : {
82 : int nargs;
83 : List *args;
84 : int sublevels_up;
85 : } substitute_actual_parameters_in_from_context;
86 :
87 : typedef struct
88 : {
89 : char *proname;
90 : char *prosrc;
91 : } inline_error_callback_arg;
92 :
93 : typedef struct
94 : {
95 : char max_hazard; /* worst proparallel hazard found so far */
96 : char max_interesting; /* worst proparallel hazard of interest */
97 : List *safe_param_ids; /* PARAM_EXEC Param IDs to treat as safe */
98 : } max_parallel_hazard_context;
99 :
100 : static bool contain_agg_clause_walker(Node *node, void *context);
101 : static bool find_window_functions_walker(Node *node, WindowFuncLists *lists);
102 : static bool contain_subplans_walker(Node *node, void *context);
103 : static bool contain_mutable_functions_walker(Node *node, void *context);
104 : static bool contain_volatile_functions_walker(Node *node, void *context);
105 : static bool contain_volatile_functions_not_nextval_walker(Node *node, void *context);
106 : static bool max_parallel_hazard_walker(Node *node,
107 : max_parallel_hazard_context *context);
108 : static bool contain_nonstrict_functions_walker(Node *node, void *context);
109 : static bool contain_exec_param_walker(Node *node, List *param_ids);
110 : static bool contain_context_dependent_node(Node *clause);
111 : static bool contain_context_dependent_node_walker(Node *node, int *flags);
112 : static bool contain_leaked_vars_walker(Node *node, void *context);
113 : static Relids find_nonnullable_rels_walker(Node *node, bool top_level);
114 : static List *find_nonnullable_vars_walker(Node *node, bool top_level);
115 : static bool is_strict_saop(ScalarArrayOpExpr *expr, bool falseOK);
116 : static bool convert_saop_to_hashed_saop_walker(Node *node, void *context);
117 : static Node *eval_const_expressions_mutator(Node *node,
118 : eval_const_expressions_context *context);
119 : static bool contain_non_const_walker(Node *node, void *context);
120 : static bool ece_function_is_safe(Oid funcid,
121 : eval_const_expressions_context *context);
122 : static List *simplify_or_arguments(List *args,
123 : eval_const_expressions_context *context,
124 : bool *haveNull, bool *forceTrue);
125 : static List *simplify_and_arguments(List *args,
126 : eval_const_expressions_context *context,
127 : bool *haveNull, bool *forceFalse);
128 : static Node *simplify_boolean_equality(Oid opno, List *args);
129 : static Expr *simplify_function(Oid funcid,
130 : Oid result_type, int32 result_typmod,
131 : Oid result_collid, Oid input_collid, List **args_p,
132 : bool funcvariadic, bool process_args, bool allow_non_const,
133 : eval_const_expressions_context *context);
134 : static Node *simplify_aggref(Aggref *aggref,
135 : eval_const_expressions_context *context);
136 : static List *reorder_function_arguments(List *args, int pronargs,
137 : HeapTuple func_tuple);
138 : static List *add_function_defaults(List *args, int pronargs,
139 : HeapTuple func_tuple);
140 : static List *fetch_function_defaults(HeapTuple func_tuple);
141 : static void recheck_cast_function_args(List *args, Oid result_type,
142 : Oid *proargtypes, int pronargs,
143 : HeapTuple func_tuple);
144 : static Expr *evaluate_function(Oid funcid, Oid result_type, int32 result_typmod,
145 : Oid result_collid, Oid input_collid, List *args,
146 : bool funcvariadic,
147 : HeapTuple func_tuple,
148 : eval_const_expressions_context *context);
149 : static Expr *inline_function(Oid funcid, Oid result_type, Oid result_collid,
150 : Oid input_collid, List *args,
151 : bool funcvariadic,
152 : HeapTuple func_tuple,
153 : eval_const_expressions_context *context);
154 : static Node *substitute_actual_parameters(Node *expr, int nargs, List *args,
155 : int *usecounts);
156 : static Node *substitute_actual_parameters_mutator(Node *node,
157 : substitute_actual_parameters_context *context);
158 : static void sql_inline_error_callback(void *arg);
159 : static Query *inline_sql_function_in_from(PlannerInfo *root,
160 : RangeTblFunction *rtfunc,
161 : FuncExpr *fexpr,
162 : HeapTuple func_tuple,
163 : Form_pg_proc funcform,
164 : const char *src);
165 : static Query *substitute_actual_parameters_in_from(Query *expr,
166 : int nargs, List *args);
167 : static Node *substitute_actual_parameters_in_from_mutator(Node *node,
168 : substitute_actual_parameters_in_from_context *context);
169 : static bool pull_paramids_walker(Node *node, Bitmapset **context);
170 :
171 :
172 : /*****************************************************************************
173 : * Aggregate-function clause manipulation
174 : *****************************************************************************/
175 :
176 : /*
177 : * contain_agg_clause
178 : * Recursively search for Aggref/GroupingFunc nodes within a clause.
179 : *
180 : * Returns true if any aggregate found.
181 : *
182 : * This does not descend into subqueries, and so should be used only after
183 : * reduction of sublinks to subplans, or in contexts where it's known there
184 : * are no subqueries. There mustn't be outer-aggregate references either.
185 : *
186 : * (If you want something like this but able to deal with subqueries,
187 : * see rewriteManip.c's contain_aggs_of_level().)
188 : */
189 : bool
190 10720 : contain_agg_clause(Node *clause)
191 : {
192 10720 : return contain_agg_clause_walker(clause, NULL);
193 : }
194 :
195 : static bool
196 13006 : contain_agg_clause_walker(Node *node, void *context)
197 : {
198 13006 : if (node == NULL)
199 36 : return false;
200 12970 : if (IsA(node, Aggref))
201 : {
202 : Assert(((Aggref *) node)->agglevelsup == 0);
203 1018 : return true; /* abort the tree traversal and return true */
204 : }
205 11952 : if (IsA(node, GroupingFunc))
206 : {
207 : Assert(((GroupingFunc *) node)->agglevelsup == 0);
208 30 : return true; /* abort the tree traversal and return true */
209 : }
210 : Assert(!IsA(node, SubLink));
211 11922 : return expression_tree_walker(node, contain_agg_clause_walker, context);
212 : }
213 :
214 : /*****************************************************************************
215 : * Window-function clause manipulation
216 : *****************************************************************************/
217 :
218 : /*
219 : * contain_window_function
220 : * Recursively search for WindowFunc nodes within a clause.
221 : *
222 : * Since window functions don't have level fields, but are hard-wired to
223 : * be associated with the current query level, this is just the same as
224 : * rewriteManip.c's function.
225 : */
226 : bool
227 9174 : contain_window_function(Node *clause)
228 : {
229 9174 : return contain_windowfuncs(clause);
230 : }
231 :
232 : /*
233 : * find_window_functions
234 : * Locate all the WindowFunc nodes in an expression tree, and organize
235 : * them by winref ID number.
236 : *
237 : * Caller must provide an upper bound on the winref IDs expected in the tree.
238 : */
239 : WindowFuncLists *
240 2570 : find_window_functions(Node *clause, Index maxWinRef)
241 : {
242 2570 : WindowFuncLists *lists = palloc(sizeof(WindowFuncLists));
243 :
244 2570 : lists->numWindowFuncs = 0;
245 2570 : lists->maxWinRef = maxWinRef;
246 2570 : lists->windowFuncs = (List **) palloc0((maxWinRef + 1) * sizeof(List *));
247 2570 : (void) find_window_functions_walker(clause, lists);
248 2570 : return lists;
249 : }
250 :
251 : static bool
252 21898 : find_window_functions_walker(Node *node, WindowFuncLists *lists)
253 : {
254 21898 : if (node == NULL)
255 218 : return false;
256 21680 : if (IsA(node, WindowFunc))
257 : {
258 3596 : WindowFunc *wfunc = (WindowFunc *) node;
259 :
260 : /* winref is unsigned, so one-sided test is OK */
261 3596 : if (wfunc->winref > lists->maxWinRef)
262 0 : elog(ERROR, "WindowFunc contains out-of-range winref %u",
263 : wfunc->winref);
264 : /* eliminate duplicates, so that we avoid repeated computation */
265 3596 : if (!list_member(lists->windowFuncs[wfunc->winref], wfunc))
266 : {
267 7168 : lists->windowFuncs[wfunc->winref] =
268 3584 : lappend(lists->windowFuncs[wfunc->winref], wfunc);
269 3584 : lists->numWindowFuncs++;
270 : }
271 :
272 : /*
273 : * We assume that the parser checked that there are no window
274 : * functions in the arguments or filter clause. Hence, we need not
275 : * recurse into them. (If either the parser or the planner screws up
276 : * on this point, the executor will still catch it; see ExecInitExpr.)
277 : */
278 3596 : return false;
279 : }
280 : Assert(!IsA(node, SubLink));
281 18084 : return expression_tree_walker(node, find_window_functions_walker, lists);
282 : }
283 :
284 :
285 : /*****************************************************************************
286 : * Support for expressions returning sets
287 : *****************************************************************************/
288 :
289 : /*
290 : * expression_returns_set_rows
291 : * Estimate the number of rows returned by a set-returning expression.
292 : * The result is 1 if it's not a set-returning expression.
293 : *
294 : * We should only examine the top-level function or operator; it used to be
295 : * appropriate to recurse, but not anymore. (Even if there are more SRFs in
296 : * the function's inputs, their multipliers are accounted for separately.)
297 : *
298 : * Note: keep this in sync with expression_returns_set() in nodes/nodeFuncs.c.
299 : */
300 : double
301 455230 : expression_returns_set_rows(PlannerInfo *root, Node *clause)
302 : {
303 455230 : if (clause == NULL)
304 0 : return 1.0;
305 455230 : if (IsA(clause, FuncExpr))
306 : {
307 65482 : FuncExpr *expr = (FuncExpr *) clause;
308 :
309 65482 : if (expr->funcretset)
310 55808 : return clamp_row_est(get_function_rows(root, expr->funcid, clause));
311 : }
312 399422 : if (IsA(clause, OpExpr))
313 : {
314 3758 : OpExpr *expr = (OpExpr *) clause;
315 :
316 3758 : if (expr->opretset)
317 : {
318 6 : set_opfuncid(expr);
319 6 : return clamp_row_est(get_function_rows(root, expr->opfuncid, clause));
320 : }
321 : }
322 399416 : return 1.0;
323 : }
324 :
325 :
326 : /*****************************************************************************
327 : * Subplan clause manipulation
328 : *****************************************************************************/
329 :
330 : /*
331 : * contain_subplans
332 : * Recursively search for subplan nodes within a clause.
333 : *
334 : * If we see a SubLink node, we will return true. This is only possible if
335 : * the expression tree hasn't yet been transformed by subselect.c. We do not
336 : * know whether the node will produce a true subplan or just an initplan,
337 : * but we make the conservative assumption that it will be a subplan.
338 : *
339 : * Returns true if any subplan found.
340 : */
341 : bool
342 57812 : contain_subplans(Node *clause)
343 : {
344 57812 : return contain_subplans_walker(clause, NULL);
345 : }
346 :
347 : static bool
348 255060 : contain_subplans_walker(Node *node, void *context)
349 : {
350 255060 : if (node == NULL)
351 7758 : return false;
352 247302 : if (IsA(node, SubPlan) ||
353 247200 : IsA(node, AlternativeSubPlan) ||
354 247200 : IsA(node, SubLink))
355 342 : return true; /* abort the tree traversal and return true */
356 246960 : return expression_tree_walker(node, contain_subplans_walker, context);
357 : }
358 :
359 :
360 : /*****************************************************************************
361 : * Check clauses for mutable functions
362 : *****************************************************************************/
363 :
364 : /*
365 : * contain_mutable_functions
366 : * Recursively search for mutable functions within a clause.
367 : *
368 : * Returns true if any mutable function (or operator implemented by a
369 : * mutable function) is found. This test is needed so that we don't
370 : * mistakenly think that something like "WHERE random() < 0.5" can be treated
371 : * as a constant qualification.
372 : *
373 : * This will give the right answer only for clauses that have been put
374 : * through expression preprocessing. Callers outside the planner typically
375 : * should use contain_mutable_functions_after_planning() instead, for the
376 : * reasons given there.
377 : *
378 : * We will recursively look into Query nodes (i.e., SubLink sub-selects)
379 : * but not into SubPlans. See comments for contain_volatile_functions().
380 : */
381 : bool
382 167060 : contain_mutable_functions(Node *clause)
383 : {
384 167060 : return contain_mutable_functions_walker(clause, NULL);
385 : }
386 :
387 : static bool
388 121066 : contain_mutable_functions_checker(Oid func_id, void *context)
389 : {
390 121066 : return (func_volatile(func_id) != PROVOLATILE_IMMUTABLE);
391 : }
392 :
393 : static bool
394 437100 : contain_mutable_functions_walker(Node *node, void *context)
395 : {
396 437100 : if (node == NULL)
397 2246 : return false;
398 : /* Check for mutable functions in node itself */
399 434854 : if (check_functions_in_node(node, contain_mutable_functions_checker,
400 : context))
401 6878 : return true;
402 :
403 427976 : if (IsA(node, JsonConstructorExpr))
404 : {
405 0 : const JsonConstructorExpr *ctor = (JsonConstructorExpr *) node;
406 : ListCell *lc;
407 : bool is_jsonb;
408 :
409 0 : is_jsonb = ctor->returning->format->format_type == JS_FORMAT_JSONB;
410 :
411 : /*
412 : * Check argument_type => json[b] conversions specifically. We still
413 : * recurse to check 'args' below, but here we want to specifically
414 : * check whether or not the emitted clause would fail to be immutable
415 : * because of TimeZone, for example.
416 : */
417 0 : foreach(lc, ctor->args)
418 : {
419 0 : Oid typid = exprType(lfirst(lc));
420 :
421 0 : if (is_jsonb ?
422 0 : !to_jsonb_is_immutable(typid) :
423 0 : !to_json_is_immutable(typid))
424 0 : return true;
425 : }
426 :
427 : /* Check all subnodes */
428 : }
429 :
430 427976 : if (IsA(node, JsonExpr))
431 : {
432 234 : JsonExpr *jexpr = castNode(JsonExpr, node);
433 : Const *cnst;
434 :
435 234 : if (!IsA(jexpr->path_spec, Const))
436 0 : return true;
437 :
438 234 : cnst = castNode(Const, jexpr->path_spec);
439 :
440 : Assert(cnst->consttype == JSONPATHOID);
441 234 : if (cnst->constisnull)
442 0 : return false;
443 :
444 234 : if (jspIsMutable(DatumGetJsonPathP(cnst->constvalue),
445 : jexpr->passing_names, jexpr->passing_values))
446 162 : return true;
447 : }
448 :
449 427814 : if (IsA(node, SQLValueFunction))
450 : {
451 : /* all variants of SQLValueFunction are stable */
452 406 : return true;
453 : }
454 :
455 427408 : if (IsA(node, NextValueExpr))
456 : {
457 : /* NextValueExpr is volatile */
458 0 : return true;
459 : }
460 :
461 : /*
462 : * It should be safe to treat MinMaxExpr as immutable, because it will
463 : * depend on a non-cross-type btree comparison function, and those should
464 : * always be immutable. Treating XmlExpr as immutable is more dubious,
465 : * and treating CoerceToDomain as immutable is outright dangerous. But we
466 : * have done so historically, and changing this would probably cause more
467 : * problems than it would fix. In practice, if you have a non-immutable
468 : * domain constraint you are in for pain anyhow.
469 : */
470 :
471 : /* Recurse to check arguments */
472 427408 : if (IsA(node, Query))
473 : {
474 : /* Recurse into subselects */
475 0 : return query_tree_walker((Query *) node,
476 : contain_mutable_functions_walker,
477 : context, 0);
478 : }
479 427408 : return expression_tree_walker(node, contain_mutable_functions_walker,
480 : context);
481 : }
482 :
483 : /*
484 : * contain_mutable_functions_after_planning
485 : * Test whether given expression contains mutable functions.
486 : *
487 : * This is a wrapper for contain_mutable_functions() that is safe to use from
488 : * outside the planner. The difference is that it first runs the expression
489 : * through expression_planner(). There are two key reasons why we need that:
490 : *
491 : * First, function default arguments will get inserted, which may affect
492 : * volatility (consider "default now()").
493 : *
494 : * Second, inline-able functions will get inlined, which may allow us to
495 : * conclude that the function is really less volatile than it's marked.
496 : * As an example, polymorphic functions must be marked with the most volatile
497 : * behavior that they have for any input type, but once we inline the
498 : * function we may be able to conclude that it's not so volatile for the
499 : * particular input type we're dealing with.
500 : */
501 : bool
502 3274 : contain_mutable_functions_after_planning(Expr *expr)
503 : {
504 : /* We assume here that expression_planner() won't scribble on its input */
505 3274 : expr = expression_planner(expr);
506 :
507 : /* Now we can search for non-immutable functions */
508 3274 : return contain_mutable_functions((Node *) expr);
509 : }
510 :
511 :
512 : /*****************************************************************************
513 : * Check clauses for volatile functions
514 : *****************************************************************************/
515 :
516 : /*
517 : * contain_volatile_functions
518 : * Recursively search for volatile functions within a clause.
519 : *
520 : * Returns true if any volatile function (or operator implemented by a
521 : * volatile function) is found. This test prevents, for example,
522 : * invalid conversions of volatile expressions into indexscan quals.
523 : *
524 : * This will give the right answer only for clauses that have been put
525 : * through expression preprocessing. Callers outside the planner typically
526 : * should use contain_volatile_functions_after_planning() instead, for the
527 : * reasons given there.
528 : *
529 : * We will recursively look into Query nodes (i.e., SubLink sub-selects)
530 : * but not into SubPlans. This is a bit odd, but intentional. If we are
531 : * looking at a SubLink, we are probably deciding whether a query tree
532 : * transformation is safe, and a contained sub-select should affect that;
533 : * for example, duplicating a sub-select containing a volatile function
534 : * would be bad. However, once we've got to the stage of having SubPlans,
535 : * subsequent planning need not consider volatility within those, since
536 : * the executor won't change its evaluation rules for a SubPlan based on
537 : * volatility.
538 : *
539 : * For some node types, for example, RestrictInfo and PathTarget, we cache
540 : * whether we found any volatile functions or not and reuse that value in any
541 : * future checks for that node. All of the logic for determining if the
542 : * cached value should be set to VOLATILITY_NOVOLATILE or VOLATILITY_VOLATILE
543 : * belongs in this function. Any code which makes changes to these nodes
544 : * which could change the outcome this function must set the cached value back
545 : * to VOLATILITY_UNKNOWN. That allows this function to redetermine the
546 : * correct value during the next call, should we need to redetermine if the
547 : * node contains any volatile functions again in the future.
548 : */
549 : bool
550 3407228 : contain_volatile_functions(Node *clause)
551 : {
552 3407228 : return contain_volatile_functions_walker(clause, NULL);
553 : }
554 :
555 : static bool
556 919740 : contain_volatile_functions_checker(Oid func_id, void *context)
557 : {
558 919740 : return (func_volatile(func_id) == PROVOLATILE_VOLATILE);
559 : }
560 :
561 : static bool
562 7774374 : contain_volatile_functions_walker(Node *node, void *context)
563 : {
564 7774374 : if (node == NULL)
565 220884 : return false;
566 : /* Check for volatile functions in node itself */
567 7553490 : if (check_functions_in_node(node, contain_volatile_functions_checker,
568 : context))
569 2048 : return true;
570 :
571 7551442 : if (IsA(node, NextValueExpr))
572 : {
573 : /* NextValueExpr is volatile */
574 42 : return true;
575 : }
576 :
577 7551400 : if (IsA(node, RestrictInfo))
578 : {
579 1338774 : RestrictInfo *rinfo = (RestrictInfo *) node;
580 :
581 : /*
582 : * For RestrictInfo, check if we've checked the volatility of it
583 : * before. If so, we can just use the cached value and not bother
584 : * checking it again. Otherwise, check it and cache if whether we
585 : * found any volatile functions.
586 : */
587 1338774 : if (rinfo->has_volatile == VOLATILITY_NOVOLATILE)
588 827210 : return false;
589 511564 : else if (rinfo->has_volatile == VOLATILITY_VOLATILE)
590 80 : return true;
591 : else
592 : {
593 : bool hasvolatile;
594 :
595 511484 : hasvolatile = contain_volatile_functions_walker((Node *) rinfo->clause,
596 : context);
597 511484 : if (hasvolatile)
598 136 : rinfo->has_volatile = VOLATILITY_VOLATILE;
599 : else
600 511348 : rinfo->has_volatile = VOLATILITY_NOVOLATILE;
601 :
602 511484 : return hasvolatile;
603 : }
604 : }
605 :
606 6212626 : if (IsA(node, PathTarget))
607 : {
608 392868 : PathTarget *target = (PathTarget *) node;
609 :
610 : /*
611 : * We also do caching for PathTarget the same as we do above for
612 : * RestrictInfos.
613 : */
614 392868 : if (target->has_volatile_expr == VOLATILITY_NOVOLATILE)
615 325654 : return false;
616 67214 : else if (target->has_volatile_expr == VOLATILITY_VOLATILE)
617 0 : return true;
618 : else
619 : {
620 : bool hasvolatile;
621 :
622 67214 : hasvolatile = contain_volatile_functions_walker((Node *) target->exprs,
623 : context);
624 :
625 67214 : if (hasvolatile)
626 0 : target->has_volatile_expr = VOLATILITY_VOLATILE;
627 : else
628 67214 : target->has_volatile_expr = VOLATILITY_NOVOLATILE;
629 :
630 67214 : return hasvolatile;
631 : }
632 : }
633 :
634 : /*
635 : * See notes in contain_mutable_functions_walker about why we treat
636 : * MinMaxExpr, XmlExpr, and CoerceToDomain as immutable, while
637 : * SQLValueFunction is stable. Hence, none of them are of interest here.
638 : */
639 :
640 : /* Recurse to check arguments */
641 5819758 : if (IsA(node, Query))
642 : {
643 : /* Recurse into subselects */
644 7092 : return query_tree_walker((Query *) node,
645 : contain_volatile_functions_walker,
646 : context, 0);
647 : }
648 5812666 : return expression_tree_walker(node, contain_volatile_functions_walker,
649 : context);
650 : }
651 :
652 : /*
653 : * contain_volatile_functions_after_planning
654 : * Test whether given expression contains volatile functions.
655 : *
656 : * This is a wrapper for contain_volatile_functions() that is safe to use from
657 : * outside the planner. The difference is that it first runs the expression
658 : * through expression_planner(). There are two key reasons why we need that:
659 : *
660 : * First, function default arguments will get inserted, which may affect
661 : * volatility (consider "default random()").
662 : *
663 : * Second, inline-able functions will get inlined, which may allow us to
664 : * conclude that the function is really less volatile than it's marked.
665 : * As an example, polymorphic functions must be marked with the most volatile
666 : * behavior that they have for any input type, but once we inline the
667 : * function we may be able to conclude that it's not so volatile for the
668 : * particular input type we're dealing with.
669 : */
670 : bool
671 0 : contain_volatile_functions_after_planning(Expr *expr)
672 : {
673 : /* We assume here that expression_planner() won't scribble on its input */
674 0 : expr = expression_planner(expr);
675 :
676 : /* Now we can search for volatile functions */
677 0 : return contain_volatile_functions((Node *) expr);
678 : }
679 :
680 : /*
681 : * Special purpose version of contain_volatile_functions() for use in COPY:
682 : * ignore nextval(), but treat all other functions normally.
683 : */
684 : bool
685 252 : contain_volatile_functions_not_nextval(Node *clause)
686 : {
687 252 : return contain_volatile_functions_not_nextval_walker(clause, NULL);
688 : }
689 :
690 : static bool
691 64 : contain_volatile_functions_not_nextval_checker(Oid func_id, void *context)
692 : {
693 104 : return (func_id != F_NEXTVAL &&
694 40 : func_volatile(func_id) == PROVOLATILE_VOLATILE);
695 : }
696 :
697 : static bool
698 312 : contain_volatile_functions_not_nextval_walker(Node *node, void *context)
699 : {
700 312 : if (node == NULL)
701 0 : return false;
702 : /* Check for volatile functions in node itself */
703 312 : if (check_functions_in_node(node,
704 : contain_volatile_functions_not_nextval_checker,
705 : context))
706 6 : return true;
707 :
708 : /*
709 : * See notes in contain_mutable_functions_walker about why we treat
710 : * MinMaxExpr, XmlExpr, and CoerceToDomain as immutable, while
711 : * SQLValueFunction is stable. Hence, none of them are of interest here.
712 : * Also, since we're intentionally ignoring nextval(), presumably we
713 : * should ignore NextValueExpr.
714 : */
715 :
716 : /* Recurse to check arguments */
717 306 : if (IsA(node, Query))
718 : {
719 : /* Recurse into subselects */
720 0 : return query_tree_walker((Query *) node,
721 : contain_volatile_functions_not_nextval_walker,
722 : context, 0);
723 : }
724 306 : return expression_tree_walker(node,
725 : contain_volatile_functions_not_nextval_walker,
726 : context);
727 : }
728 :
729 :
730 : /*****************************************************************************
731 : * Check queries for parallel unsafe and/or restricted constructs
732 : *****************************************************************************/
733 :
734 : /*
735 : * max_parallel_hazard
736 : * Find the worst parallel-hazard level in the given query
737 : *
738 : * Returns the worst function hazard property (the earliest in this list:
739 : * PROPARALLEL_UNSAFE, PROPARALLEL_RESTRICTED, PROPARALLEL_SAFE) that can
740 : * be found in the given parsetree. We use this to find out whether the query
741 : * can be parallelized at all. The caller will also save the result in
742 : * PlannerGlobal so as to short-circuit checks of portions of the querytree
743 : * later, in the common case where everything is SAFE.
744 : */
745 : char
746 340846 : max_parallel_hazard(Query *parse)
747 : {
748 : max_parallel_hazard_context context;
749 :
750 340846 : context.max_hazard = PROPARALLEL_SAFE;
751 340846 : context.max_interesting = PROPARALLEL_UNSAFE;
752 340846 : context.safe_param_ids = NIL;
753 340846 : (void) max_parallel_hazard_walker((Node *) parse, &context);
754 340846 : return context.max_hazard;
755 : }
756 :
757 : /*
758 : * is_parallel_safe
759 : * Detect whether the given expr contains only parallel-safe functions
760 : *
761 : * root->glob->maxParallelHazard must previously have been set to the
762 : * result of max_parallel_hazard() on the whole query.
763 : */
764 : bool
765 2386120 : is_parallel_safe(PlannerInfo *root, Node *node)
766 : {
767 : max_parallel_hazard_context context;
768 : PlannerInfo *proot;
769 : ListCell *l;
770 :
771 : /*
772 : * Even if the original querytree contained nothing unsafe, we need to
773 : * search the expression if we have generated any PARAM_EXEC Params while
774 : * planning, because those are parallel-restricted and there might be one
775 : * in this expression. But otherwise we don't need to look.
776 : */
777 2386120 : if (root->glob->maxParallelHazard == PROPARALLEL_SAFE &&
778 1438364 : root->glob->paramExecTypes == NIL)
779 1405746 : return true;
780 : /* Else use max_parallel_hazard's search logic, but stop on RESTRICTED */
781 980374 : context.max_hazard = PROPARALLEL_SAFE;
782 980374 : context.max_interesting = PROPARALLEL_RESTRICTED;
783 980374 : context.safe_param_ids = NIL;
784 :
785 : /*
786 : * The params that refer to the same or parent query level are considered
787 : * parallel-safe. The idea is that we compute such params at Gather or
788 : * Gather Merge node and pass their value to workers.
789 : */
790 2352818 : for (proot = root; proot != NULL; proot = proot->parent_root)
791 : {
792 1448258 : foreach(l, proot->init_plans)
793 : {
794 75814 : SubPlan *initsubplan = (SubPlan *) lfirst(l);
795 :
796 75814 : context.safe_param_ids = list_concat(context.safe_param_ids,
797 75814 : initsubplan->setParam);
798 : }
799 : }
800 :
801 980374 : return !max_parallel_hazard_walker(node, &context);
802 : }
803 :
804 : /* core logic for all parallel-hazard checks */
805 : static bool
806 1601384 : max_parallel_hazard_test(char proparallel, max_parallel_hazard_context *context)
807 : {
808 1601384 : switch (proparallel)
809 : {
810 1315416 : case PROPARALLEL_SAFE:
811 : /* nothing to see here, move along */
812 1315416 : break;
813 207820 : case PROPARALLEL_RESTRICTED:
814 : /* increase max_hazard to RESTRICTED */
815 : Assert(context->max_hazard != PROPARALLEL_UNSAFE);
816 207820 : context->max_hazard = proparallel;
817 : /* done if we are not expecting any unsafe functions */
818 207820 : if (context->max_interesting == proparallel)
819 105112 : return true;
820 102708 : break;
821 78148 : case PROPARALLEL_UNSAFE:
822 78148 : context->max_hazard = proparallel;
823 : /* we're always done at the first unsafe construct */
824 78148 : return true;
825 0 : default:
826 0 : elog(ERROR, "unrecognized proparallel value \"%c\"", proparallel);
827 : break;
828 : }
829 1418124 : return false;
830 : }
831 :
832 : /* check_functions_in_node callback */
833 : static bool
834 1463388 : max_parallel_hazard_checker(Oid func_id, void *context)
835 : {
836 1463388 : return max_parallel_hazard_test(func_parallel(func_id),
837 : (max_parallel_hazard_context *) context);
838 : }
839 :
840 : static bool
841 20799468 : max_parallel_hazard_walker(Node *node, max_parallel_hazard_context *context)
842 : {
843 20799468 : if (node == NULL)
844 5566634 : return false;
845 :
846 : /* Check for hazardous functions in node itself */
847 15232834 : if (check_functions_in_node(node, max_parallel_hazard_checker,
848 : context))
849 106916 : return true;
850 :
851 : /*
852 : * It should be OK to treat MinMaxExpr as parallel-safe, since btree
853 : * opclass support functions are generally parallel-safe. XmlExpr is a
854 : * bit more dubious but we can probably get away with it. We err on the
855 : * side of caution by treating CoerceToDomain as parallel-restricted.
856 : * (Note: in principle that's wrong because a domain constraint could
857 : * contain a parallel-unsafe function; but useful constraints probably
858 : * never would have such, and assuming they do would cripple use of
859 : * parallel query in the presence of domain types.) SQLValueFunction
860 : * should be safe in all cases. NextValueExpr is parallel-unsafe.
861 : */
862 15125918 : if (IsA(node, CoerceToDomain))
863 : {
864 19554 : if (max_parallel_hazard_test(PROPARALLEL_RESTRICTED, context))
865 6310 : return true;
866 : }
867 :
868 15106364 : else if (IsA(node, NextValueExpr))
869 : {
870 368 : if (max_parallel_hazard_test(PROPARALLEL_UNSAFE, context))
871 368 : return true;
872 : }
873 :
874 : /*
875 : * Treat window functions as parallel-restricted because we aren't sure
876 : * whether the input row ordering is fully deterministic, and the output
877 : * of window functions might vary across workers if not. (In some cases,
878 : * like where the window frame orders by a primary key, we could relax
879 : * this restriction. But it doesn't currently seem worth expending extra
880 : * effort to do so.)
881 : */
882 15105996 : else if (IsA(node, WindowFunc))
883 : {
884 6060 : if (max_parallel_hazard_test(PROPARALLEL_RESTRICTED, context))
885 2648 : return true;
886 : }
887 :
888 : /*
889 : * As a notational convenience for callers, look through RestrictInfo.
890 : */
891 15099936 : else if (IsA(node, RestrictInfo))
892 : {
893 249228 : RestrictInfo *rinfo = (RestrictInfo *) node;
894 :
895 249228 : return max_parallel_hazard_walker((Node *) rinfo->clause, context);
896 : }
897 :
898 : /*
899 : * Really we should not see SubLink during a max_interesting == restricted
900 : * scan, but if we do, return true.
901 : */
902 14850708 : else if (IsA(node, SubLink))
903 : {
904 40176 : if (max_parallel_hazard_test(PROPARALLEL_RESTRICTED, context))
905 0 : return true;
906 : }
907 :
908 : /*
909 : * Only parallel-safe SubPlans can be sent to workers. Within the
910 : * testexpr of the SubPlan, Params representing the output columns of the
911 : * subplan can be treated as parallel-safe, so temporarily add their IDs
912 : * to the safe_param_ids list while examining the testexpr.
913 : */
914 14810532 : else if (IsA(node, SubPlan))
915 : {
916 30896 : SubPlan *subplan = (SubPlan *) node;
917 : List *save_safe_param_ids;
918 :
919 61462 : if (!subplan->parallel_safe &&
920 30566 : max_parallel_hazard_test(PROPARALLEL_RESTRICTED, context))
921 30566 : return true;
922 330 : save_safe_param_ids = context->safe_param_ids;
923 660 : context->safe_param_ids = list_concat_copy(context->safe_param_ids,
924 330 : subplan->paramIds);
925 330 : if (max_parallel_hazard_walker(subplan->testexpr, context))
926 6 : return true; /* no need to restore safe_param_ids */
927 324 : list_free(context->safe_param_ids);
928 324 : context->safe_param_ids = save_safe_param_ids;
929 : /* we must also check args, but no special Param treatment there */
930 324 : if (max_parallel_hazard_walker((Node *) subplan->args, context))
931 0 : return true;
932 : /* don't want to recurse normally, so we're done */
933 324 : return false;
934 : }
935 :
936 : /*
937 : * We can't pass Params to workers at the moment either, so they are also
938 : * parallel-restricted, unless they are PARAM_EXTERN Params or are
939 : * PARAM_EXEC Params listed in safe_param_ids, meaning they could be
940 : * either generated within workers or can be computed by the leader and
941 : * then their value can be passed to workers.
942 : */
943 14779636 : else if (IsA(node, Param))
944 : {
945 108404 : Param *param = (Param *) node;
946 :
947 108404 : if (param->paramkind == PARAM_EXTERN)
948 56466 : return false;
949 :
950 51938 : if (param->paramkind != PARAM_EXEC ||
951 47052 : !list_member_int(context->safe_param_ids, param->paramid))
952 : {
953 41272 : if (max_parallel_hazard_test(PROPARALLEL_RESTRICTED, context))
954 36452 : return true;
955 : }
956 15486 : return false; /* nothing to recurse to */
957 : }
958 :
959 : /*
960 : * When we're first invoked on a completely unplanned tree, we must
961 : * recurse into subqueries so to as to locate parallel-unsafe constructs
962 : * anywhere in the tree.
963 : */
964 14671232 : else if (IsA(node, Query))
965 : {
966 440080 : Query *query = (Query *) node;
967 :
968 : /* SELECT FOR UPDATE/SHARE must be treated as unsafe */
969 440080 : if (query->rowMarks != NULL)
970 : {
971 1844 : context->max_hazard = PROPARALLEL_UNSAFE;
972 1844 : return true;
973 : }
974 :
975 : /* Recurse into subselects */
976 438236 : return query_tree_walker(query,
977 : max_parallel_hazard_walker,
978 : context, 0);
979 : }
980 :
981 : /* Recurse to check arguments */
982 14287984 : return expression_tree_walker(node,
983 : max_parallel_hazard_walker,
984 : context);
985 : }
986 :
987 :
988 : /*****************************************************************************
989 : * Check clauses for nonstrict functions
990 : *****************************************************************************/
991 :
992 : /*
993 : * contain_nonstrict_functions
994 : * Recursively search for nonstrict functions within a clause.
995 : *
996 : * Returns true if any nonstrict construct is found --- ie, anything that
997 : * could produce non-NULL output with a NULL input.
998 : *
999 : * The idea here is that the caller has verified that the expression contains
1000 : * one or more Var or Param nodes (as appropriate for the caller's need), and
1001 : * now wishes to prove that the expression result will be NULL if any of these
1002 : * inputs is NULL. If we return false, then the proof succeeded.
1003 : */
1004 : bool
1005 2368 : contain_nonstrict_functions(Node *clause)
1006 : {
1007 2368 : return contain_nonstrict_functions_walker(clause, NULL);
1008 : }
1009 :
1010 : static bool
1011 2446 : contain_nonstrict_functions_checker(Oid func_id, void *context)
1012 : {
1013 2446 : return !func_strict(func_id);
1014 : }
1015 :
1016 : static bool
1017 8264 : contain_nonstrict_functions_walker(Node *node, void *context)
1018 : {
1019 8264 : if (node == NULL)
1020 0 : return false;
1021 8264 : if (IsA(node, Aggref))
1022 : {
1023 : /* an aggregate could return non-null with null input */
1024 0 : return true;
1025 : }
1026 8264 : if (IsA(node, GroupingFunc))
1027 : {
1028 : /*
1029 : * A GroupingFunc doesn't evaluate its arguments, and therefore must
1030 : * be treated as nonstrict.
1031 : */
1032 0 : return true;
1033 : }
1034 8264 : if (IsA(node, WindowFunc))
1035 : {
1036 : /* a window function could return non-null with null input */
1037 0 : return true;
1038 : }
1039 8264 : if (IsA(node, SubscriptingRef))
1040 : {
1041 0 : SubscriptingRef *sbsref = (SubscriptingRef *) node;
1042 : const SubscriptRoutines *sbsroutines;
1043 :
1044 : /* Subscripting assignment is always presumed nonstrict */
1045 0 : if (sbsref->refassgnexpr != NULL)
1046 0 : return true;
1047 : /* Otherwise we must look up the subscripting support methods */
1048 0 : sbsroutines = getSubscriptingRoutines(sbsref->refcontainertype, NULL);
1049 0 : if (!(sbsroutines && sbsroutines->fetch_strict))
1050 0 : return true;
1051 : /* else fall through to check args */
1052 : }
1053 8264 : if (IsA(node, DistinctExpr))
1054 : {
1055 : /* IS DISTINCT FROM is inherently non-strict */
1056 0 : return true;
1057 : }
1058 8264 : if (IsA(node, NullIfExpr))
1059 : {
1060 : /* NULLIF is inherently non-strict */
1061 0 : return true;
1062 : }
1063 8264 : if (IsA(node, BoolExpr))
1064 : {
1065 18 : BoolExpr *expr = (BoolExpr *) node;
1066 :
1067 18 : switch (expr->boolop)
1068 : {
1069 18 : case AND_EXPR:
1070 : case OR_EXPR:
1071 : /* AND, OR are inherently non-strict */
1072 18 : return true;
1073 0 : default:
1074 0 : break;
1075 : }
1076 : }
1077 8246 : if (IsA(node, SubLink))
1078 : {
1079 : /* In some cases a sublink might be strict, but in general not */
1080 12 : return true;
1081 : }
1082 8234 : if (IsA(node, SubPlan))
1083 0 : return true;
1084 8234 : if (IsA(node, AlternativeSubPlan))
1085 0 : return true;
1086 8234 : if (IsA(node, FieldStore))
1087 0 : return true;
1088 8234 : if (IsA(node, CoerceViaIO))
1089 : {
1090 : /*
1091 : * CoerceViaIO is strict regardless of whether the I/O functions are,
1092 : * so just go look at its argument; asking check_functions_in_node is
1093 : * useless expense and could deliver the wrong answer.
1094 : */
1095 1068 : return contain_nonstrict_functions_walker((Node *) ((CoerceViaIO *) node)->arg,
1096 : context);
1097 : }
1098 7166 : if (IsA(node, ArrayCoerceExpr))
1099 : {
1100 : /*
1101 : * ArrayCoerceExpr is strict at the array level, regardless of what
1102 : * the per-element expression is; so we should ignore elemexpr and
1103 : * recurse only into the arg.
1104 : */
1105 0 : return contain_nonstrict_functions_walker((Node *) ((ArrayCoerceExpr *) node)->arg,
1106 : context);
1107 : }
1108 7166 : if (IsA(node, CaseExpr))
1109 64 : return true;
1110 7102 : if (IsA(node, ArrayExpr))
1111 0 : return true;
1112 7102 : if (IsA(node, RowExpr))
1113 4 : return true;
1114 7098 : if (IsA(node, RowCompareExpr))
1115 0 : return true;
1116 7098 : if (IsA(node, CoalesceExpr))
1117 254 : return true;
1118 6844 : if (IsA(node, MinMaxExpr))
1119 60 : return true;
1120 6784 : if (IsA(node, XmlExpr))
1121 0 : return true;
1122 6784 : if (IsA(node, NullTest))
1123 24 : return true;
1124 6760 : if (IsA(node, BooleanTest))
1125 0 : return true;
1126 6760 : if (IsA(node, JsonConstructorExpr))
1127 12 : return true;
1128 :
1129 : /* Check other function-containing nodes */
1130 6748 : if (check_functions_in_node(node, contain_nonstrict_functions_checker,
1131 : context))
1132 0 : return true;
1133 :
1134 6748 : return expression_tree_walker(node, contain_nonstrict_functions_walker,
1135 : context);
1136 : }
1137 :
1138 : /*****************************************************************************
1139 : * Check clauses for Params
1140 : *****************************************************************************/
1141 :
1142 : /*
1143 : * contain_exec_param
1144 : * Recursively search for PARAM_EXEC Params within a clause.
1145 : *
1146 : * Returns true if the clause contains any PARAM_EXEC Param with a paramid
1147 : * appearing in the given list of Param IDs. Does not descend into
1148 : * subqueries!
1149 : */
1150 : bool
1151 2992 : contain_exec_param(Node *clause, List *param_ids)
1152 : {
1153 2992 : return contain_exec_param_walker(clause, param_ids);
1154 : }
1155 :
1156 : static bool
1157 3280 : contain_exec_param_walker(Node *node, List *param_ids)
1158 : {
1159 3280 : if (node == NULL)
1160 36 : return false;
1161 3244 : if (IsA(node, Param))
1162 : {
1163 12 : Param *p = (Param *) node;
1164 :
1165 24 : if (p->paramkind == PARAM_EXEC &&
1166 12 : list_member_int(param_ids, p->paramid))
1167 12 : return true;
1168 : }
1169 3232 : return expression_tree_walker(node, contain_exec_param_walker, param_ids);
1170 : }
1171 :
1172 : /*****************************************************************************
1173 : * Check clauses for context-dependent nodes
1174 : *****************************************************************************/
1175 :
1176 : /*
1177 : * contain_context_dependent_node
1178 : * Recursively search for context-dependent nodes within a clause.
1179 : *
1180 : * CaseTestExpr nodes must appear directly within the corresponding CaseExpr,
1181 : * not nested within another one, or they'll see the wrong test value. If one
1182 : * appears "bare" in the arguments of a SQL function, then we can't inline the
1183 : * SQL function for fear of creating such a situation. The same applies for
1184 : * CaseTestExpr used within the elemexpr of an ArrayCoerceExpr.
1185 : *
1186 : * CoerceToDomainValue would have the same issue if domain CHECK expressions
1187 : * could get inlined into larger expressions, but presently that's impossible.
1188 : * Still, it might be allowed in future, or other node types with similar
1189 : * issues might get invented. So give this function a generic name, and set
1190 : * up the recursion state to allow multiple flag bits.
1191 : */
1192 : static bool
1193 3248 : contain_context_dependent_node(Node *clause)
1194 : {
1195 3248 : int flags = 0;
1196 :
1197 3248 : return contain_context_dependent_node_walker(clause, &flags);
1198 : }
1199 :
1200 : #define CCDN_CASETESTEXPR_OK 0x0001 /* CaseTestExpr okay here? */
1201 :
1202 : static bool
1203 9888 : contain_context_dependent_node_walker(Node *node, int *flags)
1204 : {
1205 9888 : if (node == NULL)
1206 194 : return false;
1207 9694 : if (IsA(node, CaseTestExpr))
1208 6 : return !(*flags & CCDN_CASETESTEXPR_OK);
1209 9688 : else if (IsA(node, CaseExpr))
1210 : {
1211 0 : CaseExpr *caseexpr = (CaseExpr *) node;
1212 :
1213 : /*
1214 : * If this CASE doesn't have a test expression, then it doesn't create
1215 : * a context in which CaseTestExprs should appear, so just fall
1216 : * through and treat it as a generic expression node.
1217 : */
1218 0 : if (caseexpr->arg)
1219 : {
1220 0 : int save_flags = *flags;
1221 : bool res;
1222 :
1223 : /*
1224 : * Note: in principle, we could distinguish the various sub-parts
1225 : * of a CASE construct and set the flag bit only for some of them,
1226 : * since we are only expecting CaseTestExprs to appear in the
1227 : * "expr" subtree of the CaseWhen nodes. But it doesn't really
1228 : * seem worth any extra code. If there are any bare CaseTestExprs
1229 : * elsewhere in the CASE, something's wrong already.
1230 : */
1231 0 : *flags |= CCDN_CASETESTEXPR_OK;
1232 0 : res = expression_tree_walker(node,
1233 : contain_context_dependent_node_walker,
1234 : flags);
1235 0 : *flags = save_flags;
1236 0 : return res;
1237 : }
1238 : }
1239 9688 : else if (IsA(node, ArrayCoerceExpr))
1240 : {
1241 0 : ArrayCoerceExpr *ac = (ArrayCoerceExpr *) node;
1242 : int save_flags;
1243 : bool res;
1244 :
1245 : /* Check the array expression */
1246 0 : if (contain_context_dependent_node_walker((Node *) ac->arg, flags))
1247 0 : return true;
1248 :
1249 : /* Check the elemexpr, which is allowed to contain CaseTestExpr */
1250 0 : save_flags = *flags;
1251 0 : *flags |= CCDN_CASETESTEXPR_OK;
1252 0 : res = contain_context_dependent_node_walker((Node *) ac->elemexpr,
1253 : flags);
1254 0 : *flags = save_flags;
1255 0 : return res;
1256 : }
1257 9688 : return expression_tree_walker(node, contain_context_dependent_node_walker,
1258 : flags);
1259 : }
1260 :
1261 : /*****************************************************************************
1262 : * Check clauses for Vars passed to non-leakproof functions
1263 : *****************************************************************************/
1264 :
1265 : /*
1266 : * contain_leaked_vars
1267 : * Recursively scan a clause to discover whether it contains any Var
1268 : * nodes (of the current query level) that are passed as arguments to
1269 : * leaky functions.
1270 : *
1271 : * Returns true if the clause contains any non-leakproof functions that are
1272 : * passed Var nodes of the current query level, and which might therefore leak
1273 : * data. Such clauses must be applied after any lower-level security barrier
1274 : * clauses.
1275 : */
1276 : bool
1277 6256 : contain_leaked_vars(Node *clause)
1278 : {
1279 6256 : return contain_leaked_vars_walker(clause, NULL);
1280 : }
1281 :
1282 : static bool
1283 6228 : contain_leaked_vars_checker(Oid func_id, void *context)
1284 : {
1285 6228 : return !get_func_leakproof(func_id);
1286 : }
1287 :
1288 : static bool
1289 13318 : contain_leaked_vars_walker(Node *node, void *context)
1290 : {
1291 13318 : if (node == NULL)
1292 0 : return false;
1293 :
1294 13318 : switch (nodeTag(node))
1295 : {
1296 7018 : case T_Var:
1297 : case T_Const:
1298 : case T_Param:
1299 : case T_ArrayExpr:
1300 : case T_FieldSelect:
1301 : case T_FieldStore:
1302 : case T_NamedArgExpr:
1303 : case T_BoolExpr:
1304 : case T_RelabelType:
1305 : case T_CollateExpr:
1306 : case T_CaseExpr:
1307 : case T_CaseTestExpr:
1308 : case T_RowExpr:
1309 : case T_SQLValueFunction:
1310 : case T_NullTest:
1311 : case T_BooleanTest:
1312 : case T_NextValueExpr:
1313 : case T_ReturningExpr:
1314 : case T_List:
1315 :
1316 : /*
1317 : * We know these node types don't contain function calls; but
1318 : * something further down in the node tree might.
1319 : */
1320 7018 : break;
1321 :
1322 6228 : case T_FuncExpr:
1323 : case T_OpExpr:
1324 : case T_DistinctExpr:
1325 : case T_NullIfExpr:
1326 : case T_ScalarArrayOpExpr:
1327 : case T_CoerceViaIO:
1328 : case T_ArrayCoerceExpr:
1329 :
1330 : /*
1331 : * If node contains a leaky function call, and there's any Var
1332 : * underneath it, reject.
1333 : */
1334 6228 : if (check_functions_in_node(node, contain_leaked_vars_checker,
1335 2702 : context) &&
1336 2702 : contain_var_clause(node))
1337 2646 : return true;
1338 3582 : break;
1339 :
1340 0 : case T_SubscriptingRef:
1341 : {
1342 0 : SubscriptingRef *sbsref = (SubscriptingRef *) node;
1343 : const SubscriptRoutines *sbsroutines;
1344 :
1345 : /* Consult the subscripting support method info */
1346 0 : sbsroutines = getSubscriptingRoutines(sbsref->refcontainertype,
1347 : NULL);
1348 0 : if (!sbsroutines ||
1349 0 : !(sbsref->refassgnexpr != NULL ?
1350 0 : sbsroutines->store_leakproof :
1351 0 : sbsroutines->fetch_leakproof))
1352 : {
1353 : /* Node is leaky, so reject if it contains Vars */
1354 0 : if (contain_var_clause(node))
1355 0 : return true;
1356 : }
1357 : }
1358 0 : break;
1359 :
1360 0 : case T_RowCompareExpr:
1361 : {
1362 : /*
1363 : * It's worth special-casing this because a leaky comparison
1364 : * function only compromises one pair of row elements, which
1365 : * might not contain Vars while others do.
1366 : */
1367 0 : RowCompareExpr *rcexpr = (RowCompareExpr *) node;
1368 : ListCell *opid;
1369 : ListCell *larg;
1370 : ListCell *rarg;
1371 :
1372 0 : forthree(opid, rcexpr->opnos,
1373 : larg, rcexpr->largs,
1374 : rarg, rcexpr->rargs)
1375 : {
1376 0 : Oid funcid = get_opcode(lfirst_oid(opid));
1377 :
1378 0 : if (!get_func_leakproof(funcid) &&
1379 0 : (contain_var_clause((Node *) lfirst(larg)) ||
1380 0 : contain_var_clause((Node *) lfirst(rarg))))
1381 0 : return true;
1382 : }
1383 : }
1384 0 : break;
1385 :
1386 0 : case T_MinMaxExpr:
1387 : {
1388 : /*
1389 : * MinMaxExpr is leakproof if the comparison function it calls
1390 : * is leakproof.
1391 : */
1392 0 : MinMaxExpr *minmaxexpr = (MinMaxExpr *) node;
1393 : TypeCacheEntry *typentry;
1394 : bool leakproof;
1395 :
1396 : /* Look up the btree comparison function for the datatype */
1397 0 : typentry = lookup_type_cache(minmaxexpr->minmaxtype,
1398 : TYPECACHE_CMP_PROC);
1399 0 : if (OidIsValid(typentry->cmp_proc))
1400 0 : leakproof = get_func_leakproof(typentry->cmp_proc);
1401 : else
1402 : {
1403 : /*
1404 : * The executor will throw an error, but here we just
1405 : * treat the missing function as leaky.
1406 : */
1407 0 : leakproof = false;
1408 : }
1409 :
1410 0 : if (!leakproof &&
1411 0 : contain_var_clause((Node *) minmaxexpr->args))
1412 0 : return true;
1413 : }
1414 0 : break;
1415 :
1416 42 : case T_CurrentOfExpr:
1417 :
1418 : /*
1419 : * WHERE CURRENT OF doesn't contain leaky function calls.
1420 : * Moreover, it is essential that this is considered non-leaky,
1421 : * since the planner must always generate a TID scan when CURRENT
1422 : * OF is present -- cf. cost_tidscan.
1423 : */
1424 42 : return false;
1425 :
1426 30 : default:
1427 :
1428 : /*
1429 : * If we don't recognize the node tag, assume it might be leaky.
1430 : * This prevents an unexpected security hole if someone adds a new
1431 : * node type that can call a function.
1432 : */
1433 30 : return true;
1434 : }
1435 10600 : return expression_tree_walker(node, contain_leaked_vars_walker,
1436 : context);
1437 : }
1438 :
1439 : /*
1440 : * find_nonnullable_rels
1441 : * Determine which base rels are forced nonnullable by given clause.
1442 : *
1443 : * Returns the set of all Relids that are referenced in the clause in such
1444 : * a way that the clause cannot possibly return TRUE if any of these Relids
1445 : * is an all-NULL row. (It is OK to err on the side of conservatism; hence
1446 : * the analysis here is simplistic.)
1447 : *
1448 : * The semantics here are subtly different from contain_nonstrict_functions:
1449 : * that function is concerned with NULL results from arbitrary expressions,
1450 : * but here we assume that the input is a Boolean expression, and wish to
1451 : * see if NULL inputs will provably cause a FALSE-or-NULL result. We expect
1452 : * the expression to have been AND/OR flattened and converted to implicit-AND
1453 : * format.
1454 : *
1455 : * Note: this function is largely duplicative of find_nonnullable_vars().
1456 : * The reason not to simplify this function into a thin wrapper around
1457 : * find_nonnullable_vars() is that the tested conditions really are different:
1458 : * a clause like "t1.v1 IS NOT NULL OR t1.v2 IS NOT NULL" does not prove
1459 : * that either v1 or v2 can't be NULL, but it does prove that the t1 row
1460 : * as a whole can't be all-NULL. Also, the behavior for PHVs is different.
1461 : *
1462 : * top_level is true while scanning top-level AND/OR structure; here, showing
1463 : * the result is either FALSE or NULL is good enough. top_level is false when
1464 : * we have descended below a NOT or a strict function: now we must be able to
1465 : * prove that the subexpression goes to NULL.
1466 : *
1467 : * We don't use expression_tree_walker here because we don't want to descend
1468 : * through very many kinds of nodes; only the ones we can be sure are strict.
1469 : */
1470 : Relids
1471 103362 : find_nonnullable_rels(Node *clause)
1472 : {
1473 103362 : return find_nonnullable_rels_walker(clause, true);
1474 : }
1475 :
1476 : static Relids
1477 672890 : find_nonnullable_rels_walker(Node *node, bool top_level)
1478 : {
1479 672890 : Relids result = NULL;
1480 : ListCell *l;
1481 :
1482 672890 : if (node == NULL)
1483 6492 : return NULL;
1484 666398 : if (IsA(node, Var))
1485 : {
1486 215166 : Var *var = (Var *) node;
1487 :
1488 215166 : if (var->varlevelsup == 0)
1489 215166 : result = bms_make_singleton(var->varno);
1490 : }
1491 451232 : else if (IsA(node, List))
1492 : {
1493 : /*
1494 : * At top level, we are examining an implicit-AND list: if any of the
1495 : * arms produces FALSE-or-NULL then the result is FALSE-or-NULL. If
1496 : * not at top level, we are examining the arguments of a strict
1497 : * function: if any of them produce NULL then the result of the
1498 : * function must be NULL. So in both cases, the set of nonnullable
1499 : * rels is the union of those found in the arms, and we pass down the
1500 : * top_level flag unmodified.
1501 : */
1502 650808 : foreach(l, (List *) node)
1503 : {
1504 413168 : result = bms_join(result,
1505 413168 : find_nonnullable_rels_walker(lfirst(l),
1506 : top_level));
1507 : }
1508 : }
1509 213592 : else if (IsA(node, FuncExpr))
1510 : {
1511 7198 : FuncExpr *expr = (FuncExpr *) node;
1512 :
1513 7198 : if (func_strict(expr->funcid))
1514 7006 : result = find_nonnullable_rels_walker((Node *) expr->args, false);
1515 : }
1516 206394 : else if (IsA(node, OpExpr))
1517 : {
1518 121152 : OpExpr *expr = (OpExpr *) node;
1519 :
1520 121152 : set_opfuncid(expr);
1521 121152 : if (func_strict(expr->opfuncid))
1522 121152 : result = find_nonnullable_rels_walker((Node *) expr->args, false);
1523 : }
1524 85242 : else if (IsA(node, ScalarArrayOpExpr))
1525 : {
1526 8902 : ScalarArrayOpExpr *expr = (ScalarArrayOpExpr *) node;
1527 :
1528 8902 : if (is_strict_saop(expr, true))
1529 8902 : result = find_nonnullable_rels_walker((Node *) expr->args, false);
1530 : }
1531 76340 : else if (IsA(node, BoolExpr))
1532 : {
1533 7596 : BoolExpr *expr = (BoolExpr *) node;
1534 :
1535 7596 : switch (expr->boolop)
1536 : {
1537 464 : case AND_EXPR:
1538 : /* At top level we can just recurse (to the List case) */
1539 464 : if (top_level)
1540 : {
1541 464 : result = find_nonnullable_rels_walker((Node *) expr->args,
1542 : top_level);
1543 464 : break;
1544 : }
1545 :
1546 : /*
1547 : * Below top level, even if one arm produces NULL, the result
1548 : * could be FALSE (hence not NULL). However, if *all* the
1549 : * arms produce NULL then the result is NULL, so we can take
1550 : * the intersection of the sets of nonnullable rels, just as
1551 : * for OR. Fall through to share code.
1552 : */
1553 : /* FALL THRU */
1554 : case OR_EXPR:
1555 :
1556 : /*
1557 : * OR is strict if all of its arms are, so we can take the
1558 : * intersection of the sets of nonnullable rels for each arm.
1559 : * This works for both values of top_level.
1560 : */
1561 8836 : foreach(l, expr->args)
1562 : {
1563 : Relids subresult;
1564 :
1565 7708 : subresult = find_nonnullable_rels_walker(lfirst(l),
1566 : top_level);
1567 7708 : if (result == NULL) /* first subresult? */
1568 3886 : result = subresult;
1569 : else
1570 3822 : result = bms_int_members(result, subresult);
1571 :
1572 : /*
1573 : * If the intersection is empty, we can stop looking. This
1574 : * also justifies the test for first-subresult above.
1575 : */
1576 7708 : if (bms_is_empty(result))
1577 2758 : break;
1578 : }
1579 3886 : break;
1580 3246 : case NOT_EXPR:
1581 : /* NOT will return null if its arg is null */
1582 3246 : result = find_nonnullable_rels_walker((Node *) expr->args,
1583 : false);
1584 3246 : break;
1585 0 : default:
1586 0 : elog(ERROR, "unrecognized boolop: %d", (int) expr->boolop);
1587 : break;
1588 : }
1589 : }
1590 68744 : else if (IsA(node, RelabelType))
1591 : {
1592 4140 : RelabelType *expr = (RelabelType *) node;
1593 :
1594 4140 : result = find_nonnullable_rels_walker((Node *) expr->arg, top_level);
1595 : }
1596 64604 : else if (IsA(node, CoerceViaIO))
1597 : {
1598 : /* not clear this is useful, but it can't hurt */
1599 202 : CoerceViaIO *expr = (CoerceViaIO *) node;
1600 :
1601 202 : result = find_nonnullable_rels_walker((Node *) expr->arg, top_level);
1602 : }
1603 64402 : else if (IsA(node, ArrayCoerceExpr))
1604 : {
1605 : /* ArrayCoerceExpr is strict at the array level; ignore elemexpr */
1606 0 : ArrayCoerceExpr *expr = (ArrayCoerceExpr *) node;
1607 :
1608 0 : result = find_nonnullable_rels_walker((Node *) expr->arg, top_level);
1609 : }
1610 64402 : else if (IsA(node, ConvertRowtypeExpr))
1611 : {
1612 : /* not clear this is useful, but it can't hurt */
1613 0 : ConvertRowtypeExpr *expr = (ConvertRowtypeExpr *) node;
1614 :
1615 0 : result = find_nonnullable_rels_walker((Node *) expr->arg, top_level);
1616 : }
1617 64402 : else if (IsA(node, CollateExpr))
1618 : {
1619 0 : CollateExpr *expr = (CollateExpr *) node;
1620 :
1621 0 : result = find_nonnullable_rels_walker((Node *) expr->arg, top_level);
1622 : }
1623 64402 : else if (IsA(node, NullTest))
1624 : {
1625 : /* IS NOT NULL can be considered strict, but only at top level */
1626 4648 : NullTest *expr = (NullTest *) node;
1627 :
1628 4648 : if (top_level && expr->nulltesttype == IS_NOT_NULL && !expr->argisrow)
1629 2870 : result = find_nonnullable_rels_walker((Node *) expr->arg, false);
1630 : }
1631 59754 : else if (IsA(node, BooleanTest))
1632 : {
1633 : /* Boolean tests that reject NULL are strict at top level */
1634 102 : BooleanTest *expr = (BooleanTest *) node;
1635 :
1636 102 : if (top_level &&
1637 102 : (expr->booltesttype == IS_TRUE ||
1638 102 : expr->booltesttype == IS_FALSE ||
1639 6 : expr->booltesttype == IS_NOT_UNKNOWN))
1640 96 : result = find_nonnullable_rels_walker((Node *) expr->arg, false);
1641 : }
1642 59652 : else if (IsA(node, SubPlan))
1643 : {
1644 124 : SubPlan *splan = (SubPlan *) node;
1645 :
1646 : /*
1647 : * For some types of SubPlan, we can infer strictness from Vars in the
1648 : * testexpr (the LHS of the original SubLink).
1649 : *
1650 : * For ANY_SUBLINK, if the subquery produces zero rows, the result is
1651 : * always FALSE. If the subquery produces more than one row, the
1652 : * per-row results of the testexpr are combined using OR semantics.
1653 : * Hence ANY_SUBLINK can be strict only at top level, but there it's
1654 : * as strict as the testexpr is.
1655 : *
1656 : * For ROWCOMPARE_SUBLINK, if the subquery produces zero rows, the
1657 : * result is always NULL. Otherwise, the result is as strict as the
1658 : * testexpr is. So we can check regardless of top_level.
1659 : *
1660 : * We can't prove anything for other sublink types (in particular,
1661 : * note that ALL_SUBLINK will return TRUE if the subquery is empty).
1662 : */
1663 124 : if ((top_level && splan->subLinkType == ANY_SUBLINK) ||
1664 82 : splan->subLinkType == ROWCOMPARE_SUBLINK)
1665 42 : result = find_nonnullable_rels_walker(splan->testexpr, top_level);
1666 : }
1667 59528 : else if (IsA(node, PlaceHolderVar))
1668 : {
1669 532 : PlaceHolderVar *phv = (PlaceHolderVar *) node;
1670 :
1671 : /*
1672 : * If the contained expression forces any rels non-nullable, so does
1673 : * the PHV.
1674 : */
1675 532 : result = find_nonnullable_rels_walker((Node *) phv->phexpr, top_level);
1676 :
1677 : /*
1678 : * If the PHV's syntactic scope is exactly one rel, it will be forced
1679 : * to be evaluated at that rel, and so it will behave like a Var of
1680 : * that rel: if the rel's entire output goes to null, so will the PHV.
1681 : * (If the syntactic scope is a join, we know that the PHV will go to
1682 : * null if the whole join does; but that is AND semantics while we
1683 : * need OR semantics for find_nonnullable_rels' result, so we can't do
1684 : * anything with the knowledge.)
1685 : */
1686 1064 : if (phv->phlevelsup == 0 &&
1687 532 : bms_membership(phv->phrels) == BMS_SINGLETON)
1688 340 : result = bms_add_members(result, phv->phrels);
1689 : }
1690 666398 : return result;
1691 : }
1692 :
1693 : /*
1694 : * find_nonnullable_vars
1695 : * Determine which Vars are forced nonnullable by given clause.
1696 : *
1697 : * Returns the set of all level-zero Vars that are referenced in the clause in
1698 : * such a way that the clause cannot possibly return TRUE if any of these Vars
1699 : * is NULL. (It is OK to err on the side of conservatism; hence the analysis
1700 : * here is simplistic.)
1701 : *
1702 : * The semantics here are subtly different from contain_nonstrict_functions:
1703 : * that function is concerned with NULL results from arbitrary expressions,
1704 : * but here we assume that the input is a Boolean expression, and wish to
1705 : * see if NULL inputs will provably cause a FALSE-or-NULL result. We expect
1706 : * the expression to have been AND/OR flattened and converted to implicit-AND
1707 : * format.
1708 : *
1709 : * Attnos of the identified Vars are returned in a multibitmapset (a List of
1710 : * Bitmapsets). List indexes correspond to relids (varnos), while the per-rel
1711 : * Bitmapsets hold varattnos offset by FirstLowInvalidHeapAttributeNumber.
1712 : *
1713 : * top_level is true while scanning top-level AND/OR structure; here, showing
1714 : * the result is either FALSE or NULL is good enough. top_level is false when
1715 : * we have descended below a NOT or a strict function: now we must be able to
1716 : * prove that the subexpression goes to NULL.
1717 : *
1718 : * We don't use expression_tree_walker here because we don't want to descend
1719 : * through very many kinds of nodes; only the ones we can be sure are strict.
1720 : */
1721 : List *
1722 45184 : find_nonnullable_vars(Node *clause)
1723 : {
1724 45184 : return find_nonnullable_vars_walker(clause, true);
1725 : }
1726 :
1727 : static List *
1728 288942 : find_nonnullable_vars_walker(Node *node, bool top_level)
1729 : {
1730 288942 : List *result = NIL;
1731 : ListCell *l;
1732 :
1733 288942 : if (node == NULL)
1734 680 : return NIL;
1735 288262 : if (IsA(node, Var))
1736 : {
1737 106998 : Var *var = (Var *) node;
1738 :
1739 106998 : if (var->varlevelsup == 0)
1740 106998 : result = mbms_add_member(result,
1741 : var->varno,
1742 106998 : var->varattno - FirstLowInvalidHeapAttributeNumber);
1743 : }
1744 181264 : else if (IsA(node, List))
1745 : {
1746 : /*
1747 : * At top level, we are examining an implicit-AND list: if any of the
1748 : * arms produces FALSE-or-NULL then the result is FALSE-or-NULL. If
1749 : * not at top level, we are examining the arguments of a strict
1750 : * function: if any of them produce NULL then the result of the
1751 : * function must be NULL. So in both cases, the set of nonnullable
1752 : * vars is the union of those found in the arms, and we pass down the
1753 : * top_level flag unmodified.
1754 : */
1755 286696 : foreach(l, (List *) node)
1756 : {
1757 181350 : result = mbms_add_members(result,
1758 181350 : find_nonnullable_vars_walker(lfirst(l),
1759 : top_level));
1760 : }
1761 : }
1762 75918 : else if (IsA(node, FuncExpr))
1763 : {
1764 444 : FuncExpr *expr = (FuncExpr *) node;
1765 :
1766 444 : if (func_strict(expr->funcid))
1767 420 : result = find_nonnullable_vars_walker((Node *) expr->args, false);
1768 : }
1769 75474 : else if (IsA(node, OpExpr))
1770 : {
1771 58644 : OpExpr *expr = (OpExpr *) node;
1772 :
1773 58644 : set_opfuncid(expr);
1774 58644 : if (func_strict(expr->opfuncid))
1775 58644 : result = find_nonnullable_vars_walker((Node *) expr->args, false);
1776 : }
1777 16830 : else if (IsA(node, ScalarArrayOpExpr))
1778 : {
1779 1714 : ScalarArrayOpExpr *expr = (ScalarArrayOpExpr *) node;
1780 :
1781 1714 : if (is_strict_saop(expr, true))
1782 1714 : result = find_nonnullable_vars_walker((Node *) expr->args, false);
1783 : }
1784 15116 : else if (IsA(node, BoolExpr))
1785 : {
1786 382 : BoolExpr *expr = (BoolExpr *) node;
1787 :
1788 382 : switch (expr->boolop)
1789 : {
1790 0 : case AND_EXPR:
1791 :
1792 : /*
1793 : * At top level we can just recurse (to the List case), since
1794 : * the result should be the union of what we can prove in each
1795 : * arm.
1796 : */
1797 0 : if (top_level)
1798 : {
1799 0 : result = find_nonnullable_vars_walker((Node *) expr->args,
1800 : top_level);
1801 0 : break;
1802 : }
1803 :
1804 : /*
1805 : * Below top level, even if one arm produces NULL, the result
1806 : * could be FALSE (hence not NULL). However, if *all* the
1807 : * arms produce NULL then the result is NULL, so we can take
1808 : * the intersection of the sets of nonnullable vars, just as
1809 : * for OR. Fall through to share code.
1810 : */
1811 : /* FALL THRU */
1812 : case OR_EXPR:
1813 :
1814 : /*
1815 : * OR is strict if all of its arms are, so we can take the
1816 : * intersection of the sets of nonnullable vars for each arm.
1817 : * This works for both values of top_level.
1818 : */
1819 832 : foreach(l, expr->args)
1820 : {
1821 : List *subresult;
1822 :
1823 676 : subresult = find_nonnullable_vars_walker(lfirst(l),
1824 : top_level);
1825 676 : if (result == NIL) /* first subresult? */
1826 318 : result = subresult;
1827 : else
1828 358 : result = mbms_int_members(result, subresult);
1829 :
1830 : /*
1831 : * If the intersection is empty, we can stop looking. This
1832 : * also justifies the test for first-subresult above.
1833 : */
1834 676 : if (result == NIL)
1835 162 : break;
1836 : }
1837 318 : break;
1838 64 : case NOT_EXPR:
1839 : /* NOT will return null if its arg is null */
1840 64 : result = find_nonnullable_vars_walker((Node *) expr->args,
1841 : false);
1842 64 : break;
1843 0 : default:
1844 0 : elog(ERROR, "unrecognized boolop: %d", (int) expr->boolop);
1845 : break;
1846 : }
1847 : }
1848 14734 : else if (IsA(node, RelabelType))
1849 : {
1850 598 : RelabelType *expr = (RelabelType *) node;
1851 :
1852 598 : result = find_nonnullable_vars_walker((Node *) expr->arg, top_level);
1853 : }
1854 14136 : else if (IsA(node, CoerceViaIO))
1855 : {
1856 : /* not clear this is useful, but it can't hurt */
1857 112 : CoerceViaIO *expr = (CoerceViaIO *) node;
1858 :
1859 112 : result = find_nonnullable_vars_walker((Node *) expr->arg, false);
1860 : }
1861 14024 : else if (IsA(node, ArrayCoerceExpr))
1862 : {
1863 : /* ArrayCoerceExpr is strict at the array level; ignore elemexpr */
1864 0 : ArrayCoerceExpr *expr = (ArrayCoerceExpr *) node;
1865 :
1866 0 : result = find_nonnullable_vars_walker((Node *) expr->arg, top_level);
1867 : }
1868 14024 : else if (IsA(node, ConvertRowtypeExpr))
1869 : {
1870 : /* not clear this is useful, but it can't hurt */
1871 0 : ConvertRowtypeExpr *expr = (ConvertRowtypeExpr *) node;
1872 :
1873 0 : result = find_nonnullable_vars_walker((Node *) expr->arg, top_level);
1874 : }
1875 14024 : else if (IsA(node, CollateExpr))
1876 : {
1877 0 : CollateExpr *expr = (CollateExpr *) node;
1878 :
1879 0 : result = find_nonnullable_vars_walker((Node *) expr->arg, top_level);
1880 : }
1881 14024 : else if (IsA(node, NullTest))
1882 : {
1883 : /* IS NOT NULL can be considered strict, but only at top level */
1884 276 : NullTest *expr = (NullTest *) node;
1885 :
1886 276 : if (top_level && expr->nulltesttype == IS_NOT_NULL && !expr->argisrow)
1887 96 : result = find_nonnullable_vars_walker((Node *) expr->arg, false);
1888 : }
1889 13748 : else if (IsA(node, BooleanTest))
1890 : {
1891 : /* Boolean tests that reject NULL are strict at top level */
1892 0 : BooleanTest *expr = (BooleanTest *) node;
1893 :
1894 0 : if (top_level &&
1895 0 : (expr->booltesttype == IS_TRUE ||
1896 0 : expr->booltesttype == IS_FALSE ||
1897 0 : expr->booltesttype == IS_NOT_UNKNOWN))
1898 0 : result = find_nonnullable_vars_walker((Node *) expr->arg, false);
1899 : }
1900 13748 : else if (IsA(node, SubPlan))
1901 : {
1902 30 : SubPlan *splan = (SubPlan *) node;
1903 :
1904 : /* See analysis in find_nonnullable_rels_walker */
1905 30 : if ((top_level && splan->subLinkType == ANY_SUBLINK) ||
1906 6 : splan->subLinkType == ROWCOMPARE_SUBLINK)
1907 24 : result = find_nonnullable_vars_walker(splan->testexpr, top_level);
1908 : }
1909 13718 : else if (IsA(node, PlaceHolderVar))
1910 : {
1911 60 : PlaceHolderVar *phv = (PlaceHolderVar *) node;
1912 :
1913 60 : result = find_nonnullable_vars_walker((Node *) phv->phexpr, top_level);
1914 : }
1915 288262 : return result;
1916 : }
1917 :
1918 : /*
1919 : * find_forced_null_vars
1920 : * Determine which Vars must be NULL for the given clause to return TRUE.
1921 : *
1922 : * This is the complement of find_nonnullable_vars: find the level-zero Vars
1923 : * that must be NULL for the clause to return TRUE. (It is OK to err on the
1924 : * side of conservatism; hence the analysis here is simplistic. In fact,
1925 : * we only detect simple "var IS NULL" tests at the top level.)
1926 : *
1927 : * As with find_nonnullable_vars, we return the varattnos of the identified
1928 : * Vars in a multibitmapset.
1929 : */
1930 : List *
1931 120426 : find_forced_null_vars(Node *node)
1932 : {
1933 120426 : List *result = NIL;
1934 : Var *var;
1935 : ListCell *l;
1936 :
1937 120426 : if (node == NULL)
1938 5666 : return NIL;
1939 : /* Check single-clause cases using subroutine */
1940 114760 : var = find_forced_null_var(node);
1941 114760 : if (var)
1942 : {
1943 1328 : result = mbms_add_member(result,
1944 : var->varno,
1945 1328 : var->varattno - FirstLowInvalidHeapAttributeNumber);
1946 : }
1947 : /* Otherwise, handle AND-conditions */
1948 113432 : else if (IsA(node, List))
1949 : {
1950 : /*
1951 : * At top level, we are examining an implicit-AND list: if any of the
1952 : * arms produces FALSE-or-NULL then the result is FALSE-or-NULL.
1953 : */
1954 114760 : foreach(l, (List *) node)
1955 : {
1956 69936 : result = mbms_add_members(result,
1957 69936 : find_forced_null_vars((Node *) lfirst(l)));
1958 : }
1959 : }
1960 68608 : else if (IsA(node, BoolExpr))
1961 : {
1962 5466 : BoolExpr *expr = (BoolExpr *) node;
1963 :
1964 : /*
1965 : * We don't bother considering the OR case, because it's fairly
1966 : * unlikely anyone would write "v1 IS NULL OR v1 IS NULL". Likewise,
1967 : * the NOT case isn't worth expending code on.
1968 : */
1969 5466 : if (expr->boolop == AND_EXPR)
1970 : {
1971 : /* At top level we can just recurse (to the List case) */
1972 0 : result = find_forced_null_vars((Node *) expr->args);
1973 : }
1974 : }
1975 114760 : return result;
1976 : }
1977 :
1978 : /*
1979 : * find_forced_null_var
1980 : * Return the Var forced null by the given clause, or NULL if it's
1981 : * not an IS NULL-type clause. For success, the clause must enforce
1982 : * *only* nullness of the particular Var, not any other conditions.
1983 : *
1984 : * This is just the single-clause case of find_forced_null_vars(), without
1985 : * any allowance for AND conditions. It's used by initsplan.c on individual
1986 : * qual clauses. The reason for not just applying find_forced_null_vars()
1987 : * is that if an AND of an IS NULL clause with something else were to somehow
1988 : * survive AND/OR flattening, initsplan.c might get fooled into discarding
1989 : * the whole clause when only the IS NULL part of it had been proved redundant.
1990 : */
1991 : Var *
1992 601134 : find_forced_null_var(Node *node)
1993 : {
1994 601134 : if (node == NULL)
1995 0 : return NULL;
1996 601134 : if (IsA(node, NullTest))
1997 : {
1998 : /* check for var IS NULL */
1999 11108 : NullTest *expr = (NullTest *) node;
2000 :
2001 11108 : if (expr->nulltesttype == IS_NULL && !expr->argisrow)
2002 : {
2003 4112 : Var *var = (Var *) expr->arg;
2004 :
2005 4112 : if (var && IsA(var, Var) &&
2006 3992 : var->varlevelsup == 0)
2007 3992 : return var;
2008 : }
2009 : }
2010 590026 : else if (IsA(node, BooleanTest))
2011 : {
2012 : /* var IS UNKNOWN is equivalent to var IS NULL */
2013 592 : BooleanTest *expr = (BooleanTest *) node;
2014 :
2015 592 : if (expr->booltesttype == IS_UNKNOWN)
2016 : {
2017 42 : Var *var = (Var *) expr->arg;
2018 :
2019 42 : if (var && IsA(var, Var) &&
2020 42 : var->varlevelsup == 0)
2021 42 : return var;
2022 : }
2023 : }
2024 597100 : return NULL;
2025 : }
2026 :
2027 : /*
2028 : * Can we treat a ScalarArrayOpExpr as strict?
2029 : *
2030 : * If "falseOK" is true, then a "false" result can be considered strict,
2031 : * else we need to guarantee an actual NULL result for NULL input.
2032 : *
2033 : * "foo op ALL array" is strict if the op is strict *and* we can prove
2034 : * that the array input isn't an empty array. We can check that
2035 : * for the cases of an array constant and an ARRAY[] construct.
2036 : *
2037 : * "foo op ANY array" is strict in the falseOK sense if the op is strict.
2038 : * If not falseOK, the test is the same as for "foo op ALL array".
2039 : */
2040 : static bool
2041 10616 : is_strict_saop(ScalarArrayOpExpr *expr, bool falseOK)
2042 : {
2043 : Node *rightop;
2044 :
2045 : /* The contained operator must be strict. */
2046 10616 : set_sa_opfuncid(expr);
2047 10616 : if (!func_strict(expr->opfuncid))
2048 0 : return false;
2049 : /* If ANY and falseOK, that's all we need to check. */
2050 10616 : if (expr->useOr && falseOK)
2051 10456 : return true;
2052 : /* Else, we have to see if the array is provably non-empty. */
2053 : Assert(list_length(expr->args) == 2);
2054 160 : rightop = (Node *) lsecond(expr->args);
2055 160 : if (rightop && IsA(rightop, Const))
2056 0 : {
2057 160 : Datum arraydatum = ((Const *) rightop)->constvalue;
2058 160 : bool arrayisnull = ((Const *) rightop)->constisnull;
2059 : ArrayType *arrayval;
2060 : int nitems;
2061 :
2062 160 : if (arrayisnull)
2063 0 : return false;
2064 160 : arrayval = DatumGetArrayTypeP(arraydatum);
2065 160 : nitems = ArrayGetNItems(ARR_NDIM(arrayval), ARR_DIMS(arrayval));
2066 160 : if (nitems > 0)
2067 160 : return true;
2068 : }
2069 0 : else if (rightop && IsA(rightop, ArrayExpr))
2070 : {
2071 0 : ArrayExpr *arrayexpr = (ArrayExpr *) rightop;
2072 :
2073 0 : if (arrayexpr->elements != NIL && !arrayexpr->multidims)
2074 0 : return true;
2075 : }
2076 0 : return false;
2077 : }
2078 :
2079 :
2080 : /*****************************************************************************
2081 : * Check for "pseudo-constant" clauses
2082 : *****************************************************************************/
2083 :
2084 : /*
2085 : * is_pseudo_constant_clause
2086 : * Detect whether an expression is "pseudo constant", ie, it contains no
2087 : * variables of the current query level and no uses of volatile functions.
2088 : * Such an expr is not necessarily a true constant: it can still contain
2089 : * Params and outer-level Vars, not to mention functions whose results
2090 : * may vary from one statement to the next. However, the expr's value
2091 : * will be constant over any one scan of the current query, so it can be
2092 : * used as, eg, an indexscan key. (Actually, the condition for indexscan
2093 : * keys is weaker than this; see is_pseudo_constant_for_index().)
2094 : *
2095 : * CAUTION: this function omits to test for one very important class of
2096 : * not-constant expressions, namely aggregates (Aggrefs). In current usage
2097 : * this is only applied to WHERE clauses and so a check for Aggrefs would be
2098 : * a waste of cycles; but be sure to also check contain_agg_clause() if you
2099 : * want to know about pseudo-constness in other contexts. The same goes
2100 : * for window functions (WindowFuncs).
2101 : */
2102 : bool
2103 5832 : is_pseudo_constant_clause(Node *clause)
2104 : {
2105 : /*
2106 : * We could implement this check in one recursive scan. But since the
2107 : * check for volatile functions is both moderately expensive and unlikely
2108 : * to fail, it seems better to look for Vars first and only check for
2109 : * volatile functions if we find no Vars.
2110 : */
2111 5832 : if (!contain_var_clause(clause) &&
2112 5832 : !contain_volatile_functions(clause))
2113 5832 : return true;
2114 0 : return false;
2115 : }
2116 :
2117 : /*
2118 : * is_pseudo_constant_clause_relids
2119 : * Same as above, except caller already has available the var membership
2120 : * of the expression; this lets us avoid the contain_var_clause() scan.
2121 : */
2122 : bool
2123 452764 : is_pseudo_constant_clause_relids(Node *clause, Relids relids)
2124 : {
2125 452764 : if (bms_is_empty(relids) &&
2126 445034 : !contain_volatile_functions(clause))
2127 445034 : return true;
2128 7730 : return false;
2129 : }
2130 :
2131 :
2132 : /*****************************************************************************
2133 : * *
2134 : * General clause-manipulating routines *
2135 : * *
2136 : *****************************************************************************/
2137 :
2138 : /*
2139 : * NumRelids
2140 : * (formerly clause_relids)
2141 : *
2142 : * Returns the number of different base relations referenced in 'clause'.
2143 : */
2144 : int
2145 1782 : NumRelids(PlannerInfo *root, Node *clause)
2146 : {
2147 : int result;
2148 1782 : Relids varnos = pull_varnos(root, clause);
2149 :
2150 1782 : varnos = bms_del_members(varnos, root->outer_join_rels);
2151 1782 : result = bms_num_members(varnos);
2152 1782 : bms_free(varnos);
2153 1782 : return result;
2154 : }
2155 :
2156 : /*
2157 : * CommuteOpExpr: commute a binary operator clause
2158 : *
2159 : * XXX the clause is destructively modified!
2160 : */
2161 : void
2162 20280 : CommuteOpExpr(OpExpr *clause)
2163 : {
2164 : Oid opoid;
2165 : Node *temp;
2166 :
2167 : /* Sanity checks: caller is at fault if these fail */
2168 40560 : if (!is_opclause(clause) ||
2169 20280 : list_length(clause->args) != 2)
2170 0 : elog(ERROR, "cannot commute non-binary-operator clause");
2171 :
2172 20280 : opoid = get_commutator(clause->opno);
2173 :
2174 20280 : if (!OidIsValid(opoid))
2175 0 : elog(ERROR, "could not find commutator for operator %u",
2176 : clause->opno);
2177 :
2178 : /*
2179 : * modify the clause in-place!
2180 : */
2181 20280 : clause->opno = opoid;
2182 20280 : clause->opfuncid = InvalidOid;
2183 : /* opresulttype, opretset, opcollid, inputcollid need not change */
2184 :
2185 20280 : temp = linitial(clause->args);
2186 20280 : linitial(clause->args) = lsecond(clause->args);
2187 20280 : lsecond(clause->args) = temp;
2188 20280 : }
2189 :
2190 : /*
2191 : * Helper for eval_const_expressions: check that datatype of an attribute
2192 : * is still what it was when the expression was parsed. This is needed to
2193 : * guard against improper simplification after ALTER COLUMN TYPE. (XXX we
2194 : * may well need to make similar checks elsewhere?)
2195 : *
2196 : * rowtypeid may come from a whole-row Var, and therefore it can be a domain
2197 : * over composite, but for this purpose we only care about checking the type
2198 : * of a contained field.
2199 : */
2200 : static bool
2201 720 : rowtype_field_matches(Oid rowtypeid, int fieldnum,
2202 : Oid expectedtype, int32 expectedtypmod,
2203 : Oid expectedcollation)
2204 : {
2205 : TupleDesc tupdesc;
2206 : Form_pg_attribute attr;
2207 :
2208 : /* No issue for RECORD, since there is no way to ALTER such a type */
2209 720 : if (rowtypeid == RECORDOID)
2210 56 : return true;
2211 664 : tupdesc = lookup_rowtype_tupdesc_domain(rowtypeid, -1, false);
2212 664 : if (fieldnum <= 0 || fieldnum > tupdesc->natts)
2213 : {
2214 0 : ReleaseTupleDesc(tupdesc);
2215 0 : return false;
2216 : }
2217 664 : attr = TupleDescAttr(tupdesc, fieldnum - 1);
2218 664 : if (attr->attisdropped ||
2219 664 : attr->atttypid != expectedtype ||
2220 664 : attr->atttypmod != expectedtypmod ||
2221 664 : attr->attcollation != expectedcollation)
2222 : {
2223 0 : ReleaseTupleDesc(tupdesc);
2224 0 : return false;
2225 : }
2226 664 : ReleaseTupleDesc(tupdesc);
2227 664 : return true;
2228 : }
2229 :
2230 :
2231 : /*--------------------
2232 : * eval_const_expressions
2233 : *
2234 : * Reduce any recognizably constant subexpressions of the given
2235 : * expression tree, for example "2 + 2" => "4". More interestingly,
2236 : * we can reduce certain boolean expressions even when they contain
2237 : * non-constant subexpressions: "x OR true" => "true" no matter what
2238 : * the subexpression x is. (XXX We assume that no such subexpression
2239 : * will have important side-effects, which is not necessarily a good
2240 : * assumption in the presence of user-defined functions; do we need a
2241 : * pg_proc flag that prevents discarding the execution of a function?)
2242 : *
2243 : * We do understand that certain functions may deliver non-constant
2244 : * results even with constant inputs, "nextval()" being the classic
2245 : * example. Functions that are not marked "immutable" in pg_proc
2246 : * will not be pre-evaluated here, although we will reduce their
2247 : * arguments as far as possible.
2248 : *
2249 : * Whenever a function is eliminated from the expression by means of
2250 : * constant-expression evaluation or inlining, we add the function to
2251 : * root->glob->invalItems. This ensures the plan is known to depend on
2252 : * such functions, even though they aren't referenced anymore.
2253 : *
2254 : * We assume that the tree has already been type-checked and contains
2255 : * only operators and functions that are reasonable to try to execute.
2256 : *
2257 : * NOTE: "root" can be passed as NULL if the caller never wants to do any
2258 : * Param substitutions nor receive info about inlined functions nor reduce
2259 : * NullTest for Vars to constant true or constant false.
2260 : *
2261 : * NOTE: the planner assumes that this will always flatten nested AND and
2262 : * OR clauses into N-argument form. See comments in prepqual.c.
2263 : *
2264 : * NOTE: another critical effect is that any function calls that require
2265 : * default arguments will be expanded, and named-argument calls will be
2266 : * converted to positional notation. The executor won't handle either.
2267 : *--------------------
2268 : */
2269 : Node *
2270 1219854 : eval_const_expressions(PlannerInfo *root, Node *node)
2271 : {
2272 : eval_const_expressions_context context;
2273 :
2274 1219854 : if (root)
2275 973104 : context.boundParams = root->glob->boundParams; /* bound Params */
2276 : else
2277 246750 : context.boundParams = NULL;
2278 1219854 : context.root = root; /* for inlined-function dependencies */
2279 1219854 : context.active_fns = NIL; /* nothing being recursively simplified */
2280 1219854 : context.case_val = NULL; /* no CASE being examined */
2281 1219854 : context.estimate = false; /* safe transformations only */
2282 1219854 : return eval_const_expressions_mutator(node, &context);
2283 : }
2284 :
2285 : #define MIN_ARRAY_SIZE_FOR_HASHED_SAOP 9
2286 : /*--------------------
2287 : * convert_saop_to_hashed_saop
2288 : *
2289 : * Recursively search 'node' for ScalarArrayOpExprs and fill in the hash
2290 : * function for any ScalarArrayOpExpr that looks like it would be useful to
2291 : * evaluate using a hash table rather than a linear search.
2292 : *
2293 : * We'll use a hash table if all of the following conditions are met:
2294 : * 1. The 2nd argument of the array contain only Consts.
2295 : * 2. useOr is true or there is a valid negator operator for the
2296 : * ScalarArrayOpExpr's opno.
2297 : * 3. There's valid hash function for both left and righthand operands and
2298 : * these hash functions are the same.
2299 : * 4. If the array contains enough elements for us to consider it to be
2300 : * worthwhile using a hash table rather than a linear search.
2301 : */
2302 : void
2303 845876 : convert_saop_to_hashed_saop(Node *node)
2304 : {
2305 845876 : (void) convert_saop_to_hashed_saop_walker(node, NULL);
2306 845876 : }
2307 :
2308 : static bool
2309 6065384 : convert_saop_to_hashed_saop_walker(Node *node, void *context)
2310 : {
2311 6065384 : if (node == NULL)
2312 132974 : return false;
2313 :
2314 5932410 : if (IsA(node, ScalarArrayOpExpr))
2315 : {
2316 32886 : ScalarArrayOpExpr *saop = (ScalarArrayOpExpr *) node;
2317 32886 : Expr *arrayarg = (Expr *) lsecond(saop->args);
2318 : Oid lefthashfunc;
2319 : Oid righthashfunc;
2320 :
2321 32886 : if (arrayarg && IsA(arrayarg, Const) &&
2322 17920 : !((Const *) arrayarg)->constisnull)
2323 : {
2324 17890 : if (saop->useOr)
2325 : {
2326 15514 : if (get_op_hash_functions(saop->opno, &lefthashfunc, &righthashfunc) &&
2327 15180 : lefthashfunc == righthashfunc)
2328 : {
2329 15154 : Datum arrdatum = ((Const *) arrayarg)->constvalue;
2330 15154 : ArrayType *arr = (ArrayType *) DatumGetPointer(arrdatum);
2331 : int nitems;
2332 :
2333 : /*
2334 : * Only fill in the hash functions if the array looks
2335 : * large enough for it to be worth hashing instead of
2336 : * doing a linear search.
2337 : */
2338 15154 : nitems = ArrayGetNItems(ARR_NDIM(arr), ARR_DIMS(arr));
2339 :
2340 15154 : if (nitems >= MIN_ARRAY_SIZE_FOR_HASHED_SAOP)
2341 : {
2342 : /* Looks good. Fill in the hash functions */
2343 442 : saop->hashfuncid = lefthashfunc;
2344 : }
2345 17360 : return false;
2346 : }
2347 : }
2348 : else /* !saop->useOr */
2349 : {
2350 2376 : Oid negator = get_negator(saop->opno);
2351 :
2352 : /*
2353 : * Check if this is a NOT IN using an operator whose negator
2354 : * is hashable. If so we can still build a hash table and
2355 : * just ensure the lookup items are not in the hash table.
2356 : */
2357 4752 : if (OidIsValid(negator) &&
2358 2376 : get_op_hash_functions(negator, &lefthashfunc, &righthashfunc) &&
2359 2206 : lefthashfunc == righthashfunc)
2360 : {
2361 2206 : Datum arrdatum = ((Const *) arrayarg)->constvalue;
2362 2206 : ArrayType *arr = (ArrayType *) DatumGetPointer(arrdatum);
2363 : int nitems;
2364 :
2365 : /*
2366 : * Only fill in the hash functions if the array looks
2367 : * large enough for it to be worth hashing instead of
2368 : * doing a linear search.
2369 : */
2370 2206 : nitems = ArrayGetNItems(ARR_NDIM(arr), ARR_DIMS(arr));
2371 :
2372 2206 : if (nitems >= MIN_ARRAY_SIZE_FOR_HASHED_SAOP)
2373 : {
2374 : /* Looks good. Fill in the hash functions */
2375 70 : saop->hashfuncid = lefthashfunc;
2376 :
2377 : /*
2378 : * Also set the negfuncid. The executor will need
2379 : * that to perform hashtable lookups.
2380 : */
2381 70 : saop->negfuncid = get_opcode(negator);
2382 : }
2383 2206 : return false;
2384 : }
2385 : }
2386 : }
2387 : }
2388 :
2389 5915050 : return expression_tree_walker(node, convert_saop_to_hashed_saop_walker, NULL);
2390 : }
2391 :
2392 :
2393 : /*--------------------
2394 : * estimate_expression_value
2395 : *
2396 : * This function attempts to estimate the value of an expression for
2397 : * planning purposes. It is in essence a more aggressive version of
2398 : * eval_const_expressions(): we will perform constant reductions that are
2399 : * not necessarily 100% safe, but are reasonable for estimation purposes.
2400 : *
2401 : * Currently the extra steps that are taken in this mode are:
2402 : * 1. Substitute values for Params, where a bound Param value has been made
2403 : * available by the caller of planner(), even if the Param isn't marked
2404 : * constant. This effectively means that we plan using the first supplied
2405 : * value of the Param.
2406 : * 2. Fold stable, as well as immutable, functions to constants.
2407 : * 3. Reduce PlaceHolderVar nodes to their contained expressions.
2408 : *--------------------
2409 : */
2410 : Node *
2411 882950 : estimate_expression_value(PlannerInfo *root, Node *node)
2412 : {
2413 : eval_const_expressions_context context;
2414 :
2415 882950 : context.boundParams = root->glob->boundParams; /* bound Params */
2416 : /* we do not need to mark the plan as depending on inlined functions */
2417 882950 : context.root = NULL;
2418 882950 : context.active_fns = NIL; /* nothing being recursively simplified */
2419 882950 : context.case_val = NULL; /* no CASE being examined */
2420 882950 : context.estimate = true; /* unsafe transformations OK */
2421 882950 : return eval_const_expressions_mutator(node, &context);
2422 : }
2423 :
2424 : /*
2425 : * The generic case in eval_const_expressions_mutator is to recurse using
2426 : * expression_tree_mutator, which will copy the given node unchanged but
2427 : * const-simplify its arguments (if any) as far as possible. If the node
2428 : * itself does immutable processing, and each of its arguments were reduced
2429 : * to a Const, we can then reduce it to a Const using evaluate_expr. (Some
2430 : * node types need more complicated logic; for example, a CASE expression
2431 : * might be reducible to a constant even if not all its subtrees are.)
2432 : */
2433 : #define ece_generic_processing(node) \
2434 : expression_tree_mutator((Node *) (node), eval_const_expressions_mutator, \
2435 : context)
2436 :
2437 : /*
2438 : * Check whether all arguments of the given node were reduced to Consts.
2439 : * By going directly to expression_tree_walker, contain_non_const_walker
2440 : * is not applied to the node itself, only to its children.
2441 : */
2442 : #define ece_all_arguments_const(node) \
2443 : (!expression_tree_walker((Node *) (node), contain_non_const_walker, NULL))
2444 :
2445 : /* Generic macro for applying evaluate_expr */
2446 : #define ece_evaluate_expr(node) \
2447 : ((Node *) evaluate_expr((Expr *) (node), \
2448 : exprType((Node *) (node)), \
2449 : exprTypmod((Node *) (node)), \
2450 : exprCollation((Node *) (node))))
2451 :
2452 : /*
2453 : * Recursive guts of eval_const_expressions/estimate_expression_value
2454 : */
2455 : static Node *
2456 9045362 : eval_const_expressions_mutator(Node *node,
2457 : eval_const_expressions_context *context)
2458 : {
2459 :
2460 : /* since this function recurses, it could be driven to stack overflow */
2461 9045362 : check_stack_depth();
2462 :
2463 9045362 : if (node == NULL)
2464 374822 : return NULL;
2465 8670540 : switch (nodeTag(node))
2466 : {
2467 146226 : case T_Param:
2468 : {
2469 146226 : Param *param = (Param *) node;
2470 146226 : ParamListInfo paramLI = context->boundParams;
2471 :
2472 : /* Look to see if we've been given a value for this Param */
2473 146226 : if (param->paramkind == PARAM_EXTERN &&
2474 53186 : paramLI != NULL &&
2475 53186 : param->paramid > 0 &&
2476 53186 : param->paramid <= paramLI->numParams)
2477 : {
2478 : ParamExternData *prm;
2479 : ParamExternData prmdata;
2480 :
2481 : /*
2482 : * Give hook a chance in case parameter is dynamic. Tell
2483 : * it that this fetch is speculative, so it should avoid
2484 : * erroring out if parameter is unavailable.
2485 : */
2486 53186 : if (paramLI->paramFetch != NULL)
2487 7432 : prm = paramLI->paramFetch(paramLI, param->paramid,
2488 : true, &prmdata);
2489 : else
2490 45754 : prm = ¶mLI->params[param->paramid - 1];
2491 :
2492 : /*
2493 : * We don't just check OidIsValid, but insist that the
2494 : * fetched type match the Param, just in case the hook did
2495 : * something unexpected. No need to throw an error here
2496 : * though; leave that for runtime.
2497 : */
2498 53186 : if (OidIsValid(prm->ptype) &&
2499 53186 : prm->ptype == param->paramtype)
2500 : {
2501 : /* OK to substitute parameter value? */
2502 53184 : if (context->estimate ||
2503 53184 : (prm->pflags & PARAM_FLAG_CONST))
2504 : {
2505 : /*
2506 : * Return a Const representing the param value.
2507 : * Must copy pass-by-ref datatypes, since the
2508 : * Param might be in a memory context
2509 : * shorter-lived than our output plan should be.
2510 : */
2511 : int16 typLen;
2512 : bool typByVal;
2513 : Datum pval;
2514 : Const *con;
2515 :
2516 53184 : get_typlenbyval(param->paramtype,
2517 : &typLen, &typByVal);
2518 53184 : if (prm->isnull || typByVal)
2519 35002 : pval = prm->value;
2520 : else
2521 18182 : pval = datumCopy(prm->value, typByVal, typLen);
2522 53184 : con = makeConst(param->paramtype,
2523 : param->paramtypmod,
2524 : param->paramcollid,
2525 : (int) typLen,
2526 : pval,
2527 53184 : prm->isnull,
2528 : typByVal);
2529 53184 : con->location = param->location;
2530 53184 : return (Node *) con;
2531 : }
2532 : }
2533 : }
2534 :
2535 : /*
2536 : * Not replaceable, so just copy the Param (no need to
2537 : * recurse)
2538 : */
2539 93042 : return (Node *) copyObject(param);
2540 : }
2541 3596 : case T_WindowFunc:
2542 : {
2543 3596 : WindowFunc *expr = (WindowFunc *) node;
2544 3596 : Oid funcid = expr->winfnoid;
2545 : List *args;
2546 : Expr *aggfilter;
2547 : HeapTuple func_tuple;
2548 : WindowFunc *newexpr;
2549 :
2550 : /*
2551 : * We can't really simplify a WindowFunc node, but we mustn't
2552 : * just fall through to the default processing, because we
2553 : * have to apply expand_function_arguments to its argument
2554 : * list. That takes care of inserting default arguments and
2555 : * expanding named-argument notation.
2556 : */
2557 3596 : func_tuple = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2558 3596 : if (!HeapTupleIsValid(func_tuple))
2559 0 : elog(ERROR, "cache lookup failed for function %u", funcid);
2560 :
2561 3596 : args = expand_function_arguments(expr->args,
2562 : false, expr->wintype,
2563 : func_tuple);
2564 :
2565 3596 : ReleaseSysCache(func_tuple);
2566 :
2567 : /* Now, recursively simplify the args (which are a List) */
2568 : args = (List *)
2569 3596 : expression_tree_mutator((Node *) args,
2570 : eval_const_expressions_mutator,
2571 : context);
2572 : /* ... and the filter expression, which isn't */
2573 : aggfilter = (Expr *)
2574 3596 : eval_const_expressions_mutator((Node *) expr->aggfilter,
2575 : context);
2576 :
2577 : /* And build the replacement WindowFunc node */
2578 3596 : newexpr = makeNode(WindowFunc);
2579 3596 : newexpr->winfnoid = expr->winfnoid;
2580 3596 : newexpr->wintype = expr->wintype;
2581 3596 : newexpr->wincollid = expr->wincollid;
2582 3596 : newexpr->inputcollid = expr->inputcollid;
2583 3596 : newexpr->args = args;
2584 3596 : newexpr->aggfilter = aggfilter;
2585 3596 : newexpr->runCondition = expr->runCondition;
2586 3596 : newexpr->winref = expr->winref;
2587 3596 : newexpr->winstar = expr->winstar;
2588 3596 : newexpr->winagg = expr->winagg;
2589 3596 : newexpr->ignore_nulls = expr->ignore_nulls;
2590 3596 : newexpr->location = expr->location;
2591 :
2592 3596 : return (Node *) newexpr;
2593 : }
2594 539840 : case T_FuncExpr:
2595 : {
2596 539840 : FuncExpr *expr = (FuncExpr *) node;
2597 539840 : List *args = expr->args;
2598 : Expr *simple;
2599 : FuncExpr *newexpr;
2600 :
2601 : /*
2602 : * Code for op/func reduction is pretty bulky, so split it out
2603 : * as a separate function. Note: exprTypmod normally returns
2604 : * -1 for a FuncExpr, but not when the node is recognizably a
2605 : * length coercion; we want to preserve the typmod in the
2606 : * eventual Const if so.
2607 : */
2608 539840 : simple = simplify_function(expr->funcid,
2609 : expr->funcresulttype,
2610 : exprTypmod(node),
2611 : expr->funccollid,
2612 : expr->inputcollid,
2613 : &args,
2614 539840 : expr->funcvariadic,
2615 : true,
2616 : true,
2617 : context);
2618 537048 : if (simple) /* successfully simplified it */
2619 156286 : return (Node *) simple;
2620 :
2621 : /*
2622 : * The expression cannot be simplified any further, so build
2623 : * and return a replacement FuncExpr node using the
2624 : * possibly-simplified arguments. Note that we have also
2625 : * converted the argument list to positional notation.
2626 : */
2627 380762 : newexpr = makeNode(FuncExpr);
2628 380762 : newexpr->funcid = expr->funcid;
2629 380762 : newexpr->funcresulttype = expr->funcresulttype;
2630 380762 : newexpr->funcretset = expr->funcretset;
2631 380762 : newexpr->funcvariadic = expr->funcvariadic;
2632 380762 : newexpr->funcformat = expr->funcformat;
2633 380762 : newexpr->funccollid = expr->funccollid;
2634 380762 : newexpr->inputcollid = expr->inputcollid;
2635 380762 : newexpr->args = args;
2636 380762 : newexpr->location = expr->location;
2637 380762 : return (Node *) newexpr;
2638 : }
2639 44866 : case T_Aggref:
2640 44866 : node = ece_generic_processing(node);
2641 44866 : if (context->root != NULL)
2642 44866 : return simplify_aggref((Aggref *) node, context);
2643 0 : return node;
2644 684816 : case T_OpExpr:
2645 : {
2646 684816 : OpExpr *expr = (OpExpr *) node;
2647 684816 : List *args = expr->args;
2648 : Expr *simple;
2649 : OpExpr *newexpr;
2650 :
2651 : /*
2652 : * Need to get OID of underlying function. Okay to scribble
2653 : * on input to this extent.
2654 : */
2655 684816 : set_opfuncid(expr);
2656 :
2657 : /*
2658 : * Code for op/func reduction is pretty bulky, so split it out
2659 : * as a separate function.
2660 : */
2661 684816 : simple = simplify_function(expr->opfuncid,
2662 : expr->opresulttype, -1,
2663 : expr->opcollid,
2664 : expr->inputcollid,
2665 : &args,
2666 : false,
2667 : true,
2668 : true,
2669 : context);
2670 683634 : if (simple) /* successfully simplified it */
2671 22586 : return (Node *) simple;
2672 :
2673 : /*
2674 : * If the operator is boolean equality or inequality, we know
2675 : * how to simplify cases involving one constant and one
2676 : * non-constant argument.
2677 : */
2678 661048 : if (expr->opno == BooleanEqualOperator ||
2679 659918 : expr->opno == BooleanNotEqualOperator)
2680 : {
2681 1298 : simple = (Expr *) simplify_boolean_equality(expr->opno,
2682 : args);
2683 1298 : if (simple) /* successfully simplified it */
2684 1036 : return (Node *) simple;
2685 : }
2686 :
2687 : /*
2688 : * The expression cannot be simplified any further, so build
2689 : * and return a replacement OpExpr node using the
2690 : * possibly-simplified arguments.
2691 : */
2692 660012 : newexpr = makeNode(OpExpr);
2693 660012 : newexpr->opno = expr->opno;
2694 660012 : newexpr->opfuncid = expr->opfuncid;
2695 660012 : newexpr->opresulttype = expr->opresulttype;
2696 660012 : newexpr->opretset = expr->opretset;
2697 660012 : newexpr->opcollid = expr->opcollid;
2698 660012 : newexpr->inputcollid = expr->inputcollid;
2699 660012 : newexpr->args = args;
2700 660012 : newexpr->location = expr->location;
2701 660012 : return (Node *) newexpr;
2702 : }
2703 1200 : case T_DistinctExpr:
2704 : {
2705 1200 : DistinctExpr *expr = (DistinctExpr *) node;
2706 : List *args;
2707 : ListCell *arg;
2708 1200 : bool has_null_input = false;
2709 1200 : bool all_null_input = true;
2710 1200 : bool has_nonconst_input = false;
2711 : Expr *simple;
2712 : DistinctExpr *newexpr;
2713 :
2714 : /*
2715 : * Reduce constants in the DistinctExpr's arguments. We know
2716 : * args is either NIL or a List node, so we can call
2717 : * expression_tree_mutator directly rather than recursing to
2718 : * self.
2719 : */
2720 1200 : args = (List *) expression_tree_mutator((Node *) expr->args,
2721 : eval_const_expressions_mutator,
2722 : context);
2723 :
2724 : /*
2725 : * We must do our own check for NULLs because DistinctExpr has
2726 : * different results for NULL input than the underlying
2727 : * operator does.
2728 : */
2729 3600 : foreach(arg, args)
2730 : {
2731 2400 : if (IsA(lfirst(arg), Const))
2732 : {
2733 350 : has_null_input |= ((Const *) lfirst(arg))->constisnull;
2734 350 : all_null_input &= ((Const *) lfirst(arg))->constisnull;
2735 : }
2736 : else
2737 2050 : has_nonconst_input = true;
2738 : }
2739 :
2740 : /* all constants? then can optimize this out */
2741 1200 : if (!has_nonconst_input)
2742 : {
2743 : /* all nulls? then not distinct */
2744 54 : if (all_null_input)
2745 12 : return makeBoolConst(false, false);
2746 :
2747 : /* one null? then distinct */
2748 42 : if (has_null_input)
2749 18 : return makeBoolConst(true, false);
2750 :
2751 : /* otherwise try to evaluate the '=' operator */
2752 : /* (NOT okay to try to inline it, though!) */
2753 :
2754 : /*
2755 : * Need to get OID of underlying function. Okay to
2756 : * scribble on input to this extent.
2757 : */
2758 24 : set_opfuncid((OpExpr *) expr); /* rely on struct
2759 : * equivalence */
2760 :
2761 : /*
2762 : * Code for op/func reduction is pretty bulky, so split it
2763 : * out as a separate function.
2764 : */
2765 24 : simple = simplify_function(expr->opfuncid,
2766 : expr->opresulttype, -1,
2767 : expr->opcollid,
2768 : expr->inputcollid,
2769 : &args,
2770 : false,
2771 : false,
2772 : false,
2773 : context);
2774 24 : if (simple) /* successfully simplified it */
2775 : {
2776 : /*
2777 : * Since the underlying operator is "=", must negate
2778 : * its result
2779 : */
2780 24 : Const *csimple = castNode(Const, simple);
2781 :
2782 24 : csimple->constvalue =
2783 24 : BoolGetDatum(!DatumGetBool(csimple->constvalue));
2784 24 : return (Node *) csimple;
2785 : }
2786 : }
2787 :
2788 : /*
2789 : * The expression cannot be simplified any further, so build
2790 : * and return a replacement DistinctExpr node using the
2791 : * possibly-simplified arguments.
2792 : */
2793 1146 : newexpr = makeNode(DistinctExpr);
2794 1146 : newexpr->opno = expr->opno;
2795 1146 : newexpr->opfuncid = expr->opfuncid;
2796 1146 : newexpr->opresulttype = expr->opresulttype;
2797 1146 : newexpr->opretset = expr->opretset;
2798 1146 : newexpr->opcollid = expr->opcollid;
2799 1146 : newexpr->inputcollid = expr->inputcollid;
2800 1146 : newexpr->args = args;
2801 1146 : newexpr->location = expr->location;
2802 1146 : return (Node *) newexpr;
2803 : }
2804 740 : case T_NullIfExpr:
2805 : {
2806 : NullIfExpr *expr;
2807 : ListCell *arg;
2808 740 : bool has_nonconst_input = false;
2809 :
2810 : /* Copy the node and const-simplify its arguments */
2811 740 : expr = (NullIfExpr *) ece_generic_processing(node);
2812 :
2813 : /* If either argument is NULL they can't be equal */
2814 2214 : foreach(arg, expr->args)
2815 : {
2816 1480 : if (!IsA(lfirst(arg), Const))
2817 708 : has_nonconst_input = true;
2818 772 : else if (((Const *) lfirst(arg))->constisnull)
2819 6 : return (Node *) linitial(expr->args);
2820 : }
2821 :
2822 : /*
2823 : * Need to get OID of underlying function before checking if
2824 : * the function is OK to evaluate.
2825 : */
2826 734 : set_opfuncid((OpExpr *) expr);
2827 :
2828 772 : if (!has_nonconst_input &&
2829 38 : ece_function_is_safe(expr->opfuncid, context))
2830 38 : return ece_evaluate_expr(expr);
2831 :
2832 696 : return (Node *) expr;
2833 : }
2834 37786 : case T_ScalarArrayOpExpr:
2835 : {
2836 : ScalarArrayOpExpr *saop;
2837 :
2838 : /* Copy the node and const-simplify its arguments */
2839 37786 : saop = (ScalarArrayOpExpr *) ece_generic_processing(node);
2840 :
2841 : /* Make sure we know underlying function */
2842 37786 : set_sa_opfuncid(saop);
2843 :
2844 : /*
2845 : * If all arguments are Consts, and it's a safe function, we
2846 : * can fold to a constant
2847 : */
2848 38124 : if (ece_all_arguments_const(saop) &&
2849 338 : ece_function_is_safe(saop->opfuncid, context))
2850 338 : return ece_evaluate_expr(saop);
2851 37448 : return (Node *) saop;
2852 : }
2853 168382 : case T_BoolExpr:
2854 : {
2855 168382 : BoolExpr *expr = (BoolExpr *) node;
2856 :
2857 168382 : switch (expr->boolop)
2858 : {
2859 12448 : case OR_EXPR:
2860 : {
2861 : List *newargs;
2862 12448 : bool haveNull = false;
2863 12448 : bool forceTrue = false;
2864 :
2865 12448 : newargs = simplify_or_arguments(expr->args,
2866 : context,
2867 : &haveNull,
2868 : &forceTrue);
2869 12448 : if (forceTrue)
2870 172 : return makeBoolConst(true, false);
2871 12276 : if (haveNull)
2872 30 : newargs = lappend(newargs,
2873 30 : makeBoolConst(false, true));
2874 : /* If all the inputs are FALSE, result is FALSE */
2875 12276 : if (newargs == NIL)
2876 34 : return makeBoolConst(false, false);
2877 :
2878 : /*
2879 : * If only one nonconst-or-NULL input, it's the
2880 : * result
2881 : */
2882 12242 : if (list_length(newargs) == 1)
2883 138 : return (Node *) linitial(newargs);
2884 : /* Else we still need an OR node */
2885 12104 : return (Node *) make_orclause(newargs);
2886 : }
2887 141460 : case AND_EXPR:
2888 : {
2889 : List *newargs;
2890 141460 : bool haveNull = false;
2891 141460 : bool forceFalse = false;
2892 :
2893 141460 : newargs = simplify_and_arguments(expr->args,
2894 : context,
2895 : &haveNull,
2896 : &forceFalse);
2897 141460 : if (forceFalse)
2898 1554 : return makeBoolConst(false, false);
2899 139906 : if (haveNull)
2900 6 : newargs = lappend(newargs,
2901 6 : makeBoolConst(false, true));
2902 : /* If all the inputs are TRUE, result is TRUE */
2903 139906 : if (newargs == NIL)
2904 370 : return makeBoolConst(true, false);
2905 :
2906 : /*
2907 : * If only one nonconst-or-NULL input, it's the
2908 : * result
2909 : */
2910 139536 : if (list_length(newargs) == 1)
2911 148 : return (Node *) linitial(newargs);
2912 : /* Else we still need an AND node */
2913 139388 : return (Node *) make_andclause(newargs);
2914 : }
2915 14474 : case NOT_EXPR:
2916 : {
2917 : Node *arg;
2918 :
2919 : Assert(list_length(expr->args) == 1);
2920 14474 : arg = eval_const_expressions_mutator(linitial(expr->args),
2921 : context);
2922 :
2923 : /*
2924 : * Use negate_clause() to see if we can simplify
2925 : * away the NOT.
2926 : */
2927 14474 : return negate_clause(arg);
2928 : }
2929 0 : default:
2930 0 : elog(ERROR, "unrecognized boolop: %d",
2931 : (int) expr->boolop);
2932 : break;
2933 : }
2934 : break;
2935 : }
2936 :
2937 774 : case T_JsonValueExpr:
2938 : {
2939 774 : JsonValueExpr *jve = (JsonValueExpr *) node;
2940 774 : Node *raw_expr = (Node *) jve->raw_expr;
2941 774 : Node *formatted_expr = (Node *) jve->formatted_expr;
2942 :
2943 : /*
2944 : * If we can fold formatted_expr to a constant, we can elide
2945 : * the JsonValueExpr altogether. Otherwise we must process
2946 : * raw_expr too. But JsonFormat is a flat node and requires
2947 : * no simplification, only copying.
2948 : */
2949 774 : formatted_expr = eval_const_expressions_mutator(formatted_expr,
2950 : context);
2951 774 : if (formatted_expr && IsA(formatted_expr, Const))
2952 546 : return formatted_expr;
2953 :
2954 228 : raw_expr = eval_const_expressions_mutator(raw_expr, context);
2955 :
2956 228 : return (Node *) makeJsonValueExpr((Expr *) raw_expr,
2957 : (Expr *) formatted_expr,
2958 228 : copyObject(jve->format));
2959 : }
2960 :
2961 582 : case T_SubPlan:
2962 : case T_AlternativeSubPlan:
2963 :
2964 : /*
2965 : * Return a SubPlan unchanged --- too late to do anything with it.
2966 : *
2967 : * XXX should we ereport() here instead? Probably this routine
2968 : * should never be invoked after SubPlan creation.
2969 : */
2970 582 : return node;
2971 171198 : case T_RelabelType:
2972 : {
2973 171198 : RelabelType *relabel = (RelabelType *) node;
2974 : Node *arg;
2975 :
2976 : /* Simplify the input ... */
2977 171198 : arg = eval_const_expressions_mutator((Node *) relabel->arg,
2978 : context);
2979 : /* ... and attach a new RelabelType node, if needed */
2980 171192 : return applyRelabelType(arg,
2981 : relabel->resulttype,
2982 : relabel->resulttypmod,
2983 : relabel->resultcollid,
2984 : relabel->relabelformat,
2985 : relabel->location,
2986 : true);
2987 : }
2988 25740 : case T_CoerceViaIO:
2989 : {
2990 25740 : CoerceViaIO *expr = (CoerceViaIO *) node;
2991 : List *args;
2992 : Oid outfunc;
2993 : bool outtypisvarlena;
2994 : Oid infunc;
2995 : Oid intypioparam;
2996 : Expr *simple;
2997 : CoerceViaIO *newexpr;
2998 :
2999 : /* Make a List so we can use simplify_function */
3000 25740 : args = list_make1(expr->arg);
3001 :
3002 : /*
3003 : * CoerceViaIO represents calling the source type's output
3004 : * function then the result type's input function. So, try to
3005 : * simplify it as though it were a stack of two such function
3006 : * calls. First we need to know what the functions are.
3007 : *
3008 : * Note that the coercion functions are assumed not to care
3009 : * about input collation, so we just pass InvalidOid for that.
3010 : */
3011 25740 : getTypeOutputInfo(exprType((Node *) expr->arg),
3012 : &outfunc, &outtypisvarlena);
3013 25740 : getTypeInputInfo(expr->resulttype,
3014 : &infunc, &intypioparam);
3015 :
3016 25740 : simple = simplify_function(outfunc,
3017 : CSTRINGOID, -1,
3018 : InvalidOid,
3019 : InvalidOid,
3020 : &args,
3021 : false,
3022 : true,
3023 : true,
3024 : context);
3025 25740 : if (simple) /* successfully simplified output fn */
3026 : {
3027 : /*
3028 : * Input functions may want 1 to 3 arguments. We always
3029 : * supply all three, trusting that nothing downstream will
3030 : * complain.
3031 : */
3032 2462 : args = list_make3(simple,
3033 : makeConst(OIDOID,
3034 : -1,
3035 : InvalidOid,
3036 : sizeof(Oid),
3037 : ObjectIdGetDatum(intypioparam),
3038 : false,
3039 : true),
3040 : makeConst(INT4OID,
3041 : -1,
3042 : InvalidOid,
3043 : sizeof(int32),
3044 : Int32GetDatum(-1),
3045 : false,
3046 : true));
3047 :
3048 2462 : simple = simplify_function(infunc,
3049 : expr->resulttype, -1,
3050 : expr->resultcollid,
3051 : InvalidOid,
3052 : &args,
3053 : false,
3054 : false,
3055 : true,
3056 : context);
3057 2356 : if (simple) /* successfully simplified input fn */
3058 2276 : return (Node *) simple;
3059 : }
3060 :
3061 : /*
3062 : * The expression cannot be simplified any further, so build
3063 : * and return a replacement CoerceViaIO node using the
3064 : * possibly-simplified argument.
3065 : */
3066 23358 : newexpr = makeNode(CoerceViaIO);
3067 23358 : newexpr->arg = (Expr *) linitial(args);
3068 23358 : newexpr->resulttype = expr->resulttype;
3069 23358 : newexpr->resultcollid = expr->resultcollid;
3070 23358 : newexpr->coerceformat = expr->coerceformat;
3071 23358 : newexpr->location = expr->location;
3072 23358 : return (Node *) newexpr;
3073 : }
3074 9966 : case T_ArrayCoerceExpr:
3075 : {
3076 9966 : ArrayCoerceExpr *ac = makeNode(ArrayCoerceExpr);
3077 : Node *save_case_val;
3078 :
3079 : /*
3080 : * Copy the node and const-simplify its arguments. We can't
3081 : * use ece_generic_processing() here because we need to mess
3082 : * with case_val only while processing the elemexpr.
3083 : */
3084 9966 : memcpy(ac, node, sizeof(ArrayCoerceExpr));
3085 9966 : ac->arg = (Expr *)
3086 9966 : eval_const_expressions_mutator((Node *) ac->arg,
3087 : context);
3088 :
3089 : /*
3090 : * Set up for the CaseTestExpr node contained in the elemexpr.
3091 : * We must prevent it from absorbing any outer CASE value.
3092 : */
3093 9966 : save_case_val = context->case_val;
3094 9966 : context->case_val = NULL;
3095 :
3096 9966 : ac->elemexpr = (Expr *)
3097 9966 : eval_const_expressions_mutator((Node *) ac->elemexpr,
3098 : context);
3099 :
3100 9966 : context->case_val = save_case_val;
3101 :
3102 : /*
3103 : * If constant argument and the per-element expression is
3104 : * immutable, we can simplify the whole thing to a constant.
3105 : * Exception: although contain_mutable_functions considers
3106 : * CoerceToDomain immutable for historical reasons, let's not
3107 : * do so here; this ensures coercion to an array-over-domain
3108 : * does not apply the domain's constraints until runtime.
3109 : */
3110 9966 : if (ac->arg && IsA(ac->arg, Const) &&
3111 1114 : ac->elemexpr && !IsA(ac->elemexpr, CoerceToDomain) &&
3112 1090 : !contain_mutable_functions((Node *) ac->elemexpr))
3113 1090 : return ece_evaluate_expr(ac);
3114 :
3115 8876 : return (Node *) ac;
3116 : }
3117 9014 : case T_CollateExpr:
3118 : {
3119 : /*
3120 : * We replace CollateExpr with RelabelType, so as to improve
3121 : * uniformity of expression representation and thus simplify
3122 : * comparison of expressions. Hence this looks very nearly
3123 : * the same as the RelabelType case, and we can apply the same
3124 : * optimizations to avoid unnecessary RelabelTypes.
3125 : */
3126 9014 : CollateExpr *collate = (CollateExpr *) node;
3127 : Node *arg;
3128 :
3129 : /* Simplify the input ... */
3130 9014 : arg = eval_const_expressions_mutator((Node *) collate->arg,
3131 : context);
3132 : /* ... and attach a new RelabelType node, if needed */
3133 9014 : return applyRelabelType(arg,
3134 : exprType(arg),
3135 : exprTypmod(arg),
3136 : collate->collOid,
3137 : COERCE_IMPLICIT_CAST,
3138 : collate->location,
3139 : true);
3140 : }
3141 33014 : case T_CaseExpr:
3142 : {
3143 : /*----------
3144 : * CASE expressions can be simplified if there are constant
3145 : * condition clauses:
3146 : * FALSE (or NULL): drop the alternative
3147 : * TRUE: drop all remaining alternatives
3148 : * If the first non-FALSE alternative is a constant TRUE,
3149 : * we can simplify the entire CASE to that alternative's
3150 : * expression. If there are no non-FALSE alternatives,
3151 : * we simplify the entire CASE to the default result (ELSE).
3152 : *
3153 : * If we have a simple-form CASE with constant test
3154 : * expression, we substitute the constant value for contained
3155 : * CaseTestExpr placeholder nodes, so that we have the
3156 : * opportunity to reduce constant test conditions. For
3157 : * example this allows
3158 : * CASE 0 WHEN 0 THEN 1 ELSE 1/0 END
3159 : * to reduce to 1 rather than drawing a divide-by-0 error.
3160 : * Note that when the test expression is constant, we don't
3161 : * have to include it in the resulting CASE; for example
3162 : * CASE 0 WHEN x THEN y ELSE z END
3163 : * is transformed by the parser to
3164 : * CASE 0 WHEN CaseTestExpr = x THEN y ELSE z END
3165 : * which we can simplify to
3166 : * CASE WHEN 0 = x THEN y ELSE z END
3167 : * It is not necessary for the executor to evaluate the "arg"
3168 : * expression when executing the CASE, since any contained
3169 : * CaseTestExprs that might have referred to it will have been
3170 : * replaced by the constant.
3171 : *----------
3172 : */
3173 33014 : CaseExpr *caseexpr = (CaseExpr *) node;
3174 : CaseExpr *newcase;
3175 : Node *save_case_val;
3176 : Node *newarg;
3177 : List *newargs;
3178 : bool const_true_cond;
3179 33014 : Node *defresult = NULL;
3180 : ListCell *arg;
3181 :
3182 : /* Simplify the test expression, if any */
3183 33014 : newarg = eval_const_expressions_mutator((Node *) caseexpr->arg,
3184 : context);
3185 :
3186 : /* Set up for contained CaseTestExpr nodes */
3187 33014 : save_case_val = context->case_val;
3188 33014 : if (newarg && IsA(newarg, Const))
3189 : {
3190 78 : context->case_val = newarg;
3191 78 : newarg = NULL; /* not needed anymore, see above */
3192 : }
3193 : else
3194 32936 : context->case_val = NULL;
3195 :
3196 : /* Simplify the WHEN clauses */
3197 33014 : newargs = NIL;
3198 33014 : const_true_cond = false;
3199 94012 : foreach(arg, caseexpr->args)
3200 : {
3201 61720 : CaseWhen *oldcasewhen = lfirst_node(CaseWhen, arg);
3202 : Node *casecond;
3203 : Node *caseresult;
3204 :
3205 : /* Simplify this alternative's test condition */
3206 61720 : casecond = eval_const_expressions_mutator((Node *) oldcasewhen->expr,
3207 : context);
3208 :
3209 : /*
3210 : * If the test condition is constant FALSE (or NULL), then
3211 : * drop this WHEN clause completely, without processing
3212 : * the result.
3213 : */
3214 61720 : if (casecond && IsA(casecond, Const))
3215 : {
3216 1908 : Const *const_input = (Const *) casecond;
3217 :
3218 1908 : if (const_input->constisnull ||
3219 1908 : !DatumGetBool(const_input->constvalue))
3220 1192 : continue; /* drop alternative with FALSE cond */
3221 : /* Else it's constant TRUE */
3222 716 : const_true_cond = true;
3223 : }
3224 :
3225 : /* Simplify this alternative's result value */
3226 60528 : caseresult = eval_const_expressions_mutator((Node *) oldcasewhen->result,
3227 : context);
3228 :
3229 : /* If non-constant test condition, emit a new WHEN node */
3230 60522 : if (!const_true_cond)
3231 59806 : {
3232 59806 : CaseWhen *newcasewhen = makeNode(CaseWhen);
3233 :
3234 59806 : newcasewhen->expr = (Expr *) casecond;
3235 59806 : newcasewhen->result = (Expr *) caseresult;
3236 59806 : newcasewhen->location = oldcasewhen->location;
3237 59806 : newargs = lappend(newargs, newcasewhen);
3238 59806 : continue;
3239 : }
3240 :
3241 : /*
3242 : * Found a TRUE condition, so none of the remaining
3243 : * alternatives can be reached. We treat the result as
3244 : * the default result.
3245 : */
3246 716 : defresult = caseresult;
3247 716 : break;
3248 : }
3249 :
3250 : /* Simplify the default result, unless we replaced it above */
3251 33008 : if (!const_true_cond)
3252 32292 : defresult = eval_const_expressions_mutator((Node *) caseexpr->defresult,
3253 : context);
3254 :
3255 33008 : context->case_val = save_case_val;
3256 :
3257 : /*
3258 : * If no non-FALSE alternatives, CASE reduces to the default
3259 : * result
3260 : */
3261 33008 : if (newargs == NIL)
3262 1148 : return defresult;
3263 : /* Otherwise we need a new CASE node */
3264 31860 : newcase = makeNode(CaseExpr);
3265 31860 : newcase->casetype = caseexpr->casetype;
3266 31860 : newcase->casecollid = caseexpr->casecollid;
3267 31860 : newcase->arg = (Expr *) newarg;
3268 31860 : newcase->args = newargs;
3269 31860 : newcase->defresult = (Expr *) defresult;
3270 31860 : newcase->location = caseexpr->location;
3271 31860 : return (Node *) newcase;
3272 : }
3273 32454 : case T_CaseTestExpr:
3274 : {
3275 : /*
3276 : * If we know a constant test value for the current CASE
3277 : * construct, substitute it for the placeholder. Else just
3278 : * return the placeholder as-is.
3279 : */
3280 32454 : if (context->case_val)
3281 130 : return copyObject(context->case_val);
3282 : else
3283 32324 : return copyObject(node);
3284 : }
3285 59964 : case T_SubscriptingRef:
3286 : case T_ArrayExpr:
3287 : case T_RowExpr:
3288 : case T_MinMaxExpr:
3289 : {
3290 : /*
3291 : * Generic handling for node types whose own processing is
3292 : * known to be immutable, and for which we need no smarts
3293 : * beyond "simplify if all inputs are constants".
3294 : *
3295 : * Treating SubscriptingRef this way assumes that subscripting
3296 : * fetch and assignment are both immutable. This constrains
3297 : * type-specific subscripting implementations; maybe we should
3298 : * relax it someday.
3299 : *
3300 : * Treating MinMaxExpr this way amounts to assuming that the
3301 : * btree comparison function it calls is immutable; see the
3302 : * reasoning in contain_mutable_functions_walker.
3303 : */
3304 :
3305 : /* Copy the node and const-simplify its arguments */
3306 59964 : node = ece_generic_processing(node);
3307 : /* If all arguments are Consts, we can fold to a constant */
3308 59964 : if (ece_all_arguments_const(node))
3309 30228 : return ece_evaluate_expr(node);
3310 29736 : return node;
3311 : }
3312 2634 : case T_CoalesceExpr:
3313 : {
3314 2634 : CoalesceExpr *coalesceexpr = (CoalesceExpr *) node;
3315 : CoalesceExpr *newcoalesce;
3316 : List *newargs;
3317 : ListCell *arg;
3318 :
3319 2634 : newargs = NIL;
3320 6342 : foreach(arg, coalesceexpr->args)
3321 : {
3322 : Node *e;
3323 :
3324 5208 : e = eval_const_expressions_mutator((Node *) lfirst(arg),
3325 : context);
3326 :
3327 : /*
3328 : * We can remove null constants from the list. For a
3329 : * non-null constant, if it has not been preceded by any
3330 : * other non-null-constant expressions then it is the
3331 : * result. Otherwise, it's the next argument, but we can
3332 : * drop following arguments since they will never be
3333 : * reached.
3334 : */
3335 5208 : if (IsA(e, Const))
3336 : {
3337 1544 : if (((Const *) e)->constisnull)
3338 44 : continue; /* drop null constant */
3339 1500 : if (newargs == NIL)
3340 98 : return e; /* first expr */
3341 1402 : newargs = lappend(newargs, e);
3342 1402 : break;
3343 : }
3344 3664 : newargs = lappend(newargs, e);
3345 : }
3346 :
3347 : /*
3348 : * If all the arguments were constant null, the result is just
3349 : * null
3350 : */
3351 2536 : if (newargs == NIL)
3352 0 : return (Node *) makeNullConst(coalesceexpr->coalescetype,
3353 : -1,
3354 : coalesceexpr->coalescecollid);
3355 :
3356 : /*
3357 : * If there's exactly one surviving argument, we no longer
3358 : * need COALESCE at all: the result is that argument
3359 : */
3360 2536 : if (list_length(newargs) == 1)
3361 18 : return (Node *) linitial(newargs);
3362 :
3363 2518 : newcoalesce = makeNode(CoalesceExpr);
3364 2518 : newcoalesce->coalescetype = coalesceexpr->coalescetype;
3365 2518 : newcoalesce->coalescecollid = coalesceexpr->coalescecollid;
3366 2518 : newcoalesce->args = newargs;
3367 2518 : newcoalesce->location = coalesceexpr->location;
3368 2518 : return (Node *) newcoalesce;
3369 : }
3370 4922 : case T_SQLValueFunction:
3371 : {
3372 : /*
3373 : * All variants of SQLValueFunction are stable, so if we are
3374 : * estimating the expression's value, we should evaluate the
3375 : * current function value. Otherwise just copy.
3376 : */
3377 4922 : SQLValueFunction *svf = (SQLValueFunction *) node;
3378 :
3379 4922 : if (context->estimate)
3380 850 : return (Node *) evaluate_expr((Expr *) svf,
3381 : svf->type,
3382 : svf->typmod,
3383 : InvalidOid);
3384 : else
3385 4072 : return copyObject((Node *) svf);
3386 : }
3387 5612 : case T_FieldSelect:
3388 : {
3389 : /*
3390 : * We can optimize field selection from a whole-row Var into a
3391 : * simple Var. (This case won't be generated directly by the
3392 : * parser, because ParseComplexProjection short-circuits it.
3393 : * But it can arise while simplifying functions.) Also, we
3394 : * can optimize field selection from a RowExpr construct, or
3395 : * of course from a constant.
3396 : *
3397 : * However, replacing a whole-row Var in this way has a
3398 : * pitfall: if we've already built the rel targetlist for the
3399 : * source relation, then the whole-row Var is scheduled to be
3400 : * produced by the relation scan, but the simple Var probably
3401 : * isn't, which will lead to a failure in setrefs.c. This is
3402 : * not a problem when handling simple single-level queries, in
3403 : * which expression simplification always happens first. It
3404 : * is a risk for lateral references from subqueries, though.
3405 : * To avoid such failures, don't optimize uplevel references.
3406 : *
3407 : * We must also check that the declared type of the field is
3408 : * still the same as when the FieldSelect was created --- this
3409 : * can change if someone did ALTER COLUMN TYPE on the rowtype.
3410 : * If it isn't, we skip the optimization; the case will
3411 : * probably fail at runtime, but that's not our problem here.
3412 : */
3413 5612 : FieldSelect *fselect = (FieldSelect *) node;
3414 : FieldSelect *newfselect;
3415 : Node *arg;
3416 :
3417 5612 : arg = eval_const_expressions_mutator((Node *) fselect->arg,
3418 : context);
3419 5612 : if (arg && IsA(arg, Var) &&
3420 1560 : ((Var *) arg)->varattno == InvalidAttrNumber &&
3421 90 : ((Var *) arg)->varlevelsup == 0)
3422 : {
3423 78 : if (rowtype_field_matches(((Var *) arg)->vartype,
3424 78 : fselect->fieldnum,
3425 : fselect->resulttype,
3426 : fselect->resulttypmod,
3427 : fselect->resultcollid))
3428 : {
3429 : Var *newvar;
3430 :
3431 78 : newvar = makeVar(((Var *) arg)->varno,
3432 78 : fselect->fieldnum,
3433 : fselect->resulttype,
3434 : fselect->resulttypmod,
3435 : fselect->resultcollid,
3436 : ((Var *) arg)->varlevelsup);
3437 : /* New Var has same OLD/NEW returning as old one */
3438 78 : newvar->varreturningtype = ((Var *) arg)->varreturningtype;
3439 : /* New Var is nullable by same rels as the old one */
3440 78 : newvar->varnullingrels = ((Var *) arg)->varnullingrels;
3441 78 : return (Node *) newvar;
3442 : }
3443 : }
3444 5534 : if (arg && IsA(arg, RowExpr))
3445 : {
3446 24 : RowExpr *rowexpr = (RowExpr *) arg;
3447 :
3448 48 : if (fselect->fieldnum > 0 &&
3449 24 : fselect->fieldnum <= list_length(rowexpr->args))
3450 : {
3451 24 : Node *fld = (Node *) list_nth(rowexpr->args,
3452 24 : fselect->fieldnum - 1);
3453 :
3454 24 : if (rowtype_field_matches(rowexpr->row_typeid,
3455 24 : fselect->fieldnum,
3456 : fselect->resulttype,
3457 : fselect->resulttypmod,
3458 24 : fselect->resultcollid) &&
3459 48 : fselect->resulttype == exprType(fld) &&
3460 48 : fselect->resulttypmod == exprTypmod(fld) &&
3461 24 : fselect->resultcollid == exprCollation(fld))
3462 24 : return fld;
3463 : }
3464 : }
3465 5510 : newfselect = makeNode(FieldSelect);
3466 5510 : newfselect->arg = (Expr *) arg;
3467 5510 : newfselect->fieldnum = fselect->fieldnum;
3468 5510 : newfselect->resulttype = fselect->resulttype;
3469 5510 : newfselect->resulttypmod = fselect->resulttypmod;
3470 5510 : newfselect->resultcollid = fselect->resultcollid;
3471 5510 : if (arg && IsA(arg, Const))
3472 : {
3473 618 : Const *con = (Const *) arg;
3474 :
3475 618 : if (rowtype_field_matches(con->consttype,
3476 618 : newfselect->fieldnum,
3477 : newfselect->resulttype,
3478 : newfselect->resulttypmod,
3479 : newfselect->resultcollid))
3480 618 : return ece_evaluate_expr(newfselect);
3481 : }
3482 4892 : return (Node *) newfselect;
3483 : }
3484 35508 : case T_NullTest:
3485 : {
3486 35508 : NullTest *ntest = (NullTest *) node;
3487 : NullTest *newntest;
3488 : Node *arg;
3489 :
3490 35508 : arg = eval_const_expressions_mutator((Node *) ntest->arg,
3491 : context);
3492 35506 : if (ntest->argisrow && arg && IsA(arg, RowExpr))
3493 : {
3494 : /*
3495 : * We break ROW(...) IS [NOT] NULL into separate tests on
3496 : * its component fields. This form is usually more
3497 : * efficient to evaluate, as well as being more amenable
3498 : * to optimization.
3499 : */
3500 48 : RowExpr *rarg = (RowExpr *) arg;
3501 48 : List *newargs = NIL;
3502 : ListCell *l;
3503 :
3504 174 : foreach(l, rarg->args)
3505 : {
3506 126 : Node *relem = (Node *) lfirst(l);
3507 :
3508 : /*
3509 : * A constant field refutes the whole NullTest if it's
3510 : * of the wrong nullness; else we can discard it.
3511 : */
3512 126 : if (relem && IsA(relem, Const))
3513 0 : {
3514 0 : Const *carg = (Const *) relem;
3515 :
3516 0 : if (carg->constisnull ?
3517 0 : (ntest->nulltesttype == IS_NOT_NULL) :
3518 0 : (ntest->nulltesttype == IS_NULL))
3519 0 : return makeBoolConst(false, false);
3520 0 : continue;
3521 : }
3522 :
3523 : /*
3524 : * Else, make a scalar (argisrow == false) NullTest
3525 : * for this field. Scalar semantics are required
3526 : * because IS [NOT] NULL doesn't recurse; see comments
3527 : * in ExecEvalRowNullInt().
3528 : */
3529 126 : newntest = makeNode(NullTest);
3530 126 : newntest->arg = (Expr *) relem;
3531 126 : newntest->nulltesttype = ntest->nulltesttype;
3532 126 : newntest->argisrow = false;
3533 126 : newntest->location = ntest->location;
3534 126 : newargs = lappend(newargs, newntest);
3535 : }
3536 : /* If all the inputs were constants, result is TRUE */
3537 48 : if (newargs == NIL)
3538 0 : return makeBoolConst(true, false);
3539 : /* If only one nonconst input, it's the result */
3540 48 : if (list_length(newargs) == 1)
3541 0 : return (Node *) linitial(newargs);
3542 : /* Else we need an AND node */
3543 48 : return (Node *) make_andclause(newargs);
3544 : }
3545 35458 : if (!ntest->argisrow && arg && IsA(arg, Const))
3546 : {
3547 394 : Const *carg = (Const *) arg;
3548 : bool result;
3549 :
3550 394 : switch (ntest->nulltesttype)
3551 : {
3552 328 : case IS_NULL:
3553 328 : result = carg->constisnull;
3554 328 : break;
3555 66 : case IS_NOT_NULL:
3556 66 : result = !carg->constisnull;
3557 66 : break;
3558 0 : default:
3559 0 : elog(ERROR, "unrecognized nulltesttype: %d",
3560 : (int) ntest->nulltesttype);
3561 : result = false; /* keep compiler quiet */
3562 : break;
3563 : }
3564 :
3565 394 : return makeBoolConst(result, false);
3566 : }
3567 35064 : if (!ntest->argisrow && arg && IsA(arg, Var) && context->root)
3568 : {
3569 16346 : Var *varg = (Var *) arg;
3570 : bool result;
3571 :
3572 16346 : if (var_is_nonnullable(context->root, varg, false))
3573 : {
3574 462 : switch (ntest->nulltesttype)
3575 : {
3576 112 : case IS_NULL:
3577 112 : result = false;
3578 112 : break;
3579 350 : case IS_NOT_NULL:
3580 350 : result = true;
3581 350 : break;
3582 0 : default:
3583 0 : elog(ERROR, "unrecognized nulltesttype: %d",
3584 : (int) ntest->nulltesttype);
3585 : result = false; /* keep compiler quiet */
3586 : break;
3587 : }
3588 :
3589 462 : return makeBoolConst(result, false);
3590 : }
3591 : }
3592 :
3593 34602 : newntest = makeNode(NullTest);
3594 34602 : newntest->arg = (Expr *) arg;
3595 34602 : newntest->nulltesttype = ntest->nulltesttype;
3596 34602 : newntest->argisrow = ntest->argisrow;
3597 34602 : newntest->location = ntest->location;
3598 34602 : return (Node *) newntest;
3599 : }
3600 1928 : case T_BooleanTest:
3601 : {
3602 : /*
3603 : * This case could be folded into the generic handling used
3604 : * for ArrayExpr etc. But because the simplification logic is
3605 : * so trivial, applying evaluate_expr() to perform it would be
3606 : * a heavy overhead. BooleanTest is probably common enough to
3607 : * justify keeping this bespoke implementation.
3608 : */
3609 1928 : BooleanTest *btest = (BooleanTest *) node;
3610 : BooleanTest *newbtest;
3611 : Node *arg;
3612 :
3613 1928 : arg = eval_const_expressions_mutator((Node *) btest->arg,
3614 : context);
3615 1928 : if (arg && IsA(arg, Const))
3616 : {
3617 222 : Const *carg = (Const *) arg;
3618 : bool result;
3619 :
3620 222 : switch (btest->booltesttype)
3621 : {
3622 0 : case IS_TRUE:
3623 0 : result = (!carg->constisnull &&
3624 0 : DatumGetBool(carg->constvalue));
3625 0 : break;
3626 222 : case IS_NOT_TRUE:
3627 444 : result = (carg->constisnull ||
3628 222 : !DatumGetBool(carg->constvalue));
3629 222 : break;
3630 0 : case IS_FALSE:
3631 0 : result = (!carg->constisnull &&
3632 0 : !DatumGetBool(carg->constvalue));
3633 0 : break;
3634 0 : case IS_NOT_FALSE:
3635 0 : result = (carg->constisnull ||
3636 0 : DatumGetBool(carg->constvalue));
3637 0 : break;
3638 0 : case IS_UNKNOWN:
3639 0 : result = carg->constisnull;
3640 0 : break;
3641 0 : case IS_NOT_UNKNOWN:
3642 0 : result = !carg->constisnull;
3643 0 : break;
3644 0 : default:
3645 0 : elog(ERROR, "unrecognized booltesttype: %d",
3646 : (int) btest->booltesttype);
3647 : result = false; /* keep compiler quiet */
3648 : break;
3649 : }
3650 :
3651 222 : return makeBoolConst(result, false);
3652 : }
3653 :
3654 1706 : newbtest = makeNode(BooleanTest);
3655 1706 : newbtest->arg = (Expr *) arg;
3656 1706 : newbtest->booltesttype = btest->booltesttype;
3657 1706 : newbtest->location = btest->location;
3658 1706 : return (Node *) newbtest;
3659 : }
3660 27618 : case T_CoerceToDomain:
3661 : {
3662 : /*
3663 : * If the domain currently has no constraints, we replace the
3664 : * CoerceToDomain node with a simple RelabelType, which is
3665 : * both far faster to execute and more amenable to later
3666 : * optimization. We must then mark the plan as needing to be
3667 : * rebuilt if the domain's constraints change.
3668 : *
3669 : * Also, in estimation mode, always replace CoerceToDomain
3670 : * nodes, effectively assuming that the coercion will succeed.
3671 : */
3672 27618 : CoerceToDomain *cdomain = (CoerceToDomain *) node;
3673 : CoerceToDomain *newcdomain;
3674 : Node *arg;
3675 :
3676 27618 : arg = eval_const_expressions_mutator((Node *) cdomain->arg,
3677 : context);
3678 27588 : if (context->estimate ||
3679 27540 : !DomainHasConstraints(cdomain->resulttype))
3680 : {
3681 : /* Record dependency, if this isn't estimation mode */
3682 18370 : if (context->root && !context->estimate)
3683 18256 : record_plan_type_dependency(context->root,
3684 : cdomain->resulttype);
3685 :
3686 : /* Generate RelabelType to substitute for CoerceToDomain */
3687 18370 : return applyRelabelType(arg,
3688 : cdomain->resulttype,
3689 : cdomain->resulttypmod,
3690 : cdomain->resultcollid,
3691 : cdomain->coercionformat,
3692 : cdomain->location,
3693 : true);
3694 : }
3695 :
3696 9218 : newcdomain = makeNode(CoerceToDomain);
3697 9218 : newcdomain->arg = (Expr *) arg;
3698 9218 : newcdomain->resulttype = cdomain->resulttype;
3699 9218 : newcdomain->resulttypmod = cdomain->resulttypmod;
3700 9218 : newcdomain->resultcollid = cdomain->resultcollid;
3701 9218 : newcdomain->coercionformat = cdomain->coercionformat;
3702 9218 : newcdomain->location = cdomain->location;
3703 9218 : return (Node *) newcdomain;
3704 : }
3705 3748 : case T_PlaceHolderVar:
3706 :
3707 : /*
3708 : * In estimation mode, just strip the PlaceHolderVar node
3709 : * altogether; this amounts to estimating that the contained value
3710 : * won't be forced to null by an outer join. In regular mode we
3711 : * just use the default behavior (ie, simplify the expression but
3712 : * leave the PlaceHolderVar node intact).
3713 : */
3714 3748 : if (context->estimate)
3715 : {
3716 354 : PlaceHolderVar *phv = (PlaceHolderVar *) node;
3717 :
3718 354 : return eval_const_expressions_mutator((Node *) phv->phexpr,
3719 : context);
3720 : }
3721 3394 : break;
3722 90 : case T_ConvertRowtypeExpr:
3723 : {
3724 90 : ConvertRowtypeExpr *cre = castNode(ConvertRowtypeExpr, node);
3725 : Node *arg;
3726 : ConvertRowtypeExpr *newcre;
3727 :
3728 90 : arg = eval_const_expressions_mutator((Node *) cre->arg,
3729 : context);
3730 :
3731 90 : newcre = makeNode(ConvertRowtypeExpr);
3732 90 : newcre->resulttype = cre->resulttype;
3733 90 : newcre->convertformat = cre->convertformat;
3734 90 : newcre->location = cre->location;
3735 :
3736 : /*
3737 : * In case of a nested ConvertRowtypeExpr, we can convert the
3738 : * leaf row directly to the topmost row format without any
3739 : * intermediate conversions. (This works because
3740 : * ConvertRowtypeExpr is used only for child->parent
3741 : * conversion in inheritance trees, which works by exact match
3742 : * of column name, and a column absent in an intermediate
3743 : * result can't be present in the final result.)
3744 : *
3745 : * No need to check more than one level deep, because the
3746 : * above recursion will have flattened anything else.
3747 : */
3748 90 : if (arg != NULL && IsA(arg, ConvertRowtypeExpr))
3749 : {
3750 12 : ConvertRowtypeExpr *argcre = (ConvertRowtypeExpr *) arg;
3751 :
3752 12 : arg = (Node *) argcre->arg;
3753 :
3754 : /*
3755 : * Make sure an outer implicit conversion can't hide an
3756 : * inner explicit one.
3757 : */
3758 12 : if (newcre->convertformat == COERCE_IMPLICIT_CAST)
3759 0 : newcre->convertformat = argcre->convertformat;
3760 : }
3761 :
3762 90 : newcre->arg = (Expr *) arg;
3763 :
3764 90 : if (arg != NULL && IsA(arg, Const))
3765 18 : return ece_evaluate_expr((Node *) newcre);
3766 72 : return (Node *) newcre;
3767 : }
3768 6618322 : default:
3769 6618322 : break;
3770 : }
3771 :
3772 : /*
3773 : * For any node type not handled above, copy the node unchanged but
3774 : * const-simplify its subexpressions. This is the correct thing for node
3775 : * types whose behavior might change between planning and execution, such
3776 : * as CurrentOfExpr. It's also a safe default for new node types not
3777 : * known to this routine.
3778 : */
3779 6621716 : return ece_generic_processing(node);
3780 : }
3781 :
3782 : /*
3783 : * Subroutine for eval_const_expressions: check for non-Const nodes.
3784 : *
3785 : * We can abort recursion immediately on finding a non-Const node. This is
3786 : * critical for performance, else eval_const_expressions_mutator would take
3787 : * O(N^2) time on non-simplifiable trees. However, we do need to descend
3788 : * into List nodes since expression_tree_walker sometimes invokes the walker
3789 : * function directly on List subtrees.
3790 : */
3791 : static bool
3792 211668 : contain_non_const_walker(Node *node, void *context)
3793 : {
3794 211668 : if (node == NULL)
3795 712 : return false;
3796 210956 : if (IsA(node, Const))
3797 108000 : return false;
3798 102956 : if (IsA(node, List))
3799 35772 : return expression_tree_walker(node, contain_non_const_walker, context);
3800 : /* Otherwise, abort the tree traversal and return true */
3801 67184 : return true;
3802 : }
3803 :
3804 : /*
3805 : * Subroutine for eval_const_expressions: check if a function is OK to evaluate
3806 : */
3807 : static bool
3808 376 : ece_function_is_safe(Oid funcid, eval_const_expressions_context *context)
3809 : {
3810 376 : char provolatile = func_volatile(funcid);
3811 :
3812 : /*
3813 : * Ordinarily we are only allowed to simplify immutable functions. But for
3814 : * purposes of estimation, we consider it okay to simplify functions that
3815 : * are merely stable; the risk that the result might change from planning
3816 : * time to execution time is worth taking in preference to not being able
3817 : * to estimate the value at all.
3818 : */
3819 376 : if (provolatile == PROVOLATILE_IMMUTABLE)
3820 376 : return true;
3821 0 : if (context->estimate && provolatile == PROVOLATILE_STABLE)
3822 0 : return true;
3823 0 : return false;
3824 : }
3825 :
3826 : /*
3827 : * Subroutine for eval_const_expressions: process arguments of an OR clause
3828 : *
3829 : * This includes flattening of nested ORs as well as recursion to
3830 : * eval_const_expressions to simplify the OR arguments.
3831 : *
3832 : * After simplification, OR arguments are handled as follows:
3833 : * non constant: keep
3834 : * FALSE: drop (does not affect result)
3835 : * TRUE: force result to TRUE
3836 : * NULL: keep only one
3837 : * We must keep one NULL input because OR expressions evaluate to NULL when no
3838 : * input is TRUE and at least one is NULL. We don't actually include the NULL
3839 : * here, that's supposed to be done by the caller.
3840 : *
3841 : * The output arguments *haveNull and *forceTrue must be initialized false
3842 : * by the caller. They will be set true if a NULL constant or TRUE constant,
3843 : * respectively, is detected anywhere in the argument list.
3844 : */
3845 : static List *
3846 12448 : simplify_or_arguments(List *args,
3847 : eval_const_expressions_context *context,
3848 : bool *haveNull, bool *forceTrue)
3849 : {
3850 12448 : List *newargs = NIL;
3851 : List *unprocessed_args;
3852 :
3853 : /*
3854 : * We want to ensure that any OR immediately beneath another OR gets
3855 : * flattened into a single OR-list, so as to simplify later reasoning.
3856 : *
3857 : * To avoid stack overflow from recursion of eval_const_expressions, we
3858 : * resort to some tenseness here: we keep a list of not-yet-processed
3859 : * inputs, and handle flattening of nested ORs by prepending to the to-do
3860 : * list instead of recursing. Now that the parser generates N-argument
3861 : * ORs from simple lists, this complexity is probably less necessary than
3862 : * it once was, but we might as well keep the logic.
3863 : */
3864 12448 : unprocessed_args = list_copy(args);
3865 41926 : while (unprocessed_args)
3866 : {
3867 29650 : Node *arg = (Node *) linitial(unprocessed_args);
3868 :
3869 29650 : unprocessed_args = list_delete_first(unprocessed_args);
3870 :
3871 : /* flatten nested ORs as per above comment */
3872 29650 : if (is_orclause(arg))
3873 6 : {
3874 6 : List *subargs = ((BoolExpr *) arg)->args;
3875 6 : List *oldlist = unprocessed_args;
3876 :
3877 6 : unprocessed_args = list_concat_copy(subargs, unprocessed_args);
3878 : /* perhaps-overly-tense code to avoid leaking old lists */
3879 6 : list_free(oldlist);
3880 6 : continue;
3881 : }
3882 :
3883 : /* If it's not an OR, simplify it */
3884 29644 : arg = eval_const_expressions_mutator(arg, context);
3885 :
3886 : /*
3887 : * It is unlikely but not impossible for simplification of a non-OR
3888 : * clause to produce an OR. Recheck, but don't be too tense about it
3889 : * since it's not a mainstream case. In particular we don't worry
3890 : * about const-simplifying the input twice, nor about list leakage.
3891 : */
3892 29644 : if (is_orclause(arg))
3893 0 : {
3894 0 : List *subargs = ((BoolExpr *) arg)->args;
3895 :
3896 0 : unprocessed_args = list_concat_copy(subargs, unprocessed_args);
3897 0 : continue;
3898 : }
3899 :
3900 : /*
3901 : * OK, we have a const-simplified non-OR argument. Process it per
3902 : * comments above.
3903 : */
3904 29644 : if (IsA(arg, Const))
3905 236 : {
3906 408 : Const *const_input = (Const *) arg;
3907 :
3908 408 : if (const_input->constisnull)
3909 48 : *haveNull = true;
3910 360 : else if (DatumGetBool(const_input->constvalue))
3911 : {
3912 172 : *forceTrue = true;
3913 :
3914 : /*
3915 : * Once we detect a TRUE result we can just exit the loop
3916 : * immediately. However, if we ever add a notion of
3917 : * non-removable functions, we'd need to keep scanning.
3918 : */
3919 172 : return NIL;
3920 : }
3921 : /* otherwise, we can drop the constant-false input */
3922 236 : continue;
3923 : }
3924 :
3925 : /* else emit the simplified arg into the result list */
3926 29236 : newargs = lappend(newargs, arg);
3927 : }
3928 :
3929 12276 : return newargs;
3930 : }
3931 :
3932 : /*
3933 : * Subroutine for eval_const_expressions: process arguments of an AND clause
3934 : *
3935 : * This includes flattening of nested ANDs as well as recursion to
3936 : * eval_const_expressions to simplify the AND arguments.
3937 : *
3938 : * After simplification, AND arguments are handled as follows:
3939 : * non constant: keep
3940 : * TRUE: drop (does not affect result)
3941 : * FALSE: force result to FALSE
3942 : * NULL: keep only one
3943 : * We must keep one NULL input because AND expressions evaluate to NULL when
3944 : * no input is FALSE and at least one is NULL. We don't actually include the
3945 : * NULL here, that's supposed to be done by the caller.
3946 : *
3947 : * The output arguments *haveNull and *forceFalse must be initialized false
3948 : * by the caller. They will be set true if a null constant or false constant,
3949 : * respectively, is detected anywhere in the argument list.
3950 : */
3951 : static List *
3952 141460 : simplify_and_arguments(List *args,
3953 : eval_const_expressions_context *context,
3954 : bool *haveNull, bool *forceFalse)
3955 : {
3956 141460 : List *newargs = NIL;
3957 : List *unprocessed_args;
3958 :
3959 : /* See comments in simplify_or_arguments */
3960 141460 : unprocessed_args = list_copy(args);
3961 520624 : while (unprocessed_args)
3962 : {
3963 380718 : Node *arg = (Node *) linitial(unprocessed_args);
3964 :
3965 380718 : unprocessed_args = list_delete_first(unprocessed_args);
3966 :
3967 : /* flatten nested ANDs as per above comment */
3968 380718 : if (is_andclause(arg))
3969 2104 : {
3970 2104 : List *subargs = ((BoolExpr *) arg)->args;
3971 2104 : List *oldlist = unprocessed_args;
3972 :
3973 2104 : unprocessed_args = list_concat_copy(subargs, unprocessed_args);
3974 : /* perhaps-overly-tense code to avoid leaking old lists */
3975 2104 : list_free(oldlist);
3976 2104 : continue;
3977 : }
3978 :
3979 : /* If it's not an AND, simplify it */
3980 378614 : arg = eval_const_expressions_mutator(arg, context);
3981 :
3982 : /*
3983 : * It is unlikely but not impossible for simplification of a non-AND
3984 : * clause to produce an AND. Recheck, but don't be too tense about it
3985 : * since it's not a mainstream case. In particular we don't worry
3986 : * about const-simplifying the input twice, nor about list leakage.
3987 : */
3988 378614 : if (is_andclause(arg))
3989 36 : {
3990 36 : List *subargs = ((BoolExpr *) arg)->args;
3991 :
3992 36 : unprocessed_args = list_concat_copy(subargs, unprocessed_args);
3993 36 : continue;
3994 : }
3995 :
3996 : /*
3997 : * OK, we have a const-simplified non-AND argument. Process it per
3998 : * comments above.
3999 : */
4000 378578 : if (IsA(arg, Const))
4001 1982 : {
4002 3536 : Const *const_input = (Const *) arg;
4003 :
4004 3536 : if (const_input->constisnull)
4005 18 : *haveNull = true;
4006 3518 : else if (!DatumGetBool(const_input->constvalue))
4007 : {
4008 1554 : *forceFalse = true;
4009 :
4010 : /*
4011 : * Once we detect a FALSE result we can just exit the loop
4012 : * immediately. However, if we ever add a notion of
4013 : * non-removable functions, we'd need to keep scanning.
4014 : */
4015 1554 : return NIL;
4016 : }
4017 : /* otherwise, we can drop the constant-true input */
4018 1982 : continue;
4019 : }
4020 :
4021 : /* else emit the simplified arg into the result list */
4022 375042 : newargs = lappend(newargs, arg);
4023 : }
4024 :
4025 139906 : return newargs;
4026 : }
4027 :
4028 : /*
4029 : * Subroutine for eval_const_expressions: try to simplify boolean equality
4030 : * or inequality condition
4031 : *
4032 : * Inputs are the operator OID and the simplified arguments to the operator.
4033 : * Returns a simplified expression if successful, or NULL if cannot
4034 : * simplify the expression.
4035 : *
4036 : * The idea here is to reduce "x = true" to "x" and "x = false" to "NOT x",
4037 : * or similarly "x <> true" to "NOT x" and "x <> false" to "x".
4038 : * This is only marginally useful in itself, but doing it in constant folding
4039 : * ensures that we will recognize these forms as being equivalent in, for
4040 : * example, partial index matching.
4041 : *
4042 : * We come here only if simplify_function has failed; therefore we cannot
4043 : * see two constant inputs, nor a constant-NULL input.
4044 : */
4045 : static Node *
4046 1298 : simplify_boolean_equality(Oid opno, List *args)
4047 : {
4048 : Node *leftop;
4049 : Node *rightop;
4050 :
4051 : Assert(list_length(args) == 2);
4052 1298 : leftop = linitial(args);
4053 1298 : rightop = lsecond(args);
4054 1298 : if (leftop && IsA(leftop, Const))
4055 : {
4056 : Assert(!((Const *) leftop)->constisnull);
4057 0 : if (opno == BooleanEqualOperator)
4058 : {
4059 0 : if (DatumGetBool(((Const *) leftop)->constvalue))
4060 0 : return rightop; /* true = foo */
4061 : else
4062 0 : return negate_clause(rightop); /* false = foo */
4063 : }
4064 : else
4065 : {
4066 0 : if (DatumGetBool(((Const *) leftop)->constvalue))
4067 0 : return negate_clause(rightop); /* true <> foo */
4068 : else
4069 0 : return rightop; /* false <> foo */
4070 : }
4071 : }
4072 1298 : if (rightop && IsA(rightop, Const))
4073 : {
4074 : Assert(!((Const *) rightop)->constisnull);
4075 1036 : if (opno == BooleanEqualOperator)
4076 : {
4077 970 : if (DatumGetBool(((Const *) rightop)->constvalue))
4078 238 : return leftop; /* foo = true */
4079 : else
4080 732 : return negate_clause(leftop); /* foo = false */
4081 : }
4082 : else
4083 : {
4084 66 : if (DatumGetBool(((Const *) rightop)->constvalue))
4085 60 : return negate_clause(leftop); /* foo <> true */
4086 : else
4087 6 : return leftop; /* foo <> false */
4088 : }
4089 : }
4090 262 : return NULL;
4091 : }
4092 :
4093 : /*
4094 : * Subroutine for eval_const_expressions: try to simplify a function call
4095 : * (which might originally have been an operator; we don't care)
4096 : *
4097 : * Inputs are the function OID, actual result type OID (which is needed for
4098 : * polymorphic functions), result typmod, result collation, the input
4099 : * collation to use for the function, the original argument list (not
4100 : * const-simplified yet, unless process_args is false), and some flags;
4101 : * also the context data for eval_const_expressions.
4102 : *
4103 : * Returns a simplified expression if successful, or NULL if cannot
4104 : * simplify the function call.
4105 : *
4106 : * This function is also responsible for converting named-notation argument
4107 : * lists into positional notation and/or adding any needed default argument
4108 : * expressions; which is a bit grotty, but it avoids extra fetches of the
4109 : * function's pg_proc tuple. For this reason, the args list is
4110 : * pass-by-reference. Conversion and const-simplification of the args list
4111 : * will be done even if simplification of the function call itself is not
4112 : * possible.
4113 : */
4114 : static Expr *
4115 1252882 : simplify_function(Oid funcid, Oid result_type, int32 result_typmod,
4116 : Oid result_collid, Oid input_collid, List **args_p,
4117 : bool funcvariadic, bool process_args, bool allow_non_const,
4118 : eval_const_expressions_context *context)
4119 : {
4120 1252882 : List *args = *args_p;
4121 : HeapTuple func_tuple;
4122 : Form_pg_proc func_form;
4123 : Expr *newexpr;
4124 :
4125 : /*
4126 : * We have three strategies for simplification: execute the function to
4127 : * deliver a constant result, use a transform function to generate a
4128 : * substitute node tree, or expand in-line the body of the function
4129 : * definition (which only works for simple SQL-language functions, but
4130 : * that is a common case). Each case needs access to the function's
4131 : * pg_proc tuple, so fetch it just once.
4132 : *
4133 : * Note: the allow_non_const flag suppresses both the second and third
4134 : * strategies; so if !allow_non_const, simplify_function can only return a
4135 : * Const or NULL. Argument-list rewriting happens anyway, though.
4136 : */
4137 1252882 : func_tuple = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
4138 1252882 : if (!HeapTupleIsValid(func_tuple))
4139 0 : elog(ERROR, "cache lookup failed for function %u", funcid);
4140 1252882 : func_form = (Form_pg_proc) GETSTRUCT(func_tuple);
4141 :
4142 : /*
4143 : * Process the function arguments, unless the caller did it already.
4144 : *
4145 : * Here we must deal with named or defaulted arguments, and then
4146 : * recursively apply eval_const_expressions to the whole argument list.
4147 : */
4148 1252882 : if (process_args)
4149 : {
4150 1250396 : args = expand_function_arguments(args, false, result_type, func_tuple);
4151 1250396 : args = (List *) expression_tree_mutator((Node *) args,
4152 : eval_const_expressions_mutator,
4153 : context);
4154 : /* Argument processing done, give it back to the caller */
4155 1250270 : *args_p = args;
4156 : }
4157 :
4158 : /* Now attempt simplification of the function call proper. */
4159 :
4160 1252756 : newexpr = evaluate_function(funcid, result_type, result_typmod,
4161 : result_collid, input_collid,
4162 : args, funcvariadic,
4163 : func_tuple, context);
4164 :
4165 1248816 : if (!newexpr && allow_non_const && OidIsValid(func_form->prosupport))
4166 : {
4167 : /*
4168 : * Build a SupportRequestSimplify node to pass to the support
4169 : * function, pointing to a dummy FuncExpr node containing the
4170 : * simplified arg list. We use this approach to present a uniform
4171 : * interface to the support function regardless of how the target
4172 : * function is actually being invoked.
4173 : */
4174 : SupportRequestSimplify req;
4175 : FuncExpr fexpr;
4176 :
4177 34038 : fexpr.xpr.type = T_FuncExpr;
4178 34038 : fexpr.funcid = funcid;
4179 34038 : fexpr.funcresulttype = result_type;
4180 34038 : fexpr.funcretset = func_form->proretset;
4181 34038 : fexpr.funcvariadic = funcvariadic;
4182 34038 : fexpr.funcformat = COERCE_EXPLICIT_CALL;
4183 34038 : fexpr.funccollid = result_collid;
4184 34038 : fexpr.inputcollid = input_collid;
4185 34038 : fexpr.args = args;
4186 34038 : fexpr.location = -1;
4187 :
4188 34038 : req.type = T_SupportRequestSimplify;
4189 34038 : req.root = context->root;
4190 34038 : req.fcall = &fexpr;
4191 :
4192 : newexpr = (Expr *)
4193 34038 : DatumGetPointer(OidFunctionCall1(func_form->prosupport,
4194 : PointerGetDatum(&req)));
4195 :
4196 : /* catch a possible API misunderstanding */
4197 : Assert(newexpr != (Expr *) &fexpr);
4198 : }
4199 :
4200 1248816 : if (!newexpr && allow_non_const)
4201 1068422 : newexpr = inline_function(funcid, result_type, result_collid,
4202 : input_collid, args, funcvariadic,
4203 : func_tuple, context);
4204 :
4205 1248802 : ReleaseSysCache(func_tuple);
4206 :
4207 1248802 : return newexpr;
4208 : }
4209 :
4210 : /*
4211 : * simplify_aggref
4212 : * Call the Aggref.aggfnoid's prosupport function to allow it to
4213 : * determine if simplification of the Aggref is possible. Returns the
4214 : * newly simplified node if conversion took place; otherwise, returns the
4215 : * original Aggref.
4216 : *
4217 : * See SupportRequestSimplifyAggref comments in supportnodes.h for further
4218 : * details.
4219 : */
4220 : static Node *
4221 44866 : simplify_aggref(Aggref *aggref, eval_const_expressions_context *context)
4222 : {
4223 44866 : Oid prosupport = get_func_support(aggref->aggfnoid);
4224 :
4225 44866 : if (OidIsValid(prosupport))
4226 : {
4227 : SupportRequestSimplifyAggref req;
4228 : Node *newnode;
4229 :
4230 : /*
4231 : * Build a SupportRequestSimplifyAggref node to pass to the support
4232 : * function.
4233 : */
4234 14986 : req.type = T_SupportRequestSimplifyAggref;
4235 14986 : req.root = context->root;
4236 14986 : req.aggref = aggref;
4237 :
4238 14986 : newnode = (Node *) DatumGetPointer(OidFunctionCall1(prosupport,
4239 : PointerGetDatum(&req)));
4240 :
4241 : /*
4242 : * We expect the support function to return either a new Node or NULL
4243 : * (when simplification isn't possible).
4244 : */
4245 : Assert(newnode != (Node *) aggref || newnode == NULL);
4246 :
4247 14986 : if (newnode != NULL)
4248 712 : return newnode;
4249 : }
4250 :
4251 44154 : return (Node *) aggref;
4252 : }
4253 :
4254 : /*
4255 : * var_is_nonnullable: check to see if the Var cannot be NULL
4256 : *
4257 : * If the Var is defined NOT NULL and meanwhile is not nulled by any outer
4258 : * joins or grouping sets, then we can know that it cannot be NULL.
4259 : *
4260 : * use_rel_info indicates whether the corresponding RelOptInfo is available for
4261 : * use.
4262 : */
4263 : bool
4264 27228 : var_is_nonnullable(PlannerInfo *root, Var *var, bool use_rel_info)
4265 : {
4266 27228 : Bitmapset *notnullattnums = NULL;
4267 :
4268 : Assert(IsA(var, Var));
4269 :
4270 : /* skip upper-level Vars */
4271 27228 : if (var->varlevelsup != 0)
4272 6 : return false;
4273 :
4274 : /* could the Var be nulled by any outer joins or grouping sets? */
4275 27222 : if (!bms_is_empty(var->varnullingrels))
4276 3046 : return false;
4277 :
4278 : /* system columns cannot be NULL */
4279 24176 : if (var->varattno < 0)
4280 36 : return true;
4281 :
4282 : /*
4283 : * Check if the Var is defined as NOT NULL. We retrieve the column NOT
4284 : * NULL constraint information from the corresponding RelOptInfo if it is
4285 : * available; otherwise, we search the hash table for this information.
4286 : */
4287 24140 : if (use_rel_info)
4288 : {
4289 9258 : RelOptInfo *rel = find_base_rel(root, var->varno);
4290 :
4291 9258 : notnullattnums = rel->notnullattnums;
4292 : }
4293 : else
4294 : {
4295 14882 : RangeTblEntry *rte = planner_rt_fetch(var->varno, root);
4296 :
4297 : /*
4298 : * We must skip inheritance parent tables, as some child tables may
4299 : * have a NOT NULL constraint for a column while others may not. This
4300 : * cannot happen with partitioned tables, though.
4301 : */
4302 14882 : if (rte->inh && rte->relkind != RELKIND_PARTITIONED_TABLE)
4303 144 : return false;
4304 :
4305 14738 : notnullattnums = find_relation_notnullatts(root, rte->relid);
4306 : }
4307 :
4308 47956 : if (var->varattno > 0 &&
4309 23960 : bms_is_member(var->varattno, notnullattnums))
4310 932 : return true;
4311 :
4312 23064 : return false;
4313 : }
4314 :
4315 : /*
4316 : * expr_is_nonnullable: check to see if the Expr cannot be NULL
4317 : *
4318 : * Returns true iff the given 'expr' cannot produce SQL NULLs.
4319 : *
4320 : * If 'use_rel_info' is true, nullability of Vars is checked via the
4321 : * corresponding RelOptInfo for the given Var. Some callers require
4322 : * nullability information before RelOptInfos are generated. These should
4323 : * pass 'use_rel_info' as false.
4324 : *
4325 : * For now, we only support Var and Const. Support for other node types may
4326 : * be possible.
4327 : */
4328 : bool
4329 12366 : expr_is_nonnullable(PlannerInfo *root, Expr *expr, bool use_rel_info)
4330 : {
4331 12366 : if (IsA(expr, Var))
4332 10882 : return var_is_nonnullable(root, (Var *) expr, use_rel_info);
4333 1484 : if (IsA(expr, Const))
4334 704 : return !castNode(Const, expr)->constisnull;
4335 :
4336 780 : return false;
4337 : }
4338 :
4339 : /*
4340 : * expand_function_arguments: convert named-notation args to positional args
4341 : * and/or insert default args, as needed
4342 : *
4343 : * Returns a possibly-transformed version of the args list.
4344 : *
4345 : * If include_out_arguments is true, then the args list and the result
4346 : * include OUT arguments.
4347 : *
4348 : * The expected result type of the call must be given, for sanity-checking
4349 : * purposes. Also, we ask the caller to provide the function's actual
4350 : * pg_proc tuple, not just its OID.
4351 : *
4352 : * If we need to change anything, the input argument list is copied, not
4353 : * modified.
4354 : *
4355 : * Note: this gets applied to operator argument lists too, even though the
4356 : * cases it handles should never occur there. This should be OK since it
4357 : * will fall through very quickly if there's nothing to do.
4358 : */
4359 : List *
4360 1254490 : expand_function_arguments(List *args, bool include_out_arguments,
4361 : Oid result_type, HeapTuple func_tuple)
4362 : {
4363 1254490 : Form_pg_proc funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
4364 1254490 : Oid *proargtypes = funcform->proargtypes.values;
4365 1254490 : int pronargs = funcform->pronargs;
4366 1254490 : bool has_named_args = false;
4367 : ListCell *lc;
4368 :
4369 : /*
4370 : * If we are asked to match to OUT arguments, then use the proallargtypes
4371 : * array (which includes those); otherwise use proargtypes (which
4372 : * doesn't). Of course, if proallargtypes is null, we always use
4373 : * proargtypes. (Fetching proallargtypes is annoyingly expensive
4374 : * considering that we may have nothing to do here, but fortunately the
4375 : * common case is include_out_arguments == false.)
4376 : */
4377 1254490 : if (include_out_arguments)
4378 : {
4379 : Datum proallargtypes;
4380 : bool isNull;
4381 :
4382 498 : proallargtypes = SysCacheGetAttr(PROCOID, func_tuple,
4383 : Anum_pg_proc_proallargtypes,
4384 : &isNull);
4385 498 : if (!isNull)
4386 : {
4387 202 : ArrayType *arr = DatumGetArrayTypeP(proallargtypes);
4388 :
4389 202 : pronargs = ARR_DIMS(arr)[0];
4390 202 : if (ARR_NDIM(arr) != 1 ||
4391 202 : pronargs < 0 ||
4392 202 : ARR_HASNULL(arr) ||
4393 202 : ARR_ELEMTYPE(arr) != OIDOID)
4394 0 : elog(ERROR, "proallargtypes is not a 1-D Oid array or it contains nulls");
4395 : Assert(pronargs >= funcform->pronargs);
4396 202 : proargtypes = (Oid *) ARR_DATA_PTR(arr);
4397 : }
4398 : }
4399 :
4400 : /* Do we have any named arguments? */
4401 3384238 : foreach(lc, args)
4402 : {
4403 2145896 : Node *arg = (Node *) lfirst(lc);
4404 :
4405 2145896 : if (IsA(arg, NamedArgExpr))
4406 : {
4407 16148 : has_named_args = true;
4408 16148 : break;
4409 : }
4410 : }
4411 :
4412 : /* If so, we must apply reorder_function_arguments */
4413 1254490 : if (has_named_args)
4414 : {
4415 16148 : args = reorder_function_arguments(args, pronargs, func_tuple);
4416 : /* Recheck argument types and add casts if needed */
4417 16148 : recheck_cast_function_args(args, result_type,
4418 : proargtypes, pronargs,
4419 : func_tuple);
4420 : }
4421 1238342 : else if (list_length(args) < pronargs)
4422 : {
4423 : /* No named args, but we seem to be short some defaults */
4424 6446 : args = add_function_defaults(args, pronargs, func_tuple);
4425 : /* Recheck argument types and add casts if needed */
4426 6446 : recheck_cast_function_args(args, result_type,
4427 : proargtypes, pronargs,
4428 : func_tuple);
4429 : }
4430 :
4431 1254490 : return args;
4432 : }
4433 :
4434 : /*
4435 : * reorder_function_arguments: convert named-notation args to positional args
4436 : *
4437 : * This function also inserts default argument values as needed, since it's
4438 : * impossible to form a truly valid positional call without that.
4439 : */
4440 : static List *
4441 16148 : reorder_function_arguments(List *args, int pronargs, HeapTuple func_tuple)
4442 : {
4443 16148 : Form_pg_proc funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
4444 16148 : int nargsprovided = list_length(args);
4445 : Node *argarray[FUNC_MAX_ARGS];
4446 : ListCell *lc;
4447 : int i;
4448 :
4449 : Assert(nargsprovided <= pronargs);
4450 16148 : if (pronargs < 0 || pronargs > FUNC_MAX_ARGS)
4451 0 : elog(ERROR, "too many function arguments");
4452 16148 : memset(argarray, 0, pronargs * sizeof(Node *));
4453 :
4454 : /* Deconstruct the argument list into an array indexed by argnumber */
4455 16148 : i = 0;
4456 65664 : foreach(lc, args)
4457 : {
4458 49516 : Node *arg = (Node *) lfirst(lc);
4459 :
4460 49516 : if (!IsA(arg, NamedArgExpr))
4461 : {
4462 : /* positional argument, assumed to precede all named args */
4463 : Assert(argarray[i] == NULL);
4464 2468 : argarray[i++] = arg;
4465 : }
4466 : else
4467 : {
4468 47048 : NamedArgExpr *na = (NamedArgExpr *) arg;
4469 :
4470 : Assert(na->argnumber >= 0 && na->argnumber < pronargs);
4471 : Assert(argarray[na->argnumber] == NULL);
4472 47048 : argarray[na->argnumber] = (Node *) na->arg;
4473 : }
4474 : }
4475 :
4476 : /*
4477 : * Fetch default expressions, if needed, and insert into array at proper
4478 : * locations (they aren't necessarily consecutive or all used)
4479 : */
4480 16148 : if (nargsprovided < pronargs)
4481 : {
4482 7524 : List *defaults = fetch_function_defaults(func_tuple);
4483 :
4484 7524 : i = pronargs - funcform->pronargdefaults;
4485 43032 : foreach(lc, defaults)
4486 : {
4487 35508 : if (argarray[i] == NULL)
4488 15238 : argarray[i] = (Node *) lfirst(lc);
4489 35508 : i++;
4490 : }
4491 : }
4492 :
4493 : /* Now reconstruct the args list in proper order */
4494 16148 : args = NIL;
4495 80902 : for (i = 0; i < pronargs; i++)
4496 : {
4497 : Assert(argarray[i] != NULL);
4498 64754 : args = lappend(args, argarray[i]);
4499 : }
4500 :
4501 16148 : return args;
4502 : }
4503 :
4504 : /*
4505 : * add_function_defaults: add missing function arguments from its defaults
4506 : *
4507 : * This is used only when the argument list was positional to begin with,
4508 : * and so we know we just need to add defaults at the end.
4509 : */
4510 : static List *
4511 6446 : add_function_defaults(List *args, int pronargs, HeapTuple func_tuple)
4512 : {
4513 6446 : int nargsprovided = list_length(args);
4514 : List *defaults;
4515 : int ndelete;
4516 :
4517 : /* Get all the default expressions from the pg_proc tuple */
4518 6446 : defaults = fetch_function_defaults(func_tuple);
4519 :
4520 : /* Delete any unused defaults from the list */
4521 6446 : ndelete = nargsprovided + list_length(defaults) - pronargs;
4522 6446 : if (ndelete < 0)
4523 0 : elog(ERROR, "not enough default arguments");
4524 6446 : if (ndelete > 0)
4525 238 : defaults = list_delete_first_n(defaults, ndelete);
4526 :
4527 : /* And form the combined argument list, not modifying the input list */
4528 6446 : return list_concat_copy(args, defaults);
4529 : }
4530 :
4531 : /*
4532 : * fetch_function_defaults: get function's default arguments as expression list
4533 : */
4534 : static List *
4535 13970 : fetch_function_defaults(HeapTuple func_tuple)
4536 : {
4537 : List *defaults;
4538 : Datum proargdefaults;
4539 : char *str;
4540 :
4541 13970 : proargdefaults = SysCacheGetAttrNotNull(PROCOID, func_tuple,
4542 : Anum_pg_proc_proargdefaults);
4543 13970 : str = TextDatumGetCString(proargdefaults);
4544 13970 : defaults = castNode(List, stringToNode(str));
4545 13970 : pfree(str);
4546 13970 : return defaults;
4547 : }
4548 :
4549 : /*
4550 : * recheck_cast_function_args: recheck function args and typecast as needed
4551 : * after adding defaults.
4552 : *
4553 : * It is possible for some of the defaulted arguments to be polymorphic;
4554 : * therefore we can't assume that the default expressions have the correct
4555 : * data types already. We have to re-resolve polymorphics and do coercion
4556 : * just like the parser did.
4557 : *
4558 : * This should be a no-op if there are no polymorphic arguments,
4559 : * but we do it anyway to be sure.
4560 : *
4561 : * Note: if any casts are needed, the args list is modified in-place;
4562 : * caller should have already copied the list structure.
4563 : */
4564 : static void
4565 22594 : recheck_cast_function_args(List *args, Oid result_type,
4566 : Oid *proargtypes, int pronargs,
4567 : HeapTuple func_tuple)
4568 : {
4569 22594 : Form_pg_proc funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
4570 : int nargs;
4571 : Oid actual_arg_types[FUNC_MAX_ARGS];
4572 : Oid declared_arg_types[FUNC_MAX_ARGS];
4573 : Oid rettype;
4574 : ListCell *lc;
4575 :
4576 22594 : if (list_length(args) > FUNC_MAX_ARGS)
4577 0 : elog(ERROR, "too many function arguments");
4578 22594 : nargs = 0;
4579 111426 : foreach(lc, args)
4580 : {
4581 88832 : actual_arg_types[nargs++] = exprType((Node *) lfirst(lc));
4582 : }
4583 : Assert(nargs == pronargs);
4584 22594 : memcpy(declared_arg_types, proargtypes, pronargs * sizeof(Oid));
4585 22594 : rettype = enforce_generic_type_consistency(actual_arg_types,
4586 : declared_arg_types,
4587 : nargs,
4588 : funcform->prorettype,
4589 : false);
4590 : /* let's just check we got the same answer as the parser did ... */
4591 22594 : if (rettype != result_type)
4592 0 : elog(ERROR, "function's resolved result type changed during planning");
4593 :
4594 : /* perform any necessary typecasting of arguments */
4595 22594 : make_fn_arguments(NULL, args, actual_arg_types, declared_arg_types);
4596 22594 : }
4597 :
4598 : /*
4599 : * evaluate_function: try to pre-evaluate a function call
4600 : *
4601 : * We can do this if the function is strict and has any constant-null inputs
4602 : * (just return a null constant), or if the function is immutable and has all
4603 : * constant inputs (call it and return the result as a Const node). In
4604 : * estimation mode we are willing to pre-evaluate stable functions too.
4605 : *
4606 : * Returns a simplified expression if successful, or NULL if cannot
4607 : * simplify the function.
4608 : */
4609 : static Expr *
4610 1252756 : evaluate_function(Oid funcid, Oid result_type, int32 result_typmod,
4611 : Oid result_collid, Oid input_collid, List *args,
4612 : bool funcvariadic,
4613 : HeapTuple func_tuple,
4614 : eval_const_expressions_context *context)
4615 : {
4616 1252756 : Form_pg_proc funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
4617 1252756 : bool has_nonconst_input = false;
4618 1252756 : bool has_null_input = false;
4619 : ListCell *arg;
4620 : FuncExpr *newexpr;
4621 :
4622 : /*
4623 : * Can't simplify if it returns a set.
4624 : */
4625 1252756 : if (funcform->proretset)
4626 65222 : return NULL;
4627 :
4628 : /*
4629 : * Can't simplify if it returns RECORD. The immediate problem is that it
4630 : * will be needing an expected tupdesc which we can't supply here.
4631 : *
4632 : * In the case where it has OUT parameters, we could build an expected
4633 : * tupdesc from those, but there may be other gotchas lurking. In
4634 : * particular, if the function were to return NULL, we would produce a
4635 : * null constant with no remaining indication of which concrete record
4636 : * type it is. For now, seems best to leave the function call unreduced.
4637 : */
4638 1187534 : if (funcform->prorettype == RECORDOID)
4639 5396 : return NULL;
4640 :
4641 : /*
4642 : * Check for constant inputs and especially constant-NULL inputs.
4643 : */
4644 3218282 : foreach(arg, args)
4645 : {
4646 2036144 : if (IsA(lfirst(arg), Const))
4647 931932 : has_null_input |= ((Const *) lfirst(arg))->constisnull;
4648 : else
4649 1104212 : has_nonconst_input = true;
4650 : }
4651 :
4652 : /*
4653 : * If the function is strict and has a constant-NULL input, it will never
4654 : * be called at all, so we can replace the call by a NULL constant, even
4655 : * if there are other inputs that aren't constant, and even if the
4656 : * function is not otherwise immutable.
4657 : */
4658 1182138 : if (funcform->proisstrict && has_null_input)
4659 728 : return (Expr *) makeNullConst(result_type, result_typmod,
4660 : result_collid);
4661 :
4662 : /*
4663 : * Otherwise, can simplify only if all inputs are constants. (For a
4664 : * non-strict function, constant NULL inputs are treated the same as
4665 : * constant non-NULL inputs.)
4666 : */
4667 1181410 : if (has_nonconst_input)
4668 848888 : return NULL;
4669 :
4670 : /*
4671 : * Ordinarily we are only allowed to simplify immutable functions. But for
4672 : * purposes of estimation, we consider it okay to simplify functions that
4673 : * are merely stable; the risk that the result might change from planning
4674 : * time to execution time is worth taking in preference to not being able
4675 : * to estimate the value at all.
4676 : */
4677 332522 : if (funcform->provolatile == PROVOLATILE_IMMUTABLE)
4678 : /* okay */ ;
4679 151608 : else if (context->estimate && funcform->provolatile == PROVOLATILE_STABLE)
4680 : /* okay */ ;
4681 : else
4682 149042 : return NULL;
4683 :
4684 : /*
4685 : * OK, looks like we can simplify this operator/function.
4686 : *
4687 : * Build a new FuncExpr node containing the already-simplified arguments.
4688 : */
4689 183480 : newexpr = makeNode(FuncExpr);
4690 183480 : newexpr->funcid = funcid;
4691 183480 : newexpr->funcresulttype = result_type;
4692 183480 : newexpr->funcretset = false;
4693 183480 : newexpr->funcvariadic = funcvariadic;
4694 183480 : newexpr->funcformat = COERCE_EXPLICIT_CALL; /* doesn't matter */
4695 183480 : newexpr->funccollid = result_collid; /* doesn't matter */
4696 183480 : newexpr->inputcollid = input_collid;
4697 183480 : newexpr->args = args;
4698 183480 : newexpr->location = -1;
4699 :
4700 183480 : return evaluate_expr((Expr *) newexpr, result_type, result_typmod,
4701 : result_collid);
4702 : }
4703 :
4704 : /*
4705 : * inline_function: try to expand a function call inline
4706 : *
4707 : * If the function is a sufficiently simple SQL-language function
4708 : * (just "SELECT expression"), then we can inline it and avoid the rather
4709 : * high per-call overhead of SQL functions. Furthermore, this can expose
4710 : * opportunities for constant-folding within the function expression.
4711 : *
4712 : * We have to beware of some special cases however. A directly or
4713 : * indirectly recursive function would cause us to recurse forever,
4714 : * so we keep track of which functions we are already expanding and
4715 : * do not re-expand them. Also, if a parameter is used more than once
4716 : * in the SQL-function body, we require it not to contain any volatile
4717 : * functions (volatiles might deliver inconsistent answers) nor to be
4718 : * unreasonably expensive to evaluate. The expensiveness check not only
4719 : * prevents us from doing multiple evaluations of an expensive parameter
4720 : * at runtime, but is a safety value to limit growth of an expression due
4721 : * to repeated inlining.
4722 : *
4723 : * We must also beware of changing the volatility or strictness status of
4724 : * functions by inlining them.
4725 : *
4726 : * Also, at the moment we can't inline functions returning RECORD. This
4727 : * doesn't work in the general case because it discards information such
4728 : * as OUT-parameter declarations.
4729 : *
4730 : * Also, context-dependent expression nodes in the argument list are trouble.
4731 : *
4732 : * Returns a simplified expression if successful, or NULL if cannot
4733 : * simplify the function.
4734 : */
4735 : static Expr *
4736 1068422 : inline_function(Oid funcid, Oid result_type, Oid result_collid,
4737 : Oid input_collid, List *args,
4738 : bool funcvariadic,
4739 : HeapTuple func_tuple,
4740 : eval_const_expressions_context *context)
4741 : {
4742 1068422 : Form_pg_proc funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
4743 : char *src;
4744 : Datum tmp;
4745 : bool isNull;
4746 : MemoryContext oldcxt;
4747 : MemoryContext mycxt;
4748 : inline_error_callback_arg callback_arg;
4749 : ErrorContextCallback sqlerrcontext;
4750 : FuncExpr *fexpr;
4751 : SQLFunctionParseInfoPtr pinfo;
4752 : TupleDesc rettupdesc;
4753 : ParseState *pstate;
4754 : List *raw_parsetree_list;
4755 : List *querytree_list;
4756 : Query *querytree;
4757 : Node *newexpr;
4758 : int *usecounts;
4759 : ListCell *arg;
4760 : int i;
4761 :
4762 : /*
4763 : * Forget it if the function is not SQL-language or has other showstopper
4764 : * properties. (The prokind and nargs checks are just paranoia.)
4765 : */
4766 1068422 : if (funcform->prolang != SQLlanguageId ||
4767 8182 : funcform->prokind != PROKIND_FUNCTION ||
4768 8182 : funcform->prosecdef ||
4769 8170 : funcform->proretset ||
4770 6744 : funcform->prorettype == RECORDOID ||
4771 12834 : !heap_attisnull(func_tuple, Anum_pg_proc_proconfig, NULL) ||
4772 6396 : funcform->pronargs != list_length(args))
4773 1062026 : return NULL;
4774 :
4775 : /* Check for recursive function, and give up trying to expand if so */
4776 6396 : if (list_member_oid(context->active_fns, funcid))
4777 12 : return NULL;
4778 :
4779 : /* Check permission to call function (fail later, if not) */
4780 6384 : if (object_aclcheck(ProcedureRelationId, funcid, GetUserId(), ACL_EXECUTE) != ACLCHECK_OK)
4781 20 : return NULL;
4782 :
4783 : /* Check whether a plugin wants to hook function entry/exit */
4784 6364 : if (FmgrHookIsNeeded(funcid))
4785 0 : return NULL;
4786 :
4787 : /*
4788 : * Make a temporary memory context, so that we don't leak all the stuff
4789 : * that parsing might create.
4790 : */
4791 6364 : mycxt = AllocSetContextCreate(CurrentMemoryContext,
4792 : "inline_function",
4793 : ALLOCSET_DEFAULT_SIZES);
4794 6364 : oldcxt = MemoryContextSwitchTo(mycxt);
4795 :
4796 : /*
4797 : * We need a dummy FuncExpr node containing the already-simplified
4798 : * arguments. (In some cases we don't really need it, but building it is
4799 : * cheap enough that it's not worth contortions to avoid.)
4800 : */
4801 6364 : fexpr = makeNode(FuncExpr);
4802 6364 : fexpr->funcid = funcid;
4803 6364 : fexpr->funcresulttype = result_type;
4804 6364 : fexpr->funcretset = false;
4805 6364 : fexpr->funcvariadic = funcvariadic;
4806 6364 : fexpr->funcformat = COERCE_EXPLICIT_CALL; /* doesn't matter */
4807 6364 : fexpr->funccollid = result_collid; /* doesn't matter */
4808 6364 : fexpr->inputcollid = input_collid;
4809 6364 : fexpr->args = args;
4810 6364 : fexpr->location = -1;
4811 :
4812 : /* Fetch the function body */
4813 6364 : tmp = SysCacheGetAttrNotNull(PROCOID, func_tuple, Anum_pg_proc_prosrc);
4814 6364 : src = TextDatumGetCString(tmp);
4815 :
4816 : /*
4817 : * Setup error traceback support for ereport(). This is so that we can
4818 : * finger the function that bad information came from.
4819 : */
4820 6364 : callback_arg.proname = NameStr(funcform->proname);
4821 6364 : callback_arg.prosrc = src;
4822 :
4823 6364 : sqlerrcontext.callback = sql_inline_error_callback;
4824 6364 : sqlerrcontext.arg = &callback_arg;
4825 6364 : sqlerrcontext.previous = error_context_stack;
4826 6364 : error_context_stack = &sqlerrcontext;
4827 :
4828 : /* If we have prosqlbody, pay attention to that not prosrc */
4829 6364 : tmp = SysCacheGetAttr(PROCOID,
4830 : func_tuple,
4831 : Anum_pg_proc_prosqlbody,
4832 : &isNull);
4833 6364 : if (!isNull)
4834 : {
4835 : Node *n;
4836 : List *query_list;
4837 :
4838 3322 : n = stringToNode(TextDatumGetCString(tmp));
4839 3322 : if (IsA(n, List))
4840 2488 : query_list = linitial_node(List, castNode(List, n));
4841 : else
4842 834 : query_list = list_make1(n);
4843 3322 : if (list_length(query_list) != 1)
4844 6 : goto fail;
4845 3316 : querytree = linitial(query_list);
4846 :
4847 : /*
4848 : * Because we'll insist below that the querytree have an empty rtable
4849 : * and no sublinks, it cannot have any relation references that need
4850 : * to be locked or rewritten. So we can omit those steps.
4851 : */
4852 : }
4853 : else
4854 : {
4855 : /* Set up to handle parameters while parsing the function body. */
4856 3042 : pinfo = prepare_sql_fn_parse_info(func_tuple,
4857 : (Node *) fexpr,
4858 : input_collid);
4859 :
4860 : /*
4861 : * We just do parsing and parse analysis, not rewriting, because
4862 : * rewriting will not affect table-free-SELECT-only queries, which is
4863 : * all that we care about. Also, we can punt as soon as we detect
4864 : * more than one command in the function body.
4865 : */
4866 3042 : raw_parsetree_list = pg_parse_query(src);
4867 3042 : if (list_length(raw_parsetree_list) != 1)
4868 58 : goto fail;
4869 :
4870 2984 : pstate = make_parsestate(NULL);
4871 2984 : pstate->p_sourcetext = src;
4872 2984 : sql_fn_parser_setup(pstate, pinfo);
4873 :
4874 2984 : querytree = transformTopLevelStmt(pstate, linitial(raw_parsetree_list));
4875 :
4876 2978 : free_parsestate(pstate);
4877 : }
4878 :
4879 : /*
4880 : * The single command must be a simple "SELECT expression".
4881 : *
4882 : * Note: if you change the tests involved in this, see also plpgsql's
4883 : * exec_simple_check_plan(). That generally needs to have the same idea
4884 : * of what's a "simple expression", so that inlining a function that
4885 : * previously wasn't inlined won't change plpgsql's conclusion.
4886 : */
4887 6294 : if (!IsA(querytree, Query) ||
4888 6294 : querytree->commandType != CMD_SELECT ||
4889 6170 : querytree->hasAggs ||
4890 6020 : querytree->hasWindowFuncs ||
4891 6020 : querytree->hasTargetSRFs ||
4892 6020 : querytree->hasSubLinks ||
4893 5296 : querytree->cteList ||
4894 5296 : querytree->rtable ||
4895 3470 : querytree->jointree->fromlist ||
4896 3470 : querytree->jointree->quals ||
4897 3470 : querytree->groupClause ||
4898 3470 : querytree->groupingSets ||
4899 3470 : querytree->havingQual ||
4900 3470 : querytree->windowClause ||
4901 3470 : querytree->distinctClause ||
4902 3470 : querytree->sortClause ||
4903 3470 : querytree->limitOffset ||
4904 3470 : querytree->limitCount ||
4905 6804 : querytree->setOperations ||
4906 3402 : list_length(querytree->targetList) != 1)
4907 2952 : goto fail;
4908 :
4909 : /* If the function result is composite, resolve it */
4910 3342 : (void) get_expr_result_type((Node *) fexpr,
4911 : NULL,
4912 : &rettupdesc);
4913 :
4914 : /*
4915 : * Make sure the function (still) returns what it's declared to. This
4916 : * will raise an error if wrong, but that's okay since the function would
4917 : * fail at runtime anyway. Note that check_sql_fn_retval will also insert
4918 : * a coercion if needed to make the tlist expression match the declared
4919 : * type of the function.
4920 : *
4921 : * Note: we do not try this until we have verified that no rewriting was
4922 : * needed; that's probably not important, but let's be careful.
4923 : */
4924 3342 : querytree_list = list_make1(querytree);
4925 3342 : if (check_sql_fn_retval(list_make1(querytree_list),
4926 : result_type, rettupdesc,
4927 3342 : funcform->prokind,
4928 : false))
4929 12 : goto fail; /* reject whole-tuple-result cases */
4930 :
4931 : /*
4932 : * Given the tests above, check_sql_fn_retval shouldn't have decided to
4933 : * inject a projection step, but let's just make sure.
4934 : */
4935 3324 : if (querytree != linitial(querytree_list))
4936 0 : goto fail;
4937 :
4938 : /* Now we can grab the tlist expression */
4939 3324 : newexpr = (Node *) ((TargetEntry *) linitial(querytree->targetList))->expr;
4940 :
4941 : /*
4942 : * If the SQL function returns VOID, we can only inline it if it is a
4943 : * SELECT of an expression returning VOID (ie, it's just a redirection to
4944 : * another VOID-returning function). In all non-VOID-returning cases,
4945 : * check_sql_fn_retval should ensure that newexpr returns the function's
4946 : * declared result type, so this test shouldn't fail otherwise; but we may
4947 : * as well cope gracefully if it does.
4948 : */
4949 3324 : if (exprType(newexpr) != result_type)
4950 18 : goto fail;
4951 :
4952 : /*
4953 : * Additional validity checks on the expression. It mustn't be more
4954 : * volatile than the surrounding function (this is to avoid breaking hacks
4955 : * that involve pretending a function is immutable when it really ain't).
4956 : * If the surrounding function is declared strict, then the expression
4957 : * must contain only strict constructs and must use all of the function
4958 : * parameters (this is overkill, but an exact analysis is hard).
4959 : */
4960 4018 : if (funcform->provolatile == PROVOLATILE_IMMUTABLE &&
4961 712 : contain_mutable_functions(newexpr))
4962 12 : goto fail;
4963 4242 : else if (funcform->provolatile == PROVOLATILE_STABLE &&
4964 948 : contain_volatile_functions(newexpr))
4965 0 : goto fail;
4966 :
4967 4972 : if (funcform->proisstrict &&
4968 1678 : contain_nonstrict_functions(newexpr))
4969 46 : goto fail;
4970 :
4971 : /*
4972 : * If any parameter expression contains a context-dependent node, we can't
4973 : * inline, for fear of putting such a node into the wrong context.
4974 : */
4975 3248 : if (contain_context_dependent_node((Node *) args))
4976 6 : goto fail;
4977 :
4978 : /*
4979 : * We may be able to do it; there are still checks on parameter usage to
4980 : * make, but those are most easily done in combination with the actual
4981 : * substitution of the inputs. So start building expression with inputs
4982 : * substituted.
4983 : */
4984 3242 : usecounts = (int *) palloc0(funcform->pronargs * sizeof(int));
4985 3242 : newexpr = substitute_actual_parameters(newexpr, funcform->pronargs,
4986 : args, usecounts);
4987 :
4988 : /* Now check for parameter usage */
4989 3242 : i = 0;
4990 8594 : foreach(arg, args)
4991 : {
4992 5352 : Node *param = lfirst(arg);
4993 :
4994 5352 : if (usecounts[i] == 0)
4995 : {
4996 : /* Param not used at all: uncool if func is strict */
4997 288 : if (funcform->proisstrict)
4998 0 : goto fail;
4999 : }
5000 5064 : else if (usecounts[i] != 1)
5001 : {
5002 : /* Param used multiple times: uncool if expensive or volatile */
5003 : QualCost eval_cost;
5004 :
5005 : /*
5006 : * We define "expensive" as "contains any subplan or more than 10
5007 : * operators". Note that the subplan search has to be done
5008 : * explicitly, since cost_qual_eval() will barf on unplanned
5009 : * subselects.
5010 : */
5011 462 : if (contain_subplans(param))
5012 0 : goto fail;
5013 462 : cost_qual_eval(&eval_cost, list_make1(param), NULL);
5014 462 : if (eval_cost.startup + eval_cost.per_tuple >
5015 462 : 10 * cpu_operator_cost)
5016 0 : goto fail;
5017 :
5018 : /*
5019 : * Check volatility last since this is more expensive than the
5020 : * above tests
5021 : */
5022 462 : if (contain_volatile_functions(param))
5023 0 : goto fail;
5024 : }
5025 5352 : i++;
5026 : }
5027 :
5028 : /*
5029 : * Whew --- we can make the substitution. Copy the modified expression
5030 : * out of the temporary memory context, and clean up.
5031 : */
5032 3242 : MemoryContextSwitchTo(oldcxt);
5033 :
5034 3242 : newexpr = copyObject(newexpr);
5035 :
5036 3242 : MemoryContextDelete(mycxt);
5037 :
5038 : /*
5039 : * If the result is of a collatable type, force the result to expose the
5040 : * correct collation. In most cases this does not matter, but it's
5041 : * possible that the function result is used directly as a sort key or in
5042 : * other places where we expect exprCollation() to tell the truth.
5043 : */
5044 3242 : if (OidIsValid(result_collid))
5045 : {
5046 1454 : Oid exprcoll = exprCollation(newexpr);
5047 :
5048 1454 : if (OidIsValid(exprcoll) && exprcoll != result_collid)
5049 : {
5050 36 : CollateExpr *newnode = makeNode(CollateExpr);
5051 :
5052 36 : newnode->arg = (Expr *) newexpr;
5053 36 : newnode->collOid = result_collid;
5054 36 : newnode->location = -1;
5055 :
5056 36 : newexpr = (Node *) newnode;
5057 : }
5058 : }
5059 :
5060 : /*
5061 : * Since there is now no trace of the function in the plan tree, we must
5062 : * explicitly record the plan's dependency on the function.
5063 : */
5064 3242 : if (context->root)
5065 3018 : record_plan_function_dependency(context->root, funcid);
5066 :
5067 : /*
5068 : * Recursively try to simplify the modified expression. Here we must add
5069 : * the current function to the context list of active functions.
5070 : */
5071 3242 : context->active_fns = lappend_oid(context->active_fns, funcid);
5072 3242 : newexpr = eval_const_expressions_mutator(newexpr, context);
5073 3240 : context->active_fns = list_delete_last(context->active_fns);
5074 :
5075 3240 : error_context_stack = sqlerrcontext.previous;
5076 :
5077 3240 : return (Expr *) newexpr;
5078 :
5079 : /* Here if func is not inlinable: release temp memory and return NULL */
5080 3110 : fail:
5081 3110 : MemoryContextSwitchTo(oldcxt);
5082 3110 : MemoryContextDelete(mycxt);
5083 3110 : error_context_stack = sqlerrcontext.previous;
5084 :
5085 3110 : return NULL;
5086 : }
5087 :
5088 : /*
5089 : * Replace Param nodes by appropriate actual parameters
5090 : */
5091 : static Node *
5092 3242 : substitute_actual_parameters(Node *expr, int nargs, List *args,
5093 : int *usecounts)
5094 : {
5095 : substitute_actual_parameters_context context;
5096 :
5097 3242 : context.nargs = nargs;
5098 3242 : context.args = args;
5099 3242 : context.usecounts = usecounts;
5100 :
5101 3242 : return substitute_actual_parameters_mutator(expr, &context);
5102 : }
5103 :
5104 : static Node *
5105 18898 : substitute_actual_parameters_mutator(Node *node,
5106 : substitute_actual_parameters_context *context)
5107 : {
5108 18898 : if (node == NULL)
5109 560 : return NULL;
5110 18338 : if (IsA(node, Param))
5111 : {
5112 5562 : Param *param = (Param *) node;
5113 :
5114 5562 : if (param->paramkind != PARAM_EXTERN)
5115 0 : elog(ERROR, "unexpected paramkind: %d", (int) param->paramkind);
5116 5562 : if (param->paramid <= 0 || param->paramid > context->nargs)
5117 0 : elog(ERROR, "invalid paramid: %d", param->paramid);
5118 :
5119 : /* Count usage of parameter */
5120 5562 : context->usecounts[param->paramid - 1]++;
5121 :
5122 : /* Select the appropriate actual arg and replace the Param with it */
5123 : /* We don't need to copy at this time (it'll get done later) */
5124 5562 : return list_nth(context->args, param->paramid - 1);
5125 : }
5126 12776 : return expression_tree_mutator(node, substitute_actual_parameters_mutator, context);
5127 : }
5128 :
5129 : /*
5130 : * error context callback to let us supply a call-stack traceback
5131 : */
5132 : static void
5133 20 : sql_inline_error_callback(void *arg)
5134 : {
5135 20 : inline_error_callback_arg *callback_arg = (inline_error_callback_arg *) arg;
5136 : int syntaxerrposition;
5137 :
5138 : /* If it's a syntax error, convert to internal syntax error report */
5139 20 : syntaxerrposition = geterrposition();
5140 20 : if (syntaxerrposition > 0)
5141 : {
5142 6 : errposition(0);
5143 6 : internalerrposition(syntaxerrposition);
5144 6 : internalerrquery(callback_arg->prosrc);
5145 : }
5146 :
5147 20 : errcontext("SQL function \"%s\" during inlining", callback_arg->proname);
5148 20 : }
5149 :
5150 : /*
5151 : * evaluate_expr: pre-evaluate a constant expression
5152 : *
5153 : * We use the executor's routine ExecEvalExpr() to avoid duplication of
5154 : * code and ensure we get the same result as the executor would get.
5155 : */
5156 : Expr *
5157 217206 : evaluate_expr(Expr *expr, Oid result_type, int32 result_typmod,
5158 : Oid result_collation)
5159 : {
5160 : EState *estate;
5161 : ExprState *exprstate;
5162 : MemoryContext oldcontext;
5163 : Datum const_val;
5164 : bool const_is_null;
5165 : int16 resultTypLen;
5166 : bool resultTypByVal;
5167 :
5168 : /*
5169 : * To use the executor, we need an EState.
5170 : */
5171 217206 : estate = CreateExecutorState();
5172 :
5173 : /* We can use the estate's working context to avoid memory leaks. */
5174 217206 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
5175 :
5176 : /* Make sure any opfuncids are filled in. */
5177 217206 : fix_opfuncids((Node *) expr);
5178 :
5179 : /*
5180 : * Prepare expr for execution. (Note: we can't use ExecPrepareExpr
5181 : * because it'd result in recursively invoking eval_const_expressions.)
5182 : */
5183 217206 : exprstate = ExecInitExpr(expr, NULL);
5184 :
5185 : /*
5186 : * And evaluate it.
5187 : *
5188 : * It is OK to use a default econtext because none of the ExecEvalExpr()
5189 : * code used in this situation will use econtext. That might seem
5190 : * fortuitous, but it's not so unreasonable --- a constant expression does
5191 : * not depend on context, by definition, n'est ce pas?
5192 : */
5193 217182 : const_val = ExecEvalExprSwitchContext(exprstate,
5194 217182 : GetPerTupleExprContext(estate),
5195 : &const_is_null);
5196 :
5197 : /* Get info needed about result datatype */
5198 213224 : get_typlenbyval(result_type, &resultTypLen, &resultTypByVal);
5199 :
5200 : /* Get back to outer memory context */
5201 213224 : MemoryContextSwitchTo(oldcontext);
5202 :
5203 : /*
5204 : * Must copy result out of sub-context used by expression eval.
5205 : *
5206 : * Also, if it's varlena, forcibly detoast it. This protects us against
5207 : * storing TOAST pointers into plans that might outlive the referenced
5208 : * data. (makeConst would handle detoasting anyway, but it's worth a few
5209 : * extra lines here so that we can do the copy and detoast in one step.)
5210 : */
5211 213224 : if (!const_is_null)
5212 : {
5213 211728 : if (resultTypLen == -1)
5214 82990 : const_val = PointerGetDatum(PG_DETOAST_DATUM_COPY(const_val));
5215 : else
5216 128738 : const_val = datumCopy(const_val, resultTypByVal, resultTypLen);
5217 : }
5218 :
5219 : /* Release all the junk we just created */
5220 213224 : FreeExecutorState(estate);
5221 :
5222 : /*
5223 : * Make the constant result node.
5224 : */
5225 213224 : return (Expr *) makeConst(result_type, result_typmod, result_collation,
5226 : resultTypLen,
5227 : const_val, const_is_null,
5228 : resultTypByVal);
5229 : }
5230 :
5231 :
5232 : /*
5233 : * inline_function_in_from
5234 : * Attempt to "inline" a function in the FROM clause.
5235 : *
5236 : * "rte" is an RTE_FUNCTION rangetable entry. If it represents a call of a
5237 : * function that can be inlined, expand the function and return the
5238 : * substitute Query structure. Otherwise, return NULL.
5239 : *
5240 : * We assume that the RTE's expression has already been put through
5241 : * eval_const_expressions(), which among other things will take care of
5242 : * default arguments and named-argument notation.
5243 : *
5244 : * This has a good deal of similarity to inline_function(), but that's
5245 : * for the general-expression case, and there are enough differences to
5246 : * justify separate functions.
5247 : */
5248 : Query *
5249 52402 : inline_function_in_from(PlannerInfo *root, RangeTblEntry *rte)
5250 : {
5251 : RangeTblFunction *rtfunc;
5252 : FuncExpr *fexpr;
5253 : Oid func_oid;
5254 : HeapTuple func_tuple;
5255 : Form_pg_proc funcform;
5256 : MemoryContext oldcxt;
5257 : MemoryContext mycxt;
5258 : Datum tmp;
5259 : char *src;
5260 : inline_error_callback_arg callback_arg;
5261 : ErrorContextCallback sqlerrcontext;
5262 52402 : Query *querytree = NULL;
5263 :
5264 : Assert(rte->rtekind == RTE_FUNCTION);
5265 :
5266 : /*
5267 : * Guard against infinite recursion during expansion by checking for stack
5268 : * overflow. (There's no need to do more.)
5269 : */
5270 52402 : check_stack_depth();
5271 :
5272 : /* Fail if the RTE has ORDINALITY - we don't implement that here. */
5273 52402 : if (rte->funcordinality)
5274 922 : return NULL;
5275 :
5276 : /* Fail if RTE isn't a single, simple FuncExpr */
5277 51480 : if (list_length(rte->functions) != 1)
5278 72 : return NULL;
5279 51408 : rtfunc = (RangeTblFunction *) linitial(rte->functions);
5280 :
5281 51408 : if (!IsA(rtfunc->funcexpr, FuncExpr))
5282 414 : return NULL;
5283 50994 : fexpr = (FuncExpr *) rtfunc->funcexpr;
5284 :
5285 50994 : func_oid = fexpr->funcid;
5286 :
5287 : /*
5288 : * Refuse to inline if the arguments contain any volatile functions or
5289 : * sub-selects. Volatile functions are rejected because inlining may
5290 : * result in the arguments being evaluated multiple times, risking a
5291 : * change in behavior. Sub-selects are rejected partly for implementation
5292 : * reasons (pushing them down another level might change their behavior)
5293 : * and partly because they're likely to be expensive and so multiple
5294 : * evaluation would be bad.
5295 : */
5296 101774 : if (contain_volatile_functions((Node *) fexpr->args) ||
5297 50780 : contain_subplans((Node *) fexpr->args))
5298 448 : return NULL;
5299 :
5300 : /* Check permission to call function (fail later, if not) */
5301 50546 : if (object_aclcheck(ProcedureRelationId, func_oid, GetUserId(), ACL_EXECUTE) != ACLCHECK_OK)
5302 12 : return NULL;
5303 :
5304 : /* Check whether a plugin wants to hook function entry/exit */
5305 50534 : if (FmgrHookIsNeeded(func_oid))
5306 0 : return NULL;
5307 :
5308 : /*
5309 : * OK, let's take a look at the function's pg_proc entry.
5310 : */
5311 50534 : func_tuple = SearchSysCache1(PROCOID, ObjectIdGetDatum(func_oid));
5312 50534 : if (!HeapTupleIsValid(func_tuple))
5313 0 : elog(ERROR, "cache lookup failed for function %u", func_oid);
5314 50534 : funcform = (Form_pg_proc) GETSTRUCT(func_tuple);
5315 :
5316 : /*
5317 : * If the function SETs any configuration parameters, inlining would cause
5318 : * us to miss making those changes.
5319 : */
5320 50534 : if (!heap_attisnull(func_tuple, Anum_pg_proc_proconfig, NULL))
5321 : {
5322 16 : ReleaseSysCache(func_tuple);
5323 16 : return NULL;
5324 : }
5325 :
5326 : /*
5327 : * Make a temporary memory context, so that we don't leak all the stuff
5328 : * that parsing and rewriting might create. If we succeed, we'll copy
5329 : * just the finished query tree back up to the caller's context.
5330 : */
5331 50518 : mycxt = AllocSetContextCreate(CurrentMemoryContext,
5332 : "inline_function_in_from",
5333 : ALLOCSET_DEFAULT_SIZES);
5334 50518 : oldcxt = MemoryContextSwitchTo(mycxt);
5335 :
5336 : /* Fetch the function body */
5337 50518 : tmp = SysCacheGetAttrNotNull(PROCOID, func_tuple, Anum_pg_proc_prosrc);
5338 50518 : src = TextDatumGetCString(tmp);
5339 :
5340 : /*
5341 : * If the function has an attached support function that can handle
5342 : * SupportRequestInlineInFrom, then attempt to inline with that.
5343 : */
5344 50518 : if (funcform->prosupport)
5345 : {
5346 : SupportRequestInlineInFrom req;
5347 :
5348 17244 : req.type = T_SupportRequestInlineInFrom;
5349 17244 : req.root = root;
5350 17244 : req.rtfunc = rtfunc;
5351 17244 : req.proc = func_tuple;
5352 :
5353 : querytree = (Query *)
5354 17244 : DatumGetPointer(OidFunctionCall1(funcform->prosupport,
5355 : PointerGetDatum(&req)));
5356 : }
5357 :
5358 : /*
5359 : * Setup error traceback support for ereport(). This is so that we can
5360 : * finger the function that bad information came from. We don't install
5361 : * this while running the support function, since it'd be likely to do the
5362 : * wrong thing: any parse errors reported during that are very likely not
5363 : * against the raw function source text.
5364 : */
5365 50518 : callback_arg.proname = NameStr(funcform->proname);
5366 50518 : callback_arg.prosrc = src;
5367 :
5368 50518 : sqlerrcontext.callback = sql_inline_error_callback;
5369 50518 : sqlerrcontext.arg = &callback_arg;
5370 50518 : sqlerrcontext.previous = error_context_stack;
5371 50518 : error_context_stack = &sqlerrcontext;
5372 :
5373 : /*
5374 : * If SupportRequestInlineInFrom didn't work, try our built-in inlining
5375 : * mechanism.
5376 : */
5377 50518 : if (!querytree)
5378 50494 : querytree = inline_sql_function_in_from(root, rtfunc, fexpr,
5379 : func_tuple, funcform, src);
5380 :
5381 50512 : if (!querytree)
5382 50266 : goto fail; /* no luck there either, fail */
5383 :
5384 : /*
5385 : * The result had better be a SELECT Query.
5386 : */
5387 : Assert(IsA(querytree, Query));
5388 : Assert(querytree->commandType == CMD_SELECT);
5389 :
5390 : /*
5391 : * Looks good --- substitute parameters into the query.
5392 : */
5393 246 : querytree = substitute_actual_parameters_in_from(querytree,
5394 246 : funcform->pronargs,
5395 : fexpr->args);
5396 :
5397 : /*
5398 : * Copy the modified query out of the temporary memory context, and clean
5399 : * up.
5400 : */
5401 246 : MemoryContextSwitchTo(oldcxt);
5402 :
5403 246 : querytree = copyObject(querytree);
5404 :
5405 246 : MemoryContextDelete(mycxt);
5406 246 : error_context_stack = sqlerrcontext.previous;
5407 246 : ReleaseSysCache(func_tuple);
5408 :
5409 : /*
5410 : * We don't have to fix collations here because the upper query is already
5411 : * parsed, ie, the collations in the RTE are what count.
5412 : */
5413 :
5414 : /*
5415 : * Since there is now no trace of the function in the plan tree, we must
5416 : * explicitly record the plan's dependency on the function.
5417 : */
5418 246 : record_plan_function_dependency(root, func_oid);
5419 :
5420 : /*
5421 : * We must also notice if the inserted query adds a dependency on the
5422 : * calling role due to RLS quals.
5423 : */
5424 246 : if (querytree->hasRowSecurity)
5425 72 : root->glob->dependsOnRole = true;
5426 :
5427 246 : return querytree;
5428 :
5429 : /* Here if func is not inlinable: release temp memory and return NULL */
5430 50266 : fail:
5431 50266 : MemoryContextSwitchTo(oldcxt);
5432 50266 : MemoryContextDelete(mycxt);
5433 50266 : error_context_stack = sqlerrcontext.previous;
5434 50266 : ReleaseSysCache(func_tuple);
5435 :
5436 50266 : return NULL;
5437 : }
5438 :
5439 : /*
5440 : * inline_sql_function_in_from
5441 : *
5442 : * This implements inline_function_in_from for SQL-language functions.
5443 : * Returns NULL if the function couldn't be inlined.
5444 : *
5445 : * The division of labor between here and inline_function_in_from is based
5446 : * on the rule that inline_function_in_from should make all checks that are
5447 : * certain to be required in both this case and the support-function case.
5448 : * Support functions might also want to make checks analogous to the ones
5449 : * made here, but then again they might not, or they might just assume that
5450 : * the function they are attached to can validly be inlined.
5451 : */
5452 : static Query *
5453 50494 : inline_sql_function_in_from(PlannerInfo *root,
5454 : RangeTblFunction *rtfunc,
5455 : FuncExpr *fexpr,
5456 : HeapTuple func_tuple,
5457 : Form_pg_proc funcform,
5458 : const char *src)
5459 : {
5460 : Datum sqlbody;
5461 : bool isNull;
5462 : List *querytree_list;
5463 : Query *querytree;
5464 : TypeFuncClass functypclass;
5465 : TupleDesc rettupdesc;
5466 :
5467 : /*
5468 : * The function must be declared to return a set, else inlining would
5469 : * change the results if the contained SELECT didn't return exactly one
5470 : * row.
5471 : */
5472 50494 : if (!fexpr->funcretset)
5473 8552 : return NULL;
5474 :
5475 : /*
5476 : * Forget it if the function is not SQL-language or has other showstopper
5477 : * properties. In particular it mustn't be declared STRICT, since we
5478 : * couldn't enforce that. It also mustn't be VOLATILE, because that is
5479 : * supposed to cause it to be executed with its own snapshot, rather than
5480 : * sharing the snapshot of the calling query. We also disallow returning
5481 : * SETOF VOID, because inlining would result in exposing the actual result
5482 : * of the function's last SELECT, which should not happen in that case.
5483 : * (Rechecking prokind, proretset, and pronargs is just paranoia.)
5484 : */
5485 41942 : if (funcform->prolang != SQLlanguageId ||
5486 648 : funcform->prokind != PROKIND_FUNCTION ||
5487 648 : funcform->proisstrict ||
5488 588 : funcform->provolatile == PROVOLATILE_VOLATILE ||
5489 234 : funcform->prorettype == VOIDOID ||
5490 228 : funcform->prosecdef ||
5491 228 : !funcform->proretset ||
5492 228 : list_length(fexpr->args) != funcform->pronargs)
5493 41714 : return NULL;
5494 :
5495 : /* If we have prosqlbody, pay attention to that not prosrc */
5496 228 : sqlbody = SysCacheGetAttr(PROCOID,
5497 : func_tuple,
5498 : Anum_pg_proc_prosqlbody,
5499 : &isNull);
5500 228 : if (!isNull)
5501 : {
5502 : Node *n;
5503 :
5504 12 : n = stringToNode(TextDatumGetCString(sqlbody));
5505 12 : if (IsA(n, List))
5506 12 : querytree_list = linitial_node(List, castNode(List, n));
5507 : else
5508 0 : querytree_list = list_make1(n);
5509 12 : if (list_length(querytree_list) != 1)
5510 0 : return NULL;
5511 12 : querytree = linitial(querytree_list);
5512 :
5513 : /* Acquire necessary locks, then apply rewriter. */
5514 12 : AcquireRewriteLocks(querytree, true, false);
5515 12 : querytree_list = pg_rewrite_query(querytree);
5516 12 : if (list_length(querytree_list) != 1)
5517 0 : return NULL;
5518 12 : querytree = linitial(querytree_list);
5519 : }
5520 : else
5521 : {
5522 : SQLFunctionParseInfoPtr pinfo;
5523 : List *raw_parsetree_list;
5524 :
5525 : /*
5526 : * Set up to handle parameters while parsing the function body. We
5527 : * can use the FuncExpr just created as the input for
5528 : * prepare_sql_fn_parse_info.
5529 : */
5530 216 : pinfo = prepare_sql_fn_parse_info(func_tuple,
5531 : (Node *) fexpr,
5532 : fexpr->inputcollid);
5533 :
5534 : /*
5535 : * Parse, analyze, and rewrite (unlike inline_function(), we can't
5536 : * skip rewriting here). We can fail as soon as we find more than one
5537 : * query, though.
5538 : */
5539 216 : raw_parsetree_list = pg_parse_query(src);
5540 216 : if (list_length(raw_parsetree_list) != 1)
5541 0 : return NULL;
5542 :
5543 216 : querytree_list = pg_analyze_and_rewrite_withcb(linitial(raw_parsetree_list),
5544 : src,
5545 : (ParserSetupHook) sql_fn_parser_setup,
5546 : pinfo, NULL);
5547 216 : if (list_length(querytree_list) != 1)
5548 0 : return NULL;
5549 216 : querytree = linitial(querytree_list);
5550 : }
5551 :
5552 : /*
5553 : * Also resolve the actual function result tupdesc, if composite. If we
5554 : * have a coldeflist, believe that; otherwise use get_expr_result_type.
5555 : * (This logic should match ExecInitFunctionScan.)
5556 : */
5557 228 : if (rtfunc->funccolnames != NIL)
5558 : {
5559 24 : functypclass = TYPEFUNC_RECORD;
5560 24 : rettupdesc = BuildDescFromLists(rtfunc->funccolnames,
5561 24 : rtfunc->funccoltypes,
5562 24 : rtfunc->funccoltypmods,
5563 24 : rtfunc->funccolcollations);
5564 : }
5565 : else
5566 204 : functypclass = get_expr_result_type((Node *) fexpr, NULL, &rettupdesc);
5567 :
5568 : /*
5569 : * The single command must be a plain SELECT.
5570 : */
5571 228 : if (!IsA(querytree, Query) ||
5572 228 : querytree->commandType != CMD_SELECT)
5573 0 : return NULL;
5574 :
5575 : /*
5576 : * Make sure the function (still) returns what it's declared to. This
5577 : * will raise an error if wrong, but that's okay since the function would
5578 : * fail at runtime anyway. Note that check_sql_fn_retval will also insert
5579 : * coercions if needed to make the tlist expression(s) match the declared
5580 : * type of the function. We also ask it to insert dummy NULL columns for
5581 : * any dropped columns in rettupdesc, so that the elements of the modified
5582 : * tlist match up to the attribute numbers.
5583 : *
5584 : * If the function returns a composite type, don't inline unless the check
5585 : * shows it's returning a whole tuple result; otherwise what it's
5586 : * returning is a single composite column which is not what we need.
5587 : */
5588 228 : if (!check_sql_fn_retval(list_make1(querytree_list),
5589 : fexpr->funcresulttype, rettupdesc,
5590 228 : funcform->prokind,
5591 90 : true) &&
5592 90 : (functypclass == TYPEFUNC_COMPOSITE ||
5593 90 : functypclass == TYPEFUNC_COMPOSITE_DOMAIN ||
5594 : functypclass == TYPEFUNC_RECORD))
5595 0 : return NULL; /* reject not-whole-tuple-result cases */
5596 :
5597 : /*
5598 : * check_sql_fn_retval might've inserted a projection step, but that's
5599 : * fine; just make sure we use the upper Query.
5600 : */
5601 222 : querytree = linitial_node(Query, querytree_list);
5602 :
5603 222 : return querytree;
5604 : }
5605 :
5606 : /*
5607 : * Replace Param nodes by appropriate actual parameters
5608 : *
5609 : * This is just enough different from substitute_actual_parameters()
5610 : * that it needs its own code.
5611 : */
5612 : static Query *
5613 246 : substitute_actual_parameters_in_from(Query *expr, int nargs, List *args)
5614 : {
5615 : substitute_actual_parameters_in_from_context context;
5616 :
5617 246 : context.nargs = nargs;
5618 246 : context.args = args;
5619 246 : context.sublevels_up = 1;
5620 :
5621 246 : return query_tree_mutator(expr,
5622 : substitute_actual_parameters_in_from_mutator,
5623 : &context,
5624 : 0);
5625 : }
5626 :
5627 : static Node *
5628 8838 : substitute_actual_parameters_in_from_mutator(Node *node,
5629 : substitute_actual_parameters_in_from_context *context)
5630 : {
5631 : Node *result;
5632 :
5633 8838 : if (node == NULL)
5634 4980 : return NULL;
5635 3858 : if (IsA(node, Query))
5636 : {
5637 150 : context->sublevels_up++;
5638 150 : result = (Node *) query_tree_mutator((Query *) node,
5639 : substitute_actual_parameters_in_from_mutator,
5640 : context,
5641 : 0);
5642 150 : context->sublevels_up--;
5643 150 : return result;
5644 : }
5645 3708 : if (IsA(node, Param))
5646 : {
5647 114 : Param *param = (Param *) node;
5648 :
5649 114 : if (param->paramkind == PARAM_EXTERN)
5650 : {
5651 114 : if (param->paramid <= 0 || param->paramid > context->nargs)
5652 0 : elog(ERROR, "invalid paramid: %d", param->paramid);
5653 :
5654 : /*
5655 : * Since the parameter is being inserted into a subquery, we must
5656 : * adjust levels.
5657 : */
5658 114 : result = copyObject(list_nth(context->args, param->paramid - 1));
5659 114 : IncrementVarSublevelsUp(result, context->sublevels_up, 0);
5660 114 : return result;
5661 : }
5662 : }
5663 3594 : return expression_tree_mutator(node,
5664 : substitute_actual_parameters_in_from_mutator,
5665 : context);
5666 : }
5667 :
5668 : /*
5669 : * pull_paramids
5670 : * Returns a Bitmapset containing the paramids of all Params in 'expr'.
5671 : */
5672 : Bitmapset *
5673 2028 : pull_paramids(Expr *expr)
5674 : {
5675 2028 : Bitmapset *result = NULL;
5676 :
5677 2028 : (void) pull_paramids_walker((Node *) expr, &result);
5678 :
5679 2028 : return result;
5680 : }
5681 :
5682 : static bool
5683 4526 : pull_paramids_walker(Node *node, Bitmapset **context)
5684 : {
5685 4526 : if (node == NULL)
5686 26 : return false;
5687 4500 : if (IsA(node, Param))
5688 : {
5689 2092 : Param *param = (Param *) node;
5690 :
5691 2092 : *context = bms_add_member(*context, param->paramid);
5692 2092 : return false;
5693 : }
5694 2408 : return expression_tree_walker(node, pull_paramids_walker, context);
5695 : }
5696 :
5697 : /*
5698 : * Build ScalarArrayOpExpr on top of 'exprs.' 'haveNonConst' indicates
5699 : * whether at least one of the expressions is not Const. When it's false,
5700 : * the array constant is built directly; otherwise, we have to build a child
5701 : * ArrayExpr. The 'exprs' list gets freed if not directly used in the output
5702 : * expression tree.
5703 : */
5704 : ScalarArrayOpExpr *
5705 1134 : make_SAOP_expr(Oid oper, Node *leftexpr, Oid coltype, Oid arraycollid,
5706 : Oid inputcollid, List *exprs, bool haveNonConst)
5707 : {
5708 1134 : Node *arrayNode = NULL;
5709 1134 : ScalarArrayOpExpr *saopexpr = NULL;
5710 1134 : Oid arraytype = get_array_type(coltype);
5711 :
5712 1134 : if (!OidIsValid(arraytype))
5713 0 : return NULL;
5714 :
5715 : /*
5716 : * Assemble an array from the list of constants. It seems more profitable
5717 : * to build a const array. But in the presence of other nodes, we don't
5718 : * have a specific value here and must employ an ArrayExpr instead.
5719 : */
5720 1134 : if (haveNonConst)
5721 : {
5722 96 : ArrayExpr *arrayExpr = makeNode(ArrayExpr);
5723 :
5724 : /* array_collid will be set by parse_collate.c */
5725 96 : arrayExpr->element_typeid = coltype;
5726 96 : arrayExpr->array_typeid = arraytype;
5727 96 : arrayExpr->multidims = false;
5728 96 : arrayExpr->elements = exprs;
5729 96 : arrayExpr->location = -1;
5730 :
5731 96 : arrayNode = (Node *) arrayExpr;
5732 : }
5733 : else
5734 : {
5735 : int16 typlen;
5736 : bool typbyval;
5737 : char typalign;
5738 : Datum *elems;
5739 : bool *nulls;
5740 1038 : int i = 0;
5741 : ArrayType *arrayConst;
5742 1038 : int dims[1] = {list_length(exprs)};
5743 1038 : int lbs[1] = {1};
5744 :
5745 1038 : get_typlenbyvalalign(coltype, &typlen, &typbyval, &typalign);
5746 :
5747 1038 : elems = (Datum *) palloc(sizeof(Datum) * list_length(exprs));
5748 1038 : nulls = (bool *) palloc(sizeof(bool) * list_length(exprs));
5749 4638 : foreach_node(Const, value, exprs)
5750 : {
5751 2562 : elems[i] = value->constvalue;
5752 2562 : nulls[i++] = value->constisnull;
5753 : }
5754 :
5755 1038 : arrayConst = construct_md_array(elems, nulls, 1, dims, lbs,
5756 : coltype, typlen, typbyval, typalign);
5757 1038 : arrayNode = (Node *) makeConst(arraytype, -1, arraycollid,
5758 : -1, PointerGetDatum(arrayConst),
5759 : false, false);
5760 :
5761 1038 : pfree(elems);
5762 1038 : pfree(nulls);
5763 1038 : list_free(exprs);
5764 : }
5765 :
5766 : /* Build the SAOP expression node */
5767 1134 : saopexpr = makeNode(ScalarArrayOpExpr);
5768 1134 : saopexpr->opno = oper;
5769 1134 : saopexpr->opfuncid = get_opcode(oper);
5770 1134 : saopexpr->hashfuncid = InvalidOid;
5771 1134 : saopexpr->negfuncid = InvalidOid;
5772 1134 : saopexpr->useOr = true;
5773 1134 : saopexpr->inputcollid = inputcollid;
5774 1134 : saopexpr->args = list_make2(leftexpr, arrayNode);
5775 1134 : saopexpr->location = -1;
5776 :
5777 1134 : return saopexpr;
5778 : }
|
