From b78f6264eba33e2966447572b8261e353df01e59 Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Sun, 28 Mar 2010 22:59:34 +0000 Subject: Rework join-removal logic as per recent discussion. In particular this fixes things so that it works for cases where nested removals are possible. The overhead of the optimization should be significantly less, as well. --- src/backend/optimizer/util/pathnode.c | 22 +--------------------- 1 file changed, 1 insertion(+), 21 deletions(-) (limited to 'src/backend/optimizer/util/pathnode.c') diff --git a/src/backend/optimizer/util/pathnode.c b/src/backend/optimizer/util/pathnode.c index a2ebe0d8ed3..61716e464dc 100644 --- a/src/backend/optimizer/util/pathnode.c +++ b/src/backend/optimizer/util/pathnode.c @@ -8,7 +8,7 @@ * * * IDENTIFICATION - * $PostgreSQL: pgsql/src/backend/optimizer/util/pathnode.c,v 1.157 2010/02/26 02:00:47 momjian Exp $ + * $PostgreSQL: pgsql/src/backend/optimizer/util/pathnode.c,v 1.158 2010/03/28 22:59:33 tgl Exp $ * *------------------------------------------------------------------------- */ @@ -1214,26 +1214,6 @@ distinct_col_search(int colno, List *colnos, List *opids) return InvalidOid; } -/* - * create_noop_path - * Creates a path equivalent to the input subpath, but having a different - * parent rel. This is used when a join is found to be removable. - */ -NoOpPath * -create_noop_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath) -{ - NoOpPath *pathnode = makeNode(NoOpPath); - - pathnode->path.pathtype = T_Join; /* by convention */ - pathnode->path.parent = rel; - pathnode->path.startup_cost = subpath->startup_cost; - pathnode->path.total_cost = subpath->total_cost; - pathnode->path.pathkeys = subpath->pathkeys; - pathnode->subpath = subpath; - - return pathnode; -} - /* * create_subqueryscan_path * Creates a path corresponding to a sequential scan of a subquery, -- cgit v1.2.3