PostgreSQL Source Code  git master
pathnode.c File Reference
#include "postgres.h"
#include <math.h>
#include "foreign/fdwapi.h"
#include "miscadmin.h"
#include "nodes/extensible.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/appendinfo.h"
#include "optimizer/clauses.h"
#include "optimizer/cost.h"
#include "optimizer/optimizer.h"
#include "optimizer/pathnode.h"
#include "optimizer/paths.h"
#include "optimizer/planmain.h"
#include "optimizer/prep.h"
#include "optimizer/restrictinfo.h"
#include "optimizer/tlist.h"
#include "parser/parsetree.h"
#include "utils/lsyscache.h"
#include "utils/memutils.h"
#include "utils/selfuncs.h"
Include dependency graph for pathnode.c:

Go to the source code of this file.

Macros

#define STD_FUZZ_FACTOR   1.01
 
#define CONSIDER_PATH_STARTUP_COST(p)   ((p)->param_info == NULL ? (p)->parent->consider_startup : (p)->parent->consider_param_startup)
 
#define FLAT_COPY_PATH(newnode, node, nodetype)
 
#define ADJUST_CHILD_ATTRS(node)
 
#define REPARAMETERIZE_CHILD_PATH(path)
 
#define REPARAMETERIZE_CHILD_PATH_LIST(pathlist)
 

Enumerations

enum  PathCostComparison { COSTS_EQUAL, COSTS_BETTER1, COSTS_BETTER2, COSTS_DIFFERENT }
 

Functions

static Listtranslate_sub_tlist (List *tlist, int relid)
 
static int append_total_cost_compare (const ListCell *a, const ListCell *b)
 
static int append_startup_cost_compare (const ListCell *a, const ListCell *b)
 
static Listreparameterize_pathlist_by_child (PlannerInfo *root, List *pathlist, RelOptInfo *child_rel)
 
int compare_path_costs (Path *path1, Path *path2, CostSelector criterion)
 
int compare_fractional_path_costs (Path *path1, Path *path2, double fraction)
 
static PathCostComparison compare_path_costs_fuzzily (Path *path1, Path *path2, double fuzz_factor)
 
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)
 
GatherMergePathcreate_gather_merge_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
 
GatherPathcreate_gather_path (PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, 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_tablefuncscan_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
Pathcreate_valuesscan_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_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, 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)
 

Macro Definition Documentation

◆ ADJUST_CHILD_ATTRS

#define ADJUST_CHILD_ATTRS (   node)
Value:
((node) = \
child_rel->relids, \
child_rel->top_parent_relids))
Definition: nodes.h:525
Node * adjust_appendrel_attrs_multilevel(PlannerInfo *root, Node *node, Relids child_relids, Relids top_parent_relids)
Definition: appendinfo.c:497
Definition: pg_list.h:50

Referenced by reparameterize_path_by_child().

◆ CONSIDER_PATH_STARTUP_COST

#define CONSIDER_PATH_STARTUP_COST (   p)    ((p)->param_info == NULL ? (p)->parent->consider_startup : (p)->parent->consider_param_startup)

◆ FLAT_COPY_PATH

#define FLAT_COPY_PATH (   newnode,
  node,
  nodetype 
)
Value:
( (newnode) = makeNode(nodetype), \
memcpy((newnode), (node), sizeof(nodetype)) )
#define makeNode(_type_)
Definition: nodes.h:573

Referenced by reparameterize_path_by_child().

◆ REPARAMETERIZE_CHILD_PATH

#define REPARAMETERIZE_CHILD_PATH (   path)
Value:
do { \
(path) = reparameterize_path_by_child(root, (path), child_rel); \
if ((path) == NULL) \
return NULL; \
} while(0);
Path * reparameterize_path_by_child(PlannerInfo *root, Path *path, RelOptInfo *child_rel)
Definition: pathnode.c:3784

Referenced by reparameterize_path_by_child().

◆ REPARAMETERIZE_CHILD_PATH_LIST

#define REPARAMETERIZE_CHILD_PATH_LIST (   pathlist)
Value:
do { \
if ((pathlist) != NIL) \
{ \
(pathlist) = reparameterize_pathlist_by_child(root, (pathlist), \
child_rel); \
if ((pathlist) == NIL) \
return NULL; \
} \
} while(0);
#define NIL
Definition: pg_list.h:65
static List * reparameterize_pathlist_by_child(PlannerInfo *root, List *pathlist, RelOptInfo *child_rel)
Definition: pathnode.c:4092

Referenced by reparameterize_path_by_child().

◆ STD_FUZZ_FACTOR

#define STD_FUZZ_FACTOR   1.01

Enumeration Type Documentation

◆ PathCostComparison

Enumerator
COSTS_EQUAL 
COSTS_BETTER1 
COSTS_BETTER2 
COSTS_DIFFERENT 

Definition at line 38 of file pathnode.c.

39 {
40  COSTS_EQUAL, /* path costs are fuzzily equal */
41  COSTS_BETTER1, /* first path is cheaper than second */
42  COSTS_BETTER2, /* second path is cheaper than first */
43  COSTS_DIFFERENT /* neither path dominates the other on cost */
PathCostComparison
Definition: pathnode.c:38

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:657
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:401
void pfree(void *pointer)
Definition: mcxt.c:1056
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define Assert(condition)
Definition: c.h:739
#define lfirst(lc)
Definition: pg_list.h:190
bool parallel_safe
Definition: pathnodes.h:1120
#define STD_FUZZ_FACTOR
Definition: pathnode.c:51
bool consider_parallel
Definition: pathnodes.h:649
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:657
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:285
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#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(), 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:576
ParamPathInfo * param_info
Definition: pathnodes.h:1117
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:401
void pfree(void *pointer)
Definition: mcxt.c:1056
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1133
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:1126
List * pathkeys
Definition: pathnodes.h:1128
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
#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:655
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:648
ParamPathInfo * param_info
Definition: pathnodes.h:1117
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:285
bool consider_startup
Definition: pathnodes.h:647
Cost startup_cost
Definition: pathnodes.h:1125
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1133
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#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:655
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 3598 of file pathnode.c.

References clamp_row_est().

Referenced by create_limit_path(), and estimate_path_cost_size().

3603 {
3604  double input_rows = *rows;
3605  Cost input_startup_cost = *startup_cost;
3606  Cost input_total_cost = *total_cost;
3607 
3608  if (offset_est != 0)
3609  {
3610  double offset_rows;
3611 
3612  if (offset_est > 0)
3613  offset_rows = (double) offset_est;
3614  else
3615  offset_rows = clamp_row_est(input_rows * 0.10);
3616  if (offset_rows > *rows)
3617  offset_rows = *rows;
3618  if (input_rows > 0)
3619  *startup_cost +=
3620  (input_total_cost - input_startup_cost)
3621  * offset_rows / input_rows;
3622  *rows -= offset_rows;
3623  if (*rows < 1)
3624  *rows = 1;
3625  }
3626 
3627  if (count_est != 0)
3628  {
3629  double count_rows;
3630 
3631  if (count_est > 0)
3632  count_rows = (double) count_est;
3633  else
3634  count_rows = clamp_row_est(input_rows * 0.10);
3635  if (count_rows > *rows)
3636  count_rows = *rows;
3637  if (input_rows > 0)
3638  *total_cost = *startup_cost +
3639  (input_total_cost - input_startup_cost)
3640  * count_rows / input_rows;
3641  *rows = count_rows;
3642  if (*rows < 1)
3643  *rows = 1;
3644  }
3645 }
double clamp_row_est(double nrows)
Definition: costsize.c:187
double Cost
Definition: nodes.h:659

◆ append_startup_cost_compare()

static int append_startup_cost_compare ( const ListCell a,
const ListCell b 
)
static

Definition at line 1327 of file pathnode.c.

References bms_compare(), cmp(), compare_path_costs(), lfirst, Path::parent, RelOptInfo::relids, and STARTUP_COST.

Referenced by create_append_path().

1328 {
1329  Path *path1 = (Path *) lfirst(a);
1330  Path *path2 = (Path *) lfirst(b);
1331  int cmp;
1332 
1333  cmp = compare_path_costs(path1, path2, STARTUP_COST);
1334  if (cmp != 0)
1335  return -cmp;
1336  return bms_compare(path1->parent->relids, path2->parent->relids);
1337 }
int bms_compare(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:147
RelOptInfo * parent
Definition: pathnodes.h:1114
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:71
Relids relids
Definition: pathnodes.h:641
#define lfirst(lc)
Definition: pg_list.h:190
static int cmp(const chr *x, const chr *y, size_t len)
Definition: regc_locale.c:742

◆ append_total_cost_compare()

static int append_total_cost_compare ( const ListCell a,
const ListCell b 
)
static

Definition at line 1305 of file pathnode.c.

References bms_compare(), cmp(), compare_path_costs(), lfirst, Path::parent, RelOptInfo::relids, and TOTAL_COST.

Referenced by create_append_path().

1306 {
1307  Path *path1 = (Path *) lfirst(a);
1308  Path *path2 = (Path *) lfirst(b);
1309  int cmp;
1310 
1311  cmp = compare_path_costs(path1, path2, TOTAL_COST);
1312  if (cmp != 0)
1313  return -cmp;
1314  return bms_compare(path1->parent->relids, path2->parent->relids);
1315 }
int bms_compare(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:147
RelOptInfo * parent
Definition: pathnodes.h:1114
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:71
Relids relids
Definition: pathnodes.h:641
#define lfirst(lc)
Definition: pg_list.h:190
static int cmp(const chr *x, const chr *y, size_t len)
Definition: regc_locale.c:742

◆ apply_projection_to_path()

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

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

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

◆ calc_nestloop_required_outer()

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

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

2237 {
2238  Relids required_outer;
2239 
2240  /* inner_path can require rels from outer path, but not vice versa */
2241  Assert(!bms_overlap(outer_paramrels, innerrelids));
2242  /* easy case if inner path is not parameterized */
2243  if (!inner_paramrels)
2244  return bms_copy(outer_paramrels);
2245  /* else, form the union ... */
2246  required_outer = bms_union(outer_paramrels, inner_paramrels);
2247  /* ... and remove any mention of now-satisfied outer rels */
2248  required_outer = bms_del_members(required_outer,
2249  outerrelids);
2250  /* maintain invariant that required_outer is exactly NULL if empty */
2251  if (bms_is_empty(required_outer))
2252  {
2253  bms_free(required_outer);
2254  required_outer = NULL;
2255  }
2256  return required_outer;
2257 }
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:739
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 2266 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().

2267 {
2268  Relids outer_paramrels = PATH_REQ_OUTER(outer_path);
2269  Relids inner_paramrels = PATH_REQ_OUTER(inner_path);
2270  Relids required_outer;
2271 
2272  /* neither path can require rels from the other */
2273  Assert(!bms_overlap(outer_paramrels, inner_path->parent->relids));
2274  Assert(!bms_overlap(inner_paramrels, outer_path->parent->relids));
2275  /* form the union ... */
2276  required_outer = bms_union(outer_paramrels, inner_paramrels);
2277  /* we do not need an explicit test for empty; bms_union gets it right */
2278  return required_outer;
2279 }
RelOptInfo * parent
Definition: pathnodes.h:1114
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1133
Relids relids
Definition: pathnodes.h:641
#define Assert(condition)
Definition: c.h:739
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:1125
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:71
Cost total_cost
Definition: pathnodes.h:1126
double Cost
Definition: nodes.h:659

◆ 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:1125
Cost total_cost
Definition: pathnodes.h:1126

◆ compare_path_costs_fuzzily()

static PathCostComparison compare_path_costs_fuzzily ( Path path1,
Path path2,
double  fuzz_factor 
)
static

Definition at line 166 of file pathnode.c.

References CONSIDER_PATH_STARTUP_COST, COSTS_BETTER1, COSTS_BETTER2, COSTS_DIFFERENT, COSTS_EQUAL, Path::startup_cost, and Path::total_cost.

Referenced by add_path().

167 {
168 #define CONSIDER_PATH_STARTUP_COST(p) \
169  ((p)->param_info == NULL ? (p)->parent->consider_startup : (p)->parent->consider_param_startup)
170 
171  /*
172  * Check total cost first since it's more likely to be different; many
173  * paths have zero startup cost.
174  */
175  if (path1->total_cost > path2->total_cost * fuzz_factor)
176  {
177  /* path1 fuzzily worse on total cost */
178  if (CONSIDER_PATH_STARTUP_COST(path1) &&
179  path2->startup_cost > path1->startup_cost * fuzz_factor)
180  {
181  /* ... but path2 fuzzily worse on startup, so DIFFERENT */
182  return COSTS_DIFFERENT;
183  }
184  /* else path2 dominates */
185  return COSTS_BETTER2;
186  }
187  if (path2->total_cost > path1->total_cost * fuzz_factor)
188  {
189  /* path2 fuzzily worse on total cost */
190  if (CONSIDER_PATH_STARTUP_COST(path2) &&
191  path1->startup_cost > path2->startup_cost * fuzz_factor)
192  {
193  /* ... but path1 fuzzily worse on startup, so DIFFERENT */
194  return COSTS_DIFFERENT;
195  }
196  /* else path1 dominates */
197  return COSTS_BETTER1;
198  }
199  /* fuzzily the same on total cost ... */
200  if (path1->startup_cost > path2->startup_cost * fuzz_factor)
201  {
202  /* ... but path1 fuzzily worse on startup, so path2 wins */
203  return COSTS_BETTER2;
204  }
205  if (path2->startup_cost > path1->startup_cost * fuzz_factor)
206  {
207  /* ... but path2 fuzzily worse on startup, so path1 wins */
208  return COSTS_BETTER1;
209  }
210  /* fuzzily the same on both costs */
211  return COSTS_EQUAL;
212 
213 #undef CONSIDER_PATH_STARTUP_COST
214 }
Cost startup_cost
Definition: pathnodes.h:1125
Cost total_cost
Definition: pathnodes.h:1126
#define CONSIDER_PATH_STARTUP_COST(p)

◆ 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 2921 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, and Path::total_cost.

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

2931 {
2932  AggPath *pathnode = makeNode(AggPath);
2933 
2934  pathnode->path.pathtype = T_Agg;
2935  pathnode->path.parent = rel;
2936  pathnode->path.pathtarget = target;
2937  /* For now, assume we are above any joins, so no parameterization */
2938  pathnode->path.param_info = NULL;
2939  pathnode->path.parallel_aware = false;
2940  pathnode->path.parallel_safe = rel->consider_parallel &&
2941  subpath->parallel_safe;
2942  pathnode->path.parallel_workers = subpath->parallel_workers;
2943  if (aggstrategy == AGG_SORTED)
2944  pathnode->path.pathkeys = subpath->pathkeys; /* preserves order */
2945  else
2946  pathnode->path.pathkeys = NIL; /* output is unordered */
2947  pathnode->subpath = subpath;
2948 
2949  pathnode->aggstrategy = aggstrategy;
2950  pathnode->aggsplit = aggsplit;
2951  pathnode->numGroups = numGroups;
2952  pathnode->groupClause = groupClause;
2953  pathnode->qual = qual;
2954 
2955  cost_agg(&pathnode->path, root,
2956  aggstrategy, aggcosts,
2957  list_length(groupClause), numGroups,
2958  qual,
2959  subpath->startup_cost, subpath->total_cost,
2960  subpath->rows);
2961 
2962  /* add tlist eval cost for each output row */
2963  pathnode->path.startup_cost += target->cost.startup;
2964  pathnode->path.total_cost += target->cost.startup +
2965  target->cost.per_tuple * pathnode->path.rows;
2966 
2967  return pathnode;
2968 }
#define NIL
Definition: pg_list.h:65
Definition: nodes.h:78
PathTarget * pathtarget
Definition: pathnodes.h:1115
AggStrategy aggstrategy
Definition: pathnodes.h:1661
List * qual
Definition: pathnodes.h:1665
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)
Definition: costsize.c:2151
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
AggSplit aggsplit
Definition: pathnodes.h:1662
double numGroups
Definition: pathnodes.h:1663
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
Cost per_tuple
Definition: pathnodes.h:46
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
List * groupClause
Definition: pathnodes.h:1664
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:649
Path * subpath
Definition: pathnodes.h:1660
bool parallel_aware
Definition: pathnodes.h:1119
Path path
Definition: pathnodes.h:1659
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:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
RelOptKind reloptkind
Definition: pathnodes.h:638
double limit_tuples
Definition: pathnodes.h:1377
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * list_copy(const List *oldlist)
Definition: list.c:1404
List * list_concat(List *list1, const List *list2)
Definition: list.c:516
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:1376
NodeTag pathtype
Definition: pathnodes.h:1112
List * subpaths
Definition: pathnodes.h:1374
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:225
double limit_tuples
Definition: pathnodes.h:335
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1133
Relids relids
Definition: pathnodes.h:641
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
#define lfirst(lc)
Definition: pg_list.h:190
void cost_append(AppendPath *apath)
Definition: costsize.c:1875
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:649
List * partitioned_rels
Definition: pathnodes.h:1373
void list_sort(List *list, list_sort_comparator cmp)
Definition: list.c:1482
bool parallel_aware
Definition: pathnodes.h:1119
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1561
struct PathTarget * reltarget
Definition: pathnodes.h:652
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:1115
int parallel_workers
Definition: pathnodes.h:1121
void cost_bitmap_and_node(BitmapAndPath *path, PlannerInfo *root)
Definition: costsize.c:1084
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * bitmapquals
Definition: pathnodes.h:1262
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ 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:1115
void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info, Path *bitmapqual, double loop_count)
Definition: costsize.c:940
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
#define true
Definition: c.h:313
RelOptInfo * parent
Definition: pathnodes.h:1114
Path * bitmapqual
Definition: pathnodes.h:1250
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ 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:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * bitmapquals
Definition: pathnodes.h:1275
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
void cost_bitmap_or_node(BitmapOrPath *path, PlannerInfo *root)
Definition: costsize.c:1128
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_ctescan_path()

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

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

1990 {
1991  Path *pathnode = makeNode(Path);
1992 
1993  pathnode->pathtype = T_CteScan;
1994  pathnode->parent = rel;
1995  pathnode->pathtarget = rel->reltarget;
1996  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1997  required_outer);
1998  pathnode->parallel_aware = false;
1999  pathnode->parallel_safe = rel->consider_parallel;
2000  pathnode->parallel_workers = 0;
2001  pathnode->pathkeys = NIL; /* XXX for now, result is always unordered */
2002 
2003  cost_ctescan(pathnode, root, rel, pathnode->param_info);
2004 
2005  return pathnode;
2006 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
void cost_ctescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1498
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

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

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

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

2199 {
2200  ForeignPath *pathnode = makeNode(ForeignPath);
2201 
2202  /*
2203  * Upper relations should never have any lateral references, since joining
2204  * is complete.
2205  */
2207 
2208  pathnode->path.pathtype = T_ForeignScan;
2209  pathnode->path.parent = rel;
2210  pathnode->path.pathtarget = target ? target : rel->reltarget;
2211  pathnode->path.param_info = NULL;
2212  pathnode->path.parallel_aware = false;
2213  pathnode->path.parallel_safe = rel->consider_parallel;
2214  pathnode->path.parallel_workers = 0;
2215  pathnode->path.rows = rows;
2216  pathnode->path.startup_cost = startup_cost;
2217  pathnode->path.total_cost = total_cost;
2218  pathnode->path.pathkeys = pathkeys;
2219 
2220  pathnode->fdw_outerpath = fdw_outerpath;
2221  pathnode->fdw_private = fdw_private;
2222 
2223  return pathnode;
2224 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
Path * fdw_outerpath
Definition: pathnodes.h:1319
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
Relids lateral_relids
Definition: pathnodes.h:666
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
List * fdw_private
Definition: pathnodes.h:1320
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

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

2106 {
2107  ForeignPath *pathnode = makeNode(ForeignPath);
2108 
2109  /* Historically some FDWs were confused about when to use this */
2110  Assert(IS_SIMPLE_REL(rel));
2111 
2112  pathnode->path.pathtype = T_ForeignScan;
2113  pathnode->path.parent = rel;
2114  pathnode->path.pathtarget = target ? target : rel->reltarget;
2115  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
2116  required_outer);
2117  pathnode->path.parallel_aware = false;
2118  pathnode->path.parallel_safe = rel->consider_parallel;
2119  pathnode->path.parallel_workers = 0;
2120  pathnode->path.rows = rows;
2121  pathnode->path.startup_cost = startup_cost;
2122  pathnode->path.total_cost = total_cost;
2123  pathnode->path.pathkeys = pathkeys;
2124 
2125  pathnode->fdw_outerpath = fdw_outerpath;
2126  pathnode->fdw_private = fdw_private;
2127 
2128  return pathnode;
2129 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
Path * fdw_outerpath
Definition: pathnodes.h:1319
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:614
NodeTag pathtype
Definition: pathnodes.h:1112
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
List * fdw_private
Definition: pathnodes.h:1320
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_functionscan_path()

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

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

1913 {
1914  Path *pathnode = makeNode(Path);
1915 
1916  pathnode->pathtype = T_FunctionScan;
1917  pathnode->parent = rel;
1918  pathnode->pathtarget = rel->reltarget;
1919  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1920  required_outer);
1921  pathnode->parallel_aware = false;
1922  pathnode->parallel_safe = rel->consider_parallel;
1923  pathnode->parallel_workers = 0;
1924  pathnode->pathkeys = pathkeys;
1925 
1926  cost_functionscan(pathnode, root, rel, pathnode->param_info);
1927 
1928  return pathnode;
1929 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
void cost_functionscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1331
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ 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 1753 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(), and generate_gather_paths().

1756 {
1758  Cost input_startup_cost = 0;
1759  Cost input_total_cost = 0;
1760 
1761  Assert(subpath->parallel_safe);
1762  Assert(pathkeys);
1763 
1764  pathnode->path.pathtype = T_GatherMerge;
1765  pathnode->path.parent = rel;
1766  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1767  required_outer);
1768  pathnode->path.parallel_aware = false;
1769 
1770  pathnode->subpath = subpath;
1771  pathnode->num_workers = subpath->parallel_workers;
1772  pathnode->path.pathkeys = pathkeys;
1773  pathnode->path.pathtarget = target ? target : rel->reltarget;
1774  pathnode->path.rows += subpath->rows;
1775 
1776  if (pathkeys_contained_in(pathkeys, subpath->pathkeys))
1777  {
1778  /* Subpath is adequately ordered, we won't need to sort it */
1779  input_startup_cost += subpath->startup_cost;
1780  input_total_cost += subpath->total_cost;
1781  }
1782  else
1783  {
1784  /* We'll need to insert a Sort node, so include cost for that */
1785  Path sort_path; /* dummy for result of cost_sort */
1786 
1787  cost_sort(&sort_path,
1788  root,
1789  pathkeys,
1790  subpath->total_cost,
1791  subpath->rows,
1792  subpath->pathtarget->width,
1793  0.0,
1794  work_mem,
1795  -1);
1796  input_startup_cost += sort_path.startup_cost;
1797  input_total_cost += sort_path.total_cost;
1798  }
1799 
1800  cost_gather_merge(pathnode, root, rel, pathnode->path.param_info,
1801  input_startup_cost, input_total_cost, rows);
1802 
1803  return pathnode;
1804 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
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:401
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
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:1693
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652
double Cost
Definition: nodes.h:659
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 1844 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().

1846 {
1847  GatherPath *pathnode = makeNode(GatherPath);
1848 
1849  Assert(subpath->parallel_safe);
1850 
1851  pathnode->path.pathtype = T_Gather;
1852  pathnode->path.parent = rel;
1853  pathnode->path.pathtarget = target;
1854  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1855  required_outer);
1856  pathnode->path.parallel_aware = false;
1857  pathnode->path.parallel_safe = false;
1858  pathnode->path.parallel_workers = 0;
1859  pathnode->path.pathkeys = NIL; /* Gather has unordered result */
1860 
1861  pathnode->subpath = subpath;
1862  pathnode->num_workers = subpath->parallel_workers;
1863  pathnode->single_copy = false;
1864 
1865  if (pathnode->num_workers == 0)
1866  {
1867  pathnode->path.pathkeys = subpath->pathkeys;
1868  pathnode->num_workers = 1;
1869  pathnode->single_copy = true;
1870  }
1871 
1872  cost_gather(pathnode, root, rel, pathnode->path.param_info, rows);
1873 
1874  return pathnode;
1875 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
bool single_copy
Definition: pathnodes.h:1466
int num_workers
Definition: pathnodes.h:1467
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
Path * subpath
Definition: pathnodes.h:1465
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
bool parallel_safe
Definition: pathnodes.h:1120
void cost_gather(GatherPath *path, PlannerInfo *root, RelOptInfo *rel, ParamPathInfo *param_info, double *rows)
Definition: costsize.c:363
Definition: nodes.h:81
bool parallel_aware
Definition: pathnodes.h:1119
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 2810 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().

2816 {
2817  GroupPath *pathnode = makeNode(GroupPath);
2818  PathTarget *target = rel->reltarget;
2819 
2820  pathnode->path.pathtype = T_Group;
2821  pathnode->path.parent = rel;
2822  pathnode->path.pathtarget = target;
2823  /* For now, assume we are above any joins, so no parameterization */
2824  pathnode->path.param_info = NULL;
2825  pathnode->path.parallel_aware = false;
2826  pathnode->path.parallel_safe = rel->consider_parallel &&
2827  subpath->parallel_safe;
2828  pathnode->path.parallel_workers = subpath->parallel_workers;
2829  /* Group doesn't change sort ordering */
2830  pathnode->path.pathkeys = subpath->pathkeys;
2831 
2832  pathnode->subpath = subpath;
2833 
2834  pathnode->groupClause = groupClause;
2835  pathnode->qual = qual;
2836 
2837  cost_group(&pathnode->path, root,
2838  list_length(groupClause),
2839  numGroups,
2840  qual,
2841  subpath->startup_cost, subpath->total_cost,
2842  subpath->rows);
2843 
2844  /* add tlist eval cost for each output row */
2845  pathnode->path.startup_cost += target->cost.startup;
2846  pathnode->path.total_cost += target->cost.startup +
2847  target->cost.per_tuple * pathnode->path.rows;
2848 
2849  return pathnode;
2850 }
List * qual
Definition: pathnodes.h:1634
PathTarget * pathtarget
Definition: pathnodes.h:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
Cost per_tuple
Definition: pathnodes.h:46
Cost startup_cost
Definition: pathnodes.h:1125
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:2346
RelOptInfo * parent
Definition: pathnodes.h:1114
Definition: nodes.h:77
Path path
Definition: pathnodes.h:1631
List * groupClause
Definition: pathnodes.h:1633
Path * subpath
Definition: pathnodes.h:1632
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652
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:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
Cost per_tuple
Definition: pathnodes.h:46
Definition: nodes.h:46
void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root)
Definition: costsize.c:3819
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
bool consider_parallel
Definition: pathnodes.h:649
double cpu_tuple_cost
Definition: costsize.c:112
bool parallel_aware
Definition: pathnodes.h:1119

◆ 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 2987 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, PathTarget::width, and work_mem.

Referenced by consider_groupingsets_paths().

2995 {
2997  PathTarget *target = rel->reltarget;
2998  ListCell *lc;
2999  bool is_first = true;
3000  bool is_first_sort = true;
3001 
3002  /* The topmost generated Plan node will be an Agg */
3003  pathnode->path.pathtype = T_Agg;
3004  pathnode->path.parent = rel;
3005  pathnode->path.pathtarget = target;
3006  pathnode->path.param_info = subpath->param_info;
3007  pathnode->path.parallel_aware = false;
3008  pathnode->path.parallel_safe = rel->consider_parallel &&
3009  subpath->parallel_safe;
3010  pathnode->path.parallel_workers = subpath->parallel_workers;
3011  pathnode->subpath = subpath;
3012 
3013  /*
3014  * Simplify callers by downgrading AGG_SORTED to AGG_PLAIN, and AGG_MIXED
3015  * to AGG_HASHED, here if possible.
3016  */
3017  if (aggstrategy == AGG_SORTED &&
3018  list_length(rollups) == 1 &&
3019  ((RollupData *) linitial(rollups))->groupClause == NIL)
3020  aggstrategy = AGG_PLAIN;
3021 
3022  if (aggstrategy == AGG_MIXED &&
3023  list_length(rollups) == 1)
3024  aggstrategy = AGG_HASHED;
3025 
3026  /*
3027  * Output will be in sorted order by group_pathkeys if, and only if, there
3028  * is a single rollup operation on a non-empty list of grouping
3029  * expressions.
3030  */
3031  if (aggstrategy == AGG_SORTED && list_length(rollups) == 1)
3032  pathnode->path.pathkeys = root->group_pathkeys;
3033  else
3034  pathnode->path.pathkeys = NIL;
3035 
3036  pathnode->aggstrategy = aggstrategy;
3037  pathnode->rollups = rollups;
3038  pathnode->qual = having_qual;
3039 
3040  Assert(rollups != NIL);
3041  Assert(aggstrategy != AGG_PLAIN || list_length(rollups) == 1);
3042  Assert(aggstrategy != AGG_MIXED || list_length(rollups) > 1);
3043 
3044  foreach(lc, rollups)
3045  {
3046  RollupData *rollup = lfirst(lc);
3047  List *gsets = rollup->gsets;
3048  int numGroupCols = list_length(linitial(gsets));
3049 
3050  /*
3051  * In AGG_SORTED or AGG_PLAIN mode, the first rollup takes the
3052  * (already-sorted) input, and following ones do their own sort.
3053  *
3054  * In AGG_HASHED mode, there is one rollup for each grouping set.
3055  *
3056  * In AGG_MIXED mode, the first rollups are hashed, the first
3057  * non-hashed one takes the (already-sorted) input, and following ones
3058  * do their own sort.
3059  */
3060  if (is_first)
3061  {
3062  cost_agg(&pathnode->path, root,
3063  aggstrategy,
3064  agg_costs,
3065  numGroupCols,
3066  rollup->numGroups,
3067  having_qual,
3068  subpath->startup_cost,
3069  subpath->total_cost,
3070  subpath->rows);
3071  is_first = false;
3072  if (!rollup->is_hashed)
3073  is_first_sort = false;
3074  }
3075  else
3076  {
3077  Path sort_path; /* dummy for result of cost_sort */
3078  Path agg_path; /* dummy for result of cost_agg */
3079 
3080  if (rollup->is_hashed || is_first_sort)
3081  {
3082  /*
3083  * Account for cost of aggregation, but don't charge input
3084  * cost again
3085  */
3086  cost_agg(&agg_path, root,
3087  rollup->is_hashed ? AGG_HASHED : AGG_SORTED,
3088  agg_costs,
3089  numGroupCols,
3090  rollup->numGroups,
3091  having_qual,
3092  0.0, 0.0,
3093  subpath->rows);
3094  if (!rollup->is_hashed)
3095  is_first_sort = false;
3096  }
3097  else
3098  {
3099  /* Account for cost of sort, but don't charge input cost again */
3100  cost_sort(&sort_path, root, NIL,
3101  0.0,
3102  subpath->rows,
3103  subpath->pathtarget->width,
3104  0.0,
3105  work_mem,
3106  -1.0);
3107 
3108  /* Account for cost of aggregation */
3109 
3110  cost_agg(&agg_path, root,
3111  AGG_SORTED,
3112  agg_costs,
3113  numGroupCols,
3114  rollup->numGroups,
3115  having_qual,
3116  sort_path.startup_cost,
3117  sort_path.total_cost,
3118  sort_path.rows);
3119  }
3120 
3121  pathnode->path.total_cost += agg_path.total_cost;
3122  pathnode->path.rows += agg_path.rows;
3123  }
3124  }
3125 
3126  /* add tlist eval cost for each output row */
3127  pathnode->path.startup_cost += target->cost.startup;
3128  pathnode->path.total_cost += target->cost.startup +
3129  target->cost.per_tuple * pathnode->path.rows;
3130 
3131  return pathnode;
3132 }
List * group_pathkeys
Definition: pathnodes.h:298
#define NIL
Definition: pg_list.h:65
Definition: nodes.h:78
PathTarget * pathtarget
Definition: pathnodes.h:1115
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)
Definition: costsize.c:2151
int parallel_workers
Definition: pathnodes.h:1121
bool is_hashed
Definition: pathnodes.h:1687
ParamPathInfo * param_info
Definition: pathnodes.h:1117
double numGroups
Definition: pathnodes.h:1685
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
Cost per_tuple
Definition: pathnodes.h:46
#define linitial(l)
Definition: pg_list.h:195
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
AggStrategy aggstrategy
Definition: pathnodes.h:1698
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:1693
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:652
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
List * gsets
Definition: pathnodes.h:1683

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

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

◆ 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:1180
PathTarget * pathtarget
Definition: pathnodes.h:1115
Path path
Definition: pathnodes.h:1176
IndexOptInfo * indexinfo
Definition: pathnodes.h:1177
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * indexclauses
Definition: pathnodes.h:1178
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * rel
Definition: pathnodes.h:791
RelOptInfo * parent
Definition: pathnodes.h:1114
void cost_index(IndexPath *path, PlannerInfo *root, double loop_count, bool partial_path)
Definition: costsize.c:476
List * indexorderbys
Definition: pathnodes.h:1179
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
ScanDirection indexscandir
Definition: pathnodes.h:1181
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_limit_path()

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

Definition at line 3545 of file pathnode.c.

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

3549 {
3550  LimitPath *pathnode = makeNode(LimitPath);
3551 
3552  pathnode->path.pathtype = T_Limit;
3553  pathnode->path.parent = rel;
3554  /* Limit doesn't project, so use source path's pathtarget */
3555  pathnode->path.pathtarget = subpath->pathtarget;
3556  /* For now, assume we are above any joins, so no parameterization */
3557  pathnode->path.param_info = NULL;
3558  pathnode->path.parallel_aware = false;
3559  pathnode->path.parallel_safe = rel->consider_parallel &&
3560  subpath->parallel_safe;
3561  pathnode->path.parallel_workers = subpath->parallel_workers;
3562  pathnode->path.rows = subpath->rows;
3563  pathnode->path.startup_cost = subpath->startup_cost;
3564  pathnode->path.total_cost = subpath->total_cost;
3565  pathnode->path.pathkeys = subpath->pathkeys;
3566  pathnode->subpath = subpath;
3567  pathnode->limitOffset = limitOffset;
3568  pathnode->limitCount = limitCount;
3569 
3570  /*
3571  * Adjust the output rows count and costs according to the offset/limit.
3572  */
3573  adjust_limit_rows_costs(&pathnode->path.rows,
3574  &pathnode->path.startup_cost,
3575  &pathnode->path.total_cost,
3576  offset_est, count_est);
3577 
3578  return pathnode;
3579 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
Node * limitOffset
Definition: pathnodes.h:1794
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
void adjust_limit_rows_costs(double *rows, Cost *startup_cost, Cost *total_cost, int64 offset_est, int64 count_est)
Definition: pathnode.c:3598
NodeTag pathtype
Definition: pathnodes.h:1112
Cost startup_cost
Definition: pathnodes.h:1125
Path * subpath
Definition: pathnodes.h:1793
RelOptInfo * parent
Definition: pathnodes.h:1114
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
Path path
Definition: pathnodes.h:1792
bool parallel_aware
Definition: pathnodes.h:1119
Node * limitCount
Definition: pathnodes.h:1795
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
Definition: nodes.h:86

◆ create_lockrows_path()

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

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

3386 {
3387  LockRowsPath *pathnode = makeNode(LockRowsPath);
3388 
3389  pathnode->path.pathtype = T_LockRows;
3390  pathnode->path.parent = rel;
3391  /* LockRows doesn't project, so use source path's pathtarget */
3392  pathnode->path.pathtarget = subpath->pathtarget;
3393  /* For now, assume we are above any joins, so no parameterization */
3394  pathnode->path.param_info = NULL;
3395  pathnode->path.parallel_aware = false;
3396  pathnode->path.parallel_safe = false;
3397  pathnode->path.parallel_workers = 0;
3398  pathnode->path.rows = subpath->rows;
3399 
3400  /*
3401  * The result cannot be assumed sorted, since locking might cause the sort
3402  * key columns to be replaced with new values.
3403  */
3404  pathnode->path.pathkeys = NIL;
3405 
3406  pathnode->subpath = subpath;
3407  pathnode->rowMarks = rowMarks;
3408  pathnode->epqParam = epqParam;
3409 
3410  /*
3411  * We should charge something extra for the costs of row locking and
3412  * possible refetches, but it's hard to say how much. For now, use
3413  * cpu_tuple_cost per row.
3414  */
3415  pathnode->path.startup_cost = subpath->startup_cost;
3416  pathnode->path.total_cost = subpath->total_cost +
3417  cpu_tuple_cost * subpath->rows;
3418 
3419  return pathnode;
3420 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * rowMarks
Definition: pathnodes.h:1758
NodeTag pathtype
Definition: pathnodes.h:1112
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
Path * subpath
Definition: pathnodes.h:1757
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
double cpu_tuple_cost
Definition: costsize.c:112
bool parallel_aware
Definition: pathnodes.h:1119
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:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
Path * subpath
Definition: pathnodes.h:1426
NodeTag pathtype
Definition: pathnodes.h:1112
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
Cost total_cost
Definition: pathnodes.h:1126
void cost_material(Path *path, Cost input_startup_cost, Cost input_total_cost, double tuples, int width)
Definition: costsize.c:2097
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652
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:1115
double tuples
Definition: pathnodes.h:681
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * list_copy(const List *oldlist)
Definition: list.c:1404
List * partitioned_rels
Definition: pathnodes.h:1399
NodeTag pathtype
Definition: pathnodes.h:1112
Relids all_baserels
Definition: pathnodes.h:225
double limit_tuples
Definition: pathnodes.h:335
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1133
Relids relids
Definition: pathnodes.h:641
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:1693
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
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:2048
#define Assert(condition)
Definition: c.h:739
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
ParamPathInfo * get_appendrel_parampathinfo(RelOptInfo *appendrel, Relids required_outer)
Definition: relnode.c:1561
struct PathTarget * reltarget
Definition: pathnodes.h:652
double limit_tuples
Definition: pathnodes.h:1401
double Cost
Definition: nodes.h:659
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 2387 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().

2400 {
2401  MergePath *pathnode = makeNode(MergePath);
2402 
2403  pathnode->jpath.path.pathtype = T_MergeJoin;
2404  pathnode->jpath.path.parent = joinrel;
2405  pathnode->jpath.path.pathtarget = joinrel->reltarget;
2406  pathnode->jpath.path.param_info =
2408  joinrel,
2409  outer_path,
2410  inner_path,
2411  extra->sjinfo,
2412  required_outer,
2413  &restrict_clauses);
2414  pathnode->jpath.path.parallel_aware = false;
2415  pathnode->jpath.path.parallel_safe = joinrel->consider_parallel &&
2416  outer_path->parallel_safe && inner_path->parallel_safe;
2417  /* This is a foolish way to estimate parallel_workers, but for now... */
2418  pathnode->jpath.path.parallel_workers = outer_path->parallel_workers;
2419  pathnode->jpath.path.pathkeys = pathkeys;
2420  pathnode->jpath.jointype = jointype;
2421  pathnode->jpath.inner_unique = extra->inner_unique;
2422  pathnode->jpath.outerjoinpath = outer_path;
2423  pathnode->jpath.innerjoinpath = inner_path;
2424  pathnode->jpath.joinrestrictinfo = restrict_clauses;
2425  pathnode->path_mergeclauses = mergeclauses;
2426  pathnode->outersortkeys = outersortkeys;
2427  pathnode->innersortkeys = innersortkeys;
2428  /* pathnode->skip_mark_restore will be set by final_cost_mergejoin */
2429  /* pathnode->materialize_inner will be set by final_cost_mergejoin */
2430 
2431  final_cost_mergejoin(root, pathnode, workspace, extra);
2432 
2433  return pathnode;
2434 }
List * path_mergeclauses
Definition: pathnodes.h:1551
List * outersortkeys
Definition: pathnodes.h:1552
PathTarget * pathtarget
Definition: pathnodes.h:1115
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:1354
Path * innerjoinpath
Definition: pathnodes.h:1496
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
SpecialJoinInfo * sjinfo
Definition: pathnodes.h:2385
List * joinrestrictinfo
Definition: pathnodes.h:1498
RelOptInfo * parent
Definition: pathnodes.h:1114
Path * outerjoinpath
Definition: pathnodes.h:1495
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
Path path
Definition: pathnodes.h:1488
bool parallel_safe
Definition: pathnodes.h:1120
bool inner_unique
Definition: pathnodes.h:1492
bool consider_parallel
Definition: pathnodes.h:649
List * innersortkeys
Definition: pathnodes.h:1553
JoinType jointype
Definition: pathnodes.h:1490
JoinPath jpath
Definition: pathnodes.h:1550
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652
void final_cost_mergejoin(PlannerInfo *root, MergePath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
Definition: costsize.c:2928

◆ create_minmaxagg_path()

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

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

3149 {
3150  MinMaxAggPath *pathnode = makeNode(MinMaxAggPath);
3151  Cost initplan_cost;
3152  ListCell *lc;
3153 
3154  /* The topmost generated Plan node will be a Result */
3155  pathnode->path.pathtype = T_Result;
3156  pathnode->path.parent = rel;
3157  pathnode->path.pathtarget = target;
3158  /* For now, assume we are above any joins, so no parameterization */
3159  pathnode->path.param_info = NULL;
3160  pathnode->path.parallel_aware = false;
3161  /* A MinMaxAggPath implies use of subplans, so cannot be parallel-safe */
3162  pathnode->path.parallel_safe = false;
3163  pathnode->path.parallel_workers = 0;
3164  /* Result is one unordered row */
3165  pathnode->path.rows = 1;
3166  pathnode->path.pathkeys = NIL;
3167 
3168  pathnode->mmaggregates = mmaggregates;
3169  pathnode->quals = quals;
3170 
3171  /* Calculate cost of all the initplans ... */
3172  initplan_cost = 0;
3173  foreach(lc, mmaggregates)
3174  {
3175  MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);
3176 
3177  initplan_cost += mminfo->pathcost;
3178  }
3179 
3180  /* add tlist eval cost for each output row, plus cpu_tuple_cost */
3181  pathnode->path.startup_cost = initplan_cost + target->cost.startup;
3182  pathnode->path.total_cost = initplan_cost + target->cost.startup +
3183  target->cost.per_tuple + cpu_tuple_cost;
3184 
3185  /*
3186  * Add cost of qual, if any --- but we ignore its selectivity, since our
3187  * rowcount estimate should be 1 no matter what the qual is.
3188  */
3189  if (quals)
3190  {
3191  QualCost qual_cost;
3192 
3193  cost_qual_eval(&qual_cost, quals, root);
3194  pathnode->path.startup_cost += qual_cost.startup;
3195  pathnode->path.total_cost += qual_cost.startup + qual_cost.per_tuple;
3196  }
3197 
3198  return pathnode;
3199 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
List * quals
Definition: pathnodes.h:1710
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
Cost per_tuple
Definition: pathnodes.h:46
Definition: nodes.h:46
void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root)
Definition: costsize.c:3819
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
List * mmaggregates
Definition: pathnodes.h:1709
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
double cpu_tuple_cost
Definition: costsize.c:112
bool parallel_aware
Definition: pathnodes.h:1119
double Cost
Definition: nodes.h:659

◆ 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 3443 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, rint(), 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().

3452 {
3454  double total_size;
3455  ListCell *lc;
3456 
3457  Assert(list_length(resultRelations) == list_length(subpaths));
3458  Assert(list_length(resultRelations) == list_length(subroots));
3459  Assert(withCheckOptionLists == NIL ||
3460  list_length(resultRelations) == list_length(withCheckOptionLists));
3461  Assert(returningLists == NIL ||
3462  list_length(resultRelations) == list_length(returningLists));
3463 
3464  pathnode->path.pathtype = T_ModifyTable;
3465  pathnode->path.parent = rel;
3466  /* pathtarget is not interesting, just make it minimally valid */
3467  pathnode->path.pathtarget = rel->reltarget;
3468  /* For now, assume we are above any joins, so no parameterization */
3469  pathnode->path.param_info = NULL;
3470  pathnode->path.parallel_aware = false;
3471  pathnode->path.parallel_safe = false;
3472  pathnode->path.parallel_workers = 0;
3473  pathnode->path.pathkeys = NIL;
3474 
3475  /*
3476  * Compute cost & rowcount as sum of subpath costs & rowcounts.
3477  *
3478  * Currently, we don't charge anything extra for the actual table
3479  * modification work, nor for the WITH CHECK OPTIONS or RETURNING
3480  * expressions if any. It would only be window dressing, since
3481  * ModifyTable is always a top-level node and there is no way for the
3482  * costs to change any higher-level planning choices. But we might want
3483  * to make it look better sometime.
3484  */
3485  pathnode->path.startup_cost = 0;
3486  pathnode->path.total_cost = 0;
3487  pathnode->path.rows = 0;
3488  total_size = 0;
3489  foreach(lc, subpaths)
3490  {
3491  Path *subpath = (Path *) lfirst(lc);
3492 
3493  if (lc == list_head(subpaths)) /* first node? */
3494  pathnode->path.startup_cost = subpath->startup_cost;
3495  pathnode->path.total_cost += subpath->total_cost;
3496  pathnode->path.rows += subpath->rows;
3497  total_size += subpath->pathtarget->width * subpath->rows;
3498  }
3499 
3500  /*
3501  * Set width to the average width of the subpath outputs. XXX this is
3502  * totally wrong: we should report zero if no RETURNING, else an average
3503  * of the RETURNING tlist widths. But it's what happened historically,
3504  * and improving it is a task for another day.
3505  */
3506  if (pathnode->path.rows > 0)
3507  total_size /= pathnode->path.rows;
3508  pathnode->path.pathtarget->width = rint(total_size);
3509 
3510  pathnode->operation = operation;
3511  pathnode->canSetTag = canSetTag;
3512  pathnode->nominalRelation = nominalRelation;
3513  pathnode->rootRelation = rootRelation;
3514  pathnode->partColsUpdated = partColsUpdated;
3515  pathnode->resultRelations = resultRelations;
3516  pathnode->subpaths = subpaths;
3517  pathnode->subroots = subroots;
3518  pathnode->withCheckOptionLists = withCheckOptionLists;
3519  pathnode->returningLists = returningLists;
3520  pathnode->rowMarks = rowMarks;
3521  pathnode->onconflict = onconflict;
3522  pathnode->epqParam = epqParam;
3523 
3524  return pathnode;
3525 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
List * returningLists
Definition: pathnodes.h:1781
OnConflictExpr * onconflict
Definition: pathnodes.h:1783
Index nominalRelation
Definition: pathnodes.h:1774
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
Cost startup_cost
Definition: pathnodes.h:1125
bool partColsUpdated
Definition: pathnodes.h:1776
RelOptInfo * parent
Definition: pathnodes.h:1114
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
double rint(double x)
Definition: rint.c:21
int64 total_size
Definition: pg_checksums.c:68
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
Index rootRelation
Definition: pathnodes.h:1775
static int list_length(const List *l)
Definition: pg_list.h:169
List * withCheckOptionLists
Definition: pathnodes.h:1780
CmdType operation
Definition: pathnodes.h:1772
List * resultRelations
Definition: pathnodes.h:1777
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652
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 2014 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().

2016 {
2017  Path *pathnode = makeNode(Path);
2018 
2019  pathnode->pathtype = T_NamedTuplestoreScan;
2020  pathnode->parent = rel;
2021  pathnode->pathtarget = rel->reltarget;
2022  pathnode->param_info = get_baserel_parampathinfo(root, rel,
2023  required_outer);
2024  pathnode->parallel_aware = false;
2025  pathnode->parallel_safe = rel->consider_parallel;
2026  pathnode->parallel_workers = 0;
2027  pathnode->pathkeys = NIL; /* result is always unordered */
2028 
2029  cost_namedtuplestorescan(pathnode, root, rel, pathnode->param_info);
2030 
2031  return pathnode;
2032 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
void cost_namedtuplestorescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1539
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_nestloop_path()

NestPath* create_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 
)

Definition at line 2299 of file pathnode.c.

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

Referenced by try_nestloop_path(), and try_partial_nestloop_path().

2309 {
2310  NestPath *pathnode = makeNode(NestPath);
2311  Relids inner_req_outer = PATH_REQ_OUTER(inner_path);
2312 
2313  /*
2314  * If the inner path is parameterized by the outer, we must drop any
2315  * restrict_clauses that are due to be moved into the inner path. We have
2316  * to do this now, rather than postpone the work till createplan time,
2317  * because the restrict_clauses list can affect the size and cost
2318  * estimates for this path.
2319  */
2320  if (bms_overlap(inner_req_outer, outer_path->parent->relids))
2321  {
2322  Relids inner_and_outer = bms_union(inner_path->parent->relids,
2323  inner_req_outer);
2324  List *jclauses = NIL;
2325  ListCell *lc;
2326 
2327  foreach(lc, restrict_clauses)
2328  {
2329  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
2330 
2331  if (!join_clause_is_movable_into(rinfo,
2332  inner_path->parent->relids,
2333  inner_and_outer))
2334  jclauses = lappend(jclauses, rinfo);
2335  }
2336  restrict_clauses = jclauses;
2337  }
2338 
2339  pathnode->path.pathtype = T_NestLoop;
2340  pathnode->path.parent = joinrel;
2341  pathnode->path.pathtarget = joinrel->reltarget;
2342  pathnode->path.param_info =
2344  joinrel,
2345  outer_path,
2346  inner_path,
2347  extra->sjinfo,
2348  required_outer,
2349  &restrict_clauses);
2350  pathnode->path.parallel_aware = false;
2351  pathnode->path.parallel_safe = joinrel->consider_parallel &&
2352  outer_path->parallel_safe && inner_path->parallel_safe;
2353  /* This is a foolish way to estimate parallel_workers, but for now... */
2354  pathnode->path.parallel_workers = outer_path->parallel_workers;
2355  pathnode->path.pathkeys = pathkeys;
2356  pathnode->jointype = jointype;
2357  pathnode->inner_unique = extra->inner_unique;
2358  pathnode->outerjoinpath = outer_path;
2359  pathnode->innerjoinpath = inner_path;
2360  pathnode->joinrestrictinfo = restrict_clauses;
2361 
2362  final_cost_nestloop(root, pathnode, workspace, extra);
2363 
2364  return pathnode;
2365 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
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:1354
Path * innerjoinpath
Definition: pathnodes.h:1496
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
void final_cost_nestloop(PlannerInfo *root, NestPath *path, JoinCostWorkspace *workspace, JoinPathExtraData *extra)
Definition: costsize.c:2491
SpecialJoinInfo * sjinfo
Definition: pathnodes.h:2385
List * joinrestrictinfo
Definition: pathnodes.h:1498
RelOptInfo * parent
Definition: pathnodes.h:1114
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1133
Relids relids
Definition: pathnodes.h:641
bool join_clause_is_movable_into(RestrictInfo *rinfo, Relids currentrelids, Relids current_and_outer)
Definition: restrictinfo.c:577
List * lappend(List *list, void *datum)
Definition: list.c:322
Path * outerjoinpath
Definition: pathnodes.h:1495
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
Path path
Definition: pathnodes.h:1488
#define lfirst(lc)
Definition: pg_list.h:190
bool parallel_safe
Definition: pathnodes.h:1120
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
bool inner_unique
Definition: pathnodes.h:1492
bool consider_parallel
Definition: pathnodes.h:649
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
JoinType jointype
Definition: pathnodes.h:1490
bool parallel_aware
Definition: pathnodes.h:1119
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_projection_path()

ProjectionPath* create_projection_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target 
)

Definition at line 2519 of file pathnode.c.

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

Referenced by adjust_paths_for_srfs(), apply_projection_to_path(), apply_scanjoin_target_to_paths(), and recurse_set_operations().

2523 {
2524  ProjectionPath *pathnode = makeNode(ProjectionPath);
2525  PathTarget *oldtarget = subpath->pathtarget;
2526 
2527  pathnode->path.pathtype = T_Result;
2528  pathnode->path.parent = rel;
2529  pathnode->path.pathtarget = target;
2530  /* For now, assume we are above any joins, so no parameterization */
2531  pathnode->path.param_info = NULL;
2532  pathnode->path.parallel_aware = false;
2533  pathnode->path.parallel_safe = rel->consider_parallel &&
2534  subpath->parallel_safe &&
2535  is_parallel_safe(root, (Node *) target->exprs);
2536  pathnode->path.parallel_workers = subpath->parallel_workers;
2537  /* Projection does not change the sort order */
2538  pathnode->path.pathkeys = subpath->pathkeys;
2539 
2540  pathnode->subpath = subpath;
2541 
2542  /*
2543  * We might not need a separate Result node. If the input plan node type
2544  * can project, we can just tell it to project something else. Or, if it
2545  * can't project but the desired target has the same expression list as
2546  * what the input will produce anyway, we can still give it the desired
2547  * tlist (possibly changing its ressortgroupref labels, but nothing else).
2548  * Note: in the latter case, create_projection_plan has to recheck our
2549  * conclusion; see comments therein.
2550  */
2551  if (is_projection_capable_path(subpath) ||
2552  equal(oldtarget->exprs, target->exprs))
2553  {
2554  /* No separate Result node needed */
2555  pathnode->dummypp = true;
2556 
2557  /*
2558  * Set cost of plan as subpath's cost, adjusted for tlist replacement.
2559  */
2560  pathnode->path.rows = subpath->rows;
2561  pathnode->path.startup_cost = subpath->startup_cost +
2562  (target->cost.startup - oldtarget->cost.startup);
2563  pathnode->path.total_cost = subpath->total_cost +
2564  (target->cost.startup - oldtarget->cost.startup) +
2565  (target->cost.per_tuple - oldtarget->cost.per_tuple) * subpath->rows;
2566  }
2567  else
2568  {
2569  /* We really do need the Result node */
2570  pathnode->dummypp = false;
2571 
2572  /*
2573  * The Result node's cost is cpu_tuple_cost per row, plus the cost of
2574  * evaluating the tlist. There is no qual to worry about.
2575  */
2576  pathnode->path.rows = subpath->rows;
2577  pathnode->path.startup_cost = subpath->startup_cost +
2578  target->cost.startup;
2579  pathnode->path.total_cost = subpath->total_cost +
2580  target->cost.startup +
2581  (cpu_tuple_cost + target->cost.per_tuple) * subpath->rows;
2582  }
2583 
2584  return pathnode;
2585 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3011
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
Definition: nodes.h:525
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:854
Cost per_tuple
Definition: pathnodes.h:46
Definition: nodes.h:46
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
List * exprs
Definition: pathnodes.h:1044
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
bool consider_parallel
Definition: pathnodes.h:649
double cpu_tuple_cost
Definition: costsize.c:112
bool is_projection_capable_path(Path *path)
Definition: createplan.c:6764
bool parallel_aware
Definition: pathnodes.h:1119
Path * subpath
Definition: pathnodes.h:1592
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_recursiveunion_path()

RecursiveUnionPath* create_recursiveunion_path ( PlannerInfo root,
RelOptInfo rel,
Path leftpath,
Path rightpath,
PathTarget target,
List distinctList,
int  wtParam,
double  numGroups 
)

Definition at line 3339 of file pathnode.c.

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

Referenced by generate_recursion_path().

3347 {
3349 
3350  pathnode->path.pathtype = T_RecursiveUnion;
3351  pathnode->path.parent = rel;
3352  pathnode->path.pathtarget = target;
3353  /* For now, assume we are above any joins, so no parameterization */
3354  pathnode->path.param_info = NULL;
3355  pathnode->path.parallel_aware = false;
3356  pathnode->path.parallel_safe = rel->consider_parallel &&
3357  leftpath->parallel_safe && rightpath->parallel_safe;
3358  /* Foolish, but we'll do it like joins for now: */
3359  pathnode->path.parallel_workers = leftpath->parallel_workers;
3360  /* RecursiveUnion result is always unsorted */
3361  pathnode->path.pathkeys = NIL;
3362 
3363  pathnode->leftpath = leftpath;
3364  pathnode->rightpath = rightpath;
3365  pathnode->distinctList = distinctList;
3366  pathnode->wtParam = wtParam;
3367  pathnode->numGroups = numGroups;
3368 
3369  cost_recursive_union(&pathnode->path, leftpath, rightpath);
3370 
3371  return pathnode;
3372 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
void cost_recursive_union(Path *runion, Path *nrterm, Path *rterm)
Definition: costsize.c:1613
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119

◆ create_resultscan_path()

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

Definition at line 2040 of file pathnode.c.

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

Referenced by reparameterize_path(), and set_result_pathlist().

2042 {
2043  Path *pathnode = makeNode(Path);
2044 
2045  pathnode->pathtype = T_Result;
2046  pathnode->parent = rel;
2047  pathnode->pathtarget = rel->reltarget;
2048  pathnode->param_info = get_baserel_parampathinfo(root, rel,
2049  required_outer);
2050  pathnode->parallel_aware = false;
2051  pathnode->parallel_safe = rel->consider_parallel;
2052  pathnode->parallel_workers = 0;
2053  pathnode->pathkeys = NIL; /* result is always unordered */
2054 
2055  cost_resultscan(pathnode, root, rel, pathnode->param_info);
2056 
2057  return pathnode;
2058 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
Definition: nodes.h:46
RelOptInfo * parent
Definition: pathnodes.h:1114
void cost_resultscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1576
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_samplescan_path()

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

Definition at line 954 of file pathnode.c.

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

Referenced by reparameterize_path(), and set_tablesample_rel_pathlist().

955 {
956  Path *pathnode = makeNode(Path);
957 
958  pathnode->pathtype = T_SampleScan;
959  pathnode->parent = rel;
960  pathnode->pathtarget = rel->reltarget;
961  pathnode->param_info = get_baserel_parampathinfo(root, rel,
962  required_outer);
963  pathnode->parallel_aware = false;
964  pathnode->parallel_safe = rel->consider_parallel;
965  pathnode->parallel_workers = 0;
966  pathnode->pathkeys = NIL; /* samplescan has unordered result */
967 
968  cost_samplescan(pathnode, root, rel, pathnode->param_info);
969 
970  return pathnode;
971 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
void cost_samplescan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:288
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_seqscan_path()

Path* create_seqscan_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer,
int  parallel_workers 
)

Definition at line 929 of file pathnode.c.

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

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

931 {
932  Path *pathnode = makeNode(Path);
933 
934  pathnode->pathtype = T_SeqScan;
935  pathnode->parent = rel;
936  pathnode->pathtarget = rel->reltarget;
937  pathnode->param_info = get_baserel_parampathinfo(root, rel,
938  required_outer);
939  pathnode->parallel_aware = parallel_workers > 0 ? true : false;
940  pathnode->parallel_safe = rel->consider_parallel;
941  pathnode->parallel_workers = parallel_workers;
942  pathnode->pathkeys = NIL; /* seqscan has unordered result */
943 
944  cost_seqscan(pathnode, root, rel, pathnode->param_info);
945 
946  return pathnode;
947 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
#define true
Definition: c.h:313
void cost_seqscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:211
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_set_projection_path()

ProjectSetPath* create_set_projection_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
PathTarget target 
)

Definition at line 2699 of file pathnode.c.

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

Referenced by adjust_paths_for_srfs().

2703 {
2704  ProjectSetPath *pathnode = makeNode(ProjectSetPath);
2705  double tlist_rows;
2706  ListCell *lc;
2707 
2708  pathnode->path.pathtype = T_ProjectSet;
2709  pathnode->path.parent = rel;
2710  pathnode->path.pathtarget = target;
2711  /* For now, assume we are above any joins, so no parameterization */
2712  pathnode->path.param_info = NULL;
2713  pathnode->path.parallel_aware = false;
2714  pathnode->path.parallel_safe = rel->consider_parallel &&
2715  subpath->parallel_safe &&
2716  is_parallel_safe(root, (Node *) target->exprs);
2717  pathnode->path.parallel_workers = subpath->parallel_workers;
2718  /* Projection does not change the sort order XXX? */
2719  pathnode->path.pathkeys = subpath->pathkeys;
2720 
2721  pathnode->subpath = subpath;
2722 
2723  /*
2724  * Estimate number of rows produced by SRFs for each row of input; if
2725  * there's more than one in this node, use the maximum.
2726  */
2727  tlist_rows = 1;
2728  foreach(lc, target->exprs)
2729  {
2730  Node *node = (Node *) lfirst(lc);
2731  double itemrows;
2732 
2733  itemrows = expression_returns_set_rows(root, node);
2734  if (tlist_rows < itemrows)
2735  tlist_rows = itemrows;
2736  }
2737 
2738  /*
2739  * In addition to the cost of evaluating the tlist, charge cpu_tuple_cost
2740  * per input row, and half of cpu_tuple_cost for each added output row.
2741  * This is slightly bizarre maybe, but it's what 9.6 did; we may revisit
2742  * this estimate later.
2743  */
2744  pathnode->path.rows = subpath->rows * tlist_rows;
2745  pathnode->path.startup_cost = subpath->startup_cost +
2746  target->cost.startup;
2747  pathnode->path.total_cost = subpath->total_cost +
2748  target->cost.startup +
2749  (cpu_tuple_cost + target->cost.per_tuple) * subpath->rows +
2750  (pathnode->path.rows - subpath->rows) * cpu_tuple_cost / 2;
2751 
2752  return pathnode;
2753 }
double expression_returns_set_rows(PlannerInfo *root, Node *clause)
Definition: clauses.c:569
PathTarget * pathtarget
Definition: pathnodes.h:1115
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
Definition: nodes.h:525
Cost startup
Definition: pathnodes.h:45
NodeTag pathtype
Definition: pathnodes.h:1112
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:854
Cost per_tuple
Definition: pathnodes.h:46
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
List * exprs
Definition: pathnodes.h:1044
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
#define lfirst(lc)
Definition: pg_list.h:190
Path * subpath
Definition: pathnodes.h:1604
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
QualCost cost
Definition: pathnodes.h:1046
bool consider_parallel
Definition: pathnodes.h:649
double cpu_tuple_cost
Definition: costsize.c:112
bool parallel_aware
Definition: pathnodes.h:1119
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_setop_path()

SetOpPath* create_setop_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
SetOpCmd  cmd,
SetOpStrategy  strategy,
List distinctList,
AttrNumber  flagColIdx,
int  firstFlag,
double  numGroups,
double  outputRows 
)

Definition at line 3277 of file pathnode.c.

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

Referenced by generate_nonunion_paths().

3287 {
3288  SetOpPath *pathnode = makeNode(SetOpPath);
3289 
3290  pathnode->path.pathtype = T_SetOp;
3291  pathnode->path.parent = rel;
3292  /* SetOp doesn't project, so use source path's pathtarget */
3293  pathnode->path.pathtarget = subpath->pathtarget;
3294  /* For now, assume we are above any joins, so no parameterization */
3295  pathnode->path.param_info = NULL;
3296  pathnode->path.parallel_aware = false;
3297  pathnode->path.parallel_safe = rel->consider_parallel &&
3298  subpath->parallel_safe;
3299  pathnode->path.parallel_workers = subpath->parallel_workers;
3300  /* SetOp preserves the input sort order if in sort mode */
3301  pathnode->path.pathkeys =
3302  (strategy == SETOP_SORTED) ? subpath->pathkeys : NIL;
3303 
3304  pathnode->subpath = subpath;
3305  pathnode->cmd = cmd;
3306  pathnode->strategy = strategy;
3307  pathnode->distinctList = distinctList;
3308  pathnode->flagColIdx = flagColIdx;
3309  pathnode->firstFlag = firstFlag;
3310  pathnode->numGroups = numGroups;
3311 
3312  /*
3313  * Charge one cpu_operator_cost per comparison per input tuple. We assume
3314  * all columns get compared at most of the tuples.
3315  */
3316  pathnode->path.startup_cost = subpath->startup_cost;
3317  pathnode->path.total_cost = subpath->total_cost +
3318  cpu_operator_cost * subpath->rows * list_length(distinctList);
3319  pathnode->path.rows = outputRows;
3320 
3321  return pathnode;
3322 }
#define NIL
Definition: pg_list.h:65
List * distinctList
Definition: pathnodes.h:1732
PathTarget * pathtarget
Definition: pathnodes.h:1115
SetOpStrategy strategy
Definition: pathnodes.h:1731
Path * subpath
Definition: pathnodes.h:1729
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
double numGroups
Definition: pathnodes.h:1735
NodeTag pathtype
Definition: pathnodes.h:1112
SetOpCmd cmd
Definition: pathnodes.h:1730
Cost startup_cost
Definition: pathnodes.h:1125
RelOptInfo * parent
Definition: pathnodes.h:1114
AttrNumber flagColIdx
Definition: pathnodes.h:1733
double cpu_operator_cost
Definition: costsize.c:114
Cost total_cost
Definition: pathnodes.h:1126
int firstFlag
Definition: pathnodes.h:1734
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:649
Definition: nodes.h:84
bool parallel_aware
Definition: pathnodes.h:1119
Path path
Definition: pathnodes.h:1728

◆ create_sort_path()

SortPath* create_sort_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List pathkeys,
double  limit_tuples 
)

Definition at line 2766 of file pathnode.c.

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

Referenced by add_paths_to_grouping_rel(), add_paths_with_pathkeys_for_rel(), create_distinct_paths(), create_one_window_path(), create_ordered_paths(), create_partial_grouping_paths(), gather_grouping_paths(), generate_nonunion_paths(), and make_union_unique().

2771 {
2772  SortPath *pathnode = makeNode(SortPath);
2773 
2774  pathnode->path.pathtype = T_Sort;
2775  pathnode->path.parent = rel;
2776  /* Sort doesn't project, so use source path's pathtarget */
2777  pathnode->path.pathtarget = subpath->pathtarget;
2778  /* For now, assume we are above any joins, so no parameterization */
2779  pathnode->path.param_info = NULL;
2780  pathnode->path.parallel_aware = false;
2781  pathnode->path.parallel_safe = rel->consider_parallel &&
2782  subpath->parallel_safe;
2783  pathnode->path.parallel_workers = subpath->parallel_workers;
2784  pathnode->path.pathkeys = pathkeys;
2785 
2786  pathnode->subpath = subpath;
2787 
2788  cost_sort(&pathnode->path, root, pathkeys,
2789  subpath->total_cost,
2790  subpath->rows,
2791  subpath->pathtarget->width,
2792  0.0, /* XXX comparison_cost shouldn't be 0? */
2793  work_mem, limit_tuples);
2794 
2795  return pathnode;
2796 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
Path * subpath
Definition: pathnodes.h:1618
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
Definition: nodes.h:76
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
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:1693
int work_mem
Definition: globals.c:121
Cost total_cost
Definition: pathnodes.h:1126
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
double rows
Definition: pathnodes.h:1124
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
Path path
Definition: pathnodes.h:1617
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_subqueryscan_path()

SubqueryScanPath* create_subqueryscan_path ( PlannerInfo root,
RelOptInfo rel,
Path subpath,
List pathkeys,
Relids  required_outer 
)

Definition at line 1883 of file pathnode.c.

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

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

1885 {
1887 
1888  pathnode->path.pathtype = T_SubqueryScan;
1889  pathnode->path.parent = rel;
1890  pathnode->path.pathtarget = rel->reltarget;
1891  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1892  required_outer);
1893  pathnode->path.parallel_aware = false;
1894  pathnode->path.parallel_safe = rel->consider_parallel &&
1895  subpath->parallel_safe;
1896  pathnode->path.parallel_workers = subpath->parallel_workers;
1897  pathnode->path.pathkeys = pathkeys;
1898  pathnode->subpath = subpath;
1899 
1900  cost_subqueryscan(pathnode, root, rel, pathnode->path.param_info);
1901 
1902  return pathnode;
1903 }
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
void cost_subqueryscan(SubqueryScanPath *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1282
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ create_tablefuncscan_path()

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

Definition at line 1937 of file pathnode.c.

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

Referenced by set_tablefunc_pathlist().

1939 {
1940  Path *pathnode = makeNode(Path);
1941 
1942  pathnode->pathtype = T_TableFuncScan;
1943  pathnode->parent = rel;
1944  pathnode->pathtarget = rel->reltarget;
1945  pathnode->param_info = get_baserel_parampathinfo(root, rel,
1946  required_outer);
1947  pathnode->parallel_aware = false;
1948  pathnode->parallel_safe = rel->consider_parallel;
1949  pathnode->parallel_workers = 0;
1950  pathnode->pathkeys = NIL; /* result is always unordered */
1951 
1952  cost_tablefuncscan(pathnode, root, rel, pathnode->param_info);
1953 
1954  return pathnode;
1955 }
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1115
ParamPathInfo * get_baserel_parampathinfo(PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
Definition: relnode.c:1264
int parallel_workers
Definition: pathnodes.h:1121
ParamPathInfo * param_info
Definition: pathnodes.h:1117
NodeTag pathtype
Definition: pathnodes.h:1112
RelOptInfo * parent
Definition: pathnodes.h:1114
List * pathkeys
Definition: pathnodes.h:1128
#define makeNode(_type_)
Definition: nodes.h:573
void cost_tablefuncscan(Path *path, PlannerInfo *root, RelOptInfo *baserel, ParamPathInfo *param_info)
Definition: costsize.c:1392
bool parallel_safe
Definition: pathnodes.h:1120
bool consider_parallel
Definition: pathnodes.h:649
bool parallel_aware
Definition: pathnodes.h:1119
struct PathTarget * reltarget
Definition: pathnodes.h:652

◆ create_tidscan_path()

TidPath* create_tidscan_path ( PlannerInfo root,
RelOptInfo rel,
List tidquals,
Relids  required_outer 
)

Definition at line 1151 of file pathnode.c.

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

Referenced by BuildParameterizedTidPaths(), and create_tidscan_paths().

1153 {
1154  TidPath *pathnode = makeNode(TidPath);
1155 
1156  pathnode->path.pathtype = T_TidScan;
1157  pathnode->path.parent = rel;
1158  pathnode->path.pathtarget = rel->reltarget;
1159  pathnode->path.param_info = get_baserel_parampathinfo(root, rel,
1160  required_outer);
1161  pathnode->path.parallel_aware = false;
1162  pathnode->path.parallel_safe = rel->consider_parallel;
1163  pathnode->path.parallel_workers = 0;
1164  pathnode->path.pathkeys = NIL; /* always unordered */
1165 
1166  pathnode->tidquals = tidquals;
1167 
1168  cost_tidscan(&pathnode->path, root, rel, tidquals,
1169  pathnode->path.param_info);