database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-11-09 06:21:09 +03:00
Code Activity

Another pgindent run. Sorry folks.

Browse Source
This commit is contained in:
Bruce Momjian
1999-05-25 22:43:53 +00:00
parent 4eadfe8754
commit fcff1cdf4e
109 changed files with 1054 additions and 750 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/backend/optimizer/geqo/geqo_eval.c
View File

@@ -5,7 +5,7 @@
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: geqo_eval.c,v 1.38 1999/05/25 16:09:15 momjian Exp $
* $Id: geqo_eval.c,v 1.39 1999/05/25 22:41:19 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -130,7 +130,7 @@ geqo_eval(Query *root, Gene *tour, int num_gene)
* Returns a new join relation incorporating all joins in a left-sided tree.
*/
RelOptInfo *
gimme_tree(Query *root, Gene *tour, int rel_count, int num_gene, RelOptInfo * old_rel)
gimme_tree(Query *root, Gene *tour, int rel_count, int num_gene, RelOptInfo *old_rel)
{
RelOptInfo *inner_rel; /* current relation */
int base_rel_index;

4
src/backend/optimizer/geqo/geqo_misc.c
View File

@@ -5,7 +5,7 @@
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: geqo_misc.c,v 1.18 1999/05/25 16:09:17 momjian Exp $
* $Id: geqo_misc.c,v 1.19 1999/05/25 22:41:20 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -261,7 +261,7 @@ geqo_print_path(Query *root, Path *path, int indent)
}
void
geqo_print_rel(Query *root, RelOptInfo * rel)
geqo_print_rel(Query *root, RelOptInfo *rel)
{
List *l;

14
src/backend/optimizer/geqo/minspantree.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/geqo/Attic/minspantree.c,v 1.11 1999/05/25 16:09:19 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/geqo/Attic/minspantree.c,v 1.12 1999/05/25 22:41:22 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -41,7 +41,7 @@
*/
void
minspantree(Query *root, List *join_rels, RelOptInfo * garel)
minspantree(Query *root, List *join_rels, RelOptInfo *garel)
{
int number_of_rels = length(root->base_rel_list);
int number_of_joins = length(join_rels);
@@ -111,9 +111,9 @@ minspantree(Query *root, List *join_rels, RelOptInfo * garel)
else if (number_of_joins == 3)
{
RelOptInfo *rel12 = (RelOptInfo *) & tmprel_array[1][2];
RelOptInfo *rel13 = (RelOptInfo *) & tmprel_array[1][3];
RelOptInfo *rel23 = (RelOptInfo *) & tmprel_array[2][3];
RelOptInfo *rel12 = (RelOptInfo *) &tmprel_array[1][2];
RelOptInfo *rel13 = (RelOptInfo *) &tmprel_array[1][3];
RelOptInfo *rel23 = (RelOptInfo *) &tmprel_array[2][3];
if (rel12->cheapestpath->path_cost > rel13->cheapestpath->path_cost)
{
@@ -159,9 +159,9 @@ minspantree(Query *root, List *join_rels, RelOptInfo * garel)
if (connectto[tempn] != 0)
{
if (n > tempn)
joinrel = (RelOptInfo *) & tmprel_array[tempn][n];
joinrel = (RelOptInfo *) &tmprel_array[tempn][n];
else
joinrel = (RelOptInfo *) & tmprel_array[n][tempn];
joinrel = (RelOptInfo *) &tmprel_array[n][tempn];
dist = joinrel->cheapestpath->path_cost;
if (dist < disttoconnect[tempn])