PostgreSQL Source Code  git master
pathnode.h File Reference
#include "nodes/bitmapset.h"
#include "nodes/pathnodes.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 *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 (PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, List *pathkeys, Relids required_outer, int parallel_workers, bool parallel_aware, List *partitioned_rels, double rows)
 
MergeAppendPathcreate_merge_append_path (PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *pathkeys, Relids required_outer, List *partitioned_rels)
 
GroupResultPathcreate_group_result_path (PlannerInfo *root, RelOptInfo *rel, PathTarget *target, List *havingqual)
 
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_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_namedtuplestorescan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
Pathcreate_resultscan_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)
 
ForeignPathcreate_foreign_join_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)
 
ForeignPathcreate_foreign_upper_path (PlannerInfo *root, RelOptInfo *rel, PathTarget *target, double rows, Cost startup_cost, Cost total_cost, List *pathkeys, Path *fdw_outerpath, List *fdw_private)
 
Relids calc_nestloop_required_outer (Relids outerrelids, Relids outer_paramrels, Relids innerrelids, Relids inner_paramrels)
 
Relids calc_non_nestloop_required_outer (Path *outer_path, Path *inner_path)
 
NestPathcreate_nestloop_path (PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, JoinCostWorkspace *workspace, JoinPathExtraData *extra, 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, JoinPathExtraData *extra, 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, JoinPathExtraData *extra, Path *outer_path, Path *inner_path, bool parallel_hash, 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_incremental_sort_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, int presorted_keys, double limit_tuples)
 
SortPathcreate_sort_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, double limit_tuples)
 
GroupPathcreate_group_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, 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, List *having_qual, AggStrategy aggstrategy, List *rollups, 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)
 
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, Index rootRelation, bool partColsUpdated, 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, LimitOption limitOption, int64 offset_est, int64 count_est)
 
void adjust_limit_rows_costs (double *rows, Cost *startup_cost, Cost *total_cost, int64 offset_est, int64 count_est)
 
Pathreparameterize_path (PlannerInfo *root, Path *path, Relids required_outer, double loop_count)
 
Pathreparameterize_path_by_child (PlannerInfo *root, Path *path, RelOptInfo *child_rel)
 
void setup_simple_rel_arrays (PlannerInfo *root)
 
void expand_planner_arrays (PlannerInfo *root, int add_size)
 
RelOptInfobuild_simple_rel (PlannerInfo *root, int relid, RelOptInfo *parent)
 
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)
 
RelOptInfofetch_upper_rel (PlannerInfo *root, UpperRelationKind kind, Relids relids)
 
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)
 
ParamPathInfofind_param_path_info (RelOptInfo *rel, Relids required_outer)
 
RelOptInfobuild_child_join_rel (PlannerInfo *root, RelOptInfo *outer_rel, RelOptInfo *inner_rel, RelOptInfo *parent_joinrel, List *restrictlist, SpecialJoinInfo *sjinfo, JoinType jointype)
 

Function Documentation

◆ add_partial_path()

void add_partial_path ( RelOptInfo parent_rel,
Path new_path 
)

Definition at line 749 of file pathnode.c.

References Assert, CHECK_FOR_INTERRUPTS, compare_pathkeys(), RelOptInfo::consider_parallel, foreach_current_index, foreach_delete_current, lfirst, list_insert_nth(), Path::parallel_safe, 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_partial_bitmap_paths(), create_partial_grouping_paths(), create_plain_partial_paths(), grouping_planner(), recurse_set_operations(), set_subquery_pathlist(), try_partial_hashjoin_path(), try_partial_mergejoin_path(), and try_partial_nestloop_path().

750 {
751  bool accept_new = true; /* unless we find a superior old path */
752  int insert_at = 0; /* where to insert new item */
753  ListCell *p1;
754 
755  /* Check for query cancel. */
757 
758  /* Path to be added must be parallel safe. */
759  Assert(new_path->parallel_safe);
760 
761  /* Relation should be OK for parallelism, too. */
762  Assert(parent_rel->consider_parallel);
763 
764  /*
765  * As in add_path, throw out any paths which are dominated by the new
766  * path, but throw out the new path if some existing path dominates it.
767  */
768  foreach(p1, parent_rel->partial_pathlist)
769  {
770  Path *old_path = (Path *) lfirst(p1);
771  bool remove_old = false; /* unless new proves superior */
772  PathKeysComparison keyscmp;
773 
774  /* Compare pathkeys. */
775  keyscmp = compare_pathkeys(new_path->pathkeys, old_path->pathkeys);
776 
777  /* Unless pathkeys are incompatible, keep just one of the two paths. */
778  if (keyscmp != PATHKEYS_DIFFERENT)
779  {
780  if (new_path->total_cost > old_path->total_cost * STD_FUZZ_FACTOR)
781  {
782  /* New path costs more; keep it only if pathkeys are better. */
783  if (keyscmp != PATHKEYS_BETTER1)
784  accept_new = false;
785  }
786  else if (old_path->total_cost > new_path->total_cost
787  * STD_FUZZ_FACTOR)
788  {
789  /* Old path costs more; keep it only if pathkeys are better. */
790  if (keyscmp != PATHKEYS_BETTER2)
791  remove_old = true;
792  }
793  else if (keyscmp == PATHKEYS_BETTER1)
794  {
795  /* Costs are about the same, new path has better pathkeys. */
796  remove_old = true;
797  }
798  else if (keyscmp == PATHKEYS_BETTER2)
799  {
800  /* Costs are about the same, old path has better pathkeys. */
801  accept_new = false;
802  }
803  else if (old_path->total_cost > new_path->total_cost * 1.0000000001)
804  {
805  /* Pathkeys are the same, and the old path costs more. */
806  remove_old = true;
807  }
808  else
809  {
810  /*
811  * Pathkeys are the same, and new path isn't materially
812  * cheaper.
813  */
814  accept_new = false;
815  }
816  }
817 
818  /*
819  * Remove current element from partial_pathlist if dominated by new.
820  */
821  if (remove_old)
822  {
823  parent_rel->partial_pathlist =
824  foreach_delete_current(parent_rel->partial_pathlist, p1);
825  pfree(old_path);
826  }
827  else
828  {
829  /* new belongs after this old path if it has cost >= old's */
830  if (new_path->total_cost >= old_path->total_cost)
831  insert_at = foreach_current_index(p1) + 1;
832  }
833 
834  /*
835  * If we found an old path that dominates new_path, we can quit
836  * scanning the partial_pathlist; we will not add new_path, and we
837  * assume new_path cannot dominate any later path.
838  */
839  if (!accept_new)
840  break;
841  }
842 
843  if (accept_new)
844  {
845  /* Accept the new path: insert it at proper place */
846  parent_rel->partial_pathlist =
847  list_insert_nth(parent_rel->partial_pathlist, insert_at, new_path);
848  }
849  else
850  {
851  /* Reject and recycle the new path */
852  pfree(new_path);
853  }
854 }
List * partial_pathlist
Definition: pathnodes.h:681
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:285
#define foreach_delete_current(lst, cell)
Definition: pg_list.h:368
List * list_insert_nth(List *list, int pos, void *datum)
Definition: list.c:400
void pfree(void *pointer)
Definition: mcxt.c:1056
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
bool parallel_safe
Definition: pathnodes.h:1150
#define STD_FUZZ_FACTOR
Definition: pathnode.c:51
bool consider_parallel
Definition: pathnodes.h:673
PathKeysComparison
Definition: paths.h:181
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:99
#define foreach_current_index(cell)
Definition: pg_list.h:381

◆ add_partial_path_precheck()

bool add_partial_path_precheck ( RelOptInfo parent_rel,
Cost  total_cost,
List pathkeys 
)

Definition at line 867 of file pathnode.c.

References add_path_precheck(), compare_pathkeys(), lfirst, 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().

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

◆ add_path()

void add_path ( RelOptInfo parent_rel,
Path new_path 
)

Definition at line 422 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, foreach_current_index, foreach_delete_current, IsA, lfirst, list_insert_nth(), NIL, 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_final_paths(), add_foreign_grouping_paths(), add_foreign_ordered_paths(), add_paths_to_append_rel(), add_paths_to_grouping_rel(), add_paths_with_pathkeys_for_rel(), BuildParameterizedTidPaths(), consider_groupingsets_paths(), create_degenerate_grouping_paths(), create_distinct_paths(), create_index_paths(), create_one_window_path(), create_ordered_paths(), create_partial_grouping_paths(), create_tidscan_paths(), fileGetForeignPaths(), gather_grouping_paths(), generate_gather_paths(), generate_nonunion_paths(), generate_orderedappend_paths(), generate_recursion_path(), generate_union_paths(), generate_useful_gather_paths(), get_index_paths(), grouping_planner(), inheritance_planner(), mark_dummy_rel(), postgresGetForeignJoinPaths(), postgresGetForeignPaths(), preprocess_minmax_aggregates(), query_planner(), recurse_set_operations(), set_cte_pathlist(), set_dummy_rel_pathlist(), set_function_pathlist(), set_namedtuplestore_pathlist(), set_plain_rel_pathlist(), set_result_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().

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

◆ add_path_precheck()

bool add_path_precheck ( RelOptInfo parent_rel,
Cost  startup_cost,
Cost  total_cost,
List pathkeys,
Relids  required_outer 
)

Definition at line 644 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().

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

◆ adjust_limit_rows_costs()

void adjust_limit_rows_costs ( double *  rows,
Cost startup_cost,
Cost total_cost,
int64  offset_est,
int64  count_est 
)

Definition at line 3657 of file pathnode.c.

References clamp_row_est().

Referenced by create_limit_path(), and estimate_path_cost_size().

3662 {
3663  double input_rows = *rows;
3664  Cost input_startup_cost = *startup_cost;
3665  Cost input_total_cost = *total_cost;
3666 
3667  if (offset_est != 0)
3668  {
3669  double offset_rows;
3670 
3671  if (offset_est > 0)
3672  offset_rows = (double) offset_est;
3673  else
3674  offset_rows = clamp_row_est(input_rows * 0.10);
3675  if (offset_rows > *rows)
3676  offset_rows = *rows;
3677  if (input_rows > 0)
3678  *startup_cost +=
3679  (input_total_cost - input_startup_cost)
3680  * offset_rows / input_rows;
3681  *rows -= offset_rows;
3682  if (*rows < 1)
3683  *rows = 1;
3684  }
3685 
3686  if (count_est != 0)
3687  {
3688  double count_rows;
3689 
3690  if (count_est > 0)
3691  count_rows = (double) count_est;
3692  else
3693  count_rows = clamp_row_est(input_rows * 0.10);
3694  if (count_rows > *rows)
3695  count_rows = *rows;
3696  if (input_rows > 0)
3697  *total_cost = *startup_cost +
3698  (input_total_cost - input_startup_cost)
3699  * count_rows / input_rows;
3700  *rows = count_rows;
3701  if (*rows < 1)
3702  *rows = 1;
3703  }
3704 }
double clamp_row_est(double nrows)
Definition: costsize.c:190
double Cost
Definition: nodes.h:663

◆ apply_projection_to_path()

Path* apply_projection_to_path ( PlannerInfo root,
RelOptInfo rel,
Path path,
PathTarget target 
)

Definition at line 2611 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, GatherMergePath::subpath, and Path::total_cost.

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

2615 {
2616  QualCost oldcost;
2617 
2618  /*
2619  * If given path can't project, we might need a Result node, so make a
2620  * separate ProjectionPath.
2621  */
2622  if (!is_projection_capable_path(path))
2623  return (Path *) create_projection_path(root, rel, path, target);
2624 
2625  /*
2626  * We can just jam the desired tlist into the existing path, being sure to
2627  * update its cost estimates appropriately.
2628  */
2629  oldcost = path->pathtarget->cost;
2630  path->pathtarget = target;
2631 
2632  path->startup_cost += target->cost.startup - oldcost.startup;
2633  path->total_cost += target->cost.startup - oldcost.startup +
2634  (target->cost.per_tuple - oldcost.per_tuple) * path->rows;
2635 
2636  /*
2637  * If the path happens to be a Gather or GatherMerge path, we'd like to
2638  * arrange for the subpath to return the required target list so that
2639  * workers can help project. But if there is something that is not
2640  * parallel-safe in the target expressions, then we can't.
2641  */
2642  if ((IsA(path, GatherPath) || IsA(path, GatherMergePath)) &&
2643  is_parallel_safe(root, (Node *) target->exprs))
2644  {
2645  /*
2646  * We always use create_projection_path here, even if the subpath is
2647  * projection-capable, so as to avoid modifying the subpath in place.
2648  * It seems unlikely at present that there could be any other
2649  * references to the subpath, but better safe than sorry.
2650  *
2651  * Note that we don't change the parallel path's cost estimates; it
2652  * might be appropriate to do so, to reflect the fact that the bulk of
2653  * the target evaluation will happen in workers.
2654  */
2655  if (IsA(path, GatherPath))
2656  {
2657  GatherPath *gpath = (GatherPath *) path;
2658 
2659  gpath->subpath = (Path *)
2661  gpath->subpath->parent,
2662  gpath->subpath,
2663  target);
2664  }
2665  else
2666  {
2667  GatherMergePath *gmpath = (GatherMergePath *) path;
2668 
2669  gmpath->subpath = (Path *)
2671  gmpath->subpath->parent,
2672  gmpath->subpath,
2673  target);
2674  }
2675  }
2676  else if (path->parallel_safe &&
2677  !is_parallel_safe(root, (Node *) target->exprs))
2678  {
2679  /*
2680  * We're inserting a parallel-restricted target list into a path
2681  * currently marked parallel-safe, so we have to mark it as no longer
2682  * safe.
2683  */
2684  path->parallel_safe = false;
2685  }
2686 
2687  return path;
2688 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
PathTarget * pathtarget
Definition: pathnodes.h:1145
Definition: nodes.h:529
ProjectionPath * create_projection_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target)
Definition: pathnode.c:2520
Cost startup
Definition: pathnodes.h:45
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:856
Cost per_tuple
Definition: pathnodes.h:46
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
Path * subpath
Definition: pathnodes.h:1495
List * exprs
Definition: pathnodes.h:1074
Cost total_cost
Definition: pathnodes.h:1156
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
QualCost cost
Definition: pathnodes.h:1076
bool is_projection_capable_path(Path *path)
Definition: createplan.c:6943

◆ build_child_join_rel()

RelOptInfo* build_child_join_rel ( PlannerInfo root,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
RelOptInfo parent_joinrel,
List restrictlist,
SpecialJoinInfo sjinfo,
JoinType  jointype 
)

Definition at line 785 of file relnode.c.

References add_child_join_rel_equivalences(), add_join_rel(), adjust_appendrel_attrs(), RelOptInfo::all_partrels, RelOptInfo::allvisfrac, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_copy(), bms_union(), RelOptInfo::boundinfo, build_child_join_reltarget(), build_joinrel_partition_info(), 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_partitionwise_join, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, RelOptInfo::eclass_indexes, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, find_appinfos_by_relids(), find_join_rel(), RelOptInfo::has_eclass_joins, has_useful_pathkeys(), RelOptInfo::indexlist, InvalidOid, IS_OTHER_REL, RelOptInfo::joininfo, RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, NIL, RelOptInfo::nparts, RelOptInfo::nullable_partexprs, RelOptInfo::pages, RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partbounds_merged, RelOptInfo::partexprs, RelOptInfo::partial_pathlist, RelOptInfo::partition_qual, RelOptInfo::partitioned_child_rels, RelOptInfo::pathlist, QualCost::per_tuple, pfree(), RelOptInfo::ppilist, RelOptInfo::relid, RelOptInfo::relids, RELOPT_OTHER_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, RelOptInfo::top_parent_relids, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by try_partitionwise_join().

789 {
790  RelOptInfo *joinrel = makeNode(RelOptInfo);
791  AppendRelInfo **appinfos;
792  int nappinfos;
793 
794  /* Only joins between "other" relations land here. */
795  Assert(IS_OTHER_REL(outer_rel) && IS_OTHER_REL(inner_rel));
796 
797  /* The parent joinrel should have consider_partitionwise_join set. */
798  Assert(parent_joinrel->consider_partitionwise_join);
799 
800  joinrel->reloptkind = RELOPT_OTHER_JOINREL;
801  joinrel->relids = bms_union(outer_rel->relids, inner_rel->relids);
802  joinrel->rows = 0;
803  /* cheap startup cost is interesting iff not all tuples to be retrieved */
804  joinrel->consider_startup = (root->tuple_fraction > 0);
805  joinrel->consider_param_startup = false;
806  joinrel->consider_parallel = false;
807  joinrel->reltarget = create_empty_pathtarget();
808  joinrel->pathlist = NIL;
809  joinrel->ppilist = NIL;
810  joinrel->partial_pathlist = NIL;
811  joinrel->cheapest_startup_path = NULL;
812  joinrel->cheapest_total_path = NULL;
813  joinrel->cheapest_unique_path = NULL;
815  joinrel->direct_lateral_relids = NULL;
816  joinrel->lateral_relids = NULL;
817  joinrel->relid = 0; /* indicates not a baserel */
818  joinrel->rtekind = RTE_JOIN;
819  joinrel->min_attr = 0;
820  joinrel->max_attr = 0;
821  joinrel->attr_needed = NULL;
822  joinrel->attr_widths = NULL;
823  joinrel->lateral_vars = NIL;
824  joinrel->lateral_referencers = NULL;
825  joinrel->indexlist = NIL;
826  joinrel->pages = 0;
827  joinrel->tuples = 0;
828  joinrel->allvisfrac = 0;
829  joinrel->eclass_indexes = NULL;
830  joinrel->subroot = NULL;
831  joinrel->subplan_params = NIL;
832  joinrel->serverid = InvalidOid;
833  joinrel->userid = InvalidOid;
834  joinrel->useridiscurrent = false;
835  joinrel->fdwroutine = NULL;
836  joinrel->fdw_private = NULL;
837  joinrel->baserestrictinfo = NIL;
838  joinrel->baserestrictcost.startup = 0;
839  joinrel->baserestrictcost.per_tuple = 0;
840  joinrel->joininfo = NIL;
841  joinrel->has_eclass_joins = false;
842  joinrel->consider_partitionwise_join = false; /* might get changed later */
843  joinrel->top_parent_relids = NULL;
844  joinrel->part_scheme = NULL;
845  joinrel->nparts = -1;
846  joinrel->boundinfo = NULL;
847  joinrel->partbounds_merged = false;
848  joinrel->partition_qual = NIL;
849  joinrel->part_rels = NULL;
850  joinrel->all_partrels = NULL;
851  joinrel->partexprs = NULL;
852  joinrel->nullable_partexprs = NULL;
853  joinrel->partitioned_child_rels = NIL;
854 
855  joinrel->top_parent_relids = bms_union(outer_rel->top_parent_relids,
856  inner_rel->top_parent_relids);
857 
858  /* Compute information relevant to foreign relations. */
859  set_foreign_rel_properties(joinrel, outer_rel, inner_rel);
860 
861  /* Compute information needed for mapping Vars to the child rel */
862  appinfos = find_appinfos_by_relids(root, joinrel->relids, &nappinfos);
863 
864  /* Set up reltarget struct */
865  build_child_join_reltarget(root, parent_joinrel, joinrel,
866  nappinfos, appinfos);
867 
868  /* Construct joininfo list. */
869  joinrel->joininfo = (List *) adjust_appendrel_attrs(root,
870  (Node *) parent_joinrel->joininfo,
871  nappinfos,
872  appinfos);
873 
874  /*
875  * Lateral relids referred in child join will be same as that referred in
876  * the parent relation.
877  */
878  joinrel->direct_lateral_relids = (Relids) bms_copy(parent_joinrel->direct_lateral_relids);
879  joinrel->lateral_relids = (Relids) bms_copy(parent_joinrel->lateral_relids);
880 
881  /*
882  * If the parent joinrel has pending equivalence classes, so does the
883  * child.
884  */
885  joinrel->has_eclass_joins = parent_joinrel->has_eclass_joins;
886 
887  /* Is the join between partitions itself partitioned? */
888  build_joinrel_partition_info(joinrel, outer_rel, inner_rel, restrictlist,
889  jointype);
890 
891  /* Child joinrel is parallel safe if parent is parallel safe. */
892  joinrel->consider_parallel = parent_joinrel->consider_parallel;
893 
894  /* Set estimates of the child-joinrel's size. */
895  set_joinrel_size_estimates(root, joinrel, outer_rel, inner_rel,
896  sjinfo, restrictlist);
897 
898  /* We build the join only once. */
899  Assert(!find_join_rel(root, joinrel->relids));
900 
901  /* Add the relation to the PlannerInfo. */
902  add_join_rel(root, joinrel);
903 
904  /*
905  * We might need EquivalenceClass members corresponding to the child join,
906  * so that we can represent sort pathkeys for it. As with children of
907  * baserels, we shouldn't need this unless there are relevant eclass joins
908  * (implying that a merge join might be possible) or pathkeys to sort by.
909  */
910  if (joinrel->has_eclass_joins || has_useful_pathkeys(root, parent_joinrel))
912  nappinfos, appinfos,
913  parent_joinrel, joinrel);
914 
915  pfree(appinfos);
916 
917  return joinrel;
918 }
bool has_eclass_joins
Definition: pathnodes.h:733
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:439
#define IS_OTHER_REL(rel)
Definition: pathnodes.h:653
void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List *restrictlist)
Definition: costsize.c:4706
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
Oid userid
Definition: pathnodes.h:715
double tuples
Definition: pathnodes.h:705
List * baserestrictinfo
Definition: pathnodes.h:727
bool consider_param_startup
Definition: pathnodes.h:672
Definition: nodes.h:529
List * partial_pathlist
Definition: pathnodes.h:681
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
Relids all_partrels
Definition: pathnodes.h:752
bool useridiscurrent
Definition: pathnodes.h:716
List ** nullable_partexprs
Definition: pathnodes.h:754
Cost startup
Definition: pathnodes.h:45
double allvisfrac
Definition: pathnodes.h:706
void add_child_join_rel_equivalences(PlannerInfo *root, int nappinfos, AppendRelInfo **appinfos, RelOptInfo *parent_joinrel, RelOptInfo *child_joinrel)
Definition: equivclass.c:2384
PlannerInfo * subroot
Definition: pathnodes.h:709
bool consider_startup
Definition: pathnodes.h:671
Relids lateral_relids
Definition: pathnodes.h:690
Cost per_tuple
Definition: pathnodes.h:46
static void set_foreign_rel_properties(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:502
double tuple_fraction
Definition: pathnodes.h:336
void pfree(void *pointer)
Definition: mcxt.c:1056
List ** partexprs
Definition: pathnodes.h:753
struct Path * cheapest_total_path
Definition: pathnodes.h:683
List * joininfo
Definition: pathnodes.h:731
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
int nparts
Definition: pathnodes.h:743
Relids relids
Definition: pathnodes.h:665
bool partbounds_merged
Definition: pathnodes.h:747
List * ppilist
Definition: pathnodes.h:680
Index relid
Definition: pathnodes.h:693
AppendRelInfo ** find_appinfos_by_relids(PlannerInfo *root, Relids relids, int *nappinfos)
Definition: appendinfo.c:728
Relids lateral_referencers
Definition: pathnodes.h:701
Oid serverid
Definition: pathnodes.h:714
Relids direct_lateral_relids
Definition: pathnodes.h:689
bool consider_partitionwise_join
Definition: pathnodes.h:736
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
RTEKind rtekind
Definition: pathnodes.h:695
List * indexlist
Definition: pathnodes.h:702
double rows
Definition: pathnodes.h:668
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: pathnodes.h:719
#define makeNode(_type_)
Definition: nodes.h:577
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:738
List * lateral_vars
Definition: pathnodes.h:700
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
bool consider_parallel
Definition: pathnodes.h:673
Bitmapset * Relids
Definition: pathnodes.h:28
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
static void build_joinrel_partition_info(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, List *restrictlist, JoinType jointype)
Definition: relnode.c:1630
bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel)
Definition: pathkeys.c:1910
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
List * partition_qual
Definition: pathnodes.h:749
int32 * attr_widths
Definition: pathnodes.h:699
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
QualCost baserestrictcost
Definition: pathnodes.h:728
static void add_join_rel(PlannerInfo *root, RelOptInfo *joinrel)
Definition: relnode.c:540
List * subplan_params
Definition: pathnodes.h:710
static void build_child_join_reltarget(PlannerInfo *root, RelOptInfo *parentrel, RelOptInfo *childrel, int nappinfos, AppendRelInfo **appinfos)
Definition: relnode.c:2013
Bitmapset * eclass_indexes
Definition: pathnodes.h:707
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:194
Relids top_parent_relids
Definition: pathnodes.h:738
AttrNumber min_attr
Definition: pathnodes.h:696

◆ build_join_rel()

RelOptInfo* build_join_rel ( PlannerInfo root,
Relids  joinrelids,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
SpecialJoinInfo sjinfo,
List **  restrictlist_ptr 
)

Definition at line 577 of file relnode.c.

References add_join_rel(), add_placeholders_to_joinrel(), RelOptInfo::all_partrels, 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(), RelOptInfo::boundinfo, build_joinrel_joinlist(), build_joinrel_partition_info(), 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_partitionwise_join, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, RelOptInfo::eclass_indexes, PathTarget::exprs, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, find_join_rel(), RelOptInfo::has_eclass_joins, has_relevant_eclass_joinclause(), RelOptInfo::indexlist, InvalidOid, IS_OTHER_REL, is_parallel_safe(), PlannerInfo::join_cur_level, PlannerInfo::join_rel_level, RelOptInfo::joininfo, SpecialJoinInfo::jointype, lappend(), RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, min_join_parameterization(), NIL, RelOptInfo::non_unique_for_rels, RelOptInfo::nparts, RelOptInfo::nullable_partexprs, RelOptInfo::pages, RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partbounds_merged, RelOptInfo::partexprs, RelOptInfo::partial_pathlist, RelOptInfo::partition_qual, RelOptInfo::partitioned_child_rels, 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::statlist, RelOptInfo::subplan_params, RelOptInfo::subroot, RelOptInfo::top_parent_relids, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::unique_for_rels, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by make_join_rel().

583 {
584  RelOptInfo *joinrel;
585  List *restrictlist;
586 
587  /* This function should be used only for join between parents. */
588  Assert(!IS_OTHER_REL(outer_rel) && !IS_OTHER_REL(inner_rel));
589 
590  /*
591  * See if we already have a joinrel for this set of base rels.
592  */
593  joinrel = find_join_rel(root, joinrelids);
594 
595  if (joinrel)
596  {
597  /*
598  * Yes, so we only need to figure the restrictlist for this particular
599  * pair of component relations.
600  */
601  if (restrictlist_ptr)
602  *restrictlist_ptr = build_joinrel_restrictlist(root,
603  joinrel,
604  outer_rel,
605  inner_rel);
606  return joinrel;
607  }
608 
609  /*
610  * Nope, so make one.
611  */
612  joinrel = makeNode(RelOptInfo);
613  joinrel->reloptkind = RELOPT_JOINREL;
614  joinrel->relids = bms_copy(joinrelids);
615  joinrel->rows = 0;
616  /* cheap startup cost is interesting iff not all tuples to be retrieved */
617  joinrel->consider_startup = (root->tuple_fraction > 0);
618  joinrel->consider_param_startup = false;
619  joinrel->consider_parallel = false;
620  joinrel->reltarget = create_empty_pathtarget();
621  joinrel->pathlist = NIL;
622  joinrel->ppilist = NIL;
623  joinrel->partial_pathlist = NIL;
624  joinrel->cheapest_startup_path = NULL;
625  joinrel->cheapest_total_path = NULL;
626  joinrel->cheapest_unique_path = NULL;
628  /* init direct_lateral_relids from children; we'll finish it up below */
629  joinrel->direct_lateral_relids =
630  bms_union(outer_rel->direct_lateral_relids,
631  inner_rel->direct_lateral_relids);
632  joinrel->lateral_relids = min_join_parameterization(root, joinrel->relids,
633  outer_rel, inner_rel);
634  joinrel->relid = 0; /* indicates not a baserel */
635  joinrel->rtekind = RTE_JOIN;
636  joinrel->min_attr = 0;
637  joinrel->max_attr = 0;
638  joinrel->attr_needed = NULL;
639  joinrel->attr_widths = NULL;
640  joinrel->lateral_vars = NIL;
641  joinrel->lateral_referencers = NULL;
642  joinrel->indexlist = NIL;
643  joinrel->statlist = NIL;
644  joinrel->pages = 0;
645  joinrel->tuples = 0;
646  joinrel->allvisfrac = 0;
647  joinrel->eclass_indexes = NULL;
648  joinrel->subroot = NULL;
649  joinrel->subplan_params = NIL;
650  joinrel->rel_parallel_workers = -1;
651  joinrel->serverid = InvalidOid;
652  joinrel->userid = InvalidOid;
653  joinrel->useridiscurrent = false;
654  joinrel->fdwroutine = NULL;
655  joinrel->fdw_private = NULL;
656  joinrel->unique_for_rels = NIL;
657  joinrel->non_unique_for_rels = NIL;
658  joinrel->baserestrictinfo = NIL;
659  joinrel->baserestrictcost.startup = 0;
660  joinrel->baserestrictcost.per_tuple = 0;
661  joinrel->baserestrict_min_security = UINT_MAX;
662  joinrel->joininfo = NIL;
663  joinrel->has_eclass_joins = false;
664  joinrel->consider_partitionwise_join = false; /* might get changed later */
665  joinrel->top_parent_relids = NULL;
666  joinrel->part_scheme = NULL;
667  joinrel->nparts = -1;
668  joinrel->boundinfo = NULL;
669  joinrel->partbounds_merged = false;
670  joinrel->partition_qual = NIL;
671  joinrel->part_rels = NULL;
672  joinrel->all_partrels = NULL;
673  joinrel->partexprs = NULL;
674  joinrel->nullable_partexprs = NULL;
675  joinrel->partitioned_child_rels = NIL;
676 
677  /* Compute information relevant to the foreign relations. */
678  set_foreign_rel_properties(joinrel, outer_rel, inner_rel);
679 
680  /*
681  * Create a new tlist containing just the vars that need to be output from
682  * this join (ie, are needed for higher joinclauses or final output).
683  *
684  * NOTE: the tlist order for a join rel will depend on which pair of outer
685  * and inner rels we first try to build it from. But the contents should
686  * be the same regardless.
687  */
688  build_joinrel_tlist(root, joinrel, outer_rel);
689  build_joinrel_tlist(root, joinrel, inner_rel);
690  add_placeholders_to_joinrel(root, joinrel, outer_rel, inner_rel);
691 
692  /*
693  * add_placeholders_to_joinrel also took care of adding the ph_lateral
694  * sets of any PlaceHolderVars computed here to direct_lateral_relids, so
695  * now we can finish computing that. This is much like the computation of
696  * the transitively-closed lateral_relids in min_join_parameterization,
697  * except that here we *do* have to consider the added PHVs.
698  */
699  joinrel->direct_lateral_relids =
700  bms_del_members(joinrel->direct_lateral_relids, joinrel->relids);
701  if (bms_is_empty(joinrel->direct_lateral_relids))
702  joinrel->direct_lateral_relids = NULL;
703 
704  /*
705  * Construct restrict and join clause lists for the new joinrel. (The
706  * caller might or might not need the restrictlist, but I need it anyway
707  * for set_joinrel_size_estimates().)
708  */
709  restrictlist = build_joinrel_restrictlist(root, joinrel,
710  outer_rel, inner_rel);
711  if (restrictlist_ptr)
712  *restrictlist_ptr = restrictlist;
713  build_joinrel_joinlist(joinrel, outer_rel, inner_rel);
714 
715  /*
716  * This is also the right place to check whether the joinrel has any
717  * pending EquivalenceClass joins.
718  */
719  joinrel->has_eclass_joins = has_relevant_eclass_joinclause(root, joinrel);
720 
721  /* Store the partition information. */
722  build_joinrel_partition_info(joinrel, outer_rel, inner_rel, restrictlist,
723  sjinfo->jointype);
724 
725  /*
726  * Set estimates of the joinrel's size.
727  */
728  set_joinrel_size_estimates(root, joinrel, outer_rel, inner_rel,
729  sjinfo, restrictlist);
730 
731  /*
732  * Set the consider_parallel flag if this joinrel could potentially be
733  * scanned within a parallel worker. If this flag is false for either
734  * inner_rel or outer_rel, then it must be false for the joinrel also.
735  * Even if both are true, there might be parallel-restricted expressions
736  * in the targetlist or quals.
737  *
738  * Note that if there are more than two rels in this relation, they could
739  * be divided between inner_rel and outer_rel in any arbitrary way. We
740  * assume this doesn't matter, because we should hit all the same baserels
741  * and joinclauses while building up to this joinrel no matter which we
742  * take; therefore, we should make the same decision here however we get
743  * here.
744  */
745  if (inner_rel->consider_parallel && outer_rel->consider_parallel &&
746  is_parallel_safe(root, (Node *) restrictlist) &&
747  is_parallel_safe(root, (Node *) joinrel->reltarget->exprs))
748  joinrel->consider_parallel = true;
749 
750  /* Add the joinrel to the PlannerInfo. */
751  add_join_rel(root, joinrel);
752 
753  /*
754  * Also, if dynamic-programming join search is active, add the new joinrel
755  * to the appropriate sublist. Note: you might think the Assert on number
756  * of members should be for equality, but some of the level 1 rels might
757  * have been joinrels already, so we can only assert <=.
758  */
759  if (root->join_rel_level)
760  {
761  Assert(root->join_cur_level > 0);
762  Assert(root->join_cur_level <= bms_num_members(joinrel->relids));
763  root->join_rel_level[root->join_cur_level] =
764  lappend(root->join_rel_level[root->join_cur_level], joinrel);
765  }
766 
767  return joinrel;
768 }
bool has_eclass_joins
Definition: pathnodes.h:733
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
int join_cur_level
Definition: pathnodes.h:257
List * unique_for_rels
Definition: pathnodes.h:722
List * statlist
Definition: pathnodes.h:703
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:439
#define IS_OTHER_REL(rel)
Definition: pathnodes.h:653
void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List *restrictlist)
Definition: costsize.c:4706
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
Oid userid
Definition: pathnodes.h:715
double tuples
Definition: pathnodes.h:705
List * baserestrictinfo
Definition: pathnodes.h:727
bool consider_param_startup
Definition: pathnodes.h:672
Definition: nodes.h:529
List * partial_pathlist
Definition: pathnodes.h:681
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
Index baserestrict_min_security
Definition: pathnodes.h:729
Relids all_partrels
Definition: pathnodes.h:752
bool useridiscurrent
Definition: pathnodes.h:716
List ** nullable_partexprs
Definition: pathnodes.h:754
void add_placeholders_to_joinrel(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: placeholder.c:411
Cost startup
Definition: pathnodes.h:45
double allvisfrac
Definition: pathnodes.h:706
PlannerInfo * subroot
Definition: pathnodes.h:709
bool consider_startup
Definition: pathnodes.h:671
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:856
Relids lateral_relids
Definition: pathnodes.h:690
Cost per_tuple
Definition: pathnodes.h:46
static void set_foreign_rel_properties(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:502
double tuple_fraction
Definition: pathnodes.h:336
List ** partexprs
Definition: pathnodes.h:753
static void build_joinrel_tlist(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *input_rel)
Definition: relnode.c:972
Relids min_join_parameterization(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:929
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:646
struct Path * cheapest_total_path
Definition: pathnodes.h:683
static List * build_joinrel_restrictlist(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:1058
List * joininfo
Definition: pathnodes.h:731
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
int nparts
Definition: pathnodes.h:743
Relids relids
Definition: pathnodes.h:665
bool partbounds_merged
Definition: pathnodes.h:747
bool has_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1)
Definition: equivclass.c:2722
List * non_unique_for_rels
Definition: pathnodes.h:724
List * ppilist
Definition: pathnodes.h:680
Index relid
Definition: pathnodes.h:693
List * lappend(List *list, void *datum)
Definition: list.c:321
Relids lateral_referencers
Definition: pathnodes.h:701
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
Oid serverid
Definition: pathnodes.h:714
List * exprs
Definition: pathnodes.h:1074
Relids direct_lateral_relids
Definition: pathnodes.h:689
bool consider_partitionwise_join
Definition: pathnodes.h:736
int rel_parallel_workers
Definition: pathnodes.h:711
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
RTEKind rtekind
Definition: pathnodes.h:695
List * indexlist
Definition: pathnodes.h:702
double rows
Definition: pathnodes.h:668
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: pathnodes.h:719
#define makeNode(_type_)
Definition: nodes.h:577
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:738
List ** join_rel_level
Definition: pathnodes.h:256
List * lateral_vars
Definition: pathnodes.h:700
JoinType jointype
Definition: pathnodes.h:2179
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
bool consider_parallel
Definition: pathnodes.h:673
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:928
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
static void build_joinrel_partition_info(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, List *restrictlist, JoinType jointype)
Definition: relnode.c:1630
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
List * partition_qual
Definition: pathnodes.h:749
int32 * attr_widths
Definition: pathnodes.h:699
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
QualCost baserestrictcost
Definition: pathnodes.h:728
static void add_join_rel(PlannerInfo *root, RelOptInfo *joinrel)
Definition: relnode.c:540
List * subplan_params
Definition: pathnodes.h:710
Bitmapset * eclass_indexes
Definition: pathnodes.h:707
static void build_joinrel_joinlist(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:1088
Relids top_parent_relids
Definition: pathnodes.h:738
AttrNumber min_attr
Definition: pathnodes.h:696

◆ build_simple_rel()

RelOptInfo* build_simple_rel ( PlannerInfo root,
int  relid,
RelOptInfo parent 
)

Definition at line 194 of file relnode.c.

References RelOptInfo::all_partrels, RelOptInfo::allvisfrac, PlannerInfo::append_rel_array, apply_child_basequals(), Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_copy(), bms_make_singleton(), RelOptInfo::boundinfo, RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RangeTblEntry::checkAsUser, Alias::colnames, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_partitionwise_join, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, RelOptInfo::eclass_indexes, 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, list_length(), makeNode, mark_dummy_rel(), RelOptInfo::max_attr, RelOptInfo::min_attr, NIL, RelOptInfo::non_unique_for_rels, RelOptInfo::nparts, RelOptInfo::nullable_partexprs, RelOptInfo::pages, palloc0(), RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partbounds_merged, RelOptInfo::partexprs, RelOptInfo::partial_pathlist, RelOptInfo::partition_qual, RelOptInfo::partitioned_child_rels, RelOptInfo::pathlist, QualCost::per_tuple, RelOptInfo::ppilist, RelOptInfo::rel_parallel_workers, RelOptInfo::relid, RangeTblEntry::relid, RelOptInfo::relids, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_CTE, RTE_FUNCTION, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_RESULT, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RelOptInfo::rtekind, RangeTblEntry::rtekind, RelOptInfo::serverid, PlannerInfo::simple_rel_array, PlannerInfo::simple_rte_array, QualCost::startup, RelOptInfo::statlist, RelOptInfo::subplan_params, RelOptInfo::subroot, RelOptInfo::top_parent_relids, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::unique_for_rels, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by add_base_rels_to_query(), expand_appendrel_subquery(), expand_inherited_rtentry(), expand_partitioned_rtentry(), plan_cluster_use_sort(), plan_create_index_workers(), query_planner(), and recurse_set_operations().

195 {
196  RelOptInfo *rel;
197  RangeTblEntry *rte;
198 
199  /* Rel should not exist already */
200  Assert(relid > 0 && relid < root->simple_rel_array_size);
201  if (root->simple_rel_array[relid] != NULL)
202  elog(ERROR, "rel %d already exists", relid);
203 
204  /* Fetch RTE for relation */
205  rte = root->simple_rte_array[relid];
206  Assert(rte != NULL);
207 
208  rel = makeNode(RelOptInfo);
210  rel->relids = bms_make_singleton(relid);
211  rel->rows = 0;
212  /* cheap startup cost is interesting iff not all tuples to be retrieved */
213  rel->consider_startup = (root->tuple_fraction > 0);
214  rel->consider_param_startup = false; /* might get changed later */
215  rel->consider_parallel = false; /* might get changed later */
217  rel->pathlist = NIL;
218  rel->ppilist = NIL;
219  rel->partial_pathlist = NIL;
220  rel->cheapest_startup_path = NULL;
221  rel->cheapest_total_path = NULL;
222  rel->cheapest_unique_path = NULL;
224  rel->relid = relid;
225  rel->rtekind = rte->rtekind;
226  /* min_attr, max_attr, attr_needed, attr_widths are set below */
227  rel->lateral_vars = NIL;
228  rel->indexlist = NIL;
229  rel->statlist = NIL;
230  rel->pages = 0;
231  rel->tuples = 0;
232  rel->allvisfrac = 0;
233  rel->eclass_indexes = NULL;
234  rel->subroot = NULL;
235  rel->subplan_params = NIL;
236  rel->rel_parallel_workers = -1; /* set up in get_relation_info */
237  rel->serverid = InvalidOid;
238  rel->userid = rte->checkAsUser;
239  rel->useridiscurrent = false;
240  rel->fdwroutine = NULL;
241  rel->fdw_private = NULL;
242  rel->unique_for_rels = NIL;
243  rel->non_unique_for_rels = NIL;
244  rel->baserestrictinfo = NIL;
245  rel->baserestrictcost.startup = 0;
246  rel->baserestrictcost.per_tuple = 0;
247  rel->baserestrict_min_security = UINT_MAX;
248  rel->joininfo = NIL;
249  rel->has_eclass_joins = false;
250  rel->consider_partitionwise_join = false; /* might get changed later */
251  rel->part_scheme = NULL;
252  rel->nparts = -1;
253  rel->boundinfo = NULL;
254  rel->partbounds_merged = false;
255  rel->partition_qual = NIL;
256  rel->part_rels = NULL;
257  rel->all_partrels = NULL;
258  rel->partexprs = NULL;
259  rel->nullable_partexprs = NULL;
261 
262  /*
263  * Pass assorted information down the inheritance hierarchy.
264  */
265  if (parent)
266  {
267  /*
268  * Each direct or indirect child wants to know the relids of its
269  * topmost parent.
270  */
271  if (parent->top_parent_relids)
272  rel->top_parent_relids = parent->top_parent_relids;
273  else
274  rel->top_parent_relids = bms_copy(parent->relids);
275 
276  /*
277  * Also propagate lateral-reference information from appendrel parent
278  * rels to their child rels. We intentionally give each child rel the
279  * same minimum parameterization, even though it's quite possible that
280  * some don't reference all the lateral rels. This is because any
281  * append path for the parent will have to have the same
282  * parameterization for every child anyway, and there's no value in
283  * forcing extra reparameterize_path() calls. Similarly, a lateral
284  * reference to the parent prevents use of otherwise-movable join rels
285  * for each child.
286  *
287  * It's possible for child rels to have their own children, in which
288  * case the topmost parent's lateral info propagates all the way down.
289  */
291  rel->lateral_relids = parent->lateral_relids;
293  }
294  else
295  {
296  rel->top_parent_relids = NULL;
297  rel->direct_lateral_relids = NULL;
298  rel->lateral_relids = NULL;
299  rel->lateral_referencers = NULL;
300  }
301 
302  /* Check type of rtable entry */
303  switch (rte->rtekind)
304  {
305  case RTE_RELATION:
306  /* Table --- retrieve statistics from the system catalogs */
307  get_relation_info(root, rte->relid, rte->inh, rel);
308  break;
309  case RTE_SUBQUERY:
310  case RTE_FUNCTION:
311  case RTE_TABLEFUNC:
312  case RTE_VALUES:
313  case RTE_CTE:
314  case RTE_NAMEDTUPLESTORE:
315 
316  /*
317  * Subquery, function, tablefunc, values list, CTE, or ENR --- set
318  * up attr range and arrays
319  *
320  * Note: 0 is included in range to support whole-row Vars
321  */
322  rel->min_attr = 0;
323  rel->max_attr = list_length(rte->eref->colnames);
324  rel->attr_needed = (Relids *)
325  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
326  rel->attr_widths = (int32 *)
327  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
328  break;
329  case RTE_RESULT:
330  /* RTE_RESULT has no columns, nor could it have whole-row Var */
331  rel->min_attr = 0;
332  rel->max_attr = -1;
333  rel->attr_needed = NULL;
334  rel->attr_widths = NULL;
335  break;
336  default:
337  elog(ERROR, "unrecognized RTE kind: %d",
338  (int) rte->rtekind);
339  break;
340  }
341 
342  /*
343  * Copy the parent's quals to the child, with appropriate substitution of
344  * variables. If any constant false or NULL clauses turn up, we can mark
345  * the child as dummy right away. (We must do this immediately so that
346  * pruning works correctly when recursing in expand_partitioned_rtentry.)
347  */
348  if (parent)
349  {
350  AppendRelInfo *appinfo = root->append_rel_array[relid];
351 
352  Assert(appinfo != NULL);
353  if (!apply_child_basequals(root, parent, rel, rte, appinfo))
354  {
355  /*
356  * Some restriction clause reduced to constant FALSE or NULL after
357  * substitution, so this child need not be scanned.
358  */
359  mark_dummy_rel(rel);
360  }
361  }
362 
363  /* Save the finished struct in the query's simple_rel_array */
364  root->simple_rel_array[relid] = rel;
365 
366  return rel;
367 }
bool has_eclass_joins
Definition: pathnodes.h:733
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
List * unique_for_rels
Definition: pathnodes.h:722
List * statlist
Definition: pathnodes.h:703
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
List * colnames
Definition: primnodes.h:43
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
Oid userid
Definition: pathnodes.h:715
double tuples
Definition: pathnodes.h:705
List * baserestrictinfo
Definition: pathnodes.h:727
bool consider_param_startup
Definition: pathnodes.h:672
List * partial_pathlist
Definition: pathnodes.h:681
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
Index baserestrict_min_security
Definition: pathnodes.h:729
Relids all_partrels
Definition: pathnodes.h:752
bool useridiscurrent
Definition: pathnodes.h:716
List ** nullable_partexprs
Definition: pathnodes.h:754
Cost startup
Definition: pathnodes.h:45
double allvisfrac
Definition: pathnodes.h:706
signed int int32
Definition: c.h:355
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
PlannerInfo * subroot
Definition: pathnodes.h:709
bool consider_startup
Definition: pathnodes.h:671
bool apply_child_basequals(PlannerInfo *root, RelOptInfo *parentrel, RelOptInfo *childrel, RangeTblEntry *childRTE, AppendRelInfo *appinfo)
Definition: inherit.c:693
Relids lateral_relids
Definition: pathnodes.h:690
Cost per_tuple
Definition: pathnodes.h:46
double tuple_fraction
Definition: pathnodes.h:336
List ** partexprs
Definition: pathnodes.h:753
#define ERROR
Definition: elog.h:43
struct Path * cheapest_total_path
Definition: pathnodes.h:683
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:186
List * joininfo
Definition: pathnodes.h:731
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
int nparts
Definition: pathnodes.h:743
Relids relids
Definition: pathnodes.h:665
bool partbounds_merged
Definition: pathnodes.h:747
List * non_unique_for_rels
Definition: pathnodes.h:724
List * ppilist
Definition: pathnodes.h:680
Index relid
Definition: pathnodes.h:693
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
Relids lateral_referencers
Definition: pathnodes.h:701
Oid serverid
Definition: pathnodes.h:714
Relids direct_lateral_relids
Definition: pathnodes.h:689
bool consider_partitionwise_join
Definition: pathnodes.h:736
void * palloc0(Size size)
Definition: mcxt.c:980
void mark_dummy_rel(RelOptInfo *rel)
Definition: joinrels.c:1261
int rel_parallel_workers
Definition: pathnodes.h:711
struct AppendRelInfo ** append_rel_array
Definition: pathnodes.h:219
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
RTEKind rtekind
Definition: pathnodes.h:695
List * indexlist
Definition: pathnodes.h:702
double rows
Definition: pathnodes.h:668
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: pathnodes.h:719
#define makeNode(_type_)
Definition: nodes.h:577
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:738
List * lateral_vars
Definition: pathnodes.h:700
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
Bitmapset * Relids
Definition: pathnodes.h:28
RTEKind rtekind
Definition: parsenodes.h:976
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
#define elog(elevel,...)
Definition: elog.h:214
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
Alias * eref
Definition: parsenodes.h:1115
List * partition_qual
Definition: pathnodes.h:749
int32 * attr_widths
Definition: pathnodes.h:699
struct PathTarget * reltarget
Definition: pathnodes.h:676
QualCost baserestrictcost
Definition: pathnodes.h:728
List * subplan_params
Definition: pathnodes.h:710
Bitmapset * eclass_indexes
Definition: pathnodes.h:707
void get_relation_info(PlannerInfo *root, Oid relationObjectId, bool inhparent, RelOptInfo *rel)
Definition: plancat.c:113
Relids top_parent_relids
Definition: pathnodes.h:738
AttrNumber min_attr
Definition: pathnodes.h:696

◆ calc_nestloop_required_outer()

Relids calc_nestloop_required_outer ( Relids  outerrelids,
Relids  outer_paramrels,
Relids  innerrelids,
Relids  inner_paramrels 
)

Definition at line 2234 of file pathnode.c.

References Assert, bms_copy(), bms_del_members(), bms_free(), bms_is_empty(), bms_overlap(), and bms_union().

Referenced by try_nestloop_path().

2238 {
2239  Relids required_outer;
2240 
2241  /* inner_path can require rels from outer path, but not vice versa */
2242  Assert(!bms_overlap(outer_paramrels, innerrelids));
2243  /* easy case if inner path is not parameterized */
2244  if (!inner_paramrels)
2245  return bms_copy(outer_paramrels);
2246  /* else, form the union ... */
2247  required_outer = bms_union(outer_paramrels, inner_paramrels);
2248  /* ... and remove any mention of now-satisfied outer rels */
2249  required_outer = bms_del_members(required_outer,
2250  outerrelids);
2251  /* maintain invariant that required_outer is exactly NULL if empty */
2252  if (bms_is_empty(required_outer))
2253  {
2254  bms_free(required_outer);
2255  required_outer = NULL;
2256  }
2257  return required_outer;
2258 }
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
void bms_free(Bitmapset *a)
Definition: bitmapset.c:208
#define Assert(condition)
Definition: c.h:738
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:928
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494

◆ calc_non_nestloop_required_outer()

Relids calc_non_nestloop_required_outer ( Path outer_path,
Path inner_path 
)

Definition at line 2267 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().

2268 {
2269  Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
2270  Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
2271  Relids required_outer;
2272 
2273  /* neither path can require rels from the other */
2274  Assert(!bms_overlap(outer_paramrels, inner_path->parent->relids));
2275  Assert(!bms_overlap(inner_paramrels, outer_path->parent->relids));
2276  /* form the union ... */
2277  required_outer = bms_union(outer_paramrels, inner_paramrels);
2278  /* we do not need an explicit test for empty; bms_union gets it right */
2279  return required_outer;
2280 }
RelOptInfo * parent
Definition: pathnodes.h:1144
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1163
Relids relids
Definition: pathnodes.h:665
#define Assert(condition)
Definition: c.h:738
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494

◆ compare_fractional_path_costs()

int compare_fractional_path_costs ( Path path1,
Path path2,
double  fraction 
)

Definition at line 117 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().

119 {
120  Cost cost1,
121  cost2;
122 
123  if (fraction <= 0.0 || fraction >= 1.0)
124  return compare_path_costs(path1, path2, TOTAL_COST);
125  cost1 = path1->startup_cost +
126  fraction * (path1->total_cost - path1->startup_cost);
127  cost2 = path2->startup_cost +
128  fraction * (path2->total_cost - path2->startup_cost);
129  if (cost1 < cost2)
130  return -1;
131  if (cost1 > cost2)
132  return +1;
133  return 0;
134 }
Cost startup_cost
Definition: pathnodes.h:1155
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:71
Cost total_cost
Definition: pathnodes.h:1156
double Cost
Definition: nodes.h:663

◆ compare_path_costs()

int compare_path_costs ( Path path1,
Path path2,
CostSelector  criterion 
)

Definition at line 71 of file pathnode.c.

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

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

72 {
73  if (criterion == STARTUP_COST)
74  {
75  if (path1->startup_cost < path2->startup_cost)
76  return -1;
77  if (path1->startup_cost > path2->startup_cost)
78  return +1;
79 
80  /*
81  * If paths have the same startup cost (not at all unlikely), order
82  * them by total cost.
83  */
84  if (path1->total_cost < path2->total_cost)
85  return -1;
86  if (path1->total_cost > path2->total_cost)
87  return +1;
88  }
89  else
90  {
91  if (path1->total_cost < path2->total_cost)
92  return -1;
93  if (path1->total_cost > path2->total_cost)
94  return +1;
95 
96  /*
97  * If paths have the same total cost, order them by startup cost.
98  */
99  if (path1->startup_cost < path2->startup_cost)
100  return -1;
101  if (path1->startup_cost > path2->startup_cost)
102  return +1;
103  }
104  return 0;
105 }
Cost startup_cost
Definition: pathnodes.h:1155
Cost total_cost
Definition: pathnodes.h:1156

◆ create_agg_path()

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 2973 of file pathnode.c.

References AGG_SORTED, AggPath::aggsplit, AggPath::aggstrategy, RelOptInfo::consider_parallel, PathTarget::cost, cost_agg(), AggPath::groupClause, list_length(), makeNode, NIL, 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, Path::total_cost, AggClauseCosts::transitionSpace, AggPath::transitionSpace, and PathTarget::width.

Referenced by add_paths_to_grouping_rel(), create_distinct_paths(), create_partial_grouping_paths(), and make_union_unique().

2983 {
2984  AggPath *pathnode = makeNode(AggPath);
2985 
2986  pathnode->path.pathtype = T_Agg;
2987  pathnode->path.parent = rel;
2988  pathnode->path.pathtarget = target;
2989  /* For now, assume we are above any joins, so no parameterization */
2990  pathnode->path.param_info = NULL;
2991  pathnode->path.parallel_aware = false;
2992  pathnode->path.parallel_safe = rel->consider_parallel &&
2993  subpath->parallel_safe;
2994  pathnode->path.parallel_workers = subpath->parallel_workers;
2995  if (aggstrategy == AGG_SORTED)
2996  pathnode->path.pathkeys = subpath->pathkeys; /* preserves order */
2997  else
2998  pathnode->path.pathkeys = NIL; /* output is unordered */
2999  pathnode->subpath = subpath;
3000 
3001  pathnode->aggstrategy = aggstrategy;
3002  pathnode->aggsplit = aggsplit;
3003  pathnode->numGroups = numGroups;
3004  pathnode->transitionSpace = aggcosts ? aggcosts->transitionSpace : 0;
3005  pathnode->groupClause = groupClause;
3006  pathnode->qual = qual;
3007 
3008  cost_agg(&pathnode->path, root,
3009  aggstrategy, aggcosts,
3010  list_length(groupClause), numGroups,
3011  qual,
3012  subpath->startup_cost, subpath->total_cost,
3013  subpath->rows, subpath->pathtarget->width);
3014 
3015  /* add tlist eval cost for each output row */
3016  pathnode->path.startup_cost += target->cost.startup;
3017  pathnode->path.total_cost += target->cost.startup +
3018  target->cost.per_tuple * pathnode->path.rows;
3019 
3020  return pathnode;
3021 }
#define NIL
Definition: pg_list.h:65
Definition: nodes.h:79
PathTarget * pathtarget
Definition: pathnodes.h:1145
AggStrategy aggstrategy
Definition: pathnodes.h:1700
List * qual
Definition: pathnodes.h:1705
void cost_agg(Path *path, PlannerInfo *root, AggStrategy aggstrategy, const AggClauseCosts *aggcosts, int numGroupCols, double numGroups, List *quals, Cost input_startup_cost, Cost input_total_cost, double input_tuples, double input_width)
Definition: costsize.c:2311
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
AggSplit aggsplit
Definition: pathnodes.h:1701
double numGroups
Definition: pathnodes.h:1702
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1142
Cost per_tuple
Definition: pathnodes.h:46
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
List * groupClause
Definition: pathnodes.h:1704
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
uint64 transitionSpace
Definition: pathnodes.h:1703
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
QualCost cost
Definition: pathnodes.h:1076
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
Path * subpath
Definition: pathnodes.h:1699
Size transitionSpace
Definition: pathnodes.h:64
bool parallel_aware
Definition: pathnodes.h:1149
Path path
Definition: pathnodes.h:1698
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_append_path()

AppendPath* create_append_path ( PlannerInfo root,
RelOptInfo rel,
List subpaths,
List partial_subpaths,
List pathkeys,
Relids  required_outer,
int  parallel_workers,
bool  parallel_aware,
List partitioned_rels,
double  rows 
)

Definition at line 1183 of file pathnode.c.

References PlannerInfo::all_baserels, append_startup_cost_compare(), append_total_cost_compare(), Assert, bms_equal(), RelOptInfo::consider_parallel, cost_append(), AppendPath::first_partial_path, get_appendrel_parampathinfo(), get_baserel_parampathinfo(), lfirst, PlannerInfo::limit_tuples, AppendPath::limit_tuples, linitial, list_concat(), list_copy(), list_length(), list_sort(), 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::relids, RELOPT_BASEREL, RelOptInfo::reloptkind, RelOptInfo::reltarget, Path::rows, Path::startup_cost, subpath(), AppendPath::subpaths, T_Append, and Path::total_cost.

Referenced by add_paths_to_append_rel(), create_degenerate_grouping_paths(), generate_nonunion_paths(), generate_orderedappend_paths(), generate_union_paths(), inheritance_planner(), mark_dummy_rel(), reparameterize_path(), and set_dummy_rel_pathlist().

1189 {
1190  AppendPath *pathnode = makeNode(AppendPath);
1191  ListCell *l;
1192 
1193  Assert(!parallel_aware || parallel_workers > 0);
1194 
1195  pathnode->path.pathtype = T_Append;
1196  pathnode->path.parent = rel;
1197  pathnode->path.pathtarget = rel->reltarget;
1198 
1199  /*
1200  * When generating an Append path for a partitioned table, there may be
1201  * parameters that are useful so we can eliminate certain partitions
1202  * during execution. Here we'll go all the way and fully populate the
1203  * parameter info data as we do for normal base relations. However, we
1204  * need only bother doing this for RELOPT_BASEREL rels, as
1205  * RELOPT_OTHER_MEMBER_REL's Append paths are merged into the base rel's
1206  * Append subpaths. It would do no harm to do this, we just avoid it to
1207  * save wasting effort.
1208  */
1209  if (partitioned_rels != NIL && root && rel->reloptkind == RELOPT_BASEREL)
1210  pathnode->path.param_info = get_baserel_parampathinfo(root,
1211  rel,
1212  required_outer);
1213  else
1215  required_outer);
1216 
1217  pathnode->path.parallel_aware = parallel_aware;
1218  pathnode->path.parallel_safe = rel->consider_parallel;
1219  pathnode->path.parallel_workers = parallel_workers;
1220  pathnode->path.pathkeys = pathkeys;
1221  pathnode->partitioned_rels = list_copy(partitioned_rels);
1222 
1223  /*
1224  * For parallel append, non-partial paths are sorted by descending total
1225  * costs. That way, the total time to finish all non-partial paths is
1226  * minimized. Also, the partial paths are sorted by descending startup
1227  * costs. There may be some paths that require to do startup work by a
1228  * single worker. In such case, it's better for workers to choose the
1229  * expensive ones first, whereas the leader should choose the cheapest
1230  * startup plan.
1231  */
1232  if (pathnode->path.parallel_aware)
1233  {
1234  /*
1235  * We mustn't fiddle with the order of subpaths when the Append has
1236  * pathkeys. The order they're listed in is critical to keeping the
1237  * pathkeys valid.
1238  */
1239  Assert(pathkeys == NIL);
1240 
1242  list_sort(partial_subpaths, append_startup_cost_compare);
1243  }
1244  pathnode->first_partial_path = list_length(subpaths);
1245  pathnode->subpaths = list_concat(subpaths, partial_subpaths);
1246 
1247  /*
1248  * Apply query-wide LIMIT if known and path is for sole base relation.
1249  * (Handling this at this low level is a bit klugy.)
1250  */
1251  if (root != NULL && bms_equal(rel->relids, root->all_baserels))
1252  pathnode->limit_tuples = root->limit_tuples;
1253  else
1254  pathnode->limit_tuples = -1.0;
1255 
1256  foreach(l, pathnode->subpaths)
1257  {
1258  Path *subpath = (Path *) lfirst(l);
1259 
1260  pathnode->path.parallel_safe = pathnode->path.parallel_safe &&
1261  subpath->parallel_safe;
1262 
1263  /* All child paths must have same parameterization */
1264  Assert(bms_equal(PATH_REQ_OUTER(subpath), required_outer));
1265  }
1266 
1267  Assert(!parallel_aware || pathnode->path.parallel_safe);
1268 
1269  /*
1270  * If there's exactly one child path, the Append is a no-op and will be
1271  * discarded later (in setrefs.c); therefore, we can inherit the child's
1272  * size and cost, as well as its pathkeys if any (overriding whatever the
1273  * caller might've said). Otherwise, we must do the normal costsize
1274  * calculation.
1275  */
1276  if (list_length(pathnode->subpaths) == 1)
1277  {
1278  Path *child = (Path *) linitial(pathnode->subpaths);
1279 
1280  pathnode->path.rows = child->rows;
1281  pathnode->path.startup_cost = child->startup_cost;
1282  pathnode->path.total_cost = child->total_cost;
1283  pathnode->path.pathkeys = child->pathkeys;
1284  }
1285  else
1286  cost_append(pathnode);
1287 
1288  /* If the caller provided a row estimate, override the computed value. */
1289  if (rows >= 0)
1290  pathnode->path.rows = rows;
1291 
1292  return pathnode;
1293 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
RelOptKind reloptkind
Definition: pathnodes.h:662
double limit_tuples
Definition: pathnodes.h:1407
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * list_copy(const List *oldlist)
Definition: list.c:1403
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
Definition: nodes.h:49
static int append_total_cost_compare(const ListCell *a, const ListCell *b)
Definition: pathnode.c:1305
int first_partial_path
Definition: pathnodes.h:1406
NodeTag pathtype
Definition: pathnodes.h:1142
List * subpaths
Definition: pathnodes.h:1404
static int append_startup_cost_compare(const ListCell *a, const ListCell *b)
Definition: pathnode.c:1327
#define linitial(l)
Definition: pg_list.h:195
Relids all_baserels
Definition: pathnodes.h:227
double limit_tuples
Definition: pathnodes.h:337
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1163
Relids relids
Definition: pathnodes.h:665
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
void cost_append(AppendPath *apath)
Definition: costsize.c:2035
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
List * partitioned_rels
Definition: pathnodes.h:1403
void list_sort(List *list, list_sort_comparator cmp)
Definition: list.c:1481
bool parallel_aware
Definition: pathnodes.h:1149
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1576
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ create_bitmap_and_path()

BitmapAndPath* create_bitmap_and_path ( PlannerInfo root,
RelOptInfo rel,
List bitmapquals 
)

Definition at line 1079 of file pathnode.c.

References BitmapAndPath::bitmapquals, RelOptInfo::consider_parallel, cost_bitmap_and_node(), makeNode, NIL, 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().

1082 {
1083  BitmapAndPath *pathnode = makeNode(BitmapAndPath);
1084 
1085  pathnode->path.pathtype = T_BitmapAnd;
1086  pathnode->path.parent = rel;
1087  pathnode->path.pathtarget = rel->reltarget;
1088  pathnode->path.param_info = NULL; /* not used in bitmap trees */
1089 
1090  /*
1091  * Currently, a BitmapHeapPath, BitmapAndPath, or BitmapOrPath will be
1092  * parallel-safe if and only if rel->consider_parallel is set. So, we can
1093  * set the flag for this path based only on the relation-level flag,
1094  * without actually iterating over the list of children.
1095  */
1096  pathnode->path.parallel_aware = false;
1097  pathnode->path.parallel_safe = rel->consider_parallel;
1098  pathnode->path.parallel_workers = 0;
1099 
1100  pathnode->path.pathkeys = NIL; /* always unordered */
1101 
1102  pathnode->bitmapquals = bitmapquals;
1103 
1104  /* this sets bitmapselectivity as well as the regular cost fields: */
1105  cost_bitmap_and_node(pathnode, root);
1106 
1107  return pathnode;
1108 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
void cost_bitmap_and_node(BitmapAndPath *path, PlannerInfo *root)
Definition: costsize.c:1087
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * bitmapquals
Definition: pathnodes.h:1292
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * parent
Definition: pathnodes.h:1144
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_bitmap_heap_path()

BitmapHeapPath* create_bitmap_heap_path ( PlannerInfo root,
RelOptInfo rel,
Path bitmapqual,
Relids  required_outer,
double  loop_count,
int  parallel_degree 
)

Definition at line 1046 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, T_BitmapHeapScan, and true.

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

1052 {
1053  BitmapHeapPath *pathnode = makeNode(BitmapHeapPath);
1054 
1055  pathnode->path.pathtype = T_BitmapHeapScan;
1056  pathnode->path.parent = rel;
1057  pathnode->path.pathtarget = rel->reltarget;
1058  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1059  required_outer);
1060  pathnode->path.parallel_aware = parallel_degree > 0 ? true : false;
1061  pathnode->path.parallel_safe = rel->consider_parallel;
1062  pathnode->path.parallel_workers = parallel_degree;
1063  pathnode->path.pathkeys = NIL; /* always unordered */
1064 
1065  pathnode->bitmapqual = bitmapqual;
1066 
1067  cost_bitmap_heap_scan(&pathnode->path, root, rel,
1068  pathnode->path.param_info,
1069  bitmapqual, loop_count);
1070 
1071  return pathnode;
1072 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info, Path *bitmapqual, double loop_count)
Definition: costsize.c:943
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
#define true
Definition: c.h:321
RelOptInfo * parent
Definition: pathnodes.h:1144
Path * bitmapqual
Definition: pathnodes.h:1280
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_bitmap_or_path()

BitmapOrPath* create_bitmap_or_path ( PlannerInfo root,
RelOptInfo rel,
List bitmapquals 
)

Definition at line 1115 of file pathnode.c.

References BitmapOrPath::bitmapquals, RelOptInfo::consider_parallel, cost_bitmap_or_node(), makeNode, NIL, 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().

1118 {
1119  BitmapOrPath *pathnode = makeNode(BitmapOrPath);
1120 
1121  pathnode->path.pathtype = T_BitmapOr;
1122  pathnode->path.parent = rel;
1123  pathnode->path.pathtarget = rel->reltarget;
1124  pathnode->path.param_info = NULL; /* not used in bitmap trees */
1125 
1126  /*
1127  * Currently, a BitmapHeapPath, BitmapAndPath, or BitmapOrPath will be
1128  * parallel-safe if and only if rel->consider_parallel is set. So, we can
1129  * set the flag for this path based only on the relation-level flag,
1130  * without actually iterating over the list of children.
1131  */
1132  pathnode->path.parallel_aware = false;
1133  pathnode->path.parallel_safe = rel->consider_parallel;
1134  pathnode->path.parallel_workers = 0;
1135 
1136  pathnode->path.pathkeys = NIL; /* always unordered */
1137 
1138  pathnode->bitmapquals = bitmapquals;
1139 
1140  /* this sets bitmapselectivity as well as the regular cost fields: */
1141  cost_bitmap_or_node(pathnode, root);
1142 
1143  return pathnode;
1144 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * bitmapquals
Definition: pathnodes.h:1305
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * parent
Definition: pathnodes.h:1144
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
void cost_bitmap_or_node(BitmapOrPath *path, PlannerInfo *root)
Definition: costsize.c:1131
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_ctescan_path()

Path* create_ctescan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer 
)

Definition at line 1990 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().

1991 {
1992  Path *pathnode = makeNode(Path);
1993 
1994  pathnode->pathtype = T_CteScan;
1995  pathnode->parent = rel;
1996  pathnode->pathtarget = rel->reltarget;
1997  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1998  required_outer);
1999  pathnode->parallel_aware = false;
2000  pathnode->parallel_safe = rel->consider_parallel;
2001  pathnode->parallel_workers = 0;
2002  pathnode->pathkeys = NIL; /* XXX for now, result is always unordered */
2003 
2004  cost_ctescan(pathnode, root, rel, pathnode->param_info);
2005 
2006  return pathnode;
2007 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
void cost_ctescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1501
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * parent
Definition: pathnodes.h:1144
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_foreign_join_path()

ForeignPath* create_foreign_join_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 2144 of file pathnode.c.

References bms_is_empty(), RelOptInfo::consider_parallel, elog, ERROR, ForeignPath::fdw_outerpath, ForeignPath::fdw_private, RelOptInfo::lateral_relids, 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_paths_with_pathkeys_for_rel(), and postgresGetForeignJoinPaths().

2151 {
2152  ForeignPath *pathnode = makeNode(ForeignPath);
2153 
2154  /*
2155  * We should use get_joinrel_parampathinfo to handle parameterized paths,
2156  * but the API of this function doesn't support it, and existing
2157  * extensions aren't yet trying to build such paths anyway. For the
2158  * moment just throw an error if someone tries it; eventually we should
2159  * revisit this.
2160  */
2161  if (!bms_is_empty(required_outer) || !bms_is_empty(rel->lateral_relids))
2162  elog(ERROR, "parameterized foreign joins are not supported yet");
2163 
2164  pathnode->path.pathtype = T_ForeignScan;
2165  pathnode->path.parent = rel;
2166  pathnode->path.pathtarget = target ? target : rel->reltarget;
2167  pathnode->path.param_info = NULL; /* XXX see above */
2168  pathnode->path.parallel_aware = false;
2169  pathnode->path.parallel_safe = rel->consider_parallel;
2170  pathnode->path.parallel_workers = 0;
2171  pathnode->path.rows = rows;
2172  pathnode->path.startup_cost = startup_cost;
2173  pathnode->path.total_cost = total_cost;
2174  pathnode->path.pathkeys = pathkeys;
2175 
2176  pathnode->fdw_outerpath = fdw_outerpath;
2177  pathnode->fdw_private = fdw_private;
2178 
2179  return pathnode;
2180 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
Path * fdw_outerpath
Definition: pathnodes.h:1349
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
Relids lateral_relids
Definition: pathnodes.h:690
#define ERROR
Definition: elog.h:43
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
List * fdw_private
Definition: pathnodes.h:1350
#define elog(elevel,...)
Definition: elog.h:214
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_foreign_upper_path()

ForeignPath* create_foreign_upper_path ( PlannerInfo root,
RelOptInfo rel,
PathTarget target,
double  rows,
Cost  startup_cost,
Cost  total_cost,
List pathkeys,
Path fdw_outerpath,
List fdw_private 
)

Definition at line 2194 of file pathnode.c.

References Assert, bms_is_empty(), RelOptInfo::consider_parallel, ForeignPath::fdw_outerpath, ForeignPath::fdw_private, RelOptInfo::lateral_relids, 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_final_paths(), add_foreign_grouping_paths(), and add_foreign_ordered_paths().

2200 {
2201  ForeignPath *pathnode = makeNode(ForeignPath);
2202 
2203  /*
2204  * Upper relations should never have any lateral references, since joining
2205  * is complete.
2206  */
2208 
2209  pathnode->path.pathtype = T_ForeignScan;
2210  pathnode->path.parent = rel;
2211  pathnode->path.pathtarget = target ? target : rel->reltarget;
2212  pathnode->path.param_info = NULL;
2213  pathnode->path.parallel_aware = false;
2214  pathnode->path.parallel_safe = rel->consider_parallel;
2215  pathnode->path.parallel_workers = 0;
2216  pathnode->path.rows = rows;
2217  pathnode->path.startup_cost = startup_cost;
2218  pathnode->path.total_cost = total_cost;
2219  pathnode->path.pathkeys = pathkeys;
2220 
2221  pathnode->fdw_outerpath = fdw_outerpath;
2222  pathnode->fdw_private = fdw_private;
2223 
2224  return pathnode;
2225 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
Path * fdw_outerpath
Definition: pathnodes.h:1349
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
Relids lateral_relids
Definition: pathnodes.h:690
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
List * fdw_private
Definition: pathnodes.h:1350
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_foreignscan_path()

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 2100 of file pathnode.c.

References Assert, RelOptInfo::consider_parallel, ForeignPath::fdw_outerpath, ForeignPath::fdw_private, get_baserel_parampathinfo(), IS_SIMPLE_REL, 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_paths_with_pathkeys_for_rel(), fileGetForeignPaths(), and postgresGetForeignPaths().

2107 {
2108  ForeignPath *pathnode = makeNode(ForeignPath);
2109 
2110  /* Historically some FDWs were confused about when to use this */
2111  Assert(IS_SIMPLE_REL(rel));
2112 
2113  pathnode->path.pathtype = T_ForeignScan;
2114  pathnode->path.parent = rel;
2115  pathnode->path.pathtarget = target ? target : rel->reltarget;
2116  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
2117  required_outer);
2118  pathnode->path.parallel_aware = false;
2119  pathnode->path.parallel_safe = rel->consider_parallel;
2120  pathnode->path.parallel_workers = 0;
2121  pathnode->path.rows = rows;
2122  pathnode->path.startup_cost = startup_cost;
2123  pathnode->path.total_cost = total_cost;
2124  pathnode->path.pathkeys = pathkeys;
2125 
2126  pathnode->fdw_outerpath = fdw_outerpath;
2127  pathnode->fdw_private = fdw_private;
2128 
2129  return pathnode;
2130 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
Path * fdw_outerpath
Definition: pathnodes.h:1349
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:638
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
List * fdw_private
Definition: pathnodes.h:1350
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_functionscan_path()

Path* create_functionscan_path ( PlannerInfo root,
RelOptInfo rel,
List pathkeys,
Relids  required_outer 
)

Definition at line 1912 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().

1914 {
1915  Path *pathnode = makeNode(Path);
1916 
1917  pathnode->pathtype = T_FunctionScan;
1918  pathnode->parent = rel;
1919  pathnode->pathtarget = rel->reltarget;
1920  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1921  required_outer);
1922  pathnode->parallel_aware = false;
1923  pathnode->parallel_safe = rel->consider_parallel;
1924  pathnode->parallel_workers = 0;
1925  pathnode->pathkeys = pathkeys;
1926 
1927  cost_functionscan(pathnode, root, rel, pathnode->param_info);
1928 
1929  return pathnode;
1930 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * parent
Definition: pathnodes.h:1144
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
void cost_functionscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1334
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_gather_merge_path()

GatherMergePath* create_gather_merge_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
List pathkeys,
Relids  required_outer,
double *  rows 
)

Definition at line 1754 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_ordered_paths(), gather_grouping_paths(), generate_gather_paths(), and generate_useful_gather_paths().

1757 {
1759  Cost input_startup_cost = 0;
1760  Cost input_total_cost = 0;
1761 
1762  Assert(subpath->parallel_safe);
1763  Assert(pathkeys);
1764 
1765  pathnode->path.pathtype = T_GatherMerge;
1766  pathnode->path.parent = rel;
1767  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1768  required_outer);
1769  pathnode->path.parallel_aware = false;
1770 
1771  pathnode->subpath = subpath;
1772  pathnode->num_workers = subpath->parallel_workers;
1773  pathnode->path.pathkeys = pathkeys;
1774  pathnode->path.pathtarget = target ? target : rel->reltarget;
1775  pathnode->path.rows += subpath->rows;
1776 
1777  if (pathkeys_contained_in(pathkeys, subpath->pathkeys))
1778  {
1779  /* Subpath is adequately ordered, we won't need to sort it */
1780  input_startup_cost += subpath->startup_cost;
1781  input_total_cost += subpath->total_cost;
1782  }
1783  else
1784  {
1785  /* We'll need to insert a Sort node, so include cost for that */
1786  Path sort_path; /* dummy for result of cost_sort */
1787 
1788  cost_sort(&sort_path,
1789  root,
1790  pathkeys,
1791  subpath->total_cost,
1792  subpath->rows,
1793  subpath->pathtarget->width,
1794  0.0,
1795  work_mem,
1796  -1);
1797  input_startup_cost += sort_path.startup_cost;
1798  input_total_cost += sort_path.total_cost;
1799  }
1800 
1801  cost_gather_merge(pathnode, root, rel, pathnode->path.param_info,
1802  input_startup_cost, input_total_cost, rows);
1803 
1804  return pathnode;
1805 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
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:404
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
bool pathkeys_contained_in(List *keys1, List *keys2)
Definition: pathkeys.c:324
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:1928
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676
double Cost
Definition: nodes.h:663
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_gather_path()

GatherPath* create_gather_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target,
Relids  required_outer,
double *  rows 
)

Definition at line 1845 of file pathnode.c.

References Assert, cost_gather(), get_baserel_parampathinfo(), makeNode, NIL, GatherPath::num_workers, 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 generate_gather_paths(), and generate_union_paths().

1847 {
1848  GatherPath *pathnode = makeNode(GatherPath);
1849 
1850  Assert(subpath->parallel_safe);
1851 
1852  pathnode->path.pathtype = T_Gather;
1853  pathnode->path.parent = rel;
1854  pathnode->path.pathtarget = target;
1855  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1856  required_outer);
1857  pathnode->path.parallel_aware = false;
1858  pathnode->path.parallel_safe = false;
1859  pathnode->path.parallel_workers = 0;
1860  pathnode->path.pathkeys = NIL; /* Gather has unordered result */
1861 
1862  pathnode->subpath = subpath;
1863  pathnode->num_workers = subpath->parallel_workers;
1864  pathnode->single_copy = false;
1865 
1866  if (pathnode->num_workers == 0)
1867  {
1868  pathnode->path.pathkeys = subpath->pathkeys;
1869  pathnode->num_workers = 1;
1870  pathnode->single_copy = true;
1871  }
1872 
1873  cost_gather(pathnode, root, rel, pathnode->path.param_info, rows);
1874 
1875  return pathnode;
1876 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
bool single_copy
Definition: pathnodes.h:1496
int num_workers
Definition: pathnodes.h:1497
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * parent
Definition: pathnodes.h:1144
Path * subpath
Definition: pathnodes.h:1495
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
bool parallel_safe
Definition: pathnodes.h:1150
void cost_gather(GatherPath *path, PlannerInfo *root, RelOptInfo *rel, ParamPathInfo *param_info, double *rows)
Definition: costsize.c:366
Definition: nodes.h:82
bool parallel_aware
Definition: pathnodes.h:1149
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_group_path()

GroupPath* create_group_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List groupClause,
List qual,
double  numGroups 
)

Definition at line 2862 of file pathnode.c.

References RelOptInfo::consider_parallel, PathTarget::cost, cost_group(), GroupPath::groupClause, list_length(), makeNode, 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, RelOptInfo::reltarget, Path::rows, QualCost::startup, Path::startup_cost, subpath(), GroupPath::subpath, T_Group, and Path::total_cost.

Referenced by add_paths_to_grouping_rel(), and create_partial_grouping_paths().

2868 {
2869  GroupPath *pathnode = makeNode(GroupPath);
2870  PathTarget *target = rel->reltarget;
2871 
2872  pathnode->path.pathtype = T_Group;
2873  pathnode->path.parent = rel;
2874  pathnode->path.pathtarget = target;
2875  /* For now, assume we are above any joins, so no parameterization */
2876  pathnode->path.param_info = NULL;
2877  pathnode->path.parallel_aware = false;
2878  pathnode->path.parallel_safe = rel->consider_parallel &&
2879  subpath->parallel_safe;
2880  pathnode->path.parallel_workers = subpath->parallel_workers;
2881  /* Group doesn't change sort ordering */
2882  pathnode->path.pathkeys = subpath->pathkeys;
2883 
2884  pathnode->subpath = subpath;
2885 
2886  pathnode->groupClause = groupClause;
2887  pathnode->qual = qual;
2888 
2889  cost_group(&pathnode->path, root,
2890  list_length(groupClause),
2891  numGroups,
2892  qual,
2893  subpath->startup_cost, subpath->total_cost,
2894  subpath->rows);
2895 
2896  /* add tlist eval cost for each output row */
2897  pathnode->path.startup_cost += target->cost.startup;
2898  pathnode->path.total_cost += target->cost.startup +
2899  target->cost.per_tuple * pathnode->path.rows;
2900 
2901  return pathnode;
2902 }
List * qual
Definition: pathnodes.h:1673
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1142
Cost per_tuple
Definition: pathnodes.h:46
Cost startup_cost
Definition: pathnodes.h:1155
void cost_group(Path *path, PlannerInfo *root, int numGroupCols, double numGroups, List *quals, Cost input_startup_cost, Cost input_total_cost, double input_tuples)
Definition: costsize.c:2569
RelOptInfo * parent
Definition: pathnodes.h:1144
Definition: nodes.h:78
Path path
Definition: pathnodes.h:1670
List * groupClause
Definition: pathnodes.h:1672
Path * subpath
Definition: pathnodes.h:1671
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
QualCost cost
Definition: pathnodes.h:1076
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_group_result_path()

GroupResultPath* create_group_result_path ( PlannerInfo root,
RelOptInfo rel,
PathTarget target,
List havingqual 
)

Definition at line 1447 of file pathnode.c.

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

Referenced by create_degenerate_grouping_paths(), and query_planner().

1449 {
1451 
1452  pathnode->path.pathtype = T_Result;
1453  pathnode->path.parent = rel;
1454  pathnode->path.pathtarget = target;
1455  pathnode->path.param_info = NULL; /* there are no other rels... */
1456  pathnode->path.parallel_aware = false;
1457  pathnode->path.parallel_safe = rel->consider_parallel;
1458  pathnode->path.parallel_workers = 0;
1459  pathnode->path.pathkeys = NIL;
1460  pathnode->quals = havingqual;
1461 
1462  /*
1463  * We can't quite use cost_resultscan() because the quals we want to
1464  * account for are not baserestrict quals of the rel. Might as well just
1465  * hack it here.
1466  */
1467  pathnode->path.rows = 1;
1468  pathnode->path.startup_cost = target->cost.startup;
1469  pathnode->path.total_cost = target->cost.startup +
1470  cpu_tuple_cost + target->cost.per_tuple;
1471 
1472  /*
1473  * Add cost of qual, if any --- but we ignore its selectivity, since our
1474  * rowcount estimate should be 1 no matter what the qual is.
1475  */
1476  if (havingqual)
1477  {
1478  QualCost qual_cost;
1479 
1480  cost_qual_eval(&qual_cost, havingqual, root);
1481  /* havingqual is evaluated once at startup */
1482  pathnode->path.startup_cost += qual_cost.startup + qual_cost.per_tuple;
1483  pathnode->path.total_cost += qual_cost.startup + qual_cost.per_tuple;
1484  }
1485 
1486  return pathnode;
1487 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1142
Cost per_tuple
Definition: pathnodes.h:46
Definition: nodes.h:46
void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root)
Definition: costsize.c:4042
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
QualCost cost
Definition: pathnodes.h:1076
bool consider_parallel
Definition: pathnodes.h:673
double cpu_tuple_cost
Definition: costsize.c:113
bool parallel_aware
Definition: pathnodes.h:1149

◆ create_groupingsets_path()

GroupingSetsPath* create_groupingsets_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List having_qual,
AggStrategy  aggstrategy,
List rollups,
const AggClauseCosts agg_costs,
double  numGroups 
)

Definition at line 3040 of file pathnode.c.

References AGG_HASHED, AGG_MIXED, AGG_PLAIN, AGG_SORTED, GroupingSetsPath::aggstrategy, Assert, RelOptInfo::consider_parallel, PathTarget::cost, cost_agg(), cost_sort(), PlannerInfo::group_pathkeys, RollupData::gsets, RollupData::is_hashed, lfirst, linitial, list_length(), makeNode, NIL, RollupData::numGroups, 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, RelOptInfo::reltarget, GroupingSetsPath::rollups, Path::rows, QualCost::startup, Path::startup_cost, subpath(), GroupingSetsPath::subpath, T_Agg, Path::total_cost, AggClauseCosts::transitionSpace, GroupingSetsPath::transitionSpace, PathTarget::width, and work_mem.

Referenced by consider_groupingsets_paths().

3048 {
3050  PathTarget *target = rel->reltarget;
3051  ListCell *lc;
3052  bool is_first = true;
3053  bool is_first_sort = true;
3054 
3055  /* The topmost generated Plan node will be an Agg */
3056  pathnode->path.pathtype = T_Agg;
3057  pathnode->path.parent = rel;
3058  pathnode->path.pathtarget = target;
3059  pathnode->path.param_info = subpath->param_info;
3060  pathnode->path.parallel_aware = false;
3061  pathnode->path.parallel_safe = rel->consider_parallel &&
3062  subpath->parallel_safe;
3063  pathnode->path.parallel_workers = subpath->parallel_workers;
3064  pathnode->subpath = subpath;
3065 
3066  /*
3067  * Simplify callers by downgrading AGG_SORTED to AGG_PLAIN, and AGG_MIXED
3068  * to AGG_HASHED, here if possible.
3069  */
3070  if (aggstrategy == AGG_SORTED &&
3071  list_length(rollups) == 1 &&
3072  ((RollupData *) linitial(rollups))->groupClause == NIL)
3073  aggstrategy = AGG_PLAIN;
3074 
3075  if (aggstrategy == AGG_MIXED &&
3076  list_length(rollups) == 1)
3077  aggstrategy = AGG_HASHED;
3078 
3079  /*
3080  * Output will be in sorted order by group_pathkeys if, and only if, there
3081  * is a single rollup operation on a non-empty list of grouping
3082  * expressions.
3083  */
3084  if (aggstrategy == AGG_SORTED && list_length(rollups) == 1)
3085  pathnode->path.pathkeys = root->group_pathkeys;
3086  else
3087  pathnode->path.pathkeys = NIL;
3088 
3089  pathnode->aggstrategy = aggstrategy;
3090  pathnode->rollups = rollups;
3091  pathnode->qual = having_qual;
3092  pathnode->transitionSpace = agg_costs ? agg_costs->transitionSpace : 0;
3093 
3094  Assert(rollups != NIL);
3095  Assert(aggstrategy != AGG_PLAIN || list_length(rollups) == 1);
3096  Assert(aggstrategy != AGG_MIXED || list_length(rollups) > 1);
3097 
3098  foreach(lc, rollups)
3099  {
3100  RollupData *rollup = lfirst(lc);
3101  List *gsets = rollup->gsets;
3102  int numGroupCols = list_length(linitial(gsets));
3103 
3104  /*
3105  * In AGG_SORTED or AGG_PLAIN mode, the first rollup takes the
3106  * (already-sorted) input, and following ones do their own sort.
3107  *
3108  * In AGG_HASHED mode, there is one rollup for each grouping set.
3109  *
3110  * In AGG_MIXED mode, the first rollups are hashed, the first
3111  * non-hashed one takes the (already-sorted) input, and following ones
3112  * do their own sort.
3113  */
3114  if (is_first)
3115  {
3116  cost_agg(&pathnode->path, root,
3117  aggstrategy,
3118  agg_costs,
3119  numGroupCols,
3120  rollup->numGroups,
3121  having_qual,
3122  subpath->startup_cost,
3123  subpath->total_cost,
3124  subpath->rows,
3125  subpath->pathtarget->width);
3126  is_first = false;
3127  if (!rollup->is_hashed)
3128  is_first_sort = false;
3129  }
3130  else
3131  {
3132  Path sort_path; /* dummy for result of cost_sort */
3133  Path agg_path; /* dummy for result of cost_agg */
3134 
3135  if (rollup->is_hashed || is_first_sort)
3136  {
3137  /*
3138  * Account for cost of aggregation, but don't charge input
3139  * cost again
3140  */
3141  cost_agg(&agg_path, root,
3142  rollup->is_hashed ? AGG_HASHED : AGG_SORTED,
3143  agg_costs,
3144  numGroupCols,
3145  rollup->numGroups,
3146  having_qual,
3147  0.0, 0.0,
3148  subpath->rows,
3149  subpath->pathtarget->width);
3150  if (!rollup->is_hashed)
3151  is_first_sort = false;
3152  }
3153  else
3154  {
3155  /* Account for cost of sort, but don't charge input cost again */
3156  cost_sort(&sort_path, root, NIL,
3157  0.0,
3158  subpath->rows,
3159  subpath->pathtarget->width,
3160  0.0,
3161  work_mem,
3162  -1.0);
3163 
3164  /* Account for cost of aggregation */
3165 
3166  cost_agg(&agg_path, root,
3167  AGG_SORTED,
3168  agg_costs,
3169  numGroupCols,
3170  rollup->numGroups,
3171  having_qual,
3172  sort_path.startup_cost,
3173  sort_path.total_cost,
3174  sort_path.rows,
3175  subpath->pathtarget->width);
3176  }
3177 
3178  pathnode->path.total_cost += agg_path.total_cost;
3179  pathnode->path.rows += agg_path.rows;
3180  }
3181  }
3182 
3183  /* add tlist eval cost for each output row */
3184  pathnode->path.startup_cost += target->cost.startup;
3185  pathnode->path.total_cost += target->cost.startup +
3186  target->cost.per_tuple * pathnode->path.rows;
3187 
3188  return pathnode;
3189 }
List * group_pathkeys
Definition: pathnodes.h:300
#define NIL
Definition: pg_list.h:65
Definition: nodes.h:79
PathTarget * pathtarget
Definition: pathnodes.h:1145
void cost_agg(Path *path, PlannerInfo *root, AggStrategy aggstrategy, const AggClauseCosts *aggcosts, int numGroupCols, double numGroups, List *quals, Cost input_startup_cost, Cost input_total_cost, double input_tuples, double input_width)
Definition: costsize.c:2311
int parallel_workers
Definition: pathnodes.h:1151
bool is_hashed
Definition: pathnodes.h:1727
ParamPathInfo * param_info
Definition: pathnodes.h:1147
double numGroups
Definition: pathnodes.h:1725
Cost startup
Definition: pathnodes.h:45
uint64 transitionSpace
Definition: pathnodes.h:1741
NodeTag pathtype
Definition: pathnodes.h:1142
Cost per_tuple
Definition: pathnodes.h:46
#define linitial(l)
Definition: pg_list.h:195
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
AggStrategy aggstrategy
Definition: pathnodes.h:1738
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:1928
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
QualCost cost
Definition: pathnodes.h:1076
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
Size transitionSpace
Definition: pathnodes.h:64
bool parallel_aware
Definition: pathnodes.h:1149
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
List * gsets
Definition: pathnodes.h:1723

◆ create_hashjoin_path()

HashPath* create_hashjoin_path ( PlannerInfo root,
RelOptInfo joinrel,
JoinType  jointype,
JoinCostWorkspace workspace,
JoinPathExtraData extra,
Path outer_path,
Path inner_path,
bool  parallel_hash,
List restrict_clauses,
Relids  required_outer,
List hashclauses 
)

Definition at line 2454 of file pathnode.c.

References RelOptInfo::consider_parallel, final_cost_hashjoin(), get_joinrel_parampathinfo(), JoinPath::inner_unique, JoinPathExtraData::inner_unique, 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, JoinPathExtraData::sjinfo, and T_HashJoin.

Referenced by try_hashjoin_path(), and try_partial_hashjoin_path().

2465 {
2466  HashPath *pathnode = makeNode(HashPath);
2467 
2468  pathnode->jpath.path.pathtype = T_HashJoin;
2469  pathnode->jpath.path.parent = joinrel;
2470  pathnode->jpath.path.pathtarget = joinrel->reltarget;
2471  pathnode->jpath.path.param_info =
2473  joinrel,
2474  outer_path,
2475  inner_path,
2476  extra->sjinfo,
2477  required_outer,
2478  &restrict_clauses);
2479  pathnode->jpath.path.parallel_aware =
2480  joinrel->consider_parallel && parallel_hash;
2481  pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2482  outer_path->parallel_safe && inner_path->parallel_safe;
2483  /* This is a foolish way to estimate parallel_workers, but for now... */
2484  pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2485 
2486  /*
2487  * A hashjoin never has pathkeys, since its output ordering is
2488  * unpredictable due to possible batching. XXX If the inner relation is
2489  * small enough, we could instruct the executor that it must not batch,
2490  * and then we could assume that the output inherits the outer relation's
2491  * ordering, which might save a sort step. However there is considerable
2492  * downside if our estimate of the inner relation size is badly off. For
2493  * the moment we don't risk it. (Note also that if we wanted to take this
2494  * seriously, joinpath.c would have to consider many more paths for the
2495  * outer rel than it does now.)
2496  */
2497  pathnode->jpath.path.pathkeys = NIL;
2498  pathnode->jpath.jointype = jointype;
2499  pathnode->jpath.inner_unique = extra->inner_unique;
2500  pathnode->jpath.outerjoinpath = outer_path;
2501  pathnode->jpath.innerjoinpath = inner_path;
2502  pathnode->jpath.joinrestrictinfo = restrict_clauses;
2503  pathnode->path_hashclauses = hashclauses;
2504  /* final_cost_hashjoin will fill in pathnode->num_batches */
2505 
2506  final_cost_hashjoin(root, pathnode, workspace, extra);
2507 
2508  return pathnode;
2509 }
#define NIL
Definition: pg_list.h:65
void final_cost_hashjoin(PlannerInfo *root, HashPath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
Definition: costsize.c:3587
JoinPath jpath
Definition: pathnodes.h:1599
PathTarget * pathtarget
Definition: pathnodes.h:1145
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:1369
Path * innerjoinpath
Definition: pathnodes.h:1526
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
SpecialJoinInfo * sjinfo
Definition: pathnodes.h:2427
List * joinrestrictinfo
Definition: pathnodes.h:1528
RelOptInfo * parent
Definition: pathnodes.h:1144
Path * outerjoinpath
Definition: pathnodes.h:1525
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
Path path
Definition: pathnodes.h:1518
bool parallel_safe
Definition: pathnodes.h:1150
bool inner_unique
Definition: pathnodes.h:1522
bool consider_parallel
Definition: pathnodes.h:673
JoinType jointype
Definition: pathnodes.h:1520
bool parallel_aware
Definition: pathnodes.h:1149
List * path_hashclauses
Definition: pathnodes.h:1600
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_incremental_sort_path()

SortPath* create_incremental_sort_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List pathkeys,
int  presorted_keys,
double  limit_tuples 
)

Definition at line 2769 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_incremental_sort(), makeNode, IncrementalSortPath::nPresortedCols, Path::parallel_aware, Path::parallel_safe, Path::parallel_workers, Path::param_info, Path::parent, SortPath::path, Path::pathkeys, Path::pathtarget, Path::pathtype, Path::rows, sort(), IncrementalSortPath::spath, Path::startup_cost, subpath(), SortPath::subpath, T_IncrementalSort, Path::total_cost, PathTarget::width, and work_mem.

Referenced by add_paths_to_grouping_rel(), create_ordered_paths(), create_partial_grouping_paths(), gather_grouping_paths(), and generate_useful_gather_paths().

2775 {
2777  SortPath *pathnode = &sort->spath;
2778 
2779  pathnode->path.pathtype = T_IncrementalSort;
2780  pathnode->path.parent = rel;
2781  /* Sort doesn't project, so use source path's pathtarget */
2782  pathnode->path.pathtarget = subpath->pathtarget;
2783  /* For now, assume we are above any joins, so no parameterization */
2784  pathnode->path.param_info = NULL;
2785  pathnode->path.parallel_aware = false;
2786  pathnode->path.parallel_safe = rel->consider_parallel &&
2787  subpath->parallel_safe;
2788  pathnode->path.parallel_workers = subpath->parallel_workers;
2789  pathnode->path.pathkeys = pathkeys;
2790 
2791  pathnode->subpath = subpath;
2792 
2793  cost_incremental_sort(&pathnode->path,
2794  root, pathkeys, presorted_keys,
2795  subpath->startup_cost,
2796  subpath->total_cost,
2797  subpath->rows,
2798  subpath->pathtarget->width,
2799  0.0, /* XXX comparison_cost shouldn't be 0? */
2800  work_mem, limit_tuples);
2801 
2802  sort->nPresortedCols = presorted_keys;
2803 
2804  return pathnode;
2805 }
void cost_incremental_sort(Path *path, PlannerInfo *root, List *pathkeys, int presorted_keys, Cost input_startup_cost, Cost input_total_cost, double input_tuples, int width, Cost comparison_cost, int sort_mem, double limit_tuples)
Definition: costsize.c:1789
PathTarget * pathtarget
Definition: pathnodes.h:1145
Path * subpath
Definition: pathnodes.h:1648
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
Datum sort(PG_FUNCTION_ARGS)
Definition: _int_op.c:195
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
Path path
Definition: pathnodes.h:1647
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_index_path()

IndexPath* create_index_path ( PlannerInfo root,
IndexOptInfo index,
List indexclauses,
List indexorderbys,
List indexorderbycols,
List pathkeys,
ScanDirection  indexscandir,
bool  indexonly,
Relids  required_outer,
double  loop_count,
bool  partial_path 
)

Definition at line 997 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_index(), get_baserel_parampathinfo(), IndexPath::indexclauses, IndexPath::indexinfo, IndexPath::indexorderbycols, IndexPath::indexorderbys, 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().

1008 {
1009  IndexPath *pathnode = makeNode(IndexPath);
1010  RelOptInfo *rel = index->rel;
1011 
1012  pathnode->path.pathtype = indexonly ? T_IndexOnlyScan : T_IndexScan;
1013  pathnode->path.parent = rel;
1014  pathnode->path.pathtarget = rel->reltarget;
1015  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1016  required_outer);
1017  pathnode->path.parallel_aware = false;
1018  pathnode->path.parallel_safe = rel->consider_parallel;
1019  pathnode->path.parallel_workers = 0;
1020  pathnode->path.pathkeys = pathkeys;
1021 
1022  pathnode->indexinfo = index;
1023  pathnode->indexclauses = indexclauses;
1024  pathnode->indexorderbys = indexorderbys;
1025  pathnode->indexorderbycols = indexorderbycols;
1026  pathnode->indexscandir = indexscandir;
1027 
1028  cost_index(pathnode, root, loop_count, partial_path);
1029 
1030  return pathnode;
1031 }
List * indexorderbycols
Definition: pathnodes.h:1210
PathTarget * pathtarget
Definition: pathnodes.h:1145
Path path
Definition: pathnodes.h:1206
IndexOptInfo * indexinfo
Definition: pathnodes.h:1207
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * indexclauses
Definition: pathnodes.h:1208
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * rel
Definition: pathnodes.h:820
RelOptInfo * parent
Definition: pathnodes.h:1144
void cost_index(IndexPath *path, PlannerInfo *root, double loop_count, bool partial_path)
Definition: costsize.c:479
List * indexorderbys
Definition: pathnodes.h:1209
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
ScanDirection indexscandir
Definition: pathnodes.h:1211
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_limit_path()

LimitPath* create_limit_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
Node limitOffset,
Node limitCount,
LimitOption  limitOption,
int64  offset_est,
int64  count_est 
)

Definition at line 3602 of file pathnode.c.

References adjust_limit_rows_costs(), RelOptInfo::consider_parallel, LimitPath::limitCount, LimitPath::limitOffset, LimitPath::limitOption, makeNode, 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().

3607 {
3608  LimitPath *pathnode = makeNode(LimitPath);
3609 
3610  pathnode->path.pathtype = T_Limit;
3611  pathnode->path.parent = rel;
3612  /* Limit doesn't project, so use source path's pathtarget */
3613  pathnode->path.pathtarget = subpath->pathtarget;
3614  /* For now, assume we are above any joins, so no parameterization */
3615  pathnode->path.param_info = NULL;
3616  pathnode->path.parallel_aware = false;
3617  pathnode->path.parallel_safe = rel->consider_parallel &&
3618  subpath->parallel_safe;
3619  pathnode->path.parallel_workers = subpath->parallel_workers;
3620  pathnode->path.rows = subpath->rows;
3621  pathnode->path.startup_cost = subpath->startup_cost;
3622  pathnode->path.total_cost = subpath->total_cost;
3623  pathnode->path.pathkeys = subpath->pathkeys;
3624  pathnode->subpath = subpath;
3625  pathnode->limitOffset = limitOffset;
3626  pathnode->limitCount = limitCount;
3627  pathnode->limitOption = limitOption;
3628 
3629  /*
3630  * Adjust the output rows count and costs according to the offset/limit.
3631  */
3632  adjust_limit_rows_costs(&pathnode->path.rows,
3633  &pathnode->path.startup_cost,
3634  &pathnode->path.total_cost,
3635  offset_est, count_est);
3636 
3637  return pathnode;
3638 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
LimitOption limitOption
Definition: pathnodes.h:1837
Node * limitOffset
Definition: pathnodes.h:1835
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
void adjust_limit_rows_costs(double *rows, Cost *startup_cost, Cost *total_cost, int64 offset_est, int64 count_est)
Definition: pathnode.c:3657
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
Path * subpath
Definition: pathnodes.h:1834
RelOptInfo * parent
Definition: pathnodes.h:1144
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
Path path
Definition: pathnodes.h:1833
bool parallel_aware
Definition: pathnodes.h:1149
Node * limitCount
Definition: pathnodes.h:1836
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
Definition: nodes.h:87

◆ create_lockrows_path()

LockRowsPath* create_lockrows_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List rowMarks,
int  epqParam 
)

Definition at line 3441 of file pathnode.c.

References cpu_tuple_cost, LockRowsPath::epqParam, makeNode, NIL, 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().

3443 {
3444  LockRowsPath *pathnode = makeNode(LockRowsPath);
3445 
3446  pathnode->path.pathtype = T_LockRows;
3447  pathnode->path.parent = rel;
3448  /* LockRows doesn't project, so use source path's pathtarget */
3449  pathnode->path.pathtarget = subpath->pathtarget;
3450  /* For now, assume we are above any joins, so no parameterization */
3451  pathnode->path.param_info = NULL;
3452  pathnode->path.parallel_aware = false;
3453  pathnode->path.parallel_safe = false;
3454  pathnode->path.parallel_workers = 0;
3455  pathnode->path.rows = subpath->rows;
3456 
3457  /*
3458  * The result cannot be assumed sorted, since locking might cause the sort
3459  * key columns to be replaced with new values.
3460  */
3461  pathnode->path.pathkeys = NIL;
3462 
3463  pathnode->subpath = subpath;
3464  pathnode->rowMarks = rowMarks;
3465  pathnode->epqParam = epqParam;
3466 
3467  /*
3468  * We should charge something extra for the costs of row locking and
3469  * possible refetches, but it's hard to say how much. For now, use
3470  * cpu_tuple_cost per row.
3471  */
3472  pathnode->path.startup_cost = subpath->startup_cost;
3473  pathnode->path.total_cost = subpath->total_cost +
3474  cpu_tuple_cost * subpath->rows;
3475 
3476  return pathnode;
3477 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * rowMarks
Definition: pathnodes.h:1799
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
Path * subpath
Definition: pathnodes.h:1798
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
double cpu_tuple_cost
Definition: costsize.c:113
bool parallel_aware
Definition: pathnodes.h:1149
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_material_path()

MaterialPath* create_material_path ( RelOptInfo rel,
Path subpath 
)

Definition at line 1495 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().

1496 {
1497  MaterialPath *pathnode = makeNode(MaterialPath);
1498 
1499  Assert(subpath->parent == rel);
1500 
1501  pathnode->path.pathtype = T_Material;
1502  pathnode->path.parent = rel;
1503  pathnode->path.pathtarget = rel->reltarget;
1504  pathnode->path.param_info = subpath->param_info;
1505  pathnode->path.parallel_aware = false;
1506  pathnode->path.parallel_safe = rel->consider_parallel &&
1507  subpath->parallel_safe;
1508  pathnode->path.parallel_workers = subpath->parallel_workers;
1509  pathnode->path.pathkeys = subpath->pathkeys;
1510 
1511  pathnode->subpath = subpath;
1512 
1513  cost_material(&pathnode->path,
1514  subpath->startup_cost,
1515  subpath->total_cost,
1516  subpath->rows,
1517  subpath->pathtarget->width);
1518 
1519  return pathnode;
1520 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
Path * subpath
Definition: pathnodes.h:1456
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
Cost total_cost
Definition: pathnodes.h:1156
void cost_material(Path *path, Cost input_startup_cost, Cost input_total_cost, double tuples, int width)
Definition: costsize.c:2257
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_merge_append_path()

MergeAppendPath* create_merge_append_path ( PlannerInfo root,
RelOptInfo rel,
List subpaths,
List pathkeys,
Relids  required_outer,
List partitioned_rels 
)

Definition at line 1345 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_copy(), 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_orderedappend_paths().

1351 {
1353  Cost input_startup_cost;
1354  Cost input_total_cost;
1355  ListCell *l;
1356 
1357  pathnode->path.pathtype = T_MergeAppend;
1358  pathnode->path.parent = rel;
1359  pathnode->path.pathtarget = rel->reltarget;
1361  required_outer);
1362  pathnode->path.parallel_aware = false;
1363  pathnode->path.parallel_safe = rel->consider_parallel;
1364  pathnode->path.parallel_workers = 0;
1365  pathnode->path.pathkeys = pathkeys;
1366  pathnode->partitioned_rels = list_copy(partitioned_rels);
1367  pathnode->subpaths = subpaths;
1368 
1369  /*
1370  * Apply query-wide LIMIT if known and path is for sole base relation.
1371  * (Handling this at this low level is a bit klugy.)
1372  */
1373  if (bms_equal(rel->relids, root->all_baserels))
1374  pathnode->limit_tuples = root->limit_tuples;
1375  else
1376  pathnode->limit_tuples = -1.0;
1377 
1378  /*
1379  * Add up the sizes and costs of the input paths.
1380  */
1381  pathnode->path.rows = 0;
1382  input_startup_cost = 0;
1383  input_total_cost = 0;
1384  foreach(l, subpaths)
1385  {
1386  Path *subpath = (Path *) lfirst(l);
1387 
1388  pathnode->path.rows += subpath->rows;
1389  pathnode->path.parallel_safe = pathnode->path.parallel_safe &&
1390  subpath->parallel_safe;
1391 
1392  if (pathkeys_contained_in(pathkeys, subpath->pathkeys))
1393  {
1394  /* Subpath is adequately ordered, we won't need to sort it */
1395  input_startup_cost += subpath->startup_cost;
1396  input_total_cost += subpath->total_cost;
1397  }
1398  else
1399  {
1400  /* We'll need to insert a Sort node, so include cost for that */
1401  Path sort_path; /* dummy for result of cost_sort */
1402 
1403  cost_sort(&sort_path,
1404  root,
1405  pathkeys,
1406  subpath->total_cost,
1407  subpath->parent->tuples,
1408  subpath->pathtarget->width,
1409  0.0,
1410  work_mem,
1411  pathnode->limit_tuples);
1412  input_startup_cost += sort_path.startup_cost;
1413  input_total_cost += sort_path.total_cost;
1414  }
1415 
1416  /* All child paths must have same parameterization */
1417  Assert(bms_equal(PATH_REQ_OUTER(subpath), required_outer));
1418  }
1419 
1420  /*
1421  * Now we can compute total costs of the MergeAppend. If there's exactly
1422  * one child path, the MergeAppend is a no-op and will be discarded later
1423  * (in setrefs.c); otherwise we do the normal cost calculation.
1424  */
1425  if (list_length(subpaths) == 1)
1426  {
1427  pathnode->path.startup_cost = input_startup_cost;
1428  pathnode->path.total_cost = input_total_cost;
1429  }
1430  else
1431  cost_merge_append(&pathnode->path, root,
1432  pathkeys, list_length(subpaths),
1433  input_startup_cost, input_total_cost,
1434  pathnode->path.rows);
1435 
1436  return pathnode;
1437 }
PathTarget * pathtarget
Definition: pathnodes.h:1145
double tuples
Definition: pathnodes.h:705
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * list_copy(const List *oldlist)
Definition: list.c:1403
List * partitioned_rels
Definition: pathnodes.h:1429
NodeTag pathtype
Definition: pathnodes.h:1142
Relids all_baserels
Definition: pathnodes.h:227
double limit_tuples
Definition: pathnodes.h:337
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1163
Relids relids
Definition: pathnodes.h:665
bool pathkeys_contained_in(List *keys1, List *keys2)
Definition: pathkeys.c:324
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:1928
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
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:2208
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1576
struct PathTarget * reltarget
Definition: pathnodes.h:676
double limit_tuples
Definition: pathnodes.h:1431
double Cost
Definition: nodes.h:663
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ create_mergejoin_path()

MergePath* create_mergejoin_path ( PlannerInfo root,
RelOptInfo joinrel,
JoinType  jointype,
JoinCostWorkspace workspace,
JoinPathExtraData extra,
Path outer_path,
Path inner_path,
List restrict_clauses,
List pathkeys,
Relids  required_outer,
List mergeclauses,
List outersortkeys,
List innersortkeys 
)

Definition at line 2388 of file pathnode.c.

References RelOptInfo::consider_parallel, final_cost_mergejoin(), get_joinrel_parampathinfo(), JoinPath::inner_unique, JoinPathExtraData::inner_unique, 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, JoinPathExtraData::sjinfo, and T_MergeJoin.

Referenced by try_mergejoin_path(), and try_partial_mergejoin_path().

2401 {
2402  MergePath *pathnode = makeNode(MergePath);
2403 
2404  pathnode->jpath.path.pathtype = T_MergeJoin;
2405  pathnode->jpath.path.parent = joinrel;
2406  pathnode->jpath.path.pathtarget = joinrel->reltarget;
2407  pathnode->jpath.path.param_info =
2409  joinrel,
2410  outer_path,
2411  inner_path,
2412  extra->sjinfo,
2413  required_outer,
2414  &restrict_clauses);
2415  pathnode->jpath.path.parallel_aware = false;
2416  pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2417  outer_path->parallel_safe && inner_path->parallel_safe;
2418  /* This is a foolish way to estimate parallel_workers, but for now... */
2419  pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2420  pathnode->jpath.path.pathkeys = pathkeys;
2421  pathnode->jpath.jointype = jointype;
2422  pathnode->jpath.inner_unique = extra->inner_unique;
2423  pathnode->jpath.outerjoinpath = outer_path;
2424  pathnode->jpath.innerjoinpath = inner_path;
2425  pathnode->jpath.joinrestrictinfo = restrict_clauses;
2426  pathnode->path_mergeclauses = mergeclauses;
2427  pathnode->outersortkeys = outersortkeys;
2428  pathnode->innersortkeys = innersortkeys;
2429  /* pathnode->skip_mark_restore will be set by final_cost_mergejoin */
2430  /* pathnode->materialize_inner will be set by final_cost_mergejoin */
2431 
2432  final_cost_mergejoin(root, pathnode, workspace, extra);
2433 
2434  return pathnode;
2435 }
List * path_mergeclauses
Definition: pathnodes.h:1581
List * outersortkeys
Definition: pathnodes.h:1582
PathTarget * pathtarget
Definition: pathnodes.h:1145
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:1369
Path * innerjoinpath
Definition: pathnodes.h:1526
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
SpecialJoinInfo * sjinfo
Definition: pathnodes.h:2427
List * joinrestrictinfo
Definition: pathnodes.h:1528
RelOptInfo * parent
Definition: pathnodes.h:1144
Path * outerjoinpath
Definition: pathnodes.h:1525
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
Path path
Definition: pathnodes.h:1518
bool parallel_safe
Definition: pathnodes.h:1150
bool inner_unique
Definition: pathnodes.h:1522
bool consider_parallel
Definition: pathnodes.h:673
List * innersortkeys
Definition: pathnodes.h:1583
JoinType jointype
Definition: pathnodes.h:1520
JoinPath jpath
Definition: pathnodes.h:1580
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676
void final_cost_mergejoin(PlannerInfo *root, MergePath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
Definition: costsize.c:3151

◆ create_minmaxagg_path()

MinMaxAggPath* create_minmaxagg_path ( PlannerInfo root,
RelOptInfo rel,
PathTarget target,
List mmaggregates,
List quals 
)

Definition at line 3201 of file pathnode.c.

References PathTarget::cost, cost_qual_eval(), cpu_tuple_cost, lfirst, makeNode, MinMaxAggPath::mmaggregates, NIL, 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().

3206 {
3207  MinMaxAggPath *pathnode = makeNode(MinMaxAggPath);
3208  Cost initplan_cost;
3209  ListCell *lc;
3210 
3211  /* The topmost generated Plan node will be a Result */
3212  pathnode->path.pathtype = T_Result;
3213  pathnode->path.parent = rel;
3214  pathnode->path.pathtarget = target;
3215  /* For now, assume we are above any joins, so no parameterization */
3216  pathnode->path.param_info = NULL;
3217  pathnode->path.parallel_aware = false;
3218  /* A MinMaxAggPath implies use of subplans, so cannot be parallel-safe */
3219  pathnode->path.parallel_safe = false;
3220  pathnode->path.parallel_workers = 0;
3221  /* Result is one unordered row */
3222  pathnode->path.rows = 1;
3223  pathnode->path.pathkeys = NIL;
3224 
3225  pathnode->mmaggregates = mmaggregates;
3226  pathnode->quals = quals;
3227 
3228  /* Calculate cost of all the initplans ... */
3229  initplan_cost = 0;
3230  foreach(lc, mmaggregates)
3231  {
3232  MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);
3233 
3234  initplan_cost += mminfo->pathcost;
3235  }
3236 
3237  /* add tlist eval cost for each output row, plus cpu_tuple_cost */
3238  pathnode->path.startup_cost = initplan_cost + target->cost.startup;
3239  pathnode->path.total_cost = initplan_cost + target->cost.startup +
3240  target->cost.per_tuple + cpu_tuple_cost;
3241 
3242  /*
3243  * Add cost of qual, if any --- but we ignore its selectivity, since our
3244  * rowcount estimate should be 1 no matter what the qual is.
3245  */
3246  if (quals)
3247  {
3248  QualCost qual_cost;
3249 
3250  cost_qual_eval(&qual_cost, quals, root);
3251  pathnode->path.startup_cost += qual_cost.startup;
3252  pathnode->path.total_cost += qual_cost.startup + qual_cost.per_tuple;
3253  }
3254 
3255  return pathnode;
3256 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * quals
Definition: pathnodes.h:1751
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1142
Cost per_tuple
Definition: pathnodes.h:46
Definition: nodes.h:46
void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root)
Definition: costsize.c:4042
Cost startup_cost
Definition: pathnodes.h:1155
RelOptInfo * parent
Definition: pathnodes.h:1144
List * mmaggregates
Definition: pathnodes.h:1750
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
QualCost cost
Definition: pathnodes.h:1076
double cpu_tuple_cost
Definition: costsize.c:113
bool parallel_aware
Definition: pathnodes.h:1149
double Cost
Definition: nodes.h:663

◆ create_modifytable_path()

ModifyTablePath* create_modifytable_path ( PlannerInfo root,
RelOptInfo rel,
CmdType  operation,
bool  canSetTag,
Index  nominalRelation,
Index  rootRelation,
bool  partColsUpdated,
List resultRelations,
List subpaths,
List subroots,
List withCheckOptionLists,
List returningLists,
List rowMarks,
OnConflictExpr onconflict,
int  epqParam 
)

Definition at line 3500 of file pathnode.c.

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

Referenced by grouping_planner(), and inheritance_planner().

3509 {
3511  double total_size;
3512  ListCell *lc;
3513 
3514  Assert(list_length(resultRelations) == list_length(subpaths));
3515  Assert(list_length(resultRelations) == list_length(subroots));
3516  Assert(withCheckOptionLists == NIL ||
3517  list_length(resultRelations) == list_length(withCheckOptionLists));
3518  Assert(returningLists == NIL ||
3519  list_length(resultRelations) == list_length(returningLists));
3520 
3521  pathnode->path.pathtype = T_ModifyTable;
3522  pathnode->path.parent = rel;
3523  /* pathtarget is not interesting, just make it minimally valid */
3524  pathnode->path.pathtarget = rel->reltarget;
3525  /* For now, assume we are above any joins, so no parameterization */
3526  pathnode->path.param_info = NULL;
3527  pathnode->path.parallel_aware = false;
3528  pathnode->path.parallel_safe = false;
3529  pathnode->path.parallel_workers = 0;
3530  pathnode->path.pathkeys = NIL;
3531 
3532  /*
3533  * Compute cost & rowcount as sum of subpath costs & rowcounts.
3534  *
3535  * Currently, we don't charge anything extra for the actual table
3536  * modification work, nor for the WITH CHECK OPTIONS or RETURNING
3537  * expressions if any. It would only be window dressing, since
3538  * ModifyTable is always a top-level node and there is no way for the
3539  * costs to change any higher-level planning choices. But we might want
3540  * to make it look better sometime.
3541  */
3542  pathnode->path.startup_cost = 0;
3543  pathnode->path.total_cost = 0;
3544  pathnode->path.rows = 0;
3545  total_size = 0;
3546  foreach(lc, subpaths)
3547  {
3548  Path *subpath = (Path *) lfirst(lc);
3549 
3550  if (lc == list_head(subpaths)) /* first node? */
3551  pathnode->path.startup_cost = subpath->startup_cost;
3552  pathnode->path.total_cost += subpath->total_cost;
3553  pathnode->path.rows += subpath->rows;
3554  total_size += subpath->pathtarget->width * subpath->rows;
3555  }
3556 
3557  /*
3558  * Set width to the average width of the subpath outputs. XXX this is
3559  * totally wrong: we should report zero if no RETURNING, else an average
3560  * of the RETURNING tlist widths. But it's what happened historically,
3561  * and improving it is a task for another day.
3562  */
3563  if (pathnode->path.rows > 0)
3564  total_size /= pathnode->path.rows;
3565  pathnode->path.pathtarget->width = rint(total_size);
3566 
3567  pathnode->operation = operation;
3568  pathnode->canSetTag = canSetTag;
3569  pathnode->nominalRelation = nominalRelation;
3570  pathnode->rootRelation = rootRelation;
3571  pathnode->partColsUpdated = partColsUpdated;
3572  pathnode->resultRelations = resultRelations;
3573  pathnode->subpaths = subpaths;
3574  pathnode->subroots = subroots;
3575  pathnode->withCheckOptionLists = withCheckOptionLists;
3576  pathnode->returningLists = returningLists;
3577  pathnode->rowMarks = rowMarks;
3578  pathnode->onconflict = onconflict;
3579  pathnode->epqParam = epqParam;
3580 
3581  return pathnode;
3582 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
List * returningLists
Definition: pathnodes.h:1822
OnConflictExpr * onconflict
Definition: pathnodes.h:1824
Index nominalRelation
Definition: pathnodes.h:1815
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
Cost startup_cost
Definition: pathnodes.h:1155
bool partColsUpdated
Definition: pathnodes.h:1817
RelOptInfo * parent
Definition: pathnodes.h:1144
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
int64 total_size
Definition: pg_checksums.c:68
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
bool parallel_safe
Definition: pathnodes.h:1150
Index rootRelation
Definition: pathnodes.h:1816
static int list_length(const List *l)
Definition: pg_list.h:169
List * withCheckOptionLists
Definition: pathnodes.h:1821
CmdType operation
Definition: pathnodes.h:1813
List * resultRelations
Definition: pathnodes.h:1818
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_namedtuplestorescan_path()

Path* create_namedtuplestorescan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer 
)

Definition at line 2015 of file pathnode.c.

References RelOptInfo::consider_parallel, cost_namedtuplestorescan(), 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_NamedTuplestoreScan.

Referenced by set_namedtuplestore_pathlist().

2017 {
2018  Path *pathnode = makeNode(Path);
2019 
2020  pathnode->pathtype = T_NamedTuplestoreScan;
2021  pathnode->parent = rel;
2022  pathnode->pathtarget = rel->reltarget;
2023  pathnode->param_info = get_baserel_parampathinfo(root, rel,
2024  required_outer);
2025  pathnode->parallel_aware = false;
2026  pathnode->parallel_safe = rel->consider_parallel;
2027  pathnode->parallel_workers = 0;
2028  pathnode->pathkeys = NIL; /* result is always unordered */
2029 
2030  cost_namedtuplestorescan(pathnode, root, rel, pathnode->param_info);
2031 
2032  return pathnode;
2033 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1279
void cost_namedtuplestorescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1542
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
NodeTag pathtype
Definition: pathnodes.h:1142
RelOptInfo * parent
Definition: pathnodes.h:1144
List * pathkeys
Definition: pathnodes.h:1158
#define makeNode(_type_)
Definition: nodes.h:577
bool parallel_safe
Definition: pathnodes.h:1150
bool consider_parallel
Definition: pathnodes.h:673
bool parallel_aware
Definition: pathnodes.h:1149
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ create_nestloop_path()

NestPath* create_nestloop_path ( PlannerInfo root,
RelOptInfo joinrel,
JoinType  jointype,
JoinCostWorkspace workspace,