| 1 |
/*------------------------------------------------------------------------- |
| 2 |
* |
| 3 |
* var.c |
| 4 |
* Var node manipulation routines |
| 5 |
* |
| 6 |
* Note: for most purposes, PlaceHolderVar is considered a Var too, |
| 7 |
* even if its contained expression is variable-free. Also, CurrentOfExpr |
| 8 |
* is treated as a Var for purposes of determining whether an expression |
| 9 |
* contains variables. |
| 10 |
* |
| 11 |
* |
| 12 |
* Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group |
| 13 |
* Portions Copyright (c) 1994, Regents of the University of California |
| 14 |
* |
| 15 |
* |
| 16 |
* IDENTIFICATION |
| 17 |
* src/backend/optimizer/util/var.c |
| 18 |
* |
| 19 |
*------------------------------------------------------------------------- |
| 20 |
*/ |
| 21 |
#include "postgres.h" |
| 22 |
|
| 23 |
#include "access/sysattr.h" |
| 24 |
#include "nodes/nodeFuncs.h" |
| 25 |
#include "optimizer/clauses.h" |
| 26 |
#include "optimizer/optimizer.h" |
| 27 |
#include "optimizer/placeholder.h" |
| 28 |
#include "optimizer/prep.h" |
| 29 |
#include "parser/parsetree.h" |
| 30 |
#include "rewrite/rewriteManip.h" |
| 31 |
|
| 32 |
|
| 33 |
typedef struct |
| 34 |
{ |
| 35 |
Relids varnos; |
| 36 |
PlannerInfo *root; |
| 37 |
int sublevels_up; |
| 38 |
} pull_varnos_context; |
| 39 |
|
| 40 |
typedef struct |
| 41 |
{ |
| 42 |
Bitmapset *varattnos; |
| 43 |
Index varno; |
| 44 |
} pull_varattnos_context; |
| 45 |
|
| 46 |
typedef struct |
| 47 |
{ |
| 48 |
List *vars; |
| 49 |
int sublevels_up; |
| 50 |
} pull_vars_context; |
| 51 |
|
| 52 |
typedef struct |
| 53 |
{ |
| 54 |
int var_location; |
| 55 |
int sublevels_up; |
| 56 |
} locate_var_of_level_context; |
| 57 |
|
| 58 |
typedef struct |
| 59 |
{ |
| 60 |
List *varlist; |
| 61 |
int flags; |
| 62 |
} pull_var_clause_context; |
| 63 |
|
| 64 |
typedef struct |
| 65 |
{ |
| 66 |
PlannerInfo *root; /* could be NULL! */ |
| 67 |
Query *query; /* outer Query */ |
| 68 |
int sublevels_up; |
| 69 |
bool possible_sublink; /* could aliases include a SubLink? */ |
| 70 |
bool inserted_sublink; /* have we inserted a SubLink? */ |
| 71 |
} flatten_join_alias_vars_context; |
| 72 |
|
| 73 |
static bool pull_varnos_walker(Node *node, |
| 74 |
pull_varnos_context *context); |
| 75 |
static bool pull_varattnos_walker(Node *node, pull_varattnos_context *context); |
| 76 |
static bool pull_vars_walker(Node *node, pull_vars_context *context); |
| 77 |
static bool contain_var_clause_walker(Node *node, void *context); |
| 78 |
static bool contain_vars_of_level_walker(Node *node, int *sublevels_up); |
| 79 |
static bool contain_vars_returning_old_or_new_walker(Node *node, void *context); |
| 80 |
static bool locate_var_of_level_walker(Node *node, |
| 81 |
locate_var_of_level_context *context); |
| 82 |
static bool pull_var_clause_walker(Node *node, |
| 83 |
pull_var_clause_context *context); |
| 84 |
static Node *flatten_join_alias_vars_mutator(Node *node, |
| 85 |
flatten_join_alias_vars_context *context); |
| 86 |
static Node *flatten_group_exprs_mutator(Node *node, |
| 87 |
flatten_join_alias_vars_context *context); |
| 88 |
static Node *mark_nullable_by_grouping(PlannerInfo *root, Node *newnode, |
| 89 |
Var *oldvar); |
| 90 |
static Node *add_nullingrels_if_needed(PlannerInfo *root, Node *newnode, |
| 91 |
Var *oldvar); |
| 92 |
static bool is_standard_join_alias_expression(Node *newnode, Var *oldvar); |
| 93 |
static void adjust_standard_join_alias_expression(Node *newnode, Var *oldvar); |
| 94 |
static Relids alias_relid_set(Query *query, Relids relids); |
| 95 |
|
| 96 |
|
| 97 |
/* |
| 98 |
* pull_varnos |
| 99 |
* Create a set of all the distinct varnos present in a parsetree. |
| 100 |
* Only varnos that reference level-zero rtable entries are considered. |
| 101 |
* |
| 102 |
* The result includes outer-join relids mentioned in Var.varnullingrels and |
| 103 |
* PlaceHolderVar.phnullingrels fields in the parsetree. |
| 104 |
* |
| 105 |
* "root" can be passed as NULL if it is not necessary to process |
| 106 |
* PlaceHolderVars. |
| 107 |
* |
| 108 |
* NOTE: this is used on not-yet-planned expressions. It may therefore find |
| 109 |
* bare SubLinks, and if so it needs to recurse into them to look for uplevel |
| 110 |
* references to the desired rtable level! But when we find a completed |
| 111 |
* SubPlan, we only need to look at the parameters passed to the subplan. |
| 112 |
*/ |
| 113 |
Relids |
| 114 |
pull_varnos(PlannerInfo *root, Node *node) |
| 115 |
{ |
| 116 |
pull_varnos_context context; |
| 117 |
|
| 118 |
context.varnos = NULL; |
| 119 |
context.root = root; |
| 120 |
context.sublevels_up = 0; |
| 121 |
|
| 122 |
/* |
| 123 |
* Must be prepared to start with a Query or a bare expression tree; if |
| 124 |
* it's a Query, we don't want to increment sublevels_up. |
| 125 |
*/ |
| 126 |
query_or_expression_tree_walker(node, |
| 127 |
pull_varnos_walker, |
| 128 |
&context, |
| 129 |
0); |
| 130 |
|
| 131 |
return context.varnos; |
| 132 |
} |
| 133 |
|
| 134 |
/* |
| 135 |
* pull_varnos_of_level |
| 136 |
* Create a set of all the distinct varnos present in a parsetree. |
| 137 |
* Only Vars of the specified level are considered. |
| 138 |
*/ |
| 139 |
Relids |
| 140 |
pull_varnos_of_level(PlannerInfo *root, Node *node, int levelsup) |
| 141 |
{ |
| 142 |
pull_varnos_context context; |
| 143 |
|
| 144 |
context.varnos = NULL; |
| 145 |
context.root = root; |
| 146 |
context.sublevels_up = levelsup; |
| 147 |
|
| 148 |
/* |
| 149 |
* Must be prepared to start with a Query or a bare expression tree; if |
| 150 |
* it's a Query, we don't want to increment sublevels_up. |
| 151 |
*/ |
| 152 |
query_or_expression_tree_walker(node, |
| 153 |
pull_varnos_walker, |
| 154 |
&context, |
| 155 |
0); |
| 156 |
|
| 157 |
return context.varnos; |
| 158 |
} |
| 159 |
|
| 160 |
static bool |
| 161 |
pull_varnos_walker(Node *node, pull_varnos_context *context) |
| 162 |
{ |
| 163 |
if (node == NULL) |
| 164 |
return false; |
| 165 |
if (IsA(node, Var)) |
| 166 |
{ |
| 167 |
Var *var = (Var *) node; |
| 168 |
|
| 169 |
if (var->varlevelsup == context->sublevels_up) |
| 170 |
{ |
| 171 |
context->varnos = bms_add_member(context->varnos, var->varno); |
| 172 |
context->varnos = bms_add_members(context->varnos, |
| 173 |
var->varnullingrels); |
| 174 |
} |
| 175 |
return false; |
| 176 |
} |
| 177 |
if (IsA(node, CurrentOfExpr)) |
| 178 |
{ |
| 179 |
CurrentOfExpr *cexpr = (CurrentOfExpr *) node; |
| 180 |
|
| 181 |
if (context->sublevels_up == 0) |
| 182 |
context->varnos = bms_add_member(context->varnos, cexpr->cvarno); |
| 183 |
return false; |
| 184 |
} |
| 185 |
if (IsA(node, PlaceHolderVar)) |
| 186 |
{ |
| 187 |
PlaceHolderVar *phv = (PlaceHolderVar *) node; |
| 188 |
|
| 189 |
/* |
| 190 |
* If a PlaceHolderVar is not of the target query level, ignore it, |
| 191 |
* instead recursing into its expression to see if it contains any |
| 192 |
* vars that are of the target level. We'll also do that when the |
| 193 |
* caller doesn't pass a "root" pointer. (We probably shouldn't see |
| 194 |
* PlaceHolderVars at all in such cases, but if we do, this is a |
| 195 |
* reasonable behavior.) |
| 196 |
*/ |
| 197 |
if (phv->phlevelsup == context->sublevels_up && |
| 198 |
context->root != NULL) |
| 199 |
{ |
| 200 |
/* |
| 201 |
* Ideally, the PHV's contribution to context->varnos is its |
| 202 |
* ph_eval_at set. However, this code can be invoked before |
| 203 |
* that's been computed. If we cannot find a PlaceHolderInfo, |
| 204 |
* fall back to the conservative assumption that the PHV will be |
| 205 |
* evaluated at its syntactic level (phv->phrels). |
| 206 |
* |
| 207 |
* Another problem is that a PlaceHolderVar can appear in quals or |
| 208 |
* tlists that have been translated for use in a child appendrel. |
| 209 |
* Typically such a PHV is a parameter expression sourced by some |
| 210 |
* other relation, so that the translation from parent appendrel |
| 211 |
* to child doesn't change its phrels, and we should still take |
| 212 |
* ph_eval_at at face value. But in corner cases, the PHV's |
| 213 |
* original phrels can include the parent appendrel itself, in |
| 214 |
* which case the translated PHV will have the child appendrel in |
| 215 |
* phrels, and we must translate ph_eval_at to match. |
| 216 |
*/ |
| 217 |
PlaceHolderInfo *phinfo = NULL; |
| 218 |
|
| 219 |
if (phv->phlevelsup == 0) |
| 220 |
{ |
| 221 |
if (phv->phid < context->root->placeholder_array_size) |
| 222 |
phinfo = context->root->placeholder_array[phv->phid]; |
| 223 |
} |
| 224 |
if (phinfo == NULL) |
| 225 |
{ |
| 226 |
/* No PlaceHolderInfo yet, use phrels */ |
| 227 |
context->varnos = bms_add_members(context->varnos, |
| 228 |
phv->phrels); |
| 229 |
} |
| 230 |
else if (bms_equal(phv->phrels, phinfo->ph_var->phrels)) |
| 231 |
{ |
| 232 |
/* Normal case: use ph_eval_at */ |
| 233 |
context->varnos = bms_add_members(context->varnos, |
| 234 |
phinfo->ph_eval_at); |
| 235 |
} |
| 236 |
else |
| 237 |
{ |
| 238 |
/* Translated PlaceHolderVar: translate ph_eval_at to match */ |
| 239 |
Relids newevalat, |
| 240 |
delta; |
| 241 |
|
| 242 |
/* remove what was removed from phv->phrels ... */ |
| 243 |
delta = bms_difference(phinfo->ph_var->phrels, phv->phrels); |
| 244 |
newevalat = bms_difference(phinfo->ph_eval_at, delta); |
| 245 |
/* ... then if that was in fact part of ph_eval_at ... */ |
| 246 |
if (!bms_equal(newevalat, phinfo->ph_eval_at)) |
| 247 |
{ |
| 248 |
/* ... add what was added */ |
| 249 |
delta = bms_difference(phv->phrels, phinfo->ph_var->phrels); |
| 250 |
newevalat = bms_join(newevalat, delta); |
| 251 |
} |
| 252 |
context->varnos = bms_join(context->varnos, |
| 253 |
newevalat); |
| 254 |
} |
| 255 |
|
| 256 |
/* |
| 257 |
* In all three cases, include phnullingrels in the result. We |
| 258 |
* don't worry about possibly needing to translate it, because |
| 259 |
* appendrels only translate varnos of baserels, not outer joins. |
| 260 |
*/ |
| 261 |
context->varnos = bms_add_members(context->varnos, |
| 262 |
phv->phnullingrels); |
| 263 |
return false; /* don't recurse into expression */ |
| 264 |
} |
| 265 |
} |
| 266 |
else if (IsA(node, Query)) |
| 267 |
{ |
| 268 |
/* Recurse into RTE subquery or not-yet-planned sublink subquery */ |
| 269 |
bool result; |
| 270 |
|
| 271 |
context->sublevels_up++; |
| 272 |
result = query_tree_walker((Query *) node, pull_varnos_walker, |
| 273 |
context, 0); |
| 274 |
context->sublevels_up--; |
| 275 |
return result; |
| 276 |
} |
| 277 |
return expression_tree_walker(node, pull_varnos_walker, context); |
| 278 |
} |
| 279 |
|
| 280 |
|
| 281 |
/* |
| 282 |
* pull_varattnos |
| 283 |
* Find all the distinct attribute numbers present in an expression tree, |
| 284 |
* and add them to the initial contents of *varattnos. |
| 285 |
* Only Vars of the given varno and rtable level zero are considered. |
| 286 |
* |
| 287 |
* Attribute numbers are offset by FirstLowInvalidHeapAttributeNumber so that |
| 288 |
* we can include system attributes (e.g., OID) in the bitmap representation. |
| 289 |
* |
| 290 |
* Currently, this does not support unplanned subqueries; that is not needed |
| 291 |
* for current uses. It will handle already-planned SubPlan nodes, though, |
| 292 |
* looking into only the "testexpr" and the "args" list. (The subplan cannot |
| 293 |
* contain any other references to Vars of the current level.) |
| 294 |
*/ |
| 295 |
void |
| 296 |
pull_varattnos(Node *node, Index varno, Bitmapset **varattnos) |
| 297 |
{ |
| 298 |
pull_varattnos_context context; |
| 299 |
|
| 300 |
context.varattnos = *varattnos; |
| 301 |
context.varno = varno; |
| 302 |
|
| 303 |
(void) pull_varattnos_walker(node, &context); |
| 304 |
|
| 305 |
*varattnos = context.varattnos; |
| 306 |
} |
| 307 |
|
| 308 |
static bool |
| 309 |
pull_varattnos_walker(Node *node, pull_varattnos_context *context) |
| 310 |
{ |
| 311 |
if (node == NULL) |
| 312 |
return false; |
| 313 |
if (IsA(node, Var)) |
| 314 |
{ |
| 315 |
Var *var = (Var *) node; |
| 316 |
|
| 317 |
if (var->varno == context->varno && var->varlevelsup == 0) |
| 318 |
context->varattnos = |
| 319 |
bms_add_member(context->varattnos, |
| 320 |
var->varattno - FirstLowInvalidHeapAttributeNumber); |
| 321 |
return false; |
| 322 |
} |
| 323 |
|
| 324 |
/* Should not find an unplanned subquery */ |
| 325 |
Assert(!IsA(node, Query)); |
| 326 |
|
| 327 |
return expression_tree_walker(node, pull_varattnos_walker, context); |
| 328 |
} |
| 329 |
|
| 330 |
|
| 331 |
/* |
| 332 |
* pull_vars_of_level |
| 333 |
* Create a list of all Vars (and PlaceHolderVars) referencing the |
| 334 |
* specified query level in the given parsetree. |
| 335 |
* |
| 336 |
* Caution: the Vars are not copied, only linked into the list. |
| 337 |
*/ |
| 338 |
List * |
| 339 |
pull_vars_of_level(Node *node, int levelsup) |
| 340 |
{ |
| 341 |
pull_vars_context context; |
| 342 |
|
| 343 |
context.vars = NIL; |
| 344 |
context.sublevels_up = levelsup; |
| 345 |
|
| 346 |
/* |
| 347 |
* Must be prepared to start with a Query or a bare expression tree; if |
| 348 |
* it's a Query, we don't want to increment sublevels_up. |
| 349 |
*/ |
| 350 |
query_or_expression_tree_walker(node, |
| 351 |
pull_vars_walker, |
| 352 |
&context, |
| 353 |
0); |
| 354 |
|
| 355 |
return context.vars; |
| 356 |
} |
| 357 |
|
| 358 |
static bool |
| 359 |
pull_vars_walker(Node *node, pull_vars_context *context) |
| 360 |
{ |
| 361 |
if (node == NULL) |
| 362 |
return false; |
| 363 |
if (IsA(node, Var)) |
| 364 |
{ |
| 365 |
Var *var = (Var *) node; |
| 366 |
|
| 367 |
if (var->varlevelsup == context->sublevels_up) |
| 368 |
context->vars = lappend(context->vars, var); |
| 369 |
return false; |
| 370 |
} |
| 371 |
if (IsA(node, PlaceHolderVar)) |
| 372 |
{ |
| 373 |
PlaceHolderVar *phv = (PlaceHolderVar *) node; |
| 374 |
|
| 375 |
if (phv->phlevelsup == context->sublevels_up) |
| 376 |
context->vars = lappend(context->vars, phv); |
| 377 |
/* we don't want to look into the contained expression */ |
| 378 |
return false; |
| 379 |
} |
| 380 |
if (IsA(node, Query)) |
| 381 |
{ |
| 382 |
/* Recurse into RTE subquery or not-yet-planned sublink subquery */ |
| 383 |
bool result; |
| 384 |
|
| 385 |
context->sublevels_up++; |
| 386 |
result = query_tree_walker((Query *) node, pull_vars_walker, |
| 387 |
context, 0); |
| 388 |
context->sublevels_up--; |
| 389 |
return result; |
| 390 |
} |
| 391 |
return expression_tree_walker(node, pull_vars_walker, context); |
| 392 |
} |
| 393 |
|
| 394 |
|
| 395 |
/* |
| 396 |
* contain_var_clause |
| 397 |
* Recursively scan a clause to discover whether it contains any Var nodes |
| 398 |
* (of the current query level). |
| 399 |
* |
| 400 |
* Returns true if any varnode found. |
| 401 |
* |
| 402 |
* Does not examine subqueries, therefore must only be used after reduction |
| 403 |
* of sublinks to subplans! |
| 404 |
*/ |
| 405 |
bool |
| 406 |
contain_var_clause(Node *node) |
| 407 |
{ |
| 408 |
return contain_var_clause_walker(node, NULL); |
| 409 |
} |
| 410 |
|
| 411 |
static bool |
| 412 |
contain_var_clause_walker(Node *node, void *context) |
| 413 |
{ |
| 414 |
if (node == NULL) |
| 415 |
return false; |
| 416 |
if (IsA(node, Var)) |
| 417 |
{ |
| 418 |
if (((Var *) node)->varlevelsup == 0) |
| 419 |
return true; /* abort the tree traversal and return true */ |
| 420 |
return false; |
| 421 |
} |
| 422 |
if (IsA(node, CurrentOfExpr)) |
| 423 |
return true; |
| 424 |
if (IsA(node, PlaceHolderVar)) |
| 425 |
{ |
| 426 |
if (((PlaceHolderVar *) node)->phlevelsup == 0) |
| 427 |
return true; /* abort the tree traversal and return true */ |
| 428 |
/* else fall through to check the contained expr */ |
| 429 |
} |
| 430 |
return expression_tree_walker(node, contain_var_clause_walker, context); |
| 431 |
} |
| 432 |
|
| 433 |
|
| 434 |
/* |
| 435 |
* contain_vars_of_level |
| 436 |
* Recursively scan a clause to discover whether it contains any Var nodes |
| 437 |
* of the specified query level. |
| 438 |
* |
| 439 |
* Returns true if any such Var found. |
| 440 |
* |
| 441 |
* Will recurse into sublinks. Also, may be invoked directly on a Query. |
| 442 |
*/ |
| 443 |
bool |
| 444 |
contain_vars_of_level(Node *node, int levelsup) |
| 445 |
{ |
| 446 |
int sublevels_up = levelsup; |
| 447 |
|
| 448 |
return query_or_expression_tree_walker(node, |
| 449 |
contain_vars_of_level_walker, |
| 450 |
&sublevels_up, |
| 451 |
0); |
| 452 |
} |
| 453 |
|
| 454 |
static bool |
| 455 |
contain_vars_of_level_walker(Node *node, int *sublevels_up) |
| 456 |
{ |
| 457 |
if (node == NULL) |
| 458 |
return false; |
| 459 |
if (IsA(node, Var)) |
| 460 |
{ |
| 461 |
if (((Var *) node)->varlevelsup == *sublevels_up) |
| 462 |
return true; /* abort tree traversal and return true */ |
| 463 |
return false; |
| 464 |
} |
| 465 |
if (IsA(node, CurrentOfExpr)) |
| 466 |
{ |
| 467 |
if (*sublevels_up == 0) |
| 468 |
return true; |
| 469 |
return false; |
| 470 |
} |
| 471 |
if (IsA(node, PlaceHolderVar)) |
| 472 |
{ |
| 473 |
if (((PlaceHolderVar *) node)->phlevelsup == *sublevels_up) |
| 474 |
return true; /* abort the tree traversal and return true */ |
| 475 |
/* else fall through to check the contained expr */ |
| 476 |
} |
| 477 |
if (IsA(node, Query)) |
| 478 |
{ |
| 479 |
/* Recurse into subselects */ |
| 480 |
bool result; |
| 481 |
|
| 482 |
(*sublevels_up)++; |
| 483 |
result = query_tree_walker((Query *) node, |
| 484 |
contain_vars_of_level_walker, |
| 485 |
sublevels_up, |
| 486 |
0); |
| 487 |
(*sublevels_up)--; |
| 488 |
return result; |
| 489 |
} |
| 490 |
return expression_tree_walker(node, |
| 491 |
contain_vars_of_level_walker, |
| 492 |
sublevels_up); |
| 493 |
} |
| 494 |
|
| 495 |
|
| 496 |
/* |
| 497 |
* contain_vars_returning_old_or_new |
| 498 |
* Recursively scan a clause to discover whether it contains any Var nodes |
| 499 |
* (of the current query level) whose varreturningtype is VAR_RETURNING_OLD |
| 500 |
* or VAR_RETURNING_NEW. |
| 501 |
* |
| 502 |
* Returns true if any found. |
| 503 |
* |
| 504 |
* Any ReturningExprs are also detected --- if an OLD/NEW Var was rewritten, |
| 505 |
* we still regard this as a clause that returns OLD/NEW values. |
| 506 |
* |
| 507 |
* Does not examine subqueries, therefore must only be used after reduction |
| 508 |
* of sublinks to subplans! |
| 509 |
*/ |
| 510 |
bool |
| 511 |
contain_vars_returning_old_or_new(Node *node) |
| 512 |
{ |
| 513 |
return contain_vars_returning_old_or_new_walker(node, NULL); |
| 514 |
} |
| 515 |
|
| 516 |
static bool |
| 517 |
contain_vars_returning_old_or_new_walker(Node *node, void *context) |
| 518 |
{ |
| 519 |
if (node == NULL) |
| 520 |
return false; |
| 521 |
if (IsA(node, Var)) |
| 522 |
{ |
| 523 |
if (((Var *) node)->varlevelsup == 0 && |
| 524 |
((Var *) node)->varreturningtype != VAR_RETURNING_DEFAULT) |
| 525 |
return true; /* abort the tree traversal and return true */ |
| 526 |
return false; |
| 527 |
} |
| 528 |
if (IsA(node, ReturningExpr)) |
| 529 |
{ |
| 530 |
if (((ReturningExpr *) node)->retlevelsup == 0) |
| 531 |
return true; /* abort the tree traversal and return true */ |
| 532 |
return false; |
| 533 |
} |
| 534 |
return expression_tree_walker(node, contain_vars_returning_old_or_new_walker, |
| 535 |
context); |
| 536 |
} |
| 537 |
|
| 538 |
|
| 539 |
/* |
| 540 |
* locate_var_of_level |
| 541 |
* Find the parse location of any Var of the specified query level. |
| 542 |
* |
| 543 |
* Returns -1 if no such Var is in the querytree, or if they all have |
| 544 |
* unknown parse location. (The former case is probably caller error, |
| 545 |
* but we don't bother to distinguish it from the latter case.) |
| 546 |
* |
| 547 |
* Will recurse into sublinks. Also, may be invoked directly on a Query. |
| 548 |
* |
| 549 |
* Note: it might seem appropriate to merge this functionality into |
| 550 |
* contain_vars_of_level, but that would complicate that function's API. |
| 551 |
* Currently, the only uses of this function are for error reporting, |
| 552 |
* and so shaving cycles probably isn't very important. |
| 553 |
*/ |
| 554 |
int |
| 555 |
locate_var_of_level(Node *node, int levelsup) |
| 556 |
{ |
| 557 |
locate_var_of_level_context context; |
| 558 |
|
| 559 |
context.var_location = -1; /* in case we find nothing */ |
| 560 |
context.sublevels_up = levelsup; |
| 561 |
|
| 562 |
(void) query_or_expression_tree_walker(node, |
| 563 |
locate_var_of_level_walker, |
| 564 |
&context, |
| 565 |
0); |
| 566 |
|
| 567 |
return context.var_location; |
| 568 |
} |
| 569 |
|
| 570 |
static bool |
| 571 |
locate_var_of_level_walker(Node *node, |
| 572 |
locate_var_of_level_context *context) |
| 573 |
{ |
| 574 |
if (node == NULL) |
| 575 |
return false; |
| 576 |
if (IsA(node, Var)) |
| 577 |
{ |
| 578 |
Var *var = (Var *) node; |
| 579 |
|
| 580 |
if (var->varlevelsup == context->sublevels_up && |
| 581 |
var->location >= 0) |
| 582 |
{ |
| 583 |
context->var_location = var->location; |
| 584 |
return true; /* abort tree traversal and return true */ |
| 585 |
} |
| 586 |
return false; |
| 587 |
} |
| 588 |
if (IsA(node, CurrentOfExpr)) |
| 589 |
{ |
| 590 |
/* since CurrentOfExpr doesn't carry location, nothing we can do */ |
| 591 |
return false; |
| 592 |
} |
| 593 |
/* No extra code needed for PlaceHolderVar; just look in contained expr */ |
| 594 |
if (IsA(node, Query)) |
| 595 |
{ |
| 596 |
/* Recurse into subselects */ |
| 597 |
bool result; |
| 598 |
|
| 599 |
context->sublevels_up++; |
| 600 |
result = query_tree_walker((Query *) node, |
| 601 |
locate_var_of_level_walker, |
| 602 |
context, |
| 603 |
0); |
| 604 |
context->sublevels_up--; |
| 605 |
return result; |
| 606 |
} |
| 607 |
return expression_tree_walker(node, |
| 608 |
locate_var_of_level_walker, |
| 609 |
context); |
| 610 |
} |
| 611 |
|
| 612 |
|
| 613 |
/* |
| 614 |
* pull_var_clause |
| 615 |
* Recursively pulls all Var nodes from an expression clause. |
| 616 |
* |
| 617 |
* Aggrefs are handled according to these bits in 'flags': |
| 618 |
* PVC_INCLUDE_AGGREGATES include Aggrefs in output list |
| 619 |
* PVC_RECURSE_AGGREGATES recurse into Aggref arguments |
| 620 |
* neither flag throw error if Aggref found |
| 621 |
* Vars within an Aggref's expression are included in the result only |
| 622 |
* when PVC_RECURSE_AGGREGATES is specified. |
| 623 |
* |
| 624 |
* WindowFuncs are handled according to these bits in 'flags': |
| 625 |
* PVC_INCLUDE_WINDOWFUNCS include WindowFuncs in output list |
| 626 |
* PVC_RECURSE_WINDOWFUNCS recurse into WindowFunc arguments |
| 627 |
* neither flag throw error if WindowFunc found |
| 628 |
* Vars within a WindowFunc's expression are included in the result only |
| 629 |
* when PVC_RECURSE_WINDOWFUNCS is specified. |
| 630 |
* |
| 631 |
* PlaceHolderVars are handled according to these bits in 'flags': |
| 632 |
* PVC_INCLUDE_PLACEHOLDERS include PlaceHolderVars in output list |
| 633 |
* PVC_RECURSE_PLACEHOLDERS recurse into PlaceHolderVar arguments |
| 634 |
* neither flag throw error if PlaceHolderVar found |
| 635 |
* Vars within a PHV's expression are included in the result only |
| 636 |
* when PVC_RECURSE_PLACEHOLDERS is specified. |
| 637 |
* |
| 638 |
* GroupingFuncs are treated exactly like Aggrefs, and so do not need |
| 639 |
* their own flag bits. |
| 640 |
* |
| 641 |
* CurrentOfExpr nodes are ignored in all cases. |
| 642 |
* |
| 643 |
* Upper-level vars (with varlevelsup > 0) should not be seen here, |
| 644 |
* likewise for upper-level Aggrefs and PlaceHolderVars. |
| 645 |
* |
| 646 |
* Returns list of nodes found. Note the nodes themselves are not |
| 647 |
* copied, only referenced. |
| 648 |
* |
| 649 |
* Does not examine subqueries, therefore must only be used after reduction |
| 650 |
* of sublinks to subplans! |
| 651 |
*/ |
| 652 |
List * |
| 653 |
pull_var_clause(Node *node, int flags) |
| 654 |
{ |
| 655 |
pull_var_clause_context context; |
| 656 |
|
| 657 |
/* Assert that caller has not specified inconsistent flags */ |
| 658 |
Assert((flags & (PVC_INCLUDE_AGGREGATES | PVC_RECURSE_AGGREGATES)) |
| 659 |
!= (PVC_INCLUDE_AGGREGATES | PVC_RECURSE_AGGREGATES)); |
| 660 |
Assert((flags & (PVC_INCLUDE_WINDOWFUNCS | PVC_RECURSE_WINDOWFUNCS)) |
| 661 |
!= (PVC_INCLUDE_WINDOWFUNCS | PVC_RECURSE_WINDOWFUNCS)); |
| 662 |
Assert((flags & (PVC_INCLUDE_PLACEHOLDERS | PVC_RECURSE_PLACEHOLDERS)) |
| 663 |
!= (PVC_INCLUDE_PLACEHOLDERS | PVC_RECURSE_PLACEHOLDERS)); |
| 664 |
|
| 665 |
context.varlist = NIL; |
| 666 |
context.flags = flags; |
| 667 |
|
| 668 |
pull_var_clause_walker(node, &context); |
| 669 |
return context.varlist; |
| 670 |
} |
| 671 |
|
| 672 |
static bool |
| 673 |
pull_var_clause_walker(Node *node, pull_var_clause_context *context) |
| 674 |
{ |
| 675 |
if (node == NULL) |
| 676 |
return false; |
| 677 |
if (IsA(node, Var)) |
| 678 |
{ |
| 679 |
if (((Var *) node)->varlevelsup != 0) |
| 680 |
elog(ERROR, "Upper-level Var found where not expected"); |
| 681 |
context->varlist = lappend(context->varlist, node); |
| 682 |
return false; |
| 683 |
} |
| 684 |
else if (IsA(node, Aggref)) |
| 685 |
{ |
| 686 |
if (((Aggref *) node)->agglevelsup != 0) |
| 687 |
elog(ERROR, "Upper-level Aggref found where not expected"); |
| 688 |
if (context->flags & PVC_INCLUDE_AGGREGATES) |
| 689 |
{ |
| 690 |
context->varlist = lappend(context->varlist, node); |
| 691 |
/* we do NOT descend into the contained expression */ |
| 692 |
return false; |
| 693 |
} |
| 694 |
else if (context->flags & PVC_RECURSE_AGGREGATES) |
| 695 |
{ |
| 696 |
/* fall through to recurse into the aggregate's arguments */ |
| 697 |
} |
| 698 |
else |
| 699 |
elog(ERROR, "Aggref found where not expected"); |
| 700 |
} |
| 701 |
else if (IsA(node, GroupingFunc)) |
| 702 |
{ |
| 703 |
if (((GroupingFunc *) node)->agglevelsup != 0) |
| 704 |
elog(ERROR, "Upper-level GROUPING found where not expected"); |
| 705 |
if (context->flags & PVC_INCLUDE_AGGREGATES) |
| 706 |
{ |
| 707 |
context->varlist = lappend(context->varlist, node); |
| 708 |
/* we do NOT descend into the contained expression */ |
| 709 |
return false; |
| 710 |
} |
| 711 |
else if (context->flags & PVC_RECURSE_AGGREGATES) |
| 712 |
{ |
| 713 |
/* fall through to recurse into the GroupingFunc's arguments */ |
| 714 |
} |
| 715 |
else |
| 716 |
elog(ERROR, "GROUPING found where not expected"); |
| 717 |
} |
| 718 |
else if (IsA(node, WindowFunc)) |
| 719 |
{ |
| 720 |
/* WindowFuncs have no levelsup field to check ... */ |
| 721 |
if (context->flags & PVC_INCLUDE_WINDOWFUNCS) |
| 722 |
{ |
| 723 |
context->varlist = lappend(context->varlist, node); |
| 724 |
/* we do NOT descend into the contained expressions */ |
| 725 |
return false; |
| 726 |
} |
| 727 |
else if (context->flags & PVC_RECURSE_WINDOWFUNCS) |
| 728 |
{ |
| 729 |
/* fall through to recurse into the windowfunc's arguments */ |
| 730 |
} |
| 731 |
else |
| 732 |
elog(ERROR, "WindowFunc found where not expected"); |
| 733 |
} |
| 734 |
else if (IsA(node, PlaceHolderVar)) |
| 735 |
{ |
| 736 |
if (((PlaceHolderVar *) node)->phlevelsup != 0) |
| 737 |
elog(ERROR, "Upper-level PlaceHolderVar found where not expected"); |
| 738 |
if (context->flags & PVC_INCLUDE_PLACEHOLDERS) |
| 739 |
{ |
| 740 |
context->varlist = lappend(context->varlist, node); |
| 741 |
/* we do NOT descend into the contained expression */ |
| 742 |
return false; |
| 743 |
} |
| 744 |
else if (context->flags & PVC_RECURSE_PLACEHOLDERS) |
| 745 |
{ |
| 746 |
/* fall through to recurse into the placeholder's expression */ |
| 747 |
} |
| 748 |
else |
| 749 |
elog(ERROR, "PlaceHolderVar found where not expected"); |
| 750 |
} |
| 751 |
return expression_tree_walker(node, pull_var_clause_walker, context); |
| 752 |
} |
| 753 |
|
| 754 |
|
| 755 |
/* |
| 756 |
* flatten_join_alias_vars |
| 757 |
* Replace Vars that reference JOIN outputs with references to the original |
| 758 |
* relation variables instead. This allows quals involving such vars to be |
| 759 |
* pushed down. Whole-row Vars that reference JOIN relations are expanded |
| 760 |
* into RowExpr constructs that name the individual output Vars. This |
| 761 |
* is necessary since we will not scan the JOIN as a base relation, which |
| 762 |
* is the only way that the executor can directly handle whole-row Vars. |
| 763 |
* |
| 764 |
* This also adjusts relid sets found in some expression node types to |
| 765 |
* substitute the contained base+OJ rels for any join relid. |
| 766 |
* |
| 767 |
* If a JOIN contains sub-selects that have been flattened, its join alias |
| 768 |
* entries might now be arbitrary expressions, not just Vars. This affects |
| 769 |
* this function in two important ways. First, we might find ourselves |
| 770 |
* inserting SubLink expressions into subqueries, and we must make sure that |
| 771 |
* their Query.hasSubLinks fields get set to true if so. If there are any |
| 772 |
* SubLinks in the join alias lists, the outer Query should already have |
| 773 |
* hasSubLinks = true, so this is only relevant to un-flattened subqueries. |
| 774 |
* Second, we have to preserve any varnullingrels info attached to the |
| 775 |
* alias Vars we're replacing. If the replacement expression is a Var or |
| 776 |
* PlaceHolderVar or constructed from those, we can just add the |
| 777 |
* varnullingrels bits to the existing nullingrels field(s); otherwise |
| 778 |
* we have to add a PlaceHolderVar wrapper. |
| 779 |
* |
| 780 |
* NOTE: this is also used by the parser, to expand join alias Vars before |
| 781 |
* checking GROUP BY validity. For that use-case, root will be NULL, which |
| 782 |
* is why we have to pass the Query separately. We need the root itself only |
| 783 |
* for making PlaceHolderVars. We can avoid making PlaceHolderVars in the |
| 784 |
* parser's usage because it won't be dealing with arbitrary expressions: |
| 785 |
* so long as adjust_standard_join_alias_expression can handle everything |
| 786 |
* the parser would make as a join alias expression, we're OK. |
| 787 |
*/ |
| 788 |
Node * |
| 789 |
flatten_join_alias_vars(PlannerInfo *root, Query *query, Node *node) |
| 790 |
{ |
| 791 |
flatten_join_alias_vars_context context; |
| 792 |
|
| 793 |
/* |
| 794 |
* We do not expect this to be applied to the whole Query, only to |
| 795 |
* expressions or LATERAL subqueries. Hence, if the top node is a Query, |
| 796 |
* it's okay to immediately increment sublevels_up. |
| 797 |
*/ |
| 798 |
Assert(node != (Node *) query); |
| 799 |
|
| 800 |
context.root = root; |
| 801 |
context.query = query; |
| 802 |
context.sublevels_up = 0; |
| 803 |
/* flag whether join aliases could possibly contain SubLinks */ |
| 804 |
context.possible_sublink = query->hasSubLinks; |
| 805 |
/* if hasSubLinks is already true, no need to work hard */ |
| 806 |
context.inserted_sublink = query->hasSubLinks; |
| 807 |
|
| 808 |
return flatten_join_alias_vars_mutator(node, &context); |
| 809 |
} |
| 810 |
|
| 811 |
static Node * |
| 812 |
flatten_join_alias_vars_mutator(Node *node, |
| 813 |
flatten_join_alias_vars_context *context) |
| 814 |
{ |
| 815 |
if (node == NULL) |
| 816 |
return NULL; |
| 817 |
if (IsA(node, Var)) |
| 818 |
{ |
| 819 |
Var *var = (Var *) node; |
| 820 |
RangeTblEntry *rte; |
| 821 |
Node *newvar; |
| 822 |
|
| 823 |
/* No change unless Var belongs to a JOIN of the target level */ |
| 824 |
if (var->varlevelsup != context->sublevels_up) |
| 825 |
return node; /* no need to copy, really */ |
| 826 |
rte = rt_fetch(var->varno, context->query->rtable); |
| 827 |
if (rte->rtekind != RTE_JOIN) |
| 828 |
return node; |
| 829 |
if (var->varattno == InvalidAttrNumber) |
| 830 |
{ |
| 831 |
/* Must expand whole-row reference */ |
| 832 |
RowExpr *rowexpr; |
| 833 |
List *fields = NIL; |
| 834 |
List *colnames = NIL; |
| 835 |
ListCell *lv; |
| 836 |
ListCell *ln; |
| 837 |
|
| 838 |
Assert(list_length(rte->joinaliasvars) == list_length(rte->eref->colnames)); |
| 839 |
forboth(lv, rte->joinaliasvars, ln, rte->eref->colnames) |
| 840 |
{ |
| 841 |
newvar = (Node *) lfirst(lv); |
| 842 |
/* Ignore dropped columns */ |
| 843 |
if (newvar == NULL) |
| 844 |
continue; |
| 845 |
newvar = copyObject(newvar); |
| 846 |
|
| 847 |
/* |
| 848 |
* If we are expanding an alias carried down from an upper |
| 849 |
* query, must adjust its varlevelsup fields. |
| 850 |
*/ |
| 851 |
if (context->sublevels_up != 0) |
| 852 |
IncrementVarSublevelsUp(newvar, context->sublevels_up, 0); |
| 853 |
/* Preserve original Var's location, if possible */ |
| 854 |
if (IsA(newvar, Var)) |
| 855 |
((Var *) newvar)->location = var->location; |
| 856 |
/* Recurse in case join input is itself a join */ |
| 857 |
/* (also takes care of setting inserted_sublink if needed) */ |
| 858 |
newvar = flatten_join_alias_vars_mutator(newvar, context); |
| 859 |
fields = lappend(fields, newvar); |
| 860 |
/* We need the names of non-dropped columns, too */ |
| 861 |
colnames = lappend(colnames, copyObject((Node *) lfirst(ln))); |
| 862 |
} |
| 863 |
rowexpr = makeNode(RowExpr); |
| 864 |
rowexpr->args = fields; |
| 865 |
rowexpr->row_typeid = var->vartype; |
| 866 |
rowexpr->row_format = COERCE_IMPLICIT_CAST; |
| 867 |
/* vartype will always be RECORDOID, so we always need colnames */ |
| 868 |
rowexpr->colnames = colnames; |
| 869 |
rowexpr->location = var->location; |
| 870 |
|
| 871 |
/* Lastly, add any varnullingrels to the replacement expression */ |
| 872 |
return add_nullingrels_if_needed(context->root, (Node *) rowexpr, |
| 873 |
var); |
| 874 |
} |
| 875 |
|
| 876 |
/* Expand join alias reference */ |
| 877 |
Assert(var->varattno > 0); |
| 878 |
newvar = (Node *) list_nth(rte->joinaliasvars, var->varattno - 1); |
| 879 |
Assert(newvar != NULL); |
| 880 |
newvar = copyObject(newvar); |
| 881 |
|
| 882 |
/* |
| 883 |
* If we are expanding an alias carried down from an upper query, must |
| 884 |
* adjust its varlevelsup fields. |
| 885 |
*/ |
| 886 |
if (context->sublevels_up != 0) |
| 887 |
IncrementVarSublevelsUp(newvar, context->sublevels_up, 0); |
| 888 |
|
| 889 |
/* Preserve original Var's location, if possible */ |
| 890 |
if (IsA(newvar, Var)) |
| 891 |
((Var *) newvar)->location = var->location; |
| 892 |
|
| 893 |
/* Recurse in case join input is itself a join */ |
| 894 |
newvar = flatten_join_alias_vars_mutator(newvar, context); |
| 895 |
|
| 896 |
/* Detect if we are adding a sublink to query */ |
| 897 |
if (context->possible_sublink && !context->inserted_sublink) |
| 898 |
context->inserted_sublink = checkExprHasSubLink(newvar); |
| 899 |
|
| 900 |
/* Lastly, add any varnullingrels to the replacement expression */ |
| 901 |
return add_nullingrels_if_needed(context->root, newvar, var); |
| 902 |
} |
| 903 |
if (IsA(node, PlaceHolderVar)) |
| 904 |
{ |
| 905 |
/* Copy the PlaceHolderVar node with correct mutation of subnodes */ |
| 906 |
PlaceHolderVar *phv; |
| 907 |
|
| 908 |
phv = (PlaceHolderVar *) expression_tree_mutator(node, |
| 909 |
flatten_join_alias_vars_mutator, |
| 910 |
context); |
| 911 |
/* now fix PlaceHolderVar's relid sets */ |
| 912 |
if (phv->phlevelsup == context->sublevels_up) |
| 913 |
{ |
| 914 |
phv->phrels = alias_relid_set(context->query, |
| 915 |
phv->phrels); |
| 916 |
/* we *don't* change phnullingrels */ |
| 917 |
} |
| 918 |
return (Node *) phv; |
| 919 |
} |
| 920 |
|
| 921 |
if (IsA(node, Query)) |
| 922 |
{ |
| 923 |
/* Recurse into RTE subquery or not-yet-planned sublink subquery */ |
| 924 |
Query *newnode; |
| 925 |
bool save_inserted_sublink; |
| 926 |
|
| 927 |
context->sublevels_up++; |
| 928 |
save_inserted_sublink = context->inserted_sublink; |
| 929 |
context->inserted_sublink = ((Query *) node)->hasSubLinks; |
| 930 |
newnode = query_tree_mutator((Query *) node, |
| 931 |
flatten_join_alias_vars_mutator, |
| 932 |
context, |
| 933 |
QTW_IGNORE_JOINALIASES); |
| 934 |
newnode->hasSubLinks |= context->inserted_sublink; |
| 935 |
context->inserted_sublink = save_inserted_sublink; |
| 936 |
context->sublevels_up--; |
| 937 |
return (Node *) newnode; |
| 938 |
} |
| 939 |
/* Already-planned tree not supported */ |
| 940 |
Assert(!IsA(node, SubPlan)); |
| 941 |
Assert(!IsA(node, AlternativeSubPlan)); |
| 942 |
/* Shouldn't need to handle these planner auxiliary nodes here */ |
| 943 |
Assert(!IsA(node, SpecialJoinInfo)); |
| 944 |
Assert(!IsA(node, PlaceHolderInfo)); |
| 945 |
Assert(!IsA(node, MinMaxAggInfo)); |
| 946 |
|
| 947 |
return expression_tree_mutator(node, flatten_join_alias_vars_mutator, context); |
| 948 |
} |
| 949 |
|
| 950 |
/* |
| 951 |
* flatten_group_exprs |
| 952 |
* Replace Vars that reference GROUP outputs with the underlying grouping |
| 953 |
* expressions. |
| 954 |
* |
| 955 |
* We have to preserve any varnullingrels info attached to the group Vars we're |
| 956 |
* replacing. If the replacement expression is a Var or PlaceHolderVar or |
| 957 |
* constructed from those, we can just add the varnullingrels bits to the |
| 958 |
* existing nullingrels field(s); otherwise we have to add a PlaceHolderVar |
| 959 |
* wrapper. |
| 960 |
* |
| 961 |
* NOTE: this is also used by ruleutils.c, to deparse one query parsetree back |
| 962 |
* to source text, and by check_output_expressions() to check for unsafe |
| 963 |
* pushdowns. For these use-cases, root will be NULL, which is why we have to |
| 964 |
* pass the Query separately. We need the root itself only for preserving |
| 965 |
* varnullingrels. We can avoid preserving varnullingrels in the ruleutils.c's |
| 966 |
* usage because it does not make any difference to the deparsed source text. |
| 967 |
* We can also avoid it in check_output_expressions() because that function |
| 968 |
* uses the expanded expressions solely to check for volatile or set-returning |
| 969 |
* functions, which is independent of the Vars' nullingrels. |
| 970 |
*/ |
| 971 |
Node * |
| 972 |
flatten_group_exprs(PlannerInfo *root, Query *query, Node *node) |
| 973 |
{ |
| 974 |
flatten_join_alias_vars_context context; |
| 975 |
|
| 976 |
/* |
| 977 |
* We do not expect this to be applied to the whole Query, only to |
| 978 |
* expressions or LATERAL subqueries. Hence, if the top node is a Query, |
| 979 |
* it's okay to immediately increment sublevels_up. |
| 980 |
*/ |
| 981 |
Assert(node != (Node *) query); |
| 982 |
|
| 983 |
context.root = root; |
| 984 |
context.query = query; |
| 985 |
context.sublevels_up = 0; |
| 986 |
/* flag whether grouping expressions could possibly contain SubLinks */ |
| 987 |
context.possible_sublink = query->hasSubLinks; |
| 988 |
/* if hasSubLinks is already true, no need to work hard */ |
| 989 |
context.inserted_sublink = query->hasSubLinks; |
| 990 |
|
| 991 |
return flatten_group_exprs_mutator(node, &context); |
| 992 |
} |
| 993 |
|
| 994 |
static Node * |
| 995 |
flatten_group_exprs_mutator(Node *node, |
| 996 |
flatten_join_alias_vars_context *context) |
| 997 |
{ |
| 998 |
if (node == NULL) |
| 999 |
return NULL; |
| 1000 |
if (IsA(node, Var)) |
| 1001 |
{ |
| 1002 |
Var *var = (Var *) node; |
| 1003 |
RangeTblEntry *rte; |
| 1004 |
Node *newvar; |
| 1005 |
|
| 1006 |
/* No change unless Var belongs to the GROUP of the target level */ |
| 1007 |
if (var->varlevelsup != context->sublevels_up) |
| 1008 |
return node; /* no need to copy, really */ |
| 1009 |
rte = rt_fetch(var->varno, context->query->rtable); |
| 1010 |
if (rte->rtekind != RTE_GROUP) |
| 1011 |
return node; |
| 1012 |
|
| 1013 |
/* Expand group exprs reference */ |
| 1014 |
Assert(var->varattno > 0); |
| 1015 |
newvar = (Node *) list_nth(rte->groupexprs, var->varattno - 1); |
| 1016 |
Assert(newvar != NULL); |
| 1017 |
newvar = copyObject(newvar); |
| 1018 |
|
| 1019 |
/* |
| 1020 |
* If we are expanding an expr carried down from an upper query, must |
| 1021 |
* adjust its varlevelsup fields. |
| 1022 |
*/ |
| 1023 |
if (context->sublevels_up != 0) |
| 1024 |
IncrementVarSublevelsUp(newvar, context->sublevels_up, 0); |
| 1025 |
|
| 1026 |
/* Preserve original Var's location, if possible */ |
| 1027 |
if (IsA(newvar, Var)) |
| 1028 |
((Var *) newvar)->location = var->location; |
| 1029 |
|
| 1030 |
/* Detect if we are adding a sublink to query */ |
| 1031 |
if (context->possible_sublink && !context->inserted_sublink) |
| 1032 |
context->inserted_sublink = checkExprHasSubLink(newvar); |
| 1033 |
|
| 1034 |
/* Lastly, add any varnullingrels to the replacement expression */ |
| 1035 |
return mark_nullable_by_grouping(context->root, newvar, var); |
| 1036 |
} |
| 1037 |
|
| 1038 |
if (IsA(node, Aggref)) |
| 1039 |
{ |
| 1040 |
Aggref *agg = (Aggref *) node; |
| 1041 |
|
| 1042 |
if ((int) agg->agglevelsup == context->sublevels_up) |
| 1043 |
{ |
| 1044 |
/* |
| 1045 |
* If we find an aggregate call of the original level, do not |
| 1046 |
* recurse into its normal arguments, ORDER BY arguments, or |
| 1047 |
* filter; there are no grouped vars there. But we should check |
| 1048 |
* direct arguments as though they weren't in an aggregate. |
| 1049 |
*/ |
| 1050 |
agg = copyObject(agg); |
| 1051 |
agg->aggdirectargs = (List *) |
| 1052 |
flatten_group_exprs_mutator((Node *) agg->aggdirectargs, context); |
| 1053 |
|
| 1054 |
return (Node *) agg; |
| 1055 |
} |
| 1056 |
|
| 1057 |
/* |
| 1058 |
* We can skip recursing into aggregates of higher levels altogether, |
| 1059 |
* since they could not possibly contain Vars of concern to us (see |
| 1060 |
* transformAggregateCall). We do need to look at aggregates of lower |
| 1061 |
* levels, however. |
| 1062 |
*/ |
| 1063 |
if ((int) agg->agglevelsup > context->sublevels_up) |
| 1064 |
return node; |
| 1065 |
} |
| 1066 |
|
| 1067 |
if (IsA(node, GroupingFunc)) |
| 1068 |
{ |
| 1069 |
GroupingFunc *grp = (GroupingFunc *) node; |
| 1070 |
|
| 1071 |
/* |
| 1072 |
* If we find a GroupingFunc node of the original or higher level, do |
| 1073 |
* not recurse into its arguments; there are no grouped vars there. |
| 1074 |
*/ |
| 1075 |
if ((int) grp->agglevelsup >= context->sublevels_up) |
| 1076 |
return node; |
| 1077 |
} |
| 1078 |
|
| 1079 |
if (IsA(node, Query)) |
| 1080 |
{ |
| 1081 |
/* Recurse into RTE subquery or not-yet-planned sublink subquery */ |
| 1082 |
Query *newnode; |
| 1083 |
bool save_inserted_sublink; |
| 1084 |
|
| 1085 |
context->sublevels_up++; |
| 1086 |
save_inserted_sublink = context->inserted_sublink; |
| 1087 |
context->inserted_sublink = ((Query *) node)->hasSubLinks; |
| 1088 |
newnode = query_tree_mutator((Query *) node, |
| 1089 |
flatten_group_exprs_mutator, |
| 1090 |
context, |
| 1091 |
QTW_IGNORE_GROUPEXPRS); |
| 1092 |
newnode->hasSubLinks |= context->inserted_sublink; |
| 1093 |
context->inserted_sublink = save_inserted_sublink; |
| 1094 |
context->sublevels_up--; |
| 1095 |
return (Node *) newnode; |
| 1096 |
} |
| 1097 |
|
| 1098 |
return expression_tree_mutator(node, flatten_group_exprs_mutator, |
| 1099 |
context); |
| 1100 |
} |
| 1101 |
|
| 1102 |
/* |
| 1103 |
* Add oldvar's varnullingrels, if any, to a flattened grouping expression. |
| 1104 |
* The newnode has been copied, so we can modify it freely. |
| 1105 |
*/ |
| 1106 |
static Node * |
| 1107 |
mark_nullable_by_grouping(PlannerInfo *root, Node *newnode, Var *oldvar) |
| 1108 |
{ |
| 1109 |
Relids relids; |
| 1110 |
|
| 1111 |
if (root == NULL) |
| 1112 |
return newnode; |
| 1113 |
if (oldvar->varnullingrels == NULL) |
| 1114 |
return newnode; /* nothing to do */ |
| 1115 |
|
| 1116 |
Assert(bms_equal(oldvar->varnullingrels, |
| 1117 |
bms_make_singleton(root->group_rtindex))); |
| 1118 |
|
| 1119 |
relids = pull_varnos_of_level(root, newnode, oldvar->varlevelsup); |
| 1120 |
|
| 1121 |
if (!bms_is_empty(relids)) |
| 1122 |
{ |
| 1123 |
/* |
| 1124 |
* If the newnode is not variable-free, we set the nullingrels of Vars |
| 1125 |
* or PHVs that are contained in the expression. This is not really |
| 1126 |
* 'correct' in theory, because it is the whole expression that can be |
| 1127 |
* nullable by grouping sets, not its individual vars. But it works |
| 1128 |
* in practice, because what we need is that the expression can be |
| 1129 |
* somehow distinguished from the same expression in ECs, and marking |
| 1130 |
* its vars is sufficient for this purpose. |
| 1131 |
*/ |
| 1132 |
newnode = add_nulling_relids(newnode, |
| 1133 |
relids, |
| 1134 |
oldvar->varnullingrels); |
| 1135 |
} |
| 1136 |
else /* variable-free? */ |
| 1137 |
{ |
| 1138 |
/* |
| 1139 |
* If the newnode is variable-free and does not contain volatile |
| 1140 |
* functions or set-returning functions, it can be treated as a member |
| 1141 |
* of EC that is redundant. So wrap it in a new PlaceHolderVar to |
| 1142 |
* carry the nullingrels. Otherwise we do not bother to make any |
| 1143 |
* changes. |
| 1144 |
* |
| 1145 |
* Aggregate functions and window functions are not allowed in |
| 1146 |
* grouping expressions. |
| 1147 |
*/ |
| 1148 |
Assert(!contain_agg_clause(newnode)); |
| 1149 |
Assert(!contain_window_function(newnode)); |
| 1150 |
|
| 1151 |
if (!contain_volatile_functions(newnode) && |
| 1152 |
!expression_returns_set(newnode)) |
| 1153 |
{ |
| 1154 |
PlaceHolderVar *newphv; |
| 1155 |
Relids phrels; |
| 1156 |
|
| 1157 |
phrels = get_relids_in_jointree((Node *) root->parse->jointree, |
| 1158 |
true, false); |
| 1159 |
Assert(!bms_is_empty(phrels)); |
| 1160 |
|
| 1161 |
newphv = make_placeholder_expr(root, (Expr *) newnode, phrels); |
| 1162 |
/* newphv has zero phlevelsup and NULL phnullingrels; fix it */ |
| 1163 |
newphv->phlevelsup = oldvar->varlevelsup; |
| 1164 |
newphv->phnullingrels = bms_copy(oldvar->varnullingrels); |
| 1165 |
newnode = (Node *) newphv; |
| 1166 |
} |
| 1167 |
} |
| 1168 |
|
| 1169 |
return newnode; |
| 1170 |
} |
| 1171 |
|
| 1172 |
/* |
| 1173 |
* Add oldvar's varnullingrels, if any, to a flattened join alias expression. |
| 1174 |
* The newnode has been copied, so we can modify it freely. |
| 1175 |
*/ |
| 1176 |
static Node * |
| 1177 |
add_nullingrels_if_needed(PlannerInfo *root, Node *newnode, Var *oldvar) |
| 1178 |
{ |
| 1179 |
if (oldvar->varnullingrels == NULL) |
| 1180 |
return newnode; /* nothing to do */ |
| 1181 |
/* If possible, do it by adding to existing nullingrel fields */ |
| 1182 |
if (is_standard_join_alias_expression(newnode, oldvar)) |
| 1183 |
adjust_standard_join_alias_expression(newnode, oldvar); |
| 1184 |
else if (root) |
| 1185 |
{ |
| 1186 |
/* |
| 1187 |
* We can insert a PlaceHolderVar to carry the nullingrels. However, |
| 1188 |
* deciding where to evaluate the PHV is slightly tricky. We first |
| 1189 |
* try to evaluate it at the natural semantic level of the new |
| 1190 |
* expression; but if that expression is variable-free, fall back to |
| 1191 |
* evaluating it at the join that the oldvar is an alias Var for. |
| 1192 |
*/ |
| 1193 |
PlaceHolderVar *newphv; |
| 1194 |
Index levelsup = oldvar->varlevelsup; |
| 1195 |
Relids phrels = pull_varnos_of_level(root, newnode, levelsup); |
| 1196 |
|
| 1197 |
if (bms_is_empty(phrels)) /* variable-free? */ |
| 1198 |
{ |
| 1199 |
if (levelsup != 0) /* this won't work otherwise */ |
| 1200 |
elog(ERROR, "unsupported join alias expression"); |
| 1201 |
phrels = get_relids_for_join(root->parse, oldvar->varno); |
| 1202 |
/* If it's an outer join, eval below not above the join */ |
| 1203 |
phrels = bms_del_member(phrels, oldvar->varno); |
| 1204 |
Assert(!bms_is_empty(phrels)); |
| 1205 |
} |
| 1206 |
newphv = make_placeholder_expr(root, (Expr *) newnode, phrels); |
| 1207 |
/* newphv has zero phlevelsup and NULL phnullingrels; fix it */ |
| 1208 |
newphv->phlevelsup = levelsup; |
| 1209 |
newphv->phnullingrels = bms_copy(oldvar->varnullingrels); |
| 1210 |
newnode = (Node *) newphv; |
| 1211 |
} |
| 1212 |
else |
| 1213 |
{ |
| 1214 |
/* ooops, we're missing support for something the parser can make */ |
| 1215 |
elog(ERROR, "unsupported join alias expression"); |
| 1216 |
} |
| 1217 |
return newnode; |
| 1218 |
} |
| 1219 |
|
| 1220 |
/* |
| 1221 |
* Check to see if we can insert nullingrels into this join alias expression |
| 1222 |
* without use of a separate PlaceHolderVar. |
| 1223 |
* |
| 1224 |
* This will handle Vars, PlaceHolderVars, and implicit-coercion and COALESCE |
| 1225 |
* expressions built from those. This coverage needs to handle anything |
| 1226 |
* that the parser would put into joinaliasvars. |
| 1227 |
*/ |
| 1228 |
static bool |
| 1229 |
is_standard_join_alias_expression(Node *newnode, Var *oldvar) |
| 1230 |
{ |
| 1231 |
if (newnode == NULL) |
| 1232 |
return false; |
| 1233 |
if (IsA(newnode, Var) && |
| 1234 |
((Var *) newnode)->varlevelsup == oldvar->varlevelsup) |
| 1235 |
return true; |
| 1236 |
else if (IsA(newnode, PlaceHolderVar) && |
| 1237 |
((PlaceHolderVar *) newnode)->phlevelsup == oldvar->varlevelsup) |
| 1238 |
return true; |
| 1239 |
else if (IsA(newnode, FuncExpr)) |
| 1240 |
{ |
| 1241 |
FuncExpr *fexpr = (FuncExpr *) newnode; |
| 1242 |
|
| 1243 |
/* |
| 1244 |
* We need to assume that the function wouldn't produce non-NULL from |
| 1245 |
* NULL, which is reasonable for implicit coercions but otherwise not |
| 1246 |
* so much. (Looking at its strictness is likely overkill, and anyway |
| 1247 |
* it would cause us to fail if someone forgot to mark an implicit |
| 1248 |
* coercion as strict.) |
| 1249 |
*/ |
| 1250 |
if (fexpr->funcformat != COERCE_IMPLICIT_CAST || |
| 1251 |
fexpr->args == NIL) |
| 1252 |
return false; |
| 1253 |
|
| 1254 |
/* |
| 1255 |
* Examine only the first argument --- coercions might have additional |
| 1256 |
* arguments that are constants. |
| 1257 |
*/ |
| 1258 |
return is_standard_join_alias_expression(linitial(fexpr->args), oldvar); |
| 1259 |
} |
| 1260 |
else if (IsA(newnode, RelabelType)) |
| 1261 |
{ |
| 1262 |
RelabelType *relabel = (RelabelType *) newnode; |
| 1263 |
|
| 1264 |
/* This definitely won't produce non-NULL from NULL */ |
| 1265 |
return is_standard_join_alias_expression((Node *) relabel->arg, oldvar); |
| 1266 |
} |
| 1267 |
else if (IsA(newnode, CoerceViaIO)) |
| 1268 |
{ |
| 1269 |
CoerceViaIO *iocoerce = (CoerceViaIO *) newnode; |
| 1270 |
|
| 1271 |
/* This definitely won't produce non-NULL from NULL */ |
| 1272 |
return is_standard_join_alias_expression((Node *) iocoerce->arg, oldvar); |
| 1273 |
} |
| 1274 |
else if (IsA(newnode, ArrayCoerceExpr)) |
| 1275 |
{ |
| 1276 |
ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) newnode; |
| 1277 |
|
| 1278 |
/* This definitely won't produce non-NULL from NULL (at array level) */ |
| 1279 |
return is_standard_join_alias_expression((Node *) acoerce->arg, oldvar); |
| 1280 |
} |
| 1281 |
else if (IsA(newnode, CoalesceExpr)) |
| 1282 |
{ |
| 1283 |
CoalesceExpr *cexpr = (CoalesceExpr *) newnode; |
| 1284 |
ListCell *lc; |
| 1285 |
|
| 1286 |
Assert(cexpr->args != NIL); |
| 1287 |
foreach(lc, cexpr->args) |
| 1288 |
{ |
| 1289 |
if (!is_standard_join_alias_expression(lfirst(lc), oldvar)) |
| 1290 |
return false; |
| 1291 |
} |
| 1292 |
return true; |
| 1293 |
} |
| 1294 |
else |
| 1295 |
return false; |
| 1296 |
} |
| 1297 |
|
| 1298 |
/* |
| 1299 |
* Insert nullingrels into an expression accepted by |
| 1300 |
* is_standard_join_alias_expression. |
| 1301 |
*/ |
| 1302 |
static void |
| 1303 |
adjust_standard_join_alias_expression(Node *newnode, Var *oldvar) |
| 1304 |
{ |
| 1305 |
if (IsA(newnode, Var) && |
| 1306 |
((Var *) newnode)->varlevelsup == oldvar->varlevelsup) |
| 1307 |
{ |
| 1308 |
Var *newvar = (Var *) newnode; |
| 1309 |
|
| 1310 |
newvar->varnullingrels = bms_add_members(newvar->varnullingrels, |
| 1311 |
oldvar->varnullingrels); |
| 1312 |
} |
| 1313 |
else if (IsA(newnode, PlaceHolderVar) && |
| 1314 |
((PlaceHolderVar *) newnode)->phlevelsup == oldvar->varlevelsup) |
| 1315 |
{ |
| 1316 |
PlaceHolderVar *newphv = (PlaceHolderVar *) newnode; |
| 1317 |
|
| 1318 |
newphv->phnullingrels = bms_add_members(newphv->phnullingrels, |
| 1319 |
oldvar->varnullingrels); |
| 1320 |
} |
| 1321 |
else if (IsA(newnode, FuncExpr)) |
| 1322 |
{ |
| 1323 |
FuncExpr *fexpr = (FuncExpr *) newnode; |
| 1324 |
|
| 1325 |
adjust_standard_join_alias_expression(linitial(fexpr->args), oldvar); |
| 1326 |
} |
| 1327 |
else if (IsA(newnode, RelabelType)) |
| 1328 |
{ |
| 1329 |
RelabelType *relabel = (RelabelType *) newnode; |
| 1330 |
|
| 1331 |
adjust_standard_join_alias_expression((Node *) relabel->arg, oldvar); |
| 1332 |
} |
| 1333 |
else if (IsA(newnode, CoerceViaIO)) |
| 1334 |
{ |
| 1335 |
CoerceViaIO *iocoerce = (CoerceViaIO *) newnode; |
| 1336 |
|
| 1337 |
adjust_standard_join_alias_expression((Node *) iocoerce->arg, oldvar); |
| 1338 |
} |
| 1339 |
else if (IsA(newnode, ArrayCoerceExpr)) |
| 1340 |
{ |
| 1341 |
ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) newnode; |
| 1342 |
|
| 1343 |
adjust_standard_join_alias_expression((Node *) acoerce->arg, oldvar); |
| 1344 |
} |
| 1345 |
else if (IsA(newnode, CoalesceExpr)) |
| 1346 |
{ |
| 1347 |
CoalesceExpr *cexpr = (CoalesceExpr *) newnode; |
| 1348 |
ListCell *lc; |
| 1349 |
|
| 1350 |
Assert(cexpr->args != NIL); |
| 1351 |
foreach(lc, cexpr->args) |
| 1352 |
{ |
| 1353 |
adjust_standard_join_alias_expression(lfirst(lc), oldvar); |
| 1354 |
} |
| 1355 |
} |
| 1356 |
else |
| 1357 |
Assert(false); |
| 1358 |
} |
| 1359 |
|
| 1360 |
/* |
| 1361 |
* alias_relid_set: in a set of RT indexes, replace joins by their |
| 1362 |
* underlying base+OJ relids |
| 1363 |
*/ |
| 1364 |
static Relids |
| 1365 |
alias_relid_set(Query *query, Relids relids) |
| 1366 |
{ |
| 1367 |
Relids result = NULL; |
| 1368 |
int rtindex; |
| 1369 |
|
| 1370 |
rtindex = -1; |
| 1371 |
while ((rtindex = bms_next_member(relids, rtindex)) >= 0) |
| 1372 |
{ |
| 1373 |
RangeTblEntry *rte = rt_fetch(rtindex, query->rtable); |
| 1374 |
|
| 1375 |
if (rte->rtekind == RTE_JOIN) |
| 1376 |
result = bms_join(result, get_relids_for_join(query, rtindex)); |
| 1377 |
else |
| 1378 |
result = bms_add_member(result, rtindex); |
| 1379 |
} |
| 1380 |
return result; |
| 1381 |
} |