gooderp18绿色标准版
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

201 line
8.8KB

  1. /*-------------------------------------------------------------------------
  2. *
  3. * cost.h
  4. * prototypes for costsize.c and clausesel.c.
  5. *
  6. *
  7. * Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
  8. * Portions Copyright (c) 1994, Regents of the University of California
  9. *
  10. * src/include/optimizer/cost.h
  11. *
  12. *-------------------------------------------------------------------------
  13. */
  14. #ifndef COST_H
  15. #define COST_H
  16. #include "nodes/pathnodes.h"
  17. #include "nodes/plannodes.h"
  18. /* defaults for costsize.c's Cost parameters */
  19. /* NB: cost-estimation code should use the variables, not these constants! */
  20. /* If you change these, update backend/utils/misc/postgresql.sample.conf */
  21. #define DEFAULT_SEQ_PAGE_COST 1.0
  22. #define DEFAULT_RANDOM_PAGE_COST 4.0
  23. #define DEFAULT_CPU_TUPLE_COST 0.01
  24. #define DEFAULT_CPU_INDEX_TUPLE_COST 0.005
  25. #define DEFAULT_CPU_OPERATOR_COST 0.0025
  26. #define DEFAULT_PARALLEL_TUPLE_COST 0.1
  27. #define DEFAULT_PARALLEL_SETUP_COST 1000.0
  28. #define DEFAULT_EFFECTIVE_CACHE_SIZE 524288 /* measured in pages */
  29. typedef enum
  30. {
  31. CONSTRAINT_EXCLUSION_OFF, /* do not use c_e */
  32. CONSTRAINT_EXCLUSION_ON, /* apply c_e to all rels */
  33. CONSTRAINT_EXCLUSION_PARTITION /* apply c_e to otherrels only */
  34. } ConstraintExclusionType;
  35. /*
  36. * prototypes for costsize.c
  37. * routines to compute costs and sizes
  38. */
  39. /* parameter variables and flags (see also optimizer.h) */
  40. extern PGDLLIMPORT Cost disable_cost;
  41. extern PGDLLIMPORT int max_parallel_workers_per_gather;
  42. extern PGDLLIMPORT bool enable_seqscan;
  43. extern PGDLLIMPORT bool enable_indexscan;
  44. extern PGDLLIMPORT bool enable_indexonlyscan;
  45. extern PGDLLIMPORT bool enable_bitmapscan;
  46. extern PGDLLIMPORT bool enable_tidscan;
  47. extern PGDLLIMPORT bool enable_sort;
  48. extern PGDLLIMPORT bool enable_hashagg;
  49. extern PGDLLIMPORT bool enable_nestloop;
  50. extern PGDLLIMPORT bool enable_material;
  51. extern PGDLLIMPORT bool enable_mergejoin;
  52. extern PGDLLIMPORT bool enable_hashjoin;
  53. extern PGDLLIMPORT bool enable_gathermerge;
  54. extern PGDLLIMPORT bool enable_partitionwise_join;
  55. extern PGDLLIMPORT bool enable_partitionwise_aggregate;
  56. extern PGDLLIMPORT bool enable_parallel_append;
  57. extern PGDLLIMPORT bool enable_parallel_hash;
  58. extern PGDLLIMPORT bool enable_partition_pruning;
  59. extern PGDLLIMPORT int constraint_exclusion;
  60. extern double index_pages_fetched(double tuples_fetched, BlockNumber pages,
  61. double index_pages, PlannerInfo *root);
  62. extern void cost_seqscan(Path *path, PlannerInfo *root, RelOptInfo *baserel,
  63. ParamPathInfo *param_info);
  64. extern void cost_samplescan(Path *path, PlannerInfo *root, RelOptInfo *baserel,
  65. ParamPathInfo *param_info);
  66. extern void cost_index(IndexPath *path, PlannerInfo *root,
  67. double loop_count, bool partial_path);
  68. extern void cost_bitmap_heap_scan(Path *path, PlannerInfo *root, RelOptInfo *baserel,
  69. ParamPathInfo *param_info,
  70. Path *bitmapqual, double loop_count);
  71. extern void cost_bitmap_and_node(BitmapAndPath *path, PlannerInfo *root);
  72. extern void cost_bitmap_or_node(BitmapOrPath *path, PlannerInfo *root);
  73. extern void cost_bitmap_tree_node(Path *path, Cost *cost, Selectivity *selec);
  74. extern void cost_tidscan(Path *path, PlannerInfo *root,
  75. RelOptInfo *baserel, List *tidquals, ParamPathInfo *param_info);
  76. extern void cost_subqueryscan(SubqueryScanPath *path, PlannerInfo *root,
  77. RelOptInfo *baserel, ParamPathInfo *param_info);
  78. extern void cost_functionscan(Path *path, PlannerInfo *root,
  79. RelOptInfo *baserel, ParamPathInfo *param_info);
  80. extern void cost_valuesscan(Path *path, PlannerInfo *root,
  81. RelOptInfo *baserel, ParamPathInfo *param_info);
  82. extern void cost_tablefuncscan(Path *path, PlannerInfo *root,
  83. RelOptInfo *baserel, ParamPathInfo *param_info);
  84. extern void cost_ctescan(Path *path, PlannerInfo *root,
  85. RelOptInfo *baserel, ParamPathInfo *param_info);
  86. extern void cost_namedtuplestorescan(Path *path, PlannerInfo *root,
  87. RelOptInfo *baserel, ParamPathInfo *param_info);
  88. extern void cost_resultscan(Path *path, PlannerInfo *root,
  89. RelOptInfo *baserel, ParamPathInfo *param_info);
  90. extern void cost_recursive_union(Path *runion, Path *nrterm, Path *rterm);
  91. extern void cost_sort(Path *path, PlannerInfo *root,
  92. List *pathkeys, Cost input_cost, double tuples, int width,
  93. Cost comparison_cost, int sort_mem,
  94. double limit_tuples);
  95. extern void cost_append(AppendPath *path);
  96. extern void cost_merge_append(Path *path, PlannerInfo *root,
  97. List *pathkeys, int n_streams,
  98. Cost input_startup_cost, Cost input_total_cost,
  99. double tuples);
  100. extern void cost_material(Path *path,
  101. Cost input_startup_cost, Cost input_total_cost,
  102. double tuples, int width);
  103. extern void cost_agg(Path *path, PlannerInfo *root,
  104. AggStrategy aggstrategy, const AggClauseCosts *aggcosts,
  105. int numGroupCols, double numGroups,
  106. List *quals,
  107. Cost input_startup_cost, Cost input_total_cost,
  108. double input_tuples);
  109. extern void cost_windowagg(Path *path, PlannerInfo *root,
  110. List *windowFuncs, int numPartCols, int numOrderCols,
  111. Cost input_startup_cost, Cost input_total_cost,
  112. double input_tuples);
  113. extern void cost_group(Path *path, PlannerInfo *root,
  114. int numGroupCols, double numGroups,
  115. List *quals,
  116. Cost input_startup_cost, Cost input_total_cost,
  117. double input_tuples);
  118. extern void initial_cost_nestloop(PlannerInfo *root,
  119. JoinCostWorkspace *workspace,
  120. JoinType jointype,
  121. Path *outer_path, Path *inner_path,
  122. JoinPathExtraData *extra);
  123. extern void final_cost_nestloop(PlannerInfo *root, NestPath *path,
  124. JoinCostWorkspace *workspace,
  125. JoinPathExtraData *extra);
  126. extern void initial_cost_mergejoin(PlannerInfo *root,
  127. JoinCostWorkspace *workspace,
  128. JoinType jointype,
  129. List *mergeclauses,
  130. Path *outer_path, Path *inner_path,
  131. List *outersortkeys, List *innersortkeys,
  132. JoinPathExtraData *extra);
  133. extern void final_cost_mergejoin(PlannerInfo *root, MergePath *path,
  134. JoinCostWorkspace *workspace,
  135. JoinPathExtraData *extra);
  136. extern void initial_cost_hashjoin(PlannerInfo *root,
  137. JoinCostWorkspace *workspace,
  138. JoinType jointype,
  139. List *hashclauses,
  140. Path *outer_path, Path *inner_path,
  141. JoinPathExtraData *extra,
  142. bool parallel_hash);
  143. extern void final_cost_hashjoin(PlannerInfo *root, HashPath *path,
  144. JoinCostWorkspace *workspace,
  145. JoinPathExtraData *extra);
  146. extern void cost_gather(GatherPath *path, PlannerInfo *root,
  147. RelOptInfo *baserel, ParamPathInfo *param_info, double *rows);
  148. extern void cost_gather_merge(GatherMergePath *path, PlannerInfo *root,
  149. RelOptInfo *rel, ParamPathInfo *param_info,
  150. Cost input_startup_cost, Cost input_total_cost,
  151. double *rows);
  152. extern void cost_subplan(PlannerInfo *root, SubPlan *subplan, Plan *plan);
  153. extern void cost_qual_eval(QualCost *cost, List *quals, PlannerInfo *root);
  154. extern void cost_qual_eval_node(QualCost *cost, Node *qual, PlannerInfo *root);
  155. extern void compute_semi_anti_join_factors(PlannerInfo *root,
  156. RelOptInfo *joinrel,
  157. RelOptInfo *outerrel,
  158. RelOptInfo *innerrel,
  159. JoinType jointype,
  160. SpecialJoinInfo *sjinfo,
  161. List *restrictlist,
  162. SemiAntiJoinFactors *semifactors);
  163. extern void set_baserel_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  164. extern double get_parameterized_baserel_size(PlannerInfo *root,
  165. RelOptInfo *rel,
  166. List *param_clauses);
  167. extern double get_parameterized_joinrel_size(PlannerInfo *root,
  168. RelOptInfo *rel,
  169. Path *outer_path,
  170. Path *inner_path,
  171. SpecialJoinInfo *sjinfo,
  172. List *restrict_clauses);
  173. extern void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel,
  174. RelOptInfo *outer_rel,
  175. RelOptInfo *inner_rel,
  176. SpecialJoinInfo *sjinfo,
  177. List *restrictlist);
  178. extern void set_subquery_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  179. extern void set_function_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  180. extern void set_values_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  181. extern void set_cte_size_estimates(PlannerInfo *root, RelOptInfo *rel,
  182. double cte_rows);
  183. extern void set_tablefunc_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  184. extern void set_namedtuplestore_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  185. extern void set_result_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  186. extern void set_foreign_size_estimates(PlannerInfo *root, RelOptInfo *rel);
  187. extern PathTarget *set_pathtarget_cost_width(PlannerInfo *root, PathTarget *target);
  188. extern double compute_bitmap_pages(PlannerInfo *root, RelOptInfo *baserel,
  189. Path *bitmapqual, int loop_count, Cost *cost, double *tuple);
  190. #endif /* COST_H */
上海开阖软件有限公司 沪ICP备12045867号-1