diff options
Diffstat (limited to 'src/backend/optimizer/geqo')
-rw-r--r-- | src/backend/optimizer/geqo/geqo_misc.c | 8 | ||||
-rw-r--r-- | src/backend/optimizer/geqo/geqo_paths.c | 4 |
2 files changed, 6 insertions, 6 deletions
diff --git a/src/backend/optimizer/geqo/geqo_misc.c b/src/backend/optimizer/geqo/geqo_misc.c index ef4bbb879d5..14e26d7555c 100644 --- a/src/backend/optimizer/geqo/geqo_misc.c +++ b/src/backend/optimizer/geqo/geqo_misc.c @@ -5,7 +5,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: geqo_misc.c,v 1.15 1999/02/12 06:43:26 momjian Exp $ + * $Id: geqo_misc.c,v 1.16 1999/02/12 17:24:47 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -158,7 +158,7 @@ void geqo_print_path(Query *root, Path *path, int indent) { char *ptype = NULL; - NestPath *jp; + JoinPath *jp; bool join = false; int i; @@ -194,7 +194,7 @@ geqo_print_path(Query *root, Path *path, int indent) { int size = path->parent->size; - jp = (NestPath *) path; + jp = (JoinPath *) path; printf("%s size=%d cost=%f\n", ptype, size, path->path_cost); switch (nodeTag(path)) { @@ -203,7 +203,7 @@ geqo_print_path(Query *root, Path *path, int indent) for (i = 0; i < indent + 1; i++) printf("\t"); printf(" clauses=("); - geqo_print_joinclauses(root, ((NestPath *) path)->pathinfo); + geqo_print_joinclauses(root, ((JoinPath *) path)->pathinfo); printf(")\n"); if (nodeTag(path) == T_MergePath) diff --git a/src/backend/optimizer/geqo/geqo_paths.c b/src/backend/optimizer/geqo/geqo_paths.c index b54e299b9e9..af8e683b32e 100644 --- a/src/backend/optimizer/geqo/geqo_paths.c +++ b/src/backend/optimizer/geqo/geqo_paths.c @@ -5,7 +5,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: geqo_paths.c,v 1.18 1999/02/12 06:43:26 momjian Exp $ + * $Id: geqo_paths.c,v 1.19 1999/02/12 17:24:47 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -98,7 +98,7 @@ geqo_prune_rel(RelOptInfo *rel, List *other_rels) void geqo_set_cheapest(RelOptInfo *rel) { - NestPath *cheapest = (NestPath *)set_cheapest(rel, rel->pathlist); + JoinPath *cheapest = (JoinPath *)set_cheapest(rel, rel->pathlist); if (IsA_JoinPath(cheapest)) rel->size = compute_joinrel_size(cheapest); |