]> granicus.if.org Git - postgresql/blobdiff - src/include/optimizer/planmain.h
Make the behavior of HAVING without GROUP BY conform to the SQL spec.
[postgresql] / src / include / optimizer / planmain.h
index 6b297b6c1a5ff4ec0d5877e682279a15e8c3298d..e76d55ea4968ef796b3b09d9b212a9f7127bdb3d 100644 (file)
@@ -1,70 +1,74 @@
 /*-------------------------------------------------------------------------
  *
- * planmain.h--
+ * planmain.h
  *       prototypes for various files in optimizer/plan
  *
  *
- * Copyright (c) 1994, Regents of the University of California
+ * Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group
+ * Portions Copyright (c) 1994, Regents of the University of California
  *
- * $Id: planmain.h,v 1.6 1997/11/26 01:13:48 momjian Exp $
+ * $PostgreSQL: pgsql/src/include/optimizer/planmain.h,v 1.80 2005/03/10 23:21:25 tgl Exp $
  *
  *-------------------------------------------------------------------------
  */
 #ifndef PLANMAIN_H
 #define PLANMAIN_H
 
-#include "nodes/nodes.h"
 #include "nodes/plannodes.h"
-#include "nodes/parsenodes.h"
 #include "nodes/relation.h"
 
 /*
  * prototypes for plan/planmain.c
  */
-extern Plan *
-query_planner(Query *root,
-                         int command_type, List *tlist, List *qual);
-
+extern void query_planner(Query *root, List *tlist, double tuple_fraction,
+                         Path **cheapest_path, Path **sorted_path);
 
 /*
  * prototypes for plan/createplan.c
  */
-extern Plan *create_plan(Path *best_path);
-extern SeqScan *
-make_seqscan(List *qptlist, List *qpqual, Index scanrelid,
-                        Plan *lefttree);
-extern Sort *
-make_sort(List *tlist, Oid tempid, Plan *lefttree,
-                 int keycount);
-extern Agg *make_agg(List *tlist, int nagg, Aggreg **aggs);
-extern Group *
-make_group(List *tlist, bool tuplePerGroup, int ngrp,
-                  AttrNumber *grpColIdx, Sort *lefttree);
-extern Unique *make_unique(List *tlist, Plan *lefttree, char *uniqueAttr);
-extern List *generate_fjoin(List *tlist);
-
+extern Plan *create_plan(Query *root, Path *best_path);
+extern SubqueryScan *make_subqueryscan(List *qptlist, List *qpqual,
+                                 Index scanrelid, Plan *subplan);
+extern Append *make_append(List *appendplans, bool isTarget, List *tlist);
+extern Sort *make_sort_from_sortclauses(Query *root, List *sortcls,
+                                                  Plan *lefttree);
+extern Sort *make_sort_from_groupcols(Query *root, List *groupcls,
+                                                AttrNumber *grpColIdx, Plan *lefttree);
+extern Agg *make_agg(Query *root, List *tlist, List *qual,
+                AggStrategy aggstrategy,
+                int numGroupCols, AttrNumber *grpColIdx,
+                long numGroups, int numAggs,
+                Plan *lefttree);
+extern Group *make_group(Query *root, List *tlist, List *qual,
+                  int numGroupCols, AttrNumber *grpColIdx,
+                  double numGroups,
+                  Plan *lefttree);
+extern Material *make_material(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);
+extern SetOp *make_setop(SetOpCmd cmd, Plan *lefttree,
+                  List *distinctList, AttrNumber flagColIdx);
+extern Result *make_result(List *tlist, Node *resconstantqual, Plan *subplan);
+extern bool is_projection_capable_plan(Plan *plan);
 
 /*
  * prototypes for plan/initsplan.c
  */
-extern void initialize_base_rels_list(Query *root, List *tlist);
-extern void initialize_base_rels_jinfo(Query *root, List *clauses);
-extern void initialize_join_clause_info(List *rel_list);
-extern void add_missing_vars_to_base_rels(Query *root, List *tlist);
+extern void add_base_rels_to_query(Query *root, Node *jtnode);
+extern void build_base_rel_tlists(Query *root, List *final_tlist);
+extern Relids distribute_quals_to_rels(Query *root, Node *jtnode);
+extern void process_implied_equality(Query *root,
+                                                Node *item1, Node *item2,
+                                                Oid sortop1, Oid sortop2,
+                                                Relids item1_relids, Relids item2_relids,
+                                                bool delete_it);
 
 /*
  * prototypes for plan/setrefs.c
  */
-extern void set_tlist_references(Plan *plan);
-extern List *
-join_references(List *clauses, List *outer_tlist,
-                               List *inner_tlist);
-extern List *
-index_outerjoin_references(List *inner_indxqual,
-                                                  List *outer_tlist, Index inner_relid);
-extern void set_result_tlist_references(Result *resultNode);
-extern void set_agg_tlist_references(Agg *aggNode);
-extern void set_agg_agglist_references(Agg *aggNode);
-
+extern void set_plan_references(Plan *plan, List *rtable);
+extern void fix_opfuncids(Node *node);
+extern void set_opfuncid(OpExpr *opexpr);
 
-#endif                                                 /* PLANMAIN_H */
+#endif   /* PLANMAIN_H */