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_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 321 of file subselect.c.

References ANY_SUBLINK, arg, SubPlan::args, ARRAY_SUBLINK, Assert, bms_add_member(), convert_testexpr(), cost_subplan(), elog, enable_material, ERROR, ExecMaterializesOutput(), EXISTS_SUBLINK, TargetEntry::expr, EXPR_SUBLINK, exprCollation(), exprType(), exprTypmod(), SubPlan::firstColCollation, SubPlan::firstColType, SubPlan::firstColTypmod, 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(), Plan::parallel_safe, SubPlan::parallel_safe, Param::paramid, PlannerParamItem::paramId, SubPlan::paramIds, SubPlan::parParam, SubPlan::plan_id, SubPlan::plan_name, TargetEntry::resjunk, PlannerGlobal::rewindPlanIDs, ROWCOMPARE_SUBLINK, SubPlan::setParam, splan, sprintf, SS_process_sublinks(), SubPlan::subLinkType, subplan_is_hashable(), PlannerGlobal::subplans, PlannerGlobal::subroots, Plan::targetlist, SubPlan::testexpr, testexpr_is_hashable(), SubPlan::unknownEqFalse, and SubPlan::useHashTable.

Referenced by make_subplan().

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

◆ contain_dml()

static bool contain_dml ( Node node)
static

Definition at line 1071 of file subselect.c.

References contain_dml_walker().

Referenced by SS_process_ctes().

1072 {
1073  return contain_dml_walker(node, NULL);
1074 }
static bool contain_dml_walker(Node *node, void *context)
Definition: subselect.c:1077

◆ contain_dml_walker()

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

Definition at line 1077 of file subselect.c.

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

Referenced by contain_dml().

1078 {
1079  if (node == NULL)
1080  return false;
1081  if (IsA(node, Query))
1082  {
1083  Query *query = (Query *) node;
1084 
1085  if (query->commandType != CMD_SELECT ||
1086  query->rowMarks != NIL)
1087  return true;
1088 
1089  return query_tree_walker(query, contain_dml_walker, context, 0);
1090  }
1091  return expression_tree_walker(node, contain_dml_walker, context);
1092 }
#define NIL
Definition: pg_list.h:65
bool query_tree_walker(Query *query, bool(*walker)(), void *context, int flags)
Definition: nodeFuncs.c:2355
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
static bool contain_dml_walker(Node *node, void *context)
Definition: subselect.c:1077
List * rowMarks
Definition: parsenodes.h:175
CmdType commandType
Definition: parsenodes.h:120
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1904

◆ contain_outer_selfref()

static bool contain_outer_selfref ( Node node)
static

Definition at line 1098 of file subselect.c.

References Assert, contain_outer_selfref_walker(), and IsA.

Referenced by SS_process_ctes().

1099 {
1100  Index depth = 0;
1101 
1102  /*
1103  * We should be starting with a Query, so that depth will be 1 while
1104  * examining its immediate contents.
1105  */
1106  Assert(IsA(node, Query));
1107 
1108  return contain_outer_selfref_walker(node, &depth);
1109 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
unsigned int Index
Definition: c.h:549
#define Assert(condition)
Definition: c.h:804
static bool contain_outer_selfref_walker(Node *node, Index *depth)
Definition: subselect.c:1112

◆ contain_outer_selfref_walker()

static bool contain_outer_selfref_walker ( Node node,
Index depth 
)
static

Definition at line 1112 of file subselect.c.

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().

1113 {
1114  if (node == NULL)
1115  return false;
1116  if (IsA(node, RangeTblEntry))
1117  {
1118  RangeTblEntry *rte = (RangeTblEntry *) node;
1119 
1120  /*
1121  * Check for a self-reference to a CTE that's above the Query that our
1122  * search started at.
1123  */
1124  if (rte->rtekind == RTE_CTE &&
1125  rte->self_reference &&
1126  rte->ctelevelsup >= *depth)
1127  return true;
1128  return false; /* allow range_table_walker to continue */
1129  }
1130  if (IsA(node, Query))
1131  {
1132  /* Recurse into subquery, tracking nesting depth properly */
1133  Query *query = (Query *) node;
1134  bool result;
1135 
1136  (*depth)++;
1137 
1139  (void *) depth, QTW_EXAMINE_RTES_BEFORE);
1140 
1141  (*depth)--;
1142 
1143  return result;
1144  }
1146  (void *) depth);
1147 }
bool query_tree_walker(Query *query, bool(*walker)(), void *context, int flags)
Definition: nodeFuncs.c:2355
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
#define QTW_EXAMINE_RTES_BEFORE
Definition: nodeFuncs.h:25
bool self_reference
Definition: parsenodes.h:1107
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1904
Index ctelevelsup
Definition: parsenodes.h:1106
RTEKind rtekind
Definition: parsenodes.h:995
static bool contain_outer_selfref_walker(Node *node, Index *depth)
Definition: subselect.c:1112

◆ convert_ANY_sublink_to_join()

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

Definition at line 1276 of file subselect.c.

References addRangeTableEntryForSubquery(), JoinExpr::alias, 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::join_using_alias, JoinExpr::jointype, lappend(), JoinExpr::larg, list_length(), make_parsestate(), makeAlias(), makeNode, NIL, parse(), PlannerInfo::parse, pull_varnos(), JoinExpr::quals, JoinExpr::rarg, Query::rtable, JoinExpr::rtindex, SubLink::subLinkType, SubLink::subselect, SubLink::testexpr, and JoinExpr::usingClause.

Referenced by pull_up_sublinks_qual_recurse().

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

◆ convert_EXISTS_sublink_to_join()

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

Definition at line 1384 of file subselect.c.

References JoinExpr::alias, Assert, bms_add_member(), bms_first_member(), bms_free(), bms_is_empty(), bms_is_subset(), contain_vars_of_level(), contain_volatile_functions(), copyObject, Query::cteList, EXISTS_SUBLINK, IncrementVarSublevelsUp(), JoinExpr::isNatural, JOIN_ANTI, JOIN_SEMI, JoinExpr::join_using_alias, Query::jointree, JoinExpr::jointype, JoinExpr::larg, linitial, list_concat(), 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, SubLink::subselect, and JoinExpr::usingClause.

Referenced by pull_up_sublinks_qual_recurse().

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

◆ convert_EXISTS_to_ANY()

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

Definition at line 1636 of file subselect.c.

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(), Query::hasAggs, hash_ok_operator(), IncrementVarSublevelsUp(), OpExpr::inputcollid, 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, PlannerInfo::parse, FromExpr::quals, and Query::targetList.

Referenced by make_subplan().

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

◆ convert_testexpr()

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

Definition at line 654 of file subselect.c.

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

Referenced by build_subplan(), and convert_ANY_sublink_to_join().

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

◆ convert_testexpr_mutator()

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

Definition at line 666 of file subselect.c.

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().

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

◆ finalize_agg_primnode()

static bool finalize_agg_primnode ( Node node,
finalize_primnode_context context 
)
static

Definition at line 2915 of file subselect.c.

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

Referenced by finalize_plan().

2916 {
2917  if (node == NULL)
2918  return false;
2919  if (IsA(node, Aggref))
2920  {
2921  Aggref *agg = (Aggref *) node;
2922 
2923  /* we should not consider the direct arguments, if any */
2924  finalize_primnode((Node *) agg->args, context);
2925  finalize_primnode((Node *) agg->aggfilter, context);
2926  return false; /* there can't be any Aggrefs below here */
2927  }
2929  (void *) context);
2930 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
Definition: nodes.h:539
List * args
Definition: primnodes.h:330
static bool finalize_primnode(Node *node, finalize_primnode_context *context)
Definition: subselect.c:2850
static bool finalize_agg_primnode(Node *node, finalize_primnode_context *context)
Definition: subselect.c:2915
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1904
Expr * aggfilter
Definition: primnodes.h:333

◆ finalize_plan()

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

Definition at line 2239 of file subselect.c.

References AGG_HASHED, Agg::aggParams, Agg::aggstrategy, Plan::allParam, Assert, bms_add_member(), bms_add_members(), bms_copy(), bms_del_member(), bms_del_members(), bms_difference(), bms_free(), bms_is_empty(), 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, RangeTblFunction::funcparams, FunctionScan::functions, PlannerInfo::glob, Plan::initPlan, Plan::lefttree, lfirst, lfirst_int, list_length(), list_nth(), nodeTag, ModifyTable::onConflictSet, ModifyTable::onConflictWhere, PlannerInfo::outer_params, Plan::parallel_aware, finalize_primnode_context::paramids, NestLoopParam::paramno, Agg::plan, planner_subplan_get_plan, Plan::qual, ModifyTable::returningLists, Plan::righttree, convert_testexpr_context::root, finalize_primnode_context::root, SubqueryScan::scan, Scan::scanrelid, SubPlan::setParam, SubqueryScan::subplan, PlannerGlobal::subplans, RelOptInfo::subroot, T_Agg, T_Append, T_BitmapAnd, T_BitmapHeapScan, T_BitmapIndexScan, T_BitmapOr, T_CteScan, T_CustomScan, T_ForeignScan, T_FunctionScan, T_Gather, T_GatherMerge, T_Group, T_Hash, T_HashJoin, T_IncrementalSort, T_IndexOnlyScan, T_IndexScan, T_Limit, T_LockRows, T_Material, T_MergeAppend, T_MergeJoin, T_ModifyTable, T_NamedTuplestoreScan, T_NestLoop, T_ProjectSet, T_RecursiveUnion, T_Result, T_ResultCache, T_SampleScan, T_SeqScan, T_SetOp, T_Sort, T_SubqueryScan, T_TableFuncScan, T_TidRangeScan, T_TidScan, T_Unique, T_ValuesScan, T_WindowAgg, T_WorkTableScan, and Plan::targetlist.

Referenced by SS_finalize_plan().

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

◆ finalize_primnode()

static bool finalize_primnode ( Node node,
finalize_primnode_context context 
)
static

Definition at line 2850 of file subselect.c.

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

Referenced by finalize_agg_primnode(), and finalize_plan().

2851 {
2852  if (node == NULL)
2853  return false;
2854  if (IsA(node, Param))
2855  {
2856  if (((Param *) node)->paramkind == PARAM_EXEC)
2857  {
2858  int paramid = ((Param *) node)->paramid;
2859 
2860  context->paramids = bms_add_member(context->paramids, paramid);
2861  }
2862  return false; /* no more to do here */
2863  }
2864  if (IsA(node, SubPlan))
2865  {
2866  SubPlan *subplan = (SubPlan *) node;
2867  Plan *plan = planner_subplan_get_plan(context->root, subplan);
2868  ListCell *lc;
2869  Bitmapset *subparamids;
2870 
2871  /* Recurse into the testexpr, but not into the Plan */
2872  finalize_primnode(subplan->testexpr, context);
2873 
2874  /*
2875  * Remove any param IDs of output parameters of the subplan that were
2876  * referenced in the testexpr. These are not interesting for
2877  * parameter change signaling since we always re-evaluate the subplan.
2878  * Note that this wouldn't work too well if there might be uses of the
2879  * same param IDs elsewhere in the plan, but that can't happen because
2880  * generate_new_exec_param never tries to merge params.
2881  */
2882  foreach(lc, subplan->paramIds)
2883  {
2884  context->paramids = bms_del_member(context->paramids,
2885  lfirst_int(lc));
2886  }
2887 
2888  /* Also examine args list */
2889  finalize_primnode((Node *) subplan->args, context);
2890 
2891  /*
2892  * Add params needed by the subplan to paramids, but excluding those
2893  * we will pass down to it. (We assume SS_finalize_plan was run on
2894  * the subplan already.)
2895  */
2896  subparamids = bms_copy(plan->extParam);
2897  foreach(lc, subplan->parParam)
2898  {
2899  subparamids = bms_del_member(subparamids, lfirst_int(lc));
2900  }
2901  context->paramids = bms_join(context->paramids, subparamids);
2902 
2903  return false; /* no more to do here */
2904  }
2906  (void *) context);
2907 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
PlannerInfo * root
Definition: subselect.c:56
#define planner_subplan_get_plan(root, subplan)
Definition: pathnodes.h:135
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
Definition: nodes.h:539
List * paramIds
Definition: primnodes.h:740
#define lfirst_int(lc)
Definition: pg_list.h:170
Bitmapset * bms_join(Bitmapset *a, Bitmapset *b)
Definition: bitmapset.c:949
static bool finalize_primnode(Node *node, finalize_primnode_context *context)
Definition: subselect.c:2850
Node * testexpr
Definition: primnodes.h:739
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1904
Bitmapset * extParam
Definition: plannodes.h:159
List * parParam
Definition: primnodes.h:762
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:736
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:773
List * args
Definition: primnodes.h:763

◆ generate_subquery_params()

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

Definition at line 592 of file subselect.c.

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

Referenced by build_subplan().

593 {
594  List *result;
595  List *ids;
596  ListCell *lc;
597 
598  result = ids = NIL;
599  foreach(lc, tlist)
600  {
601  TargetEntry *tent = (TargetEntry *) lfirst(lc);
602  Param *param;
603 
604  if (tent->resjunk)
605  continue;
606 
607  param = generate_new_exec_param(root,
608  exprType((Node *) tent->expr),
609  exprTypmod((Node *) tent->expr),
610  exprCollation((Node *) tent->expr));
611  result = lappend(result, param);
612  ids = lappend_int(ids, param->paramid);
613  }
614 
615  *paramIds = ids;
616  return result;
617 }
#define NIL
Definition: pg_list.h:65
Param * generate_new_exec_param(PlannerInfo *root, Oid paramtype, int32 paramtypmod, Oid paramcollation)
Definition: paramassign.c:557
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:267
Definition: nodes.h:539
bool resjunk
Definition: primnodes.h:1451
List * lappend_int(List *list, int datum)
Definition: list.c:354
List * lappend(List *list, void *datum)
Definition: list.c:336
#define lfirst(lc)
Definition: pg_list.h:169
Expr * expr
Definition: primnodes.h:1444
int paramid
Definition: primnodes.h:268
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:759
Definition: pg_list.h:50

◆ generate_subquery_vars()

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

Definition at line 625 of file subselect.c.

References lappend(), lfirst, makeVarFromTargetEntry(), NIL, and TargetEntry::resjunk.

Referenced by convert_ANY_sublink_to_join().

626 {
627  List *result;
628  ListCell *lc;
629 
630  result = NIL;
631  foreach(lc, tlist)
632  {
633  TargetEntry *tent = (TargetEntry *) lfirst(lc);
634  Var *var;
635 
636  if (tent->resjunk)
637  continue;
638 
639  var = makeVarFromTargetEntry(varno, tent);
640  result = lappend(result, var);
641  }
642 
643  return result;
644 }
#define NIL
Definition: pg_list.h:65
Var * makeVarFromTargetEntry(Index varno, TargetEntry *tle)
Definition: makefuncs.c:103
Definition: primnodes.h:186
bool resjunk
Definition: primnodes.h:1451
List * lappend(List *list, void *datum)
Definition: list.c:336
#define lfirst(lc)
Definition: pg_list.h:169
Definition: pg_list.h:50

◆ get_first_col_type()

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

Definition at line 119 of file subselect.c.

References TargetEntry::expr, exprCollation(), exprType(), exprTypmod(), InvalidOid, linitial_node, TargetEntry::resjunk, and Plan::targetlist.

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

121 {
122  /* In cases such as EXISTS, tlist might be empty; arbitrarily use VOID */
123  if (plan->targetlist)
124  {
126 
127  if (!tent->resjunk)
128  {
129  *coltype = exprType((Node *) tent->expr);
130  *coltypmod = exprTypmod((Node *) tent->expr);
131  *colcollation = exprCollation((Node *) tent->expr);
132  return;
133  }
134  }
135  *coltype = VOIDOID;
136  *coltypmod = -1;
137  *colcollation = InvalidOid;
138 }
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:267
Definition: nodes.h:539
#define linitial_node(type, l)
Definition: pg_list.h:177
bool resjunk
Definition: primnodes.h:1451
#define InvalidOid
Definition: postgres_ext.h:36
Expr * expr
Definition: primnodes.h:1444
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:759
List * targetlist
Definition: plannodes.h:141

◆ hash_ok_operator()

static bool hash_ok_operator ( OpExpr expr)
static

Definition at line 846 of file subselect.c.

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().

847 {
848  Oid opid = expr->opno;
849 
850  /* quick out if not a binary operator */
851  if (list_length(expr->args) != 2)
852  return false;
853  if (opid == ARRAY_EQ_OP)
854  {
855  /* array_eq is strict, but must check input type to ensure hashable */
856  /* XXX record_eq will need same treatment when it becomes hashable */
857  Node *leftarg = linitial(expr->args);
858 
859  return op_hashjoinable(opid, exprType(leftarg));
860  }
861  else
862  {
863  /* else must look up the operator properties */
864  HeapTuple tup;
865  Form_pg_operator optup;
866 
868  if (!HeapTupleIsValid(tup))
869  elog(ERROR, "cache lookup failed for operator %u", opid);
870  optup = (Form_pg_operator) GETSTRUCT(tup);
871  if (!optup->oprcanhash || !func_strict(optup->oprcode))
872  {
873  ReleaseSysCache(tup);
874  return false;
875  }
876  ReleaseSysCache(tup);
877  return true;
878  }
879 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:654
Definition: nodes.h:539
unsigned int Oid
Definition: postgres_ext.h:31
bool op_hashjoinable(Oid opno, Oid inputtype)
Definition: lsyscache.c:1408
#define linitial(l)
Definition: pg_list.h:174
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define ERROR
Definition: elog.h:46
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1127
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1175
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
static int list_length(const List *l)
Definition: pg_list.h:149
FormData_pg_operator * Form_pg_operator
Definition: pg_operator.h:83
bool func_strict(Oid funcid)
Definition: lsyscache.c:1732
#define elog(elevel,...)
Definition: elog.h:232
Oid opno
Definition: primnodes.h:542
List * args
Definition: primnodes.h:548

◆ inline_cte()

static void inline_cte ( PlannerInfo root,
CommonTableExpr cte 
)
static

Definition at line 1153 of file subselect.c.

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

Referenced by SS_process_ctes().

1154 {
1155  struct inline_cte_walker_context context;
1156 
1157  context.ctename = cte->ctename;
1158  /* Start at levelsup = -1 because we'll immediately increment it */
1159  context.levelsup = -1;
1160  context.refcount = cte->cterefcount;
1161  context.ctequery = castNode(Query, cte->ctequery);
1162 
1163  (void) inline_cte_walker((Node *) root->parse, &context);
1164 
1165  /* Assert we replaced all references */
1166  Assert(context.refcount == 0);
1167 }
Query * parse
Definition: pathnodes.h:161
#define castNode(_type_, nodeptr)
Definition: nodes.h:608
Definition: nodes.h:539
#define Assert(condition)
Definition: c.h:804
const char * ctename
Definition: subselect.c:62
static bool inline_cte_walker(Node *node, inline_cte_walker_context *context)
Definition: subselect.c:1170

◆ inline_cte_walker()

static bool inline_cte_walker ( Node node,
inline_cte_walker_context context 
)
static

Definition at line 1170 of file subselect.c.

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(), inline_cte_walker_context::refcount, RTE_CTE, RTE_SUBQUERY, RangeTblEntry::rtekind, RangeTblEntry::security_barrier, RangeTblEntry::self_reference, and RangeTblEntry::subquery.

Referenced by inline_cte().

1171 {
1172  if (node == NULL)
1173  return false;
1174  if (IsA(node, Query))
1175  {
1176  Query *query = (Query *) node;
1177 
1178  context->levelsup++;
1179 
1180  /*
1181  * Visit the query's RTE nodes after their contents; otherwise
1182  * query_tree_walker would descend into the newly inlined CTE query,
1183  * which we don't want.
1184  */
1185  (void) query_tree_walker(query, inline_cte_walker, context,
1187 
1188  context->levelsup--;
1189 
1190  return false;
1191  }
1192  else if (IsA(node, RangeTblEntry))
1193  {
1194  RangeTblEntry *rte = (RangeTblEntry *) node;
1195 
1196  if (rte->rtekind == RTE_CTE &&
1197  strcmp(rte->ctename, context->ctename) == 0 &&
1198  rte->ctelevelsup == context->levelsup)
1199  {
1200  /*
1201  * Found a reference to replace. Generate a copy of the CTE query
1202  * with appropriate level adjustment for outer references (e.g.,
1203  * to other CTEs).
1204  */
1205  Query *newquery = copyObject(context->ctequery);
1206 
1207  if (context->levelsup > 0)
1208  IncrementVarSublevelsUp((Node *) newquery, context->levelsup, 1);
1209 
1210  /*
1211  * Convert the RTE_CTE RTE into a RTE_SUBQUERY.
1212  *
1213  * Historically, a FOR UPDATE clause has been treated as extending
1214  * into views and subqueries, but not into CTEs. We preserve this
1215  * distinction by not trying to push rowmarks into the new
1216  * subquery.
1217  */
1218  rte->rtekind = RTE_SUBQUERY;
1219  rte->subquery = newquery;
1220  rte->security_barrier = false;
1221 
1222  /* Zero out CTE-specific fields */
1223  rte->ctename = NULL;
1224  rte->ctelevelsup = 0;
1225  rte->self_reference = false;
1226  rte->coltypes = NIL;
1227  rte->coltypmods = NIL;
1228  rte->colcollations = NIL;
1229 
1230  /* Count the number of replacements we've done */
1231  context->refcount--;
1232  }
1233 
1234  return false;
1235  }
1236 
1237  return expression_tree_walker(node, inline_cte_walker, context);
1238 }
#define NIL
Definition: pg_list.h:65
bool query_tree_walker(Query *query, bool(*walker)(), void *context, int flags)
Definition: nodeFuncs.c:2355
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
#define QTW_EXAMINE_RTES_AFTER
Definition: nodeFuncs.h:27
void IncrementVarSublevelsUp(Node *node, int delta_sublevels_up, int min_sublevels_up)
Definition: rewriteManip.c:776
List * coltypmods
Definition: parsenodes.h:1128
Definition: nodes.h:539
List * colcollations
Definition: parsenodes.h:1129
bool self_reference
Definition: parsenodes.h:1107
bool security_barrier
Definition: parsenodes.h:1031
const char * ctename
Definition: subselect.c:62
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
Definition: nodeFuncs.c:1904
Index ctelevelsup
Definition: parsenodes.h:1106
RTEKind rtekind
Definition: parsenodes.h:995
char * ctename
Definition: parsenodes.h:1105
Query * subquery
Definition: parsenodes.h:1030
#define copyObject(obj)
Definition: nodes.h:655
List * coltypes
Definition: parsenodes.h:1127
static bool inline_cte_walker(Node *node, inline_cte_walker_context *context)
Definition: subselect.c:1170

◆ make_subplan()

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

Definition at line 163 of file subselect.c.

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, PlannerInfo::plan_params, simplify_EXISTS_query(), subpath_is_hashable(), AlternativeSubPlan::subplans, subquery_planner(), UPPERREL_FINAL, and SubPlan::useHashTable.

Referenced by process_sublinks_mutator().

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

◆ process_sublinks_mutator()

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

Definition at line 1930 of file subselect.c.

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().

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

◆ replace_correlation_vars_mutator()

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

Definition at line 1882 of file subselect.c.

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

Referenced by SS_replace_correlation_vars().

1883 {
1884  if (node == NULL)
1885  return NULL;
1886  if (IsA(node, Var))
1887  {
1888  if (((Var *) node)->varlevelsup > 0)
1889  return (Node *) replace_outer_var(root, (Var *) node);
1890  }
1891  if (IsA(node, PlaceHolderVar))
1892  {
1893  if (((PlaceHolderVar *) node)->phlevelsup > 0)
1894  return (Node *) replace_outer_placeholdervar(root,
1895  (PlaceHolderVar *) node);
1896  }
1897  if (IsA(node, Aggref))
1898  {
1899  if (((Aggref *) node)->agglevelsup > 0)
1900  return (Node *) replace_outer_agg(root, (Aggref *) node);
1901  }
1902  if (IsA(node, GroupingFunc))
1903  {
1904  if (((GroupingFunc *) node)->agglevelsup > 0)
1905  return (Node *) replace_outer_grouping(root, (GroupingFunc *) node);
1906  }
1907  return expression_tree_mutator(node,
1909  (void *) root);
1910 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:590
Node * expression_tree_mutator(Node *node, Node *(*mutator)(), void *context)
Definition: nodeFuncs.c:2598
Definition: nodes.h:539
Definition: primnodes.h:186
Param * replace_outer_placeholdervar(PlannerInfo *root, PlaceHolderVar *phv)
Definition: paramassign.c:196
Param * replace_outer_var(PlannerInfo *root, Var *var)
Definition: paramassign.c:119
Param * replace_outer_grouping(PlannerInfo *root, GroupingFunc *grp)
Definition: paramassign.c:269
static Node * replace_correlation_vars_mutator(Node *node, PlannerInfo *root)
Definition: subselect.c:1882
Param * replace_outer_agg(PlannerInfo *root, Aggref *agg)
Definition: paramassign.c:223

◆ simplify_EXISTS_query()

static bool simplify_EXISTS_query ( PlannerInfo root,
Query query 
)
static

Definition at line 1548 of file subselect.c.

References Assert, CMD_SELECT, Query::commandType, Const::constisnull, Const::consttype, Const::constvalue, DatumGetInt64, Query::distinctClause, eval_const_expressions(), Query::groupClause, Query::groupingSets, Query::hasAggs, Query::hasDistinctOn, Query::hasModifyingCTE, Query::hasTargetSRFs, Query::hasWindowFuncs, 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().

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

◆ SS_attach_initplans()

void SS_attach_initplans ( PlannerInfo root,
Plan plan 
)

Definition at line 2186 of file subselect.c.

References PlannerInfo::init_plans, and Plan::initPlan.

Referenced by create_plan().

2187 {
2188  plan->initPlan = root->init_plans;
2189 }
List * init_plans
Definition: pathnodes.h:241
List * initPlan
Definition: plannodes.h:145

◆ SS_charge_for_initplans()

void SS_charge_for_initplans ( PlannerInfo root,
RelOptInfo final_rel 
)

Definition at line 2129 of file subselect.c.

References RelOptInfo::consider_parallel, PlannerInfo::init_plans, lfirst, NIL, Path::parallel_safe, RelOptInfo::partial_pathlist, RelOptInfo::pathlist, SubPlan::per_call_cost, SubPlan::startup_cost, Path::startup_cost, and Path::total_cost.

Referenced by build_minmax_path(), and subquery_planner().

2130 {
2131  Cost initplan_cost;
2132  ListCell *lc;
2133 
2134  /* Nothing to do if no initPlans */
2135  if (root->init_plans == NIL)
2136  return;
2137 
2138  /*
2139  * Compute the cost increment just once, since it will be the same for all
2140  * Paths. We assume each initPlan gets run once during top plan startup.
2141  * This is a conservative overestimate, since in fact an initPlan might be
2142  * executed later than plan startup, or even not at all.
2143  */
2144  initplan_cost = 0;
2145  foreach(lc, root->init_plans)
2146  {
2147  SubPlan *initsubplan = (SubPlan *) lfirst(lc);
2148 
2149  initplan_cost += initsubplan->startup_cost + initsubplan->per_call_cost;
2150  }
2151 
2152  /*
2153  * Now adjust the costs and parallel_safe flags.
2154  */
2155  foreach(lc, final_rel->pathlist)
2156  {
2157  Path *path = (Path *) lfirst(lc);
2158 
2159  path->startup_cost += initplan_cost;
2160  path->total_cost += initplan_cost;
2161  path->parallel_safe = false;
2162  }
2163 
2164  /*
2165  * Forget about any partial paths and clear consider_parallel, too;
2166  * they're not usable if we attached an initPlan.
2167  */
2168  final_rel->partial_pathlist = NIL;
2169  final_rel->consider_parallel = false;
2170 
2171  /* We needn't do set_cheapest() here, caller will do it */
2172 }
#define NIL
Definition: pg_list.h:65
List * partial_pathlist
Definition: pathnodes.h:692
Cost startup_cost
Definition: pathnodes.h:1185
List * init_plans
Definition: pathnodes.h:241
Cost per_call_cost
Definition: primnodes.h:766
Cost total_cost
Definition: pathnodes.h:1186
#define lfirst(lc)
Definition: pg_list.h:169
bool parallel_safe
Definition: pathnodes.h:1180
bool consider_parallel
Definition: pathnodes.h:684
Cost startup_cost
Definition: primnodes.h:765
List * pathlist
Definition: pathnodes.h:690
double Cost
Definition: nodes.h:673

◆ SS_finalize_plan()

void SS_finalize_plan ( PlannerInfo root,
Plan plan 
)

Definition at line 2201 of file subselect.c.

References finalize_plan(), and PlannerInfo::outer_params.

Referenced by standard_planner().

2202 {
2203  /* No setup needed, just recurse through plan tree. */
2204  (void) finalize_plan(root, plan, -1, root->outer_params, NULL);
2205 }
static Bitmapset * finalize_plan(PlannerInfo *root, Plan *plan, int gather_param, Bitmapset *valid_params, Bitmapset *scan_params)
Definition: subselect.c:2239
Bitmapset * outer_params
Definition: pathnodes.h:176

◆ SS_identify_outer_params()

void SS_identify_outer_params ( PlannerInfo root)

Definition at line 2067 of file subselect.c.

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

Referenced by build_minmax_path(), and subquery_planner().

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

◆ SS_make_initplan_from_plan()

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

Definition at line 2958 of file subselect.c.

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, Param::paramid, SubPlan::plan_id, SubPlan::plan_name, psprintf(), SubPlan::setParam, SubPlan::subLinkType, PlannerGlobal::subplans, and PlannerGlobal::subroots.

Referenced by create_minmaxagg_plan().

2961 {
2962  SubPlan *node;
2963 
2964  /*
2965  * Add the subplan and its PlannerInfo to the global lists.
2966  */
2967  root->glob->subplans = lappend(root->glob->subplans, plan);
2968  root->glob->subroots = lappend(root->glob->subroots, subroot);
2969 
2970  /*
2971  * Create a SubPlan node and add it to the outer list of InitPlans. Note
2972  * it has to appear after any other InitPlans it might depend on (see
2973  * comments in ExecReScan).
2974  */
2975  node = makeNode(SubPlan);
2976  node->subLinkType = EXPR_SUBLINK;
2977  node->plan_id = list_length(root->glob->subplans);
2978  node->plan_name = psprintf("InitPlan %d (returns $%d)",
2979  node->plan_id, prm->paramid);
2980  get_first_col_type(plan, &node->firstColType, &node->firstColTypmod,
2981  &node->firstColCollation);
2982  node->setParam = list_make1_int(prm->paramid);
2983 
2984  root->init_plans = lappend(root->init_plans, node);
2985 
2986  /*
2987  * The node can't have any inputs (since it's an initplan), so the
2988  * parParam and args lists remain empty.
2989  */
2990 
2991  /* Set costs of SubPlan using info from the plan tree */
2992  cost_subplan(subroot, node, plan);
2993 }
Oid firstColType
Definition: primnodes.h:746
int plan_id
Definition: primnodes.h:742
static void get_first_col_type(Plan *plan, Oid *coltype, int32 *coltypmod, Oid *colcollation)
Definition: subselect.c:119
char * psprintf(const char *fmt,...)
Definition: psprintf.c:46
SubLinkType subLinkType
Definition: primnodes.h:737
List * subplans
Definition: pathnodes.h:95
PlannerGlobal * glob
Definition: pathnodes.h:163
#define list_make1_int(x1)
Definition: pg_list.h:221
List * lappend(List *list, void *datum)
Definition: list.c:336
List * init_plans
Definition: pathnodes.h:241
int32 firstColTypmod
Definition: primnodes.h:747
#define makeNode(_type_)
Definition: nodes.h:587
char * plan_name
Definition: primnodes.h:744
List * setParam
Definition: primnodes.h:760
int paramid
Definition: primnodes.h:268
void cost_subplan(PlannerInfo *root, SubPlan *subplan, Plan *plan)
Definition: costsize.c:4106
static int list_length(const List *l)
Definition: pg_list.h:149
List * subroots
Definition: pathnodes.h:97
Oid firstColCollation
Definition: primnodes.h:748

◆ SS_make_initplan_output_param()

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

Definition at line 2942 of file subselect.c.

References generate_new_exec_param().

Referenced by preprocess_minmax_aggregates().

2945 {
2946  return generate_new_exec_param(root, resulttype,
2947  resulttypmod, resultcollation);
2948 }
Param * generate_new_exec_param(PlannerInfo *root, Oid paramtype, int32 paramtypmod, Oid paramcollation)
Definition: paramassign.c:557

◆ SS_process_ctes()

void SS_process_ctes ( PlannerInfo root)

Definition at line 894 of file subselect.c.

References SubPlan::args, 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, CommonTableExpr::cterecursive, CommonTableExpr::cterefcount, elog, ERROR, fetch_upper_rel(), SubPlan::firstColCollation, SubPlan::firstColType, SubPlan::firstColTypmod, get_first_col_type(), PlannerInfo::glob, PlannerInfo::init_plans, inline_cte(), lappend(), lappend_int(), lfirst, list_length(), list_make1_int, makeNode, NIL, SubPlan::parallel_safe, SubPlan::paramIds, SubPlan::parParam, PlannerInfo::parse, SubPlan::plan_id, SubPlan::plan_name, PlannerInfo::plan_params, psprintf(), SubPlan::setParam, splan, SubPlan::subLinkType, PlannerGlobal::subplans, subquery_planner(), PlannerGlobal::subroots, SubPlan::testexpr, SubPlan::unknownEqFalse, UPPERREL_FINAL, and SubPlan::useHashTable.

Referenced by subquery_planner().

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

◆ SS_process_sublinks()

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

Definition at line 1920 of file subselect.c.

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

Referenced by build_subplan(), and preprocess_expression().

1921 {
1922  process_sublinks_context context;
1923 
1924  context.root = root;
1925  context.isTopQual = isQual;
1926  return process_sublinks_mutator(expr, &context);
1927 }
static Node * process_sublinks_mutator(Node *node, process_sublinks_context *context)
Definition: subselect.c:1930

◆ SS_replace_correlation_vars()

Node* SS_replace_correlation_vars ( PlannerInfo root,
Node expr 
)

Definition at line 1875 of file subselect.c.

References replace_correlation_vars_mutator().

Referenced by preprocess_expression().

1876 {
1877  /* No setup needed for tree walk, so away we go */
1878  return replace_correlation_vars_mutator(expr, root);
1879 }
static Node * replace_correlation_vars_mutator(Node *node, PlannerInfo *root)
Definition: subselect.c:1882

◆ subpath_is_hashable()

static bool subpath_is_hashable ( Path path)
static

Definition at line 749 of file subselect.c.

References get_hash_mem(), MAXALIGN, Path::pathtarget, Path::rows, SizeofHeapTupleHeader, and PathTarget::width.

Referenced by make_subplan().

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

◆ subplan_is_hashable()

static bool subplan_is_hashable ( Plan plan)
static

Definition at line 724 of file subselect.c.

References get_hash_mem(), MAXALIGN, Plan::plan_rows, Plan::plan_width, and SizeofHeapTupleHeader.

Referenced by build_subplan().

725 {
726  double subquery_size;
727  int hash_mem = get_hash_mem();
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 *
737  if (subquery_size > hash_mem * 1024L)
738  return false;
739 
740  return true;
741 }
#define SizeofHeapTupleHeader
Definition: htup_details.h:184
double plan_rows
Definition: plannodes.h:123
int plan_width
Definition: plannodes.h:124
#define MAXALIGN(LEN)
Definition: c.h:757
int get_hash_mem(void)
Definition: nodeHash.c:3389

◆ test_opexpr_is_hashable()

static bool test_opexpr_is_hashable ( OpExpr testexpr,
List param_ids 
)
static

Definition at line 806 of file subselect.c.

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

Referenced by testexpr_is_hashable().

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

◆ testexpr_is_hashable()

static bool testexpr_is_hashable ( Node testexpr,
List param_ids 
)
static

Definition at line 775 of file subselect.c.

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

Referenced by build_subplan().

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