X-Git-Url: https://granicus.if.org/sourcecode?a=blobdiff_plain;f=src%2Finclude%2Foptimizer%2Fplanmain.h;h=0b46a173706bfacae48a97bf683b38882c0451c8;hb=db147b348345288c7b47f9527fc107a9bb063ad7;hp=e76ba2014499c2c894e2eb9a36f4676feee6e233;hpb=20ad43b576d9360b0e9ce9bd868c989443cf9d36;p=postgresql

diff --git a/src/include/optimizer/planmain.h b/src/include/optimizer/planmain.h
index e76ba20144..0b46a17370 100644
--- a/src/include/optimizer/planmain.h
+++ b/src/include/optimizer/planmain.h
@@ -4,10 +4,10 @@
  *	  prototypes for various files in optimizer/plan
  *
  *
- * Portions Copyright (c) 1996-2000, PostgreSQL, Inc
+ * Portions Copyright (c) 1996-2008, PostgreSQL Global Development Group
  * Portions Copyright (c) 1994, Regents of the University of California
  *
- * $Id: planmain.h,v 1.41 2000/06/08 22:37:51 momjian Exp $
+ * $PostgreSQL: pgsql/src/include/optimizer/planmain.h,v 1.108 2008/05/02 21:26:10 tgl Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -17,44 +17,94 @@
 #include "nodes/plannodes.h"
 #include "nodes/relation.h"
 
+/* GUC parameters */
+#define DEFAULT_CURSOR_TUPLE_FRACTION 0.1
+extern double cursor_tuple_fraction;
+
 /*
  * prototypes for plan/planmain.c
  */
-extern Plan *query_planner(Query *root, List *tlist, List *qual,
-			  double tuple_fraction);
+extern void query_planner(PlannerInfo *root, List *tlist,
+			  double tuple_fraction, double limit_tuples,
+			  Path **cheapest_path, Path **sorted_path,
+			  double *num_groups);
 
 /*
- * prototypes for plan/createplan.c
+ * prototypes for plan/planagg.c
  */
-extern Plan *create_plan(Query *root, Path *best_path);
-extern Sort *make_sort(List *tlist, Oid nonameid, Plan *lefttree,
-		  int keycount);
-extern Agg *make_agg(List *tlist, List *qual, Plan *lefttree);
-extern Group *make_group(List *tlist, bool tuplePerGroup, int ngrp,
-		   AttrNumber *grpColIdx, Plan *lefttree);
-extern Noname *make_noname(List *tlist, List *pathkeys, Plan *subplan);
-extern Unique *make_unique(List *tlist, Plan *lefttree, List *distinctList);
-extern Result *make_result(List *tlist, Node *resconstantqual, Plan *subplan);
+extern Plan *optimize_minmax_aggregates(PlannerInfo *root, List *tlist,
+						   Path *best_path);
 
 /*
- * prototypes for plan/initsplan.c
+ * prototypes for plan/createplan.c
  */
-extern void make_var_only_tlist(Query *root, List *tlist);
-extern void add_restrict_and_join_to_rels(Query *root, List *clauses);
-extern void add_missing_rels_to_query(Query *root);
+extern Plan *create_plan(PlannerInfo *root, Path *best_path);
+extern SubqueryScan *make_subqueryscan(List *qptlist, List *qpqual,
+				  Index scanrelid, Plan *subplan, List *subrtable);
+extern Append *make_append(List *appendplans, bool isTarget, List *tlist);
+extern Sort *make_sort_from_pathkeys(PlannerInfo *root, Plan *lefttree,
+						List *pathkeys, double limit_tuples);
+extern Sort *make_sort_from_sortclauses(PlannerInfo *root, List *sortcls,
+						   Plan *lefttree);
+extern Sort *make_sort_from_groupcols(PlannerInfo *root, List *groupcls,
+						 AttrNumber *grpColIdx, Plan *lefttree);
+extern Agg *make_agg(PlannerInfo *root, List *tlist, List *qual,
+		 AggStrategy aggstrategy,
+		 int numGroupCols, AttrNumber *grpColIdx, Oid *grpOperators,
+		 long numGroups, int numAggs,
+		 Plan *lefttree);
+extern Group *make_group(PlannerInfo *root, List *tlist, List *qual,
+		   int numGroupCols, AttrNumber *grpColIdx, Oid *grpOperators,
+		   double numGroups,
+		   Plan *lefttree);
+extern Plan *materialize_finished_plan(Plan *subplan);
+extern Unique *make_unique(Plan *lefttree, List *distinctList);
+extern Limit *make_limit(Plan *lefttree, Node *limitOffset, Node *limitCount,
+		   int64 offset_est, int64 count_est);
+extern SetOp *make_setop(SetOpCmd cmd, Plan *lefttree,
+		   List *distinctList, AttrNumber flagColIdx);
+extern Result *make_result(PlannerInfo *root, List *tlist,
+			Node *resconstantqual, Plan *subplan);
+extern bool is_projection_capable_plan(Plan *plan);
 
 /*
- * prototypes for plan/setrefs.c
+ * prototypes for plan/initsplan.c
  */
-extern void set_plan_references(Plan *plan);
-extern List *join_references(List *clauses, List *outer_tlist,
-				List *inner_tlist, Index acceptable_rel);
-extern void fix_opids(Node *node);
+extern int	from_collapse_limit;
+extern int	join_collapse_limit;
+
+extern void add_base_rels_to_query(PlannerInfo *root, Node *jtnode);
+extern void build_base_rel_tlists(PlannerInfo *root, List *final_tlist);
+extern void add_IN_vars_to_tlists(PlannerInfo *root);
+extern void add_vars_to_targetlist(PlannerInfo *root, List *vars,
+					   Relids where_needed);
+extern List *deconstruct_jointree(PlannerInfo *root);
+extern void distribute_restrictinfo_to_rels(PlannerInfo *root,
+								RestrictInfo *restrictinfo);
+extern void process_implied_equality(PlannerInfo *root,
+						 Oid opno,
+						 Expr *item1,
+						 Expr *item2,
+						 Relids qualscope,
+						 bool below_outer_join,
+						 bool both_const);
+extern RestrictInfo *build_implied_join_equality(Oid opno,
+							Expr *item1,
+							Expr *item2,
+							Relids qualscope);
 
 /*
- * prep/prepkeyset.c
+ * prototypes for plan/setrefs.c
  */
-extern bool _use_keyset_query_optimizer;
-extern void transformKeySetQuery(Query *origNode);
+extern Plan *set_plan_references(PlannerGlobal *glob,
+					Plan *plan,
+					List *rtable);
+extern List *set_returning_clause_references(PlannerGlobal *glob,
+								List *rlist,
+								Plan *topplan,
+								Index resultRelation);
+extern void fix_opfuncids(Node *node);
+extern void set_opfuncid(OpExpr *opexpr);
+extern void set_sa_opfuncid(ScalarArrayOpExpr *opexpr);
 
-#endif	 /* PLANMAIN_H */
+#endif   /* PLANMAIN_H */