aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBruce Momjian <bruce@momjian.us>1999-02-11 17:21:51 +0000
committerBruce Momjian <bruce@momjian.us>1999-02-11 17:21:51 +0000
commitc873fcdaf40eb7e5ba412648e9decd5c43b5917c (patch)
tree091488528255926e4a90f773cff2b83793725367
parent8dc2209f716c9e3a7b3a435cfdd900ee77a2928e (diff)
downloadpostgresql-c873fcdaf40eb7e5ba412648e9decd5c43b5917c.tar.gz
postgresql-c873fcdaf40eb7e5ba412648e9decd5c43b5917c.zip
Optimizer cleanup.
-rw-r--r--src/backend/optimizer/util/pathnode.c20
1 files changed, 10 insertions, 10 deletions
diff --git a/src/backend/optimizer/util/pathnode.c b/src/backend/optimizer/util/pathnode.c
index 573ffd1627f..2a45890d3dc 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.29 1999/02/11 17:03:17 momjian Exp $
+ * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.30 1999/02/11 17:21:51 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -198,13 +198,13 @@ 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 &&
+ 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))) &&
- new_path->path_cost <= path->path_cost)
+ (((better_key == 1 && better_sort != 2) ||
+ (better_key != 2 && better_sort == 1)) &&
+ new_path->path_cost <= path->path_cost))
{
*is_new = false;
return new_path;
@@ -212,13 +212,13 @@ 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))) &&
- new_path->path_cost >= path->path_cost)
+ (((better_key == 2 && better_sort != 1) ||
+ (better_key != 1 && better_sort == 2)) &&
+ new_path->path_cost >= path->path_cost))
{
*is_new = false;
return NULL;