aboutsummaryrefslogtreecommitdiff
path: root/src/backend/optimizer/util/pathnode.c
diff options
context:
space:
mode:
authorBruce Momjian <bruce@momjian.us>1999-02-11 17:03:17 +0000
committerBruce Momjian <bruce@momjian.us>1999-02-11 17:03:17 +0000
commit8dc2209f716c9e3a7b3a435cfdd900ee77a2928e (patch)
treebf1d7f65ab50fc19c3938c4f90ec8d18be44a42a /src/backend/optimizer/util/pathnode.c
parent6de25f09b1de2cdc396ef1ca54342351ca6c2043 (diff)
downloadpostgresql-8dc2209f716c9e3a7b3a435cfdd900ee77a2928e.tar.gz
postgresql-8dc2209f716c9e3a7b3a435cfdd900ee77a2928e.zip
optimizer cleanup
Diffstat (limited to 'src/backend/optimizer/util/pathnode.c')
-rw-r--r--src/backend/optimizer/util/pathnode.c14
1 files changed, 7 insertions, 7 deletions
diff --git a/src/backend/optimizer/util/pathnode.c b/src/backend/optimizer/util/pathnode.c
index ed8576af64f..573ffd1627f 100644
--- a/src/backend/optimizer/util/pathnode.c
+++ b/src/backend/optimizer/util/pathnode.c
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.28 1999/02/11 17:00:49 momjian Exp $
+ * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.29 1999/02/11 17:03:17 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -198,12 +198,12 @@ better_path(Path *new_path, List *unique_paths, bool *is_new)
* over unsorted keys in the same way.
*/
/* same keys, and new is cheaper, use it */
- if ((better_key == 0 && better_sort == 0 &&
- new_path->path_cost < path->path_cost) ||
+ if (((better_key == 0 && better_sort == 0 &&
+ new_path->path_cost < path->path_cost) ||
/* new is better, and cheaper, use it */
((better_key == 1 && better_sort != 2) ||
- (better_key != 2 && better_sort == 1)) &&
+ (better_key != 2 && better_sort == 1))) &&
new_path->path_cost <= path->path_cost)
{
*is_new = false;
@@ -212,12 +212,12 @@ better_path(Path *new_path, List *unique_paths, bool *is_new)
/* same keys, new is more expensive, stop */
else if
- ((better_key == 0 && better_sort == 0 &&
- new_path->path_cost >= path->path_cost) ||
+ (((better_key == 0 && better_sort == 0 &&
+ new_path->path_cost >= path->path_cost) ||
/* old is better, and less expensive, stop */
((better_key == 2 && better_sort != 1) ||
- (better_key != 1 && better_sort == 2)) &&
+ (better_key != 1 && better_sort == 2))) &&
new_path->path_cost >= path->path_cost)
{
*is_new = false;