diff options
Diffstat (limited to 'src/include')
-rw-r--r-- | src/include/nodes/relation.h | 7 | ||||
-rw-r--r-- | src/include/optimizer/geqo_paths.h | 4 | ||||
-rw-r--r-- | src/include/optimizer/paths.h | 5 |
3 files changed, 5 insertions, 11 deletions
diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h index a672e05fe54..966f73732b9 100644 --- a/src/include/nodes/relation.h +++ b/src/include/nodes/relation.h @@ -6,7 +6,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: relation.h,v 1.19 1999/02/11 14:59:03 momjian Exp $ + * $Id: relation.h,v 1.20 1999/02/12 05:57:01 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -41,10 +41,6 @@ typedef List *Relid; * targetlist - List of TargetList nodes * pathlist - List of Path nodes, one for each possible method of * generating the relation - * unorderedpath - a Path node generating this relation whose resulting - * tuples are unordered (this isn't necessarily a - * sequential scan path, e.g., scanning with a hash index - * leaves the tuples unordered) * cheapestpath - least expensive Path (regardless of final order) * pruneable - flag to let the planner know whether it can prune the plan * space of this RelOptInfo or not. @@ -88,7 +84,6 @@ typedef struct RelOptInfo /* materialization information */ List *targetlist; List *pathlist; /* Path structures */ - struct Path *unorderedpath; struct Path *cheapestpath; bool pruneable; diff --git a/src/include/optimizer/geqo_paths.h b/src/include/optimizer/geqo_paths.h index 507bba90563..abef40dd959 100644 --- a/src/include/optimizer/geqo_paths.h +++ b/src/include/optimizer/geqo_paths.h @@ -5,7 +5,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: geqo_paths.h,v 1.7 1999/02/10 21:02:47 momjian Exp $ + * $Id: geqo_paths.h,v 1.8 1999/02/12 05:57:06 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -23,6 +23,6 @@ extern List *geqo_prune_rels(List *rel_list); -extern void geqo_rel_paths(RelOptInfo *rel); +extern void geqo_set_cheapest(RelOptInfo *rel); #endif /* GEQO_PATHS_H */ diff --git a/src/include/optimizer/paths.h b/src/include/optimizer/paths.h index 262505c6c3e..e2f2046974c 100644 --- a/src/include/optimizer/paths.h +++ b/src/include/optimizer/paths.h @@ -7,7 +7,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: paths.h,v 1.13 1999/02/10 21:02:49 momjian Exp $ + * $Id: paths.h,v 1.14 1999/02/12 05:57:08 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -85,8 +85,7 @@ extern List *final_join_rels(List *join_rel_list); * prototypes for path/prune.c */ extern void prune_joinrels(List *rel_list); -extern void prune_rel_paths(List *rel_list); -extern Path *prune_rel_path(RelOptInfo *rel, Path *unorderedpath); +extern void rels_set_cheapest(List *rel_list); extern List *merge_joinrels(List *rel_list1, List *rel_list2); extern List *prune_oldrels(List *old_rels); |