PostgreSQL Source Code  git master
subselect.c File Reference
Include dependency graph for subselect.c:

Go to the source code of this file.

Data Structures

struct  convert_testexpr_context
 
struct  process_sublinks_context
 
struct  finalize_primnode_context
 
struct  inline_cte_walker_context
 

Typedefs

typedef struct convert_testexpr_context convert_testexpr_context
 
typedef struct process_sublinks_context process_sublinks_context
 
typedef struct finalize_primnode_context finalize_primnode_context
 
typedef struct inline_cte_walker_context inline_cte_walker_context
 

Functions

static Nodebuild_subplan (PlannerInfo *root, Plan *plan, PlannerInfo *subroot, List *plan_params, SubLinkType subLinkType, int subLinkId, Node *testexpr, List *testexpr_paramids, bool unknownEqFalse)
 
static Listgenerate_subquery_params (PlannerInfo *root, List *tlist, List **paramIds)
 
static Listgenerate_subquery_vars (PlannerInfo *root, List *tlist, Index varno)
 
static Nodeconvert_testexpr (PlannerInfo *root, Node *testexpr, List *subst_nodes)
 
static Nodeconvert_testexpr_mutator (Node *node, convert_testexpr_context *context)
 
static bool subplan_is_hashable (Plan *plan)
 
static bool subpath_is_hashable (Path *path)
 
static bool testexpr_is_hashable (Node *testexpr, List *param_ids)
 
static bool test_opexpr_is_hashable (OpExpr *testexpr, List *param_ids)
 
static bool hash_ok_operator (OpExpr *expr)
 
static bool contain_dml (Node *node)
 
static bool contain_dml_walker (Node *node, void *context)
 
static bool contain_outer_selfref (Node *node)
 
static bool contain_outer_selfref_walker (Node *node, Index *depth)
 
static void inline_cte (PlannerInfo *root, CommonTableExpr *cte)
 
static bool inline_cte_walker (Node *node, inline_cte_walker_context *context)
 
static bool simplify_EXISTS_query (PlannerInfo *root, Query *query)
 
static Queryconvert_EXISTS_to_ANY (PlannerInfo *root, Query *subselect, Node **testexpr, List **paramIds)
 
static Nodereplace_correlation_vars_mutator (Node *node, PlannerInfo *root)
 
static Nodeprocess_sublinks_mutator (Node *node, process_sublinks_context *context)
 
static Bitmapsetfinalize_plan (PlannerInfo *root, Plan *plan, int gather_param, Bitmapset *valid_params, Bitmapset *scan_params)
 
static bool finalize_primnode (Node *node, finalize_primnode_context *context)
 
static bool finalize_agg_primnode (Node *node, finalize_primnode_context *context)
 
static void get_first_col_type (Plan *plan, Oid *coltype, int32 *coltypmod, Oid *colcollation)
 
static Nodemake_subplan (PlannerInfo *root, Query *orig_subquery, SubLinkType subLinkType, int subLinkId, Node *testexpr, bool isTopQual)
 
void SS_process_ctes (PlannerInfo *root)
 
JoinExprconvert_ANY_sublink_to_join (PlannerInfo *root, SubLink *sublink, Relids available_rels)
 
JoinExprconvert_EXISTS_sublink_to_join (PlannerInfo *root, SubLink *sublink, bool under_not, Relids available_rels)
 
NodeSS_replace_correlation_vars (PlannerInfo *root, Node *expr)
 
NodeSS_process_sublinks (PlannerInfo *root, Node *expr, bool isQual)
 
void SS_identify_outer_params (PlannerInfo *root)
 
void SS_charge_for_initplans (PlannerInfo *root, RelOptInfo *final_rel)
 
void SS_compute_initplan_cost (List *init_plans, Cost *initplan_cost_p, bool *unsafe_initplans_p)
 
void SS_attach_initplans (PlannerInfo *root, Plan *plan)
 
void SS_finalize_plan (PlannerInfo *root, Plan *plan)
 
ParamSS_make_initplan_output_param (PlannerInfo *root, Oid resulttype, int32 resulttypmod, Oid resultcollation)
 
void SS_make_initplan_from_plan (PlannerInfo *root, PlannerInfo *subroot, Plan *plan, Param *prm)
 

Typedef Documentation

◆ convert_testexpr_context

◆ finalize_primnode_context

◆ inline_cte_walker_context

◆ process_sublinks_context

Function Documentation

◆ build_subplan()

static Node * build_subplan ( PlannerInfo root,
Plan plan,
PlannerInfo subroot,
List plan_params,
SubLinkType  subLinkType,
int  subLinkId,
Node testexpr,
List testexpr_paramids,
bool  unknownEqFalse 
)
static

Definition at line 320 of file subselect.c.

325 {
326  Node *result;
327  SubPlan *splan;
328  bool isInitPlan;
329  ListCell *lc;
330 
331  /*
332  * Initialize the SubPlan node. Note plan_id, plan_name, and cost fields
333  * are set further down.
334  */
336  splan->subLinkType = subLinkType;
337  splan->testexpr = NULL;
338  splan->paramIds = NIL;
339  get_first_col_type(plan, &splan->firstColType, &splan->firstColTypmod,
340  &splan->firstColCollation);
341  splan->useHashTable = false;
342  splan->unknownEqFalse = unknownEqFalse;
343  splan->parallel_safe = plan->parallel_safe;
344  splan->setParam = NIL;
345  splan->parParam = NIL;
346  splan->args = NIL;
347 
348  /*
349  * Make parParam and args lists of param IDs and expressions that current
350  * query level will pass to this child plan.
351  */
352  foreach(lc, plan_params)
353  {
354  PlannerParamItem *pitem = (PlannerParamItem *) lfirst(lc);
355  Node *arg = pitem->item;
356 
357  /*
358  * The Var, PlaceHolderVar, Aggref or GroupingFunc has already been
359  * adjusted to have the correct varlevelsup, phlevelsup, or
360  * agglevelsup.
361  *
362  * If it's a PlaceHolderVar, Aggref or GroupingFunc, its arguments
363  * might contain SubLinks, which have not yet been processed (see the
364  * comments for SS_replace_correlation_vars). Do that now.
365  */
366  if (IsA(arg, PlaceHolderVar) ||
367  IsA(arg, Aggref) ||
368  IsA(arg, GroupingFunc))
369  arg = SS_process_sublinks(root, arg, false);
370 
371  splan->parParam = lappend_int(splan->parParam, pitem->paramId);
372  splan->args = lappend(splan->args, arg);
373  }
374 
375  /*
376  * Un-correlated or undirect correlated plans of EXISTS, EXPR, ARRAY,
377  * ROWCOMPARE, or MULTIEXPR types can be used as initPlans. For EXISTS,
378  * EXPR, or ARRAY, we return a Param referring to the result of evaluating
379  * the initPlan. For ROWCOMPARE, we must modify the testexpr tree to
380  * contain PARAM_EXEC Params instead of the PARAM_SUBLINK Params emitted
381  * by the parser, and then return that tree. For MULTIEXPR, we return a
382  * null constant: the resjunk targetlist item containing the SubLink does
383  * not need to return anything useful, since the referencing Params are
384  * elsewhere.
385  */
386  if (splan->parParam == NIL && subLinkType == EXISTS_SUBLINK)
387  {
388  Param *prm;
389 
390  Assert(testexpr == NULL);
391  prm = generate_new_exec_param(root, BOOLOID, -1, InvalidOid);
392  splan->setParam = list_make1_int(prm->paramid);
393  isInitPlan = true;
394  result = (Node *) prm;
395  }
396  else if (splan->parParam == NIL && subLinkType == EXPR_SUBLINK)
397  {
398  TargetEntry *te = linitial(plan->targetlist);
399  Param *prm;
400 
401  Assert(!te->resjunk);
402  Assert(testexpr == NULL);
403  prm = generate_new_exec_param(root,
404  exprType((Node *) te->expr),
405  exprTypmod((Node *) te->expr),
406  exprCollation((Node *) te->expr));
407  splan->setParam = list_make1_int(prm->paramid);
408  isInitPlan = true;
409  result = (Node *) prm;
410  }
411  else if (splan->parParam == NIL && subLinkType == ARRAY_SUBLINK)
412  {
413  TargetEntry *te = linitial(plan->targetlist);
414  Oid arraytype;
415  Param *prm;
416 
417  Assert(!te->resjunk);
418  Assert(testexpr == NULL);
419  arraytype = get_promoted_array_type(exprType((Node *) te->expr));
420  if (!OidIsValid(arraytype))
421  elog(ERROR, "could not find array type for datatype %s",
422  format_type_be(exprType((Node *) te->expr)));
423  prm = generate_new_exec_param(root,
424  arraytype,
425  exprTypmod((Node *) te->expr),
426  exprCollation((Node *) te->expr));
427  splan->setParam = list_make1_int(prm->paramid);
428  isInitPlan = true;
429  result = (Node *) prm;
430  }
431  else if (splan->parParam == NIL && subLinkType == ROWCOMPARE_SUBLINK)
432  {
433  /* Adjust the Params */
434  List *params;
435 
436  Assert(testexpr != NULL);
437  params = generate_subquery_params(root,
438  plan->targetlist,
439  &splan->paramIds);
440  result = convert_testexpr(root,
441  testexpr,
442  params);
443  splan->setParam = list_copy(splan->paramIds);
444  isInitPlan = true;
445 
446  /*
447  * The executable expression is returned to become part of the outer
448  * plan's expression tree; it is not kept in the initplan node.
449  */
450  }
451  else if (subLinkType == MULTIEXPR_SUBLINK)
452  {
453  /*
454  * Whether it's an initplan or not, it needs to set a PARAM_EXEC Param
455  * for each output column.
456  */
457  List *params;
458 
459  Assert(testexpr == NULL);
460  params = generate_subquery_params(root,
461  plan->targetlist,
462  &splan->setParam);
463 
464  /*
465  * Save the list of replacement Params in the n'th cell of
466  * root->multiexpr_params; setrefs.c will use it to replace
467  * PARAM_MULTIEXPR Params.
468  */
469  while (list_length(root->multiexpr_params) < subLinkId)
471  lc = list_nth_cell(root->multiexpr_params, subLinkId - 1);
472  Assert(lfirst(lc) == NIL);
473  lfirst(lc) = params;
474 
475  /* It can be an initplan if there are no parParams. */
476  if (splan->parParam == NIL)
477  {
478  isInitPlan = true;
479  result = (Node *) makeNullConst(RECORDOID, -1, InvalidOid);
480  }
481  else
482  {
483  isInitPlan = false;
484  result = (Node *) splan;
485  }
486  }
487  else
488  {
489  /*
490  * Adjust the Params in the testexpr, unless caller already took care
491  * of it (as indicated by passing a list of Param IDs).
492  */
493  if (testexpr && testexpr_paramids == NIL)
494  {
495  List *params;
496 
497  params = generate_subquery_params(root,
498  plan->targetlist,
499  &splan->paramIds);
500  splan->testexpr = convert_testexpr(root,
501  testexpr,
502  params);
503  }
504  else
505  {
506  splan->testexpr = testexpr;
507  splan->paramIds = testexpr_paramids;
508  }
509 
510  /*
511  * We can't convert subplans of ALL_SUBLINK or ANY_SUBLINK types to
512  * initPlans, even when they are uncorrelated or undirect correlated,
513  * because we need to scan the output of the subplan for each outer
514  * tuple. But if it's a not-direct-correlated IN (= ANY) test, we
515  * might be able to use a hashtable to avoid comparing all the tuples.
516  */
517  if (subLinkType == ANY_SUBLINK &&
518  splan->parParam == NIL &&
520  testexpr_is_hashable(splan->testexpr, splan->paramIds))
521  splan->useHashTable = true;
522 
523  /*
524  * Otherwise, we have the option to tack a Material node onto the top
525  * of the subplan, to reduce the cost of reading it repeatedly. This
526  * is pointless for a direct-correlated subplan, since we'd have to
527  * recompute its results each time anyway. For uncorrelated/undirect
528  * correlated subplans, we add Material unless the subplan's top plan
529  * node would materialize its output anyway. Also, if enable_material
530  * is false, then the user does not want us to materialize anything
531  * unnecessarily, so we don't.
532  */
533  else if (splan->parParam == NIL && enable_material &&
536 
537  result = (Node *) splan;
538  isInitPlan = false;
539  }
540 
541  /*
542  * Add the subplan and its PlannerInfo to the global lists.
543  */
544  root->glob->subplans = lappend(root->glob->subplans, plan);
545  root->glob->subroots = lappend(root->glob->subroots, subroot);
546  splan->plan_id = list_length(root->glob->subplans);
547 
548  if (isInitPlan)
549  root->init_plans = lappend(root->init_plans, splan);
550 
551  /*
552  * A parameterless subplan (not initplan) should be prepared to handle
553  * REWIND efficiently. If it has direct parameters then there's no point
554  * since it'll be reset on each scan anyway; and if it's an initplan then
555  * there's no point since it won't get re-run without parameter changes
556  * anyway. The input of a hashed subplan doesn't need REWIND either.
557  */
558  if (splan->parParam == NIL && !isInitPlan && !splan->useHashTable)
560  splan->plan_id);
561 
562  /* Label the subplan for EXPLAIN purposes */
563  splan->plan_name = palloc(32 + 12 * list_length(splan->setParam));
564  sprintf(splan->plan_name, "%s %d",
565  isInitPlan ? "InitPlan" : "SubPlan",
566  splan->plan_id);
567  if (splan->setParam)
568  {
569  char *ptr = splan->plan_name + strlen(splan->plan_name);
570 
571  ptr += sprintf(ptr, " (returns ");
572  foreach(lc, splan->setParam)
573  {
574  ptr += sprintf(ptr, "$%d%s",
575  lfirst_int(lc),
576  lnext(splan->setParam, lc) ? "," : ")");
577  }
578  }
579 
580  /* Lastly, fill in the cost estimates for use later */
581  cost_subplan(root, splan, plan);
582 
583  return result;
584 }
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:753
#define OidIsValid(objectId)
Definition: c.h:764
bool enable_material
Definition: costsize.c:144
void cost_subplan(PlannerInfo *root, SubPlan *subplan, Plan *plan)
Definition: costsize.c:4407
Plan * materialize_finished_plan(Plan *subplan)
Definition: createplan.c:6499
#define ERROR
Definition: elog.h:39
bool ExecMaterializesOutput(NodeTag plantype)
Definition: execAmi.c:637
char * format_type_be(Oid type_oid)
Definition: format_type.c:343
Assert(fmt[strlen(fmt) - 1] !='\n')
List * lappend(List *list, void *datum)
Definition: list.c:338
List * lappend_int(List *list, int datum)
Definition: list.c:356
List * list_copy(const List *oldlist)
Definition: list.c:1572
Oid get_promoted_array_type(Oid typid)
Definition: lsyscache.c:2793
Const * makeNullConst(Oid consttype, int32 consttypmod, Oid constcollid)
Definition: makefuncs.c:340
void * palloc(Size size)
Definition: mcxt.c:1226
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:43
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:282
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:786
#define IsA(nodeptr, _type_)
Definition: nodes.h:179
#define nodeTag(nodeptr)
Definition: nodes.h:133
#define makeNode(_type_)
Definition: nodes.h:176
Param * generate_new_exec_param(PlannerInfo *root, Oid paramtype, int32 paramtypmod, Oid paramcollation)
Definition: paramassign.c:585
void * arg
#define lfirst(lc)
Definition: pg_list.h:172
static int list_length(const List *l)
Definition: pg_list.h:152
#define NIL
Definition: pg_list.h:68
#define lfirst_int(lc)
Definition: pg_list.h:173
static ListCell * list_nth_cell(const List *list, int n)
Definition: pg_list.h:277
#define linitial(l)
Definition: pg_list.h:178
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:343
#define list_make1_int(x1)
Definition: pg_list.h:227
#define plan(x)
Definition: pg_regress.c:154
#define sprintf
Definition: port.h:240
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
@ ARRAY_SUBLINK
Definition: primnodes.h:930
@ ANY_SUBLINK
Definition: primnodes.h:926
@ MULTIEXPR_SUBLINK
Definition: primnodes.h:929
@ EXPR_SUBLINK
Definition: primnodes.h:928
@ ROWCOMPARE_SUBLINK
Definition: primnodes.h:927
@ EXISTS_SUBLINK
Definition: primnodes.h:924
static SPIPlanPtr splan
Definition: regress.c:270
Definition: pg_list.h:54
Definition: nodes.h:129
int paramid
Definition: primnodes.h:355
List * subplans
Definition: pathnodes.h:105
Bitmapset * rewindPlanIDs
Definition: pathnodes.h:111
List * init_plans
Definition: pathnodes.h:296
List * multiexpr_params
Definition: pathnodes.h:305
PlannerGlobal * glob
Definition: pathnodes.h:202
Expr * expr
Definition: primnodes.h:1895
static bool testexpr_is_hashable(Node *testexpr, List *param_ids)
Definition: subselect.c:774
static List * generate_subquery_params(PlannerInfo *root, List *tlist, List **paramIds)
Definition: subselect.c:593
static Node * convert_testexpr(PlannerInfo *root, Node *testexpr, List *subst_nodes)
Definition: subselect.c:655
static bool subplan_is_hashable(Plan *plan)
Definition: subselect.c:725
static void get_first_col_type(Plan *plan, Oid *coltype, int32 *coltypmod, Oid *colcollation)
Definition: subselect.c:118
Node * SS_process_sublinks(PlannerInfo *root, Node *expr, bool isQual)
Definition: subselect.c:1916

References ANY_SUBLINK, arg, ARRAY_SUBLINK, Assert(), bms_add_member(), convert_testexpr(), cost_subplan(), elog(), enable_material, ERROR, ExecMaterializesOutput(), EXISTS_SUBLINK, TargetEntry::expr, EXPR_SUBLINK, exprCollation(), exprType(), exprTypmod(), format_type_be(), generate_new_exec_param(), generate_subquery_params(), get_first_col_type(), get_promoted_array_type(), PlannerInfo::glob, PlannerInfo::init_plans, InvalidOid, IsA, PlannerParamItem::item, lappend(), lappend_int(), lfirst, lfirst_int, linitial, list_copy(), list_length(), list_make1_int, list_nth_cell(), lnext(), makeNode, makeNullConst(), materialize_finished_plan(), PlannerInfo::multiexpr_params, MULTIEXPR_SUBLINK, NIL, nodeTag, OidIsValid, palloc(), PlannerParamItem::paramId, Param::paramid, plan, PlannerGlobal::rewindPlanIDs, ROWCOMPARE_SUBLINK, splan, sprintf, SS_process_sublinks(), subplan_is_hashable(), PlannerGlobal::subplans, and testexpr_is_hashable().

Referenced by make_subplan().

◆ contain_dml()

static bool contain_dml ( Node node)
static

Definition at line 1069 of file subselect.c.

1070 {
1071  return contain_dml_walker(node, NULL);
1072 }
static bool contain_dml_walker(Node *node, void *context)
Definition: subselect.c:1075

References contain_dml_walker().

Referenced by SS_process_ctes().

◆ contain_dml_walker()

static bool contain_dml_walker ( Node node,
void *  context 
)
static

Definition at line 1075 of file subselect.c.

1076 {
1077  if (node == NULL)
1078  return false;
1079  if (IsA(node, Query))
1080  {
1081  Query *query = (Query *) node;
1082 
1083  if (query->commandType != CMD_SELECT ||
1084  query->rowMarks != NIL)
1085  return true;
1086 
1087  return query_tree_walker(query, contain_dml_walker, context, 0);
1088  }
1089  return expression_tree_walker(node, contain_dml_walker, context);
1090 }
#define query_tree_walker(q, w, c, f)
Definition: nodeFuncs.h:156
#define expression_tree_walker(n, w, c)
Definition: nodeFuncs.h:151
@ CMD_SELECT
Definition: nodes.h:276
List * rowMarks
Definition: parsenodes.h:214
CmdType commandType
Definition: parsenodes.h:127

References CMD_SELECT, Query::commandType, expression_tree_walker, IsA, NIL, query_tree_walker, and Query::rowMarks.

Referenced by contain_dml().

◆ contain_outer_selfref()

static bool contain_outer_selfref ( Node node)
static

Definition at line 1096 of file subselect.c.

1097 {
1098  Index depth = 0;
1099 
1100  /*
1101  * We should be starting with a Query, so that depth will be 1 while
1102  * examining its immediate contents.
1103  */
1104  Assert(IsA(node, Query));
1105 
1106  return contain_outer_selfref_walker(node, &depth);
1107 }
unsigned int Index
Definition: c.h:603
static bool contain_outer_selfref_walker(Node *node, Index *depth)
Definition: subselect.c:1110

References Assert(), contain_outer_selfref_walker(), and IsA.

Referenced by SS_process_ctes().

◆ contain_outer_selfref_walker()

static bool contain_outer_selfref_walker ( Node node,
Index depth 
)
static

Definition at line 1110 of file subselect.c.

1111 {
1112  if (node == NULL)
1113  return false;
1114  if (IsA(node, RangeTblEntry))
1115  {
1116  RangeTblEntry *rte = (RangeTblEntry *) node;
1117 
1118  /*
1119  * Check for a self-reference to a CTE that's above the Query that our
1120  * search started at.
1121  */
1122  if (rte->rtekind == RTE_CTE &&
1123  rte->self_reference &&
1124  rte->ctelevelsup >= *depth)
1125  return true;
1126  return false; /* allow range_table_walker to continue */
1127  }
1128  if (IsA(node, Query))
1129  {
1130  /* Recurse into subquery, tracking nesting depth properly */
1131  Query *query = (Query *) node;
1132  bool result;
1133 
1134  (*depth)++;
1135 
1137  (void *) depth, QTW_EXAMINE_RTES_BEFORE);
1138 
1139  (*depth)--;
1140 
1141  return result;
1142  }
1144  (void *) depth);
1145 }
#define QTW_EXAMINE_RTES_BEFORE
Definition: nodeFuncs.h:27
@ RTE_CTE
Definition: parsenodes.h:1019
bool self_reference
Definition: parsenodes.h:1165
Index ctelevelsup
Definition: parsenodes.h:1164
RTEKind rtekind
Definition: parsenodes.h:1032

References RangeTblEntry::ctelevelsup, expression_tree_walker, IsA, QTW_EXAMINE_RTES_BEFORE, query_tree_walker, RTE_CTE, RangeTblEntry::rtekind, and RangeTblEntry::self_reference.

Referenced by contain_outer_selfref().

◆ convert_ANY_sublink_to_join()

JoinExpr* convert_ANY_sublink_to_join ( PlannerInfo root,
SubLink sublink,
Relids  available_rels 
)

Definition at line 1267 of file subselect.c.

1269 {
1270  JoinExpr *result;
1271  Query *parse = root->parse;
1272  Query *subselect = (Query *) sublink->subselect;
1273  Relids upper_varnos;
1274  int rtindex;
1275  ParseNamespaceItem *nsitem;
1276  RangeTblEntry *rte;
1277  RangeTblRef *rtr;
1278  List *subquery_vars;
1279  Node *quals;
1280  ParseState *pstate;
1281 
1282  Assert(sublink->subLinkType == ANY_SUBLINK);
1283 
1284  /*
1285  * The sub-select must not refer to any Vars of the parent query. (Vars of
1286  * higher levels should be okay, though.)
1287  */
1288  if (contain_vars_of_level((Node *) subselect, 1))
1289  return NULL;
1290 
1291  /*
1292  * The test expression must contain some Vars of the parent query, else
1293  * it's not gonna be a join. (Note that it won't have Vars referring to
1294  * the subquery, rather Params.)
1295  */
1296  upper_varnos = pull_varnos(root, sublink->testexpr);
1297  if (bms_is_empty(upper_varnos))
1298  return NULL;
1299 
1300  /*
1301  * However, it can't refer to anything outside available_rels.
1302  */
1303  if (!bms_is_subset(upper_varnos, available_rels))
1304  return NULL;
1305 
1306  /*
1307  * The combining operators and left-hand expressions mustn't be volatile.
1308  */
1309  if (contain_volatile_functions(sublink->testexpr))
1310  return NULL;
1311 
1312  /* Create a dummy ParseState for addRangeTableEntryForSubquery */
1313  pstate = make_parsestate(NULL);
1314 
1315  /*
1316  * Okay, pull up the sub-select into upper range table.
1317  *
1318  * We rely here on the assumption that the outer query has no references
1319  * to the inner (necessarily true, other than the Vars that we build
1320  * below). Therefore this is a lot easier than what pull_up_subqueries has
1321  * to go through.
1322  */
1323  nsitem = addRangeTableEntryForSubquery(pstate,
1324  subselect,
1325  makeAlias("ANY_subquery", NIL),
1326  false,
1327  false);
1328  rte = nsitem->p_rte;
1329  parse->rtable = lappend(parse->rtable, rte);
1330  rtindex = list_length(parse->rtable);
1331 
1332  /*
1333  * Form a RangeTblRef for the pulled-up sub-select.
1334  */
1335  rtr = makeNode(RangeTblRef);
1336  rtr->rtindex = rtindex;
1337 
1338  /*
1339  * Build a list of Vars representing the subselect outputs.
1340  */
1341  subquery_vars = generate_subquery_vars(root,
1342  subselect->targetList,
1343  rtindex);
1344 
1345  /*
1346  * Build the new join's qual expression, replacing Params with these Vars.
1347  */
1348  quals = convert_testexpr(root, sublink->testexpr, subquery_vars);
1349 
1350  /*
1351  * And finally, build the JoinExpr node.
1352  */
1353  result = makeNode(JoinExpr);
1354  result->jointype = JOIN_SEMI;
1355  result->isNatural = false;
1356  result->larg = NULL; /* caller must fill this in */
1357  result->rarg = (Node *) rtr;
1358  result->usingClause = NIL;
1359  result->join_using_alias = NULL;
1360  result->quals = quals;
1361  result->alias = NULL;
1362  result->rtindex = 0; /* we don't need an RTE for it */
1363 
1364  return result;
1365 }
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:363
#define bms_is_empty(a)
Definition: bitmapset.h:105
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:483
Alias * makeAlias(const char *aliasname, List *colnames)
Definition: makefuncs.c:390
@ JOIN_SEMI
Definition: nodes.h:318
ParseState * make_parsestate(ParseState *parentParseState)
Definition: parse_node.c:44
ParseNamespaceItem * addRangeTableEntryForSubquery(ParseState *pstate, Query *subquery, Alias *alias, bool lateral, bool inFromCl)
static struct subre * parse(struct vars *v, int stopper, int type, struct state *init, struct state *final)
Definition: regcomp.c:715
Node * quals
Definition: primnodes.h:1994
JoinType jointype
Definition: primnodes.h:1985
int rtindex
Definition: primnodes.h:1998
Node * larg
Definition: primnodes.h:1987
bool isNatural
Definition: primnodes.h:1986
Node * rarg
Definition: primnodes.h:1988
Query * parse
Definition: pathnodes.h:199
static List * generate_subquery_vars(PlannerInfo *root, List *tlist, Index varno)
Definition: subselect.c:626
bool contain_vars_of_level(Node *node, int levelsup)
Definition: var.c:441
Relids pull_varnos(PlannerInfo *root, Node *node)
Definition: var.c:108

References addRangeTableEntryForSubquery(), ANY_SUBLINK, Assert(), bms_is_empty, bms_is_subset(), contain_vars_of_level(), contain_volatile_functions(), convert_testexpr(), generate_subquery_vars(), JoinExpr::isNatural, JOIN_SEMI, JoinExpr::jointype, lappend(), JoinExpr::larg, list_length(), make_parsestate(), makeAlias(), makeNode, NIL, parse(), PlannerInfo::parse, pull_varnos(), JoinExpr::quals, JoinExpr::rarg, JoinExpr::rtindex, SubLink::subLinkType, SubLink::subselect, Query::targetList, and SubLink::testexpr.

Referenced by pull_up_sublinks_qual_recurse().

◆ convert_EXISTS_sublink_to_join()

JoinExpr* convert_EXISTS_sublink_to_join ( PlannerInfo root,
SubLink sublink,
bool  under_not,
Relids  available_rels 
)

Definition at line 1375 of file subselect.c.

1377 {
1378  JoinExpr *result;
1379  Query *parse = root->parse;
1380  Query *subselect = (Query *) sublink->subselect;
1381  Node *whereClause;
1382  int rtoffset;
1383  int varno;
1384  Relids clause_varnos;
1385  Relids upper_varnos;
1386 
1387  Assert(sublink->subLinkType == EXISTS_SUBLINK);
1388 
1389  /*
1390  * Can't flatten if it contains WITH. (We could arrange to pull up the
1391  * WITH into the parent query's cteList, but that risks changing the
1392  * semantics, since a WITH ought to be executed once per associated query
1393  * call.) Note that convert_ANY_sublink_to_join doesn't have to reject
1394  * this case, since it just produces a subquery RTE that doesn't have to
1395  * get flattened into the parent query.
1396  */
1397  if (subselect->cteList)
1398  return NULL;
1399 
1400  /*
1401  * Copy the subquery so we can modify it safely (see comments in
1402  * make_subplan).
1403  */
1404  subselect = copyObject(subselect);
1405 
1406  /*
1407  * See if the subquery can be simplified based on the knowledge that it's
1408  * being used in EXISTS(). If we aren't able to get rid of its
1409  * targetlist, we have to fail, because the pullup operation leaves us
1410  * with noplace to evaluate the targetlist.
1411  */
1412  if (!simplify_EXISTS_query(root, subselect))
1413  return NULL;
1414 
1415  /*
1416  * Separate out the WHERE clause. (We could theoretically also remove
1417  * top-level plain JOIN/ON clauses, but it's probably not worth the
1418  * trouble.)
1419  */
1420  whereClause = subselect->jointree->quals;
1421  subselect->jointree->quals = NULL;
1422 
1423  /*
1424  * The rest of the sub-select must not refer to any Vars of the parent
1425  * query. (Vars of higher levels should be okay, though.)
1426  */
1427  if (contain_vars_of_level((Node *) subselect, 1))
1428  return NULL;
1429 
1430  /*
1431  * On the other hand, the WHERE clause must contain some Vars of the
1432  * parent query, else it's not gonna be a join.
1433  */
1434  if (!contain_vars_of_level(whereClause, 1))
1435  return NULL;
1436 
1437  /*
1438  * We don't risk optimizing if the WHERE clause is volatile, either.
1439  */
1440  if (contain_volatile_functions(whereClause))
1441  return NULL;
1442 
1443  /*
1444  * The subquery must have a nonempty jointree, but we can make it so.
1445  */
1446  replace_empty_jointree(subselect);
1447 
1448  /*
1449  * Prepare to pull up the sub-select into top range table.
1450  *
1451  * We rely here on the assumption that the outer query has no references
1452  * to the inner (necessarily true). Therefore this is a lot easier than
1453  * what pull_up_subqueries has to go through.
1454  *
1455  * In fact, it's even easier than what convert_ANY_sublink_to_join has to
1456  * do. The machinations of simplify_EXISTS_query ensured that there is
1457  * nothing interesting in the subquery except an rtable and jointree, and
1458  * even the jointree FromExpr no longer has quals. So we can just append
1459  * the rtable to our own and use the FromExpr in our jointree. But first,
1460  * adjust all level-zero varnos in the subquery to account for the rtable
1461  * merger.
1462  */
1463  rtoffset = list_length(parse->rtable);
1464  OffsetVarNodes((Node *) subselect, rtoffset, 0);
1465  OffsetVarNodes(whereClause, rtoffset, 0);
1466 
1467  /*
1468  * Upper-level vars in subquery will now be one level closer to their
1469  * parent than before; in particular, anything that had been level 1
1470  * becomes level zero.
1471  */
1472  IncrementVarSublevelsUp((Node *) subselect, -1, 1);
1473  IncrementVarSublevelsUp(whereClause, -1, 1);
1474 
1475  /*
1476  * Now that the WHERE clause is adjusted to match the parent query
1477  * environment, we can easily identify all the level-zero rels it uses.
1478  * The ones <= rtoffset belong to the upper query; the ones > rtoffset do
1479  * not.
1480  */
1481  clause_varnos = pull_varnos(root, whereClause);
1482  upper_varnos = NULL;
1483  varno = -1;
1484  while ((varno = bms_next_member(clause_varnos, varno)) >= 0)
1485  {
1486  if (varno <= rtoffset)
1487  upper_varnos = bms_add_member(upper_varnos, varno);
1488  }
1489  bms_free(clause_varnos);
1490  Assert(!bms_is_empty(upper_varnos));
1491 
1492  /*
1493  * Now that we've got the set of upper-level varnos, we can make the last
1494  * check: only available_rels can be referenced.
1495  */
1496  if (!bms_is_subset(upper_varnos, available_rels))
1497  return NULL;
1498 
1499  /*
1500  * Now we can attach the modified subquery rtable to the parent. This also
1501  * adds subquery's RTEPermissionInfos into the upper query.
1502  */
1503  CombineRangeTables(&parse->rtable, &parse->rteperminfos,
1504  subselect->rtable, subselect->rteperminfos);
1505 
1506  /*
1507  * And finally, build the JoinExpr node.
1508  */
1509  result = makeNode(JoinExpr);
1510  result->jointype = under_not ? JOIN_ANTI : JOIN_SEMI;
1511  result->isNatural = false;
1512  result->larg = NULL; /* caller must fill this in */
1513  /* flatten out the FromExpr node if it's useless */
1514  if (list_length(subselect->jointree->fromlist) == 1)
1515  result->rarg = (Node *) linitial(subselect->jointree->fromlist);
1516  else
1517  result->rarg = (Node *) subselect->jointree;
1518  result->usingClause = NIL;
1519  result->join_using_alias = NULL;
1520  result->quals = whereClause;
1521  result->alias = NULL;
1522  result->rtindex = 0; /* we don't need an RTE for it */
1523 
1524  return result;
1525 }
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1106
void bms_free(Bitmapset *a)
Definition: bitmapset.c:194
#define copyObject(obj)
Definition: nodes.h:244
@ JOIN_ANTI
Definition: nodes.h:319
void replace_empty_jointree(Query *parse)
Definition: prepjointree.c:235
void OffsetVarNodes(Node *node, int offset, int sublevels_up)
Definition: rewriteManip.c:480
void CombineRangeTables(List **dst_rtable, List **dst_perminfos, List *src_rtable, List *src_perminfos)
Definition: rewriteManip.c:350
void IncrementVarSublevelsUp(Node *node, int delta_sublevels_up, int min_sublevels_up)
Definition: rewriteManip.c:841
Node * quals
Definition: primnodes.h:2014
FromExpr * jointree
Definition: parsenodes.h:181
List * cteList
Definition: parsenodes.h:172
static bool simplify_EXISTS_query(PlannerInfo *root, Query *query)
Definition: subselect.c:1544

References Assert(), bms_add_member(), bms_free(), bms_is_empty, bms_is_subset(), bms_next_member(), CombineRangeTables(), contain_vars_of_level(), contain_volatile_functions(), copyObject, Query::cteList, EXISTS_SUBLINK, FromExpr::fromlist, IncrementVarSublevelsUp(), JoinExpr::isNatural, JOIN_ANTI, JOIN_SEMI, Query::jointree, JoinExpr::jointype, JoinExpr::larg, linitial, list_length(), makeNode, NIL, OffsetVarNodes(), parse(), PlannerInfo::parse, pull_varnos(), JoinExpr::quals, FromExpr::quals, JoinExpr::rarg, replace_empty_jointree(), Query::rtable, JoinExpr::rtindex, simplify_EXISTS_query(), SubLink::subLinkType, and SubLink::subselect.

Referenced by pull_up_sublinks_qual_recurse().

◆ convert_EXISTS_to_ANY()

static Query * convert_EXISTS_to_ANY ( PlannerInfo root,
Query subselect,
Node **  testexpr,
List **  paramIds 
)
static

Definition at line 1632 of file subselect.c.

1634 {
1635  Node *whereClause;
1636  List *leftargs,
1637  *rightargs,
1638  *opids,
1639  *opcollations,
1640  *newWhere,
1641  *tlist,
1642  *testlist,
1643  *paramids;
1644  ListCell *lc,
1645  *rc,
1646  *oc,
1647  *cc;
1648  AttrNumber resno;
1649 
1650  /*
1651  * Query must not require a targetlist, since we have to insert a new one.
1652  * Caller should have dealt with the case already.
1653  */
1654  Assert(subselect->targetList == NIL);
1655 
1656  /*
1657  * Separate out the WHERE clause. (We could theoretically also remove
1658  * top-level plain JOIN/ON clauses, but it's probably not worth the
1659  * trouble.)
1660  */
1661  whereClause = subselect->jointree->quals;
1662  subselect->jointree->quals = NULL;
1663 
1664  /*
1665  * The rest of the sub-select must not refer to any Vars of the parent
1666  * query. (Vars of higher levels should be okay, though.)
1667  *
1668  * Note: we need not check for Aggrefs separately because we know the
1669  * sub-select is as yet unoptimized; any uplevel Aggref must therefore
1670  * contain an uplevel Var reference. This is not the case below ...
1671  */
1672  if (contain_vars_of_level((Node *) subselect, 1))
1673  return NULL;
1674 
1675  /*
1676  * We don't risk optimizing if the WHERE clause is volatile, either.
1677  */
1678  if (contain_volatile_functions(whereClause))
1679  return NULL;
1680 
1681  /*
1682  * Clean up the WHERE clause by doing const-simplification etc on it.
1683  * Aside from simplifying the processing we're about to do, this is
1684  * important for being able to pull chunks of the WHERE clause up into the
1685  * parent query. Since we are invoked partway through the parent's
1686  * preprocess_expression() work, earlier steps of preprocess_expression()
1687  * wouldn't get applied to the pulled-up stuff unless we do them here. For
1688  * the parts of the WHERE clause that get put back into the child query,
1689  * this work is partially duplicative, but it shouldn't hurt.
1690  *
1691  * Note: we do not run flatten_join_alias_vars. This is OK because any
1692  * parent aliases were flattened already, and we're not going to pull any
1693  * child Vars (of any description) into the parent.
1694  *
1695  * Note: passing the parent's root to eval_const_expressions is
1696  * technically wrong, but we can get away with it since only the
1697  * boundParams (if any) are used, and those would be the same in a
1698  * subroot.
1699  */
1700  whereClause = eval_const_expressions(root, whereClause);
1701  whereClause = (Node *) canonicalize_qual((Expr *) whereClause, false);
1702  whereClause = (Node *) make_ands_implicit((Expr *) whereClause);
1703 
1704  /*
1705  * We now have a flattened implicit-AND list of clauses, which we try to
1706  * break apart into "outervar = innervar" hash clauses. Anything that
1707  * can't be broken apart just goes back into the newWhere list. Note that
1708  * we aren't trying hard yet to ensure that we have only outer or only
1709  * inner on each side; we'll check that if we get to the end.
1710  */
1711  leftargs = rightargs = opids = opcollations = newWhere = NIL;
1712  foreach(lc, (List *) whereClause)
1713  {
1714  OpExpr *expr = (OpExpr *) lfirst(lc);
1715 
1716  if (IsA(expr, OpExpr) &&
1717  hash_ok_operator(expr))
1718  {
1719  Node *leftarg = (Node *) linitial(expr->args);
1720  Node *rightarg = (Node *) lsecond(expr->args);
1721 
1722  if (contain_vars_of_level(leftarg, 1))
1723  {
1724  leftargs = lappend(leftargs, leftarg);
1725  rightargs = lappend(rightargs, rightarg);
1726  opids = lappend_oid(opids, expr->opno);
1727  opcollations = lappend_oid(opcollations, expr->inputcollid);
1728  continue;
1729  }
1730  if (contain_vars_of_level(rightarg, 1))
1731  {
1732  /*
1733  * We must commute the clause to put the outer var on the
1734  * left, because the hashing code in nodeSubplan.c expects
1735  * that. This probably shouldn't ever fail, since hashable
1736  * operators ought to have commutators, but be paranoid.
1737  */
1738  expr->opno = get_commutator(expr->opno);
1739  if (OidIsValid(expr->opno) && hash_ok_operator(expr))
1740  {
1741  leftargs = lappend(leftargs, rightarg);
1742  rightargs = lappend(rightargs, leftarg);
1743  opids = lappend_oid(opids, expr->opno);
1744  opcollations = lappend_oid(opcollations, expr->inputcollid);
1745  continue;
1746  }
1747  /* If no commutator, no chance to optimize the WHERE clause */
1748  return NULL;
1749  }
1750  }
1751  /* Couldn't handle it as a hash clause */
1752  newWhere = lappend(newWhere, expr);
1753  }
1754 
1755  /*
1756  * If we didn't find anything we could convert, fail.
1757  */
1758  if (leftargs == NIL)
1759  return NULL;
1760 
1761  /*
1762  * There mustn't be any parent Vars or Aggs in the stuff that we intend to
1763  * put back into the child query. Note: you might think we don't need to
1764  * check for Aggs separately, because an uplevel Agg must contain an
1765  * uplevel Var in its argument. But it is possible that the uplevel Var
1766  * got optimized away by eval_const_expressions. Consider
1767  *
1768  * SUM(CASE WHEN false THEN uplevelvar ELSE 0 END)
1769  */
1770  if (contain_vars_of_level((Node *) newWhere, 1) ||
1771  contain_vars_of_level((Node *) rightargs, 1))
1772  return NULL;
1773  if (root->parse->hasAggs &&
1774  (contain_aggs_of_level((Node *) newWhere, 1) ||
1775  contain_aggs_of_level((Node *) rightargs, 1)))
1776  return NULL;
1777 
1778  /*
1779  * And there can't be any child Vars in the stuff we intend to pull up.
1780  * (Note: we'd need to check for child Aggs too, except we know the child
1781  * has no aggs at all because of simplify_EXISTS_query's check. The same
1782  * goes for window functions.)
1783  */
1784  if (contain_vars_of_level((Node *) leftargs, 0))
1785  return NULL;
1786 
1787  /*
1788  * Also reject sublinks in the stuff we intend to pull up. (It might be
1789  * possible to support this, but doesn't seem worth the complication.)
1790  */
1791  if (contain_subplans((Node *) leftargs))
1792  return NULL;
1793 
1794  /*
1795  * Okay, adjust the sublevelsup in the stuff we're pulling up.
1796  */
1797  IncrementVarSublevelsUp((Node *) leftargs, -1, 1);
1798 
1799  /*
1800  * Put back any child-level-only WHERE clauses.
1801  */
1802  if (newWhere)
1803  subselect->jointree->quals = (Node *) make_ands_explicit(newWhere);
1804 
1805  /*
1806  * Build a new targetlist for the child that emits the expressions we
1807  * need. Concurrently, build a testexpr for the parent using Params to
1808  * reference the child outputs. (Since we generate Params directly here,
1809  * there will be no need to convert the testexpr in build_subplan.)
1810  */
1811  tlist = testlist = paramids = NIL;
1812  resno = 1;
1813  forfour(lc, leftargs, rc, rightargs, oc, opids, cc, opcollations)
1814  {
1815  Node *leftarg = (Node *) lfirst(lc);
1816  Node *rightarg = (Node *) lfirst(rc);
1817  Oid opid = lfirst_oid(oc);
1818  Oid opcollation = lfirst_oid(cc);
1819  Param *param;
1820 
1821  param = generate_new_exec_param(root,
1822  exprType(rightarg),
1823  exprTypmod(rightarg),
1824  exprCollation(rightarg));
1825  tlist = lappend(tlist,
1826  makeTargetEntry((Expr *) rightarg,
1827  resno++,
1828  NULL,
1829  false));
1830  testlist = lappend(testlist,
1831  make_opclause(opid, BOOLOID, false,
1832  (Expr *) leftarg, (Expr *) param,
1833  InvalidOid, opcollation));
1834  paramids = lappend_int(paramids, param->paramid);
1835  }
1836 
1837  /* Put everything where it should go, and we're done */
1838  subselect->targetList = tlist;
1839  *testexpr = (Node *) make_ands_explicit(testlist);
1840  *paramIds = paramids;
1841 
1842  return subselect;
1843 }
int16 AttrNumber
Definition: attnum.h:21
Node * eval_const_expressions(PlannerInfo *root, Node *node)
Definition: clauses.c:2171
bool contain_subplans(Node *clause)
Definition: clauses.c:332
List * lappend_oid(List *list, Oid datum)
Definition: list.c:374
Oid get_commutator(Oid opno)
Definition: lsyscache.c:1513
Expr * make_opclause(Oid opno, Oid opresulttype, bool opretset, Expr *leftop, Expr *rightop, Oid opcollid, Oid inputcollid)
Definition: makefuncs.c:613
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:722
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:241
Expr * make_ands_explicit(List *andclauses)
Definition: makefuncs.c:711
#define lsecond(l)
Definition: pg_list.h:183
#define forfour(cell1, list1, cell2, list2, cell3, list3, cell4, list4)
Definition: pg_list.h:524
#define lfirst_oid(lc)
Definition: pg_list.h:174
Expr * canonicalize_qual(Expr *qual, bool is_check)
Definition: prepqual.c:294
bool contain_aggs_of_level(Node *node, int levelsup)
Definition: rewriteManip.c:85
Oid opno
Definition: primnodes.h:745
List * args
Definition: primnodes.h:763
List * targetList
Definition: parsenodes.h:188
static bool hash_ok_operator(OpExpr *expr)
Definition: subselect.c:845

References OpExpr::args, Assert(), canonicalize_qual(), contain_aggs_of_level(), contain_subplans(), contain_vars_of_level(), contain_volatile_functions(), eval_const_expressions(), exprCollation(), exprType(), exprTypmod(), forfour, generate_new_exec_param(), get_commutator(), hash_ok_operator(), IncrementVarSublevelsUp(), InvalidOid, IsA, Query::jointree, lappend(), lappend_int(), lappend_oid(), lfirst, lfirst_oid, linitial, lsecond, make_ands_explicit(), make_ands_implicit(), make_opclause(), makeTargetEntry(), NIL, OidIsValid, OpExpr::opno, Param::paramid, PlannerInfo::parse, FromExpr::quals, and Query::targetList.

Referenced by make_subplan().

◆ convert_testexpr()

static Node * convert_testexpr ( PlannerInfo root,
Node testexpr,
List subst_nodes 
)
static

Definition at line 655 of file subselect.c.

658 {
659  convert_testexpr_context context;
660 
661  context.root = root;
662  context.subst_nodes = subst_nodes;
663  return convert_testexpr_mutator(testexpr, &context);
664 }
PlannerInfo * root
Definition: subselect.c:44
static Node * convert_testexpr_mutator(Node *node, convert_testexpr_context *context)
Definition: subselect.c:667

References convert_testexpr_mutator(), convert_testexpr_context::root, and convert_testexpr_context::subst_nodes.

Referenced by build_subplan(), and convert_ANY_sublink_to_join().

◆ convert_testexpr_mutator()

static Node * convert_testexpr_mutator ( Node node,
convert_testexpr_context context 
)
static

Definition at line 667 of file subselect.c.

669 {
670  if (node == NULL)
671  return NULL;
672  if (IsA(node, Param))
673  {
674  Param *param = (Param *) node;
675 
676  if (param->paramkind == PARAM_SUBLINK)
677  {
678  if (param->paramid <= 0 ||
679  param->paramid > list_length(context->subst_nodes))
680  elog(ERROR, "unexpected PARAM_SUBLINK ID: %d", param->paramid);
681 
682  /*
683  * We copy the list item to avoid having doubly-linked
684  * substructure in the modified parse tree. This is probably
685  * unnecessary when it's a Param, but be safe.
686  */
687  return (Node *) copyObject(list_nth(context->subst_nodes,
688  param->paramid - 1));
689  }
690  }
691  if (IsA(node, SubLink))
692  {
693  /*
694  * If we come across a nested SubLink, it is neither necessary nor
695  * correct to recurse into it: any PARAM_SUBLINKs we might find inside
696  * belong to the inner SubLink not the outer. So just return it as-is.
697  *
698  * This reasoning depends on the assumption that nothing will pull
699  * subexpressions into or out of the testexpr field of a SubLink, at
700  * least not without replacing PARAM_SUBLINKs first. If we did want
701  * to do that we'd need to rethink the parser-output representation
702  * altogether, since currently PARAM_SUBLINKs are only unique per
703  * SubLink not globally across the query. The whole point of
704  * replacing them with Vars or PARAM_EXEC nodes is to make them
705  * globally unique before they escape from the SubLink's testexpr.
706  *
707  * Note: this can't happen when called during SS_process_sublinks,
708  * because that recursively processes inner SubLinks first. It can
709  * happen when called from convert_ANY_sublink_to_join, though.
710  */
711  return node;
712  }
713  return expression_tree_mutator(node,
715  (void *) context);
716 }
#define expression_tree_mutator(n, m, c)
Definition: nodeFuncs.h:153
static void * list_nth(const List *list, int n)
Definition: pg_list.h:299
@ PARAM_SUBLINK
Definition: primnodes.h:347
ParamKind paramkind
Definition: primnodes.h:354

References copyObject, elog(), ERROR, expression_tree_mutator, IsA, list_length(), list_nth(), PARAM_SUBLINK, Param::paramid, Param::paramkind, and convert_testexpr_context::subst_nodes.

Referenced by convert_testexpr().

◆ finalize_agg_primnode()

static bool finalize_agg_primnode ( Node node,
finalize_primnode_context context 
)
static

Definition at line 2971 of file subselect.c.

2972 {
2973  if (node == NULL)
2974  return false;
2975  if (IsA(node, Aggref))
2976  {
2977  Aggref *agg = (Aggref *) node;
2978 
2979  /* we should not consider the direct arguments, if any */
2980  finalize_primnode((Node *) agg->args, context);
2981  finalize_primnode((Node *) agg->aggfilter, context);
2982  return false; /* there can't be any Aggrefs below here */
2983  }
2985  (void *) context);
2986 }
List * args
Definition: primnodes.h:446
Expr * aggfilter
Definition: primnodes.h:455
static bool finalize_agg_primnode(Node *node, finalize_primnode_context *context)
Definition: subselect.c:2971
static bool finalize_primnode(Node *node, finalize_primnode_context *context)
Definition: subselect.c:2887

References Aggref::aggfilter, Aggref::args, expression_tree_walker, finalize_primnode(), and IsA.

Referenced by finalize_plan().

◆ finalize_plan()

static Bitmapset * finalize_plan ( PlannerInfo root,
Plan plan,
int  gather_param,
Bitmapset valid_params,
Bitmapset scan_params 
)
static

Definition at line 2289 of file subselect.c.

2293 {
2294  finalize_primnode_context context;
2295  int locally_added_param;
2296  Bitmapset *nestloop_params;
2297  Bitmapset *initExtParam;
2298  Bitmapset *initSetParam;
2299  Bitmapset *child_params;
2300  ListCell *l;
2301 
2302  if (plan == NULL)
2303  return NULL;
2304 
2305  context.root = root;
2306  context.paramids = NULL; /* initialize set to empty */
2307  locally_added_param = -1; /* there isn't one */
2308  nestloop_params = NULL; /* there aren't any */
2309 
2310  /*
2311  * Examine any initPlans to determine the set of external params they
2312  * reference and the set of output params they supply. (We assume
2313  * SS_finalize_plan was run on them already.)
2314  */
2315  initExtParam = initSetParam = NULL;
2316  foreach(l, plan->initPlan)
2317  {
2318  SubPlan *initsubplan = (SubPlan *) lfirst(l);
2319  Plan *initplan = planner_subplan_get_plan(root, initsubplan);
2320  ListCell *l2;
2321 
2322  initExtParam = bms_add_members(initExtParam, initplan->extParam);
2323  foreach(l2, initsubplan->setParam)
2324  {
2325  initSetParam = bms_add_member(initSetParam, lfirst_int(l2));
2326  }
2327  }
2328 
2329  /* Any setParams are validly referenceable in this node and children */
2330  if (initSetParam)
2331  valid_params = bms_union(valid_params, initSetParam);
2332 
2333  /*
2334  * When we call finalize_primnode, context.paramids sets are automatically
2335  * merged together. But when recursing to self, we have to do it the hard
2336  * way. We want the paramids set to include params in subplans as well as
2337  * at this level.
2338  */
2339 
2340  /* Find params in targetlist and qual */
2341  finalize_primnode((Node *) plan->targetlist, &context);
2342  finalize_primnode((Node *) plan->qual, &context);
2343 
2344  /*
2345  * If it's a parallel-aware scan node, mark it as dependent on the parent
2346  * Gather/GatherMerge's rescan Param.
2347  */
2348  if (plan->parallel_aware)
2349  {
2350  if (gather_param < 0)
2351  elog(ERROR, "parallel-aware plan node is not below a Gather");
2352  context.paramids =
2353  bms_add_member(context.paramids, gather_param);
2354  }
2355 
2356  /* Check additional node-type-specific fields */
2357  switch (nodeTag(plan))
2358  {
2359  case T_Result:
2360  finalize_primnode(((Result *) plan)->resconstantqual,
2361  &context);
2362  break;
2363 
2364  case T_SeqScan:
2365  context.paramids = bms_add_members(context.paramids, scan_params);
2366  break;
2367 
2368  case T_SampleScan:
2369  finalize_primnode((Node *) ((SampleScan *) plan)->tablesample,
2370  &context);
2371  context.paramids = bms_add_members(context.paramids, scan_params);
2372  break;
2373 
2374  case T_IndexScan:
2375  finalize_primnode((Node *) ((IndexScan *) plan)->indexqual,
2376  &context);
2377  finalize_primnode((Node *) ((IndexScan *) plan)->indexorderby,
2378  &context);
2379 
2380  /*
2381  * we need not look at indexqualorig, since it will have the same
2382  * param references as indexqual. Likewise, we can ignore
2383  * indexorderbyorig.
2384  */
2385  context.paramids = bms_add_members(context.paramids, scan_params);
2386  break;
2387 
2388  case T_IndexOnlyScan:
2389  finalize_primnode((Node *) ((IndexOnlyScan *) plan)->indexqual,
2390  &context);
2391  finalize_primnode((Node *) ((IndexOnlyScan *) plan)->recheckqual,
2392  &context);
2393  finalize_primnode((Node *) ((IndexOnlyScan *) plan)->indexorderby,
2394  &context);
2395 
2396  /*
2397  * we need not look at indextlist, since it cannot contain Params.
2398  */
2399  context.paramids = bms_add_members(context.paramids, scan_params);
2400  break;
2401 
2402  case T_BitmapIndexScan:
2403  finalize_primnode((Node *) ((BitmapIndexScan *) plan)->indexqual,
2404  &context);
2405 
2406  /*
2407  * we need not look at indexqualorig, since it will have the same
2408  * param references as indexqual.
2409  */
2410  break;
2411 
2412  case T_BitmapHeapScan:
2413  finalize_primnode((Node *) ((BitmapHeapScan *) plan)->bitmapqualorig,
2414  &context);
2415  context.paramids = bms_add_members(context.paramids, scan_params);
2416  break;
2417 
2418  case T_TidScan:
2419  finalize_primnode((Node *) ((TidScan *) plan)->tidquals,
2420  &context);
2421  context.paramids = bms_add_members(context.paramids, scan_params);
2422  break;
2423 
2424  case T_TidRangeScan:
2425  finalize_primnode((Node *) ((TidRangeScan *) plan)->tidrangequals,
2426  &context);
2427  context.paramids = bms_add_members(context.paramids, scan_params);
2428  break;
2429 
2430  case T_SubqueryScan:
2431  {
2432  SubqueryScan *sscan = (SubqueryScan *) plan;
2433  RelOptInfo *rel;
2434  Bitmapset *subquery_params;
2435 
2436  /* We must run finalize_plan on the subquery */
2437  rel = find_base_rel(root, sscan->scan.scanrelid);
2438  subquery_params = rel->subroot->outer_params;
2439  if (gather_param >= 0)
2440  subquery_params = bms_add_member(bms_copy(subquery_params),
2441  gather_param);
2442  finalize_plan(rel->subroot, sscan->subplan, gather_param,
2443  subquery_params, NULL);
2444 
2445  /* Now we can add its extParams to the parent's params */
2446  context.paramids = bms_add_members(context.paramids,
2447  sscan->subplan->extParam);
2448  /* We need scan_params too, though */
2449  context.paramids = bms_add_members(context.paramids,
2450  scan_params);
2451  }
2452  break;
2453 
2454  case T_FunctionScan:
2455  {
2456  FunctionScan *fscan = (FunctionScan *) plan;
2457  ListCell *lc;
2458 
2459  /*
2460  * Call finalize_primnode independently on each function
2461  * expression, so that we can record which params are
2462  * referenced in each, in order to decide which need
2463  * re-evaluating during rescan.
2464  */
2465  foreach(lc, fscan->functions)
2466  {
2467  RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
2468  finalize_primnode_context funccontext;
2469 
2470  funccontext = context;
2471  funccontext.paramids = NULL;
2472 
2473  finalize_primnode(rtfunc->funcexpr, &funccontext);
2474 
2475  /* remember results for execution */
2476  rtfunc->funcparams = funccontext.paramids;
2477 
2478  /* add the function's params to the overall set */
2479  context.paramids = bms_add_members(context.paramids,
2480  funccontext.paramids);
2481  }
2482 
2483  context.paramids = bms_add_members(context.paramids,
2484  scan_params);
2485  }
2486  break;
2487 
2488  case T_TableFuncScan:
2489  finalize_primnode((Node *) ((TableFuncScan *) plan)->tablefunc,
2490  &context);
2491  context.paramids = bms_add_members(context.paramids, scan_params);
2492  break;
2493 
2494  case T_ValuesScan:
2495  finalize_primnode((Node *) ((ValuesScan *) plan)->values_lists,
2496  &context);
2497  context.paramids = bms_add_members(context.paramids, scan_params);
2498  break;
2499 
2500  case T_CteScan:
2501  {
2502  /*
2503  * You might think we should add the node's cteParam to
2504  * paramids, but we shouldn't because that param is just a
2505  * linkage mechanism for multiple CteScan nodes for the same
2506  * CTE; it is never used for changed-param signaling. What we
2507  * have to do instead is to find the referenced CTE plan and
2508  * incorporate its external paramids, so that the correct
2509  * things will happen if the CTE references outer-level
2510  * variables. See test cases for bug #4902. (We assume
2511  * SS_finalize_plan was run on the CTE plan already.)
2512  */
2513  int plan_id = ((CteScan *) plan)->ctePlanId;
2514  Plan *cteplan;
2515 
2516  /* so, do this ... */
2517  if (plan_id < 1 || plan_id > list_length(root->glob->subplans))
2518  elog(ERROR, "could not find plan for CteScan referencing plan ID %d",
2519  plan_id);
2520  cteplan = (Plan *) list_nth(root->glob->subplans, plan_id - 1);
2521  context.paramids =
2522  bms_add_members(context.paramids, cteplan->extParam);
2523 
2524 #ifdef NOT_USED
2525  /* ... but not this */
2526  context.paramids =
2527  bms_add_member(context.paramids,
2528  ((CteScan *) plan)->cteParam);
2529 #endif
2530 
2531  context.paramids = bms_add_members(context.paramids,
2532  scan_params);
2533  }
2534  break;
2535 
2536  case T_WorkTableScan:
2537  context.paramids =
2538  bms_add_member(context.paramids,
2539  ((WorkTableScan *) plan)->wtParam);
2540  context.paramids = bms_add_members(context.paramids, scan_params);
2541  break;
2542 
2543  case T_NamedTuplestoreScan:
2544  context.paramids = bms_add_members(context.paramids, scan_params);
2545  break;
2546 
2547  case T_ForeignScan:
2548  {
2549  ForeignScan *fscan = (ForeignScan *) plan;
2550 
2551  finalize_primnode((Node *) fscan->fdw_exprs,
2552  &context);
2554  &context);
2555 
2556  /* We assume fdw_scan_tlist cannot contain Params */
2557  context.paramids = bms_add_members(context.paramids,
2558  scan_params);
2559  }
2560  break;
2561 
2562  case T_CustomScan:
2563  {
2564  CustomScan *cscan = (CustomScan *) plan;
2565  ListCell *lc;
2566 
2567  finalize_primnode((Node *) cscan->custom_exprs,
2568  &context);
2569  /* We assume custom_scan_tlist cannot contain Params */
2570  context.paramids =
2571  bms_add_members(context.paramids, scan_params);
2572 
2573  /* child nodes if any */
2574  foreach(lc, cscan->custom_plans)
2575  {
2576  context.paramids =
2577  bms_add_members(context.paramids,
2578  finalize_plan(root,
2579  (Plan *) lfirst(lc),
2580  gather_param,
2581  valid_params,
2582  scan_params));
2583  }
2584  }
2585  break;
2586 
2587  case T_ModifyTable:
2588  {
2589  ModifyTable *mtplan = (ModifyTable *) plan;
2590 
2591  /* Force descendant scan nodes to reference epqParam */
2592  locally_added_param = mtplan->epqParam;
2593  valid_params = bms_add_member(bms_copy(valid_params),
2594  locally_added_param);
2595  scan_params = bms_add_member(bms_copy(scan_params),
2596  locally_added_param);
2598  &context);
2599  finalize_primnode((Node *) mtplan->onConflictSet,
2600  &context);
2602  &context);
2603  /* exclRelTlist contains only Vars, doesn't need examination */
2604  }
2605  break;
2606 
2607  case T_Append:
2608  {
2609  foreach(l, ((Append *) plan)->appendplans)
2610  {
2611  context.paramids =
2612  bms_add_members(context.paramids,
2613  finalize_plan(root,
2614  (Plan *) lfirst(l),
2615  gather_param,
2616  valid_params,
2617  scan_params));
2618  }
2619  }
2620  break;
2621 
2622  case T_MergeAppend:
2623  {
2624  foreach(l, ((MergeAppend *) plan)->mergeplans)
2625  {
2626  context.paramids =
2627  bms_add_members(context.paramids,
2628  finalize_plan(root,
2629  (Plan *) lfirst(l),
2630  gather_param,
2631  valid_params,
2632  scan_params));
2633  }
2634  }
2635  break;
2636 
2637  case T_BitmapAnd:
2638  {
2639  foreach(l, ((BitmapAnd *) plan)->bitmapplans)
2640  {
2641  context.paramids =
2642  bms_add_members(context.paramids,
2643  finalize_plan(root,
2644  (Plan *) lfirst(l),
2645  gather_param,
2646  valid_params,
2647  scan_params));
2648  }
2649  }
2650  break;
2651 
2652  case T_BitmapOr:
2653  {
2654  foreach(l, ((BitmapOr *) plan)->bitmapplans)
2655  {
2656  context.paramids =
2657  bms_add_members(context.paramids,
2658  finalize_plan(root,
2659  (Plan *) lfirst(l),
2660  gather_param,
2661  valid_params,
2662  scan_params));
2663  }
2664  }
2665  break;
2666 
2667  case T_NestLoop:
2668  {
2669  finalize_primnode((Node *) ((Join *) plan)->joinqual,
2670  &context);
2671  /* collect set of params that will be passed to right child */
2672  foreach(l, ((NestLoop *) plan)->nestParams)
2673  {
2674  NestLoopParam *nlp = (NestLoopParam *) lfirst(l);
2675 
2676  nestloop_params = bms_add_member(nestloop_params,
2677  nlp->paramno);
2678  }
2679  }
2680  break;
2681 
2682  case T_MergeJoin:
2683  finalize_primnode((Node *) ((Join *) plan)->joinqual,
2684  &context);
2685  finalize_primnode((Node *) ((MergeJoin *) plan)->mergeclauses,
2686  &context);
2687  break;
2688 
2689  case T_HashJoin:
2690  finalize_primnode((Node *) ((Join *) plan)->joinqual,
2691  &context);
2692  finalize_primnode((Node *) ((HashJoin *) plan)->hashclauses,
2693  &context);
2694  break;
2695 
2696  case T_Hash:
2697  finalize_primnode((Node *) ((Hash *) plan)->hashkeys,
2698  &context);
2699  break;
2700 
2701  case T_Limit:
2702  finalize_primnode(((Limit *) plan)->limitOffset,
2703  &context);
2704  finalize_primnode(((Limit *) plan)->limitCount,
2705  &context);
2706  break;
2707 
2708  case T_RecursiveUnion:
2709  /* child nodes are allowed to reference wtParam */
2710  locally_added_param = ((RecursiveUnion *) plan)->wtParam;
2711  valid_params = bms_add_member(bms_copy(valid_params),
2712  locally_added_param);
2713  /* wtParam does *not* get added to scan_params */
2714  break;
2715 
2716  case T_LockRows:
2717  /* Force descendant scan nodes to reference epqParam */
2718  locally_added_param = ((LockRows *) plan)->epqParam;
2719  valid_params = bms_add_member(bms_copy(valid_params),
2720  locally_added_param);
2721  scan_params = bms_add_member(bms_copy(scan_params),
2722  locally_added_param);
2723  break;
2724 
2725  case T_Agg:
2726  {
2727  Agg *agg = (Agg *) plan;
2728 
2729  /*
2730  * AGG_HASHED plans need to know which Params are referenced
2731  * in aggregate calls. Do a separate scan to identify them.
2732  */
2733  if (agg->aggstrategy == AGG_HASHED)
2734  {
2735  finalize_primnode_context aggcontext;
2736 
2737  aggcontext.root = root;
2738  aggcontext.paramids = NULL;
2740  &aggcontext);
2742  &aggcontext);
2743  agg->aggParams = aggcontext.paramids;
2744  }
2745  }
2746  break;
2747 
2748  case T_WindowAgg:
2749  finalize_primnode(((WindowAgg *) plan)->startOffset,
2750  &context);
2751  finalize_primnode(((WindowAgg *) plan)->endOffset,
2752  &context);
2753  break;
2754 
2755  case T_Gather:
2756  /* child nodes are allowed to reference rescan_param, if any */
2757  locally_added_param = ((Gather *) plan)->rescan_param;
2758  if (locally_added_param >= 0)
2759  {
2760  valid_params = bms_add_member(bms_copy(valid_params),
2761  locally_added_param);
2762 
2763  /*
2764  * We currently don't support nested Gathers. The issue so
2765  * far as this function is concerned would be how to identify
2766  * which child nodes depend on which Gather.
2767  */
2768  Assert(gather_param < 0);
2769  /* Pass down rescan_param to child parallel-aware nodes */
2770  gather_param = locally_added_param;
2771  }
2772  /* rescan_param does *not* get added to scan_params */
2773  break;
2774 
2775  case T_GatherMerge:
2776  /* child nodes are allowed to reference rescan_param, if any */
2777  locally_added_param = ((GatherMerge *) plan)->rescan_param;
2778  if (locally_added_param >= 0)
2779  {
2780  valid_params = bms_add_member(bms_copy(valid_params),
2781  locally_added_param);
2782 
2783  /*
2784  * We currently don't support nested Gathers. The issue so
2785  * far as this function is concerned would be how to identify
2786  * which child nodes depend on which Gather.
2787  */
2788  Assert(gather_param < 0);
2789  /* Pass down rescan_param to child parallel-aware nodes */
2790  gather_param = locally_added_param;
2791  }
2792  /* rescan_param does *not* get added to scan_params */
2793  break;
2794 
2795  case T_Memoize:
2796  finalize_primnode((Node *) ((Memoize *) plan)->param_exprs,
2797  &context);
2798  break;
2799 
2800  case T_ProjectSet:
2801  case T_Material:
2802  case T_Sort:
2803  case T_IncrementalSort:
2804  case T_Unique:
2805  case T_SetOp:
2806  case T_Group:
2807  /* no node-type-specific fields need fixing */
2808  break;
2809 
2810  default:
2811  elog(ERROR, "unrecognized node type: %d",
2812  (int) nodeTag(plan));
2813  }
2814 
2815  /* Process left and right child plans, if any */
2816  child_params = finalize_plan(root,
2817  plan->lefttree,
2818  gather_param,
2819  valid_params,
2820  scan_params);
2821  context.paramids = bms_add_members(context.paramids, child_params);
2822 
2823  if (nestloop_params)
2824  {
2825  /* right child can reference nestloop_params as well as valid_params */
2826  child_params = finalize_plan(root,
2827  plan->righttree,
2828  gather_param,
2829  bms_union(nestloop_params, valid_params),
2830  scan_params);
2831  /* ... and they don't count as parameters used at my level */
2832  child_params = bms_difference(child_params, nestloop_params);
2833  bms_free(nestloop_params);
2834  }
2835  else
2836  {
2837  /* easy case */
2838  child_params = finalize_plan(root,
2839  plan->righttree,
2840  gather_param,
2841  valid_params,
2842  scan_params);
2843  }
2844  context.paramids = bms_add_members(context.paramids, child_params);
2845 
2846  /*
2847  * Any locally generated parameter doesn't count towards its generating
2848  * plan node's external dependencies. (Note: if we changed valid_params
2849  * and/or scan_params, we leak those bitmapsets; not worth the notational
2850  * trouble to clean them up.)
2851  */
2852  if (locally_added_param >= 0)
2853  {
2854  context.paramids = bms_del_member(context.paramids,
2855  locally_added_param);
2856  }
2857 
2858  /* Now we have all the paramids referenced in this node and children */
2859 
2860  if (!bms_is_subset(context.paramids, valid_params))
2861  elog(ERROR, "plan should not reference subplan's variable");
2862 
2863  /*
2864  * The plan node's allParam and extParam fields should include all its
2865  * referenced paramids, plus contributions from any child initPlans.
2866  * However, any setParams of the initPlans should not be present in the
2867  * parent node's extParams, only in its allParams. (It's possible that
2868  * some initPlans have extParams that are setParams of other initPlans.)
2869  */
2870 
2871  /* allParam must include initplans' extParams and setParams */
2872  plan->allParam = bms_union(context.paramids, initExtParam);
2873  plan->allParam = bms_add_members(plan->allParam, initSetParam);
2874  /* extParam must include any initplan extParams */
2875  plan->extParam = bms_union(context.paramids, initExtParam);
2876  /* but not any initplan setParams */
2877  plan->extParam = bms_del_members(plan->extParam, initSetParam);
2878 
2879  return plan->allParam;
2880 }
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:211
Bitmapset * bms_difference(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:297
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:835
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:993
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:793
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:80
@ AGG_HASHED
Definition: nodes.h:366
#define planner_subplan_get_plan(root, subplan)
Definition: pathnodes.h:166
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:405
Definition: plannodes.h:995
Bitmapset * aggParams
Definition: plannodes.h:1021
Plan plan
Definition: plannodes.h:996
AggStrategy aggstrategy
Definition: plannodes.h:999
List * custom_exprs
Definition: plannodes.h:743
List * custom_plans
Definition: plannodes.h:742
List * fdw_exprs
Definition: plannodes.h:713
List * fdw_recheck_quals
Definition: plannodes.h:716
List * functions
Definition: plannodes.h:610
int epqParam
Definition: plannodes.h:244
List * onConflictSet
Definition: plannodes.h:247
List * returningLists
Definition: plannodes.h:240
Node * onConflictWhere
Definition: plannodes.h:249
Bitmapset * extParam
Definition: plannodes.h:171
List * qual
Definition: plannodes.h:154
List * targetlist
Definition: plannodes.h:153
Bitmapset * outer_params
Definition: pathnodes.h:218
PlannerInfo * subroot
Definition: pathnodes.h:932
Index scanrelid
Definition: plannodes.h:387
List * setParam
Definition: primnodes.h:1015
Plan * subplan
Definition: plannodes.h:599
PlannerInfo * root
Definition: subselect.c:56
static Bitmapset * finalize_plan(PlannerInfo *root, Plan *plan, int gather_param, Bitmapset *valid_params, Bitmapset *scan_params)
Definition: subselect.c:2289

References AGG_HASHED, Agg::aggParams, Agg::aggstrategy, Assert(), bms_add_member(), bms_add_members(), bms_copy(), bms_del_member(), bms_del_members(), bms_difference(), bms_free(), bms_is_subset(), bms_union(), CustomScan::custom_exprs, CustomScan::custom_plans, elog(), ModifyTable::epqParam, ERROR, Plan::extParam, ForeignScan::fdw_exprs, ForeignScan::fdw_recheck_quals, finalize_agg_primnode(), finalize_primnode(), find_base_rel(), RangeTblFunction::funcexpr, FunctionScan::functions, PlannerInfo::glob, lfirst, lfirst_int, list_length(), list_nth(), nodeTag, ModifyTable::onConflictSet, ModifyTable::onConflictWhere, PlannerInfo::outer_params, finalize_primnode_context::paramids, NestLoopParam::paramno, Agg::plan, plan, planner_subplan_get_plan, Plan::qual, ModifyTable::returningLists, finalize_primnode_context::root, SubqueryScan::scan, Scan::scanrelid, SubPlan::setParam, SubqueryScan::subplan, PlannerGlobal::subplans, RelOptInfo::subroot, and Plan::targetlist.

Referenced by SS_finalize_plan().

◆ finalize_primnode()

static bool finalize_primnode ( Node node,
finalize_primnode_context context 
)
static

Definition at line 2887 of file subselect.c.

2888 {
2889  if (node == NULL)
2890  return false;
2891  if (IsA(node, Param))
2892  {
2893  if (((Param *) node)->paramkind == PARAM_EXEC)
2894  {
2895  int paramid = ((Param *) node)->paramid;
2896 
2897  context->paramids = bms_add_member(context->paramids, paramid);
2898  }
2899  return false; /* no more to do here */
2900  }
2901  else if (IsA(node, Aggref))
2902  {
2903  /*
2904  * Check to see if the aggregate will be replaced by a Param
2905  * referencing a subquery output during setrefs.c. If so, we must
2906  * account for that Param here. (For various reasons, it's not
2907  * convenient to perform that substitution earlier than setrefs.c, nor
2908  * to perform this processing after setrefs.c. Thus we need a wart
2909  * here.)
2910  */
2911  Aggref *aggref = (Aggref *) node;
2912  Param *aggparam;
2913 
2914  aggparam = find_minmax_agg_replacement_param(context->root, aggref);
2915  if (aggparam != NULL)
2916  context->paramids = bms_add_member(context->paramids,
2917  aggparam->paramid);
2918  /* Fall through to examine the agg's arguments */
2919  }
2920  else if (IsA(node, SubPlan))
2921  {
2922  SubPlan *subplan = (SubPlan *) node;
2923  Plan *plan = planner_subplan_get_plan(context->root, subplan);
2924  ListCell *lc;
2925  Bitmapset *subparamids;
2926 
2927  /* Recurse into the testexpr, but not into the Plan */
2928  finalize_primnode(subplan->testexpr, context);
2929 
2930  /*
2931  * Remove any param IDs of output parameters of the subplan that were
2932  * referenced in the testexpr. These are not interesting for
2933  * parameter change signaling since we always re-evaluate the subplan.
2934  * Note that this wouldn't work too well if there might be uses of the
2935  * same param IDs elsewhere in the plan, but that can't happen because
2936  * generate_new_exec_param never tries to merge params.
2937  */
2938  foreach(lc, subplan->paramIds)
2939  {
2940  context->paramids = bms_del_member(context->paramids,
2941  lfirst_int(lc));
2942  }
2943 
2944  /* Also examine args list */
2945  finalize_primnode((Node *) subplan->args, context);
2946 
2947  /*
2948  * Add params needed by the subplan to paramids, but excluding those
2949  * we will pass down to it. (We assume SS_finalize_plan was run on
2950  * the subplan already.)
2951  */
2952  subparamids = bms_copy(plan->extParam);
2953  foreach(lc, subplan->parParam)
2954  {
2955  subparamids = bms_del_member(subparamids, lfirst_int(lc));
2956  }
2957  context->paramids = bms_join(context->paramids, subparamids);
2958 
2959  return false; /* no more to do here */
2960  }
2962  (void *) context);
2963 }
Bitmapset * bms_join(Bitmapset *a, Bitmapset *b)
Definition: bitmapset.c:1051
@ PARAM_EXEC
Definition: primnodes.h:346
Param * find_minmax_agg_replacement_param(PlannerInfo *root, Aggref *aggref)
Definition: setrefs.c:3405
List * args
Definition: primnodes.h:1018
List * paramIds
Definition: primnodes.h:995
Node * testexpr
Definition: primnodes.h:994
List * parParam
Definition: primnodes.h:1017

References SubPlan::args, bms_add_member(), bms_copy(), bms_del_member(), bms_join(), expression_tree_walker, find_minmax_agg_replacement_param(), IsA, lfirst_int, PARAM_EXEC, Param::paramid, finalize_primnode_context::paramids, SubPlan::paramIds, SubPlan::parParam, plan, planner_subplan_get_plan, finalize_primnode_context::root, and SubPlan::testexpr.

Referenced by finalize_agg_primnode(), and finalize_plan().

◆ generate_subquery_params()

static List * generate_subquery_params ( PlannerInfo root,
List tlist,
List **  paramIds 
)
static

Definition at line 593 of file subselect.c.

594 {
595  List *result;
596  List *ids;
597  ListCell *lc;
598 
599  result = ids = NIL;
600  foreach(lc, tlist)
601  {
602  TargetEntry *tent = (TargetEntry *) lfirst(lc);
603  Param *param;
604 
605  if (tent->resjunk)
606  continue;
607 
608  param = generate_new_exec_param(root,
609  exprType((Node *) tent->expr),
610  exprTypmod((Node *) tent->expr),
611  exprCollation((Node *) tent->expr));
612  result = lappend(result, param);
613  ids = lappend_int(ids, param->paramid);
614  }
615 
616  *paramIds = ids;
617  return result;
618 }

References TargetEntry::expr, exprCollation(), exprType(), exprTypmod(), generate_new_exec_param(), lappend(), lappend_int(), lfirst, NIL, and Param::paramid.

Referenced by build_subplan().

◆ generate_subquery_vars()

static List * generate_subquery_vars ( PlannerInfo root,
List tlist,
Index  varno 
)
static

Definition at line 626 of file subselect.c.

627 {
628  List *result;
629  ListCell *lc;
630 
631  result = NIL;
632  foreach(lc, tlist)
633  {
634  TargetEntry *tent = (TargetEntry *) lfirst(lc);
635  Var *var;
636 
637  if (tent->resjunk)
638  continue;
639 
640  var = makeVarFromTargetEntry(varno, tent);
641  result = lappend(result, var);
642  }
643 
644  return result;
645 }
Var * makeVarFromTargetEntry(int varno, TargetEntry *tle)
Definition: makefuncs.c:106
Definition: primnodes.h:226

References lappend(), lfirst, makeVarFromTargetEntry(), and NIL.

Referenced by convert_ANY_sublink_to_join().

◆ get_first_col_type()

static void get_first_col_type ( Plan plan,
Oid coltype,
int32 coltypmod,
Oid colcollation 
)
static

Definition at line 118 of file subselect.c.

120 {
121  /* In cases such as EXISTS, tlist might be empty; arbitrarily use VOID */
122  if (plan->targetlist)
123  {
124  TargetEntry *tent = linitial_node(TargetEntry, plan->targetlist);
125 
126  if (!tent->resjunk)
127  {
128  *coltype = exprType((Node *) tent->expr);
129  *coltypmod = exprTypmod((Node *) tent->expr);
130  *colcollation = exprCollation((Node *) tent->expr);
131  return;
132  }
133  }
134  *coltype = VOIDOID;
135  *coltypmod = -1;
136  *colcollation = InvalidOid;
137 }
#define linitial_node(type, l)
Definition: pg_list.h:181

References TargetEntry::expr, exprCollation(), exprType(), exprTypmod(), InvalidOid, linitial_node, and plan.

Referenced by build_subplan(), SS_make_initplan_from_plan(), and SS_process_ctes().

◆ hash_ok_operator()

static bool hash_ok_operator ( OpExpr expr)
static

Definition at line 845 of file subselect.c.

846 {
847  Oid opid = expr->opno;
848 
849  /* quick out if not a binary operator */
850  if (list_length(expr->args) != 2)
851  return false;
852  if (opid == ARRAY_EQ_OP ||
853  opid == RECORD_EQ_OP)
854  {
855  /* these are strict, but must check input type to ensure hashable */
856  Node *leftarg = linitial(expr->args);
857 
858  return op_hashjoinable(opid, exprType(leftarg));
859  }
860  else
861  {
862  /* else must look up the operator properties */
863  HeapTuple tup;
864  Form_pg_operator optup;
865 
867  if (!HeapTupleIsValid(tup))
868  elog(ERROR, "cache lookup failed for operator %u", opid);
869  optup = (Form_pg_operator) GETSTRUCT(tup);
870  if (!optup->oprcanhash || !func_strict(optup->oprcode))
871  {
872  ReleaseSysCache(tup);
873  return false;
874  }
875  ReleaseSysCache(tup);
876  return true;
877  }
878 }
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
bool op_hashjoinable(Oid opno, Oid inputtype)
Definition: lsyscache.c:1441
bool func_strict(Oid funcid)
Definition: lsyscache.c:1765
FormData_pg_operator * Form_pg_operator
Definition: pg_operator.h:83
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:868
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:820
@ OPEROID
Definition: syscache.h:72

References OpExpr::args, elog(), ERROR, exprType(), func_strict(), GETSTRUCT, HeapTupleIsValid, linitial, list_length(), ObjectIdGetDatum(), op_hashjoinable(), OPEROID, OpExpr::opno, ReleaseSysCache(), and SearchSysCache1().

Referenced by convert_EXISTS_to_ANY(), and test_opexpr_is_hashable().

◆ inline_cte()

static void inline_cte ( PlannerInfo root,
CommonTableExpr cte 
)
static

Definition at line 1151 of file subselect.c.

1152 {
1153  struct inline_cte_walker_context context;
1154 
1155  context.ctename = cte->ctename;
1156  /* Start at levelsup = -1 because we'll immediately increment it */
1157  context.levelsup = -1;
1158  context.ctequery = castNode(Query, cte->ctequery);
1159 
1160  (void) inline_cte_walker((Node *) root->parse, &context);
1161 }
#define castNode(_type_, nodeptr)
Definition: nodes.h:197
const char * ctename
Definition: subselect.c:62
static bool inline_cte_walker(Node *node, inline_cte_walker_context *context)
Definition: subselect.c:1164

References castNode, inline_cte_walker_context::ctename, CommonTableExpr::ctename, inline_cte_walker_context::ctequery, CommonTableExpr::ctequery, inline_cte_walker(), inline_cte_walker_context::levelsup, and PlannerInfo::parse.

Referenced by SS_process_ctes().

◆ inline_cte_walker()

static bool inline_cte_walker ( Node node,
inline_cte_walker_context context 
)
static

Definition at line 1164 of file subselect.c.

1165 {
1166  if (node == NULL)
1167  return false;
1168  if (IsA(node, Query))
1169  {
1170  Query *query = (Query *) node;
1171 
1172  context->levelsup++;
1173 
1174  /*
1175  * Visit the query's RTE nodes after their contents; otherwise
1176  * query_tree_walker would descend into the newly inlined CTE query,
1177  * which we don't want.
1178  */
1179  (void) query_tree_walker(query, inline_cte_walker, context,
1181 
1182  context->levelsup--;
1183 
1184  return false;
1185  }
1186  else if (IsA(node, RangeTblEntry))
1187  {
1188  RangeTblEntry *rte = (RangeTblEntry *) node;
1189 
1190  if (rte->rtekind == RTE_CTE &&
1191  strcmp(rte->ctename, context->ctename) == 0 &&
1192  rte->ctelevelsup == context->levelsup)
1193  {
1194  /*
1195  * Found a reference to replace. Generate a copy of the CTE query
1196  * with appropriate level adjustment for outer references (e.g.,
1197  * to other CTEs).
1198  */
1199  Query *newquery = copyObject(context->ctequery);
1200 
1201  if (context->levelsup > 0)
1202  IncrementVarSublevelsUp((Node *) newquery, context->levelsup, 1);
1203 
1204  /*
1205  * Convert the RTE_CTE RTE into a RTE_SUBQUERY.
1206  *
1207  * Historically, a FOR UPDATE clause has been treated as extending
1208  * into views and subqueries, but not into CTEs. We preserve this
1209  * distinction by not trying to push rowmarks into the new
1210  * subquery.
1211  */
1212  rte->rtekind = RTE_SUBQUERY;
1213  rte->subquery = newquery;
1214  rte->security_barrier = false;
1215 
1216  /* Zero out CTE-specific fields */
1217  rte->ctename = NULL;
1218  rte->ctelevelsup = 0;
1219  rte->self_reference = false;
1220  rte->coltypes = NIL;
1221  rte->coltypmods = NIL;
1222  rte->colcollations = NIL;
1223  }
1224 
1225  return false;
1226  }
1227 
1228  return expression_tree_walker(node, inline_cte_walker, context);
1229 }
#define QTW_EXAMINE_RTES_AFTER
Definition: nodeFuncs.h:28
@ RTE_SUBQUERY
Definition: parsenodes.h:1014
List * colcollations
Definition: parsenodes.h:1187
char * ctename
Definition: parsenodes.h:1163
bool security_barrier
Definition: parsenodes.h:1081
Query * subquery
Definition: parsenodes.h:1080
List * coltypes
Definition: parsenodes.h:1185
List * coltypmods
Definition: parsenodes.h:1186

References RangeTblEntry::colcollations, RangeTblEntry::coltypes, RangeTblEntry::coltypmods, copyObject, RangeTblEntry::ctelevelsup, inline_cte_walker_context::ctename, RangeTblEntry::ctename, inline_cte_walker_context::ctequery, expression_tree_walker, IncrementVarSublevelsUp(), IsA, inline_cte_walker_context::levelsup, NIL, QTW_EXAMINE_RTES_AFTER, query_tree_walker, RTE_CTE, RTE_SUBQUERY, RangeTblEntry::rtekind, RangeTblEntry::security_barrier, RangeTblEntry::self_reference, and RangeTblEntry::subquery.

Referenced by inline_cte().

◆ make_subplan()

static Node* make_subplan ( PlannerInfo root,
Query orig_subquery,
SubLinkType  subLinkType,
int  subLinkId,
Node testexpr,
bool  isTopQual 
)
static

Definition at line 162 of file subselect.c.

165 {
166  Query *subquery;
167  bool simple_exists = false;
168  double tuple_fraction;
169  PlannerInfo *subroot;
170  RelOptInfo *final_rel;
171  Path *best_path;
172  Plan *plan;
173  List *plan_params;
174  Node *result;
175 
176  /*
177  * Copy the source Query node. This is a quick and dirty kluge to resolve
178  * the fact that the parser can generate trees with multiple links to the
179  * same sub-Query node, but the planner wants to scribble on the Query.
180  * Try to clean this up when we do querytree redesign...
181  */
182  subquery = copyObject(orig_subquery);
183 
184  /*
185  * If it's an EXISTS subplan, we might be able to simplify it.
186  */
187  if (subLinkType == EXISTS_SUBLINK)
188  simple_exists = simplify_EXISTS_query(root, subquery);
189 
190  /*
191  * For an EXISTS subplan, tell lower-level planner to expect that only the
192  * first tuple will be retrieved. For ALL and ANY subplans, we will be
193  * able to stop evaluating if the test condition fails or matches, so very
194  * often not all the tuples will be retrieved; for lack of a better idea,
195  * specify 50% retrieval. For EXPR, MULTIEXPR, and ROWCOMPARE subplans,
196  * use default behavior (we're only expecting one row out, anyway).
197  *
198  * NOTE: if you change these numbers, also change cost_subplan() in
199  * path/costsize.c.
200  *
201  * XXX If an ANY subplan is uncorrelated, build_subplan may decide to hash
202  * its output. In that case it would've been better to specify full
203  * retrieval. At present, however, we can only check hashability after
204  * we've made the subplan :-(. (Determining whether it'll fit in hash_mem
205  * is the really hard part.) Therefore, we don't want to be too
206  * optimistic about the percentage of tuples retrieved, for fear of
207  * selecting a plan that's bad for the materialization case.
208  */
209  if (subLinkType == EXISTS_SUBLINK)
210  tuple_fraction = 1.0; /* just like a LIMIT 1 */
211  else if (subLinkType == ALL_SUBLINK ||
212  subLinkType == ANY_SUBLINK)
213  tuple_fraction = 0.5; /* 50% */
214  else
215  tuple_fraction = 0.0; /* default behavior */
216 
217  /* plan_params should not be in use in current query level */
218  Assert(root->plan_params == NIL);
219 
220  /* Generate Paths for the subquery */
221  subroot = subquery_planner(root->glob, subquery,
222  root,
223  false, tuple_fraction);
224 
225  /* Isolate the params needed by this specific subplan */
226  plan_params = root->plan_params;
227  root->plan_params = NIL;
228 
229  /*
230  * Select best Path and turn it into a Plan. At least for now, there
231  * seems no reason to postpone doing that.
232  */
233  final_rel = fetch_upper_rel(subroot, UPPERREL_FINAL, NULL);
234  best_path = get_cheapest_fractional_path(final_rel, tuple_fraction);
235 
236  plan = create_plan(subroot, best_path);
237 
238  /* And convert to SubPlan or InitPlan format. */
239  result = build_subplan(root, plan, subroot, plan_params,
240  subLinkType, subLinkId,
241  testexpr, NIL, isTopQual);
242 
243  /*
244  * If it's a correlated EXISTS with an unimportant targetlist, we might be
245  * able to transform it to the equivalent of an IN and then implement it
246  * by hashing. We don't have enough information yet to tell which way is
247  * likely to be better (it depends on the expected number of executions of
248  * the EXISTS qual, and we are much too early in planning the outer query
249  * to be able to guess that). So we generate both plans, if possible, and
250  * leave it to setrefs.c to decide which to use.
251  */
252  if (simple_exists && IsA(result, SubPlan))
253  {
254  Node *newtestexpr;
255  List *paramIds;
256 
257  /* Make a second copy of the original subquery */
258  subquery = copyObject(orig_subquery);
259  /* and re-simplify */
260  simple_exists = simplify_EXISTS_query(root, subquery);
261  Assert(simple_exists);
262  /* See if it can be converted to an ANY query */
263  subquery = convert_EXISTS_to_ANY(root, subquery,
264  &newtestexpr, &paramIds);
265  if (subquery)
266  {
267  /* Generate Paths for the ANY subquery; we'll need all rows */
268  subroot = subquery_planner(root->glob, subquery,
269  root,
270  false, 0.0);
271 
272  /* Isolate the params needed by this specific subplan */
273  plan_params = root->plan_params;
274  root->plan_params = NIL;
275 
276  /* Select best Path */
277  final_rel = fetch_upper_rel(subroot, UPPERREL_FINAL, NULL);
278  best_path = final_rel->cheapest_total_path;
279 
280  /* Now we can check if it'll fit in hash_mem */
281  if (subpath_is_hashable(best_path))
282  {
283  SubPlan *hashplan;
284  AlternativeSubPlan *asplan;
285 
286  /* OK, finish planning the ANY subquery */
287  plan = create_plan(subroot, best_path);
288 
289  /* ... and convert to SubPlan format */
290  hashplan = castNode(SubPlan,
291  build_subplan(root, plan, subroot,
292  plan_params,
293  ANY_SUBLINK, 0,
294  newtestexpr,
295  paramIds,
296  true));
297  /* Check we got what we expected */
298  Assert(hashplan->parParam == NIL);
299  Assert(hashplan->useHashTable);
300 
301  /* Leave it to setrefs.c to decide which plan to use */
302  asplan = makeNode(AlternativeSubPlan);
303  asplan->subplans = list_make2(result, hashplan);
304  result = (Node *) asplan;
305  root->hasAlternativeSubPlans = true;
306  }
307  }
308  }
309 
310  return result;
311 }
Plan * create_plan(PlannerInfo *root, Path *best_path)
Definition: createplan.c:335
@ UPPERREL_FINAL
Definition: pathnodes.h:79
#define list_make2(x1, x2)
Definition: pg_list.h:214
PlannerInfo * subquery_planner(PlannerGlobal *glob, Query *parse, PlannerInfo *parent_root, bool hasRecursion, double tuple_fraction)
Definition: planner.c:623
Path * get_cheapest_fractional_path(RelOptInfo *rel, double tuple_fraction)
Definition: planner.c:6329
@ ALL_SUBLINK
Definition: primnodes.h:925
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1445
List * plan_params
Definition: pathnodes.h:217
bool hasAlternativeSubPlans
Definition: pathnodes.h:497
struct Path * cheapest_total_path
Definition: pathnodes.h:887
bool useHashTable
Definition: primnodes.h:1006
static Node * build_subplan(PlannerInfo *root, Plan *plan, PlannerInfo *subroot, List *plan_params, SubLinkType subLinkType, int subLinkId, Node *testexpr, List *testexpr_paramids, bool unknownEqFalse)
Definition: subselect.c:320
static Query * convert_EXISTS_to_ANY(PlannerInfo *root, Query *subselect, Node **testexpr, List **paramIds)
Definition: subselect.c:1632
static bool subpath_is_hashable(Path *path)
Definition: subselect.c:749

References ALL_SUBLINK, ANY_SUBLINK, Assert(), build_subplan(), castNode, RelOptInfo::cheapest_total_path, convert_EXISTS_to_ANY(), copyObject, create_plan(), EXISTS_SUBLINK, fetch_upper_rel(), get_cheapest_fractional_path(), PlannerInfo::glob, PlannerInfo::hasAlternativeSubPlans, IsA, list_make2, makeNode, NIL, SubPlan::parParam, plan, PlannerInfo::plan_params, simplify_EXISTS_query(), subpath_is_hashable(), AlternativeSubPlan::subplans, subquery_planner(), UPPERREL_FINAL, and SubPlan::useHashTable.

Referenced by process_sublinks_mutator().

◆ process_sublinks_mutator()

static Node * process_sublinks_mutator ( Node node,
process_sublinks_context context 
)
static

Definition at line 1926 of file subselect.c.

1927 {
1928  process_sublinks_context locContext;
1929 
1930  locContext.root = context->root;
1931 
1932  if (node == NULL)
1933  return NULL;
1934  if (IsA(node, SubLink))
1935  {
1936  SubLink *sublink = (SubLink *) node;
1937  Node *testexpr;
1938 
1939  /*
1940  * First, recursively process the lefthand-side expressions, if any.
1941  * They're not top-level anymore.
1942  */
1943  locContext.isTopQual = false;
1944  testexpr = process_sublinks_mutator(sublink->testexpr, &locContext);
1945 
1946  /*
1947  * Now build the SubPlan node and make the expr to return.
1948  */
1949  return make_subplan(context->root,
1950  (Query *) sublink->subselect,
1951  sublink->subLinkType,
1952  sublink->subLinkId,
1953  testexpr,
1954  context->isTopQual);
1955  }
1956 
1957  /*
1958  * Don't recurse into the arguments of an outer PHV, Aggref or
1959  * GroupingFunc here. Any SubLinks in the arguments have to be dealt with
1960  * at the outer query level; they'll be handled when build_subplan
1961  * collects the PHV, Aggref or GroupingFunc into the arguments to be
1962  * passed down to the current subplan.
1963  */
1964  if (IsA(node, PlaceHolderVar))
1965  {
1966  if (((PlaceHolderVar *) node)->phlevelsup > 0)
1967  return node;
1968  }
1969  else if (IsA(node, Aggref))
1970  {
1971  if (((Aggref *) node)->agglevelsup > 0)
1972  return node;
1973  }
1974  else if (IsA(node, GroupingFunc))
1975  {
1976  if (((GroupingFunc *) node)->agglevelsup > 0)
1977  return node;
1978  }
1979 
1980  /*
1981  * We should never see a SubPlan expression in the input (since this is
1982  * the very routine that creates 'em to begin with). We shouldn't find
1983  * ourselves invoked directly on a Query, either.
1984  */
1985  Assert(!IsA(node, SubPlan));
1986  Assert(!IsA(node, AlternativeSubPlan));
1987  Assert(!IsA(node, Query));
1988 
1989  /*
1990  * Because make_subplan() could return an AND or OR clause, we have to
1991  * take steps to preserve AND/OR flatness of a qual. We assume the input
1992  * has been AND/OR flattened and so we need no recursion here.
1993  *
1994  * (Due to the coding here, we will not get called on the List subnodes of
1995  * an AND; and the input is *not* yet in implicit-AND format. So no check
1996  * is needed for a bare List.)
1997  *
1998  * Anywhere within the top-level AND/OR clause structure, we can tell
1999  * make_subplan() that NULL and FALSE are interchangeable. So isTopQual
2000  * propagates down in both cases. (Note that this is unlike the meaning
2001  * of "top level qual" used in most other places in Postgres.)
2002  */
2003  if (is_andclause(node))
2004  {
2005  List *newargs = NIL;
2006  ListCell *l;
2007 
2008  /* Still at qual top-level */
2009  locContext.isTopQual = context->isTopQual;
2010 
2011  foreach(l, ((BoolExpr *) node)->args)
2012  {
2013  Node *newarg;
2014 
2015  newarg = process_sublinks_mutator(lfirst(l), &locContext);
2016  if (is_andclause(newarg))
2017  newargs = list_concat(newargs, ((BoolExpr *) newarg)->args);
2018  else
2019  newargs = lappend(newargs, newarg);
2020  }
2021  return (Node *) make_andclause(newargs);
2022  }
2023 
2024  if (is_orclause(node))
2025  {
2026  List *newargs = NIL;
2027  ListCell *l;
2028 
2029  /* Still at qual top-level */
2030  locContext.isTopQual = context->isTopQual;
2031 
2032  foreach(l, ((BoolExpr *) node)->args)
2033  {
2034  Node *newarg;
2035 
2036  newarg = process_sublinks_mutator(lfirst(l), &locContext);
2037  if (is_orclause(newarg))
2038  newargs = list_concat(newargs, ((BoolExpr *) newarg)->args);
2039  else
2040  newargs = lappend(newargs, newarg);
2041  }
2042  return (Node *) make_orclause(newargs);
2043  }
2044 
2045  /*
2046  * If we recurse down through anything other than an AND or OR node, we
2047  * are definitely not at top qual level anymore.
2048  */
2049  locContext.isTopQual = false;
2050 
2051  return expression_tree_mutator(node,
2053  (void *) &locContext);
2054 }
List * list_concat(List *list1, const List *list2)
Definition: list.c:560
Expr * make_andclause(List *andclauses)
Definition: makefuncs.c:639
Expr * make_orclause(List *orclauses)
Definition: makefuncs.c:655
static bool is_andclause(const void *clause)
Definition: nodeFuncs.h:105
static bool is_orclause(const void *clause)
Definition: nodeFuncs.h:114
static Node * process_sublinks_mutator(Node *node, process_sublinks_context *context)
Definition: subselect.c:1926
static Node * make_subplan(PlannerInfo *root, Query *orig_subquery, SubLinkType subLinkType, int subLinkId, Node *testexpr, bool isTopQual)
Definition: subselect.c:162

References generate_unaccent_rules::args, Assert(), expression_tree_mutator, is_andclause(), is_orclause(), IsA, process_sublinks_context::isTopQual, lappend(), lfirst, list_concat(), make_andclause(), make_orclause(), make_subplan(), NIL, process_sublinks_context::root, SubLink::subLinkId, SubLink::subLinkType, SubLink::subselect, and SubLink::testexpr.

Referenced by SS_process_sublinks().

◆ replace_correlation_vars_mutator()

static Node * replace_correlation_vars_mutator ( Node node,
PlannerInfo root 
)
static

Definition at line 1878 of file subselect.c.

1879 {
1880  if (node == NULL)
1881  return NULL;
1882  if (IsA(node, Var))
1883  {
1884  if (((Var *) node)->varlevelsup > 0)
1885  return (Node *) replace_outer_var(root, (Var *) node);
1886  }
1887  if (IsA(node, PlaceHolderVar))
1888  {
1889  if (((PlaceHolderVar *) node)->phlevelsup > 0)
1890  return (Node *) replace_outer_placeholdervar(root,
1891  (PlaceHolderVar *) node);
1892  }
1893  if (IsA(node, Aggref))
1894  {
1895  if (((Aggref *) node)->agglevelsup > 0)
1896  return (Node *) replace_outer_agg(root, (Aggref *) node);
1897  }
1898  if (IsA(node, GroupingFunc))
1899  {
1900  if (((GroupingFunc *) node)->agglevelsup > 0)
1901  return (Node *) replace_outer_grouping(root, (GroupingFunc *) node);
1902  }
1903  return expression_tree_mutator(node,
1905  (void *) root);
1906 }
Param * replace_outer_var(PlannerInfo *root, Var *var)
Definition: paramassign.c:119
Param * replace_outer_grouping(PlannerInfo *root, GroupingFunc *grp)
Definition: paramassign.c:269
Param * replace_outer_placeholdervar(PlannerInfo *root, PlaceHolderVar *phv)
Definition: paramassign.c:196
Param * replace_outer_agg(PlannerInfo *root, Aggref *agg)
Definition: paramassign.c:223
static Node * replace_correlation_vars_mutator(Node *node, PlannerInfo *root)
Definition: subselect.c:1878

References expression_tree_mutator, IsA, replace_outer_agg(), replace_outer_grouping(), replace_outer_placeholdervar(), and replace_outer_var().

Referenced by SS_replace_correlation_vars().

◆ simplify_EXISTS_query()

static bool simplify_EXISTS_query ( PlannerInfo root,
Query query 
)
static

Definition at line 1544 of file subselect.c.

1545 {
1546  /*
1547  * We don't try to simplify at all if the query uses set operations,
1548  * aggregates, grouping sets, SRFs, modifying CTEs, HAVING, OFFSET, or FOR
1549  * UPDATE/SHARE; none of these seem likely in normal usage and their
1550  * possible effects are complex. (Note: we could ignore an "OFFSET 0"
1551  * clause, but that traditionally is used as an optimization fence, so we
1552  * don't.)
1553  */
1554  if (query->commandType != CMD_SELECT ||
1555  query->setOperations ||
1556  query->hasAggs ||
1557  query->groupingSets ||
1558  query->hasWindowFuncs ||
1559  query->hasTargetSRFs ||
1560  query->hasModifyingCTE ||
1561  query->havingQual ||
1562  query->limitOffset ||
1563  query->rowMarks)
1564  return false;
1565 
1566  /*
1567  * LIMIT with a constant positive (or NULL) value doesn't affect the
1568  * semantics of EXISTS, so let's ignore such clauses. This is worth doing
1569  * because people accustomed to certain other DBMSes may be in the habit
1570  * of writing EXISTS(SELECT ... LIMIT 1) as an optimization. If there's a
1571  * LIMIT with anything else as argument, though, we can't simplify.
1572  */
1573  if (query->limitCount)
1574  {
1575  /*
1576  * The LIMIT clause has not yet been through eval_const_expressions,
1577  * so we have to apply that here. It might seem like this is a waste
1578  * of cycles, since the only case plausibly worth worrying about is
1579  * "LIMIT 1" ... but what we'll actually see is "LIMIT int8(1::int4)",
1580  * so we have to fold constants or we're not going to recognize it.
1581  */
1582  Node *node = eval_const_expressions(root, query->limitCount);
1583  Const *limit;
1584 
1585  /* Might as well update the query if we simplified the clause. */
1586  query->limitCount = node;
1587 
1588  if (!IsA(node, Const))
1589  return false;
1590 
1591  limit = (Const *) node;
1592  Assert(limit->consttype == INT8OID);
1593  if (!limit->constisnull && DatumGetInt64(limit->constvalue) <= 0)
1594  return false;
1595 
1596  /* Whether or not the targetlist is safe, we can drop the LIMIT. */
1597  query->limitCount = NULL;
1598  }
1599 
1600  /*
1601  * Otherwise, we can throw away the targetlist, as well as any GROUP,
1602  * WINDOW, DISTINCT, and ORDER BY clauses; none of those clauses will
1603  * change a nonzero-rows result to zero rows or vice versa. (Furthermore,
1604  * since our parsetree representation of these clauses depends on the
1605  * targetlist, we'd better throw them away if we drop the targetlist.)
1606  */
1607  query->targetList = NIL;
1608  query->groupClause = NIL;
1609  query->windowClause = NIL;
1610  query->distinctClause = NIL;
1611  query->sortClause = NIL;
1612  query->hasDistinctOn = false;
1613 
1614  return true;
1615 }
static int64 DatumGetInt64(Datum X)
Definition: postgres.h:385
Oid consttype
Definition: primnodes.h:290
Node * limitCount
Definition: parsenodes.h:211
Node * setOperations
Definition: parsenodes.h:216
List * groupClause
Definition: parsenodes.h:197
Node * havingQual
Definition: parsenodes.h:202
Node * limitOffset
Definition: parsenodes.h:210
List * windowClause
Definition: parsenodes.h:204
List * groupingSets
Definition: parsenodes.h:200
List * distinctClause
Definition: parsenodes.h:206
List * sortClause
Definition: parsenodes.h:208

References Assert(), CMD_SELECT, Query::commandType, Const::consttype, DatumGetInt64(), Query::distinctClause, eval_const_expressions(), Query::groupClause, Query::groupingSets, Query::havingQual, IsA, Query::limitCount, Query::limitOffset, NIL, Query::rowMarks, Query::setOperations, Query::sortClause, Query::targetList, and Query::windowClause.

Referenced by convert_EXISTS_sublink_to_join(), and make_subplan().

◆ SS_attach_initplans()

void SS_attach_initplans ( PlannerInfo root,
Plan plan 
)

Definition at line 2236 of file subselect.c.

2237 {
2238  plan->initPlan = root->init_plans;
2239 }

References PlannerInfo::init_plans, and plan.

Referenced by create_plan().

◆ SS_charge_for_initplans()

void SS_charge_for_initplans ( PlannerInfo root,
RelOptInfo final_rel 
)

Definition at line 2131 of file subselect.c.

2132 {
2133  Cost initplan_cost;
2134  bool unsafe_initplans;
2135  ListCell *lc;
2136 
2137  /* Nothing to do if no initPlans */
2138  if (root->init_plans == NIL)
2139  return;
2140 
2141  /*
2142  * Compute the cost increment just once, since it will be the same for all
2143  * Paths. Also check for parallel-unsafe initPlans.
2144  */
2146  &initplan_cost, &unsafe_initplans);
2147 
2148  /*
2149  * Now adjust the costs and parallel_safe flags.
2150  */
2151  foreach(lc, final_rel->pathlist)
2152  {
2153  Path *path = (Path *) lfirst(lc);
2154 
2155  path->startup_cost += initplan_cost;
2156  path->total_cost += initplan_cost;
2157  if (unsafe_initplans)
2158  path->parallel_safe = false;
2159  }
2160 
2161  /*
2162  * Adjust partial paths' costs too, or forget them entirely if we must
2163  * consider the rel parallel-unsafe.
2164  */
2165  if (unsafe_initplans)
2166  {
2167  final_rel->partial_pathlist = NIL;
2168  final_rel->consider_parallel = false;
2169  }
2170  else
2171  {
2172  foreach(lc, final_rel->partial_pathlist)
2173  {
2174  Path *path = (Path *) lfirst(lc);
2175 
2176  path->startup_cost += initplan_cost;
2177  path->total_cost += initplan_cost;
2178  }
2179  }
2180 
2181  /* We needn't do set_cheapest() here, caller will do it */
2182 }
double Cost
Definition: nodes.h:262
Cost startup_cost
Definition: pathnodes.h:1629
Cost total_cost
Definition: pathnodes.h:1630
bool parallel_safe
Definition: pathnodes.h:1623
bool consider_parallel
Definition: pathnodes.h:872
List * pathlist
Definition: pathnodes.h:883
List * partial_pathlist
Definition: pathnodes.h:885
void SS_compute_initplan_cost(List *init_plans, Cost *initplan_cost_p, bool *unsafe_initplans_p)
Definition: subselect.c:2195

References RelOptInfo::consider_parallel, PlannerInfo::init_plans, lfirst, NIL, Path::parallel_safe, RelOptInfo::partial_pathlist, RelOptInfo::pathlist, SS_compute_initplan_cost(), Path::startup_cost, and Path::total_cost.

Referenced by build_minmax_path(), and subquery_planner().

◆ SS_compute_initplan_cost()

void SS_compute_initplan_cost ( List init_plans,
Cost initplan_cost_p,
bool unsafe_initplans_p 
)

Definition at line 2195 of file subselect.c.

2198 {
2199  Cost initplan_cost;
2200  bool unsafe_initplans;
2201  ListCell *lc;
2202 
2203  /*
2204  * We assume each initPlan gets run once during top plan startup. This is
2205  * a conservative overestimate, since in fact an initPlan might be
2206  * executed later than plan startup, or even not at all.
2207  */
2208  initplan_cost = 0;
2209  unsafe_initplans = false;
2210  foreach(lc, init_plans)
2211  {
2212  SubPlan *initsubplan = lfirst_node(SubPlan, lc);
2213 
2214  initplan_cost += initsubplan->startup_cost + initsubplan->per_call_cost;
2215  if (!initsubplan->parallel_safe)
2216  unsafe_initplans = true;
2217  }
2218  *initplan_cost_p = initplan_cost;
2219  *unsafe_initplans_p = unsafe_initplans;
2220 }
#define lfirst_node(type, lc)
Definition: pg_list.h:176
bool parallel_safe
Definition: primnodes.h:1011
Cost startup_cost
Definition: primnodes.h:1020
Cost per_call_cost
Definition: primnodes.h:1021

References lfirst_node, SubPlan::parallel_safe, SubPlan::per_call_cost, and SubPlan::startup_cost.

Referenced by clean_up_removed_plan_level(), materialize_finished_plan(), SS_charge_for_initplans(), and standard_planner().

◆ SS_finalize_plan()

void SS_finalize_plan ( PlannerInfo root,
Plan plan 
)

Definition at line 2251 of file subselect.c.

2252 {
2253  /* No setup needed, just recurse through plan tree. */
2254  (void) finalize_plan(root, plan, -1, root->outer_params, NULL);
2255 }

References finalize_plan(), PlannerInfo::outer_params, and plan.

Referenced by standard_planner().

◆ SS_identify_outer_params()

void SS_identify_outer_params ( PlannerInfo root)

Definition at line 2069 of file subselect.c.

2070 {
2071  Bitmapset *outer_params;
2072  PlannerInfo *proot;
2073  ListCell *l;
2074 
2075  /*
2076  * If no parameters have been assigned anywhere in the tree, we certainly
2077  * don't need to do anything here.
2078  */
2079  if (root->glob->paramExecTypes == NIL)
2080  return;
2081 
2082  /*
2083  * Scan all query levels above this one to see which parameters are due to
2084  * be available from them, either because lower query levels have
2085  * requested them (via plan_params) or because they will be available from
2086  * initPlans of those levels.
2087  */
2088  outer_params = NULL;
2089  for (proot = root->parent_root; proot != NULL; proot = proot->parent_root)
2090  {
2091  /* Include ordinary Var/PHV/Aggref/GroupingFunc params */
2092  foreach(l, proot->plan_params)
2093  {
2094  PlannerParamItem *pitem = (PlannerParamItem *) lfirst(l);
2095 
2096  outer_params = bms_add_member(outer_params, pitem->paramId);
2097  }
2098  /* Include any outputs of outer-level initPlans */
2099  foreach(l, proot->init_plans)
2100  {
2101  SubPlan *initsubplan = (SubPlan *) lfirst(l);
2102  ListCell *l2;
2103 
2104  foreach(l2, initsubplan->setParam)
2105  {
2106  outer_params = bms_add_member(outer_params, lfirst_int(l2));
2107  }
2108  }
2109  /* Include worktable ID, if a recursive query is being planned */
2110  if (proot->wt_param_id >= 0)
2111  outer_params = bms_add_member(outer_params, proot->wt_param_id);
2112  }
2113  root->outer_params = outer_params;
2114 }
List * paramExecTypes
Definition: pathnodes.h:135
int wt_param_id
Definition: pathnodes.h:521

References bms_add_member(), PlannerInfo::glob, PlannerInfo::init_plans, lfirst, lfirst_int, NIL, PlannerInfo::outer_params, PlannerGlobal::paramExecTypes, PlannerParamItem::paramId, PlannerInfo::plan_params, SubPlan::setParam, and PlannerInfo::wt_param_id.

Referenced by build_minmax_path(), and subquery_planner().

◆ SS_make_initplan_from_plan()

void SS_make_initplan_from_plan ( PlannerInfo root,
PlannerInfo subroot,
Plan plan,
Param prm 
)

Definition at line 3014 of file subselect.c.

3017 {
3018  SubPlan *node;
3019 
3020  /*
3021  * Add the subplan and its PlannerInfo to the global lists.
3022  */
3023  root->glob->subplans = lappend(root->glob->subplans, plan);
3024  root->glob->subroots = lappend(root->glob->subroots, subroot);
3025 
3026  /*
3027  * Create a SubPlan node and add it to the outer list of InitPlans. Note
3028  * it has to appear after any other InitPlans it might depend on (see
3029  * comments in ExecReScan).
3030  */
3031  node = makeNode(SubPlan);
3032  node->subLinkType = EXPR_SUBLINK;
3033  node->plan_id = list_length(root->glob->subplans);
3034  node->plan_name = psprintf("InitPlan %d (returns $%d)",
3035  node->plan_id, prm->paramid);
3037  &node->firstColCollation);
3038  node->parallel_safe = plan->parallel_safe;
3039  node->setParam = list_make1_int(prm->paramid);
3040 
3041  root->init_plans = lappend(root->init_plans, node);
3042 
3043  /*
3044  * The node can't have any inputs (since it's an initplan), so the
3045  * parParam and args lists remain empty.
3046  */
3047 
3048  /* Set costs of SubPlan using info from the plan tree */
3049  cost_subplan(subroot, node, plan);
3050 }
char * psprintf(const char *fmt,...)
Definition: psprintf.c:46
int plan_id
Definition: primnodes.h:997
char * plan_name
Definition: primnodes.h:999
int32 firstColTypmod
Definition: primnodes.h:1002
Oid firstColCollation
Definition: primnodes.h:1003
SubLinkType subLinkType
Definition: primnodes.h:992
Oid firstColType
Definition: primnodes.h:1001

References cost_subplan(), EXPR_SUBLINK, SubPlan::firstColCollation, SubPlan::firstColType, SubPlan::firstColTypmod, get_first_col_type(), PlannerInfo::glob, PlannerInfo::init_plans, lappend(), list_length(), list_make1_int, makeNode, SubPlan::parallel_safe, Param::paramid, plan, SubPlan::plan_id, SubPlan::plan_name, psprintf(), SubPlan::setParam, SubPlan::subLinkType, and PlannerGlobal::subplans.

Referenced by create_minmaxagg_plan().

◆ SS_make_initplan_output_param()

Param* SS_make_initplan_output_param ( PlannerInfo root,
Oid  resulttype,
int32  resulttypmod,
Oid  resultcollation 
)

Definition at line 2998 of file subselect.c.

3001 {
3002  return generate_new_exec_param(root, resulttype,
3003  resulttypmod, resultcollation);
3004 }

References generate_new_exec_param().

Referenced by preprocess_minmax_aggregates().

◆ SS_process_ctes()

void SS_process_ctes ( PlannerInfo root)

Definition at line 893 of file subselect.c.

894 {
895  ListCell *lc;
896 
897  Assert(root->cte_plan_ids == NIL);
898 
899  foreach(lc, root->parse->cteList)
900  {
901  CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
902  CmdType cmdType = ((Query *) cte->ctequery)->commandType;
903  Query *subquery;
904  PlannerInfo *subroot;
905  RelOptInfo *final_rel;
906  Path *best_path;
907  Plan *plan;
908  SubPlan *splan;
909  int paramid;
910 
911  /*
912  * Ignore SELECT CTEs that are not actually referenced anywhere.
913  */
914  if (cte->cterefcount == 0 && cmdType == CMD_SELECT)
915  {
916  /* Make a dummy entry in cte_plan_ids */
917  root->cte_plan_ids = lappend_int(root->cte_plan_ids, -1);
918  continue;
919  }
920 
921  /*
922  * Consider inlining the CTE (creating RTE_SUBQUERY RTE(s)) instead of
923  * implementing it as a separately-planned CTE.
924  *
925  * We cannot inline if any of these conditions hold:
926  *
927  * 1. The user said not to (the CTEMaterializeAlways option).
928  *
929  * 2. The CTE is recursive.
930  *
931  * 3. The CTE has side-effects; this includes either not being a plain
932  * SELECT, or containing volatile functions. Inlining might change
933  * the side-effects, which would be bad.
934  *
935  * 4. The CTE is multiply-referenced and contains a self-reference to
936  * a recursive CTE outside itself. Inlining would result in multiple
937  * recursive self-references, which we don't support.
938  *
939  * Otherwise, we have an option whether to inline or not. That should
940  * always be a win if there's just a single reference, but if the CTE
941  * is multiply-referenced then it's unclear: inlining adds duplicate
942  * computations, but the ability to absorb restrictions from the outer
943  * query level could outweigh that. We do not have nearly enough
944  * information at this point to tell whether that's true, so we let
945  * the user express a preference. Our default behavior is to inline
946  * only singly-referenced CTEs, but a CTE marked CTEMaterializeNever
947  * will be inlined even if multiply referenced.
948  *
949  * Note: we check for volatile functions last, because that's more
950  * expensive than the other tests needed.
951  */
952  if ((cte->ctematerialized == CTEMaterializeNever ||
954  cte->cterefcount == 1)) &&
955  !cte->cterecursive &&
956  cmdType == CMD_SELECT &&
957  !contain_dml(cte->ctequery) &&
958  (cte->cterefcount <= 1 ||
961  {
962  inline_cte(root, cte);
963  /* Make a dummy entry in cte_plan_ids */
964  root->cte_plan_ids = lappend_int(root->cte_plan_ids, -1);
965  continue;
966  }
967 
968  /*
969  * Copy the source Query node. Probably not necessary, but let's keep
970  * this similar to make_subplan.
971  */
972  subquery = (Query *) copyObject(cte->ctequery);
973 
974  /* plan_params should not be in use in current query level */
975  Assert(root->plan_params == NIL);
976 
977  /*
978  * Generate Paths for the CTE query. Always plan for full retrieval
979  * --- we don't have enough info to predict otherwise.
980  */
981  subroot = subquery_planner(root->glob, subquery,
982  root,
983  cte->cterecursive, 0.0);
984 
985  /*
986  * Since the current query level doesn't yet contain any RTEs, it
987  * should not be possible for the CTE to have requested parameters of
988  * this level.
989  */
990  if (root->plan_params)
991  elog(ERROR, "unexpected outer reference in CTE query");
992 
993  /*
994  * Select best Path and turn it into a Plan. At least for now, there
995  * seems no reason to postpone doing that.
996  */
997  final_rel = fetch_upper_rel(subroot, UPPERREL_FINAL, NULL);
998  best_path = final_rel->cheapest_total_path;
999 
1000  plan = create_plan(subroot, best_path);
1001 
1002  /*
1003  * Make a SubPlan node for it. This is just enough unlike
1004  * build_subplan that we can't share code.
1005  *
1006  * Note plan_id, plan_name, and cost fields are set further down.
1007  */
1008  splan = makeNode(SubPlan);
1009  splan->subLinkType = CTE_SUBLINK;
1010  splan->testexpr = NULL;
1011  splan->paramIds = NIL;
1012  get_first_col_type(plan, &splan->firstColType, &splan->firstColTypmod,
1013  &splan->firstColCollation);
1014  splan->useHashTable = false;
1015  splan->unknownEqFalse = false;
1016 
1017  /*
1018  * CTE scans are not considered for parallelism (cf
1019  * set_rel_consider_parallel).
1020  */
1021  splan->parallel_safe = false;
1022  splan->setParam = NIL;
1023  splan->parParam = NIL;
1024  splan->args = NIL;
1025 
1026  /*
1027  * The node can't have any inputs (since it's an initplan), so the
1028  * parParam and args lists remain empty. (It could contain references
1029  * to earlier CTEs' output param IDs, but CTE outputs are not
1030  * propagated via the args list.)
1031  */
1032 
1033  /*
1034  * Assign a param ID to represent the CTE's output. No ordinary
1035  * "evaluation" of this param slot ever happens, but we use the param
1036  * ID for setParam/chgParam signaling just as if the CTE plan were
1037  * returning a simple scalar output. (Also, the executor abuses the
1038  * ParamExecData slot for this param ID for communication among
1039  * multiple CteScan nodes that might be scanning this CTE.)
1040  */
1041  paramid = assign_special_exec_param(root);
1042  splan->setParam = list_make1_int(paramid);
1043 
1044  /*
1045  * Add the subplan and its PlannerInfo to the global lists.
1046  */
1047  root->glob->subplans = lappend(root->glob->subplans, plan);
1048  root->glob->subroots = lappend(root->glob->subroots, subroot);
1049  splan->plan_id = list_length(root->glob->subplans);
1050 
1051  root->init_plans = lappend(root->init_plans, splan);
1052 
1053  root->cte_plan_ids = lappend_int(root->cte_plan_ids, splan->plan_id);
1054 
1055  /* Label the subplan for EXPLAIN purposes */
1056  splan->plan_name = psprintf("CTE %s", cte->ctename);
1057 
1058  /* Lastly, fill in the cost estimates for use later */
1059  cost_subplan(root, splan, plan);
1060  }
1061 }
CmdType
Definition: nodes.h:274
int assign_special_exec_param(PlannerInfo *root)
Definition: paramassign.c:612
@ CTEMaterializeNever
Definition: parsenodes.h:1595
@ CTEMaterializeDefault
Definition: parsenodes.h:1593
@ CTE_SUBLINK
Definition: primnodes.h:931
CTEMaterialize ctematerialized
Definition: parsenodes.h:1634
List * cte_plan_ids
Definition: pathnodes.h:302
static bool contain_outer_selfref(Node *node)
Definition: subselect.c:1096
static bool contain_dml(Node *node)
Definition: subselect.c:1069
static void inline_cte(PlannerInfo *root, CommonTableExpr *cte)
Definition: subselect.c:1151

References Assert(), assign_special_exec_param(), RelOptInfo::cheapest_total_path, CMD_SELECT, contain_dml(), contain_outer_selfref(), contain_volatile_functions(), copyObject, cost_subplan(), create_plan(), PlannerInfo::cte_plan_ids, CTE_SUBLINK, Query::cteList, CommonTableExpr::ctematerialized, CTEMaterializeDefault, CTEMaterializeNever, CommonTableExpr::ctename, CommonTableExpr::ctequery, elog(), ERROR, fetch_upper_rel(), get_first_col_type(), PlannerInfo::glob, PlannerInfo::init_plans, inline_cte(), lappend(), lappend_int(), lfirst, list_length(), list_make1_int, makeNode, NIL, PlannerInfo::parse, plan, PlannerInfo::plan_params, psprintf(), splan, PlannerGlobal::subplans, subquery_planner(), and UPPERREL_FINAL.

Referenced by subquery_planner().

◆ SS_process_sublinks()

Node* SS_process_sublinks ( PlannerInfo root,
Node expr,
bool  isQual 
)

Definition at line 1916 of file subselect.c.

1917 {
1918  process_sublinks_context context;
1919 
1920  context.root = root;
1921  context.isTopQual = isQual;
1922  return process_sublinks_mutator(expr, &context);
1923 }

References process_sublinks_context::isTopQual, process_sublinks_mutator(), and process_sublinks_context::root.

Referenced by build_subplan(), and preprocess_expression().

◆ SS_replace_correlation_vars()

Node* SS_replace_correlation_vars ( PlannerInfo root,
Node expr 
)

Definition at line 1871 of file subselect.c.

1872 {
1873  /* No setup needed for tree walk, so away we go */
1874  return replace_correlation_vars_mutator(expr, root);
1875 }

References replace_correlation_vars_mutator().

Referenced by preprocess_expression().

◆ subpath_is_hashable()

static bool subpath_is_hashable ( Path path)
static

Definition at line 749 of file subselect.c.

750 {
751  double subquery_size;
752 
753  /*
754  * The estimated size of the subquery result must fit in hash_mem. (Note:
755  * we use heap tuple overhead here even though the tuples will actually be
756  * stored as MinimalTuples; this provides some fudge factor for hashtable
757  * overhead.)
758  */
759  subquery_size = path->rows *
760  (MAXALIGN(path->pathtarget->width) + MAXALIGN(SizeofHeapTupleHeader));
761  if (subquery_size > get_hash_memory_limit())
762  return false;
763 
764  return true;
765 }
#define MAXALIGN(LEN)
Definition: c.h:800
#define SizeofHeapTupleHeader
Definition: htup_details.h:185
size_t get_hash_memory_limit(void)
Definition: nodeHash.c:3592
Cardinality rows
Definition: pathnodes.h:1628

References get_hash_memory_limit(), MAXALIGN, Path::rows, and SizeofHeapTupleHeader.

Referenced by make_subplan().

◆ subplan_is_hashable()

static bool subplan_is_hashable ( Plan plan)
static

Definition at line 725 of file subselect.c.

726 {
727  double subquery_size;
728 
729  /*
730  * The estimated size of the subquery result must fit in hash_mem. (Note:
731  * we use heap tuple overhead here even though the tuples will actually be
732  * stored as MinimalTuples; this provides some fudge factor for hashtable
733  * overhead.)
734  */
735  subquery_size = plan->plan_rows *
736  (MAXALIGN(plan->plan_width) + MAXALIGN(SizeofHeapTupleHeader));
737  if (subquery_size > get_hash_memory_limit())
738  return false;
739 
740  return true;
741 }

References get_hash_memory_limit(), MAXALIGN, plan, and SizeofHeapTupleHeader.

Referenced by build_subplan().

◆ test_opexpr_is_hashable()

static bool test_opexpr_is_hashable ( OpExpr testexpr,
List param_ids 
)
static

Definition at line 805 of file subselect.c.

806 {
807  /*
808  * The combining operator must be hashable and strict. The need for
809  * hashability is obvious, since we want to use hashing. Without
810  * strictness, behavior in the presence of nulls is too unpredictable. We
811  * actually must assume even more than plain strictness: it can't yield
812  * NULL for non-null inputs, either (see nodeSubplan.c). However, hash
813  * indexes and hash joins assume that too.
814  */
815  if (!hash_ok_operator(testexpr))
816  return false;
817 
818  /*
819  * The left and right inputs must belong to the outer and inner queries
820  * respectively; hence Params that will be supplied by the subquery must
821  * not appear in the LHS, and Vars of the outer query must not appear in
822  * the RHS. (Ordinarily, this must be true because of the way that the
823  * parser builds an ANY SubLink's testexpr ... but inlining of functions
824  * could have changed the expression's structure, so we have to check.
825  * Such cases do not occur often enough to be worth trying to optimize, so
826  * we don't worry about trying to commute the clause or anything like
827  * that; we just need to be sure not to build an invalid plan.)
828  */
829  if (list_length(testexpr->args) != 2)
830  return false;
831  if (contain_exec_param((Node *) linitial(testexpr->args), param_ids))
832  return false;
833  if (contain_var_clause((Node *) lsecond(testexpr->args)))
834  return false;
835  return true;
836 }
bool contain_exec_param(Node *clause, List *param_ids)
Definition: clauses.c:1054
bool contain_var_clause(Node *node)
Definition: var.c:403

References OpExpr::args, contain_exec_param(), contain_var_clause(), hash_ok_operator(), linitial, list_length(), and lsecond.

Referenced by testexpr_is_hashable().

◆ testexpr_is_hashable()

static bool testexpr_is_hashable ( Node testexpr,
List param_ids 
)
static

Definition at line 774 of file subselect.c.

775 {
776  /*
777  * The testexpr must be a single OpExpr, or an AND-clause containing only
778  * OpExprs, each of which satisfy test_opexpr_is_hashable().
779  */
780  if (testexpr && IsA(testexpr, OpExpr))
781  {
782  if (test_opexpr_is_hashable((OpExpr *) testexpr, param_ids))
783  return true;
784  }
785  else if (is_andclause(testexpr))
786  {
787  ListCell *l;
788 
789  foreach(l, ((BoolExpr *) testexpr)->args)
790  {
791  Node *andarg = (Node *) lfirst(l);
792 
793  if (!IsA(andarg, OpExpr))
794  return false;
795  if (!test_opexpr_is_hashable((OpExpr *) andarg, param_ids))
796  return false;
797  }
798  return true;
799  }
800 
801  return false;
802 }
static bool test_opexpr_is_hashable(OpExpr *testexpr, List *param_ids)
Definition: subselect.c:805

References generate_unaccent_rules::args, is_andclause(), IsA, lfirst, and test_opexpr_is_hashable().

Referenced by build_subplan().