summaryrefslogtreecommitdiff
path: root/src/include/optimizer/prep.h
diff options
context:
space:
mode:
authorHeikki Linnakangas <heikki.linnakangas@iki.fi>2020-11-24 10:45:00 +0200
committerHeikki Linnakangas <heikki.linnakangas@iki.fi>2020-11-24 10:45:00 +0200
commit0a2bc5d61e713e3fe72438f020eea5fcc90b0f0b (patch)
tree8f630f828fa6bbfb5984f037118211cd68d8a50e /src/include/optimizer/prep.h
parente522024bd8dd28a0f13dcccfd39170698f45c939 (diff)
downloadpostgresql-0a2bc5d61e713e3fe72438f020eea5fcc90b0f0b.tar.gz
Move per-agg and per-trans duplicate finding to the planner.
This has the advantage that the cost estimates for aggregates can count the number of calls to transition and final functions correctly. Bump catalog version, because views can contain Aggrefs. Reviewed-by: Andres Freund Discussion: https://www.postgresql.org/message-id/b2e3536b-1dbc-8303-c97e-89cb0b4a9a48%40iki.fi
Diffstat (limited to 'src/include/optimizer/prep.h')
-rw-r--r--src/include/optimizer/prep.h8
1 files changed, 8 insertions, 0 deletions
diff --git a/src/include/optimizer/prep.h b/src/include/optimizer/prep.h
index 19c92302b0..0abe6bec00 100644
--- a/src/include/optimizer/prep.h
+++ b/src/include/optimizer/prep.h
@@ -39,8 +39,16 @@ extern List *preprocess_targetlist(PlannerInfo *root);
extern PlanRowMark *get_plan_rowmark(List *rowmarks, Index rtindex);
/*
+ * prototypes for prepagg.c
+ */
+extern void get_agg_clause_costs(PlannerInfo *root, AggSplit aggsplit,
+ AggClauseCosts *agg_costs);
+extern void preprocess_aggrefs(PlannerInfo *root, Node *clause);
+
+/*
* prototypes for prepunion.c
*/
extern RelOptInfo *plan_set_operations(PlannerInfo *root);
+
#endif /* PREP_H */