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, const char *query_string, 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, const char *query_string, 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 33 of file planner.h.

◆ planner_hook_type

typedef PlannedStmt*(* planner_hook_type) (Query *parse, const char *query_string, 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 6272 of file planner.c.

6273 {
6274  Path *best_path = rel->cheapest_total_path;
6275  ListCell *l;
6276 
6277  /* If all tuples will be retrieved, just return the cheapest-total path */
6278  if (tuple_fraction <= 0.0)
6279  return best_path;
6280 
6281  /* Convert absolute # of tuples to a fraction; no need to clamp to 0..1 */
6282  if (tuple_fraction >= 1.0 && best_path->rows > 0)
6283  tuple_fraction /= best_path->rows;
6284 
6285  foreach(l, rel->pathlist)
6286  {
6287  Path *path = (Path *) lfirst(l);
6288 
6289  if (path == rel->cheapest_total_path ||
6290  compare_fractional_path_costs(best_path, path, tuple_fraction) <= 0)
6291  continue;
6292 
6293  best_path = path;
6294  }
6295 
6296  return best_path;
6297 }
int compare_fractional_path_costs(Path *path1, Path *path2, double fraction)
Definition: pathnode.c:117
#define lfirst(lc)
Definition: pg_list.h:172
Cardinality rows
Definition: pathnodes.h:1628
List * pathlist
Definition: pathnodes.h:883
struct Path * cheapest_total_path
Definition: pathnodes.h:887

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

◆ limit_needed()

bool limit_needed ( Query parse)

Definition at line 2583 of file planner.c.

2584 {
2585  Node *node;
2586 
2587  node = parse->limitCount;
2588  if (node)
2589  {
2590  if (IsA(node, Const))
2591  {
2592  /* NULL indicates LIMIT ALL, ie, no limit */
2593  if (!((Const *) node)->constisnull)
2594  return true; /* LIMIT with a constant value */
2595  }
2596  else
2597  return true; /* non-constant LIMIT */
2598  }
2599 
2600  node = parse->limitOffset;
2601  if (node)
2602  {
2603  if (IsA(node, Const))
2604  {
2605  /* Treat NULL as no offset; the executor would too */
2606  if (!((Const *) node)->constisnull)
2607  {
2608  int64 offset = DatumGetInt64(((Const *) node)->constvalue);
2609 
2610  if (offset != 0)
2611  return true; /* OFFSET with a nonzero value */
2612  }
2613  }
2614  else
2615  return true; /* non-constant OFFSET */
2616  }
2617 
2618  return false; /* don't need a Limit plan node */
2619 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:179
static int64 DatumGetInt64(Datum X)
Definition: postgres.h:385
static struct subre * parse(struct vars *v, int stopper, int type, struct state *init, struct state *final)
Definition: regcomp.c:715
Definition: nodes.h:129

References DatumGetInt64(), IsA, and parse().

Referenced by grouping_planner(), and set_rel_consider_parallel().

◆ mark_partial_aggref()

void mark_partial_aggref ( Aggref agg,
AggSplit  aggsplit 
)

Definition at line 5521 of file planner.c.

5522 {
5523  /* aggtranstype should be computed by this point */
5524  Assert(OidIsValid(agg->aggtranstype));
5525  /* ... but aggsplit should still be as the parser left it */
5526  Assert(agg->aggsplit == AGGSPLIT_SIMPLE);
5527 
5528  /* Mark the Aggref with the intended partial-aggregation mode */
5529  agg->aggsplit = aggsplit;
5530 
5531  /*
5532  * Adjust result type if needed. Normally, a partial aggregate returns
5533  * the aggregate's transition type; but if that's INTERNAL and we're
5534  * serializing, it returns BYTEA instead.
5535  */
5536  if (DO_AGGSPLIT_SKIPFINAL(aggsplit))
5537  {
5538  if (agg->aggtranstype == INTERNALOID && DO_AGGSPLIT_SERIALIZE(aggsplit))
5539  agg->aggtype = BYTEAOID;
5540  else
5541  agg->aggtype = agg->aggtranstype;
5542  }
5543 }
#define OidIsValid(objectId)
Definition: c.h:759
Assert(fmt[strlen(fmt) - 1] !='\n')
#define DO_AGGSPLIT_SKIPFINAL(as)
Definition: nodes.h:396
#define DO_AGGSPLIT_SERIALIZE(as)
Definition: nodes.h:397
@ AGGSPLIT_SIMPLE
Definition: nodes.h:387

References AGGSPLIT_SIMPLE, Assert(), DO_AGGSPLIT_SERIALIZE, DO_AGGSPLIT_SKIPFINAL, and OidIsValid.

Referenced by convert_combining_aggrefs(), and make_partial_grouping_target().

◆ preprocess_phv_expression()

Expr* preprocess_phv_expression ( PlannerInfo root,
Expr expr 
)

Definition at line 1242 of file planner.c.

1243 {
1244  return (Expr *) preprocess_expression(root, (Node *) expr, EXPRKIND_PHV);
1245 }
#define EXPRKIND_PHV
Definition: planner.c:92
static Node * preprocess_expression(PlannerInfo *root, Node *expr, int kind)
Definition: planner.c:1096

References EXPRKIND_PHV, and preprocess_expression().

Referenced by extract_lateral_references().

◆ select_rowmark_type()

RowMarkType select_rowmark_type ( RangeTblEntry rte,
LockClauseStrength  strength 
)

Definition at line 2332 of file planner.c.

2333 {
2334  if (rte->rtekind != RTE_RELATION)
2335  {
2336  /* If it's not a table at all, use ROW_MARK_COPY */
2337  return ROW_MARK_COPY;
2338  }
2339  else if (rte->relkind == RELKIND_FOREIGN_TABLE)
2340  {
2341  /* Let the FDW select the rowmark type, if it wants to */
2342  FdwRoutine *fdwroutine = GetFdwRoutineByRelId(rte->relid);
2343 
2344  if (fdwroutine->GetForeignRowMarkType != NULL)
2345  return fdwroutine->GetForeignRowMarkType(rte, strength);
2346  /* Otherwise, use ROW_MARK_COPY by default */
2347  return ROW_MARK_COPY;
2348  }
2349  else
2350  {
2351  /* Regular table, apply the appropriate lock type */
2352  switch (strength)
2353  {
2354  case LCS_NONE:
2355 
2356  /*
2357  * We don't need a tuple lock, only the ability to re-fetch
2358  * the row.
2359  */
2360  return ROW_MARK_REFERENCE;
2361  break;
2362  case LCS_FORKEYSHARE:
2363  return ROW_MARK_KEYSHARE;
2364  break;
2365  case LCS_FORSHARE:
2366  return ROW_MARK_SHARE;
2367  break;
2368  case LCS_FORNOKEYUPDATE:
2369  return ROW_MARK_NOKEYEXCLUSIVE;
2370  break;
2371  case LCS_FORUPDATE:
2372  return ROW_MARK_EXCLUSIVE;
2373  break;
2374  }
2375  elog(ERROR, "unrecognized LockClauseStrength %d", (int) strength);
2376  return ROW_MARK_EXCLUSIVE; /* keep compiler quiet */
2377  }
2378 }
#define ERROR
Definition: elog.h:39
FdwRoutine * GetFdwRoutineByRelId(Oid relid)
Definition: foreign.c:406
@ LCS_FORUPDATE
Definition: lockoptions.h:27
@ LCS_NONE
Definition: lockoptions.h:23
@ LCS_FORSHARE
Definition: lockoptions.h:25
@ LCS_FORKEYSHARE
Definition: lockoptions.h:24
@ LCS_FORNOKEYUPDATE
Definition: lockoptions.h:26
@ RTE_RELATION
Definition: parsenodes.h:1014
@ ROW_MARK_COPY
Definition: plannodes.h:1332
@ ROW_MARK_REFERENCE
Definition: plannodes.h:1331
@ ROW_MARK_SHARE
Definition: plannodes.h:1329
@ ROW_MARK_EXCLUSIVE
Definition: plannodes.h:1327
@ ROW_MARK_NOKEYEXCLUSIVE
Definition: plannodes.h:1328
@ ROW_MARK_KEYSHARE
Definition: plannodes.h:1330
GetForeignRowMarkType_function GetForeignRowMarkType
Definition: fdwapi.h:247
RTEKind rtekind
Definition: parsenodes.h:1033

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

◆ standard_planner()

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

Definition at line 286 of file planner.c.

288 {
289  PlannedStmt *result;
290  PlannerGlobal *glob;
291  double tuple_fraction;
292  PlannerInfo *root;
293  RelOptInfo *final_rel;
294  Path *best_path;
295  Plan *top_plan;
296  ListCell *lp,
297  *lr;
298 
299  /*
300  * Set up global state for this planner invocation. This data is needed
301  * across all levels of sub-Query that might exist in the given command,
302  * so we keep it in a separate struct that's linked to by each per-Query
303  * PlannerInfo.
304  */
305  glob = makeNode(PlannerGlobal);
306 
307  glob->boundParams = boundParams;
308  glob->subplans = NIL;
309  glob->subroots = NIL;
310  glob->rewindPlanIDs = NULL;
311  glob->finalrtable = NIL;
312  glob->finalrteperminfos = NIL;
313  glob->finalrowmarks = NIL;
314  glob->resultRelations = NIL;
315  glob->appendRelations = NIL;
316  glob->relationOids = NIL;
317  glob->invalItems = NIL;
318  glob->paramExecTypes = NIL;
319  glob->lastPHId = 0;
320  glob->lastRowMarkId = 0;
321  glob->lastPlanNodeId = 0;
322  glob->transientPlan = false;
323  glob->dependsOnRole = false;
324 
325  /*
326  * Assess whether it's feasible to use parallel mode for this query. We
327  * can't do this in a standalone backend, or if the command will try to
328  * modify any data, or if this is a cursor operation, or if GUCs are set
329  * to values that don't permit parallelism, or if parallel-unsafe
330  * functions are present in the query tree.
331  *
332  * (Note that we do allow CREATE TABLE AS, SELECT INTO, and CREATE
333  * MATERIALIZED VIEW to use parallel plans, but as of now, only the leader
334  * backend writes into a completely new table. In the future, we can
335  * extend it to allow workers to write into the table. However, to allow
336  * parallel updates and deletes, we have to solve other problems,
337  * especially around combo CIDs.)
338  *
339  * For now, we don't try to use parallel mode if we're running inside a
340  * parallel worker. We might eventually be able to relax this
341  * restriction, but for now it seems best not to have parallel workers
342  * trying to create their own parallel workers.
343  */
344  if ((cursorOptions & CURSOR_OPT_PARALLEL_OK) != 0 &&
346  parse->commandType == CMD_SELECT &&
347  !parse->hasModifyingCTE &&
349  !IsParallelWorker())
350  {
351  /* all the cheap tests pass, so scan the query tree */
353  glob->parallelModeOK = (glob->maxParallelHazard != PROPARALLEL_UNSAFE);
354  }
355  else
356  {
357  /* skip the query tree scan, just assume it's unsafe */
358  glob->maxParallelHazard = PROPARALLEL_UNSAFE;
359  glob->parallelModeOK = false;
360  }
361 
362  /*
363  * glob->parallelModeNeeded is normally set to false here and changed to
364  * true during plan creation if a Gather or Gather Merge plan is actually
365  * created (cf. create_gather_plan, create_gather_merge_plan).
366  *
367  * However, if debug_parallel_query = on or debug_parallel_query =
368  * regress, then we impose parallel mode whenever it's safe to do so, even
369  * if the final plan doesn't use parallelism. It's not safe to do so if
370  * the query contains anything parallel-unsafe; parallelModeOK will be
371  * false in that case. Note that parallelModeOK can't change after this
372  * point. Otherwise, everything in the query is either parallel-safe or
373  * parallel-restricted, and in either case it should be OK to impose
374  * parallel-mode restrictions. If that ends up breaking something, then
375  * either some function the user included in the query is incorrectly
376  * labeled as parallel-safe or parallel-restricted when in reality it's
377  * parallel-unsafe, or else the query planner itself has a bug.
378  */
379  glob->parallelModeNeeded = glob->parallelModeOK &&
381 
382  /* Determine what fraction of the plan is likely to be scanned */
383  if (cursorOptions & CURSOR_OPT_FAST_PLAN)
384  {
385  /*
386  * We have no real idea how many tuples the user will ultimately FETCH
387  * from a cursor, but it is often the case that he doesn't want 'em
388  * all, or would prefer a fast-start plan anyway so that he can
389  * process some of the tuples sooner. Use a GUC parameter to decide
390  * what fraction to optimize for.
391  */
392  tuple_fraction = cursor_tuple_fraction;
393 
394  /*
395  * We document cursor_tuple_fraction as simply being a fraction, which
396  * means the edge cases 0 and 1 have to be treated specially here. We
397  * convert 1 to 0 ("all the tuples") and 0 to a very small fraction.
398  */
399  if (tuple_fraction >= 1.0)
400  tuple_fraction = 0.0;
401  else if (tuple_fraction <= 0.0)
402  tuple_fraction = 1e-10;
403  }
404  else
405  {
406  /* Default assumption is we need all the tuples */
407  tuple_fraction = 0.0;
408  }
409 
410  /* primary planning entry point (may recurse for subqueries) */
411  root = subquery_planner(glob, parse, NULL,
412  false, tuple_fraction);
413 
414  /* Select best Path and turn it into a Plan */
415  final_rel = fetch_upper_rel(root, UPPERREL_FINAL, NULL);
416  best_path = get_cheapest_fractional_path(final_rel, tuple_fraction);
417 
418  top_plan = create_plan(root, best_path);
419 
420  /*
421  * If creating a plan for a scrollable cursor, make sure it can run
422  * backwards on demand. Add a Material node at the top at need.
423  */
424  if (cursorOptions & CURSOR_OPT_SCROLL)
425  {
426  if (!ExecSupportsBackwardScan(top_plan))
427  top_plan = materialize_finished_plan(top_plan);
428  }
429 
430  /*
431  * Optionally add a Gather node for testing purposes, provided this is
432  * actually a safe thing to do.
433  */
435  {
436  Gather *gather = makeNode(Gather);
437 
438  /*
439  * Top plan must not have any initPlans, else it shouldn't have been
440  * marked parallel-safe.
441  */
442  Assert(top_plan->initPlan == NIL);
443 
444  gather->plan.targetlist = top_plan->targetlist;
445  gather->plan.qual = NIL;
446  gather->plan.lefttree = top_plan;
447  gather->plan.righttree = NULL;
448  gather->num_workers = 1;
449  gather->single_copy = true;
451 
452  /*
453  * Since this Gather has no parallel-aware descendants to signal to,
454  * we don't need a rescan Param.
455  */
456  gather->rescan_param = -1;
457 
458  /*
459  * Ideally we'd use cost_gather here, but setting up dummy path data
460  * to satisfy it doesn't seem much cleaner than knowing what it does.
461  */
462  gather->plan.startup_cost = top_plan->startup_cost +
464  gather->plan.total_cost = top_plan->total_cost +
466  gather->plan.plan_rows = top_plan->plan_rows;
467  gather->plan.plan_width = top_plan->plan_width;
468  gather->plan.parallel_aware = false;
469  gather->plan.parallel_safe = false;
470 
471  /* use parallel mode for parallel plans. */
472  root->glob->parallelModeNeeded = true;
473 
474  top_plan = &gather->plan;
475  }
476 
477  /*
478  * If any Params were generated, run through the plan tree and compute
479  * each plan node's extParam/allParam sets. Ideally we'd merge this into
480  * set_plan_references' tree traversal, but for now it has to be separate
481  * because we need to visit subplans before not after main plan.
482  */
483  if (glob->paramExecTypes != NIL)
484  {
485  Assert(list_length(glob->subplans) == list_length(glob->subroots));
486  forboth(lp, glob->subplans, lr, glob->subroots)
487  {
488  Plan *subplan = (Plan *) lfirst(lp);
489  PlannerInfo *subroot = lfirst_node(PlannerInfo, lr);
490 
491  SS_finalize_plan(subroot, subplan);
492  }
493  SS_finalize_plan(root, top_plan);
494  }
495 
496  /* final cleanup of the plan */
497  Assert(glob->finalrtable == NIL);
498  Assert(glob->finalrteperminfos == NIL);
499  Assert(glob->finalrowmarks == NIL);
500  Assert(glob->resultRelations == NIL);
501  Assert(glob->appendRelations == NIL);
502  top_plan = set_plan_references(root, top_plan);
503  /* ... and the subplans (both regular subplans and initplans) */
504  Assert(list_length(glob->subplans) == list_length(glob->subroots));
505  forboth(lp, glob->subplans, lr, glob->subroots)
506  {
507  Plan *subplan = (Plan *) lfirst(lp);
508  PlannerInfo *subroot = lfirst_node(PlannerInfo, lr);
509 
510  lfirst(lp) = set_plan_references(subroot, subplan);
511  }
512 
513  /* build the PlannedStmt result */
514  result = makeNode(PlannedStmt);
515 
516  result->commandType = parse->commandType;
517  result->queryId = parse->queryId;
518  result->hasReturning = (parse->returningList != NIL);
519  result->hasModifyingCTE = parse->hasModifyingCTE;
520  result->canSetTag = parse->canSetTag;
521  result->transientPlan = glob->transientPlan;
522  result->dependsOnRole = glob->dependsOnRole;
523  result->parallelModeNeeded = glob->parallelModeNeeded;
524  result->planTree = top_plan;
525  result->rtable = glob->finalrtable;
526  result->permInfos = glob->finalrteperminfos;
527  result->resultRelations = glob->resultRelations;
528  result->appendRelations = glob->appendRelations;
529  result->subplans = glob->subplans;
530  result->rewindPlanIDs = glob->rewindPlanIDs;
531  result->rowMarks = glob->finalrowmarks;
532  result->relationOids = glob->relationOids;
533  result->invalItems = glob->invalItems;
534  result->paramExecTypes = glob->paramExecTypes;
535  /* utilityStmt should be null, but we might as well copy it */
536  result->utilityStmt = parse->utilityStmt;
537  result->stmt_location = parse->stmt_location;
538  result->stmt_len = parse->stmt_len;
539 
540  result->jitFlags = PGJIT_NONE;
541  if (jit_enabled && jit_above_cost >= 0 &&
542  top_plan->total_cost > jit_above_cost)
543  {
544  result->jitFlags |= PGJIT_PERFORM;
545 
546  /*
547  * Decide how much effort should be put into generating better code.
548  */
549  if (jit_optimize_above_cost >= 0 &&
551  result->jitFlags |= PGJIT_OPT3;
552  if (jit_inline_above_cost >= 0 &&
553  top_plan->total_cost > jit_inline_above_cost)
554  result->jitFlags |= PGJIT_INLINE;
555 
556  /*
557  * Decide which operations should be JITed.
558  */
559  if (jit_expressions)
560  result->jitFlags |= PGJIT_EXPR;
562  result->jitFlags |= PGJIT_DEFORM;
563  }
564 
565  if (glob->partition_directory != NULL)
566  DestroyPartitionDirectory(glob->partition_directory);
567 
568  return result;
569 }
char max_parallel_hazard(Query *parse)
Definition: clauses.c:651
int max_parallel_workers_per_gather
Definition: costsize.c:133
double parallel_setup_cost
Definition: costsize.c:126
double parallel_tuple_cost
Definition: costsize.c:125
Plan * create_plan(PlannerInfo *root, Path *best_path)
Definition: createplan.c:335
Plan * materialize_finished_plan(Plan *subplan)
Definition: createplan.c:6485
bool ExecSupportsBackwardScan(Plan *node)
Definition: execAmi.c:512
bool IsUnderPostmaster
Definition: globals.c:113
#define IsParallelWorker()
Definition: parallel.h:61
double jit_optimize_above_cost
Definition: jit.c:41
bool jit_enabled
Definition: jit.c:32
bool jit_expressions
Definition: jit.c:36
bool jit_tuple_deforming
Definition: jit.c:38
double jit_above_cost
Definition: jit.c:39
double jit_inline_above_cost
Definition: jit.c:40
#define PGJIT_OPT3
Definition: jit.h:21
#define PGJIT_NONE
Definition: jit.h:19
#define PGJIT_EXPR
Definition: jit.h:23
#define PGJIT_DEFORM
Definition: jit.h:24
#define PGJIT_INLINE
Definition: jit.h:22
#define PGJIT_PERFORM
Definition: jit.h:20
@ CMD_SELECT
Definition: nodes.h:276
#define makeNode(_type_)
Definition: nodes.h:176
@ DEBUG_PARALLEL_REGRESS
Definition: optimizer.h:107
@ DEBUG_PARALLEL_OFF
Definition: optimizer.h:105
#define CURSOR_OPT_SCROLL
Definition: parsenodes.h:3114
#define CURSOR_OPT_FAST_PLAN
Definition: parsenodes.h:3120
#define CURSOR_OPT_PARALLEL_OK
Definition: parsenodes.h:3123
void DestroyPartitionDirectory(PartitionDirectory pdir)
Definition: partdesc.c:444
@ UPPERREL_FINAL
Definition: pathnodes.h:79
#define lfirst_node(type, lc)
Definition: pg_list.h:176
static int list_length(const List *l)
Definition: pg_list.h:152
#define NIL
Definition: pg_list.h:68
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:467
double cursor_tuple_fraction
Definition: planner.c:72
PlannerInfo * subquery_planner(PlannerGlobal *glob, Query *parse, PlannerInfo *parent_root, bool hasRecursion, double tuple_fraction)
Definition: planner.c:601
int debug_parallel_query
Definition: planner.c:73
Path * get_cheapest_fractional_path(RelOptInfo *rel, double tuple_fraction)
Definition: planner.c:6272
e
Definition: preproc-init.c:82
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1439
Plan * set_plan_references(PlannerInfo *root, Plan *plan)
Definition: setrefs.c:287
int num_workers
Definition: plannodes.h:1141
bool invisible
Definition: plannodes.h:1144
bool single_copy
Definition: plannodes.h:1143
Plan plan
Definition: plannodes.h:1140
int rescan_param
Definition: plannodes.h:1142
struct Plan * lefttree
Definition: plannodes.h:155
Cost total_cost
Definition: plannodes.h:130
struct Plan * righttree
Definition: plannodes.h:156
bool parallel_aware
Definition: plannodes.h:141
Cost startup_cost
Definition: plannodes.h:129
List * qual
Definition: plannodes.h:154
int plan_width
Definition: plannodes.h:136
bool parallel_safe
Definition: plannodes.h:142
Cardinality plan_rows
Definition: plannodes.h:135
List * targetlist
Definition: plannodes.h:153
List * initPlan
Definition: plannodes.h:157
struct Plan * planTree
Definition: plannodes.h:71
bool hasModifyingCTE
Definition: plannodes.h:59
List * appendRelations
Definition: plannodes.h:81
List * permInfos
Definition: plannodes.h:75
bool canSetTag
Definition: plannodes.h:61
List * rowMarks
Definition: plannodes.h:88
int stmt_location
Definition: plannodes.h:99
int stmt_len
Definition: plannodes.h:100
int jitFlags
Definition: plannodes.h:69
Bitmapset * rewindPlanIDs
Definition: plannodes.h:86
bool hasReturning
Definition: plannodes.h:57
List * invalItems
Definition: plannodes.h:92
bool transientPlan
Definition: plannodes.h:63
List * resultRelations
Definition: plannodes.h:79
List * subplans
Definition: plannodes.h:83
List * relationOids
Definition: plannodes.h:90
bool dependsOnRole
Definition: plannodes.h:65
CmdType commandType
Definition: plannodes.h:53
Node * utilityStmt
Definition: plannodes.h:96
List * rtable
Definition: plannodes.h:73
List * paramExecTypes
Definition: plannodes.h:94
bool parallelModeNeeded
Definition: plannodes.h:67
uint64 queryId
Definition: plannodes.h:55
int lastPlanNodeId
Definition: pathnodes.h:144
char maxParallelHazard
Definition: pathnodes.h:159
List * subplans
Definition: pathnodes.h:105
bool dependsOnRole
Definition: pathnodes.h:150
List * appendRelations
Definition: pathnodes.h:126
List * finalrowmarks
Definition: pathnodes.h:120
List * invalItems
Definition: pathnodes.h:132
List * relationOids
Definition: pathnodes.h:129
List * paramExecTypes
Definition: pathnodes.h:135
bool parallelModeOK
Definition: pathnodes.h:153
bool transientPlan
Definition: pathnodes.h:147
Bitmapset * rewindPlanIDs
Definition: pathnodes.h:111
List * finalrteperminfos
Definition: pathnodes.h:117
Index lastPHId
Definition: pathnodes.h:138
Index lastRowMarkId
Definition: pathnodes.h:141
List * resultRelations
Definition: pathnodes.h:123
List * finalrtable
Definition: pathnodes.h:114
bool parallelModeNeeded
Definition: pathnodes.h:156
PlannerGlobal * glob
Definition: pathnodes.h:202
void SS_finalize_plan(PlannerInfo *root, Plan *plan)
Definition: subselect.c:2206

References PlannerGlobal::appendRelations, PlannedStmt::appendRelations, Assert(), PlannedStmt::canSetTag, CMD_SELECT, PlannedStmt::commandType, create_plan(), CURSOR_OPT_FAST_PLAN, CURSOR_OPT_PARALLEL_OK, CURSOR_OPT_SCROLL, cursor_tuple_fraction, DEBUG_PARALLEL_OFF, debug_parallel_query, DEBUG_PARALLEL_REGRESS, PlannerGlobal::dependsOnRole, PlannedStmt::dependsOnRole, DestroyPartitionDirectory(), ExecSupportsBackwardScan(), fetch_upper_rel(), PlannerGlobal::finalrowmarks, PlannerGlobal::finalrtable, PlannerGlobal::finalrteperminfos, forboth, get_cheapest_fractional_path(), PlannerInfo::glob, PlannedStmt::hasModifyingCTE, PlannedStmt::hasReturning, Plan::initPlan, PlannerGlobal::invalItems, PlannedStmt::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, PlannerGlobal::parallelModeNeeded, PlannedStmt::parallelModeNeeded, PlannerGlobal::parallelModeOK, PlannerGlobal::paramExecTypes, PlannedStmt::paramExecTypes, parse(), PlannedStmt::permInfos, 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, PlannerGlobal::relationOids, PlannedStmt::relationOids, Gather::rescan_param, PlannerGlobal::resultRelations, PlannedStmt::resultRelations, PlannerGlobal::rewindPlanIDs, PlannedStmt::rewindPlanIDs, Plan::righttree, PlannedStmt::rowMarks, PlannedStmt::rtable, set_plan_references(), Gather::single_copy, SS_finalize_plan(), Plan::startup_cost, PlannedStmt::stmt_len, PlannedStmt::stmt_location, PlannerGlobal::subplans, PlannedStmt::subplans, subquery_planner(), Plan::targetlist, Plan::total_cost, PlannerGlobal::transientPlan, PlannedStmt::transientPlan, UPPERREL_FINAL, and PlannedStmt::utilityStmt.

Referenced by delay_execution_planner(), pgss_planner(), and planner().

◆ subquery_planner()

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

Definition at line 601 of file planner.c.

604 {
605  PlannerInfo *root;
606  List *newWithCheckOptions;
607  List *newHaving;
608  bool hasOuterJoins;
609  bool hasResultRTEs;
610  RelOptInfo *final_rel;
611  ListCell *l;
612 
613  /* Create a PlannerInfo data structure for this subquery */
614  root = makeNode(PlannerInfo);
615  root->parse = parse;
616  root->glob = glob;
617  root->query_level = parent_root ? parent_root->query_level + 1 : 1;
618  root->parent_root = parent_root;
619  root->plan_params = NIL;
620  root->outer_params = NULL;
621  root->planner_cxt = CurrentMemoryContext;
622  root->init_plans = NIL;
623  root->cte_plan_ids = NIL;
624  root->multiexpr_params = NIL;
625  root->join_domains = NIL;
626  root->eq_classes = NIL;
627  root->ec_merging_done = false;
628  root->last_rinfo_serial = 0;
629  root->all_result_relids =
630  parse->resultRelation ? bms_make_singleton(parse->resultRelation) : NULL;
631  root->leaf_result_relids = NULL; /* we'll find out leaf-ness later */
632  root->append_rel_list = NIL;
633  root->row_identity_vars = NIL;
634  root->rowMarks = NIL;
635  memset(root->upper_rels, 0, sizeof(root->upper_rels));
636  memset(root->upper_targets, 0, sizeof(root->upper_targets));
637  root->processed_groupClause = NIL;
639  root->processed_tlist = NIL;
640  root->update_colnos = NIL;
641  root->grouping_map = NULL;
642  root->minmax_aggs = NIL;
643  root->qual_security_level = 0;
644  root->hasPseudoConstantQuals = false;
645  root->hasAlternativeSubPlans = false;
646  root->placeholdersFrozen = false;
647  root->hasRecursion = hasRecursion;
648  if (hasRecursion)
650  else
651  root->wt_param_id = -1;
652  root->non_recursive_path = NULL;
653  root->partColsUpdated = false;
654 
655  /*
656  * Create the top-level join domain. This won't have valid contents until
657  * deconstruct_jointree fills it in, but the node needs to exist before
658  * that so we can build EquivalenceClasses referencing it.
659  */
661 
662  /*
663  * If there is a WITH list, process each WITH query and either convert it
664  * to RTE_SUBQUERY RTE(s) or build an initplan SubPlan structure for it.
665  */
666  if (parse->cteList)
667  SS_process_ctes(root);
668 
669  /*
670  * If it's a MERGE command, transform the joinlist as appropriate.
671  */
673 
674  /*
675  * If the FROM clause is empty, replace it with a dummy RTE_RESULT RTE, so
676  * that we don't need so many special cases to deal with that situation.
677  */
679 
680  /*
681  * Look for ANY and EXISTS SubLinks in WHERE and JOIN/ON clauses, and try
682  * to transform them into joins. Note that this step does not descend
683  * into subqueries; if we pull up any subqueries below, their SubLinks are
684  * processed just before pulling them up.
685  */
686  if (parse->hasSubLinks)
687  pull_up_sublinks(root);
688 
689  /*
690  * Scan the rangetable for function RTEs, do const-simplification on them,
691  * and then inline them if possible (producing subqueries that might get
692  * pulled up next). Recursion issues here are handled in the same way as
693  * for SubLinks.
694  */
696 
697  /*
698  * Check to see if any subqueries in the jointree can be merged into this
699  * query.
700  */
701  pull_up_subqueries(root);
702 
703  /*
704  * If this is a simple UNION ALL query, flatten it into an appendrel. We
705  * do this now because it requires applying pull_up_subqueries to the leaf
706  * queries of the UNION ALL, which weren't touched above because they
707  * weren't referenced by the jointree (they will be after we do this).
708  */
709  if (parse->setOperations)
711 
712  /*
713  * Survey the rangetable to see what kinds of entries are present. We can
714  * skip some later processing if relevant SQL features are not used; for
715  * example if there are no JOIN RTEs we can avoid the expense of doing
716  * flatten_join_alias_vars(). This must be done after we have finished
717  * adding rangetable entries, of course. (Note: actually, processing of
718  * inherited or partitioned rels can cause RTEs for their child tables to
719  * get added later; but those must all be RTE_RELATION entries, so they
720  * don't invalidate the conclusions drawn here.)
721  */
722  root->hasJoinRTEs = false;
723  root->hasLateralRTEs = false;
724  hasOuterJoins = false;
725  hasResultRTEs = false;
726  foreach(l, parse->rtable)
727  {
729 
730  switch (rte->rtekind)
731  {
732  case RTE_RELATION:
733  if (rte->inh)
734  {
735  /*
736  * Check to see if the relation actually has any children;
737  * if not, clear the inh flag so we can treat it as a
738  * plain base relation.
739  *
740  * Note: this could give a false-positive result, if the
741  * rel once had children but no longer does. We used to
742  * be able to clear rte->inh later on when we discovered
743  * that, but no more; we have to handle such cases as
744  * full-fledged inheritance.
745  */
746  rte->inh = has_subclass(rte->relid);
747  }
748  break;
749  case RTE_JOIN:
750  root->hasJoinRTEs = true;
751  if (IS_OUTER_JOIN(rte->jointype))
752  hasOuterJoins = true;
753  break;
754  case RTE_RESULT:
755  hasResultRTEs = true;
756  break;
757  default:
758  /* No work here for other RTE types */
759  break;
760  }
761 
762  if (rte->lateral)
763  root->hasLateralRTEs = true;
764 
765  /*
766  * We can also determine the maximum security level required for any
767  * securityQuals now. Addition of inheritance-child RTEs won't affect
768  * this, because child tables don't have their own securityQuals; see
769  * expand_single_inheritance_child().
770  */
771  if (rte->securityQuals)
773  list_length(rte->securityQuals));
774  }
775 
776  /*
777  * If we have now verified that the query target relation is
778  * non-inheriting, mark it as a leaf target.
779  */
780  if (parse->resultRelation)
781  {
782  RangeTblEntry *rte = rt_fetch(parse->resultRelation, parse->rtable);
783 
784  if (!rte->inh)
785  root->leaf_result_relids =
786  bms_make_singleton(parse->resultRelation);
787  }
788 
789  /*
790  * Preprocess RowMark information. We need to do this after subquery
791  * pullup, so that all base relations are present.
792  */
793  preprocess_rowmarks(root);
794 
795  /*
796  * Set hasHavingQual to remember if HAVING clause is present. Needed
797  * because preprocess_expression will reduce a constant-true condition to
798  * an empty qual list ... but "HAVING TRUE" is not a semantic no-op.
799  */
800  root->hasHavingQual = (parse->havingQual != NULL);
801 
802  /*
803  * Do expression preprocessing on targetlist and quals, as well as other
804  * random expressions in the querytree. Note that we do not need to
805  * handle sort/group expressions explicitly, because they are actually
806  * part of the targetlist.
807  */
808  parse->targetList = (List *)
809  preprocess_expression(root, (Node *) parse->targetList,
811 
812  /* Constant-folding might have removed all set-returning functions */
813  if (parse->hasTargetSRFs)
814  parse->hasTargetSRFs = expression_returns_set((Node *) parse->targetList);
815 
816  newWithCheckOptions = NIL;
817  foreach(l, parse->withCheckOptions)
818  {
820 
821  wco->qual = preprocess_expression(root, wco->qual,
822  EXPRKIND_QUAL);
823  if (wco->qual != NULL)
824  newWithCheckOptions = lappend(newWithCheckOptions, wco);
825  }
826  parse->withCheckOptions = newWithCheckOptions;
827 
828  parse->returningList = (List *)
829  preprocess_expression(root, (Node *) parse->returningList,
831 
832  preprocess_qual_conditions(root, (Node *) parse->jointree);
833 
834  parse->havingQual = preprocess_expression(root, parse->havingQual,
835  EXPRKIND_QUAL);
836 
837  foreach(l, parse->windowClause)
838  {
840 
841  /* partitionClause/orderClause are sort/group expressions */
844  wc->endOffset = preprocess_expression(root, wc->endOffset,
846  wc->runCondition = (List *) preprocess_expression(root,
847  (Node *) wc->runCondition,
849  }
850 
851  parse->limitOffset = preprocess_expression(root, parse->limitOffset,
853  parse->limitCount = preprocess_expression(root, parse->limitCount,
855 
856  if (parse->onConflict)
857  {
858  parse->onConflict->arbiterElems = (List *)
860  (Node *) parse->onConflict->arbiterElems,
862  parse->onConflict->arbiterWhere =
864  parse->onConflict->arbiterWhere,
865  EXPRKIND_QUAL);
866  parse->onConflict->onConflictSet = (List *)
868  (Node *) parse->onConflict->onConflictSet,
870  parse->onConflict->onConflictWhere =
872  parse->onConflict->onConflictWhere,
873  EXPRKIND_QUAL);
874  /* exclRelTlist contains only Vars, so no preprocessing needed */
875  }
876 
877  foreach(l, parse->mergeActionList)
878  {
880 
881  action->targetList = (List *)
883  (Node *) action->targetList,
885  action->qual =
887  (Node *) action->qual,
888  EXPRKIND_QUAL);
889  }
890 
891  root->append_rel_list = (List *)
894 
895  /* Also need to preprocess expressions within RTEs */
896  foreach(l, parse->rtable)
897  {
899  int kind;
900  ListCell *lcsq;
901 
902  if (rte->rtekind == RTE_RELATION)
903  {
904  if (rte->tablesample)
905  rte->tablesample = (TableSampleClause *)
907  (Node *) rte->tablesample,
909  }
910  else if (rte->rtekind == RTE_SUBQUERY)
911  {
912  /*
913  * We don't want to do all preprocessing yet on the subquery's
914  * expressions, since that will happen when we plan it. But if it
915  * contains any join aliases of our level, those have to get
916  * expanded now, because planning of the subquery won't do it.
917  * That's only possible if the subquery is LATERAL.
918  */
919  if (rte->lateral && root->hasJoinRTEs)
920  rte->subquery = (Query *)
921  flatten_join_alias_vars(root, root->parse,
922  (Node *) rte->subquery);
923  }
924  else if (rte->rtekind == RTE_FUNCTION)
925  {
926  /* Preprocess the function expression(s) fully */
928  rte->functions = (List *)
929  preprocess_expression(root, (Node *) rte->functions, kind);
930  }
931  else if (rte->rtekind == RTE_TABLEFUNC)
932  {
933  /* Preprocess the function expression(s) fully */
935  rte->tablefunc = (TableFunc *)
936  preprocess_expression(root, (Node *) rte->tablefunc, kind);
937  }
938  else if (rte->rtekind == RTE_VALUES)
939  {
940  /* Preprocess the values lists fully */
942  rte->values_lists = (List *)
943  preprocess_expression(root, (Node *) rte->values_lists, kind);
944  }
945 
946  /*
947  * Process each element of the securityQuals list as if it were a
948  * separate qual expression (as indeed it is). We need to do it this
949  * way to get proper canonicalization of AND/OR structure. Note that
950  * this converts each element into an implicit-AND sublist.
951  */
952  foreach(lcsq, rte->securityQuals)
953  {
954  lfirst(lcsq) = preprocess_expression(root,
955  (Node *) lfirst(lcsq),
956  EXPRKIND_QUAL);
957  }
958  }
959 
960  /*
961  * Now that we are done preprocessing expressions, and in particular done
962  * flattening join alias variables, get rid of the joinaliasvars lists.
963  * They no longer match what expressions in the rest of the tree look
964  * like, because we have not preprocessed expressions in those lists (and
965  * do not want to; for example, expanding a SubLink there would result in
966  * a useless unreferenced subplan). Leaving them in place simply creates
967  * a hazard for later scans of the tree. We could try to prevent that by
968  * using QTW_IGNORE_JOINALIASES in every tree scan done after this point,
969  * but that doesn't sound very reliable.
970  */
971  if (root->hasJoinRTEs)
972  {
973  foreach(l, parse->rtable)
974  {
976 
977  rte->joinaliasvars = NIL;
978  }
979  }
980 
981  /*
982  * In some cases we may want to transfer a HAVING clause into WHERE. We
983  * cannot do so if the HAVING clause contains aggregates (obviously) or
984  * volatile functions (since a HAVING clause is supposed to be executed
985  * only once per group). We also can't do this if there are any nonempty
986  * grouping sets; moving such a clause into WHERE would potentially change
987  * the results, if any referenced column isn't present in all the grouping
988  * sets. (If there are only empty grouping sets, then the HAVING clause
989  * must be degenerate as discussed below.)
990  *
991  * Also, it may be that the clause is so expensive to execute that we're
992  * better off doing it only once per group, despite the loss of
993  * selectivity. This is hard to estimate short of doing the entire
994  * planning process twice, so we use a heuristic: clauses containing
995  * subplans are left in HAVING. Otherwise, we move or copy the HAVING
996  * clause into WHERE, in hopes of eliminating tuples before aggregation
997  * instead of after.
998  *
999  * If the query has explicit grouping then we can simply move such a
1000  * clause into WHERE; any group that fails the clause will not be in the
1001  * output because none of its tuples will reach the grouping or
1002  * aggregation stage. Otherwise we must have a degenerate (variable-free)
1003  * HAVING clause, which we put in WHERE so that query_planner() can use it
1004  * in a gating Result node, but also keep in HAVING to ensure that we
1005  * don't emit a bogus aggregated row. (This could be done better, but it
1006  * seems not worth optimizing.)
1007  *
1008  * Note that both havingQual and parse->jointree->quals are in
1009  * implicitly-ANDed-list form at this point, even though they are declared
1010  * as Node *.
1011  */
1012  newHaving = NIL;
1013  foreach(l, (List *) parse->havingQual)
1014  {
1015  Node *havingclause = (Node *) lfirst(l);
1016 
1017  if ((parse->groupClause && parse->groupingSets) ||
1018  contain_agg_clause(havingclause) ||
1019  contain_volatile_functions(havingclause) ||
1020  contain_subplans(havingclause))
1021  {
1022  /* keep it in HAVING */
1023  newHaving = lappend(newHaving, havingclause);
1024  }
1025  else if (parse->groupClause && !parse->groupingSets)
1026  {
1027  /* move it to WHERE */
1028  parse->jointree->quals = (Node *)
1029  lappend((List *) parse->jointree->quals, havingclause);
1030  }
1031  else
1032  {
1033  /* put a copy in WHERE, keep it in HAVING */
1034  parse->jointree->quals = (Node *)
1035  lappend((List *) parse->jointree->quals,
1036  copyObject(havingclause));
1037  newHaving = lappend(newHaving, havingclause);
1038  }
1039  }
1040  parse->havingQual = (Node *) newHaving;
1041 
1042  /*
1043  * If we have any outer joins, try to reduce them to plain inner joins.
1044  * This step is most easily done after we've done expression
1045  * preprocessing.
1046  */
1047  if (hasOuterJoins)
1048  reduce_outer_joins(root);
1049 
1050  /*
1051  * If we have any RTE_RESULT relations, see if they can be deleted from
1052  * the jointree. We also rely on this processing to flatten single-child
1053  * FromExprs underneath outer joins. This step is most effectively done
1054  * after we've done expression preprocessing and outer join reduction.
1055  */
1056  if (hasResultRTEs || hasOuterJoins)
1058 
1059  /*
1060  * Do the main planning.
1061  */
1062  grouping_planner(root, tuple_fraction);
1063 
1064  /*
1065  * Capture the set of outer-level param IDs we have access to, for use in
1066  * extParam/allParam calculations later.
1067  */
1069 
1070  /*
1071  * If any initPlans were created in this query level, adjust the surviving
1072  * Paths' costs and parallel-safety flags to account for them. The
1073  * initPlans won't actually get attached to the plan tree till
1074  * create_plan() runs, but we must include their effects now.
1075  */
1076  final_rel = fetch_upper_rel(root, UPPERREL_FINAL, NULL);
1077  SS_charge_for_initplans(root, final_rel);
1078 
1079  /*
1080  * Make sure we've identified the cheapest Path for the final rel. (By
1081  * doing this here not in grouping_planner, we include initPlan costs in
1082  * the decision, though it's unlikely that will change anything.)
1083  */
1084  set_cheapest(final_rel);
1085 
1086  return root;
1087 }
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:186
#define Max(x, y)
Definition: c.h:982
bool contain_agg_clause(Node *clause)
Definition: clauses.c:179
bool contain_subplans(Node *clause)
Definition: clauses.c:332
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:483
List * lappend(List *list, void *datum)
Definition: list.c:338
MemoryContext CurrentMemoryContext
Definition: mcxt.c:135
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:730
#define copyObject(obj)
Definition: nodes.h:244
#define IS_OUTER_JOIN(jointype)
Definition: nodes.h:348
int assign_special_exec_param(PlannerInfo *root)
Definition: paramassign.c:580
@ RTE_JOIN
Definition: parsenodes.h:1016
@ RTE_VALUES
Definition: parsenodes.h:1019
@ RTE_SUBQUERY
Definition: parsenodes.h:1015
@ RTE_RESULT
Definition: parsenodes.h:1022
@ RTE_FUNCTION
Definition: parsenodes.h:1017
@ RTE_TABLEFUNC
Definition: parsenodes.h:1018
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
bool has_subclass(Oid relationId)
Definition: pg_inherits.c:356
#define list_make1(x1)
Definition: pg_list.h:212
#define EXPRKIND_TABLEFUNC_LATERAL
Definition: planner.c:96
#define EXPRKIND_TARGET
Definition: planner.c:85
#define EXPRKIND_APPINFO
Definition: planner.c:91
static void preprocess_rowmarks(PlannerInfo *root)
Definition: planner.c:2221
#define EXPRKIND_TABLESAMPLE
Definition: planner.c:93
static void preprocess_qual_conditions(PlannerInfo *root, Node *jtnode)
Definition: planner.c:1198
#define EXPRKIND_RTFUNC_LATERAL
Definition: planner.c:87
#define EXPRKIND_VALUES_LATERAL
Definition: planner.c:89
#define EXPRKIND_LIMIT
Definition: planner.c:90
#define EXPRKIND_VALUES
Definition: planner.c:88
static void grouping_planner(PlannerInfo *root, double tuple_fraction)
Definition: planner.c:1271
#define EXPRKIND_QUAL
Definition: planner.c:84
#define EXPRKIND_TABLEFUNC
Definition: planner.c:95
#define EXPRKIND_RTFUNC
Definition: planner.c:86
#define EXPRKIND_ARBITER_ELEM
Definition: planner.c:94
void preprocess_function_rtes(PlannerInfo *root)
Definition: prepjointree.c:727
void flatten_simple_union_all(PlannerInfo *root)
void transform_MERGE_to_join(Query *parse)
Definition: prepjointree.c:152
void remove_useless_result_rtes(PlannerInfo *root)
void pull_up_sublinks(PlannerInfo *root)
Definition: prepjointree.c:293
void replace_empty_jointree(Query *parse)
Definition: prepjointree.c:235
void pull_up_subqueries(PlannerInfo *root)
Definition: prepjointree.c:768
void reduce_outer_joins(PlannerInfo *root)
Definition: pg_list.h:54
List * minmax_aggs
Definition: pathnodes.h:469
bool partColsUpdated
Definition: pathnodes.h:546
bool hasJoinRTEs
Definition: pathnodes.h:489
List * processed_tlist
Definition: pathnodes.h:453
bool hasRecursion
Definition: pathnodes.h:501
List * cte_plan_ids
Definition: pathnodes.h:302
int last_rinfo_serial
Definition: pathnodes.h:340
bool hasLateralRTEs
Definition: pathnodes.h:491
Index qual_security_level
Definition: pathnodes.h:486
List * init_plans
Definition: pathnodes.h:296
List * multiexpr_params
Definition: pathnodes.h:305
List * row_identity_vars
Definition: pathnodes.h:365
bool hasHavingQual
Definition: pathnodes.h:493
bool ec_merging_done
Definition: pathnodes.h:314
Bitmapset * outer_params
Definition: pathnodes.h:218
Index query_level
Definition: pathnodes.h:205
List * append_rel_list
Definition: pathnodes.h:362
struct Path * non_recursive_path
Definition: pathnodes.h:523
List * join_domains
Definition: pathnodes.h:308
List * eq_classes
Definition: pathnodes.h:311
int wt_param_id
Definition: pathnodes.h:521
List * plan_params
Definition: pathnodes.h:217
List * processed_groupClause
Definition: pathnodes.h:430
bool hasAlternativeSubPlans
Definition: pathnodes.h:497
List * processed_distinctClause
Definition: pathnodes.h:442
Query * parse
Definition: pathnodes.h:199
List * rowMarks
Definition: pathnodes.h:368
List * update_colnos
Definition: pathnodes.h:461
bool placeholdersFrozen
Definition: pathnodes.h:499
bool hasPseudoConstantQuals
Definition: pathnodes.h:495
Relids all_result_relids
Definition: pathnodes.h:351
Relids leaf_result_relids
Definition: pathnodes.h:353
TableFunc * tablefunc
Definition: parsenodes.h:1154
struct TableSampleClause * tablesample
Definition: parsenodes.h:1075
List * securityQuals
Definition: parsenodes.h:1204
Query * subquery
Definition: parsenodes.h:1081
List * values_lists
Definition: parsenodes.h:1159
List * joinaliasvars
Definition: parsenodes.h:1129
JoinType jointype
Definition: parsenodes.h:1127
List * functions
Definition: parsenodes.h:1148
Node * startOffset
Definition: parsenodes.h:1499
Node * endOffset
Definition: parsenodes.h:1500
void SS_process_ctes(PlannerInfo *root)
Definition: subselect.c:893
void SS_identify_outer_params(PlannerInfo *root)
Definition: subselect.c:2070
void SS_charge_for_initplans(PlannerInfo *root, RelOptInfo *final_rel)
Definition: subselect.c:2132
Node * flatten_join_alias_vars(PlannerInfo *root, Query *query, Node *node)
Definition: var.c:744

References generate_unaccent_rules::action, PlannerInfo::all_result_relids, PlannerInfo::append_rel_list, assign_special_exec_param(), bms_make_singleton(), contain_agg_clause(), contain_subplans(), contain_volatile_functions(), copyObject, PlannerInfo::cte_plan_ids, 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, grouping_planner(), has_subclass(), PlannerInfo::hasAlternativeSubPlans, PlannerInfo::hasHavingQual, PlannerInfo::hasJoinRTEs, PlannerInfo::hasLateralRTEs, PlannerInfo::hasPseudoConstantQuals, PlannerInfo::hasRecursion, RangeTblEntry::inh, PlannerInfo::init_plans, IS_OUTER_JOIN, PlannerInfo::join_domains, RangeTblEntry::joinaliasvars, RangeTblEntry::jointype, lappend(), PlannerInfo::last_rinfo_serial, RangeTblEntry::lateral, PlannerInfo::leaf_result_relids, lfirst, lfirst_node, list_length(), list_make1, makeNode, Max, PlannerInfo::minmax_aggs, PlannerInfo::multiexpr_params, NIL, PlannerInfo::non_recursive_path, PlannerInfo::outer_params, parse(), PlannerInfo::parse, PlannerInfo::partColsUpdated, PlannerInfo::placeholdersFrozen, PlannerInfo::plan_params, preprocess_expression(), preprocess_function_rtes(), preprocess_qual_conditions(), preprocess_rowmarks(), PlannerInfo::processed_distinctClause, PlannerInfo::processed_groupClause, PlannerInfo::processed_tlist, pull_up_sublinks(), pull_up_subqueries(), WithCheckOption::qual, PlannerInfo::qual_security_level, PlannerInfo::query_level, reduce_outer_joins(), RangeTblEntry::relid, remove_useless_result_rtes(), replace_empty_jointree(), PlannerInfo::row_identity_vars, PlannerInfo::rowMarks, rt_fetch, RTE_FUNCTION, RTE_JOIN, RTE_RELATION, RTE_RESULT, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RangeTblEntry::rtekind, RangeTblEntry::securityQuals, set_cheapest(), SS_charge_for_initplans(), SS_identify_outer_params(), SS_process_ctes(), WindowClause::startOffset, RangeTblEntry::subquery, RangeTblEntry::tablefunc, RangeTblEntry::tablesample, transform_MERGE_to_join(), PlannerInfo::update_colnos, UPPERREL_FINAL, RangeTblEntry::values_lists, and PlannerInfo::wt_param_id.

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

Variable Documentation

◆ create_upper_paths_hook

◆ planner_hook

PGDLLIMPORT planner_hook_type planner_hook
extern

Definition at line 77 of file planner.c.

Referenced by _PG_init(), and planner().