rdelaage
/
postgresql
mirror of https://git.postgresql.org/git/postgresql.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
postgresql/src/include/optimizer/planmain.h

60 lines
1.8 KiB
C
Raw Normal View History

Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
/*-------------------------------------------------------------------------
*
Change my-function-name-- to my_function_name, and optimizer renames.
1999-02-14 00:22:53 +01:00
* planmain.h
Massive commit to run PGINDENT on all *.c and *.h files.
1997-09-07 07:04:48 +02:00
* prototypes for various files in optimizer/plan
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
*
*
* Copyright (c) 1994, Regents of the University of California
*
Fix planner and rewriter to follow SQL semantics for tables that are mentioned in FROM but not elsewhere in the query: such tables should be joined over anyway. Aside from being more standards-compliant, this allows removal of some very ugly hacks for COUNT(*) processing. Also, allow HAVING clause without aggregate functions, since SQL does. Clean up CREATE RULE statement-list syntax the same way Bruce just fixed the main stmtmulti production. CAUTION: addition of a field to RangeTblEntry nodes breaks stored rules; you will have to initdb if you have any rules.
1999-10-07 06:23:24 +02:00
* $Id: planmain.h,v 1.34 1999/10/07 04:23:19 tgl Exp $
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
*
*-------------------------------------------------------------------------
*/
#ifndef PLANMAIN_H
#define PLANMAIN_H
Cleanup up include files.
1997-11-26 02:14:33 +01:00
#include "nodes/plannodes.h"
#include "nodes/relation.h"
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
/*
* prototypes for plan/planmain.c
*/
Fix planner and rewriter to follow SQL semantics for tables that are mentioned in FROM but not elsewhere in the query: such tables should be joined over anyway. Aside from being more standards-compliant, this allows removal of some very ugly hacks for COUNT(*) processing. Also, allow HAVING clause without aggregate functions, since SQL does. Clean up CREATE RULE statement-list syntax the same way Bruce just fixed the main stmtmulti production. CAUTION: addition of a field to RangeTblEntry nodes breaks stored rules; you will have to initdb if you have any rules.
1999-10-07 06:23:24 +02:00
extern Plan *query_planner(Query *root, List *tlist, List *qual);
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
/*
* prototypes for plan/createplan.c
*/
Used modified version of indent that understands over 100 typedefs.
1997-09-08 23:56:23 +02:00
extern Plan *create_plan(Path *best_path);
Further planner/optimizer cleanups. Move all set_tlist_references and fix_opids processing to a single recursive pass over the plan tree executed at the very tail end of planning, rather than haphazardly here and there at different places. Now that tlist Vars do not get modified until the very end, it's possible to get rid of the klugy var_equal and match_varid partial-matching routines, and just use plain equal() throughout the optimizer. This is a step towards allowing merge and hash joins to be done on expressions instead of only Vars ...
1999-08-22 22:15:04 +02:00
extern SeqScan *make_seqscan(List *qptlist, List *qpqual, Index scanrelid);
Rename Temp to Noname for noname tables.
1999-02-09 18:03:14 +01:00
extern Sort *make_sort(List *tlist, Oid nonameid, Plan *lefttree,
Massive commit to run PGINDENT on all *.c and *.h files.
1997-09-07 07:04:48 +02:00
int keycount);
Remove Query->qry_aggs and qry_numaggs and replace with Query->hasAggs. Pass List* of Aggregs into executor, and create needed array there. No longer need to double-processs Aggregs with second copy in Query. Fix crash when doing: select sum(x+1) from test where 1 > 0;
1998-01-15 20:00:16 +01:00
extern Agg *make_agg(List *tlist, Plan *lefttree);
OK, folks, here is the pgindent output.
1998-09-01 06:40:42 +02:00
extern Group *make_group(List *tlist, bool tuplePerGroup, int ngrp,
Major revision of sort-node handling: push knowledge of query sort order down into planner, instead of handling it only at the very top level of the planner. This fixes many things. An explicit sort is now avoided if there is a cheaper alternative (typically an indexscan) not only for ORDER BY, but also for the internal sort of GROUP BY. It works even when there is no other reason (such as a WHERE condition) to consider the indexscan. It works for indexes on functions. It works for indexes on functions, backwards. It's just so cool... CAUTION: I have changed the representation of SortClause nodes, therefore THIS UPDATE BREAKS STORED RULES. You will need to initdb.
1999-08-21 05:49:17 +02:00
AttrNumber *grpColIdx, Plan *lefttree);
Further sort-order twiddling in optimizer: be smart about case where ORDER BY and GROUP BY request the same sort order.
1999-08-23 01:56:45 +02:00
extern Noname *make_noname(List *tlist, List *pathkeys, Plan *subplan);
Used modified version of indent that understands over 100 typedefs.
1997-09-08 23:56:23 +02:00
extern Unique *make_unique(List *tlist, Plan *lefttree, char *uniqueAttr);
Further planner/optimizer cleanups. Move all set_tlist_references and fix_opids processing to a single recursive pass over the plan tree executed at the very tail end of planning, rather than haphazardly here and there at different places. Now that tlist Vars do not get modified until the very end, it's possible to get rid of the klugy var_equal and match_varid partial-matching routines, and just use plain equal() throughout the optimizer. This is a step towards allowing merge and hash joins to be done on expressions instead of only Vars ...
1999-08-22 22:15:04 +02:00
extern Result *make_result(List *tlist, Node *resconstantqual, Plan *subplan);
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
/*
* prototypes for plan/initsplan.c
*/
Change my-function-name-- to my_function_name, and optimizer renames.
1999-02-14 00:22:53 +01:00
extern void make_var_only_tlist(Query *root, List *tlist);
extern void add_restrict_and_join_to_rels(Query *root, List *clauses);
Fix planner and rewriter to follow SQL semantics for tables that are mentioned in FROM but not elsewhere in the query: such tables should be joined over anyway. Aside from being more standards-compliant, this allows removal of some very ugly hacks for COUNT(*) processing. Also, allow HAVING clause without aggregate functions, since SQL does. Clean up CREATE RULE statement-list syntax the same way Bruce just fixed the main stmtmulti production. CAUTION: addition of a field to RangeTblEntry nodes breaks stored rules; you will have to initdb if you have any rules.
1999-10-07 06:23:24 +02:00
extern void add_missing_rels_to_query(Query *root);
Optimizer rename.
1999-02-14 05:57:02 +01:00
extern void set_joininfo_mergeable_hashable(List *rel_list);
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
/*
* prototypes for plan/setrefs.c
*/
Further planner/optimizer cleanups. Move all set_tlist_references and fix_opids processing to a single recursive pass over the plan tree executed at the very tail end of planning, rather than haphazardly here and there at different places. Now that tlist Vars do not get modified until the very end, it's possible to get rid of the klugy var_equal and match_varid partial-matching routines, and just use plain equal() throughout the optimizer. This is a step towards allowing merge and hash joins to be done on expressions instead of only Vars ...
1999-08-22 22:15:04 +02:00
extern void set_plan_references(Plan *plan);
OK, folks, here is the pgindent output.
1998-09-01 06:40:42 +02:00
extern List *join_references(List *clauses, List *outer_tlist,
Further planner/optimizer cleanups. Move all set_tlist_references and fix_opids processing to a single recursive pass over the plan tree executed at the very tail end of planning, rather than haphazardly here and there at different places. Now that tlist Vars do not get modified until the very end, it's possible to get rid of the klugy var_equal and match_varid partial-matching routines, and just use plain equal() throughout the optimizer. This is a step towards allowing merge and hash joins to be done on expressions instead of only Vars ...
1999-08-22 22:15:04 +02:00
List *inner_tlist, Index acceptable_rel);
extern void fix_opids(Node *node);
Major revision of sort-node handling: push knowledge of query sort order down into planner, instead of handling it only at the very top level of the planner. This fixes many things. An explicit sort is now avoided if there is a cheaper alternative (typically an indexscan) not only for ORDER BY, but also for the internal sort of GROUP BY. It works even when there is no other reason (such as a WHERE condition) to consider the indexscan. It works for indexes on functions. It works for indexes on functions, backwards. It's just so cool... CAUTION: I have changed the representation of SortClause nodes, therefore THIS UPDATE BREAKS STORED RULES. You will need to initdb.
1999-08-21 05:49:17 +02:00
/*
* prep/prepkeyset.c
*/
[Part #1: Type: text/plain, Encoding: 7bit, Size: 59] I will be cleaning this up more before the Oct 1 deadline. David Hartwig. AND/OR fix.
1998-09-03 04:34:35 +02:00
extern void transformKeySetQuery(Query *origNode);
Postgres95 1.01 Distribution - Virgin Sources
1996-07-09 08:22:35 +02:00
OK, folks, here is the pgindent output.
1998-09-01 06:40:42 +02:00
#endif /* PLANMAIN_H */