7
7
*
8
8
*
9
9
* IDENTIFICATION
10
- * $Header: /cvsroot/pgsql/src/backend/optimizer/path/allpaths.c,v 1.33 1999/02/14 05:14:08 momjian Exp $
10
+ * $Header: /cvsroot/pgsql/src/backend/optimizer/path/allpaths.c,v 1.34 1999/02/14 05:27:11 momjian Exp $
11
11
*
12
12
*-------------------------------------------------------------------------
13
13
*/
@@ -162,7 +162,7 @@ static List *
162
162
find_join_paths (Query * root , List * outer_rels , int levels_needed )
163
163
{
164
164
List * x ;
165
- List * new_rels = NIL ;
165
+ List * joined_rels = NIL ;
166
166
RelOptInfo * rel ;
167
167
168
168
/*******************************************
@@ -181,26 +181,26 @@ find_join_paths(Query *root, List *outer_rels, int levels_needed)
181
181
/*
182
182
* Determine all possible pairs of relations to be joined at this
183
183
* level. Determine paths for joining these relation pairs and
184
- * modify 'new_rels ' accordingly, then eliminate redundant join
184
+ * modify 'joined_rels ' accordingly, then eliminate redundant join
185
185
* relations.
186
186
*/
187
- new_rels = make_new_rels_by_joins (root , outer_rels );
187
+ joined_rels = make_new_rels_by_joins (root , outer_rels );
188
188
189
- update_rels_pathlist_for_joins (root , new_rels );
189
+ update_rels_pathlist_for_joins (root , joined_rels );
190
190
191
- merge_rels_with_same_relids (new_rels );
191
+ merge_rels_with_same_relids (joined_rels );
192
192
193
193
#if 0
194
194
/*
195
195
* * for each expensive predicate in each path in each distinct
196
196
* rel, * consider doing pullup -- JMH
197
197
*/
198
198
if (XfuncMode != XFUNC_NOPULL && XfuncMode != XFUNC_OFF )
199
- foreach (x , new_rels )
199
+ foreach (x , joined_rels )
200
200
xfunc_trypullup ((RelOptInfo * ) lfirst (x ));
201
201
#endif
202
202
203
- rels_set_cheapest (new_rels );
203
+ rels_set_cheapest (joined_rels );
204
204
205
205
if (BushyPlanFlag )
206
206
{
@@ -211,10 +211,10 @@ find_join_paths(Query *root, List *outer_rels, int levels_needed)
211
211
* involves the join relation to the joininfo list of the
212
212
* other relation
213
213
*/
214
- add_new_joininfos (root , new_rels , outer_rels );
214
+ add_new_joininfos (root , joined_rels , outer_rels );
215
215
}
216
216
217
- foreach (x , new_rels )
217
+ foreach (x , joined_rels )
218
218
{
219
219
rel = (RelOptInfo * ) lfirst (x );
220
220
@@ -239,20 +239,20 @@ find_join_paths(Query *root, List *outer_rels, int levels_needed)
239
239
/*
240
240
* merge join rels if then contain the same list of base rels
241
241
*/
242
- outer_rels = merge_joinrels (new_rels , outer_rels );
242
+ outer_rels = merge_joinrels (joined_rels , outer_rels );
243
243
root -> join_rel_list = outer_rels ;
244
244
}
245
245
else
246
- root -> join_rel_list = new_rels ;
246
+ root -> join_rel_list = joined_rels ;
247
247
248
248
if (!BushyPlanFlag )
249
- outer_rels = new_rels ;
249
+ outer_rels = joined_rels ;
250
250
}
251
251
252
252
if (BushyPlanFlag )
253
253
return final_join_rels (outer_rels );
254
254
else
255
- return new_rels ;
255
+ return joined_rels ;
256
256
}
257
257
258
258
/*****************************************************************************
0 commit comments