PostgreSQL Source Code  git master
planner.h File Reference
#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
Include dependency graph for planner.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs

typedef PlannedStmt *(* planner_hook_type) (Query *parse, int cursorOptions, ParamListInfo boundParams)
 
typedef void(* create_upper_paths_hook_type) (PlannerInfo *root, UpperRelationKind stage, RelOptInfo *input_rel, RelOptInfo *output_rel, void *extra)
 

Functions

PlannedStmtstandard_planner (Query *parse, int cursorOptions, ParamListInfo boundParams)
 
PlannerInfosubquery_planner (PlannerGlobal *glob, Query *parse, PlannerInfo *parent_root, bool hasRecursion, double tuple_fraction)
 
RowMarkType select_rowmark_type (RangeTblEntry *rte, LockClauseStrength strength)
 
bool limit_needed (Query *parse)
 
void mark_partial_aggref (Aggref *agg, AggSplit aggsplit)
 
Pathget_cheapest_fractional_path (RelOptInfo *rel, double tuple_fraction)
 
Exprpreprocess_phv_expression (PlannerInfo *root, Expr *expr)
 

Variables

PGDLLIMPORT planner_hook_type planner_hook
 
PGDLLIMPORT create_upper_paths_hook_type create_upper_paths_hook
 

Typedef Documentation

◆ create_upper_paths_hook_type

typedef void(* create_upper_paths_hook_type) (PlannerInfo *root, UpperRelationKind stage, RelOptInfo *input_rel, RelOptInfo *output_rel, void *extra)

Definition at line 32 of file planner.h.

◆ planner_hook_type

typedef PlannedStmt*(* planner_hook_type) (Query *parse, int cursorOptions, ParamListInfo boundParams)

Definition at line 26 of file planner.h.

Function Documentation

◆ get_cheapest_fractional_path()

Path* get_cheapest_fractional_path ( RelOptInfo rel,
double  tuple_fraction 
)

Definition at line 5887 of file planner.c.

References RelOptInfo::cheapest_total_path, compare_fractional_path_costs(), lfirst, RelOptInfo::pathlist, and Path::rows.

Referenced by make_subplan(), recurse_set_operations(), and standard_planner().

5888 {
5889  Path *best_path = rel->cheapest_total_path;
5890  ListCell *l;
5891 
5892  /* If all tuples will be retrieved, just return the cheapest-total path */
5893  if (tuple_fraction <= 0.0)
5894  return best_path;
5895 
5896  /* Convert absolute # of tuples to a fraction; no need to clamp to 0..1 */
5897  if (tuple_fraction >= 1.0 && best_path->rows > 0)
5898  tuple_fraction /= best_path->rows;
5899 
5900  foreach(l, rel->pathlist)
5901  {
5902  Path *path = (Path *) lfirst(l);
5903 
5904  if (path == rel->cheapest_total_path ||
5905  compare_fractional_path_costs(best_path, path, tuple_fraction) <= 0)
5906  continue;
5907 
5908  best_path = path;
5909  }
5910 
5911  return best_path;
5912 }
struct Path * cheapest_total_path
Definition: pathnodes.h:659
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1124
int compare_fractional_path_costs(Path *path1, Path *path2, double fraction)
Definition: pathnode.c:118
List * pathlist
Definition: pathnodes.h:655

◆ limit_needed()

bool limit_needed ( Query parse)

Definition at line 3007 of file planner.c.

References DatumGetInt64, IsA, Query::limitCount, and Query::limitOffset.

Referenced by grouping_planner(), and set_rel_consider_parallel().

3008 {
3009  Node *node;
3010 
3011  node = parse->limitCount;
3012  if (node)
3013  {
3014  if (IsA(node, Const))
3015  {
3016  /* NULL indicates LIMIT ALL, ie, no limit */
3017  if (!((Const *) node)->constisnull)
3018  return true; /* LIMIT with a constant value */
3019  }
3020  else
3021  return true; /* non-constant LIMIT */
3022  }
3023 
3024  node = parse->limitOffset;
3025  if (node)
3026  {
3027  if (IsA(node, Const))
3028  {
3029  /* Treat NULL as no offset; the executor would too */
3030  if (!((Const *) node)->constisnull)
3031  {
3032  int64 offset = DatumGetInt64(((Const *) node)->constvalue);
3033 
3034  if (offset != 0)
3035  return true; /* OFFSET with a nonzero value */
3036  }
3037  }
3038  else
3039  return true; /* non-constant OFFSET */
3040  }
3041 
3042  return false; /* don't need a Limit plan node */
3043 }
Node * limitOffset
Definition: parsenodes.h:160
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
Definition: nodes.h:525
#define DatumGetInt64(X)
Definition: postgres.h:607
Node * limitCount
Definition: parsenodes.h:161

◆ mark_partial_aggref()

void mark_partial_aggref ( Aggref agg,
AggSplit  aggsplit 
)

Definition at line 5287 of file planner.c.

References Aggref::aggsplit, AGGSPLIT_SIMPLE, Aggref::aggtranstype, Aggref::aggtype, Assert, DO_AGGSPLIT_SERIALIZE, DO_AGGSPLIT_SKIPFINAL, and OidIsValid.

Referenced by convert_combining_aggrefs(), and make_partial_grouping_target().

5288 {
5289  /* aggtranstype should be computed by this point */
5291  /* ... but aggsplit should still be as the parser left it */
5292  Assert(agg->aggsplit == AGGSPLIT_SIMPLE);
5293 
5294  /* Mark the Aggref with the intended partial-aggregation mode */
5295  agg->aggsplit = aggsplit;
5296 
5297  /*
5298  * Adjust result type if needed. Normally, a partial aggregate returns
5299  * the aggregate's transition type; but if that's INTERNAL and we're
5300  * serializing, it returns BYTEA instead.
5301  */
5302  if (DO_AGGSPLIT_SKIPFINAL(aggsplit))
5303  {
5304  if (agg->aggtranstype == INTERNALOID && DO_AGGSPLIT_SERIALIZE(aggsplit))
5305  agg->aggtype = BYTEAOID;
5306  else
5307  agg->aggtype = agg->aggtranstype;
5308  }
5309 }
#define OidIsValid(objectId)
Definition: c.h:638
#define DO_AGGSPLIT_SERIALIZE(as)
Definition: nodes.h:789
#define Assert(condition)
Definition: c.h:732
AggSplit aggsplit
Definition: primnodes.h:314
#define DO_AGGSPLIT_SKIPFINAL(as)
Definition: nodes.h:788
Oid aggtranstype
Definition: primnodes.h:302
Oid aggtype
Definition: primnodes.h:299

◆ preprocess_phv_expression()

Expr* preprocess_phv_expression ( PlannerInfo root,
Expr expr 
)

Definition at line 1183 of file planner.c.

References EXPRKIND_PHV, and preprocess_expression().

Referenced by extract_lateral_references().

1184 {
1185  return (Expr *) preprocess_expression(root, (Node *) expr, EXPRKIND_PHV);
1186 }
Definition: nodes.h:525
static Node * preprocess_expression(PlannerInfo *root, Node *expr, int kind)
Definition: planner.c:1048
#define EXPRKIND_PHV
Definition: planner.c:90

◆ select_rowmark_type()

RowMarkType select_rowmark_type ( RangeTblEntry rte,
LockClauseStrength  strength 
)

Definition at line 2756 of file planner.c.

References elog, ERROR, GetFdwRoutineByRelId(), FdwRoutine::GetForeignRowMarkType, LCS_FORKEYSHARE, LCS_FORNOKEYUPDATE, LCS_FORSHARE, LCS_FORUPDATE, LCS_NONE, RangeTblEntry::relid, RangeTblEntry::relkind, ROW_MARK_COPY, ROW_MARK_EXCLUSIVE, ROW_MARK_KEYSHARE, ROW_MARK_NOKEYEXCLUSIVE, ROW_MARK_REFERENCE, ROW_MARK_SHARE, RTE_RELATION, and RangeTblEntry::rtekind.

Referenced by expand_single_inheritance_child(), and preprocess_rowmarks().

2757 {
2758  if (rte->rtekind != RTE_RELATION)
2759  {
2760  /* If it's not a table at all, use ROW_MARK_COPY */
2761  return ROW_MARK_COPY;
2762  }
2763  else if (rte->relkind == RELKIND_FOREIGN_TABLE)
2764  {
2765  /* Let the FDW select the rowmark type, if it wants to */
2766  FdwRoutine *fdwroutine = GetFdwRoutineByRelId(rte->relid);
2767 
2768  if (fdwroutine->GetForeignRowMarkType != NULL)
2769  return fdwroutine->GetForeignRowMarkType(rte, strength);
2770  /* Otherwise, use ROW_MARK_COPY by default */
2771  return ROW_MARK_COPY;
2772  }
2773  else
2774  {
2775  /* Regular table, apply the appropriate lock type */
2776  switch (strength)
2777  {
2778  case LCS_NONE:
2779 
2780  /*
2781  * We don't need a tuple lock, only the ability to re-fetch
2782  * the row.
2783  */
2784  return ROW_MARK_REFERENCE;
2785  break;
2786  case LCS_FORKEYSHARE:
2787  return ROW_MARK_KEYSHARE;
2788  break;
2789  case LCS_FORSHARE:
2790  return ROW_MARK_SHARE;
2791  break;
2792  case LCS_FORNOKEYUPDATE:
2793  return ROW_MARK_NOKEYEXCLUSIVE;
2794  break;
2795  case LCS_FORUPDATE:
2796  return ROW_MARK_EXCLUSIVE;
2797  break;
2798  }
2799  elog(ERROR, "unrecognized LockClauseStrength %d", (int) strength);
2800  return ROW_MARK_EXCLUSIVE; /* keep compiler quiet */
2801  }
2802 }
#define ERROR
Definition: elog.h:43
FdwRoutine * GetFdwRoutineByRelId(Oid relid)
Definition: foreign.c:404
GetForeignRowMarkType_function GetForeignRowMarkType
Definition: fdwapi.h:224
RTEKind rtekind
Definition: parsenodes.h:974
#define elog(elevel,...)
Definition: elog.h:226

◆ standard_planner()

PlannedStmt* standard_planner ( Query parse,
int  cursorOptions,
ParamListInfo  boundParams 
)

Definition at line 280 of file planner.c.

References Assert, PlannerGlobal::boundParams, PlannedStmt::canSetTag, Query::canSetTag, CMD_SELECT, PlannedStmt::commandType, Query::commandType, create_plan(), CURSOR_OPT_FAST_PLAN, CURSOR_OPT_PARALLEL_OK, CURSOR_OPT_SCROLL, cursor_tuple_fraction, PlannedStmt::dependsOnRole, PlannerGlobal::dependsOnRole, DestroyPartitionDirectory(), ExecSupportsBackwardScan(), fetch_upper_rel(), PlannerGlobal::finalrowmarks, PlannerGlobal::finalrtable, forboth, force_parallel_mode, FORCE_PARALLEL_OFF, FORCE_PARALLEL_REGRESS, get_cheapest_fractional_path(), PlannerInfo::glob, PlannedStmt::hasModifyingCTE, Query::hasModifyingCTE, PlannedStmt::hasReturning, Plan::initPlan, PlannedStmt::invalItems, PlannerGlobal::invalItems, Gather::invisible, IsParallelWorker, IsUnderPostmaster, jit_above_cost, jit_enabled, jit_expressions, jit_inline_above_cost, jit_optimize_above_cost, jit_tuple_deforming, PlannedStmt::jitFlags, PlannerGlobal::lastPHId, PlannerGlobal::lastPlanNodeId, PlannerGlobal::lastRowMarkId, Plan::lefttree, lfirst, lfirst_node, list_length(), makeNode, materialize_finished_plan(), max_parallel_hazard(), max_parallel_workers_per_gather, PlannerGlobal::maxParallelHazard, NIL, Gather::num_workers, Plan::parallel_aware, Plan::parallel_safe, parallel_setup_cost, parallel_tuple_cost, PlannedStmt::parallelModeNeeded, PlannerGlobal::parallelModeNeeded, PlannerGlobal::parallelModeOK, PlannedStmt::paramExecTypes, PlannerGlobal::paramExecTypes, PlannerGlobal::partition_directory, PGJIT_DEFORM, PGJIT_EXPR, PGJIT_INLINE, PGJIT_NONE, PGJIT_OPT3, PGJIT_PERFORM, Gather::plan, Plan::plan_rows, Plan::plan_width, PlannedStmt::planTree, Plan::qual, PlannedStmt::queryId, Query::queryId, PlannedStmt::relationOids, PlannerGlobal::relationOids, Gather::rescan_param, PlannedStmt::resultRelations, PlannerGlobal::resultRelations, Query::returningList, PlannedStmt::rewindPlanIDs, PlannerGlobal::rewindPlanIDs, Plan::righttree, PlannedStmt::rootResultRelations, PlannerGlobal::rootResultRelations, PlannedStmt::rowMarks, PlannedStmt::rtable, set_plan_references(), Gather::single_copy, SS_finalize_plan(), Plan::startup_cost, PlannedStmt::stmt_len, Query::stmt_len, PlannedStmt::stmt_location, Query::stmt_location, PlannedStmt::subplans, PlannerGlobal::subplans, subquery_planner(), PlannerGlobal::subroots, Plan::targetlist, Plan::total_cost, PlannedStmt::transientPlan, PlannerGlobal::transientPlan, UPPERREL_FINAL, PlannedStmt::utilityStmt, and Query::utilityStmt.

Referenced by planner().

281 {
282  PlannedStmt *result;
283  PlannerGlobal *glob;
284  double tuple_fraction;
285  PlannerInfo *root;
286  RelOptInfo *final_rel;
287  Path *best_path;
288  Plan *top_plan;
289  ListCell *lp,
290  *lr;
291 
292  /*
293  * Set up global state for this planner invocation. This data is needed
294  * across all levels of sub-Query that might exist in the given command,
295  * so we keep it in a separate struct that's linked to by each per-Query
296  * PlannerInfo.
297  */
298  glob = makeNode(PlannerGlobal);
299 
300  glob->boundParams = boundParams;
301  glob->subplans = NIL;
302  glob->subroots = NIL;
303  glob->rewindPlanIDs = NULL;
304  glob->finalrtable = NIL;
305  glob->finalrowmarks = NIL;
306  glob->resultRelations = NIL;
307  glob->rootResultRelations = NIL;
308  glob->relationOids = NIL;
309  glob->invalItems = NIL;
310  glob->paramExecTypes = NIL;
311  glob->lastPHId = 0;
312  glob->lastRowMarkId = 0;
313  glob->lastPlanNodeId = 0;
314  glob->transientPlan = false;
315  glob->dependsOnRole = false;
316 
317  /*
318  * Assess whether it's feasible to use parallel mode for this query. We
319  * can't do this in a standalone backend, or if the command will try to
320  * modify any data, or if this is a cursor operation, or if GUCs are set
321  * to values that don't permit parallelism, or if parallel-unsafe
322  * functions are present in the query tree.
323  *
324  * (Note that we do allow CREATE TABLE AS, SELECT INTO, and CREATE
325  * MATERIALIZED VIEW to use parallel plans, but this is safe only because
326  * the command is writing into a completely new table which workers won't
327  * be able to see. If the workers could see the table, the fact that
328  * group locking would cause them to ignore the leader's heavyweight
329  * relation extension lock and GIN page locks would make this unsafe.
330  * We'll have to fix that somehow if we want to allow parallel inserts in
331  * general; updates and deletes have additional problems especially around
332  * combo CIDs.)
333  *
334  * For now, we don't try to use parallel mode if we're running inside a
335  * parallel worker. We might eventually be able to relax this
336  * restriction, but for now it seems best not to have parallel workers
337  * trying to create their own parallel workers.
338  */
339  if ((cursorOptions & CURSOR_OPT_PARALLEL_OK) != 0 &&
341  parse->commandType == CMD_SELECT &&
342  !parse->hasModifyingCTE &&
344  !IsParallelWorker())
345  {
346  /* all the cheap tests pass, so scan the query tree */
347  glob->maxParallelHazard = max_parallel_hazard(parse);
348  glob->parallelModeOK = (glob->maxParallelHazard != PROPARALLEL_UNSAFE);
349  }
350  else
351  {
352  /* skip the query tree scan, just assume it's unsafe */
353  glob->maxParallelHazard = PROPARALLEL_UNSAFE;
354  glob->parallelModeOK = false;
355  }
356 
357  /*
358  * glob->parallelModeNeeded is normally set to false here and changed to
359  * true during plan creation if a Gather or Gather Merge plan is actually
360  * created (cf. create_gather_plan, create_gather_merge_plan).
361  *
362  * However, if force_parallel_mode = on or force_parallel_mode = regress,
363  * then we impose parallel mode whenever it's safe to do so, even if the
364  * final plan doesn't use parallelism. It's not safe to do so if the
365  * query contains anything parallel-unsafe; parallelModeOK will be false
366  * in that case. Note that parallelModeOK can't change after this point.
367  * Otherwise, everything in the query is either parallel-safe or
368  * parallel-restricted, and in either case it should be OK to impose
369  * parallel-mode restrictions. If that ends up breaking something, then
370  * either some function the user included in the query is incorrectly
371  * labelled as parallel-safe or parallel-restricted when in reality it's
372  * parallel-unsafe, or else the query planner itself has a bug.
373  */
374  glob->parallelModeNeeded = glob->parallelModeOK &&
376 
377  /* Determine what fraction of the plan is likely to be scanned */
378  if (cursorOptions & CURSOR_OPT_FAST_PLAN)
379  {
380  /*
381  * We have no real idea how many tuples the user will ultimately FETCH
382  * from a cursor, but it is often the case that he doesn't want 'em
383  * all, or would prefer a fast-start plan anyway so that he can
384  * process some of the tuples sooner. Use a GUC parameter to decide
385  * what fraction to optimize for.
386  */
387  tuple_fraction = cursor_tuple_fraction;
388 
389  /*
390  * We document cursor_tuple_fraction as simply being a fraction, which
391  * means the edge cases 0 and 1 have to be treated specially here. We
392  * convert 1 to 0 ("all the tuples") and 0 to a very small fraction.
393  */
394  if (tuple_fraction >= 1.0)
395  tuple_fraction = 0.0;
396  else if (tuple_fraction <= 0.0)
397  tuple_fraction = 1e-10;
398  }
399  else
400  {
401  /* Default assumption is we need all the tuples */
402  tuple_fraction = 0.0;
403  }
404 
405  /* primary planning entry point (may recurse for subqueries) */
406  root = subquery_planner(glob, parse, NULL,
407  false, tuple_fraction);
408 
409  /* Select best Path and turn it into a Plan */
410  final_rel = fetch_upper_rel(root, UPPERREL_FINAL, NULL);
411  best_path = get_cheapest_fractional_path(final_rel, tuple_fraction);
412 
413  top_plan = create_plan(root, best_path);
414 
415  /*
416  * If creating a plan for a scrollable cursor, make sure it can run
417  * backwards on demand. Add a Material node at the top at need.
418  */
419  if (cursorOptions & CURSOR_OPT_SCROLL)
420  {
421  if (!ExecSupportsBackwardScan(top_plan))
422  top_plan = materialize_finished_plan(top_plan);
423  }
424 
425  /*
426  * Optionally add a Gather node for testing purposes, provided this is
427  * actually a safe thing to do.
428  */
430  {
431  Gather *gather = makeNode(Gather);
432 
433  /*
434  * If there are any initPlans attached to the formerly-top plan node,
435  * move them up to the Gather node; same as we do for Material node in
436  * materialize_finished_plan.
437  */
438  gather->plan.initPlan = top_plan->initPlan;
439  top_plan->initPlan = NIL;
440 
441  gather->plan.targetlist = top_plan->targetlist;
442  gather->plan.qual = NIL;
443  gather->plan.lefttree = top_plan;
444  gather->plan.righttree = NULL;
445  gather->num_workers = 1;
446  gather->single_copy = true;
448 
449  /*
450  * Since this Gather has no parallel-aware descendants to signal to,
451  * we don't need a rescan Param.
452  */
453  gather->rescan_param = -1;
454 
455  /*
456  * Ideally we'd use cost_gather here, but setting up dummy path data
457  * to satisfy it doesn't seem much cleaner than knowing what it does.
458  */
459  gather->plan.startup_cost = top_plan->startup_cost +
461  gather->plan.total_cost = top_plan->total_cost +
463  gather->plan.plan_rows = top_plan->plan_rows;
464  gather->plan.plan_width = top_plan->plan_width;
465  gather->plan.parallel_aware = false;
466  gather->plan.parallel_safe = false;
467 
468  /* use parallel mode for parallel plans. */
469  root->glob->parallelModeNeeded = true;
470 
471  top_plan = &gather->plan;
472  }
473 
474  /*
475  * If any Params were generated, run through the plan tree and compute
476  * each plan node's extParam/allParam sets. Ideally we'd merge this into
477  * set_plan_references' tree traversal, but for now it has to be separate
478  * because we need to visit subplans before not after main plan.
479  */
480  if (glob->paramExecTypes != NIL)
481  {
482  Assert(list_length(glob->subplans) == list_length(glob->subroots));
483  forboth(lp, glob->subplans, lr, glob->subroots)
484  {
485  Plan *subplan = (Plan *) lfirst(lp);
486  PlannerInfo *subroot = lfirst_node(PlannerInfo, lr);
487 
488  SS_finalize_plan(subroot, subplan);
489  }
490  SS_finalize_plan(root, top_plan);
491  }
492 
493  /* final cleanup of the plan */
494  Assert(glob->finalrtable == NIL);
495  Assert(glob->finalrowmarks == NIL);
496  Assert(glob->resultRelations == NIL);
497  Assert(glob->rootResultRelations == NIL);
498  top_plan = set_plan_references(root, top_plan);
499  /* ... and the subplans (both regular subplans and initplans) */
500  Assert(list_length(glob->subplans) == list_length(glob->subroots));
501  forboth(lp, glob->subplans, lr, glob->subroots)
502  {
503  Plan *subplan = (Plan *) lfirst(lp);
504  PlannerInfo *subroot = lfirst_node(PlannerInfo, lr);
505 
506  lfirst(lp) = set_plan_references(subroot, subplan);
507  }
508 
509  /* build the PlannedStmt result */
510  result = makeNode(PlannedStmt);
511 
512  result->commandType = parse->commandType;
513  result->queryId = parse->queryId;
514  result->hasReturning = (parse->returningList != NIL);
515  result->hasModifyingCTE = parse->hasModifyingCTE;
516  result->canSetTag = parse->canSetTag;
517  result->transientPlan = glob->transientPlan;
518  result->dependsOnRole = glob->dependsOnRole;
519  result->parallelModeNeeded = glob->parallelModeNeeded;
520  result->planTree = top_plan;
521  result->rtable = glob->finalrtable;
522  result->resultRelations = glob->resultRelations;
524  result->subplans = glob->subplans;
525  result->rewindPlanIDs = glob->rewindPlanIDs;
526  result->rowMarks = glob->finalrowmarks;
527  result->relationOids = glob->relationOids;
528  result->invalItems = glob->invalItems;
529  result->paramExecTypes = glob->paramExecTypes;
530  /* utilityStmt should be null, but we might as well copy it */
531  result->utilityStmt = parse->utilityStmt;
532  result->stmt_location = parse->stmt_location;
533  result->stmt_len = parse->stmt_len;
534 
535  result->jitFlags = PGJIT_NONE;
536  if (jit_enabled && jit_above_cost >= 0 &&
537  top_plan->total_cost > jit_above_cost)
538  {
539  result->jitFlags |= PGJIT_PERFORM;
540 
541  /*
542  * Decide how much effort should be put into generating better code.
543  */
544  if (jit_optimize_above_cost >= 0 &&
546  result->jitFlags |= PGJIT_OPT3;
547  if (jit_inline_above_cost >= 0 &&
548  top_plan->total_cost > jit_inline_above_cost)
549  result->jitFlags |= PGJIT_INLINE;
550 
551  /*
552  * Decide which operations should be JITed.
553  */
554  if (jit_expressions)
555  result->jitFlags |= PGJIT_EXPR;
557  result->jitFlags |= PGJIT_DEFORM;
558  }
559 
560  if (glob->partition_directory != NULL)
562 
563  return result;
564 }
char maxParallelHazard
Definition: pathnodes.h:145
bool dependsOnRole
Definition: plannodes.h:58
List * paramExecTypes
Definition: plannodes.h:88
#define NIL
Definition: pg_list.h:65
List * qual
Definition: plannodes.h:141
double plan_rows
Definition: plannodes.h:127
#define PGJIT_EXPR
Definition: jit.h:23
#define PGJIT_NONE
Definition: jit.h:19
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:419
int stmt_location
Definition: parsenodes.h:180
List * relationOids
Definition: plannodes.h:84
int lastPlanNodeId
Definition: pathnodes.h:135
List * resultRelations
Definition: pathnodes.h:121
double parallel_setup_cost
Definition: costsize.c:116
Node * utilityStmt
Definition: parsenodes.h:120
bool transientPlan
Definition: plannodes.h:56
int stmt_len
Definition: plannodes.h:94
char max_parallel_hazard(Query *parse)
Definition: clauses.c:835
struct Plan * planTree
Definition: plannodes.h:64
List * invalItems
Definition: plannodes.h:86
List * rootResultRelations
Definition: pathnodes.h:123
Plan * create_plan(PlannerInfo *root, Path *best_path)
Definition: createplan.c:313
bool dependsOnRole
Definition: pathnodes.h:139
struct Plan * righttree
Definition: plannodes.h:143
#define PGJIT_OPT3
Definition: jit.h:21
bool parallelModeNeeded
Definition: pathnodes.h:143
bool jit_enabled
Definition: jit.c:35
List * paramExecTypes
Definition: pathnodes.h:129
void DestroyPartitionDirectory(PartitionDirectory pdir)
Definition: partdesc.c:302
Plan plan
Definition: plannodes.h:871
bool single_copy
Definition: plannodes.h:874
bool parallelModeOK
Definition: pathnodes.h:141
Bitmapset * rewindPlanIDs
Definition: pathnodes.h:115
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1164
#define lfirst_node(type, lc)
Definition: pg_list.h:193
int stmt_location
Definition: plannodes.h:93
List * subplans
Definition: pathnodes.h:111
Cost startup_cost
Definition: plannodes.h:121
PlannerGlobal * glob
Definition: pathnodes.h:179
bool IsUnderPostmaster
Definition: globals.c:109
bool hasReturning
Definition: plannodes.h:50
Plan * materialize_finished_plan(Plan *subplan)
Definition: createplan.c:6155
List * rootResultRelations
Definition: plannodes.h:75
Node * utilityStmt
Definition: plannodes.h:90
bool parallel_aware
Definition: plannodes.h:133
int jitFlags
Definition: plannodes.h:62
double cursor_tuple_fraction
Definition: planner.c:70
bool jit_expressions
Definition: jit.c:39
List * returningList
Definition: parsenodes.h:146
#define IsParallelWorker()
Definition: parallel.h:60
uint64 queryId
Definition: parsenodes.h:116
List * invalItems
Definition: pathnodes.h:127
bool canSetTag
Definition: plannodes.h:54
CmdType commandType
Definition: plannodes.h:46
#define CURSOR_OPT_FAST_PLAN
Definition: parsenodes.h:2689
double jit_above_cost
Definition: jit.c:42
bool ExecSupportsBackwardScan(Plan *node)
Definition: execAmi.c:496
Index lastPHId
Definition: pathnodes.h:131
#define PGJIT_INLINE
Definition: jit.h:22
bool jit_tuple_deforming
Definition: jit.c:41
List * rowMarks
Definition: plannodes.h:82
int num_workers
Definition: plannodes.h:872
double jit_inline_above_cost
Definition: jit.c:43
CmdType commandType
Definition: parsenodes.h:112
#define makeNode(_type_)
Definition: nodes.h:573
List * subplans
Definition: plannodes.h:77
int plan_width
Definition: plannodes.h:128
int force_parallel_mode
Definition: planner.c:71
ParamListInfo boundParams
Definition: pathnodes.h:109
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Bitmapset * rewindPlanIDs
Definition: plannodes.h:80
bool hasModifyingCTE
Definition: plannodes.h:52
bool canSetTag
Definition: parsenodes.h:118
int rescan_param
Definition: plannodes.h:873
#define PGJIT_PERFORM
Definition: jit.h:20
static int list_length(const List *l)
Definition: pg_list.h:169
List * relationOids
Definition: pathnodes.h:125
List * subroots
Definition: pathnodes.h:113
List * rtable
Definition: plannodes.h:66
struct Plan * lefttree
Definition: plannodes.h:142
double jit_optimize_above_cost
Definition: jit.c:44
List * targetlist
Definition: plannodes.h:140
bool invisible
Definition: plannodes.h:875
e
Definition: preproc-init.c:82
List * finalrtable
Definition: pathnodes.h:117
#define CURSOR_OPT_PARALLEL_OK
Definition: parsenodes.h:2692
Index lastRowMarkId
Definition: pathnodes.h:133
uint64 queryId
Definition: plannodes.h:48
List * resultRelations
Definition: plannodes.h:69
bool parallelModeNeeded
Definition: plannodes.h:60
List * initPlan
Definition: plannodes.h:144
#define CURSOR_OPT_SCROLL
Definition: parsenodes.h:2684
Cost total_cost
Definition: plannodes.h:122
bool hasModifyingCTE
Definition: parsenodes.h:131
bool parallel_safe
Definition: plannodes.h:134
Plan * set_plan_references(PlannerInfo *root, Plan *plan)
Definition: setrefs.c:221
#define PGJIT_DEFORM
Definition: jit.h:24
PartitionDirectory partition_directory
Definition: pathnodes.h:147
void SS_finalize_plan(PlannerInfo *root, Plan *plan)
Definition: subselect.c:2133
int max_parallel_workers_per_gather
Definition: costsize.c:122
List * finalrowmarks
Definition: pathnodes.h:119
int stmt_len
Definition: parsenodes.h:181
PlannerInfo * subquery_planner(PlannerGlobal *glob, Query *parse, PlannerInfo *parent_root, bool hasRecursion, double tuple_fraction)
Definition: planner.c:596
Path * get_cheapest_fractional_path(RelOptInfo *rel, double tuple_fraction)
Definition: planner.c:5887
bool transientPlan
Definition: pathnodes.h:137
double parallel_tuple_cost
Definition: costsize.c:115

◆ subquery_planner()

PlannerInfo* subquery_planner ( PlannerGlobal glob,
Query parse,
PlannerInfo parent_root,
bool  hasRecursion,
double  tuple_fraction 
)

Definition at line 596 of file planner.c.

References PlannerInfo::append_rel_list, OnConflictExpr::arbiterElems, OnConflictExpr::arbiterWhere, assign_special_exec_param(), contain_agg_clause(), contain_subplans(), contain_volatile_functions(), copyObject, PlannerInfo::cte_plan_ids, Query::cteList, CurrentMemoryContext, PlannerInfo::ec_merging_done, WindowClause::endOffset, PlannerInfo::eq_classes, expression_returns_set(), EXPRKIND_APPINFO, EXPRKIND_ARBITER_ELEM, EXPRKIND_LIMIT, EXPRKIND_QUAL, EXPRKIND_RTFUNC, EXPRKIND_RTFUNC_LATERAL, EXPRKIND_TABLEFUNC, EXPRKIND_TABLEFUNC_LATERAL, EXPRKIND_TABLESAMPLE, EXPRKIND_TARGET, EXPRKIND_VALUES, EXPRKIND_VALUES_LATERAL, fetch_upper_rel(), flatten_join_alias_vars(), flatten_simple_union_all(), RangeTblEntry::functions, PlannerInfo::glob, Query::groupClause, PlannerInfo::grouping_map, grouping_planner(), Query::groupingSets, has_subclass(), PlannerInfo::hasHavingQual, PlannerInfo::hasJoinRTEs, PlannerInfo::hasLateralRTEs, PlannerInfo::hasPseudoConstantQuals, PlannerInfo::hasRecursion, Query::hasSubLinks, Query::hasTargetSRFs, Query::havingQual, RangeTblEntry::inh, inheritance_planner(), INHKIND_NONE, PlannerInfo::inhTargetKind, PlannerInfo::init_plans, IS_OUTER_JOIN, RangeTblEntry::joinaliasvars, Query::jointree, RangeTblEntry::jointype, lappend(), RangeTblEntry::lateral, lfirst, lfirst_node, Query::limitCount, Query::limitOffset, list_length(), makeNode, Max, PlannerInfo::minmax_aggs, PlannerInfo::multiexpr_params, NIL, PlannerInfo::non_recursive_path, Query::onConflict, OnConflictExpr::onConflictSet, OnConflictExpr::onConflictWhere, PlannerInfo::outer_params, PlannerInfo::parent_root, parse(), PlannerInfo::parse, PlannerInfo::partColsUpdated, PlannerInfo::plan_params, PlannerInfo::planner_cxt, preprocess_expression(), preprocess_function_rtes(), preprocess_qual_conditions(), preprocess_rowmarks(), PlannerInfo::processed_tlist, pull_up_sublinks(), pull_up_subqueries(), WithCheckOption::qual, PlannerInfo::qual_security_level, FromExpr::quals, PlannerInfo::query_level, reduce_outer_joins(), RangeTblEntry::relid, remove_useless_groupby_columns(), remove_useless_result_rtes(), replace_empty_jointree(), Query::resultRelation, Query::returningList, PlannerInfo::rowMarks, rt_fetch, Query::rtable, RTE_FUNCTION, RTE_JOIN, RTE_RELATION, RTE_RESULT, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RangeTblEntry::rtekind, RangeTblEntry::securityQuals, set_cheapest(), Query::setOperations, SS_charge_for_initplans(), SS_identify_outer_params(), SS_process_ctes(), WindowClause::startOffset, RangeTblEntry::subquery, RangeTblEntry::tablefunc, RangeTblEntry::tablesample, Query::targetList, PlannerInfo::upper_rels, PlannerInfo::upper_targets, UPPERREL_FINAL, RangeTblEntry::values_lists, Query::windowClause, Query::withCheckOptions, and PlannerInfo::wt_param_id.

Referenced by make_subplan(), recurse_set_operations(), set_subquery_pathlist(), SS_process_ctes(), and standard_planner().

599 {
600  PlannerInfo *root;
601  List *newWithCheckOptions;
602  List *newHaving;
603  bool hasOuterJoins;
604  bool hasResultRTEs;
605  RelOptInfo *final_rel;
606  ListCell *l;
607 
608  /* Create a PlannerInfo data structure for this subquery */
609  root = makeNode(PlannerInfo);
610  root->parse = parse;
611  root->glob = glob;
612  root->query_level = parent_root ? parent_root->query_level + 1 : 1;
613  root->parent_root = parent_root;
614  root->plan_params = NIL;
615  root->outer_params = NULL;
617  root->init_plans = NIL;
618  root->cte_plan_ids = NIL;
619  root->multiexpr_params = NIL;
620  root->eq_classes = NIL;
621  root->ec_merging_done = false;
622  root->append_rel_list = NIL;
623  root->rowMarks = NIL;
624  memset(root->upper_rels, 0, sizeof(root->upper_rels));
625  memset(root->upper_targets, 0, sizeof(root->upper_targets));
626  root->processed_tlist = NIL;
627  root->grouping_map = NULL;
628  root->minmax_aggs = NIL;
629  root->qual_security_level = 0;
630  root->inhTargetKind = INHKIND_NONE;
631  root->hasRecursion = hasRecursion;
632  if (hasRecursion)
634  else
635  root->wt_param_id = -1;
636  root->non_recursive_path = NULL;
637  root->partColsUpdated = false;
638 
639  /*
640  * If there is a WITH list, process each WITH query and either convert it
641  * to RTE_SUBQUERY RTE(s) or build an initplan SubPlan structure for it.
642  */
643  if (parse->cteList)
644  SS_process_ctes(root);
645 
646  /*
647  * If the FROM clause is empty, replace it with a dummy RTE_RESULT RTE, so
648  * that we don't need so many special cases to deal with that situation.
649  */
650  replace_empty_jointree(parse);
651 
652  /*
653  * Look for ANY and EXISTS SubLinks in WHERE and JOIN/ON clauses, and try
654  * to transform them into joins. Note that this step does not descend
655  * into subqueries; if we pull up any subqueries below, their SubLinks are
656  * processed just before pulling them up.
657  */
658  if (parse->hasSubLinks)
659  pull_up_sublinks(root);
660 
661  /*
662  * Scan the rangetable for function RTEs, do const-simplification on them,
663  * and then inline them if possible (producing subqueries that might get
664  * pulled up next). Recursion issues here are handled in the same way as
665  * for SubLinks.
666  */
668 
669  /*
670  * Check to see if any subqueries in the jointree can be merged into this
671  * query.
672  */
673  pull_up_subqueries(root);
674 
675  /*
676  * If this is a simple UNION ALL query, flatten it into an appendrel. We
677  * do this now because it requires applying pull_up_subqueries to the leaf
678  * queries of the UNION ALL, which weren't touched above because they
679  * weren't referenced by the jointree (they will be after we do this).
680  */
681  if (parse->setOperations)
683 
684  /*
685  * Survey the rangetable to see what kinds of entries are present. We can
686  * skip some later processing if relevant SQL features are not used; for
687  * example if there are no JOIN RTEs we can avoid the expense of doing
688  * flatten_join_alias_vars(). This must be done after we have finished
689  * adding rangetable entries, of course. (Note: actually, processing of
690  * inherited or partitioned rels can cause RTEs for their child tables to
691  * get added later; but those must all be RTE_RELATION entries, so they
692  * don't invalidate the conclusions drawn here.)
693  */
694  root->hasJoinRTEs = false;
695  root->hasLateralRTEs = false;
696  hasOuterJoins = false;
697  hasResultRTEs = false;
698  foreach(l, parse->rtable)
699  {
701 
702  switch (rte->rtekind)
703  {
704  case RTE_RELATION:
705  if (rte->inh)
706  {
707  /*
708  * Check to see if the relation actually has any children;
709  * if not, clear the inh flag so we can treat it as a
710  * plain base relation.
711  *
712  * Note: this could give a false-positive result, if the
713  * rel once had children but no longer does. We used to
714  * be able to clear rte->inh later on when we discovered
715  * that, but no more; we have to handle such cases as
716  * full-fledged inheritance.
717  */
718  rte->inh = has_subclass(rte->relid);
719  }
720  break;
721  case RTE_JOIN:
722  root->hasJoinRTEs = true;
723  if (IS_OUTER_JOIN(rte->jointype))
724  hasOuterJoins = true;
725  break;
726  case RTE_RESULT:
727  hasResultRTEs = true;
728  break;
729  default:
730  /* No work here for other RTE types */
731  break;
732  }
733 
734  if (rte->lateral)
735  root->hasLateralRTEs = true;
736 
737  /*
738  * We can also determine the maximum security level required for any
739  * securityQuals now. Addition of inheritance-child RTEs won't affect
740  * this, because child tables don't have their own securityQuals; see
741  * expand_single_inheritance_child().
742  */
743  if (rte->securityQuals)
745  list_length(rte->securityQuals));
746  }
747 
748  /*
749  * Preprocess RowMark information. We need to do this after subquery
750  * pullup, so that all base relations are present.
751  */
752  preprocess_rowmarks(root);
753 
754  /*
755  * Set hasHavingQual to remember if HAVING clause is present. Needed
756  * because preprocess_expression will reduce a constant-true condition to
757  * an empty qual list ... but "HAVING TRUE" is not a semantic no-op.
758  */
759  root->hasHavingQual = (parse->havingQual != NULL);
760 
761  /* Clear this flag; might get set in distribute_qual_to_rels */
762  root->hasPseudoConstantQuals = false;
763 
764  /*
765  * Do expression preprocessing on targetlist and quals, as well as other
766  * random expressions in the querytree. Note that we do not need to
767  * handle sort/group expressions explicitly, because they are actually
768  * part of the targetlist.
769  */
770  parse->targetList = (List *)
771  preprocess_expression(root, (Node *) parse->targetList,
773 
774  /* Constant-folding might have removed all set-returning functions */
775  if (parse->hasTargetSRFs)
777 
778  newWithCheckOptions = NIL;
779  foreach(l, parse->withCheckOptions)
780  {
782 
783  wco->qual = preprocess_expression(root, wco->qual,
784  EXPRKIND_QUAL);
785  if (wco->qual != NULL)
786  newWithCheckOptions = lappend(newWithCheckOptions, wco);
787  }
788  parse->withCheckOptions = newWithCheckOptions;
789 
790  parse->returningList = (List *)
791  preprocess_expression(root, (Node *) parse->returningList,
793 
794  preprocess_qual_conditions(root, (Node *) parse->jointree);
795 
796  parse->havingQual = preprocess_expression(root, parse->havingQual,
797  EXPRKIND_QUAL);
798 
799  foreach(l, parse->windowClause)
800  {
802 
803  /* partitionClause/orderClause are sort/group expressions */
806  wc->endOffset = preprocess_expression(root, wc->endOffset,
808  }
809 
810  parse->limitOffset = preprocess_expression(root, parse->limitOffset,
812  parse->limitCount = preprocess_expression(root, parse->limitCount,
814 
815  if (parse->onConflict)
816  {
817  parse->onConflict->arbiterElems = (List *)
819  (Node *) parse->onConflict->arbiterElems,
821  parse->onConflict->arbiterWhere =
823  parse->onConflict->arbiterWhere,
824  EXPRKIND_QUAL);
825  parse->onConflict->onConflictSet = (List *)
827  (Node *) parse->onConflict->onConflictSet,
829  parse->onConflict->onConflictWhere =
831  parse->onConflict->onConflictWhere,
832  EXPRKIND_QUAL);
833  /* exclRelTlist contains only Vars, so no preprocessing needed */
834  }
835 
836  root->append_rel_list = (List *)
839 
840  /* Also need to preprocess expressions within RTEs */
841  foreach(l, parse->rtable)
842  {
844  int kind;
845  ListCell *lcsq;
846 
847  if (rte->rtekind == RTE_RELATION)
848  {
849  if (rte->tablesample)
850  rte->tablesample = (TableSampleClause *)
852  (Node *) rte->tablesample,
854  }
855  else if (rte->rtekind == RTE_SUBQUERY)
856  {
857  /*
858  * We don't want to do all preprocessing yet on the subquery's
859  * expressions, since that will happen when we plan it. But if it
860  * contains any join aliases of our level, those have to get
861  * expanded now, because planning of the subquery won't do it.
862  * That's only possible if the subquery is LATERAL.
863  */
864  if (rte->lateral && root->hasJoinRTEs)
865  rte->subquery = (Query *)
867  (Node *) rte->subquery);
868  }
869  else if (rte->rtekind == RTE_FUNCTION)
870  {
871  /* Preprocess the function expression(s) fully */
873  rte->functions = (List *)
874  preprocess_expression(root, (Node *) rte->functions, kind);
875  }
876  else if (rte->rtekind == RTE_TABLEFUNC)
877  {
878  /* Preprocess the function expression(s) fully */
880  rte->tablefunc = (TableFunc *)
881  preprocess_expression(root, (Node *) rte->tablefunc, kind);
882  }
883  else if (rte->rtekind == RTE_VALUES)
884  {
885  /* Preprocess the values lists fully */
887  rte->values_lists = (List *)
888  preprocess_expression(root, (Node *) rte->values_lists, kind);
889  }
890 
891  /*
892  * Process each element of the securityQuals list as if it were a
893  * separate qual expression (as indeed it is). We need to do it this
894  * way to get proper canonicalization of AND/OR structure. Note that
895  * this converts each element into an implicit-AND sublist.
896  */
897  foreach(lcsq, rte->securityQuals)
898  {
899  lfirst(lcsq) = preprocess_expression(root,
900  (Node *) lfirst(lcsq),
901  EXPRKIND_QUAL);
902  }
903  }
904 
905  /*
906  * Now that we are done preprocessing expressions, and in particular done
907  * flattening join alias variables, get rid of the joinaliasvars lists.
908  * They no longer match what expressions in the rest of the tree look
909  * like, because we have not preprocessed expressions in those lists (and
910  * do not want to; for example, expanding a SubLink there would result in
911  * a useless unreferenced subplan). Leaving them in place simply creates
912  * a hazard for later scans of the tree. We could try to prevent that by
913  * using QTW_IGNORE_JOINALIASES in every tree scan done after this point,
914  * but that doesn't sound very reliable.
915  */
916  if (root->hasJoinRTEs)
917  {
918  foreach(l, parse->rtable)
919  {
921 
922  rte->joinaliasvars = NIL;
923  }
924  }
925 
926  /*
927  * In some cases we may want to transfer a HAVING clause into WHERE. We
928  * cannot do so if the HAVING clause contains aggregates (obviously) or
929  * volatile functions (since a HAVING clause is supposed to be executed
930  * only once per group). We also can't do this if there are any nonempty
931  * grouping sets; moving such a clause into WHERE would potentially change
932  * the results, if any referenced column isn't present in all the grouping
933  * sets. (If there are only empty grouping sets, then the HAVING clause
934  * must be degenerate as discussed below.)
935  *
936  * Also, it may be that the clause is so expensive to execute that we're
937  * better off doing it only once per group, despite the loss of
938  * selectivity. This is hard to estimate short of doing the entire
939  * planning process twice, so we use a heuristic: clauses containing
940  * subplans are left in HAVING. Otherwise, we move or copy the HAVING
941  * clause into WHERE, in hopes of eliminating tuples before aggregation
942  * instead of after.
943  *
944  * If the query has explicit grouping then we can simply move such a
945  * clause into WHERE; any group that fails the clause will not be in the
946  * output because none of its tuples will reach the grouping or
947  * aggregation stage. Otherwise we must have a degenerate (variable-free)
948  * HAVING clause, which we put in WHERE so that query_planner() can use it
949  * in a gating Result node, but also keep in HAVING to ensure that we
950  * don't emit a bogus aggregated row. (This could be done better, but it
951  * seems not worth optimizing.)
952  *
953  * Note that both havingQual and parse->jointree->quals are in
954  * implicitly-ANDed-list form at this point, even though they are declared
955  * as Node *.
956  */
957  newHaving = NIL;
958  foreach(l, (List *) parse->havingQual)
959  {
960  Node *havingclause = (Node *) lfirst(l);
961 
962  if ((parse->groupClause && parse->groupingSets) ||
963  contain_agg_clause(havingclause) ||
964  contain_volatile_functions(havingclause) ||
965  contain_subplans(havingclause))
966  {
967  /* keep it in HAVING */
968  newHaving = lappend(newHaving, havingclause);
969  }
970  else if (parse->groupClause && !parse->groupingSets)
971  {
972  /* move it to WHERE */
973  parse->jointree->quals = (Node *)
974  lappend((List *) parse->jointree->quals, havingclause);
975  }
976  else
977  {
978  /* put a copy in WHERE, keep it in HAVING */
979  parse->jointree->quals = (Node *)
980  lappend((List *) parse->jointree->quals,
981  copyObject(havingclause));
982  newHaving = lappend(newHaving, havingclause);
983  }
984  }
985  parse->havingQual = (Node *) newHaving;
986 
987  /* Remove any redundant GROUP BY columns */
989 
990  /*
991  * If we have any outer joins, try to reduce them to plain inner joins.
992  * This step is most easily done after we've done expression
993  * preprocessing.
994  */
995  if (hasOuterJoins)
996  reduce_outer_joins(root);
997 
998  /*
999  * If we have any RTE_RESULT relations, see if they can be deleted from
1000  * the jointree. This step is most effectively done after we've done
1001  * expression preprocessing and outer join reduction.
1002  */
1003  if (hasResultRTEs)
1005 
1006  /*
1007  * Do the main planning. If we have an inherited target relation, that
1008  * needs special processing, else go straight to grouping_planner.
1009  */
1010  if (parse->resultRelation &&
1011  rt_fetch(parse->resultRelation, parse->rtable)->inh)
1012  inheritance_planner(root);
1013  else
1014  grouping_planner(root, false, tuple_fraction);
1015 
1016  /*
1017  * Capture the set of outer-level param IDs we have access to, for use in
1018  * extParam/allParam calculations later.
1019  */
1021 
1022  /*
1023  * If any initPlans were created in this query level, adjust the surviving
1024  * Paths' costs and parallel-safety flags to account for them. The
1025  * initPlans won't actually get attached to the plan tree till
1026  * create_plan() runs, but we must include their effects now.
1027  */
1028  final_rel = fetch_upper_rel(root, UPPERREL_FINAL, NULL);
1029  SS_charge_for_initplans(root, final_rel);
1030 
1031  /*
1032  * Make sure we've identified the cheapest Path for the final rel. (By
1033  * doing this here not in grouping_planner, we include initPlan costs in
1034  * the decision, though it's unlikely that will change anything.)
1035  */
1036  set_cheapest(final_rel);
1037 
1038  return root;
1039 }
Node * limitOffset
Definition: parsenodes.h:160
#define NIL
Definition: pg_list.h:65
List * rowMarks
Definition: pathnodes.h:290
void remove_useless_result_rtes(PlannerInfo *root)
Query * parse
Definition: pathnodes.h:177
List * joinaliasvars
Definition: parsenodes.h:1030
List * plan_params
Definition: pathnodes.h:191
bool hasJoinRTEs
Definition: pathnodes.h:343
bool ec_merging_done
Definition: pathnodes.h:266
#define EXPRKIND_ARBITER_ELEM
Definition: planner.c:92
void reduce_outer_joins(PlannerInfo *root)
FromExpr * jointree
Definition: parsenodes.h:138
OnConflictExpr * onConflict
Definition: parsenodes.h:144
PlannerInfo * parent_root
Definition: pathnodes.h:183
static void preprocess_rowmarks(PlannerInfo *root)
Definition: planner.c:2645
List * withCheckOptions
Definition: parsenodes.h:171
List * securityQuals
Definition: parsenodes.h:1102
#define EXPRKIND_APPINFO
Definition: planner.c:89
#define EXPRKIND_QUAL
Definition: planner.c:82
#define EXPRKIND_TABLEFUNC_LATERAL
Definition: planner.c:94
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:670
int resultRelation
Definition: parsenodes.h:122
void SS_charge_for_initplans(PlannerInfo *root, RelOptInfo *final_rel)
Definition: subselect.c:2061
#define IS_OUTER_JOIN(jointype)
Definition: nodes.h:741
#define EXPRKIND_RTFUNC
Definition: planner.c:84
List * groupingSets
Definition: parsenodes.h:150
Definition: nodes.h:525
static Node * preprocess_expression(PlannerInfo *root, Node *expr, int kind)
Definition: planner.c:1048
List * minmax_aggs
Definition: pathnodes.h:327
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:724
int assign_special_exec_param(PlannerInfo *root)
Definition: paramassign.c:585
#define EXPRKIND_VALUES_LATERAL
Definition: planner.c:87
AttrNumber * grouping_map
Definition: pathnodes.h:326
bool hasRecursion
Definition: pathnodes.h:348
void pull_up_subqueries(PlannerInfo *root)
Definition: prepjointree.c:676
#define EXPRKIND_TARGET
Definition: planner.c:83
void replace_empty_jointree(Query *parse)
Definition: prepjointree.c:146
List * values_lists
Definition: parsenodes.h:1051
Node * quals
Definition: primnodes.h:1497
List * windowClause
Definition: parsenodes.h:154
List * targetList
Definition: parsenodes.h:140
List * arbiterElems
Definition: primnodes.h:1515
List * multiexpr_params
Definition: pathnodes.h:261
bool contain_subplans(Node *clause)
Definition: clauses.c:610
#define EXPRKIND_LIMIT
Definition: planner.c:88
void preprocess_function_rtes(PlannerInfo *root)
Definition: prepjointree.c:635
int wt_param_id
Definition: pathnodes.h:351
bool has_subclass(Oid relationId)
Definition: pg_inherits.c:266
List * rtable
Definition: parsenodes.h:137
TableFunc * tablefunc
Definition: parsenodes.h:1046
bool hasLateralRTEs
Definition: pathnodes.h:344
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1164
#define lfirst_node(type, lc)
Definition: pg_list.h:193
static void remove_useless_groupby_columns(PlannerInfo *root)
Definition: planner.c:3064
Node * limitCount
Definition: parsenodes.h:161
PlannerGlobal * glob
Definition: pathnodes.h:179
bool partColsUpdated
Definition: pathnodes.h:362
JoinType jointype
Definition: parsenodes.h:1029
MemoryContext CurrentMemoryContext
Definition: mcxt.c:38
void SS_process_ctes(PlannerInfo *root)
Definition: subselect.c:830
List * returningList
Definition: parsenodes.h:146
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
List * lappend(List *list, void *datum)
Definition: list.c:322
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:245
Node * startOffset
Definition: parsenodes.h:1333
List * append_rel_list
Definition: pathnodes.h:288
List * cte_plan_ids
Definition: pathnodes.h:259
List * init_plans
Definition: pathnodes.h:257
bool hasPseudoConstantQuals
Definition: pathnodes.h:346
Node * flatten_join_alias_vars(Query *query, Node *node)
Definition: var.c:670
static void inheritance_planner(PlannerInfo *root)
Definition: planner.c:1208
bool hasTargetSRFs
Definition: parsenodes.h:127
#define Max(x, y)
Definition: c.h:898
#define makeNode(_type_)
Definition: nodes.h:573
#define lfirst(lc)
Definition: pg_list.h:190
void SS_identify_outer_params(PlannerInfo *root)
Definition: subselect.c:1999
List * eq_classes
Definition: pathnodes.h:264
List * functions
Definition: parsenodes.h:1040
InheritanceKind inhTargetKind
Definition: pathnodes.h:340
void flatten_simple_union_all(PlannerInfo *root)
Bitmapset * outer_params
Definition: pathnodes.h:192
struct Path * non_recursive_path
Definition: pathnodes.h:352
Node * endOffset
Definition: parsenodes.h:1334
static int list_length(const List *l)
Definition: pg_list.h:169
#define EXPRKIND_RTFUNC_LATERAL
Definition: planner.c:85
Index qual_security_level
Definition: pathnodes.h:337
Index query_level
Definition: pathnodes.h:181
void pull_up_sublinks(PlannerInfo *root)
Definition: prepjointree.c:204
RTEKind rtekind
Definition: parsenodes.h:974
Node * arbiterWhere
Definition: primnodes.h:1517
List * cteList
Definition: parsenodes.h:135
Node * setOperations
Definition: parsenodes.h:165
bool contain_agg_clause(Node *clause)
Definition: clauses.c:179
Query * subquery
Definition: parsenodes.h:1009
List * groupClause
Definition: parsenodes.h:148
bool hasSubLinks
Definition: parsenodes.h:128
static void grouping_planner(PlannerInfo *root, bool inheritance_update, double tuple_fraction)
Definition: planner.c:1829
static void preprocess_qual_conditions(PlannerInfo *root, Node *jtnode)
Definition: planner.c:1139
List * onConflictSet
Definition: primnodes.h:1521
bool hasHavingQual
Definition: pathnodes.h:345
#define EXPRKIND_TABLESAMPLE
Definition: planner.c:91
MemoryContext planner_cxt
Definition: pathnodes.h:329
#define copyObject(obj)
Definition: nodes.h:641
#define EXPRKIND_VALUES
Definition: planner.c:86
Node * havingQual
Definition: parsenodes.h:152
List * processed_tlist
Definition: pathnodes.h:323
Node * onConflictWhere
Definition: primnodes.h:1522
Definition: pg_list.h:50
struct TableSampleClause * tablesample
Definition: parsenodes.h:1004
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:648
struct PathTarget * upper_targets[UPPERREL_FINAL+1]
Definition: pathnodes.h:312
#define EXPRKIND_TABLEFUNC
Definition: planner.c:93
List * upper_rels[UPPERREL_FINAL+1]
Definition: pathnodes.h:309

Variable Documentation

◆ create_upper_paths_hook

◆ planner_hook

Definition at line 75 of file planner.c.

Referenced by planner().