I wrote:
> Apparently this idea failed to account for subexpressions pulled up
> during later processing. Back to the drawing board.
After further study of 7266d0997, it seems we could fix this by
the expedient of repeating eval_const_expressions on a function
RTE whenever it contains LATERAL references. The code already
understood that lateral join aliases were trouble, but it didn't
account for the case of subexpressions inserted by subquery
pullup (which'd have to have been lateral refs originally).
The whole thing makes me itch a little bit, because this logic is
assuming that eval_const_expressions is idempotent, something
we can't test very well and (AFAIR) are not assuming anywhere else.
If somebody made some sub-case not idempotent, we'd not notice until
that case got used in a lateral function RTE. That could be a long
time, as evidenced by the fact that this bug went undetected for a
year since v13 release. However, we had that assumption in the code
7266d0997 replaced too, so this isn't adding any real new risk.
I looked briefly at whether the planner's preprocessing steps
could be re-ordered to eliminate the need for sometimes reprocessing
function RTEs. It looks like it'd be a mess though, a conclusion
I think I also reached before committing 7266d0997.
Anyway, unless somebody has a better idea, I'll flesh out the
attached with a test case and push it.
regards, tom lane
diff --git a/src/backend/optimizer/plan/planner.c b/src/backend/optimizer/plan/planner.c
index 1e42d75465..56722616a3 100644
--- a/src/backend/optimizer/plan/planner.c
+++ b/src/backend/optimizer/plan/planner.c
@@ -1085,7 +1085,8 @@ preprocess_expression(PlannerInfo *root, Node *expr, int kind)
/*
* Simplify constant expressions. For function RTEs, this was already
* done by preprocess_function_rtes ... but we have to do it again if the
- * RTE is LATERAL and might have contained join alias variables.
+ * RTE is LATERAL, as it might contain un-simplified subexpressions
+ * inserted by flattening of subqueries or join alias variables.
*
* Note: an essential effect of this is to convert named-argument function
* calls to positional notation and insert the current actual values of
@@ -1099,8 +1100,7 @@ preprocess_expression(PlannerInfo *root, Node *expr, int kind)
* careful to maintain AND/OR flatness --- that is, do not generate a tree
* with AND directly under AND, nor OR directly under OR.
*/
- if (!(kind == EXPRKIND_RTFUNC ||
- (kind == EXPRKIND_RTFUNC_LATERAL && !root->hasJoinRTEs)))
+ if (kind != EXPRKIND_RTFUNC)
expr = eval_const_expressions(root, expr);
/*