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

Used modified version of indent that understands over 100 typedefs.

Browse Source
This commit is contained in:
Bruce Momjian
1997-09-08 21:56:23 +00:00
parent 075cede748
commit 59f6a57e59
413 changed files with 4472 additions and 4460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
src/backend/optimizer/util/clauseinfo.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/clauseinfo.c,v 1.5 1997/09/08 02:24:48 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/clauseinfo.c,v 1.6 1997/09/08 21:45:44 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -27,7 +27,7 @@
*
*/
bool
valid_or_clause(CInfo * clauseinfo)
valid_or_clause(CInfo *clauseinfo)
{
if (clauseinfo != NULL &&
!single_node((Node *) clauseinfo->clause) &&
@@ -45,7 +45,7 @@ valid_or_clause(CInfo * clauseinfo)
*
*/
List *
get_actual_clauses(List * clauseinfo_list)
get_actual_clauses(List *clauseinfo_list)
{
List *temp = NIL;
List *result = NIL;
@@ -85,10 +85,10 @@ get_actual_clauses(List * clauseinfo_list)
*
*/
void
get_relattvals(List * clauseinfo_list,
List ** attnos,
List ** values,
List ** flags)
get_relattvals(List *clauseinfo_list,
List **attnos,
List **values,
List **flags)
{
List *result1 = NIL;
List *result2 = NIL;
@@ -132,10 +132,10 @@ get_relattvals(List * clauseinfo_list,
*/
void
get_joinvars(Oid relid,
List * clauseinfo_list,
List ** attnos,
List ** values,
List ** flags)
List *clauseinfo_list,
List **attnos,
List **values,
List **flags)
{
List *result1 = NIL;
List *result2 = NIL;
@@ -174,7 +174,7 @@ get_joinvars(Oid relid,
*
*/
List *
get_opnos(List * clauseinfo_list)
get_opnos(List *clauseinfo_list)
{
CInfo *temp = (CInfo *) NULL;
List *result = NIL;

84
src/backend/optimizer/util/clauses.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/clauses.c,v 1.10 1997/09/08 20:56:19 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/clauses.c,v 1.11 1997/09/08 21:45:47 momjian Exp $
*
* HISTORY
* AUTHOR DATE MAJOR EVENT
@@ -34,11 +34,11 @@
#include "optimizer/internal.h"
#include "optimizer/var.h"
static bool agg_clause(Node * clause);
static bool agg_clause(Node *clause);
Expr *
make_clause(int type, Node * oper, List * args)
make_clause(int type, Node *oper, List *args)
{
if (type == AND_EXPR || type == OR_EXPR || type == NOT_EXPR ||
type == OP_EXPR || type == FUNC_EXPR)
@@ -79,11 +79,11 @@ make_clause(int type, Node * oper, List * args)
* - ay 10/94.]
*/
bool
is_opclause(Node * clause)
is_opclause(Node *clause)
{
return
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == OP_EXPR);
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == OP_EXPR);
}
/*
@@ -93,7 +93,7 @@ is_opclause(Node * clause)
*
*/
Expr *
make_opclause(Oper * op, Var * leftop, Var * rightop)
make_opclause(Oper *op, Var *leftop, Var *rightop)
{
Expr *expr = makeNode(Expr);
@@ -112,7 +112,7 @@ make_opclause(Oper * op, Var * leftop, Var * rightop)
* NB: it is assumed (for now) that all expr must be Var nodes
*/
Var *
get_leftop(Expr * clause)
get_leftop(Expr *clause)
{
if (clause->args != NULL)
return (lfirst(clause->args));
@@ -127,7 +127,7 @@ get_leftop(Expr * clause)
*
*/
Var *
get_rightop(Expr * clause)
get_rightop(Expr *clause)
{
if (clause->args != NULL && lnext(clause->args) != NULL)
return (lfirst(lnext(clause->args)));
@@ -140,7 +140,7 @@ get_rightop(Expr * clause)
*****************************************************************************/
static bool
agg_clause(Node * clause)
agg_clause(Node *clause)
{
return
(clause != NULL && nodeTag(clause) == T_Aggreg);
@@ -157,11 +157,11 @@ agg_clause(Node * clause)
*
*/
bool
is_funcclause(Node * clause)
is_funcclause(Node *clause)
{
return
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == FUNC_EXPR);
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == FUNC_EXPR);
}
/*
@@ -172,7 +172,7 @@ is_funcclause(Node * clause)
*
*/
Expr *
make_funcclause(Func * func, List * funcargs)
make_funcclause(Func *func, List *funcargs)
{
Expr *expr = makeNode(Expr);
@@ -194,11 +194,11 @@ make_funcclause(Func * func, List * funcargs)
*
*/
bool
or_clause(Node * clause)
or_clause(Node *clause)
{
return
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == OR_EXPR);
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == OR_EXPR);
}
/*
@@ -208,7 +208,7 @@ or_clause(Node * clause)
*
*/
Expr *
make_orclause(List * orclauses)
make_orclause(List *orclauses)
{
Expr *expr = makeNode(Expr);
@@ -230,10 +230,10 @@ make_orclause(List * orclauses)
*
*/
bool
not_clause(Node * clause)
not_clause(Node *clause)
{
return
(clause != NULL &&
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == NOT_EXPR);
}
@@ -244,7 +244,7 @@ not_clause(Node * clause)
*
*/
Expr *
make_notclause(Expr * notclause)
make_notclause(Expr *notclause)
{
Expr *expr = makeNode(Expr);
@@ -262,7 +262,7 @@ make_notclause(Expr * notclause)
*
*/
Expr *
get_notclausearg(Expr * notclause)
get_notclausearg(Expr *notclause)
{
return (lfirst(notclause->args));
}
@@ -279,10 +279,10 @@ get_notclausearg(Expr * notclause)
*
*/
bool
and_clause(Node * clause)
and_clause(Node *clause)
{
return
(clause != NULL &&
(clause != NULL &&
nodeTag(clause) == T_Expr && ((Expr *) clause)->opType == AND_EXPR);
}
@@ -293,7 +293,7 @@ and_clause(Node * clause)
*
*/
Expr *
make_andclause(List * andclauses)
make_andclause(List *andclauses)
{
Expr *expr = makeNode(Expr);
@@ -321,7 +321,7 @@ make_andclause(List * andclauses)
*
*/
List *
pull_constant_clauses(List * quals, List ** constantQual)
pull_constant_clauses(List *quals, List **constantQual)
{
List *q;
List *constqual = NIL;
@@ -356,7 +356,7 @@ pull_constant_clauses(List * quals, List ** constantQual)
*
*/
void
clause_relids_vars(Node * clause, List ** relids, List ** vars)
clause_relids_vars(Node *clause, List **relids, List **vars)
{
List *clvars = pull_var_clause(clause);
List *var_list = NIL;
@@ -396,7 +396,7 @@ clause_relids_vars(Node * clause, List ** relids, List ** vars)
* Returns the number of different relations referenced in 'clause'.
*/
int
NumRelids(Node * clause)
NumRelids(Node *clause)
{
List *vars = pull_var_clause(clause);
List *i = NIL;
@@ -423,7 +423,7 @@ NumRelids(Node * clause)
*
*/
bool
contains_not(Node * clause)
contains_not(Node *clause)
{
if (single_node(clause))
return (false);
@@ -452,7 +452,7 @@ contains_not(Node * clause)
*
*/
bool
join_clause_p(Node * clause)
join_clause_p(Node *clause)
{
Node *leftop,
*rightop;
@@ -467,7 +467,7 @@ join_clause_p(Node * clause)
* One side of the clause (i.e. left or right operands) must either be
* a var node ...
*/
if (IsA(leftop, Var) || IsA(rightop, Var))
if (IsA(leftop, Var) ||IsA(rightop, Var))
return true;
/*
@@ -486,7 +486,7 @@ join_clause_p(Node * clause)
*
*/
bool
qual_clause_p(Node * clause)
qual_clause_p(Node *clause)
{
if (!is_opclause(clause))
return false;
@@ -512,7 +512,7 @@ qual_clause_p(Node * clause)
*
*/
void
fix_opid(Node * clause)
fix_opid(Node *clause)
{
if (clause == NULL || single_node(clause))
{
@@ -560,7 +560,7 @@ fix_opid(Node * clause)
*
*/
List *
fix_opids(List * clauses)
fix_opids(List *clauses)
{
List *clause;
@@ -595,10 +595,10 @@ fix_opids(List * clauses)
*
*/
void
get_relattval(Node * clause,
get_relattval(Node *clause,
int *relid,
AttrNumber *attno,
Datum * constval,
Datum *constval,
int *flag)
{
Var *left = get_leftop((Expr *) clause);
@@ -628,7 +628,7 @@ get_relattval(Node * clause,
}
#ifdef INDEXSCAN_PATCH
}
else if (is_opclause(clause) && IsA(left, Var) && IsA(right, Param))
else if (is_opclause(clause) && IsA(left, Var) &&IsA(right, Param))
{
/* Function parameter used as index scan arg. DZ - 27-8-1996 */
*relid = left->varno;
@@ -691,7 +691,7 @@ get_relattval(Node * clause,
}
#ifdef INDEXSCAN_PATCH
}
else if (is_opclause(clause) && IsA(right, Var) && IsA(left, Param))
else if (is_opclause(clause) && IsA(right, Var) &&IsA(left, Param))
{
/* ...And here... - vadim 01/22/97 */
*relid = right->varno;
@@ -726,7 +726,7 @@ get_relattval(Node * clause,
*
*/
void
get_rels_atts(Node * clause,
get_rels_atts(Node *clause,
int *relid1,
AttrNumber *attno1,
int *relid2,
@@ -736,9 +736,9 @@ get_rels_atts(Node * clause,
Var *right = get_rightop((Expr *) clause);
bool var_left = (IsA(left, Var));
bool var_right = (IsA(right, Var));
bool varexpr_left = (bool) ((IsA(left, Func) || IsA(left, Oper)) &&
bool varexpr_left = (bool) ((IsA(left, Func) ||IsA(left, Oper)) &&
contain_var_clause((Node *) left));
bool varexpr_right = (bool) ((IsA(right, Func) || IsA(right, Oper)) &&
bool varexpr_right = (bool) ((IsA(right, Func) ||IsA(right, Oper)) &&
contain_var_clause((Node *) right));
if (is_opclause(clause))
@@ -780,7 +780,7 @@ get_rels_atts(Node * clause,
}
void
CommuteClause(Node * clause)
CommuteClause(Node *clause)
{
Node *temp;
Oper *commu;

8
src/backend/optimizer/util/indexnode.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/indexnode.c,v 1.4 1997/09/08 02:24:54 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/indexnode.c,v 1.5 1997/09/08 21:45:48 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -24,7 +24,7 @@
#include "optimizer/pathnode.h" /* where the decls go */
static List *find_secondary_index(Query * root, Oid relid);
static List *find_secondary_index(Query *root, Oid relid);
/*
* find-relation-indices--
@@ -33,7 +33,7 @@ static List *find_secondary_index(Query * root, Oid relid);
*
*/
List *
find_relation_indices(Query * root, Rel * rel)
find_relation_indices(Query *root, Rel *rel)
{
if (rel->indexed)
{
@@ -57,7 +57,7 @@ find_relation_indices(Query * root, Rel * rel)
*
*/
static List *
find_secondary_index(Query * root, Oid relid)
find_secondary_index(Query *root, Oid relid)
{
IdxInfoRetval indexinfo;
List *indexes = NIL;

6
src/backend/optimizer/util/internal.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/internal.c,v 1.5 1997/09/08 02:24:56 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/internal.c,v 1.6 1997/09/08 21:45:49 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -39,7 +39,7 @@
/* the following should probably be moved elsewhere -ay */
TargetEntry *
MakeTLE(Resdom * resdom, Node * expr)
MakeTLE(Resdom *resdom, Node *expr)
{
TargetEntry *rt = makeNode(TargetEntry);
@@ -49,7 +49,7 @@ MakeTLE(Resdom * resdom, Node * expr)
}
Var *
get_expr(TargetEntry * tle)
get_expr(TargetEntry *tle)
{
Assert(tle != NULL);
Assert(tle->expr != NULL);

8
src/backend/optimizer/util/joininfo.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/joininfo.c,v 1.4 1997/09/08 02:24:57 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/joininfo.c,v 1.5 1997/09/08 21:45:50 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -36,7 +36,7 @@
*
*/
JInfo *
joininfo_member(List * join_relids, List * joininfo_list)
joininfo_member(List *join_relids, List *joininfo_list)
{
List *i = NIL;
List *other_rels = NIL;
@@ -62,7 +62,7 @@ joininfo_member(List * join_relids, List * joininfo_list)
*
*/
JInfo *
find_joininfo_node(Rel * this_rel, List * join_relids)
find_joininfo_node(Rel *this_rel, List *join_relids)
{
JInfo *joininfo = joininfo_member(join_relids,
this_rel->joininfo);
@@ -89,7 +89,7 @@ find_joininfo_node(Rel * this_rel, List * join_relids)
*
*/
Var *
other_join_clause_var(Var * var, Expr * clause)
other_join_clause_var(Var *var, Expr *clause)
{
Var *retval;
Var *l,

18
src/backend/optimizer/util/keys.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/keys.c,v 1.4 1997/09/08 02:24:58 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/keys.c,v 1.5 1997/09/08 21:45:51 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -22,8 +22,8 @@
#include "optimizer/tlist.h"
static Expr *matching2_tlvar(int var, List * tlist, bool(*test) ());
static bool equal_indexkey_var(int index_key, Var * var);
static Expr *matching2_tlvar(int var, List *tlist, bool (*test) ());
static bool equal_indexkey_var(int index_key, Var *var);
/*
* 1. index key
@@ -54,7 +54,7 @@ static bool equal_indexkey_var(int index_key, Var * var);
*
*/
bool
match_indexkey_operand(int indexkey, Var * operand, Rel * rel)
match_indexkey_operand(int indexkey, Var *operand, Rel *rel)
{
if (IsA(operand, Var) &&
(lfirsti(rel->relids) == operand->varno) &&
@@ -71,7 +71,7 @@ match_indexkey_operand(int indexkey, Var * operand, Rel * rel)
*
*/
static bool
equal_indexkey_var(int index_key, Var * var)
equal_indexkey_var(int index_key, Var *var)
{
if (index_key == var->varattno)
return (true);
@@ -86,7 +86,7 @@ equal_indexkey_var(int index_key, Var * var)
*
*/
Var *
extract_subkey(JoinKey * jk, int which_subkey)
extract_subkey(JoinKey *jk, int which_subkey)
{
Var *retval;
@@ -118,7 +118,7 @@ extract_subkey(JoinKey * jk, int which_subkey)
*
*/
bool
samekeys(List * keys1, List * keys2)
samekeys(List *keys1, List *keys2)
{
bool allmember = true;
List *key1,
@@ -153,7 +153,7 @@ samekeys(List * keys1, List * keys2)
* They should be merged.
*/
static Expr *
matching2_tlvar(int var, List * tlist, bool(*test) ())
matching2_tlvar(int var, List *tlist, bool (*test) ())
{
TargetEntry *tlentry = NULL;
@@ -179,7 +179,7 @@ matching2_tlvar(int var, List * tlist, bool(*test) ())
List *
collect_index_pathkeys(int *index_keys, List * tlist)
collect_index_pathkeys(int *index_keys, List *tlist)
{
List *retval = NIL;

18
src/backend/optimizer/util/ordering.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/ordering.c,v 1.5 1997/09/08 02:24:58 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/ordering.c,v 1.6 1997/09/08 21:45:52 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -18,7 +18,7 @@
#include "optimizer/internal.h"
#include "optimizer/ordering.h"
static bool equal_sortops_order(Oid * ordering1, Oid * ordering2);
static bool equal_sortops_order(Oid *ordering1, Oid *ordering2);
/*
* equal-path-path-ordering--
@@ -26,8 +26,8 @@ static bool equal_sortops_order(Oid * ordering1, Oid * ordering2);
*
*/
bool
equal_path_path_ordering(PathOrder * path_ordering1,
PathOrder * path_ordering2)
equal_path_path_ordering(PathOrder *path_ordering1,
PathOrder *path_ordering2)
{
if (path_ordering1 == path_ordering2)
return true;
@@ -77,8 +77,8 @@ equal_path_path_ordering(PathOrder * path_ordering1,
*
*/
bool
equal_path_merge_ordering(Oid * path_ordering,
MergeOrder * merge_ordering)
equal_path_merge_ordering(Oid *path_ordering,
MergeOrder *merge_ordering)
{
if (path_ordering == NULL || merge_ordering == NULL)
return (false);
@@ -96,8 +96,8 @@ equal_path_merge_ordering(Oid * path_ordering,
*
*/
bool
equal_merge_merge_ordering(MergeOrder * merge_ordering1,
MergeOrder * merge_ordering2)
equal_merge_merge_ordering(MergeOrder *merge_ordering1,
MergeOrder *merge_ordering2)
{
return (equal(merge_ordering1, merge_ordering2));
}
@@ -111,7 +111,7 @@ equal_merge_merge_ordering(MergeOrder * merge_ordering1,
* Returns true iff the sort operators are in the same order.
*/
static bool
equal_sortops_order(Oid * ordering1, Oid * ordering2)
equal_sortops_order(Oid *ordering1, Oid *ordering2)
{
int i = 0;

62
src/backend/optimizer/util/pathnode.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.5 1997/09/08 02:24:59 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.6 1997/09/08 21:45:53 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -29,7 +29,7 @@
#include "parser/parsetree.h" /* for getrelid() */
static Path *better_path(Path * new_path, List * unique_paths, bool * noOther);
static Path *better_path(Path *new_path, List *unique_paths, bool *noOther);
/*****************************************************************************
@@ -42,7 +42,7 @@ static Path *better_path(Path * new_path, List * unique_paths, bool * noOther);
*
*/
bool
path_is_cheaper(Path * path1, Path * path2)
path_is_cheaper(Path *path1, Path *path2)
{
Cost cost1 = path1->path_cost;
Cost cost2 = path2->path_cost;
@@ -62,7 +62,7 @@ path_is_cheaper(Path * path1, Path * path2)
*
*/
Path *
set_cheapest(Rel * parent_rel, List * pathlist)
set_cheapest(Rel *parent_rel, List *pathlist)
{
List *p;
Path *cheapest_so_far;
@@ -101,7 +101,7 @@ set_cheapest(Rel * parent_rel, List * pathlist)
*
*/
List *
add_pathlist(Rel * parent_rel, List * unique_paths, List * new_paths)
add_pathlist(Rel *parent_rel, List *unique_paths, List *new_paths)
{
List *x;
Path *new_path;
@@ -154,7 +154,7 @@ add_pathlist(Rel * parent_rel, List * unique_paths, List * new_paths)
*
*/
static Path *
better_path(Path * new_path, List * unique_paths, bool * noOther)
better_path(Path *new_path, List *unique_paths, bool *noOther)
{
Path *old_path = (Path *) NULL;
Path *path = (Path *) NULL;
@@ -208,7 +208,7 @@ better_path(Path * new_path, List * unique_paths, bool * noOther)
*
*/
Path *
create_seqscan_path(Rel * rel)
create_seqscan_path(Rel *rel)
{
int relid = 0;
@@ -258,10 +258,10 @@ create_seqscan_path(Rel * rel)
*
*/
IndexPath *
create_index_path(Query * root,
Rel * rel,
Rel * index,
List * restriction_clauses,
create_index_path(Query *root,
Rel *rel,
Rel *index,
List *restriction_clauses,
bool is_join_scan)
{
IndexPath *pathnode = makeNode(IndexPath);
@@ -418,11 +418,11 @@ create_index_path(Query * root,
*
*/
JoinPath *
create_nestloop_path(Rel * joinrel,
Rel * outer_rel,
Path * outer_path,
Path * inner_path,
List * keys)
create_nestloop_path(Rel *joinrel,
Rel *outer_rel,
Path *outer_path,
Path *inner_path,
List *keys)
{
JoinPath *pathnode = makeNode(JoinPath);
@@ -495,18 +495,18 @@ create_nestloop_path(Rel * joinrel,
*
*/
MergePath *
create_mergesort_path(Rel * joinrel,
create_mergesort_path(Rel *joinrel,
int outersize,
int innersize,
int outerwidth,
int innerwidth,
Path * outer_path,
Path * inner_path,
List * keys,
MergeOrder * order,
List * mergeclauses,
List * outersortkeys,
List * innersortkeys)
Path *outer_path,
Path *inner_path,
List *keys,
MergeOrder *order,
List *mergeclauses,
List *outersortkeys,
List *innersortkeys)
{
MergePath *pathnode = makeNode(MergePath);
@@ -561,18 +561,18 @@ create_mergesort_path(Rel * joinrel,
*
*/
HashPath *
create_hashjoin_path(Rel * joinrel,
create_hashjoin_path(Rel *joinrel,
int outersize,
int innersize,
int outerwidth,
int innerwidth,
Path * outer_path,
Path * inner_path,
List * keys,
Path *outer_path,
Path *inner_path,
List *keys,
Oid operator,
List * hashclauses,
List * outerkeys,
List * innerkeys)
List *hashclauses,
List *outerkeys,
List *innerkeys)
{
HashPath *pathnode = makeNode(HashPath);

22
src/backend/optimizer/util/plancat.c
View File

@@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/plancat.c,v 1.8 1997/09/08 02:25:01 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/plancat.c,v 1.9 1997/09/08 21:45:53 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -56,8 +56,8 @@ IndexSelectivity(Oid indexrelid, Oid indrelid, int32 nIndexKeys,
* number of tuples
*/
void
relation_info(Query * root, Index relid,
bool * hasindex, int *pages, int *tuples)
relation_info(Query *root, Index relid,
bool *hasindex, int *pages, int *tuples)
{
HeapTuple relationTuple;
Form_pg_class relation;
@@ -101,7 +101,7 @@ relation_info(Query * root, Index relid,
*
*/
bool
index_info(Query * root, bool first, int relid, IdxInfoRetval * info)
index_info(Query *root, bool first, int relid, IdxInfoRetval *info)
{
register i;
HeapTuple indexTuple,
@@ -246,12 +246,12 @@ index_info(Query * root, bool first, int relid, IdxInfoRetval * info)
*/
void
index_selectivity(Oid indid,
Oid * classes,
List * opnos,
Oid *classes,
List *opnos,
Oid relid,
List * attnos,
List * values,
List * flags,
List *attnos,
List *values,
List *flags,
int32 nkeys,
float *idxPages,
float *idxSelec)
@@ -355,7 +355,7 @@ restriction_selectivity(Oid functionObjectId,
elog(WARN, "RestrictionClauseSelectivity: bad value %lf",
*result);
return ((Cost) * result);
return ((Cost) *result);
}
/*
@@ -394,7 +394,7 @@ join_selectivity(Oid functionObjectId,
elog(WARN, "JoinClauseSelectivity: bad value %lf",
*result);
return ((Cost) * result);
return ((Cost) *result);
}
/*

8
src/backend/optimizer/util/relnode.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/relnode.c,v 1.3 1997/09/08 02:25:02 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/relnode.c,v 1.4 1997/09/08 21:45:54 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -28,7 +28,7 @@
*
*/
Rel *
get_base_rel(Query * root, int relid)
get_base_rel(Query *root, int relid)
{
List *relids;
Rel *rel;
@@ -101,7 +101,7 @@ get_base_rel(Query * root, int relid)
*
*/
Rel *
get_join_rel(Query * root, List * relid)
get_join_rel(Query *root, List *relid)
{
return rel_member(relid, root->join_relation_list_);
}
@@ -115,7 +115,7 @@ get_join_rel(Query * root, List * relid)
*
*/
Rel *
rel_member(List * relid, List * rels)
rel_member(List *relid, List *rels)
{
List *temp = NIL;
List *temprelid = NIL;

38
src/backend/optimizer/util/tlist.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/tlist.c,v 1.6 1997/09/08 02:25:03 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/tlist.c,v 1.7 1997/09/08 21:45:55 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -28,7 +28,7 @@
#include "nodes/makefuncs.h"
#include "parser/catalog_utils.h"
static Node *flatten_tlistentry(Node * tlistentry, List * flat_tlist);
static Node *flatten_tlistentry(Node *tlistentry, List *flat_tlist);
/*****************************************************************************
* ---------- RELATION node target list routines ----------
@@ -45,7 +45,7 @@ static Node *flatten_tlistentry(Node * tlistentry, List * flat_tlist);
* targetlist = valid sequence
*/
TargetEntry *
tlistentry_member(Var * var, List * targetlist)
tlistentry_member(Var *var, List *targetlist)
{
if (var)
{
@@ -70,7 +70,7 @@ tlistentry_member(Var * var, List * targetlist)
*
*/
Expr *
matching_tlvar(Var * var, List * targetlist)
matching_tlvar(Var *var, List *targetlist)
{
TargetEntry *tlentry;
@@ -94,7 +94,7 @@ matching_tlvar(Var * var, List * targetlist)
* CREATES: new var-node iff no matching var-node exists in targetlist
*/
void
add_tl_element(Rel * rel, Var * var)
add_tl_element(Rel *rel, Var *var)
{
Expr *oldvar = (Expr *) NULL;
@@ -130,7 +130,7 @@ add_tl_element(Rel * rel, Var * var)
* CREATES: new targetlist entry (always).
*/
TargetEntry *
create_tl_element(Var * var, int resdomno)
create_tl_element(Var *var, int resdomno)
{
TargetEntry *tlelement = makeNode(TargetEntry);
@@ -153,7 +153,7 @@ create_tl_element(Var * var, int resdomno)
*
*/
List *
get_actual_tlist(List * tlist)
get_actual_tlist(List *tlist)
{
/*
@@ -200,7 +200,7 @@ get_actual_tlist(List * tlist)
*
*/
Resdom *
tlist_member(Var * var, List * tlist)
tlist_member(Var *var, List *tlist)
{
List *i = NIL;
TargetEntry *temp_tle = (TargetEntry *) NULL;
@@ -230,7 +230,7 @@ tlist_member(Var * var, List * tlist)
* Routine to get the resdom out of a targetlist.
*/
Resdom *
tlist_resdom(List * tlist, Resdom * resnode)
tlist_resdom(List *tlist, Resdom *resnode)
{
Resdom *resdom = (Resdom *) NULL;
List *i = NIL;
@@ -265,7 +265,7 @@ tlist_resdom(List * tlist, Resdom * resnode)
* varoattno. Also, nested attnos are long gone. - ay 2/95]
*/
TargetEntry *
match_varid(Var * test_var, List * tlist)
match_varid(Var *test_var, List *tlist)
{
List *tl;
Oid type_var;
@@ -311,7 +311,7 @@ match_varid(Var * test_var, List * tlist)
*
*/
List *
new_unsorted_tlist(List * targetlist)
new_unsorted_tlist(List *targetlist)
{
List *new_targetlist = (List *) copyObject((Node *) targetlist);
List *x = NIL;
@@ -339,7 +339,7 @@ new_unsorted_tlist(List * targetlist)
*
*/
List *
copy_vars(List * target, List * source)
copy_vars(List *target, List *source)
{
List *result = NIL;
List *src = NIL;
@@ -367,7 +367,7 @@ copy_vars(List * target, List * source)
*
*/
List *
flatten_tlist(List * tlist)
flatten_tlist(List *tlist)
{
int last_resdomno = 1;
List *new_tlist = NIL;
@@ -423,7 +423,7 @@ flatten_tlist(List * tlist)
*
*/
List *
flatten_tlist_vars(List * full_tlist, List * flat_tlist)
flatten_tlist_vars(List *full_tlist, List *flat_tlist)
{
List *x = NIL;
List *result = NIL;
@@ -454,7 +454,7 @@ flatten_tlist_vars(List * full_tlist, List * flat_tlist)
*
*/
static Node *
flatten_tlistentry(Node * tlistentry, List * flat_tlist)
flatten_tlistentry(Node *tlistentry, List *flat_tlist)
{
if (tlistentry == NULL)
{
@@ -544,7 +544,7 @@ flatten_tlistentry(Node * tlistentry, List * flat_tlist)
TargetEntry *
MakeTLE(Resdom * resdom, Node * expr)
MakeTLE(Resdom *resdom, Node *expr)
{
TargetEntry *rt = makeNode(TargetEntry);
@@ -554,7 +554,7 @@ MakeTLE(Resdom * resdom, Node * expr)
}
Var *
get_expr(TargetEntry * tle)
get_expr(TargetEntry *tle)
{
Assert(tle != NULL);
Assert(tle->expr != NULL);
@@ -574,7 +574,7 @@ get_expr(TargetEntry * tle)
*/
#ifdef NOT_USED
void
AddGroupAttrToTlist(List * tlist, List * grpCl)
AddGroupAttrToTlist(List *tlist, List *grpCl)
{
List *gl;
int last_resdomno = length(tlist) + 1;
@@ -606,7 +606,7 @@ AddGroupAttrToTlist(List * tlist, List * grpCl)
/* was ExecTargetListLength() in execQual.c,
moved here to reduce dependencies on the executor module */
int
exec_tlist_length(List * targetlist)
exec_tlist_length(List *targetlist)
{
int len;
List *tl;

12
src/backend/optimizer/util/var.c
View File

@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/var.c,v 1.5 1997/09/08 02:25:07 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/var.c,v 1.6 1997/09/08 21:45:56 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -35,7 +35,7 @@
* (though it currently is, see primnodes.h)
*/
List *
pull_varnos(Node * me)
pull_varnos(Node *me)
{
List *i,
*result = NIL;
@@ -75,7 +75,7 @@ pull_varnos(Node * me)
* Returns true if any varnode found.
*/
bool
contain_var_clause(Node * clause)
contain_var_clause(Node *clause)
{
if (clause == NULL)
return FALSE;
@@ -144,7 +144,7 @@ contain_var_clause(Node * clause)
* Returns list of varnodes found.
*/
List *
pull_var_clause(Node * clause)
pull_var_clause(Node *clause)
{
List *retval = NIL;
@@ -204,9 +204,9 @@ pull_var_clause(Node * clause)
* Returns t iff two var nodes correspond to the same attribute.
*/
bool
var_equal(Var * var1, Var * var2)
var_equal(Var *var1, Var *var2)
{
if (IsA(var1, Var) && IsA(var2, Var) &&
if (IsA(var1, Var) &&IsA(var2, Var) &&
(((Var *) var1)->varno == ((Var *) var2)->varno) &&
(((Var *) var1)->vartype == ((Var *) var2)->vartype) &&
(((Var *) var1)->varattno == ((Var *) var2)->varattno))