PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
pathnode.h File Reference
#include "nodes/relation.h"
Include dependency graph for pathnode.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

int compare_path_costs (Path *path1, Path *path2, CostSelector criterion)
 
int compare_fractional_path_costs (Path *path1, Path *path2, double fraction)
 
void set_cheapest (RelOptInfo *parent_rel)
 
void add_path (RelOptInfo *parent_rel, Path *new_path)
 
bool add_path_precheck (RelOptInfo *parent_rel, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer)
 
void add_partial_path (RelOptInfo *parent_rel, Path *new_path)
 
bool add_partial_path_precheck (RelOptInfo *parent_rel, Cost total_cost, List *pathkeys)
 
Pathcreate_seqscan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer, int parallel_workers)
 
Pathcreate_samplescan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
IndexPathcreate_index_path (PlannerInfo *root, IndexOptInfo *index, List *indexclauses, List *indexclausecols, List *indexorderbys, List *indexorderbycols, List *pathkeys, ScanDirection indexscandir, bool indexonly, Relids required_outer, double loop_count, bool partial_path)
 
BitmapHeapPathcreate_bitmap_heap_path (PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual, Relids required_outer, double loop_count, int parallel_degree)
 
BitmapAndPathcreate_bitmap_and_path (PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
 
BitmapOrPathcreate_bitmap_or_path (PlannerInfo *root, RelOptInfo *rel, List *bitmapquals)
 
TidPathcreate_tidscan_path (PlannerInfo *root, RelOptInfo *rel, List *tidquals, Relids required_outer)
 
AppendPathcreate_append_path (RelOptInfo *rel, List *subpaths, Relids required_outer, int parallel_workers, List *partitioned_rels)
 
MergeAppendPathcreate_merge_append_path (PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *pathkeys, Relids required_outer, List *partitioned_rels)
 
ResultPathcreate_result_path (PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *resconstantqual)
 
MaterialPathcreate_material_path (RelOptInfo *rel, Path *subpath)
 
UniquePathcreate_unique_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, SpecialJoinInfo *sjinfo)
 
GatherPathcreate_gather_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, Relids required_outer, double *rows)
 
GatherMergePathcreate_gather_merge_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
 
SubqueryScanPathcreate_subqueryscan_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, Relids required_outer)
 
Pathcreate_functionscan_path (PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
 
Pathcreate_tablexprscan_path (PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
 
Pathcreate_valuesscan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
Pathcreate_tablefuncscan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
Pathcreate_ctescan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
Pathcreate_worktablescan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
ForeignPathcreate_foreignscan_path (PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer, Path *fdw_outerpath, List *fdw_private)
 
Relids calc_nestloop_required_outer (Path *outer_path, Path *inner_path)
 
Relids calc_non_nestloop_required_outer (Path *outer_path, Path *inner_path)
 
NestPathcreate_nestloop_path (PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, SpecialJoinInfo *sjinfo, SemiAntiJoinFactors *semifactors, Path *outer_path, Path *inner_path, List *restrict_clauses, List *pathkeys, Relids required_outer)
 
MergePathcreate_mergejoin_path (PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, SpecialJoinInfo *sjinfo, Path *outer_path, Path *inner_path, List *restrict_clauses, List *pathkeys, Relids required_outer, List *mergeclauses, List *outersortkeys, List *innersortkeys)
 
HashPathcreate_hashjoin_path (PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, SpecialJoinInfo *sjinfo, SemiAntiJoinFactors *semifactors, Path *outer_path, Path *inner_path, List *restrict_clauses, Relids required_outer, List *hashclauses)
 
ProjectionPathcreate_projection_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
 
Pathapply_projection_to_path (PlannerInfo *root, RelOptInfo *rel, Path *path, PathTarget *target)
 
ProjectSetPathcreate_set_projection_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
 
SortPathcreate_sort_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, double limit_tuples)
 
GroupPathcreate_group_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *groupClause, List *qual, double numGroups)
 
UpperUniquePathcreate_upper_unique_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, int numCols, double numGroups)
 
AggPathcreate_agg_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, AggStrategy aggstrategy, AggSplit aggsplit, List *groupClause, List *qual, const AggClauseCosts *aggcosts, double numGroups)
 
GroupingSetsPathcreate_groupingsets_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *having_qual, List *rollup_lists, List *rollup_groupclauses, const AggClauseCosts *agg_costs, double numGroups)
 
MinMaxAggPathcreate_minmaxagg_path (PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *mmaggregates, List *quals)
 
WindowAggPathcreate_windowagg_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *windowFuncs, WindowClause *winclause, List *winpathkeys)
 
SetOpPathcreate_setop_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, SetOpCmd cmd, SetOpStrategy strategy, List *distinctList, AttrNumber flagColIdx, int firstFlag, double numGroups, double outputRows)
 
RecursiveUnionPathcreate_recursiveunion_path (PlannerInfo *root, RelOptInfo *rel, Path *leftpath, Path *rightpath, PathTarget *target, List *distinctList, int wtParam, double numGroups)
 
LockRowsPathcreate_lockrows_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *rowMarks, int epqParam)
 
ModifyTablePathcreate_modifytable_path (PlannerInfo *root, RelOptInfo *rel, CmdType operation, bool canSetTag, Index nominalRelation, List *partitioned_rels, List *resultRelations, List *subpaths, List *subroots, List *withCheckOptionLists, List *returningLists, List *rowMarks, OnConflictExpr *onconflict, int epqParam)
 
LimitPathcreate_limit_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, Node *limitOffset, Node *limitCount, int64 offset_est, int64 count_est)
 
Pathreparameterize_path (PlannerInfo *root, Path *path, Relids required_outer, double loop_count)
 
void setup_simple_rel_arrays (PlannerInfo *root)
 
RelOptInfobuild_simple_rel (PlannerInfo *root, int relid, RelOptKind reloptkind)
 
RelOptInfofind_base_rel (PlannerInfo *root, int relid)
 
RelOptInfofind_join_rel (PlannerInfo *root, Relids relids)
 
RelOptInfobuild_join_rel (PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List **restrictlist_ptr)
 
Relids min_join_parameterization (PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
 
RelOptInfobuild_empty_join_rel (PlannerInfo *root)
 
RelOptInfofetch_upper_rel (PlannerInfo *root, UpperRelationKind kind, Relids relids)
 
AppendRelInfofind_childrel_appendrelinfo (PlannerInfo *root, RelOptInfo *rel)
 
RelOptInfofind_childrel_top_parent (PlannerInfo *root, RelOptInfo *rel)
 
Relids find_childrel_parents (PlannerInfo *root, RelOptInfo *rel)
 
ParamPathInfoget_baserel_parampathinfo (PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
 
ParamPathInfoget_joinrel_parampathinfo (PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
 
ParamPathInfoget_appendrel_parampathinfo (RelOptInfo *appendrel, Relids required_outer)
 

Function Documentation

void add_partial_path ( RelOptInfo parent_rel,
Path new_path 
)

Definition at line 752 of file pathnode.c.

References CHECK_FOR_INTERRUPTS, compare_pathkeys(), lappend_cell(), lcons(), lfirst, list_delete_cell(), list_head(), lnext, NULL, RelOptInfo::partial_pathlist, Path::pathkeys, PATHKEYS_BETTER1, PATHKEYS_BETTER2, PATHKEYS_DIFFERENT, pfree(), STD_FUZZ_FACTOR, and Path::total_cost.

Referenced by add_paths_to_append_rel(), build_index_paths(), create_grouping_paths(), create_partial_bitmap_paths(), create_plain_partial_paths(), try_partial_hashjoin_path(), try_partial_mergejoin_path(), and try_partial_nestloop_path().

753 {
754  bool accept_new = true; /* unless we find a superior old path */
755  ListCell *insert_after = NULL; /* where to insert new item */
756  ListCell *p1;
757  ListCell *p1_prev;
758  ListCell *p1_next;
759 
760  /* Check for query cancel. */
762 
763  /*
764  * As in add_path, throw out any paths which are dominated by the new
765  * path, but throw out the new path if some existing path dominates it.
766  */
767  p1_prev = NULL;
768  for (p1 = list_head(parent_rel->partial_pathlist); p1 != NULL;
769  p1 = p1_next)
770  {
771  Path *old_path = (Path *) lfirst(p1);
772  bool remove_old = false; /* unless new proves superior */
773  PathKeysComparison keyscmp;
774 
775  p1_next = lnext(p1);
776 
777  /* Compare pathkeys. */
778  keyscmp = compare_pathkeys(new_path->pathkeys, old_path->pathkeys);
779 
780  /* Unless pathkeys are incompable, keep just one of the two paths. */
781  if (keyscmp != PATHKEYS_DIFFERENT)
782  {
783  if (new_path->total_cost > old_path->total_cost * STD_FUZZ_FACTOR)
784  {
785  /* New path costs more; keep it only if pathkeys are better. */
786  if (keyscmp != PATHKEYS_BETTER1)
787  accept_new = false;
788  }
789  else if (old_path->total_cost > new_path->total_cost
790  * STD_FUZZ_FACTOR)
791  {
792  /* Old path costs more; keep it only if pathkeys are better. */
793  if (keyscmp != PATHKEYS_BETTER2)
794  remove_old = true;
795  }
796  else if (keyscmp == PATHKEYS_BETTER1)
797  {
798  /* Costs are about the same, new path has better pathkeys. */
799  remove_old = true;
800  }
801  else if (keyscmp == PATHKEYS_BETTER2)
802  {
803  /* Costs are about the same, old path has better pathkeys. */
804  accept_new = false;
805  }
806  else if (old_path->total_cost > new_path->total_cost * 1.0000000001)
807  {
808  /* Pathkeys are the same, and the old path costs more. */
809  remove_old = true;
810  }
811  else
812  {
813  /*
814  * Pathkeys are the same, and new path isn't materially
815  * cheaper.
816  */
817  accept_new = false;
818  }
819  }
820 
821  /*
822  * Remove current element from partial_pathlist if dominated by new.
823  */
824  if (remove_old)
825  {
826  parent_rel->partial_pathlist =
827  list_delete_cell(parent_rel->partial_pathlist, p1, p1_prev);
828  pfree(old_path);
829  /* p1_prev does not advance */
830  }
831  else
832  {
833  /* new belongs after this old path if it has cost >= old's */
834  if (new_path->total_cost >= old_path->total_cost)
835  insert_after = p1;
836  /* p1_prev advances */
837  p1_prev = p1;
838  }
839 
840  /*
841  * If we found an old path that dominates new_path, we can quit
842  * scanning the partial_pathlist; we will not add new_path, and we
843  * assume new_path cannot dominate any later path.
844  */
845  if (!accept_new)
846  break;
847  }
848 
849  if (accept_new)
850  {
851  /* Accept the new path: insert it at proper place */
852  if (insert_after)
853  lappend_cell(parent_rel->partial_pathlist, insert_after, new_path);
854  else
855  parent_rel->partial_pathlist =
856  lcons(new_path, parent_rel->partial_pathlist);
857  }
858  else
859  {
860  /* Reject and recycle the new path */
861  pfree(new_path);
862  }
863 }
List * partial_pathlist
Definition: relation.h:510
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:278
ListCell * lappend_cell(List *list, ListCell *prev, void *datum)
Definition: list.c:209
void pfree(void *pointer)
Definition: mcxt.c:950
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
#define lnext(lc)
Definition: pg_list.h:105
List * list_delete_cell(List *list, ListCell *cell, ListCell *prev)
Definition: list.c:528
Cost total_cost
Definition: relation.h:911
List * lcons(void *datum, List *list)
Definition: list.c:259
List * pathkeys
Definition: relation.h:913
#define NULL
Definition: c.h:229
#define lfirst(lc)
Definition: pg_list.h:106
#define STD_FUZZ_FACTOR
Definition: pathnode.c:46
PathKeysComparison
Definition: paths.h:175
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:97
Definition: relation.h:892
bool add_partial_path_precheck ( RelOptInfo parent_rel,
Cost  total_cost,
List pathkeys 
)

Definition at line 876 of file pathnode.c.

References add_path_precheck(), compare_pathkeys(), lfirst, NULL, RelOptInfo::partial_pathlist, Path::pathkeys, PATHKEYS_BETTER1, PATHKEYS_BETTER2, PATHKEYS_DIFFERENT, STD_FUZZ_FACTOR, and Path::total_cost.

Referenced by try_partial_hashjoin_path(), try_partial_mergejoin_path(), and try_partial_nestloop_path().

878 {
879  ListCell *p1;
880 
881  /*
882  * Our goal here is twofold. First, we want to find out whether this path
883  * is clearly inferior to some existing partial path. If so, we want to
884  * reject it immediately. Second, we want to find out whether this path
885  * is clearly superior to some existing partial path -- at least, modulo
886  * final cost computations. If so, we definitely want to consider it.
887  *
888  * Unlike add_path(), we always compare pathkeys here. This is because we
889  * expect partial_pathlist to be very short, and getting a definitive
890  * answer at this stage avoids the need to call add_path_precheck.
891  */
892  foreach(p1, parent_rel->partial_pathlist)
893  {
894  Path *old_path = (Path *) lfirst(p1);
895  PathKeysComparison keyscmp;
896 
897  keyscmp = compare_pathkeys(pathkeys, old_path->pathkeys);
898  if (keyscmp != PATHKEYS_DIFFERENT)
899  {
900  if (total_cost > old_path->total_cost * STD_FUZZ_FACTOR &&
901  keyscmp != PATHKEYS_BETTER1)
902  return false;
903  if (old_path->total_cost > total_cost * STD_FUZZ_FACTOR &&
904  keyscmp != PATHKEYS_BETTER2)
905  return true;
906  }
907  }
908 
909  /*
910  * This path is neither clearly inferior to an existing partial path nor
911  * clearly good enough that it might replace one. Compare it to
912  * non-parallel plans. If it loses even before accounting for the cost of
913  * the Gather node, we should definitely reject it.
914  *
915  * Note that we pass the total_cost to add_path_precheck twice. This is
916  * because it's never advantageous to consider the startup cost of a
917  * partial path; the resulting plans, if run in parallel, will be run to
918  * completion.
919  */
920  if (!add_path_precheck(parent_rel, total_cost, total_cost, pathkeys,
921  NULL))
922  return false;
923 
924  return true;
925 }
bool add_path_precheck(RelOptInfo *parent_rel, Cost startup_cost, Cost total_cost, List *pathkeys, Relids required_outer)
Definition: pathnode.c:647
List * partial_pathlist
Definition: relation.h:510
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:278
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define NULL
Definition: c.h:229
#define lfirst(lc)
Definition: pg_list.h:106
#define STD_FUZZ_FACTOR
Definition: pathnode.c:46
PathKeysComparison
Definition: paths.h:175
Definition: relation.h:892
void add_path ( RelOptInfo parent_rel,
Path new_path 
)

Definition at line 412 of file pathnode.c.

References BMS_EQUAL, BMS_SUBSET1, BMS_SUBSET2, bms_subset_compare(), CHECK_FOR_INTERRUPTS, compare_path_costs_fuzzily(), compare_pathkeys(), COSTS_BETTER1, COSTS_BETTER2, COSTS_DIFFERENT, COSTS_EQUAL, IsA, lappend_cell(), lcons(), lfirst, list_delete_cell(), list_head(), lnext, NIL, NULL, Path::parallel_safe, Path::param_info, PATH_REQ_OUTER, Path::pathkeys, PATHKEYS_BETTER1, PATHKEYS_BETTER2, PATHKEYS_DIFFERENT, RelOptInfo::pathlist, pfree(), Path::rows, STD_FUZZ_FACTOR, and Path::total_cost.

Referenced by add_foreign_grouping_paths(), add_paths_to_append_rel(), add_paths_with_pathkeys_for_rel(), create_distinct_paths(), create_grouping_paths(), create_index_paths(), create_one_window_path(), create_ordered_paths(), create_tidscan_paths(), fileGetForeignPaths(), generate_gather_paths(), generate_mergeappend_paths(), get_index_paths(), grouping_planner(), inheritance_planner(), mark_dummy_rel(), plan_set_operations(), postgresGetForeignJoinPaths(), postgresGetForeignPaths(), preprocess_minmax_aggregates(), query_planner(), set_cte_pathlist(), set_dummy_rel_pathlist(), set_function_pathlist(), set_plain_rel_pathlist(), set_subquery_pathlist(), set_tablefunc_pathlist(), set_tablesample_rel_pathlist(), set_values_pathlist(), set_worktable_pathlist(), try_hashjoin_path(), try_mergejoin_path(), and try_nestloop_path().

413 {
414  bool accept_new = true; /* unless we find a superior old path */
415  ListCell *insert_after = NULL; /* where to insert new item */
416  List *new_path_pathkeys;
417  ListCell *p1;
418  ListCell *p1_prev;
419  ListCell *p1_next;
420 
421  /*
422  * This is a convenient place to check for query cancel --- no part of the
423  * planner goes very long without calling add_path().
424  */
426 
427  /* Pretend parameterized paths have no pathkeys, per comment above */
428  new_path_pathkeys = new_path->param_info ? NIL : new_path->pathkeys;
429 
430  /*
431  * Loop to check proposed new path against old paths. Note it is possible
432  * for more than one old path to be tossed out because new_path dominates
433  * it.
434  *
435  * We can't use foreach here because the loop body may delete the current
436  * list cell.
437  */
438  p1_prev = NULL;
439  for (p1 = list_head(parent_rel->pathlist); p1 != NULL; p1 = p1_next)
440  {
441  Path *old_path = (Path *) lfirst(p1);
442  bool remove_old = false; /* unless new proves superior */
443  PathCostComparison costcmp;
444  PathKeysComparison keyscmp;
445  BMS_Comparison outercmp;
446 
447  p1_next = lnext(p1);
448 
449  /*
450  * Do a fuzzy cost comparison with standard fuzziness limit.
451  */
452  costcmp = compare_path_costs_fuzzily(new_path, old_path,
454 
455  /*
456  * If the two paths compare differently for startup and total cost,
457  * then we want to keep both, and we can skip comparing pathkeys and
458  * required_outer rels. If they compare the same, proceed with the
459  * other comparisons. Row count is checked last. (We make the tests
460  * in this order because the cost comparison is most likely to turn
461  * out "different", and the pathkeys comparison next most likely. As
462  * explained above, row count very seldom makes a difference, so even
463  * though it's cheap to compare there's not much point in checking it
464  * earlier.)
465  */
466  if (costcmp != COSTS_DIFFERENT)
467  {
468  /* Similarly check to see if either dominates on pathkeys */
469  List *old_path_pathkeys;
470 
471  old_path_pathkeys = old_path->param_info ? NIL : old_path->pathkeys;
472  keyscmp = compare_pathkeys(new_path_pathkeys,
473  old_path_pathkeys);
474  if (keyscmp != PATHKEYS_DIFFERENT)
475  {
476  switch (costcmp)
477  {
478  case COSTS_EQUAL:
479  outercmp = bms_subset_compare(PATH_REQ_OUTER(new_path),
480  PATH_REQ_OUTER(old_path));
481  if (keyscmp == PATHKEYS_BETTER1)
482  {
483  if ((outercmp == BMS_EQUAL ||
484  outercmp == BMS_SUBSET1) &&
485  new_path->rows <= old_path->rows &&
486  new_path->parallel_safe >= old_path->parallel_safe)
487  remove_old = true; /* new dominates old */
488  }
489  else if (keyscmp == PATHKEYS_BETTER2)
490  {
491  if ((outercmp == BMS_EQUAL ||
492  outercmp == BMS_SUBSET2) &&
493  new_path->rows >= old_path->rows &&
494  new_path->parallel_safe <= old_path->parallel_safe)
495  accept_new = false; /* old dominates new */
496  }
497  else /* keyscmp == PATHKEYS_EQUAL */
498  {
499  if (outercmp == BMS_EQUAL)
500  {
501  /*
502  * Same pathkeys and outer rels, and fuzzily
503  * the same cost, so keep just one; to decide
504  * which, first check parallel-safety, then
505  * rows, then do a fuzzy cost comparison with
506  * very small fuzz limit. (We used to do an
507  * exact cost comparison, but that results in
508  * annoying platform-specific plan variations
509  * due to roundoff in the cost estimates.) If
510  * things are still tied, arbitrarily keep
511  * only the old path. Notice that we will
512  * keep only the old path even if the
513  * less-fuzzy comparison decides the startup
514  * and total costs compare differently.
515  */
516  if (new_path->parallel_safe >
517  old_path->parallel_safe)
518  remove_old = true; /* new dominates old */
519  else if (new_path->parallel_safe <
520  old_path->parallel_safe)
521  accept_new = false; /* old dominates new */
522  else if (new_path->rows < old_path->rows)
523  remove_old = true; /* new dominates old */
524  else if (new_path->rows > old_path->rows)
525  accept_new = false; /* old dominates new */
526  else if (compare_path_costs_fuzzily(new_path,
527  old_path,
528  1.0000000001) == COSTS_BETTER1)
529  remove_old = true; /* new dominates old */
530  else
531  accept_new = false; /* old equals or
532  * dominates new */
533  }
534  else if (outercmp == BMS_SUBSET1 &&
535  new_path->rows <= old_path->rows &&
536  new_path->parallel_safe >= old_path->parallel_safe)
537  remove_old = true; /* new dominates old */
538  else if (outercmp == BMS_SUBSET2 &&
539  new_path->rows >= old_path->rows &&
540  new_path->parallel_safe <= old_path->parallel_safe)
541  accept_new = false; /* old dominates new */
542  /* else different parameterizations, keep both */
543  }
544  break;
545  case COSTS_BETTER1:
546  if (keyscmp != PATHKEYS_BETTER2)
547  {
548  outercmp = bms_subset_compare(PATH_REQ_OUTER(new_path),
549  PATH_REQ_OUTER(old_path));
550  if ((outercmp == BMS_EQUAL ||
551  outercmp == BMS_SUBSET1) &&
552  new_path->rows <= old_path->rows &&
553  new_path->parallel_safe >= old_path->parallel_safe)
554  remove_old = true; /* new dominates old */
555  }
556  break;
557  case COSTS_BETTER2:
558  if (keyscmp != PATHKEYS_BETTER1)
559  {
560  outercmp = bms_subset_compare(PATH_REQ_OUTER(new_path),
561  PATH_REQ_OUTER(old_path));
562  if ((outercmp == BMS_EQUAL ||
563  outercmp == BMS_SUBSET2) &&
564  new_path->rows >= old_path->rows &&
565  new_path->parallel_safe <= old_path->parallel_safe)
566  accept_new = false; /* old dominates new */
567  }
568  break;
569  case COSTS_DIFFERENT:
570 
571  /*
572  * can't get here, but keep this case to keep compiler
573  * quiet
574  */
575  break;
576  }
577  }
578  }
579 
580  /*
581  * Remove current element from pathlist if dominated by new.
582  */
583  if (remove_old)
584  {
585  parent_rel->pathlist = list_delete_cell(parent_rel->pathlist,
586  p1, p1_prev);
587 
588  /*
589  * Delete the data pointed-to by the deleted cell, if possible
590  */
591  if (!IsA(old_path, IndexPath))
592  pfree(old_path);
593  /* p1_prev does not advance */
594  }
595  else
596  {
597  /* new belongs after this old path if it has cost >= old's */
598  if (new_path->total_cost >= old_path->total_cost)
599  insert_after = p1;
600  /* p1_prev advances */
601  p1_prev = p1;
602  }
603 
604  /*
605  * If we found an old path that dominates new_path, we can quit
606  * scanning the pathlist; we will not add new_path, and we assume
607  * new_path cannot dominate any other elements of the pathlist.
608  */
609  if (!accept_new)
610  break;
611  }
612 
613  if (accept_new)
614  {
615  /* Accept the new path: insert it at proper place in pathlist */
616  if (insert_after)
617  lappend_cell(parent_rel->pathlist, insert_after, new_path);
618  else
619  parent_rel->pathlist = lcons(new_path, parent_rel->pathlist);
620  }
621  else
622  {
623  /* Reject and recycle the new path */
624  if (!IsA(new_path, IndexPath))
625  pfree(new_path);
626  }
627 }
#define NIL
Definition: pg_list.h:69
#define IsA(nodeptr, _type_)
Definition: nodes.h:569
ParamPathInfo * param_info
Definition: relation.h:901
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:278
ListCell * lappend_cell(List *list, ListCell *prev, void *datum)
Definition: list.c:209
void pfree(void *pointer)
Definition: mcxt.c:950
static PathCostComparison compare_path_costs_fuzzily(Path *path1, Path *path2, double fuzz_factor)
Definition: pathnode.c:156
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
#define lnext(lc)
Definition: pg_list.h:105
List * list_delete_cell(List *list, ListCell *cell, ListCell *prev)
Definition: list.c:528
PathCostComparison
Definition: pathnode.c:33
BMS_Comparison bms_subset_compare(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:344
Cost total_cost
Definition: relation.h:911
List * lcons(void *datum, List *list)
Definition: list.c:259
List * pathkeys
Definition: relation.h:913
#define NULL
Definition: c.h:229
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
#define STD_FUZZ_FACTOR
Definition: pathnode.c:46
PathKeysComparison
Definition: paths.h:175
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:97
List * pathlist
Definition: relation.h:508
Definition: pg_list.h:45
Definition: relation.h:892
BMS_Comparison
Definition: bitmapset.h:40
bool add_path_precheck ( RelOptInfo parent_rel,
Cost  startup_cost,
Cost  total_cost,
List pathkeys,
Relids  required_outer 
)

Definition at line 647 of file pathnode.c.

References bms_equal(), compare_pathkeys(), RelOptInfo::consider_param_startup, RelOptInfo::consider_startup, lfirst, NIL, Path::param_info, PATH_REQ_OUTER, Path::pathkeys, PATHKEYS_BETTER2, PATHKEYS_EQUAL, RelOptInfo::pathlist, Path::startup_cost, STD_FUZZ_FACTOR, and Path::total_cost.

Referenced by add_partial_path_precheck(), try_hashjoin_path(), try_mergejoin_path(), and try_nestloop_path().

650 {
651  List *new_path_pathkeys;
652  bool consider_startup;
653  ListCell *p1;
654 
655  /* Pretend parameterized paths have no pathkeys, per add_path policy */
656  new_path_pathkeys = required_outer ? NIL : pathkeys;
657 
658  /* Decide whether new path's startup cost is interesting */
659  consider_startup = required_outer ? parent_rel->consider_param_startup : parent_rel->consider_startup;
660 
661  foreach(p1, parent_rel->pathlist)
662  {
663  Path *old_path = (Path *) lfirst(p1);
664  PathKeysComparison keyscmp;
665 
666  /*
667  * We are looking for an old_path with the same parameterization (and
668  * by assumption the same rowcount) that dominates the new path on
669  * pathkeys as well as both cost metrics. If we find one, we can
670  * reject the new path.
671  *
672  * Cost comparisons here should match compare_path_costs_fuzzily.
673  */
674  if (total_cost > old_path->total_cost * STD_FUZZ_FACTOR)
675  {
676  /* new path can win on startup cost only if consider_startup */
677  if (startup_cost > old_path->startup_cost * STD_FUZZ_FACTOR ||
678  !consider_startup)
679  {
680  /* new path loses on cost, so check pathkeys... */
681  List *old_path_pathkeys;
682 
683  old_path_pathkeys = old_path->param_info ? NIL : old_path->pathkeys;
684  keyscmp = compare_pathkeys(new_path_pathkeys,
685  old_path_pathkeys);
686  if (keyscmp == PATHKEYS_EQUAL ||
687  keyscmp == PATHKEYS_BETTER2)
688  {
689  /* new path does not win on pathkeys... */
690  if (bms_equal(required_outer, PATH_REQ_OUTER(old_path)))
691  {
692  /* Found an old path that dominates the new one */
693  return false;
694  }
695  }
696  }
697  }
698  else
699  {
700  /*
701  * Since the pathlist is sorted by total_cost, we can stop looking
702  * once we reach a path with a total_cost larger than the new
703  * path's.
704  */
705  break;
706  }
707  }
708 
709  return true;
710 }
#define NIL
Definition: pg_list.h:69
bool consider_param_startup
Definition: relation.h:501
ParamPathInfo * param_info
Definition: relation.h:901
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:278
bool consider_startup
Definition: relation.h:500
Cost startup_cost
Definition: relation.h:910
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define lfirst(lc)
Definition: pg_list.h:106
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
#define STD_FUZZ_FACTOR
Definition: pathnode.c:46
PathKeysComparison
Definition: paths.h:175
List * pathlist
Definition: relation.h:508
Definition: pg_list.h:45
Definition: relation.h:892
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:130
Path* apply_projection_to_path ( PlannerInfo root,
RelOptInfo rel,
Path path,
PathTarget target 
)

Definition at line 2343 of file pathnode.c.

References PathTarget::cost, create_projection_path(), PathTarget::exprs, is_parallel_safe(), is_projection_capable_path(), IsA, Path::parallel_safe, Path::parent, Path::pathtarget, QualCost::per_tuple, Path::rows, QualCost::startup, Path::startup_cost, GatherPath::subpath, and Path::total_cost.

Referenced by adjust_paths_for_srfs(), build_minmax_path(), create_ordered_paths(), grouping_planner(), and recurse_set_operations().

2347 {
2348  QualCost oldcost;
2349 
2350  /*
2351  * If given path can't project, we might need a Result node, so make a
2352  * separate ProjectionPath.
2353  */
2354  if (!is_projection_capable_path(path))
2355  return (Path *) create_projection_path(root, rel, path, target);
2356 
2357  /*
2358  * We can just jam the desired tlist into the existing path, being sure to
2359  * update its cost estimates appropriately.
2360  */
2361  oldcost = path->pathtarget->cost;
2362  path->pathtarget = target;
2363 
2364  path->startup_cost += target->cost.startup - oldcost.startup;
2365  path->total_cost += target->cost.startup - oldcost.startup +
2366  (target->cost.per_tuple - oldcost.per_tuple) * path->rows;
2367 
2368  /*
2369  * If the path happens to be a Gather path, we'd like to arrange for the
2370  * subpath to return the required target list so that workers can help
2371  * project. But if there is something that is not parallel-safe in the
2372  * target expressions, then we can't.
2373  */
2374  if (IsA(path, GatherPath) &&
2375  is_parallel_safe(root, (Node *) target->exprs))
2376  {
2377  GatherPath *gpath = (GatherPath *) path;
2378 
2379  /*
2380  * We always use create_projection_path here, even if the subpath is
2381  * projection-capable, so as to avoid modifying the subpath in place.
2382  * It seems unlikely at present that there could be any other
2383  * references to the subpath, but better safe than sorry.
2384  *
2385  * Note that we don't change the GatherPath's cost estimates; it might
2386  * be appropriate to do so, to reflect the fact that the bulk of the
2387  * target evaluation will happen in workers.
2388  */
2389  gpath->subpath = (Path *)
2391  gpath->subpath->parent,
2392  gpath->subpath,
2393  target);
2394  }
2395  else if (path->parallel_safe &&
2396  !is_parallel_safe(root, (Node *) target->exprs))
2397  {
2398  /*
2399  * We're inserting a parallel-restricted target list into a path
2400  * currently marked parallel-safe, so we have to mark it as no longer
2401  * safe.
2402  */
2403  path->parallel_safe = false;
2404  }
2405 
2406  return path;
2407 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:569
PathTarget * pathtarget
Definition: relation.h:899
Definition: nodes.h:518
ProjectionPath * create_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
Definition: pathnode.c:2252
Cost startup
Definition: relation.h:45
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:1071
Cost per_tuple
Definition: relation.h:46
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Path * subpath
Definition: relation.h:1210
List * exprs
Definition: relation.h:828
Cost total_cost
Definition: relation.h:911
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
bool is_projection_capable_path(Path *path)
Definition: createplan.c:6423
Definition: relation.h:892
RelOptInfo* build_empty_join_rel ( PlannerInfo root)

Definition at line 861 of file relnode.c.

References Assert, create_empty_pathtarget(), PlannerInfo::join_rel_list, lappend(), makeNode, NIL, NULL, RelOptInfo::relids, RELOPT_JOINREL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_JOIN, and RelOptInfo::rtekind.

Referenced by query_planner().

862 {
863  RelOptInfo *joinrel;
864 
865  /* The dummy join relation should be the only one ... */
866  Assert(root->join_rel_list == NIL);
867 
868  joinrel = makeNode(RelOptInfo);
869  joinrel->reloptkind = RELOPT_JOINREL;
870  joinrel->relids = NULL; /* empty set */
871  joinrel->rows = 1; /* we produce one row for such cases */
872  joinrel->rtekind = RTE_JOIN;
873  joinrel->reltarget = create_empty_pathtarget();
874 
875  root->join_rel_list = lappend(root->join_rel_list, joinrel);
876 
877  return joinrel;
878 }
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:653
#define NIL
Definition: pg_list.h:69
RelOptKind reloptkind
Definition: relation.h:491
List * join_rel_list
Definition: relation.h:214
Relids relids
Definition: relation.h:494
List * lappend(List *list, void *datum)
Definition: list.c:128
RTEKind rtekind
Definition: relation.h:524
double rows
Definition: relation.h:497
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
struct PathTarget * reltarget
Definition: relation.h:505
RelOptInfo* build_join_rel ( PlannerInfo root,
Relids  joinrelids,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
SpecialJoinInfo sjinfo,
List **  restrictlist_ptr 
)

Definition at line 426 of file relnode.c.

References add_join_rel(), add_placeholders_to_joinrel(), RelOptInfo::allvisfrac, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_copy(), bms_del_members(), bms_is_empty(), bms_num_members(), bms_union(), build_joinrel_joinlist(), build_joinrel_restrictlist(), build_joinrel_tlist(), RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, PathTarget::exprs, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, find_join_rel(), RelOptInfo::has_eclass_joins, has_relevant_eclass_joinclause(), RelOptInfo::indexlist, InvalidOid, is_parallel_safe(), PlannerInfo::join_cur_level, PlannerInfo::join_rel_level, RelOptInfo::joininfo, lappend(), RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, min_join_parameterization(), NIL, NULL, RelOptInfo::pages, RelOptInfo::partial_pathlist, RelOptInfo::pathlist, QualCost::per_tuple, RelOptInfo::ppilist, RelOptInfo::rel_parallel_workers, RelOptInfo::relid, RelOptInfo::relids, RELOPT_JOINREL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_JOIN, RelOptInfo::rtekind, RelOptInfo::serverid, set_foreign_rel_properties(), set_joinrel_size_estimates(), QualCost::startup, RelOptInfo::subplan_params, RelOptInfo::subroot, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by make_join_rel().

432 {
433  RelOptInfo *joinrel;
434  List *restrictlist;
435 
436  /*
437  * See if we already have a joinrel for this set of base rels.
438  */
439  joinrel = find_join_rel(root, joinrelids);
440 
441  if (joinrel)
442  {
443  /*
444  * Yes, so we only need to figure the restrictlist for this particular
445  * pair of component relations.
446  */
447  if (restrictlist_ptr)
448  *restrictlist_ptr = build_joinrel_restrictlist(root,
449  joinrel,
450  outer_rel,
451  inner_rel);
452  return joinrel;
453  }
454 
455  /*
456  * Nope, so make one.
457  */
458  joinrel = makeNode(RelOptInfo);
459  joinrel->reloptkind = RELOPT_JOINREL;
460  joinrel->relids = bms_copy(joinrelids);
461  joinrel->rows = 0;
462  /* cheap startup cost is interesting iff not all tuples to be retrieved */
463  joinrel->consider_startup = (root->tuple_fraction > 0);
464  joinrel->consider_param_startup = false;
465  joinrel->consider_parallel = false;
466  joinrel->reltarget = create_empty_pathtarget();
467  joinrel->pathlist = NIL;
468  joinrel->ppilist = NIL;
469  joinrel->partial_pathlist = NIL;
470  joinrel->cheapest_startup_path = NULL;
471  joinrel->cheapest_total_path = NULL;
472  joinrel->cheapest_unique_path = NULL;
474  /* init direct_lateral_relids from children; we'll finish it up below */
475  joinrel->direct_lateral_relids =
476  bms_union(outer_rel->direct_lateral_relids,
477  inner_rel->direct_lateral_relids);
478  joinrel->lateral_relids = min_join_parameterization(root, joinrel->relids,
479  outer_rel, inner_rel);
480  joinrel->relid = 0; /* indicates not a baserel */
481  joinrel->rtekind = RTE_JOIN;
482  joinrel->min_attr = 0;
483  joinrel->max_attr = 0;
484  joinrel->attr_needed = NULL;
485  joinrel->attr_widths = NULL;
486  joinrel->lateral_vars = NIL;
487  joinrel->lateral_referencers = NULL;
488  joinrel->indexlist = NIL;
489  joinrel->pages = 0;
490  joinrel->tuples = 0;
491  joinrel->allvisfrac = 0;
492  joinrel->subroot = NULL;
493  joinrel->subplan_params = NIL;
494  joinrel->rel_parallel_workers = -1;
495  joinrel->serverid = InvalidOid;
496  joinrel->userid = InvalidOid;
497  joinrel->useridiscurrent = false;
498  joinrel->fdwroutine = NULL;
499  joinrel->fdw_private = NULL;
500  joinrel->baserestrictinfo = NIL;
501  joinrel->baserestrictcost.startup = 0;
502  joinrel->baserestrictcost.per_tuple = 0;
503  joinrel->baserestrict_min_security = UINT_MAX;
504  joinrel->joininfo = NIL;
505  joinrel->has_eclass_joins = false;
506 
507  /* Compute information relevant to the foreign relations. */
508  set_foreign_rel_properties(joinrel, outer_rel, inner_rel);
509 
510  /*
511  * Create a new tlist containing just the vars that need to be output from
512  * this join (ie, are needed for higher joinclauses or final output).
513  *
514  * NOTE: the tlist order for a join rel will depend on which pair of outer
515  * and inner rels we first try to build it from. But the contents should
516  * be the same regardless.
517  */
518  build_joinrel_tlist(root, joinrel, outer_rel);
519  build_joinrel_tlist(root, joinrel, inner_rel);
520  add_placeholders_to_joinrel(root, joinrel, outer_rel, inner_rel);
521 
522  /*
523  * add_placeholders_to_joinrel also took care of adding the ph_lateral
524  * sets of any PlaceHolderVars computed here to direct_lateral_relids, so
525  * now we can finish computing that. This is much like the computation of
526  * the transitively-closed lateral_relids in min_join_parameterization,
527  * except that here we *do* have to consider the added PHVs.
528  */
529  joinrel->direct_lateral_relids =
530  bms_del_members(joinrel->direct_lateral_relids, joinrel->relids);
531  if (bms_is_empty(joinrel->direct_lateral_relids))
532  joinrel->direct_lateral_relids = NULL;
533 
534  /*
535  * Construct restrict and join clause lists for the new joinrel. (The
536  * caller might or might not need the restrictlist, but I need it anyway
537  * for set_joinrel_size_estimates().)
538  */
539  restrictlist = build_joinrel_restrictlist(root, joinrel,
540  outer_rel, inner_rel);
541  if (restrictlist_ptr)
542  *restrictlist_ptr = restrictlist;
543  build_joinrel_joinlist(joinrel, outer_rel, inner_rel);
544 
545  /*
546  * This is also the right place to check whether the joinrel has any
547  * pending EquivalenceClass joins.
548  */
549  joinrel->has_eclass_joins = has_relevant_eclass_joinclause(root, joinrel);
550 
551  /*
552  * Set estimates of the joinrel's size.
553  */
554  set_joinrel_size_estimates(root, joinrel, outer_rel, inner_rel,
555  sjinfo, restrictlist);
556 
557  /*
558  * Set the consider_parallel flag if this joinrel could potentially be
559  * scanned within a parallel worker. If this flag is false for either
560  * inner_rel or outer_rel, then it must be false for the joinrel also.
561  * Even if both are true, there might be parallel-restricted expressions
562  * in the targetlist or quals.
563  *
564  * Note that if there are more than two rels in this relation, they could
565  * be divided between inner_rel and outer_rel in any arbitrary way. We
566  * assume this doesn't matter, because we should hit all the same baserels
567  * and joinclauses while building up to this joinrel no matter which we
568  * take; therefore, we should make the same decision here however we get
569  * here.
570  */
571  if (inner_rel->consider_parallel && outer_rel->consider_parallel &&
572  is_parallel_safe(root, (Node *) restrictlist) &&
573  is_parallel_safe(root, (Node *) joinrel->reltarget->exprs))
574  joinrel->consider_parallel = true;
575 
576  /* Add the joinrel to the PlannerInfo. */
577  add_join_rel(root, joinrel);
578 
579  /*
580  * Also, if dynamic-programming join search is active, add the new joinrel
581  * to the appropriate sublist. Note: you might think the Assert on number
582  * of members should be for equality, but some of the level 1 rels might
583  * have been joinrels already, so we can only assert <=.
584  */
585  if (root->join_rel_level)
586  {
587  Assert(root->join_cur_level > 0);
588  Assert(root->join_cur_level <= bms_num_members(joinrel->relids));
589  root->join_rel_level[root->join_cur_level] =
590  lappend(root->join_rel_level[root->join_cur_level], joinrel);
591  }
592 
593  return joinrel;
594 }
bool has_eclass_joins
Definition: relation.h:555
struct Path * cheapest_unique_path
Definition: relation.h:513
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:653
#define NIL
Definition: pg_list.h:69
int join_cur_level
Definition: relation.h:225
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:110
RelOptKind reloptkind
Definition: relation.h:491
Relids * attr_needed
Definition: relation.h:527
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:288
void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List *restrictlist)
Definition: costsize.c:4005
struct Path * cheapest_startup_path
Definition: relation.h:511
Oid userid
Definition: relation.h:541
double tuples
Definition: relation.h:533
List * baserestrictinfo
Definition: relation.h:548
bool consider_param_startup
Definition: relation.h:501
Definition: nodes.h:518
List * partial_pathlist
Definition: relation.h:510
List * cheapest_parameterized_paths
Definition: relation.h:514
Index baserestrict_min_security
Definition: relation.h:551
bool useridiscurrent
Definition: relation.h:542
void add_placeholders_to_joinrel(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: placeholder.c:411
Cost startup
Definition: relation.h:45
double allvisfrac
Definition: relation.h:534
PlannerInfo * subroot
Definition: relation.h:535
bool consider_startup
Definition: relation.h:500
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:1071
Relids lateral_relids
Definition: relation.h:519
Cost per_tuple
Definition: relation.h:46
static void set_foreign_rel_properties(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:351
double tuple_fraction
Definition: relation.h:290
static void build_joinrel_tlist(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *input_rel)
Definition: relnode.c:648
Relids min_join_parameterization(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:605
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:575
struct Path * cheapest_total_path
Definition: relation.h:512
static List * build_joinrel_restrictlist(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:734
List * joininfo
Definition: relation.h:553
struct FdwRoutine * fdwroutine
Definition: relation.h:544
Relids relids
Definition: relation.h:494
bool has_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1)
Definition: equivclass.c:2354
List * ppilist
Definition: relation.h:509
Index relid
Definition: relation.h:522
List * lappend(List *list, void *datum)
Definition: list.c:128
Relids lateral_referencers
Definition: relation.h:530
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:633
Oid serverid
Definition: relation.h:540
List * exprs
Definition: relation.h:828
Relids direct_lateral_relids
Definition: relation.h:518
int rel_parallel_workers
Definition: relation.h:537
RTEKind rtekind
Definition: relation.h:524
List * indexlist
Definition: relation.h:531
double rows
Definition: relation.h:497
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: relation.h:545
#define makeNode(_type_)
Definition: nodes.h:566
BlockNumber pages
Definition: relation.h:532
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
List ** join_rel_level
Definition: relation.h:224
List * lateral_vars
Definition: relation.h:529
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:217
bool consider_parallel
Definition: relation.h:502
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:787
AttrNumber max_attr
Definition: relation.h:526
List * pathlist
Definition: relation.h:508
int32 * attr_widths
Definition: relation.h:528
Definition: pg_list.h:45
struct PathTarget * reltarget
Definition: relation.h:505
QualCost baserestrictcost
Definition: relation.h:550
static void add_join_rel(PlannerInfo *root, RelOptInfo *joinrel)
Definition: relnode.c:389
List * subplan_params
Definition: relation.h:536
static void build_joinrel_joinlist(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:764
AttrNumber min_attr
Definition: relation.h:525
RelOptInfo* build_simple_rel ( PlannerInfo root,
int  relid,
RelOptKind  reloptkind 
)

Definition at line 91 of file relnode.c.

References RelOptInfo::allvisfrac, PlannerInfo::append_rel_list, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_make_singleton(), build_simple_rel(), RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RangeTblEntry::checkAsUser, AppendRelInfo::child_relid, Alias::colnames, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, elog, RangeTblEntry::eref, ERROR, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, get_relation_info(), RelOptInfo::has_eclass_joins, RelOptInfo::indexlist, RangeTblEntry::inh, InvalidOid, RelOptInfo::joininfo, RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, lfirst, list_length(), makeNode, Max, RelOptInfo::max_attr, RelOptInfo::min_attr, NIL, NULL, RelOptInfo::pages, palloc0(), AppendRelInfo::parent_relid, RelOptInfo::partial_pathlist, RelOptInfo::pathlist, QualCost::per_tuple, RelOptInfo::ppilist, PlannerInfo::qual_security_level, RelOptInfo::rel_parallel_workers, RelOptInfo::relid, RangeTblEntry::relid, RelOptInfo::relids, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_CTE, RTE_FUNCTION, RTE_RELATION, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RelOptInfo::rtekind, RangeTblEntry::rtekind, RangeTblEntry::securityQuals, RelOptInfo::serverid, PlannerInfo::simple_rel_array, PlannerInfo::simple_rte_array, QualCost::startup, RelOptInfo::subplan_params, RelOptInfo::subroot, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by add_base_rels_to_query(), build_simple_rel(), plan_cluster_use_sort(), and recurse_set_operations().

92 {
93  RelOptInfo *rel;
94  RangeTblEntry *rte;
95 
96  /* Rel should not exist already */
97  Assert(relid > 0 && relid < root->simple_rel_array_size);
98  if (root->simple_rel_array[relid] != NULL)
99  elog(ERROR, "rel %d already exists", relid);
100 
101  /* Fetch RTE for relation */
102  rte = root->simple_rte_array[relid];
103  Assert(rte != NULL);
104 
105  rel = makeNode(RelOptInfo);
106  rel->reloptkind = reloptkind;
107  rel->relids = bms_make_singleton(relid);
108  rel->rows = 0;
109  /* cheap startup cost is interesting iff not all tuples to be retrieved */
110  rel->consider_startup = (root->tuple_fraction > 0);
111  rel->consider_param_startup = false; /* might get changed later */
112  rel->consider_parallel = false; /* might get changed later */
114  rel->pathlist = NIL;
115  rel->ppilist = NIL;
116  rel->partial_pathlist = NIL;
118  rel->cheapest_total_path = NULL;
119  rel->cheapest_unique_path = NULL;
122  rel->lateral_relids = NULL;
123  rel->relid = relid;
124  rel->rtekind = rte->rtekind;
125  /* min_attr, max_attr, attr_needed, attr_widths are set below */
126  rel->lateral_vars = NIL;
127  rel->lateral_referencers = NULL;
128  rel->indexlist = NIL;
129  rel->pages = 0;
130  rel->tuples = 0;
131  rel->allvisfrac = 0;
132  rel->subroot = NULL;
133  rel->subplan_params = NIL;
134  rel->rel_parallel_workers = -1; /* set up in get_relation_info */
135  rel->serverid = InvalidOid;
136  rel->userid = rte->checkAsUser;
137  rel->useridiscurrent = false;
138  rel->fdwroutine = NULL;
139  rel->fdw_private = NULL;
140  rel->baserestrictinfo = NIL;
141  rel->baserestrictcost.startup = 0;
142  rel->baserestrictcost.per_tuple = 0;
143  rel->baserestrict_min_security = UINT_MAX;
144  rel->joininfo = NIL;
145  rel->has_eclass_joins = false;
146 
147  /* Check type of rtable entry */
148  switch (rte->rtekind)
149  {
150  case RTE_RELATION:
151  /* Table --- retrieve statistics from the system catalogs */
152  get_relation_info(root, rte->relid, rte->inh, rel);
153  break;
154  case RTE_SUBQUERY:
155  case RTE_FUNCTION:
156  case RTE_TABLEFUNC:
157  case RTE_VALUES:
158  case RTE_CTE:
159 
160  /*
161  * Subquery, function, tablefunc, or values list --- set up attr
162  * range and arrays
163  *
164  * Note: 0 is included in range to support whole-row Vars
165  */
166  rel->min_attr = 0;
167  rel->max_attr = list_length(rte->eref->colnames);
168  rel->attr_needed = (Relids *)
169  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
170  rel->attr_widths = (int32 *)
171  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
172  break;
173  default:
174  elog(ERROR, "unrecognized RTE kind: %d",
175  (int) rte->rtekind);
176  break;
177  }
178 
179  /* Save the finished struct in the query's simple_rel_array */
180  root->simple_rel_array[relid] = rel;
181 
182  /*
183  * This is a convenient spot at which to note whether rels participating
184  * in the query have any securityQuals attached. If so, increase
185  * root->qual_security_level to ensure it's larger than the maximum
186  * security level needed for securityQuals.
187  */
188  if (rte->securityQuals)
190  list_length(rte->securityQuals));
191 
192  /*
193  * If this rel is an appendrel parent, recurse to build "other rel"
194  * RelOptInfos for its children. They are "other rels" because they are
195  * not in the main join tree, but we will need RelOptInfos to plan access
196  * to them.
197  */
198  if (rte->inh)
199  {
200  ListCell *l;
201 
202  foreach(l, root->append_rel_list)
203  {
204  AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
205 
206  /* append_rel_list contains all append rels; ignore others */
207  if (appinfo->parent_relid != relid)
208  continue;
209 
210  (void) build_simple_rel(root, appinfo->child_relid,
212  }
213  }
214 
215  return rel;
216 }
bool has_eclass_joins
Definition: relation.h:555
struct Path * cheapest_unique_path
Definition: relation.h:513
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:653
#define NIL
Definition: pg_list.h:69
RelOptKind reloptkind
Definition: relation.h:491
Relids * attr_needed
Definition: relation.h:527
List * colnames
Definition: primnodes.h:43
struct Path * cheapest_startup_path
Definition: relation.h:511
Oid userid
Definition: relation.h:541
List * securityQuals
Definition: parsenodes.h:1009
double tuples
Definition: relation.h:533
List * baserestrictinfo
Definition: relation.h:548
bool consider_param_startup
Definition: relation.h:501
List * partial_pathlist
Definition: relation.h:510
List * cheapest_parameterized_paths
Definition: relation.h:514
Index baserestrict_min_security
Definition: relation.h:551
bool useridiscurrent
Definition: relation.h:542
Cost startup
Definition: relation.h:45
double allvisfrac
Definition: relation.h:534
signed int int32
Definition: c.h:256
struct RelOptInfo ** simple_rel_array
Definition: relation.h:178
PlannerInfo * subroot
Definition: relation.h:535
bool consider_startup
Definition: relation.h:500
Relids lateral_relids
Definition: relation.h:519
Cost per_tuple
Definition: relation.h:46
double tuple_fraction
Definition: relation.h:290
#define ERROR
Definition: elog.h:43
struct Path * cheapest_total_path
Definition: relation.h:512
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:178
List * joininfo
Definition: relation.h:553
struct FdwRoutine * fdwroutine
Definition: relation.h:544
Relids relids
Definition: relation.h:494
List * ppilist
Definition: relation.h:509
Index relid
Definition: relation.h:522
Bitmapset * Relids
Definition: relation.h:28
RangeTblEntry ** simple_rte_array
Definition: relation.h:187
Relids lateral_referencers
Definition: relation.h:530
Oid serverid
Definition: relation.h:540
Relids direct_lateral_relids
Definition: relation.h:518
void * palloc0(Size size)
Definition: mcxt.c:878
int rel_parallel_workers
Definition: relation.h:537
List * append_rel_list
Definition: relation.h:251
RTEKind rtekind
Definition: relation.h:524
List * indexlist
Definition: relation.h:531
double rows
Definition: relation.h:497
#define InvalidOid
Definition: postgres_ext.h:36
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptKind reloptkind)
Definition: relnode.c:91
void * fdw_private
Definition: relation.h:545
#define Max(x, y)
Definition: c.h:800
#define makeNode(_type_)
Definition: nodes.h:566
BlockNumber pages
Definition: relation.h:532
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
#define lfirst(lc)
Definition: pg_list.h:106
List * lateral_vars
Definition: relation.h:529
static int list_length(const List *l)
Definition: pg_list.h:89
Index qual_security_level
Definition: relation.h:293
bool consider_parallel
Definition: relation.h:502
RTEKind rtekind
Definition: parsenodes.h:916
AttrNumber max_attr
Definition: relation.h:526
List * pathlist
Definition: relation.h:508
#define elog
Definition: elog.h:219
Index child_relid
Definition: relation.h:1889
Alias * eref
Definition: parsenodes.h:1000
Index parent_relid
Definition: relation.h:1888
int32 * attr_widths
Definition: relation.h:528
struct PathTarget * reltarget
Definition: relation.h:505
QualCost baserestrictcost
Definition: relation.h:550
List * subplan_params
Definition: relation.h:536
void get_relation_info(PlannerInfo *root, Oid relationObjectId, bool inhparent, RelOptInfo *rel)
Definition: plancat.c:96
AttrNumber min_attr
Definition: relation.h:525
Relids calc_nestloop_required_outer ( Path outer_path,
Path inner_path 
)

Definition at line 1970 of file pathnode.c.

References Assert, bms_copy(), bms_del_members(), bms_free(), bms_is_empty(), bms_overlap(), bms_union(), NULL, Path::parent, PATH_REQ_OUTER, and RelOptInfo::relids.

Referenced by try_nestloop_path().

1971 {
1972  Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
1973  Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
1974  Relids required_outer;
1975 
1976  /* inner_path can require rels from outer path, but not vice versa */
1977  Assert(!bms_overlap(outer_paramrels, inner_path->parent->relids));
1978  /* easy case if inner path is not parameterized */
1979  if (!inner_paramrels)
1980  return bms_copy(outer_paramrels);
1981  /* else, form the union ... */
1982  required_outer = bms_union(outer_paramrels, inner_paramrels);
1983  /* ... and remove any mention of now-satisfied outer rels */
1984  required_outer = bms_del_members(required_outer,
1985  outer_path->parent->relids);
1986  /* maintain invariant that required_outer is exactly NULL if empty */
1987  if (bms_is_empty(required_outer))
1988  {
1989  bms_free(required_outer);
1990  required_outer = NULL;
1991  }
1992  return required_outer;
1993 }
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:110
RelOptInfo * parent
Definition: relation.h:898
Relids relids
Definition: relation.h:494
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:633
void bms_free(Bitmapset *a)
Definition: bitmapset.c:200
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:217
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:787
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:442
Relids calc_non_nestloop_required_outer ( Path outer_path,
Path inner_path 
)

Definition at line 2002 of file pathnode.c.

References Assert, bms_overlap(), bms_union(), Path::parent, PATH_REQ_OUTER, and RelOptInfo::relids.

Referenced by try_hashjoin_path(), and try_mergejoin_path().

2003 {
2004  Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
2005  Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
2006  Relids required_outer;
2007 
2008  /* neither path can require rels from the other */
2009  Assert(!bms_overlap(outer_paramrels, inner_path->parent->relids));
2010  Assert(!bms_overlap(inner_paramrels, outer_path->parent->relids));
2011  /* form the union ... */
2012  required_outer = bms_union(outer_paramrels, inner_paramrels);
2013  /* we do not need an explicit test for empty; bms_union gets it right */
2014  return required_outer;
2015 }
RelOptInfo * parent
Definition: relation.h:898
Relids relids
Definition: relation.h:494
#define Assert(condition)
Definition: c.h:675
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:217
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:442
int compare_fractional_path_costs ( Path path1,
Path path2,
double  fraction 
)

Definition at line 107 of file pathnode.c.

References compare_path_costs(), Path::startup_cost, TOTAL_COST, and Path::total_cost.

Referenced by choose_hashed_setop(), get_cheapest_fractional_path(), and get_cheapest_fractional_path_for_pathkeys().

109 {
110  Cost cost1,
111  cost2;
112 
113  if (fraction <= 0.0 || fraction >= 1.0)
114  return compare_path_costs(path1, path2, TOTAL_COST);
115  cost1 = path1->startup_cost +
116  fraction * (path1->total_cost - path1->startup_cost);
117  cost2 = path2->startup_cost +
118  fraction * (path2->total_cost - path2->startup_cost);
119  if (cost1 < cost2)
120  return -1;
121  if (cost1 > cost2)
122  return +1;
123  return 0;
124 }
Cost startup_cost
Definition: relation.h:910
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:61
Cost total_cost
Definition: relation.h:911
double Cost
Definition: nodes.h:642
int compare_path_costs ( Path path1,
Path path2,
CostSelector  criterion 
)

Definition at line 61 of file pathnode.c.

References STARTUP_COST, Path::startup_cost, and Path::total_cost.

Referenced by compare_fractional_path_costs(), generate_mergejoin_paths(), get_cheapest_parameterized_child_path(), get_cheapest_path_for_pathkeys(), and set_cheapest().

62 {
63  if (criterion == STARTUP_COST)
64  {
65  if (path1->startup_cost < path2->startup_cost)
66  return -1;
67  if (path1->startup_cost > path2->startup_cost)
68  return +1;
69 
70  /*
71  * If paths have the same startup cost (not at all unlikely), order
72  * them by total cost.
73  */
74  if (path1->total_cost < path2->total_cost)
75  return -1;
76  if (path1->total_cost > path2->total_cost)
77  return +1;
78  }
79  else
80  {
81  if (path1->total_cost < path2->total_cost)
82  return -1;
83  if (path1->total_cost > path2->total_cost)
84  return +1;
85 
86  /*
87  * If paths have the same total cost, order them by startup cost.
88  */
89  if (path1->startup_cost < path2->startup_cost)
90  return -1;
91  if (path1->startup_cost > path2->startup_cost)
92  return +1;
93  }
94  return 0;
95 }
Cost startup_cost
Definition: relation.h:910
Cost total_cost
Definition: relation.h:911
AggPath* create_agg_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
AggStrategy  aggstrategy,
AggSplit  aggsplit,
List groupClause,
List qual,
const AggClauseCosts aggcosts,
double  numGroups 
)

Definition at line 2640 of file pathnode.c.

References AGG_SORTED, AggPath::aggsplit, AggPath::aggstrategy, RelOptInfo::consider_parallel, PathTarget::cost, cost_agg(), AggPath::groupClause, list_length(), makeNode, NIL, NULL, AggPath::numGroups, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, AggPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, AggPath::qual, Path::rows, QualCost::startup, Path::startup_cost, subpath(), AggPath::subpath, T_Agg, and Path::total_cost.

Referenced by create_distinct_paths(), create_grouping_paths(), and make_union_unique().

2650 {
2651  AggPath *pathnode = makeNode(AggPath);
2652 
2653  pathnode->path.pathtype = T_Agg;
2654  pathnode->path.parent = rel;
2655  pathnode->path.pathtarget = target;
2656  /* For now, assume we are above any joins, so no parameterization */
2657  pathnode->path.param_info = NULL;
2658  pathnode->path.parallel_aware = false;
2659  pathnode->path.parallel_safe = rel->consider_parallel &&
2660  subpath->parallel_safe;
2661  pathnode->path.parallel_workers = subpath->parallel_workers;
2662  if (aggstrategy == AGG_SORTED)
2663  pathnode->path.pathkeys = subpath->pathkeys; /* preserves order */
2664  else
2665  pathnode->path.pathkeys = NIL; /* output is unordered */
2666  pathnode->subpath = subpath;
2667 
2668  pathnode->aggstrategy = aggstrategy;
2669  pathnode->aggsplit = aggsplit;
2670  pathnode->numGroups = numGroups;
2671  pathnode->groupClause = groupClause;
2672  pathnode->qual = qual;
2673 
2674  cost_agg(&pathnode->path, root,
2675  aggstrategy, aggcosts,
2676  list_length(groupClause), numGroups,
2677  subpath->startup_cost, subpath->total_cost,
2678  subpath->rows);
2679 
2680  /* add tlist eval cost for each output row */
2681  pathnode->path.startup_cost += target->cost.startup;
2682  pathnode->path.total_cost += target->cost.startup +
2683  target->cost.per_tuple * pathnode->path.rows;
2684 
2685  return pathnode;
2686 }
#define NIL
Definition: pg_list.h:69
Definition: nodes.h:76
PathTarget * pathtarget
Definition: relation.h:899
AggStrategy aggstrategy
Definition: relation.h:1394
List * qual
Definition: relation.h:1398
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
AggSplit aggsplit
Definition: relation.h:1395
double numGroups
Definition: relation.h:1396
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
Cost per_tuple
Definition: relation.h:46
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
void cost_agg(Path *path, PlannerInfo *root, AggStrategy aggstrategy, const AggClauseCosts *aggcosts, int numGroupCols, double numGroups, Cost input_startup_cost, Cost input_total_cost, double input_tuples)
Definition: costsize.c:1836
List * groupClause
Definition: relation.h:1397
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
static int list_length(const List *l)
Definition: pg_list.h:89
bool consider_parallel
Definition: relation.h:502
Path * subpath
Definition: relation.h:1393
bool parallel_aware
Definition: relation.h:903
Path path
Definition: relation.h:1392
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
AppendPath* create_append_path ( RelOptInfo rel,
List subpaths,
Relids  required_outer,
int  parallel_workers,
List partitioned_rels 
)

Definition at line 1203 of file pathnode.c.

References Assert, bms_equal(), RelOptInfo::consider_parallel, get_appendrel_parampathinfo(), lfirst, list_head(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, AppendPath::partitioned_rels, AppendPath::path, PATH_REQ_OUTER, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, Path::rows, Path::startup_cost, subpath(), AppendPath::subpaths, T_Append, and Path::total_cost.

Referenced by add_paths_to_append_rel(), create_grouping_paths(), generate_nonunion_path(), generate_union_path(), mark_dummy_rel(), and set_dummy_rel_pathlist().

1205 {
1206  AppendPath *pathnode = makeNode(AppendPath);
1207  ListCell *l;
1208 
1209  pathnode->path.pathtype = T_Append;
1210  pathnode->path.parent = rel;
1211  pathnode->path.pathtarget = rel->reltarget;
1213  required_outer);
1214  pathnode->path.parallel_aware = false;
1215  pathnode->path.parallel_safe = rel->consider_parallel;
1216  pathnode->path.parallel_workers = parallel_workers;
1217  pathnode->path.pathkeys = NIL; /* result is always considered
1218  * unsorted */
1219  pathnode->partitioned_rels = partitioned_rels;
1220  pathnode->subpaths = subpaths;
1221 
1222  /*
1223  * We don't bother with inventing a cost_append(), but just do it here.
1224  *
1225  * Compute rows and costs as sums of subplan rows and costs. We charge
1226  * nothing extra for the Append itself, which perhaps is too optimistic,
1227  * but since it doesn't do any selection or projection, it is a pretty
1228  * cheap node.
1229  */
1230  pathnode->path.rows = 0;
1231  pathnode->path.startup_cost = 0;
1232  pathnode->path.total_cost = 0;
1233  foreach(l, subpaths)
1234  {
1235  Path *subpath = (Path *) lfirst(l);
1236 
1237  pathnode->path.rows += subpath->rows;
1238 
1239  if (l == list_head(subpaths)) /* first node? */
1240  pathnode->path.startup_cost = subpath->startup_cost;
1241  pathnode->path.total_cost += subpath->total_cost;
1242  pathnode->path.parallel_safe = pathnode->path.parallel_safe &&
1243  subpath->parallel_safe;
1244 
1245  /* All child paths must have same parameterization */
1246  Assert(bms_equal(PATH_REQ_OUTER(subpath), required_outer));
1247  }
1248 
1249  return pathnode;
1250 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Definition: nodes.h:48
Path path
Definition: relation.h:1122
NodeTag pathtype
Definition: relation.h:896
List * subpaths
Definition: relation.h:1125
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define Assert(condition)
Definition: c.h:675
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
bool consider_parallel
Definition: relation.h:502
List * partitioned_rels
Definition: relation.h:1124
bool parallel_aware
Definition: relation.h:903
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1334
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:130
BitmapAndPath* create_bitmap_and_path ( PlannerInfo root,
RelOptInfo rel,
List bitmapquals 
)

Definition at line 1100 of file pathnode.c.

References BitmapAndPath::bitmapquals, RelOptInfo::consider_parallel, cost_bitmap_and_node(), makeNode, NIL, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, BitmapAndPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_BitmapAnd.

Referenced by choose_bitmap_and().

1103 {
1104  BitmapAndPath *pathnode = makeNode(BitmapAndPath);
1105 
1106  pathnode->path.pathtype = T_BitmapAnd;
1107  pathnode->path.parent = rel;
1108  pathnode->path.pathtarget = rel->reltarget;
1109  pathnode->path.param_info = NULL; /* not used in bitmap trees */
1110 
1111  /*
1112  * Currently, a BitmapHeapPath, BitmapAndPath, or BitmapOrPath will be
1113  * parallel-safe if and only if rel->consider_parallel is set. So, we can
1114  * set the flag for this path based only on the relation-level flag,
1115  * without actually iterating over the list of children.
1116  */
1117  pathnode->path.parallel_aware = false;
1118  pathnode->path.parallel_safe = rel->consider_parallel;
1119  pathnode->path.parallel_workers = 0;
1120 
1121  pathnode->path.pathkeys = NIL; /* always unordered */
1122 
1123  pathnode->bitmapquals = bitmapquals;
1124 
1125  /* this sets bitmapselectivity as well as the regular cost fields: */
1126  cost_bitmap_and_node(pathnode, root);
1127 
1128  return pathnode;
1129 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
void cost_bitmap_and_node(BitmapAndPath *path, PlannerInfo *root)
Definition: costsize.c:1072
ParamPathInfo * param_info
Definition: relation.h:901
List * bitmapquals
Definition: relation.h:1019
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
BitmapHeapPath* create_bitmap_heap_path ( PlannerInfo root,
RelOptInfo rel,
Path bitmapqual,
Relids  required_outer,
double  loop_count,
int  parallel_degree 
)

Definition at line 1067 of file pathnode.c.

References BitmapHeapPath::bitmapqual, RelOptInfo::consider_parallel, cost_bitmap_heap_scan(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, BitmapHeapPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_BitmapHeapScan.

Referenced by create_index_paths(), create_partial_bitmap_paths(), and reparameterize_path().

1073 {
1074  BitmapHeapPath *pathnode = makeNode(BitmapHeapPath);
1075 
1076  pathnode->path.pathtype = T_BitmapHeapScan;
1077  pathnode->path.parent = rel;
1078  pathnode->path.pathtarget = rel->reltarget;
1079  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1080  required_outer);
1081  pathnode->path.parallel_aware = parallel_degree > 0 ? true : false;
1082  pathnode->path.parallel_safe = rel->consider_parallel;
1083  pathnode->path.parallel_workers = parallel_degree;
1084  pathnode->path.pathkeys = NIL; /* always unordered */
1085 
1086  pathnode->bitmapqual = bitmapqual;
1087 
1088  cost_bitmap_heap_scan(&pathnode->path, root, rel,
1089  pathnode->path.param_info,
1090  bitmapqual, loop_count);
1091 
1092  return pathnode;
1093 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info, Path *bitmapqual, double loop_count)
Definition: costsize.c:928
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
Path * bitmapqual
Definition: relation.h:1007
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
BitmapOrPath* create_bitmap_or_path ( PlannerInfo root,
RelOptInfo rel,
List bitmapquals 
)

Definition at line 1136 of file pathnode.c.

References BitmapOrPath::bitmapquals, RelOptInfo::consider_parallel, cost_bitmap_or_node(), makeNode, NIL, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, BitmapOrPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_BitmapOr.

Referenced by generate_bitmap_or_paths().

1139 {
1140  BitmapOrPath *pathnode = makeNode(BitmapOrPath);
1141 
1142  pathnode->path.pathtype = T_BitmapOr;
1143  pathnode->path.parent = rel;
1144  pathnode->path.pathtarget = rel->reltarget;
1145  pathnode->path.param_info = NULL; /* not used in bitmap trees */
1146 
1147  /*
1148  * Currently, a BitmapHeapPath, BitmapAndPath, or BitmapOrPath will be
1149  * parallel-safe if and only if rel->consider_parallel is set. So, we can
1150  * set the flag for this path based only on the relation-level flag,
1151  * without actually iterating over the list of children.
1152  */
1153  pathnode->path.parallel_aware = false;
1154  pathnode->path.parallel_safe = rel->consider_parallel;
1155  pathnode->path.parallel_workers = 0;
1156 
1157  pathnode->path.pathkeys = NIL; /* always unordered */
1158 
1159  pathnode->bitmapquals = bitmapquals;
1160 
1161  /* this sets bitmapselectivity as well as the regular cost fields: */
1162  cost_bitmap_or_node(pathnode, root);
1163 
1164  return pathnode;
1165 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
List * bitmapquals
Definition: relation.h:1032
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
void cost_bitmap_or_node(BitmapOrPath *path, PlannerInfo *root)
Definition: costsize.c:1116
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Path* create_ctescan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer 
)

Definition at line 1875 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_ctescan(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_CteScan.

Referenced by set_cte_pathlist().

1876 {
1877  Path *pathnode = makeNode(Path);
1878 
1879  pathnode->pathtype = T_CteScan;
1880  pathnode->parent = rel;
1881  pathnode->pathtarget = rel->reltarget;
1882  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1883  required_outer);
1884  pathnode->parallel_aware = false;
1885  pathnode->parallel_safe = rel->consider_parallel;
1886  pathnode->parallel_workers = 0;
1887  pathnode->pathkeys = NIL; /* XXX for now, result is always unordered */
1888 
1889  cost_ctescan(pathnode, root, rel, pathnode->param_info);
1890 
1891  return pathnode;
1892 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
void cost_ctescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1483
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
ForeignPath* create_foreignscan_path ( PlannerInfo root,
RelOptInfo rel,
PathTarget target,
double  rows,
Cost  startup_cost,
Cost  total_cost,
List pathkeys,
Relids  required_outer,
Path fdw_outerpath,
List fdw_private 
)

Definition at line 1934 of file pathnode.c.

References RelOptInfo::consider_parallel, ForeignPath::fdw_outerpath, ForeignPath::fdw_private, get_baserel_parampathinfo(), makeNode, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, ForeignPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, Path::rows, Path::startup_cost, T_ForeignScan, and Path::total_cost.

Referenced by add_foreign_grouping_paths(), add_paths_with_pathkeys_for_rel(), fileGetForeignPaths(), postgresGetForeignJoinPaths(), and postgresGetForeignPaths().

1941 {
1942  ForeignPath *pathnode = makeNode(ForeignPath);
1943 
1944  pathnode->path.pathtype = T_ForeignScan;
1945  pathnode->path.parent = rel;
1946  pathnode->path.pathtarget = target ? target : rel->reltarget;
1947  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1948  required_outer);
1949  pathnode->path.parallel_aware = false;
1950  pathnode->path.parallel_safe = rel->consider_parallel;
1951  pathnode->path.parallel_workers = 0;
1952  pathnode->path.rows = rows;
1953  pathnode->path.startup_cost = startup_cost;
1954  pathnode->path.total_cost = total_cost;
1955  pathnode->path.pathkeys = pathkeys;
1956 
1957  pathnode->fdw_outerpath = fdw_outerpath;
1958  pathnode->fdw_private = fdw_private;
1959 
1960  return pathnode;
1961 }
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
Path * fdw_outerpath
Definition: relation.h:1076
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
List * fdw_private
Definition: relation.h:1077
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Path* create_functionscan_path ( PlannerInfo root,
RelOptInfo rel,
List pathkeys,
Relids  required_outer 
)

Definition at line 1797 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_functionscan(), get_baserel_parampathinfo(), makeNode, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_FunctionScan.

Referenced by set_function_pathlist().

1799 {
1800  Path *pathnode = makeNode(Path);
1801 
1802  pathnode->pathtype = T_FunctionScan;
1803  pathnode->parent = rel;
1804  pathnode->pathtarget = rel->reltarget;
1805  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1806  required_outer);
1807  pathnode->parallel_aware = false;
1808  pathnode->parallel_safe = rel->consider_parallel;
1809  pathnode->parallel_workers = 0;
1810  pathnode->pathkeys = pathkeys;
1811 
1812  cost_functionscan(pathnode, root, rel, pathnode->param_info);
1813 
1814  return pathnode;
1815 }
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
void cost_functionscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1316
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
GatherMergePath* create_gather_merge_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
List pathkeys,
Relids  required_outer,
double *  rows 
)

Definition at line 1640 of file pathnode.c.

References Assert, cost_gather_merge(), cost_sort(), get_baserel_parampathinfo(), makeNode, GatherMergePath::num_workers, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, GatherMergePath::path, Path::pathkeys, pathkeys_contained_in(), Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, Path::rows, Path::startup_cost, subpath(), GatherMergePath::subpath, T_GatherMerge, Path::total_cost, PathTarget::width, and work_mem.

Referenced by create_grouping_paths(), create_ordered_paths(), and generate_gather_paths().

1643 {
1645  Cost input_startup_cost = 0;
1646  Cost input_total_cost = 0;
1647 
1648  Assert(subpath->parallel_safe);
1649  Assert(pathkeys);
1650 
1651  pathnode->path.pathtype = T_GatherMerge;
1652  pathnode->path.parent = rel;
1653  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1654  required_outer);
1655  pathnode->path.parallel_aware = false;
1656 
1657  pathnode->subpath = subpath;
1658  pathnode->num_workers = subpath->parallel_workers;
1659  pathnode->path.pathkeys = pathkeys;
1660  pathnode->path.pathtarget = target ? target : rel->reltarget;
1661  pathnode->path.rows += subpath->rows;
1662 
1663  if (pathkeys_contained_in(pathkeys, subpath->pathkeys))
1664  {
1665  /* Subpath is adequately ordered, we won't need to sort it */
1666  input_startup_cost += subpath->startup_cost;
1667  input_total_cost += subpath->total_cost;
1668  }
1669  else
1670  {
1671  /* We'll need to insert a Sort node, so include cost for that */
1672  Path sort_path; /* dummy for result of cost_sort */
1673 
1674  cost_sort(&sort_path,
1675  root,
1676  pathkeys,
1677  subpath->total_cost,
1678  subpath->rows,
1679  subpath->pathtarget->width,
1680  0.0,
1681  work_mem,
1682  -1);
1683  input_startup_cost += sort_path.startup_cost;
1684  input_total_cost += sort_path.total_cost;
1685  }
1686 
1687  cost_gather_merge(pathnode, root, rel, pathnode->path.param_info,
1688  input_startup_cost, input_total_cost, rows);
1689 
1690  return pathnode;
1691 }
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
void cost_gather_merge(GatherMergePath *path, PlannerInfo *root, RelOptInfo *rel, ParamPathInfo *param_info, Cost input_startup_cost, Cost input_total_cost, double *rows)
Definition: costsize.c:387
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
bool pathkeys_contained_in(List *keys1, List *keys2)
Definition: pathkeys.c:317
void cost_sort(Path *path, PlannerInfo *root, List *pathkeys, Cost input_cost, double tuples, int width, Cost comparison_cost, int sort_mem, double limit_tuples)
Definition: costsize.c:1607
int work_mem
Definition: globals.c:112
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define Assert(condition)
Definition: c.h:675
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
Path * subpath
Definition: relation.h:1222
int width
Definition: relation.h:831
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
double Cost
Definition: nodes.h:642
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
GatherPath* create_gather_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
Relids  required_outer,
double *  rows 
)

Definition at line 1731 of file pathnode.c.

References Assert, cost_gather(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, GatherPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, GatherPath::single_copy, subpath(), GatherPath::subpath, and T_Gather.

Referenced by create_grouping_paths(), and generate_gather_paths().

1733 {
1734  GatherPath *pathnode = makeNode(GatherPath);
1735 
1736  Assert(subpath->parallel_safe);
1737 
1738  pathnode->path.pathtype = T_Gather;
1739  pathnode->path.parent = rel;
1740  pathnode->path.pathtarget = target;
1741  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1742  required_outer);
1743  pathnode->path.parallel_aware = false;
1744  pathnode->path.parallel_safe = false;
1745  pathnode->path.parallel_workers = subpath->parallel_workers;
1746  pathnode->path.pathkeys = NIL; /* Gather has unordered result */
1747 
1748  pathnode->subpath = subpath;
1749  pathnode->single_copy = false;
1750 
1751  if (pathnode->path.parallel_workers == 0)
1752  {
1753  pathnode->path.parallel_workers = 1;
1754  pathnode->path.pathkeys = subpath->pathkeys;
1755  pathnode->single_copy = true;
1756  }
1757 
1758  cost_gather(pathnode, root, rel, pathnode->path.param_info, rows);
1759 
1760  return pathnode;
1761 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
bool single_copy
Definition: relation.h:1211
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
Path * subpath
Definition: relation.h:1210
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define Assert(condition)
Definition: c.h:675
bool parallel_safe
Definition: relation.h:904
void cost_gather(GatherPath *path, PlannerInfo *root, RelOptInfo *rel, ParamPathInfo *param_info, double *rows)
Definition: costsize.c:349
Definition: nodes.h:79
bool parallel_aware
Definition: relation.h:903
Path path
Definition: relation.h:1209
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
GroupPath* create_group_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
List groupClause,
List qual,
double  numGroups 
)

Definition at line 2530 of file pathnode.c.

References RelOptInfo::consider_parallel, PathTarget::cost, cost_group(), GroupPath::groupClause, list_length(), makeNode, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, GroupPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, GroupPath::qual, Path::rows, QualCost::startup, Path::startup_cost, subpath(), GroupPath::subpath, T_Group, and Path::total_cost.

Referenced by create_grouping_paths().

2537 {
2538  GroupPath *pathnode = makeNode(GroupPath);
2539 
2540  pathnode->path.pathtype = T_Group;
2541  pathnode->path.parent = rel;
2542  pathnode->path.pathtarget = target;
2543  /* For now, assume we are above any joins, so no parameterization */
2544  pathnode->path.param_info = NULL;
2545  pathnode->path.parallel_aware = false;
2546  pathnode->path.parallel_safe = rel->consider_parallel &&
2547  subpath->parallel_safe;
2548  pathnode->path.parallel_workers = subpath->parallel_workers;
2549  /* Group doesn't change sort ordering */
2550  pathnode->path.pathkeys = subpath->pathkeys;
2551 
2552  pathnode->subpath = subpath;
2553 
2554  pathnode->groupClause = groupClause;
2555  pathnode->qual = qual;
2556 
2557  cost_group(&pathnode->path, root,
2558  list_length(groupClause),
2559  numGroups,
2560  subpath->startup_cost, subpath->total_cost,
2561  subpath->rows);
2562 
2563  /* add tlist eval cost for each output row */
2564  pathnode->path.startup_cost += target->cost.startup;
2565  pathnode->path.total_cost += target->cost.startup +
2566  target->cost.per_tuple * pathnode->path.rows;
2567 
2568  return pathnode;
2569 }
void cost_group(Path *path, PlannerInfo *root, int numGroupCols, double numGroups, Cost input_startup_cost, Cost input_total_cost, double input_tuples)
Definition: costsize.c:1998
List * qual
Definition: relation.h:1367
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
Cost per_tuple
Definition: relation.h:46
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Definition: nodes.h:75
Path path
Definition: relation.h:1364
List * groupClause
Definition: relation.h:1366
Path * subpath
Definition: relation.h:1365
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
static int list_length(const List *l)
Definition: pg_list.h:89
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
GroupingSetsPath* create_groupingsets_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
List having_qual,
List rollup_lists,
List rollup_groupclauses,
const AggClauseCosts agg_costs,
double  numGroups 
)

Definition at line 2706 of file pathnode.c.

References AGG_PLAIN, AGG_SORTED, Assert, RelOptInfo::consider_parallel, PathTarget::cost, cost_agg(), cost_sort(), PlannerInfo::group_pathkeys, lfirst, linitial, list_length(), llast, lnext, makeNode, NIL, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, GroupingSetsPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, GroupingSetsPath::qual, GroupingSetsPath::rollup_groupclauses, GroupingSetsPath::rollup_lists, Path::rows, QualCost::startup, Path::startup_cost, subpath(), GroupingSetsPath::subpath, T_Agg, Path::total_cost, PathTarget::width, and work_mem.

Referenced by create_grouping_paths().

2715 {
2717  int numGroupCols;
2718 
2719  /* The topmost generated Plan node will be an Agg */
2720  pathnode->path.pathtype = T_Agg;
2721  pathnode->path.parent = rel;
2722  pathnode->path.pathtarget = target;
2723  pathnode->path.param_info = subpath->param_info;
2724  pathnode->path.parallel_aware = false;
2725  pathnode->path.parallel_safe = rel->consider_parallel &&
2726  subpath->parallel_safe;
2727  pathnode->path.parallel_workers = subpath->parallel_workers;
2728  pathnode->subpath = subpath;
2729 
2730  /*
2731  * Output will be in sorted order by group_pathkeys if, and only if, there
2732  * is a single rollup operation on a non-empty list of grouping
2733  * expressions.
2734  */
2735  if (list_length(rollup_groupclauses) == 1 &&
2736  ((List *) linitial(rollup_groupclauses)) != NIL)
2737  pathnode->path.pathkeys = root->group_pathkeys;
2738  else
2739  pathnode->path.pathkeys = NIL;
2740 
2741  pathnode->rollup_groupclauses = rollup_groupclauses;
2742  pathnode->rollup_lists = rollup_lists;
2743  pathnode->qual = having_qual;
2744 
2745  Assert(rollup_lists != NIL);
2746  Assert(list_length(rollup_lists) == list_length(rollup_groupclauses));
2747 
2748  /* Account for cost of the topmost Agg node */
2749  numGroupCols = list_length((List *) linitial((List *) llast(rollup_lists)));
2750 
2751  cost_agg(&pathnode->path, root,
2752  (numGroupCols > 0) ? AGG_SORTED : AGG_PLAIN,
2753  agg_costs,
2754  numGroupCols,
2755  numGroups,
2756  subpath->startup_cost,
2757  subpath->total_cost,
2758  subpath->rows);
2759 
2760  /*
2761  * Add in the costs and output rows of the additional sorting/aggregation
2762  * steps, if any. Only total costs count, since the extra sorts aren't
2763  * run on startup.
2764  */
2765  if (list_length(rollup_lists) > 1)
2766  {
2767  ListCell *lc;
2768 
2769  foreach(lc, rollup_lists)
2770  {
2771  List *gsets = (List *) lfirst(lc);
2772  Path sort_path; /* dummy for result of cost_sort */
2773  Path agg_path; /* dummy for result of cost_agg */
2774 
2775  /* We must iterate over all but the last rollup_lists element */
2776  if (lnext(lc) == NULL)
2777  break;
2778 
2779  /* Account for cost of sort, but don't charge input cost again */
2780  cost_sort(&sort_path, root, NIL,
2781  0.0,
2782  subpath->rows,
2783  subpath->pathtarget->width,
2784  0.0,
2785  work_mem,
2786  -1.0);
2787 
2788  /* Account for cost of aggregation */
2789  numGroupCols = list_length((List *) linitial(gsets));
2790 
2791  cost_agg(&agg_path, root,
2792  AGG_SORTED,
2793  agg_costs,
2794  numGroupCols,
2795  numGroups, /* XXX surely not right for all steps? */
2796  sort_path.startup_cost,
2797  sort_path.total_cost,
2798  sort_path.rows);
2799 
2800  pathnode->path.total_cost += agg_path.total_cost;
2801  pathnode->path.rows += agg_path.rows;
2802  }
2803  }
2804 
2805  /* add tlist eval cost for each output row */
2806  pathnode->path.startup_cost += target->cost.startup;
2807  pathnode->path.total_cost += target->cost.startup +
2808  target->cost.per_tuple * pathnode->path.rows;
2809 
2810  return pathnode;
2811 }
List * group_pathkeys
Definition: relation.h:263
#define NIL
Definition: pg_list.h:69
Definition: nodes.h:76
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
#define llast(l)
Definition: pg_list.h:126
ParamPathInfo * param_info
Definition: relation.h:901
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
Cost per_tuple
Definition: relation.h:46
#define linitial(l)
Definition: pg_list.h:110
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
List * rollup_lists
Definition: relation.h:1412
void cost_agg(Path *path, PlannerInfo *root, AggStrategy aggstrategy, const AggClauseCosts *aggcosts, int numGroupCols, double numGroups, Cost input_startup_cost, Cost input_total_cost, double input_tuples)
Definition: costsize.c:1836
#define lnext(lc)
Definition: pg_list.h:105
List * rollup_groupclauses
Definition: relation.h:1411
void cost_sort(Path *path, PlannerInfo *root, List *pathkeys, Cost input_cost, double tuples, int width, Cost comparison_cost, int sort_mem, double limit_tuples)
Definition: costsize.c:1607
int work_mem
Definition: globals.c:112
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
static int list_length(const List *l)
Definition: pg_list.h:89
bool consider_parallel
Definition: relation.h:502
int width
Definition: relation.h:831
bool parallel_aware
Definition: relation.h:903
Definition: pg_list.h:45
Definition: relation.h:892
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
HashPath* create_hashjoin_path ( PlannerInfo root,
RelOptInfo joinrel,
JoinType  jointype,
JoinCostWorkspace workspace,
SpecialJoinInfo sjinfo,
SemiAntiJoinFactors semifactors,
Path outer_path,
Path inner_path,
List restrict_clauses,
Relids  required_outer,
List hashclauses 
)

Definition at line 2188 of file pathnode.c.

References RelOptInfo::consider_parallel, final_cost_hashjoin(), get_joinrel_parampathinfo(), JoinPath::innerjoinpath, JoinPath::joinrestrictinfo, JoinPath::jointype, HashPath::jpath, makeNode, NIL, JoinPath::outerjoinpath, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, JoinPath::path, HashPath::path_hashclauses, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_HashJoin.

Referenced by try_hashjoin_path(), and try_partial_hashjoin_path().

2199 {
2200  HashPath *pathnode = makeNode(HashPath);
2201 
2202  pathnode->jpath.path.pathtype = T_HashJoin;
2203  pathnode->jpath.path.parent = joinrel;
2204  pathnode->jpath.path.pathtarget = joinrel->reltarget;
2205  pathnode->jpath.path.param_info =
2207  joinrel,
2208  outer_path,
2209  inner_path,
2210  sjinfo,
2211  required_outer,
2212  &restrict_clauses);
2213  pathnode->jpath.path.parallel_aware = false;
2214  pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2215  outer_path->parallel_safe && inner_path->parallel_safe;
2216  /* This is a foolish way to estimate parallel_workers, but for now... */
2217  pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2218 
2219  /*
2220  * A hashjoin never has pathkeys, since its output ordering is
2221  * unpredictable due to possible batching. XXX If the inner relation is
2222  * small enough, we could instruct the executor that it must not batch,
2223  * and then we could assume that the output inherits the outer relation's
2224  * ordering, which might save a sort step. However there is considerable
2225  * downside if our estimate of the inner relation size is badly off. For
2226  * the moment we don't risk it. (Note also that if we wanted to take this
2227  * seriously, joinpath.c would have to consider many more paths for the
2228  * outer rel than it does now.)
2229  */
2230  pathnode->jpath.path.pathkeys = NIL;
2231  pathnode->jpath.jointype = jointype;
2232  pathnode->jpath.outerjoinpath = outer_path;
2233  pathnode->jpath.innerjoinpath = inner_path;
2234  pathnode->jpath.joinrestrictinfo = restrict_clauses;
2235  pathnode->path_hashclauses = hashclauses;
2236  /* final_cost_hashjoin will fill in pathnode->num_batches */
2237 
2238  final_cost_hashjoin(root, pathnode, workspace, sjinfo, semifactors);
2239 
2240  return pathnode;
2241 }
#define NIL
Definition: pg_list.h:69
JoinPath jpath
Definition: relation.h:1303
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_joinrel_parampathinfo(PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
Definition: relnode.c:1126
Path * innerjoinpath
Definition: relation.h:1238
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
List * joinrestrictinfo
Definition: relation.h:1240
RelOptInfo * parent
Definition: relation.h:898
Path * outerjoinpath
Definition: relation.h:1237
void final_cost_hashjoin(PlannerInfo *root, HashPath *path, JoinCostWorkspace *workspace, SpecialJoinInfo *sjinfo, SemiAntiJoinFactors *semifactors)
Definition: costsize.c:2935
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
Path path
Definition: relation.h:1233
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
JoinType jointype
Definition: relation.h:1235
bool parallel_aware
Definition: relation.h:903
List * path_hashclauses
Definition: relation.h:1304
struct PathTarget * reltarget
Definition: relation.h:505
IndexPath* create_index_path ( PlannerInfo root,
IndexOptInfo index,
List indexclauses,
List indexclausecols,
List indexorderbys,
List indexorderbycols,
List pathkeys,
ScanDirection  indexscandir,
bool  indexonly,
Relids  required_outer,
double  loop_count,
bool  partial_path 
)

Definition at line 1008 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_index(), expand_indexqual_conditions(), get_baserel_parampathinfo(), IndexPath::indexclauses, IndexPath::indexinfo, IndexPath::indexorderbycols, IndexPath::indexorderbys, IndexPath::indexqualcols, IndexPath::indexquals, IndexPath::indexscandir, makeNode, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, IndexPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, IndexOptInfo::rel, RelOptInfo::reltarget, T_IndexOnlyScan, and T_IndexScan.

Referenced by build_index_paths(), and plan_cluster_use_sort().

1020 {
1021  IndexPath *pathnode = makeNode(IndexPath);
1022  RelOptInfo *rel = index->rel;
1023  List *indexquals,
1024  *indexqualcols;
1025 
1026  pathnode->path.pathtype = indexonly ? T_IndexOnlyScan : T_IndexScan;
1027  pathnode->path.parent = rel;
1028  pathnode->path.pathtarget = rel->reltarget;
1029  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1030  required_outer);
1031  pathnode->path.parallel_aware = false;
1032  pathnode->path.parallel_safe = rel->consider_parallel;
1033  pathnode->path.parallel_workers = 0;
1034  pathnode->path.pathkeys = pathkeys;
1035 
1036  /* Convert clauses to indexquals the executor can handle */
1037  expand_indexqual_conditions(index, indexclauses, indexclausecols,
1038  &indexquals, &indexqualcols);
1039 
1040  /* Fill in the pathnode */
1041  pathnode->indexinfo = index;
1042  pathnode->indexclauses = indexclauses;
1043  pathnode->indexquals = indexquals;
1044  pathnode->indexqualcols = indexqualcols;
1045  pathnode->indexorderbys = indexorderbys;
1046  pathnode->indexorderbycols = indexorderbycols;
1047  pathnode->indexscandir = indexscandir;
1048 
1049  cost_index(pathnode, root, loop_count, partial_path);
1050 
1051  return pathnode;
1052 }
List * indexorderbycols
Definition: relation.h:981
PathTarget * pathtarget
Definition: relation.h:899
Path path
Definition: relation.h:975
IndexOptInfo * indexinfo
Definition: relation.h:976
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
List * indexclauses
Definition: relation.h:977
NodeTag pathtype
Definition: relation.h:896
List * indexquals
Definition: relation.h:978
RelOptInfo * rel
Definition: relation.h:594
void expand_indexqual_conditions(IndexOptInfo *index, List *indexclauses, List *indexclausecols, List **indexquals_p, List **indexqualcols_p)
Definition: indxpath.c:3522
RelOptInfo * parent
Definition: relation.h:898
void cost_index(IndexPath *path, PlannerInfo *root, double loop_count, bool partial_path)
Definition: costsize.c:462
List * indexorderbys
Definition: relation.h:980
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
List * indexqualcols
Definition: relation.h:979
ScanDirection indexscandir
Definition: relation.h:982
bool parallel_aware
Definition: relation.h:903
Definition: pg_list.h:45
struct PathTarget * reltarget
Definition: relation.h:505
LimitPath* create_limit_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
Node limitOffset,
Node limitCount,
int64  offset_est,
int64  count_est 
)

Definition at line 3209 of file pathnode.c.

References clamp_row_est(), RelOptInfo::consider_parallel, LimitPath::limitCount, LimitPath::limitOffset, makeNode, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, LimitPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, Path::rows, Path::startup_cost, subpath(), LimitPath::subpath, T_Limit, and Path::total_cost.

Referenced by grouping_planner().

3213 {
3214  LimitPath *pathnode = makeNode(LimitPath);
3215 
3216  pathnode->path.pathtype = T_Limit;
3217  pathnode->path.parent = rel;
3218  /* Limit doesn't project, so use source path's pathtarget */
3219  pathnode->path.pathtarget = subpath->pathtarget;
3220  /* For now, assume we are above any joins, so no parameterization */
3221  pathnode->path.param_info = NULL;
3222  pathnode->path.parallel_aware = false;
3223  pathnode->path.parallel_safe = rel->consider_parallel &&
3224  subpath->parallel_safe;
3225  pathnode->path.parallel_workers = subpath->parallel_workers;
3226  pathnode->path.rows = subpath->rows;
3227  pathnode->path.startup_cost = subpath->startup_cost;
3228  pathnode->path.total_cost = subpath->total_cost;
3229  pathnode->path.pathkeys = subpath->pathkeys;
3230  pathnode->subpath = subpath;
3231  pathnode->limitOffset = limitOffset;
3232  pathnode->limitCount = limitCount;
3233 
3234  /*
3235  * Adjust the output rows count and costs according to the offset/limit.
3236  * This is only a cosmetic issue if we are at top level, but if we are
3237  * building a subquery then it's important to report correct info to the
3238  * outer planner.
3239  *
3240  * When the offset or count couldn't be estimated, use 10% of the
3241  * estimated number of rows emitted from the subpath.
3242  *
3243  * XXX we don't bother to add eval costs of the offset/limit expressions
3244  * themselves to the path costs. In theory we should, but in most cases
3245  * those expressions are trivial and it's just not worth the trouble.
3246  */
3247  if (offset_est != 0)
3248  {
3249  double offset_rows;
3250 
3251  if (offset_est > 0)
3252  offset_rows = (double) offset_est;
3253  else
3254  offset_rows = clamp_row_est(subpath->rows * 0.10);
3255  if (offset_rows > pathnode->path.rows)
3256  offset_rows = pathnode->path.rows;
3257  if (subpath->rows > 0)
3258  pathnode->path.startup_cost +=
3259  (subpath->total_cost - subpath->startup_cost)
3260  * offset_rows / subpath->rows;
3261  pathnode->path.rows -= offset_rows;
3262  if (pathnode->path.rows < 1)
3263  pathnode->path.rows = 1;
3264  }
3265 
3266  if (count_est != 0)
3267  {
3268  double count_rows;
3269 
3270  if (count_est > 0)
3271  count_rows = (double) count_est;
3272  else
3273  count_rows = clamp_row_est(subpath->rows * 0.10);
3274  if (count_rows > pathnode->path.rows)
3275  count_rows = pathnode->path.rows;
3276  if (subpath->rows > 0)
3277  pathnode->path.total_cost = pathnode->path.startup_cost +
3278  (subpath->total_cost - subpath->startup_cost)
3279  * count_rows / subpath->rows;
3280  pathnode->path.rows = count_rows;
3281  if (pathnode->path.rows < 1)
3282  pathnode->path.rows = 1;
3283  }
3284 
3285  return pathnode;
3286 }
PathTarget * pathtarget
Definition: relation.h:899
Node * limitOffset
Definition: relation.h:1512
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
Cost startup_cost
Definition: relation.h:910
Path * subpath
Definition: relation.h:1511
RelOptInfo * parent
Definition: relation.h:898
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
Path path
Definition: relation.h:1510
bool parallel_aware
Definition: relation.h:903
double clamp_row_est(double nrows)
Definition: costsize.c:173
Node * limitCount
Definition: relation.h:1513
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
Definition: nodes.h:84
LockRowsPath* create_lockrows_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List rowMarks,
int  epqParam 
)

Definition at line 3053 of file pathnode.c.

References cpu_tuple_cost, LockRowsPath::epqParam, makeNode, NIL, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, LockRowsPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, LockRowsPath::rowMarks, Path::rows, Path::startup_cost, subpath(), LockRowsPath::subpath, T_LockRows, and Path::total_cost.

Referenced by grouping_planner().

3055 {
3056  LockRowsPath *pathnode = makeNode(LockRowsPath);
3057 
3058  pathnode->path.pathtype = T_LockRows;
3059  pathnode->path.parent = rel;
3060  /* LockRows doesn't project, so use source path's pathtarget */
3061  pathnode->path.pathtarget = subpath->pathtarget;
3062  /* For now, assume we are above any joins, so no parameterization */
3063  pathnode->path.param_info = NULL;
3064  pathnode->path.parallel_aware = false;
3065  pathnode->path.parallel_safe = false;
3066  pathnode->path.parallel_workers = 0;
3067  pathnode->path.rows = subpath->rows;
3068 
3069  /*
3070  * The result cannot be assumed sorted, since locking might cause the sort
3071  * key columns to be replaced with new values.
3072  */
3073  pathnode->path.pathkeys = NIL;
3074 
3075  pathnode->subpath = subpath;
3076  pathnode->rowMarks = rowMarks;
3077  pathnode->epqParam = epqParam;
3078 
3079  /*
3080  * We should charge something extra for the costs of row locking and
3081  * possible refetches, but it's hard to say how much. For now, use
3082  * cpu_tuple_cost per row.
3083  */
3084  pathnode->path.startup_cost = subpath->startup_cost;
3085  pathnode->path.total_cost = subpath->total_cost +
3086  cpu_tuple_cost * subpath->rows;
3087 
3088  return pathnode;
3089 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
List * rowMarks
Definition: relation.h:1476
NodeTag pathtype
Definition: relation.h:896
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Path * subpath
Definition: relation.h:1475
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
double cpu_tuple_cost
Definition: costsize.c:106
bool parallel_aware
Definition: relation.h:903
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
MaterialPath* create_material_path ( RelOptInfo rel,
Path subpath 
)

Definition at line 1389 of file pathnode.c.

References Assert, RelOptInfo::consider_parallel, cost_material(), makeNode, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, MaterialPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, Path::rows, Path::startup_cost, subpath(), MaterialPath::subpath, T_Material, Path::total_cost, and PathTarget::width.

Referenced by match_unsorted_outer(), and set_tablesample_rel_pathlist().

1390 {
1391  MaterialPath *pathnode = makeNode(MaterialPath);
1392 
1393  Assert(subpath->parent == rel);
1394 
1395  pathnode->path.pathtype = T_Material;
1396  pathnode->path.parent = rel;
1397  pathnode->path.pathtarget = rel->reltarget;
1398  pathnode->path.param_info = subpath->param_info;
1399  pathnode->path.parallel_aware = false;
1400  pathnode->path.parallel_safe = rel->consider_parallel &&
1401  subpath->parallel_safe;
1402  pathnode->path.parallel_workers = subpath->parallel_workers;
1403  pathnode->path.pathkeys = subpath->pathkeys;
1404 
1405  pathnode->subpath = subpath;
1406 
1407  cost_material(&pathnode->path,
1408  subpath->startup_cost,
1409  subpath->total_cost,
1410  subpath->rows,
1411  subpath->pathtarget->width);
1412 
1413  return pathnode;
1414 }
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Path * subpath
Definition: relation.h:1171
NodeTag pathtype
Definition: relation.h:896
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Cost total_cost
Definition: relation.h:911
void cost_material(Path *path, Cost input_startup_cost, Cost input_total_cost, double tuples, int width)
Definition: costsize.c:1782
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define Assert(condition)
Definition: c.h:675
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
int width
Definition: relation.h:831
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
MergeAppendPath* create_merge_append_path ( PlannerInfo root,
RelOptInfo rel,
List subpaths,
List pathkeys,
Relids  required_outer,
List partitioned_rels 
)

Definition at line 1258 of file pathnode.c.

References PlannerInfo::all_baserels, Assert, bms_equal(), RelOptInfo::consider_parallel, cost_merge_append(), cost_sort(), get_appendrel_parampathinfo(), lfirst, PlannerInfo::limit_tuples, MergeAppendPath::limit_tuples, list_length(), makeNode, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, MergeAppendPath::partitioned_rels, MergeAppendPath::path, PATH_REQ_OUTER, Path::pathkeys, pathkeys_contained_in(), Path::pathtarget, Path::pathtype, RelOptInfo::relids, RelOptInfo::reltarget, Path::rows, Path::startup_cost, subpath(), MergeAppendPath::subpaths, T_MergeAppend, Path::total_cost, RelOptInfo::tuples, PathTarget::width, and work_mem.

Referenced by generate_mergeappend_paths().

1264 {
1266  Cost input_startup_cost;
1267  Cost input_total_cost;
1268  ListCell *l;
1269 
1270  pathnode->path.pathtype = T_MergeAppend;
1271  pathnode->path.parent = rel;
1272  pathnode->path.pathtarget = rel->reltarget;
1274  required_outer);
1275  pathnode->path.parallel_aware = false;
1276  pathnode->path.parallel_safe = rel->consider_parallel;
1277  pathnode->path.parallel_workers = 0;
1278  pathnode->path.pathkeys = pathkeys;
1279  pathnode->partitioned_rels = partitioned_rels;
1280  pathnode->subpaths = subpaths;
1281 
1282  /*
1283  * Apply query-wide LIMIT if known and path is for sole base relation.
1284  * (Handling this at this low level is a bit klugy.)
1285  */
1286  if (bms_equal(rel->relids, root->all_baserels))
1287  pathnode->limit_tuples = root->limit_tuples;
1288  else
1289  pathnode->limit_tuples = -1.0;
1290 
1291  /*
1292  * Add up the sizes and costs of the input paths.
1293  */
1294  pathnode->path.rows = 0;
1295  input_startup_cost = 0;
1296  input_total_cost = 0;
1297  foreach(l, subpaths)
1298  {
1299  Path *subpath = (Path *) lfirst(l);
1300 
1301  pathnode->path.rows += subpath->rows;
1302  pathnode->path.parallel_safe = pathnode->path.parallel_safe &&
1303  subpath->parallel_safe;
1304 
1305  if (pathkeys_contained_in(pathkeys, subpath->pathkeys))
1306  {
1307  /* Subpath is adequately ordered, we won't need to sort it */
1308  input_startup_cost += subpath->startup_cost;
1309  input_total_cost += subpath->total_cost;
1310  }
1311  else
1312  {
1313  /* We'll need to insert a Sort node, so include cost for that */
1314  Path sort_path; /* dummy for result of cost_sort */
1315 
1316  cost_sort(&sort_path,
1317  root,
1318  pathkeys,
1319  subpath->total_cost,
1320  subpath->parent->tuples,
1321  subpath->pathtarget->width,
1322  0.0,
1323  work_mem,
1324  pathnode->limit_tuples);
1325  input_startup_cost += sort_path.startup_cost;
1326  input_total_cost += sort_path.total_cost;
1327  }
1328 
1329  /* All child paths must have same parameterization */
1330  Assert(bms_equal(PATH_REQ_OUTER(subpath), required_outer));
1331  }
1332 
1333  /* Now we can compute total costs of the MergeAppend */
1334  cost_merge_append(&pathnode->path, root,
1335  pathkeys, list_length(subpaths),
1336  input_startup_cost, input_total_cost,
1337  pathnode->path.rows);
1338 
1339  return pathnode;
1340 }
PathTarget * pathtarget
Definition: relation.h:899
double tuples
Definition: relation.h:533
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
List * partitioned_rels
Definition: relation.h:1144
NodeTag pathtype
Definition: relation.h:896
Relids all_baserels
Definition: relation.h:195
double limit_tuples
Definition: relation.h:291
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Relids relids
Definition: relation.h:494
bool pathkeys_contained_in(List *keys1, List *keys2)
Definition: pathkeys.c:317
void cost_sort(Path *path, PlannerInfo *root, List *pathkeys, Cost input_cost, double tuples, int width, Cost comparison_cost, int sort_mem, double limit_tuples)
Definition: costsize.c:1607
int work_mem
Definition: globals.c:112
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
void cost_merge_append(Path *path, PlannerInfo *root, List *pathkeys, int n_streams, Cost input_startup_cost, Cost input_total_cost, double tuples)
Definition: costsize.c:1731
#define Assert(condition)
Definition: c.h:675
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
static int list_length(const List *l)
Definition: pg_list.h:89
bool consider_parallel
Definition: relation.h:502
int width
Definition: relation.h:831
bool parallel_aware
Definition: relation.h:903
List * subpaths
Definition: relation.h:1145
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1334
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
double limit_tuples
Definition: relation.h:1146
double Cost
Definition: nodes.h:642
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:130
MergePath* create_mergejoin_path ( PlannerInfo root,
RelOptInfo joinrel,
JoinType  jointype,
JoinCostWorkspace workspace,
SpecialJoinInfo sjinfo,
Path outer_path,
Path inner_path,
List restrict_clauses,
List pathkeys,
Relids  required_outer,
List mergeclauses,
List outersortkeys,
List innersortkeys 
)

Definition at line 2124 of file pathnode.c.

References RelOptInfo::consider_parallel, final_cost_mergejoin(), get_joinrel_parampathinfo(), JoinPath::innerjoinpath, MergePath::innersortkeys, JoinPath::joinrestrictinfo, JoinPath::jointype, MergePath::jpath, makeNode, JoinPath::outerjoinpath, MergePath::outersortkeys, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, JoinPath::path, MergePath::path_mergeclauses, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_MergeJoin.

Referenced by try_mergejoin_path(), and try_partial_mergejoin_path().

2137 {
2138  MergePath *pathnode = makeNode(MergePath);
2139 
2140  pathnode->jpath.path.pathtype = T_MergeJoin;
2141  pathnode->jpath.path.parent = joinrel;
2142  pathnode->jpath.path.pathtarget = joinrel->reltarget;
2143  pathnode->jpath.path.param_info =
2145  joinrel,
2146  outer_path,
2147  inner_path,
2148  sjinfo,
2149  required_outer,
2150  &restrict_clauses);
2151  pathnode->jpath.path.parallel_aware = false;
2152  pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2153  outer_path->parallel_safe && inner_path->parallel_safe;
2154  /* This is a foolish way to estimate parallel_workers, but for now... */
2155  pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2156  pathnode->jpath.path.pathkeys = pathkeys;
2157  pathnode->jpath.jointype = jointype;
2158  pathnode->jpath.outerjoinpath = outer_path;
2159  pathnode->jpath.innerjoinpath = inner_path;
2160  pathnode->jpath.joinrestrictinfo = restrict_clauses;
2161  pathnode->path_mergeclauses = mergeclauses;
2162  pathnode->outersortkeys = outersortkeys;
2163  pathnode->innersortkeys = innersortkeys;
2164  /* pathnode->materialize_inner will be set by final_cost_mergejoin */
2165 
2166  final_cost_mergejoin(root, pathnode, workspace, sjinfo);
2167 
2168  return pathnode;
2169 }
List * path_mergeclauses
Definition: relation.h:1286
List * outersortkeys
Definition: relation.h:1287
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_joinrel_parampathinfo(PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
Definition: relnode.c:1126
Path * innerjoinpath
Definition: relation.h:1238
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
void final_cost_mergejoin(PlannerInfo *root, MergePath *path, JoinCostWorkspace *workspace, SpecialJoinInfo *sjinfo)
Definition: costsize.c:2540
List * joinrestrictinfo
Definition: relation.h:1240
RelOptInfo * parent
Definition: relation.h:898
Path * outerjoinpath
Definition: relation.h:1237
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
Path path
Definition: relation.h:1233
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
List * innersortkeys
Definition: relation.h:1288
JoinType jointype
Definition: relation.h:1235
JoinPath jpath
Definition: relation.h:1285
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
MinMaxAggPath* create_minmaxagg_path ( PlannerInfo root,
RelOptInfo rel,
PathTarget target,
List mmaggregates,
List quals 
)

Definition at line 2823 of file pathnode.c.

References PathTarget::cost, cpu_tuple_cost, lfirst, makeNode, MinMaxAggPath::mmaggregates, NIL, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, MinMaxAggPath::path, MinMaxAggInfo::pathcost, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, MinMaxAggPath::quals, Path::rows, QualCost::startup, Path::startup_cost, T_Result, and Path::total_cost.

Referenced by preprocess_minmax_aggregates().

2828 {
2829  MinMaxAggPath *pathnode = makeNode(MinMaxAggPath);
2830  Cost initplan_cost;
2831  ListCell *lc;
2832 
2833  /* The topmost generated Plan node will be a Result */
2834  pathnode->path.pathtype = T_Result;
2835  pathnode->path.parent = rel;
2836  pathnode->path.pathtarget = target;
2837  /* For now, assume we are above any joins, so no parameterization */
2838  pathnode->path.param_info = NULL;
2839  pathnode->path.parallel_aware = false;
2840  /* A MinMaxAggPath implies use of subplans, so cannot be parallel-safe */
2841  pathnode->path.parallel_safe = false;
2842  pathnode->path.parallel_workers = 0;
2843  /* Result is one unordered row */
2844  pathnode->path.rows = 1;
2845  pathnode->path.pathkeys = NIL;
2846 
2847  pathnode->mmaggregates = mmaggregates;
2848  pathnode->quals = quals;
2849 
2850  /* Calculate cost of all the initplans ... */
2851  initplan_cost = 0;
2852  foreach(lc, mmaggregates)
2853  {
2854  MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);
2855 
2856  initplan_cost += mminfo->pathcost;
2857  }
2858 
2859  /* add tlist eval cost for each output row, plus cpu_tuple_cost */
2860  pathnode->path.startup_cost = initplan_cost + target->cost.startup;
2861  pathnode->path.total_cost = initplan_cost + target->cost.startup +
2862  target->cost.per_tuple + cpu_tuple_cost;
2863 
2864  return pathnode;
2865 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
List * quals
Definition: relation.h:1423
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
Cost per_tuple
Definition: relation.h:46
Definition: nodes.h:45
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
List * mmaggregates
Definition: relation.h:1422
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
double cpu_tuple_cost
Definition: costsize.c:106
bool parallel_aware
Definition: relation.h:903
double Cost
Definition: nodes.h:642
ModifyTablePath* create_modifytable_path ( PlannerInfo root,
RelOptInfo rel,
CmdType  operation,
bool  canSetTag,
Index  nominalRelation,
List partitioned_rels,
List resultRelations,
List subpaths,
List subroots,
List withCheckOptionLists,
List returningLists,
List rowMarks,
OnConflictExpr onconflict,
int  epqParam 
)

Definition at line 3109 of file pathnode.c.

References Assert, ModifyTablePath::canSetTag, ModifyTablePath::epqParam, lfirst, list_head(), list_length(), makeNode, NIL, ModifyTablePath::nominalRelation, NULL, ModifyTablePath::onconflict, ModifyTablePath::operation, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, ModifyTablePath::partitioned_rels, ModifyTablePath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, ModifyTablePath::resultRelations, ModifyTablePath::returningLists, rint(), ModifyTablePath::rowMarks, Path::rows, Path::startup_cost, subpath(), ModifyTablePath::subpaths, ModifyTablePath::subroots, T_ModifyTable, Path::total_cost, PathTarget::width, and ModifyTablePath::withCheckOptionLists.

Referenced by grouping_planner(), and inheritance_planner().

3117 {
3119  double total_size;
3120  ListCell *lc;
3121 
3122  Assert(list_length(resultRelations) == list_length(subpaths));
3123  Assert(list_length(resultRelations) == list_length(subroots));
3124  Assert(withCheckOptionLists == NIL ||
3125  list_length(resultRelations) == list_length(withCheckOptionLists));
3126  Assert(returningLists == NIL ||
3127  list_length(resultRelations) == list_length(returningLists));
3128 
3129  pathnode->path.pathtype = T_ModifyTable;
3130  pathnode->path.parent = rel;
3131  /* pathtarget is not interesting, just make it minimally valid */
3132  pathnode->path.pathtarget = rel->reltarget;
3133  /* For now, assume we are above any joins, so no parameterization */
3134  pathnode->path.param_info = NULL;
3135  pathnode->path.parallel_aware = false;
3136  pathnode->path.parallel_safe = false;
3137  pathnode->path.parallel_workers = 0;
3138  pathnode->path.pathkeys = NIL;
3139 
3140  /*
3141  * Compute cost & rowcount as sum of subpath costs & rowcounts.
3142  *
3143  * Currently, we don't charge anything extra for the actual table
3144  * modification work, nor for the WITH CHECK OPTIONS or RETURNING
3145  * expressions if any. It would only be window dressing, since
3146  * ModifyTable is always a top-level node and there is no way for the
3147  * costs to change any higher-level planning choices. But we might want
3148  * to make it look better sometime.
3149  */
3150  pathnode->path.startup_cost = 0;
3151  pathnode->path.total_cost = 0;
3152  pathnode->path.rows = 0;
3153  total_size = 0;
3154  foreach(lc, subpaths)
3155  {
3156  Path *subpath = (Path *) lfirst(lc);
3157 
3158  if (lc == list_head(subpaths)) /* first node? */
3159  pathnode->path.startup_cost = subpath->startup_cost;
3160  pathnode->path.total_cost += subpath->total_cost;
3161  pathnode->path.rows += subpath->rows;
3162  total_size += subpath->pathtarget->width * subpath->rows;
3163  }
3164 
3165  /*
3166  * Set width to the average width of the subpath outputs. XXX this is
3167  * totally wrong: we should report zero if no RETURNING, else an average
3168  * of the RETURNING tlist widths. But it's what happened historically,
3169  * and improving it is a task for another day.
3170  */
3171  if (pathnode->path.rows > 0)
3172  total_size /= pathnode->path.rows;
3173  pathnode->path.pathtarget->width = rint(total_size);
3174 
3175  pathnode->operation = operation;
3176  pathnode->canSetTag = canSetTag;
3177  pathnode->nominalRelation = nominalRelation;
3178  pathnode->partitioned_rels = partitioned_rels;
3179  pathnode->resultRelations = resultRelations;
3180  pathnode->subpaths = subpaths;
3181  pathnode->subroots = subroots;
3182  pathnode->withCheckOptionLists = withCheckOptionLists;
3183  pathnode->returningLists = returningLists;
3184  pathnode->rowMarks = rowMarks;
3185  pathnode->onconflict = onconflict;
3186  pathnode->epqParam = epqParam;
3187 
3188  return pathnode;
3189 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
List * returningLists
Definition: relation.h:1499
OnConflictExpr * onconflict
Definition: relation.h:1501
Index nominalRelation
Definition: relation.h:1492
List * rowMarks
Definition: relation.h:1500
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
Cost startup_cost
Definition: relation.h:910
List * subroots
Definition: relation.h:1497
RelOptInfo * parent
Definition: relation.h:898
List * subpaths
Definition: relation.h:1496
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
double rint(double x)
Definition: rint.c:22
List * partitioned_rels
Definition: relation.h:1494
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
static int list_length(const List *l)
Definition: pg_list.h:89
List * withCheckOptionLists
Definition: relation.h:1498
int width
Definition: relation.h:831
CmdType operation
Definition: relation.h:1490
List * resultRelations
Definition: relation.h:1495
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
NestPath* create_nestloop_path ( PlannerInfo root,
RelOptInfo joinrel,
JoinType  jointype,
JoinCostWorkspace workspace,
SpecialJoinInfo sjinfo,
SemiAntiJoinFactors semifactors,
Path outer_path,
Path inner_path,
List restrict_clauses,
List pathkeys,
Relids  required_outer 
)

Definition at line 2036 of file pathnode.c.

References bms_overlap(), bms_union(), RelOptInfo::consider_parallel, final_cost_nestloop(), get_joinrel_parampathinfo(), JoinPath::innerjoinpath, join_clause_is_movable_into(), JoinPath::joinrestrictinfo, JoinPath::jointype, lappend(), lfirst, makeNode, NIL, JoinPath::outerjoinpath, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, JoinPath::path, PATH_REQ_OUTER, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::relids, RelOptInfo::reltarget, and T_NestLoop.

Referenced by try_nestloop_path(), and try_partial_nestloop_path().

2047 {
2048  NestPath *pathnode = makeNode(NestPath);
2049  Relids inner_req_outer = PATH_REQ_OUTER(inner_path);
2050 
2051  /*
2052  * If the inner path is parameterized by the outer, we must drop any
2053  * restrict_clauses that are due to be moved into the inner path. We have
2054  * to do this now, rather than postpone the work till createplan time,
2055  * because the restrict_clauses list can affect the size and cost
2056  * estimates for this path.
2057  */
2058  if (bms_overlap(inner_req_outer, outer_path->parent->relids))
2059  {
2060  Relids inner_and_outer = bms_union(inner_path->parent->relids,
2061  inner_req_outer);
2062  List *jclauses = NIL;
2063  ListCell *lc;
2064 
2065  foreach(lc, restrict_clauses)
2066  {
2067  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
2068 
2069  if (!join_clause_is_movable_into(rinfo,
2070  inner_path->parent->relids,
2071  inner_and_outer))
2072  jclauses = lappend(jclauses, rinfo);
2073  }
2074  restrict_clauses = jclauses;
2075  }
2076 
2077  pathnode->path.pathtype = T_NestLoop;
2078  pathnode->path.parent = joinrel;
2079  pathnode->path.pathtarget = joinrel->reltarget;
2080  pathnode->path.param_info =
2082  joinrel,
2083  outer_path,
2084  inner_path,
2085  sjinfo,
2086  required_outer,
2087  &restrict_clauses);
2088  pathnode->path.parallel_aware = false;
2089  pathnode->path.parallel_safe = joinrel->consider_parallel &&
2090  outer_path->parallel_safe && inner_path->parallel_safe;
2091  /* This is a foolish way to estimate parallel_workers, but for now... */
2092  pathnode->path.parallel_workers = outer_path->parallel_workers;
2093  pathnode->path.pathkeys = pathkeys;
2094  pathnode->jointype = jointype;
2095  pathnode->outerjoinpath = outer_path;
2096  pathnode->innerjoinpath = inner_path;
2097  pathnode->joinrestrictinfo = restrict_clauses;
2098 
2099  final_cost_nestloop(root, pathnode, workspace, sjinfo, semifactors);
2100 
2101  return pathnode;
2102 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_joinrel_parampathinfo(PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
Definition: relnode.c:1126
Path * innerjoinpath
Definition: relation.h:1238
void final_cost_nestloop(PlannerInfo *root, NestPath *path, JoinCostWorkspace *workspace, SpecialJoinInfo *sjinfo, SemiAntiJoinFactors *semifactors)
Definition: costsize.c:2121
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
List * joinrestrictinfo
Definition: relation.h:1240
RelOptInfo * parent
Definition: relation.h:898
Relids relids
Definition: relation.h:494
bool join_clause_is_movable_into(RestrictInfo *rinfo, Relids currentrelids, Relids current_and_outer)
Definition: restrictinfo.c:508
List * lappend(List *list, void *datum)
Definition: list.c:128
Path * outerjoinpath
Definition: relation.h:1237
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
Path path
Definition: relation.h:1233
#define lfirst(lc)
Definition: pg_list.h:106
bool parallel_safe
Definition: relation.h:904
#define PATH_REQ_OUTER(path)
Definition: relation.h:918
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:217
bool consider_parallel
Definition: relation.h:502
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:442
JoinType jointype
Definition: relation.h:1235
bool parallel_aware
Definition: relation.h:903
Definition: pg_list.h:45
struct PathTarget * reltarget
Definition: relation.h:505
ProjectionPath* create_projection_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target 
)

Definition at line 2252 of file pathnode.c.

References RelOptInfo::consider_parallel, PathTarget::cost, cpu_tuple_cost, ProjectionPath::dummypp, equal(), PathTarget::exprs, is_parallel_safe(), is_projection_capable_path(), makeNode, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, ProjectionPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, Path::rows, QualCost::startup, Path::startup_cost, subpath(), ProjectionPath::subpath, T_Result, and Path::total_cost.

Referenced by adjust_paths_for_srfs(), apply_projection_to_path(), and grouping_planner().

2256 {
2257  ProjectionPath *pathnode = makeNode(ProjectionPath);
2258  PathTarget *oldtarget = subpath->pathtarget;
2259 
2260  pathnode->path.pathtype = T_Result;
2261  pathnode->path.parent = rel;
2262  pathnode->path.pathtarget = target;
2263  /* For now, assume we are above any joins, so no parameterization */
2264  pathnode->path.param_info = NULL;
2265  pathnode->path.parallel_aware = false;
2266  pathnode->path.parallel_safe = rel->consider_parallel &&
2267  subpath->parallel_safe &&
2268  is_parallel_safe(root, (Node *) target->exprs);
2269  pathnode->path.parallel_workers = subpath->parallel_workers;
2270  /* Projection does not change the sort order */
2271  pathnode->path.pathkeys = subpath->pathkeys;
2272 
2273  pathnode->subpath = subpath;
2274 
2275  /*
2276  * We might not need a separate Result node. If the input plan node type
2277  * can project, we can just tell it to project something else. Or, if it
2278  * can't project but the desired target has the same expression list as
2279  * what the input will produce anyway, we can still give it the desired
2280  * tlist (possibly changing its ressortgroupref labels, but nothing else).
2281  * Note: in the latter case, create_projection_plan has to recheck our
2282  * conclusion; see comments therein.
2283  */
2284  if (is_projection_capable_path(subpath) ||
2285  equal(oldtarget->exprs, target->exprs))
2286  {
2287  /* No separate Result node needed */
2288  pathnode->dummypp = true;
2289 
2290  /*
2291  * Set cost of plan as subpath's cost, adjusted for tlist replacement.
2292  */
2293  pathnode->path.rows = subpath->rows;
2294  pathnode->path.startup_cost = subpath->startup_cost +
2295  (target->cost.startup - oldtarget->cost.startup);
2296  pathnode->path.total_cost = subpath->total_cost +
2297  (target->cost.startup - oldtarget->cost.startup) +
2298  (target->cost.per_tuple - oldtarget->cost.per_tuple) * subpath->rows;
2299  }
2300  else
2301  {
2302  /* We really do need the Result node */
2303  pathnode->dummypp = false;
2304 
2305  /*
2306  * The Result node's cost is cpu_tuple_cost per row, plus the cost of
2307  * evaluating the tlist. There is no qual to worry about.
2308  */
2309  pathnode->path.rows = subpath->rows;
2310  pathnode->path.startup_cost = subpath->startup_cost +
2311  target->cost.startup;
2312  pathnode->path.total_cost = subpath->total_cost +
2313  target->cost.startup +
2314  (cpu_tuple_cost + target->cost.per_tuple) * subpath->rows;
2315  }
2316 
2317  return pathnode;
2318 }
PathTarget * pathtarget
Definition: relation.h:899
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:2923
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Definition: nodes.h:518
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:1071
Cost per_tuple
Definition: relation.h:46
Definition: nodes.h:45
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
List * exprs
Definition: relation.h:828
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
bool consider_parallel
Definition: relation.h:502
double cpu_tuple_cost
Definition: costsize.c:106
bool is_projection_capable_path(Path *path)
Definition: createplan.c:6423
bool parallel_aware
Definition: relation.h:903
Path * subpath
Definition: relation.h:1325
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
RecursiveUnionPath* create_recursiveunion_path ( PlannerInfo root,
RelOptInfo rel,
Path leftpath,
Path rightpath,
PathTarget target,
List distinctList,
int  wtParam,
double  numGroups 
)

Definition at line 3008 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_recursive_union(), RecursiveUnionPath::distinctList, RecursiveUnionPath::leftpath, makeNode, NIL, NULL, RecursiveUnionPath::numGroups, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, RecursiveUnionPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RecursiveUnionPath::rightpath, T_RecursiveUnion, and RecursiveUnionPath::wtParam.

Referenced by generate_recursion_path().

3016 {
3018 
3019  pathnode->path.pathtype = T_RecursiveUnion;
3020  pathnode->path.parent = rel;
3021  pathnode->path.pathtarget = target;
3022  /* For now, assume we are above any joins, so no parameterization */
3023  pathnode->path.param_info = NULL;
3024  pathnode->path.parallel_aware = false;
3025  pathnode->path.parallel_safe = rel->consider_parallel &&
3026  leftpath->parallel_safe && rightpath->parallel_safe;
3027  /* Foolish, but we'll do it like joins for now: */
3028  pathnode->path.parallel_workers = leftpath->parallel_workers;
3029  /* RecursiveUnion result is always unsorted */
3030  pathnode->path.pathkeys = NIL;
3031 
3032  pathnode->leftpath = leftpath;
3033  pathnode->rightpath = rightpath;
3034  pathnode->distinctList = distinctList;
3035  pathnode->wtParam = wtParam;
3036  pathnode->numGroups = numGroups;
3037 
3038  cost_recursive_union(&pathnode->path, leftpath, rightpath);
3039 
3040  return pathnode;
3041 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
void cost_recursive_union(Path *runion, Path *nrterm, Path *rterm)
Definition: costsize.c:1527
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
ResultPath* create_result_path ( PlannerInfo root,
RelOptInfo rel,
PathTarget target,
List resconstantqual 
)

Definition at line 1350 of file pathnode.c.

References RelOptInfo::consider_parallel, PathTarget::cost, cost_qual_eval(), cpu_tuple_cost, makeNode, NIL, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, ResultPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, ResultPath::quals, Path::rows, QualCost::startup, Path::startup_cost, T_Result, and Path::total_cost.

Referenced by create_grouping_paths(), and query_planner().

1352 {
1353  ResultPath *pathnode = makeNode(ResultPath);
1354 
1355  pathnode->path.pathtype = T_Result;
1356  pathnode->path.parent = rel;
1357  pathnode->path.pathtarget = target;
1358  pathnode->path.param_info = NULL; /* there are no other rels... */
1359  pathnode->path.parallel_aware = false;
1360  pathnode->path.parallel_safe = rel->consider_parallel;
1361  pathnode->path.parallel_workers = 0;
1362  pathnode->path.pathkeys = NIL;
1363  pathnode->quals = resconstantqual;
1364 
1365  /* Hardly worth defining a cost_result() function ... just do it */
1366  pathnode->path.rows = 1;
1367  pathnode->path.startup_cost = target->cost.startup;
1368  pathnode->path.total_cost = target->cost.startup +
1369  cpu_tuple_cost + target->cost.per_tuple;
1370  if (resconstantqual)
1371  {
1372  QualCost qual_cost;
1373 
1374  cost_qual_eval(&qual_cost, resconstantqual, root);
1375  /* resconstantqual is evaluated once at startup */
1376  pathnode->path.startup_cost += qual_cost.startup + qual_cost.per_tuple;
1377  pathnode->path.total_cost += qual_cost.startup + qual_cost.per_tuple;
1378  }
1379 
1380  return pathnode;
1381 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
Cost per_tuple
Definition: relation.h:46
Path path
Definition: relation.h:1158
Definition: nodes.h:45
void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root)
Definition: costsize.c:3359
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
List * quals
Definition: relation.h:1159
QualCost cost
Definition: relation.h:830
bool consider_parallel
Definition: relation.h:502
double cpu_tuple_cost
Definition: costsize.c:106
bool parallel_aware
Definition: relation.h:903
Path* create_samplescan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer 
)

Definition at line 963 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_samplescan(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_SampleScan.

Referenced by reparameterize_path(), and set_tablesample_rel_pathlist().

964 {
965  Path *pathnode = makeNode(Path);
966 
967  pathnode->pathtype = T_SampleScan;
968  pathnode->parent = rel;
969  pathnode->pathtarget = rel->reltarget;
970  pathnode->param_info = get_baserel_parampathinfo(root, rel,
971  required_outer);
972  pathnode->parallel_aware = false;
973  pathnode->parallel_safe = rel->consider_parallel;
974  pathnode->parallel_workers = 0;
975  pathnode->pathkeys = NIL; /* samplescan has unordered result */
976 
977  cost_samplescan(pathnode, root, rel, pathnode->param_info);
978 
979  return pathnode;
980 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
void cost_samplescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:274
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
Path* create_seqscan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer,
int  parallel_workers 
)

Definition at line 938 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_seqscan(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_SeqScan.

Referenced by create_plain_partial_paths(), plan_cluster_use_sort(), reparameterize_path(), and set_plain_rel_pathlist().

940 {
941  Path *pathnode = makeNode(Path);
942 
943  pathnode->pathtype = T_SeqScan;
944  pathnode->parent = rel;
945  pathnode->pathtarget = rel->reltarget;
946  pathnode->param_info = get_baserel_parampathinfo(root, rel,
947  required_outer);
948  pathnode->parallel_aware = parallel_workers > 0 ? true : false;
949  pathnode->parallel_safe = rel->consider_parallel;
950  pathnode->parallel_workers = parallel_workers;
951  pathnode->pathkeys = NIL; /* seqscan has unordered result */
952 
953  cost_seqscan(pathnode, root, rel, pathnode->param_info);
954 
955  return pathnode;
956 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
void cost_seqscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:197
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
ProjectSetPath* create_set_projection_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target 
)

Definition at line 2419 of file pathnode.c.

References RelOptInfo::consider_parallel, PathTarget::cost, cpu_tuple_cost, expression_returns_set_rows(), PathTarget::exprs, is_parallel_safe(), lfirst, makeNode, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, ProjectSetPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, QualCost::per_tuple, Path::rows, QualCost::startup, Path::startup_cost, subpath(), ProjectSetPath::subpath, T_ProjectSet, and Path::total_cost.

Referenced by adjust_paths_for_srfs().

2423 {
2424  ProjectSetPath *pathnode = makeNode(ProjectSetPath);
2425  double tlist_rows;
2426  ListCell *lc;
2427 
2428  pathnode->path.pathtype = T_ProjectSet;
2429  pathnode->path.parent = rel;
2430  pathnode->path.pathtarget = target;
2431  /* For now, assume we are above any joins, so no parameterization */
2432  pathnode->path.param_info = NULL;
2433  pathnode->path.parallel_aware = false;
2434  pathnode->path.parallel_safe = rel->consider_parallel &&
2435  subpath->parallel_safe &&
2436  is_parallel_safe(root, (Node *) target->exprs);
2437  pathnode->path.parallel_workers = subpath->parallel_workers;
2438  /* Projection does not change the sort order XXX? */
2439  pathnode->path.pathkeys = subpath->pathkeys;
2440 
2441  pathnode->subpath = subpath;
2442 
2443  /*
2444  * Estimate number of rows produced by SRFs for each row of input; if
2445  * there's more than one in this node, use the maximum.
2446  */
2447  tlist_rows = 1;
2448  foreach(lc, target->exprs)
2449  {
2450  Node *node = (Node *) lfirst(lc);
2451  double itemrows;
2452 
2453  itemrows = expression_returns_set_rows(node);
2454  if (tlist_rows < itemrows)
2455  tlist_rows = itemrows;
2456  }
2457 
2458  /*
2459  * In addition to the cost of evaluating the tlist, charge cpu_tuple_cost
2460  * per input row, and half of cpu_tuple_cost for each added output row.
2461  * This is slightly bizarre maybe, but it's what 9.6 did; we may revisit
2462  * this estimate later.
2463  */
2464  pathnode->path.rows = subpath->rows * tlist_rows;
2465  pathnode->path.startup_cost = subpath->startup_cost +
2466  target->cost.startup;
2467  pathnode->path.total_cost = subpath->total_cost +
2468  target->cost.startup +
2469  (cpu_tuple_cost + target->cost.per_tuple) * subpath->rows +
2470  (pathnode->path.rows - subpath->rows) * cpu_tuple_cost / 2;
2471 
2472  return pathnode;
2473 }
PathTarget * pathtarget
Definition: relation.h:899
double expression_returns_set_rows(Node *clause)
Definition: clauses.c:801
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Definition: nodes.h:518
Cost startup
Definition: relation.h:45
NodeTag pathtype
Definition: relation.h:896
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:1071
Cost per_tuple
Definition: relation.h:46
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
List * exprs
Definition: relation.h:828
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
#define lfirst(lc)
Definition: pg_list.h:106
Path * subpath
Definition: relation.h:1337
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
QualCost cost
Definition: relation.h:830
bool consider_parallel
Definition: relation.h:502
double cpu_tuple_cost
Definition: costsize.c:106
bool parallel_aware
Definition: relation.h:903
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
SetOpPath* create_setop_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
SetOpCmd  cmd,
SetOpStrategy  strategy,
List distinctList,
AttrNumber  flagColIdx,
int  firstFlag,
double  numGroups,
double  outputRows 
)

Definition at line 2946 of file pathnode.c.

References SetOpPath::cmd, RelOptInfo::consider_parallel, cpu_operator_cost, SetOpPath::distinctList, SetOpPath::firstFlag, SetOpPath::flagColIdx, list_length(), makeNode, NIL, NULL, SetOpPath::numGroups, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, SetOpPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, Path::rows, SETOP_SORTED, Path::startup_cost, SetOpPath::strategy, SetOpPath::subpath, T_SetOp, and Path::total_cost.

Referenced by generate_nonunion_path().

2956 {
2957  SetOpPath *pathnode = makeNode(SetOpPath);
2958 
2959  pathnode->path.pathtype = T_SetOp;
2960  pathnode->path.parent = rel;
2961  /* SetOp doesn't project, so use source path's pathtarget */
2962  pathnode->path.pathtarget = subpath->pathtarget;
2963  /* For now, assume we are above any joins, so no parameterization */
2964  pathnode->path.param_info = NULL;
2965  pathnode->path.parallel_aware = false;
2966  pathnode->path.parallel_safe = rel->consider_parallel &&
2967  subpath->parallel_safe;
2968  pathnode->path.parallel_workers = subpath->parallel_workers;
2969  /* SetOp preserves the input sort order if in sort mode */
2970  pathnode->path.pathkeys =
2971  (strategy == SETOP_SORTED) ? subpath->pathkeys : NIL;
2972 
2973  pathnode->subpath = subpath;
2974  pathnode->cmd = cmd;
2975  pathnode->strategy = strategy;
2976  pathnode->distinctList = distinctList;
2977  pathnode->flagColIdx = flagColIdx;
2978  pathnode->firstFlag = firstFlag;
2979  pathnode->numGroups = numGroups;
2980 
2981  /*
2982  * Charge one cpu_operator_cost per comparison per input tuple. We assume
2983  * all columns get compared at most of the tuples.
2984  */
2985  pathnode->path.startup_cost = subpath->startup_cost;
2986  pathnode->path.total_cost = subpath->total_cost +
2987  cpu_operator_cost * subpath->rows * list_length(distinctList);
2988  pathnode->path.rows = outputRows;
2989 
2990  return pathnode;
2991 }
#define NIL
Definition: pg_list.h:69
List * distinctList
Definition: relation.h:1450
PathTarget * pathtarget
Definition: relation.h:899
SetOpStrategy strategy
Definition: relation.h:1449
Path * subpath
Definition: relation.h:1447
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
double numGroups
Definition: relation.h:1453
NodeTag pathtype
Definition: relation.h:896
SetOpCmd cmd
Definition: relation.h:1448
Cost startup_cost
Definition: relation.h:910
RelOptInfo * parent
Definition: relation.h:898
AttrNumber flagColIdx
Definition: relation.h:1451
double cpu_operator_cost
Definition: costsize.c:108
Cost total_cost
Definition: relation.h:911
int firstFlag
Definition: relation.h:1452
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
static int list_length(const List *l)
Definition: pg_list.h:89
bool consider_parallel
Definition: relation.h:502
Definition: nodes.h:82
bool parallel_aware
Definition: relation.h:903
Path path
Definition: relation.h:1446
SortPath* create_sort_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List pathkeys,
double  limit_tuples 
)

Definition at line 2486 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_sort(), makeNode, NULL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, SortPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, Path::rows, subpath(), SortPath::subpath, T_Sort, Path::total_cost, PathTarget::width, and work_mem.

Referenced by create_distinct_paths(), create_grouping_paths(), create_one_window_path(), create_ordered_paths(), generate_nonunion_path(), and make_union_unique().

2491 {
2492  SortPath *pathnode = makeNode(SortPath);
2493 
2494  pathnode->path.pathtype = T_Sort;
2495  pathnode->path.parent = rel;
2496  /* Sort doesn't project, so use source path's pathtarget */
2497  pathnode->path.pathtarget = subpath->pathtarget;
2498  /* For now, assume we are above any joins, so no parameterization */
2499  pathnode->path.param_info = NULL;
2500  pathnode->path.parallel_aware = false;
2501  pathnode->path.parallel_safe = rel->consider_parallel &&
2502  subpath->parallel_safe;
2503  pathnode->path.parallel_workers = subpath->parallel_workers;
2504  pathnode->path.pathkeys = pathkeys;
2505 
2506  pathnode->subpath = subpath;
2507 
2508  cost_sort(&pathnode->path, root, pathkeys,
2509  subpath->total_cost,
2510  subpath->rows,
2511  subpath->pathtarget->width,
2512  0.0, /* XXX comparison_cost shouldn't be 0? */
2513  work_mem, limit_tuples);
2514 
2515  return pathnode;
2516 }
PathTarget * pathtarget
Definition: relation.h:899
Path * subpath
Definition: relation.h:1351
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
Definition: nodes.h:74
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
void cost_sort(Path *path, PlannerInfo *root, List *pathkeys, Cost input_cost, double tuples, int width, Cost comparison_cost, int sort_mem, double limit_tuples)
Definition: costsize.c:1607
int work_mem
Definition: globals.c:112
Cost total_cost
Definition: relation.h:911
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
#define NULL
Definition: c.h:229
double rows
Definition: relation.h:909
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
int width
Definition: relation.h:831
bool parallel_aware
Definition: relation.h:903
Path path
Definition: relation.h:1350
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
SubqueryScanPath* create_subqueryscan_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List pathkeys,
Relids  required_outer 
)

Definition at line 1769 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_subqueryscan(), get_baserel_parampathinfo(), makeNode, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, SubqueryScanPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, subpath(), SubqueryScanPath::subpath, and T_SubqueryScan.

Referenced by recurse_set_operations(), reparameterize_path(), and set_subquery_pathlist().

1771 {
1773 
1774  pathnode->path.pathtype = T_SubqueryScan;
1775  pathnode->path.parent = rel;
1776  pathnode->path.pathtarget = rel->reltarget;
1777  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1778  required_outer);
1779  pathnode->path.parallel_aware = false;
1780  pathnode->path.parallel_safe = rel->consider_parallel &&
1781  subpath->parallel_safe;
1782  pathnode->path.parallel_workers = subpath->parallel_workers;
1783  pathnode->path.pathkeys = pathkeys;
1784  pathnode->subpath = subpath;
1785 
1786  cost_subqueryscan(pathnode, root, rel, pathnode->path.param_info);
1787 
1788  return pathnode;
1789 }
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
void cost_subqueryscan(SubqueryScanPath *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1267
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
Path* create_tablefuncscan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer 
)

Definition at line 1823 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_tablefuncscan(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, and T_TableFuncScan.

Referenced by set_tablefunc_pathlist().

1825 {
1826  Path *pathnode = makeNode(Path);
1827 
1828  pathnode->pathtype = T_TableFuncScan;
1829  pathnode->parent = rel;
1830  pathnode->pathtarget = rel->reltarget;
1831  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1832  required_outer);
1833  pathnode->parallel_aware = false;
1834  pathnode->parallel_safe = rel->consider_parallel;
1835  pathnode->parallel_workers = 0;
1836  pathnode->pathkeys = NIL; /* result is always unordered */
1837 
1838  cost_tablefuncscan(pathnode, root, rel, pathnode->param_info);
1839 
1840  return pathnode;
1841 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
void cost_tablefuncscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1377
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505
Definition: relation.h:892
Path* create_tablexprscan_path ( PlannerInfo root,
RelOptInfo rel,
List pathkeys,
Relids  required_outer 
)
TidPath* create_tidscan_path ( PlannerInfo root,
RelOptInfo rel,
List tidquals,
Relids  required_outer 
)

Definition at line 1172 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_tidscan(), get_baserel_parampathinfo(), makeNode, NIL, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, TidPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, RelOptInfo::reltarget, T_TidScan, and TidPath::tidquals.

Referenced by create_tidscan_paths().

1174 {
1175  TidPath *pathnode = makeNode(TidPath);
1176 
1177  pathnode->path.pathtype = T_TidScan;
1178  pathnode->path.parent = rel;
1179  pathnode->path.pathtarget = rel->reltarget;
1180  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1181  required_outer);
1182  pathnode->path.parallel_aware = false;
1183  pathnode->path.parallel_safe = rel->consider_parallel;
1184  pathnode->path.parallel_workers = 0;
1185  pathnode->path.pathkeys = NIL; /* always unordered */
1186 
1187  pathnode->tidquals = tidquals;
1188 
1189  cost_tidscan(&pathnode->path, root, rel, tidquals,
1190  pathnode->path.param_info);
1191 
1192  return pathnode;
1193 }
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:899
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1035
void cost_tidscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, List *tidquals, ParamPathInfo *param_info)
Definition: costsize.c:1164
int parallel_workers
Definition: relation.h:905
ParamPathInfo * param_info
Definition: relation.h:901
NodeTag pathtype
Definition: relation.h:896
RelOptInfo * parent
Definition: relation.h:898
List * tidquals
Definition: relation.h:1046
List * pathkeys
Definition: relation.h:913
#define makeNode(_type_)
Definition: nodes.h:566
bool parallel_safe
Definition: relation.h:904
bool consider_parallel
Definition: relation.h:502
Path path
Definition: relation.h:1045
bool parallel_aware
Definition: relation.h:903
struct PathTarget * reltarget
Definition: relation.h:505