diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2007-04-21 21:01:45 +0000 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2007-04-21 21:01:45 +0000 |
| commit | afcf09dd9034f24e34dd46f69938882ab5b103d2 (patch) | |
| tree | 497edd9a542b2bc9312afe2f39341f7b95a892c5 /src/backend/optimizer/plan/planmain.c | |
| parent | ac7e6c0665a377fb0e4e5b12cfc762c1b14e425e (diff) | |
| download | postgresql-afcf09dd9034f24e34dd46f69938882ab5b103d2.tar.gz postgresql-afcf09dd9034f24e34dd46f69938882ab5b103d2.zip | |
Some further performance tweaks for planning large inheritance trees that
are mostly excluded by constraints: do the CE test a bit earlier to save
some adjust_appendrel_attrs() work on excluded children, and arrange to
use array indexing rather than rt_fetch() to fetch RTEs in the main body
of the planner. The latter is something I'd wanted to do for awhile anyway,
but seeing list_nth_cell() as 35% of the runtime gets one's attention.
Diffstat (limited to 'src/backend/optimizer/plan/planmain.c')
| -rw-r--r-- | src/backend/optimizer/plan/planmain.c | 17 |
1 files changed, 16 insertions, 1 deletions
diff --git a/src/backend/optimizer/plan/planmain.c b/src/backend/optimizer/plan/planmain.c index de3944b6b07..f12e388d723 100644 --- a/src/backend/optimizer/plan/planmain.c +++ b/src/backend/optimizer/plan/planmain.c @@ -14,7 +14,7 @@ * * * IDENTIFICATION - * $PostgreSQL: pgsql/src/backend/optimizer/plan/planmain.c,v 1.99 2007/01/20 20:45:39 tgl Exp $ + * $PostgreSQL: pgsql/src/backend/optimizer/plan/planmain.c,v 1.100 2007/04/21 21:01:45 tgl Exp $ * *------------------------------------------------------------------------- */ @@ -86,6 +86,7 @@ query_planner(PlannerInfo *root, List *tlist, double tuple_fraction, Path *cheapestpath; Path *sortedpath; Index rti; + ListCell *lc; double total_pages; /* Make tuple_fraction accessible to lower-level routines */ @@ -124,6 +125,20 @@ query_planner(PlannerInfo *root, List *tlist, double tuple_fraction, root->oj_info_list = NIL; /* + * Make a flattened version of the rangetable for faster access (this + * is OK because the rangetable won't change any more). + */ + root->simple_rte_array = (RangeTblEntry **) + palloc0(root->simple_rel_array_size * sizeof(RangeTblEntry *)); + rti = 1; + foreach(lc, parse->rtable) + { + RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc); + + root->simple_rte_array[rti++] = rte; + } + + /* * Construct RelOptInfo nodes for all base relations in query, and * indirectly for all appendrel member relations ("other rels"). This * will give us a RelOptInfo for every "simple" (non-join) rel involved in |