diff options
Diffstat (limited to 'src/backend/nodes')
| -rw-r--r-- | src/backend/nodes/copyfuncs.c | 108 | ||||
| -rw-r--r-- | src/backend/nodes/equalfuncs.c | 56 | ||||
| -rw-r--r-- | src/backend/nodes/list.c | 48 | ||||
| -rw-r--r-- | src/backend/nodes/nodeFuncs.c | 22 | ||||
| -rw-r--r-- | src/backend/nodes/outfuncs.c | 94 | ||||
| -rw-r--r-- | src/backend/nodes/print.c | 22 | ||||
| -rw-r--r-- | src/backend/nodes/readfuncs.c | 12 |
7 files changed, 181 insertions, 181 deletions
diff --git a/src/backend/nodes/copyfuncs.c b/src/backend/nodes/copyfuncs.c index 36ed7e86ebd..ef6c1a1828b 100644 --- a/src/backend/nodes/copyfuncs.c +++ b/src/backend/nodes/copyfuncs.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.9 1997/09/08 20:55:50 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.10 1997/09/08 21:43:57 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -37,7 +37,7 @@ * its contents. (good for list of pointers as well as list of integers). */ List * -listCopy(List * list) +listCopy(List *list) { List *newlist = NIL; List *l, @@ -78,7 +78,7 @@ listCopy(List * list) * ---------------- */ static void -CopyPlanFields(Plan * from, Plan * newnode) +CopyPlanFields(Plan *from, Plan *newnode) { newnode->cost = from->cost; newnode->plan_size = from->plan_size; @@ -95,7 +95,7 @@ CopyPlanFields(Plan * from, Plan * newnode) * ---------------- */ static Plan * -_copyPlan(Plan * from) +_copyPlan(Plan *from) { Plan *newnode = makeNode(Plan); @@ -114,7 +114,7 @@ _copyPlan(Plan * from) * ---------------- */ static Existential * -_copyExistential(Existential * from) +_copyExistential(Existential *from) { Existential *newnode = makeNode(Existential); @@ -132,7 +132,7 @@ _copyExistential(Existential * from) * ---------------- */ static Result * -_copyResult(Result * from) +_copyResult(Result *from) { Result *newnode = makeNode(Result); @@ -188,7 +188,7 @@ _copyAppend(Append *from) * ---------------- */ static void -CopyScanFields(Scan * from, Scan * newnode) +CopyScanFields(Scan *from, Scan *newnode) { newnode->scanrelid = from->scanrelid; Node_Copy(from, newnode, scanstate); @@ -200,7 +200,7 @@ CopyScanFields(Scan * from, Scan * newnode) * ---------------- */ static Scan * -_copyScan(Scan * from) +_copyScan(Scan *from) { Scan *newnode = makeNode(Scan); @@ -219,7 +219,7 @@ _copyScan(Scan * from) * ---------------- */ static SeqScan * -_copySeqScan(SeqScan * from) +_copySeqScan(SeqScan *from) { SeqScan *newnode = makeNode(SeqScan); @@ -238,7 +238,7 @@ _copySeqScan(SeqScan * from) * ---------------- */ static IndexScan * -_copyIndexScan(IndexScan * from) +_copyIndexScan(IndexScan *from) { IndexScan *newnode = makeNode(IndexScan); @@ -268,7 +268,7 @@ _copyIndexScan(IndexScan * from) * ---------------- */ static void -CopyJoinFields(Join * from, Join * newnode) +CopyJoinFields(Join *from, Join *newnode) { /* nothing extra */ return; @@ -280,7 +280,7 @@ CopyJoinFields(Join * from, Join * newnode) * ---------------- */ static Join * -_copyJoin(Join * from) +_copyJoin(Join *from) { Join *newnode = makeNode(Join); @@ -300,7 +300,7 @@ _copyJoin(Join * from) * ---------------- */ static NestLoop * -_copyNestLoop(NestLoop * from) +_copyNestLoop(NestLoop *from) { NestLoop *newnode = makeNode(NestLoop); @@ -326,7 +326,7 @@ _copyNestLoop(NestLoop * from) * ---------------- */ static MergeJoin * -_copyMergeJoin(MergeJoin * from) +_copyMergeJoin(MergeJoin *from) { MergeJoin *newnode = makeNode(MergeJoin); List *newlist; @@ -365,7 +365,7 @@ _copyMergeJoin(MergeJoin * from) * ---------------- */ static HashJoin * -_copyHashJoin(HashJoin * from) +_copyHashJoin(HashJoin *from) { HashJoin *newnode = makeNode(HashJoin); @@ -403,7 +403,7 @@ _copyHashJoin(HashJoin * from) * ---------------- */ static void -CopyTempFields(Temp * from, Temp * newnode) +CopyTempFields(Temp *from, Temp *newnode) { newnode->tempid = from->tempid; newnode->keycount = from->keycount; @@ -416,7 +416,7 @@ CopyTempFields(Temp * from, Temp * newnode) * ---------------- */ static Temp * -_copyTemp(Temp * from) +_copyTemp(Temp *from) { Temp *newnode = makeNode(Temp); @@ -435,7 +435,7 @@ _copyTemp(Temp * from) * ---------------- */ static Material * -_copyMaterial(Material * from) +_copyMaterial(Material *from) { Material *newnode = makeNode(Material); @@ -461,7 +461,7 @@ _copyMaterial(Material * from) * ---------------- */ static Sort * -_copySort(Sort * from) +_copySort(Sort *from) { Sort *newnode = makeNode(Sort); @@ -512,7 +512,7 @@ _copyAgg(Agg *from) * ---------------- */ static Unique * -_copyUnique(Unique * from) +_copyUnique(Unique *from) { Unique *newnode = makeNode(Unique); @@ -538,7 +538,7 @@ _copyUnique(Unique * from) * ---------------- */ static Hash * -_copyHash(Hash * from) +_copyHash(Hash *from) { Hash *newnode = makeNode(Hash); @@ -572,7 +572,7 @@ _copyHash(Hash * from) * ---------------- */ static Resdom * -_copyResdom(Resdom * from) +_copyResdom(Resdom *from) { Resdom *newnode = makeNode(Resdom); @@ -596,7 +596,7 @@ _copyResdom(Resdom * from) } static Fjoin * -_copyFjoin(Fjoin * from) +_copyFjoin(Fjoin *from) { Fjoin *newnode = makeNode(Fjoin); @@ -633,7 +633,7 @@ _copyFjoin(Fjoin * from) * ---------------- */ static Expr * -_copyExpr(Expr * from) +_copyExpr(Expr *from) { Expr *newnode = makeNode(Expr); @@ -655,7 +655,7 @@ _copyExpr(Expr * from) * ---------------- */ static Var * -_copyVar(Var * from) +_copyVar(Var *from) { Var *newnode = makeNode(Var); @@ -678,7 +678,7 @@ _copyVar(Var * from) * ---------------- */ static Oper * -_copyOper(Oper * from) +_copyOper(Oper *from) { Oper *newnode = makeNode(Oper); @@ -706,7 +706,7 @@ _copyOper(Oper * from) * ---------------- */ static Const * -_copyConst(Const * from) +_copyConst(Const *from) { static Oid cached_type; static bool cached_typbyval; @@ -817,7 +817,7 @@ _copyConst(Const * from) * ---------------- */ static Param * -_copyParam(Param * from) +_copyParam(Param *from) { Param *newnode = makeNode(Param); @@ -846,7 +846,7 @@ _copyParam(Param * from) * ---------------- */ static Func * -_copyFunc(Func * from) +_copyFunc(Func *from) { Func *newnode = makeNode(Func); @@ -946,7 +946,7 @@ _copyArrayRef(ArrayRef *from) ** -- JMH, 8/2/93 */ static Rel * -_copyRel(Rel * from) +_copyRel(Rel *from) { Rel *newnode = makeNode(Rel); int i, @@ -1024,7 +1024,7 @@ _copyRel(Rel * from) * ---------------- */ static void -CopyPathFields(Path * from, Path * newnode) +CopyPathFields(Path *from, Path *newnode) { newnode->pathtype = from->pathtype; @@ -1079,7 +1079,7 @@ CopyPathFields(Path * from, Path * newnode) * ---------------- */ static Path * -_copyPath(Path * from) +_copyPath(Path *from) { Path *newnode = makeNode(Path); @@ -1093,7 +1093,7 @@ _copyPath(Path * from) * ---------------- */ static IndexPath * -_copyIndexPath(IndexPath * from) +_copyIndexPath(IndexPath *from) { IndexPath *newnode = makeNode(IndexPath); @@ -1136,7 +1136,7 @@ _copyIndexPath(IndexPath * from) * ---------------- */ static void -CopyJoinPathFields(JoinPath * from, JoinPath * newnode) +CopyJoinPathFields(JoinPath *from, JoinPath *newnode) { Node_Copy(from, newnode, pathclauseinfo); Node_Copy(from, newnode, outerjoinpath); @@ -1148,7 +1148,7 @@ CopyJoinPathFields(JoinPath * from, JoinPath * newnode) * ---------------- */ static JoinPath * -_copyJoinPath(JoinPath * from) +_copyJoinPath(JoinPath *from) { JoinPath *newnode = makeNode(JoinPath); @@ -1167,7 +1167,7 @@ _copyJoinPath(JoinPath * from) * ---------------- */ static MergePath * -_copyMergePath(MergePath * from) +_copyMergePath(MergePath *from) { MergePath *newnode = makeNode(MergePath); @@ -1194,7 +1194,7 @@ _copyMergePath(MergePath * from) * ---------------- */ static HashPath * -_copyHashPath(HashPath * from) +_copyHashPath(HashPath *from) { HashPath *newnode = makeNode(HashPath); @@ -1221,7 +1221,7 @@ _copyHashPath(HashPath * from) * ---------------- */ static OrderKey * -_copyOrderKey(OrderKey * from) +_copyOrderKey(OrderKey *from) { OrderKey *newnode = makeNode(OrderKey); @@ -1241,7 +1241,7 @@ _copyOrderKey(OrderKey * from) * ---------------- */ static JoinKey * -_copyJoinKey(JoinKey * from) +_copyJoinKey(JoinKey *from) { JoinKey *newnode = makeNode(JoinKey); @@ -1260,7 +1260,7 @@ _copyJoinKey(JoinKey * from) * ---------------- */ static MergeOrder * -_copyMergeOrder(MergeOrder * from) +_copyMergeOrder(MergeOrder *from) { MergeOrder *newnode = makeNode(MergeOrder); @@ -1282,7 +1282,7 @@ _copyMergeOrder(MergeOrder * from) * ---------------- */ static CInfo * -_copyCInfo(CInfo * from) +_copyCInfo(CInfo *from) { CInfo *newnode = makeNode(CInfo); @@ -1311,7 +1311,7 @@ _copyCInfo(CInfo * from) * ---------------- */ static void -CopyJoinMethodFields(JoinMethod * from, JoinMethod * newnode) +CopyJoinMethodFields(JoinMethod *from, JoinMethod *newnode) { Node_Copy(from, newnode, jmkeys); Node_Copy(from, newnode, clauses); @@ -1323,7 +1323,7 @@ CopyJoinMethodFields(JoinMethod * from, JoinMethod * newnode) * ---------------- */ static JoinMethod * -_copyJoinMethod(JoinMethod * from) +_copyJoinMethod(JoinMethod *from) { JoinMethod *newnode = makeNode(JoinMethod); @@ -1337,7 +1337,7 @@ _copyJoinMethod(JoinMethod * from) * ---------------- */ static HInfo * -_copyHInfo(HInfo * from) +_copyHInfo(HInfo *from) { HInfo *newnode = makeNode(HInfo); @@ -1355,7 +1355,7 @@ _copyHInfo(HInfo * from) * ---------------- */ static MInfo * -_copyMInfo(MInfo * from) +_copyMInfo(MInfo *from) { MInfo *newnode = makeNode(MInfo); @@ -1373,7 +1373,7 @@ _copyMInfo(MInfo * from) * ---------------- */ static JInfo * -_copyJInfo(JInfo * from) +_copyJInfo(JInfo *from) { JInfo *newnode = makeNode(JInfo); @@ -1392,7 +1392,7 @@ _copyJInfo(JInfo * from) } static Iter * -_copyIter(Iter * from) +_copyIter(Iter *from) { Iter *newnode = makeNode(Iter); @@ -1403,7 +1403,7 @@ _copyIter(Iter * from) } static Stream * -_copyStream(Stream * from) +_copyStream(Stream *from) { Stream *newnode = makeNode(Stream); @@ -1428,7 +1428,7 @@ _copyStream(Stream * from) */ static TargetEntry * -_copyTargetEntry(TargetEntry * from) +_copyTargetEntry(TargetEntry *from) { TargetEntry *newnode = makeNode(TargetEntry); @@ -1439,7 +1439,7 @@ _copyTargetEntry(TargetEntry * from) } static RangeTblEntry * -_copyRangeTblEntry(RangeTblEntry * from) +_copyRangeTblEntry(RangeTblEntry *from) { RangeTblEntry *newnode = makeNode(RangeTblEntry); @@ -1468,7 +1468,7 @@ _copyRangeTblEntry(RangeTblEntry * from) } static SortClause * -_copySortClause(SortClause * from) +_copySortClause(SortClause *from) { SortClause *newnode = makeNode(SortClause); @@ -1490,7 +1490,7 @@ _copyAConst(A_Const *from) } static TypeName * -_copyTypeName(TypeName * from) +_copyTypeName(TypeName *from) { TypeName *newnode = makeNode(TypeName); @@ -1510,7 +1510,7 @@ _copyTypeName(TypeName * from) } static Query * -_copyQuery(Query * from) +_copyQuery(Query *from) { Query *newnode = makeNode(Query); @@ -1564,7 +1564,7 @@ _copyQuery(Query * from) */ static Value * -_copyValue(Value * from) +_copyValue(Value *from) { Value *newnode = makeNode(Value); diff --git a/src/backend/nodes/equalfuncs.c b/src/backend/nodes/equalfuncs.c index 3500a638ce4..c5728dddd1c 100644 --- a/src/backend/nodes/equalfuncs.c +++ b/src/backend/nodes/equalfuncs.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.9 1997/09/08 20:55:52 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.10 1997/09/08 21:44:02 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -26,7 +26,7 @@ #include "utils/elog.h" #include "storage/itemptr.h" -static bool equali(List * a, List * b); +static bool equali(List *a, List *b); /* * Stuff from primnodes.h @@ -36,7 +36,7 @@ static bool equali(List * a, List * b); * Resdom is a subclass of Node. */ static bool -_equalResdom(Resdom * a, Resdom * b) +_equalResdom(Resdom *a, Resdom *b) { if (a->resno != b->resno) return (false); @@ -55,7 +55,7 @@ _equalResdom(Resdom * a, Resdom * b) } static bool -_equalFjoin(Fjoin * a, Fjoin * b) +_equalFjoin(Fjoin *a, Fjoin *b) { int nNodes; @@ -79,7 +79,7 @@ _equalFjoin(Fjoin * a, Fjoin * b) * Expr is a subclass of Node. */ static bool -_equalExpr(Expr * a, Expr * b) +_equalExpr(Expr *a, Expr *b) { if (a->opType != b->opType) return (false); @@ -92,13 +92,13 @@ _equalExpr(Expr * a, Expr * b) } static bool -_equalIter(Iter * a, Iter * b) +_equalIter(Iter *a, Iter *b) { return (equal(a->iterexpr, b->iterexpr)); } static bool -_equalStream(Stream * a, Stream * b) +_equalStream(Stream *a, Stream *b) { if (a->clausetype != b->clausetype) return (false); @@ -121,7 +121,7 @@ _equalStream(Stream * a, Stream * b) * Var is a subclass of Expr. */ static bool -_equalVar(Var * a, Var * b) +_equalVar(Var *a, Var *b) { if (a->varno != b->varno) return (false); @@ -177,7 +177,7 @@ _equalArrayRef(ArrayRef *a, ArrayRef *b) * Oper is a subclass of Expr. */ static bool -_equalOper(Oper * a, Oper * b) +_equalOper(Oper *a, Oper *b) { if (a->opno != b->opno) return (false); @@ -191,7 +191,7 @@ _equalOper(Oper * a, Oper * b) * Const is a subclass of Expr. */ static bool -_equalConst(Const * a, Const * b) +_equalConst(Const *a, Const *b) { /* @@ -214,7 +214,7 @@ _equalConst(Const * a, Const * b) * Param is a subclass of Expr. */ static bool -_equalParam(Param * a, Param * b) +_equalParam(Param *a, Param *b) { if (a->paramkind != b->paramkind) return (false); @@ -254,7 +254,7 @@ _equalParam(Param * a, Param * b) * Func is a subclass of Expr. */ static bool -_equalFunc(Func * a, Func * b) +_equalFunc(Func *a, Func *b) { if (a->funcid != b->funcid) return (false); @@ -276,7 +276,7 @@ _equalFunc(Func * a, Func * b) * CInfo is a subclass of Node. */ static bool -_equalCInfo(CInfo * a, CInfo * b) +_equalCInfo(CInfo *a, CInfo *b) { Assert(IsA(a, CInfo)); Assert(IsA(b, CInfo)); @@ -298,7 +298,7 @@ _equalCInfo(CInfo * a, CInfo * b) } static bool -_equalJoinMethod(JoinMethod * a, JoinMethod * b) +_equalJoinMethod(JoinMethod *a, JoinMethod *b) { Assert(IsA(a, JoinMethod)); Assert(IsA(b, JoinMethod)); @@ -313,7 +313,7 @@ _equalJoinMethod(JoinMethod * a, JoinMethod * b) } static bool -_equalPath(Path * a, Path * b) +_equalPath(Path *a, Path *b) { if (a->pathtype != b->pathtype) return (false); @@ -368,7 +368,7 @@ _equalPath(Path * a, Path * b) } static bool -_equalIndexPath(IndexPath * a, IndexPath * b) +_equalIndexPath(IndexPath *a, IndexPath *b) { if (!_equalPath((Path *) a, (Path *) b)) return (false); @@ -380,7 +380,7 @@ _equalIndexPath(IndexPath * a, IndexPath * b) } static bool -_equalJoinPath(JoinPath * a, JoinPath * b) +_equalJoinPath(JoinPath *a, JoinPath *b) { Assert(IsA_JoinPath(a)); Assert(IsA_JoinPath(b)); @@ -397,7 +397,7 @@ _equalJoinPath(JoinPath * a, JoinPath * b) } static bool -_equalMergePath(MergePath * a, MergePath * b) +_equalMergePath(MergePath *a, MergePath *b) { Assert(IsA(a, MergePath)); Assert(IsA(b, MergePath)); @@ -414,7 +414,7 @@ _equalMergePath(MergePath * a, MergePath * b) } static bool -_equalHashPath(HashPath * a, HashPath * b) +_equalHashPath(HashPath *a, HashPath *b) { Assert(IsA(a, HashPath)); Assert(IsA(b, HashPath)); @@ -431,7 +431,7 @@ _equalHashPath(HashPath * a, HashPath * b) } static bool -_equalJoinKey(JoinKey * a, JoinKey * b) +_equalJoinKey(JoinKey *a, JoinKey *b) { Assert(IsA(a, JoinKey)); Assert(IsA(b, JoinKey)); @@ -444,7 +444,7 @@ _equalJoinKey(JoinKey * a, JoinKey * b) } static bool -_equalMergeOrder(MergeOrder * a, MergeOrder * b) +_equalMergeOrder(MergeOrder *a, MergeOrder *b) { if (a == (MergeOrder *) NULL && b == (MergeOrder *) NULL) return (true); @@ -465,7 +465,7 @@ _equalMergeOrder(MergeOrder * a, MergeOrder * b) } static bool -_equalHInfo(HInfo * a, HInfo * b) +_equalHInfo(HInfo *a, HInfo *b) { Assert(IsA(a, HInfo)); Assert(IsA(b, HInfo)); @@ -479,7 +479,7 @@ _equalHInfo(HInfo * a, HInfo * b) * fixed to compare all fields. */ static bool -_equalIndexScan(IndexScan * a, IndexScan * b) +_equalIndexScan(IndexScan *a, IndexScan *b) { Assert(IsA(a, IndexScan)); Assert(IsA(b, IndexScan)); @@ -500,7 +500,7 @@ _equalIndexScan(IndexScan * a, IndexScan * b) } static bool -_equalJInfo(JInfo * a, JInfo * b) +_equalJInfo(JInfo *a, JInfo *b) { Assert(IsA(a, JInfo)); Assert(IsA(b, JInfo)); @@ -523,7 +523,7 @@ _equalJInfo(JInfo * a, JInfo * b) * EState is a subclass of Node. */ static bool -_equalEState(EState * a, EState * b) +_equalEState(EState *a, EState *b) { if (a->es_direction != b->es_direction) return (false); @@ -538,7 +538,7 @@ _equalEState(EState * a, EState * b) } static bool -_equalTargetEntry(TargetEntry * a, TargetEntry * b) +_equalTargetEntry(TargetEntry *a, TargetEntry *b) { if (!equal(a->resdom, b->resdom)) return (false); @@ -558,7 +558,7 @@ _equalTargetEntry(TargetEntry * a, TargetEntry * b) * to be recursive, but it should run faster if we iterate. */ static bool -_equalValue(Value * a, Value * b) +_equalValue(Value *a, Value *b) { if (a->type != b->type) return (false); @@ -722,7 +722,7 @@ equal(void *a, void *b) * XXX temp hack. needs something like T_IntList */ static bool -equali(List * a, List * b) +equali(List *a, List *b) { List *la = (List *) a; List *lb = (List *) b; diff --git a/src/backend/nodes/list.c b/src/backend/nodes/list.c index abba222b81a..1f92b604e71 100644 --- a/src/backend/nodes/list.c +++ b/src/backend/nodes/list.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/list.c,v 1.6 1997/09/08 02:23:38 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/list.c,v 1.7 1997/09/08 21:44:04 momjian Exp $ * * NOTES * XXX a few of the following functions are duplicated to handle @@ -58,7 +58,7 @@ makeList(void *elem,...) } List * -lcons(void *obj, List * list) +lcons(void *obj, List *list) { List *l = makeNode(List); @@ -68,7 +68,7 @@ lcons(void *obj, List * list) } List * -lconsi(int datum, List * list) +lconsi(int datum, List *list) { List *l = makeNode(List); @@ -78,13 +78,13 @@ lconsi(int datum, List * list) } List * -lappend(List * list, void *obj) +lappend(List *list, void *obj) { return nconc(list, lcons(obj, NIL)); } List * -lappendi(List * list, int datum) +lappendi(List *list, int datum) { return nconc(list, lconsi(datum, NIL)); } @@ -121,7 +121,7 @@ makeString(char *str) /* n starts with 0 */ void * -nth(int n, List * l) +nth(int n, List *l) { /* XXX assume list is long enough */ while (n > 0) @@ -133,7 +133,7 @@ nth(int n, List * l) } int -nthi(int n, List * l) +nthi(int n, List *l) { /* XXX assume list is long enough */ while (n > 0) @@ -146,7 +146,7 @@ nthi(int n, List * l) /* this is here solely for rt_store. Get rid of me some day! */ void -set_nth(List * l, int n, void *elem) +set_nth(List *l, int n, void *elem) { /* XXX assume list is long enough */ while (n > 0) @@ -159,7 +159,7 @@ set_nth(List * l, int n, void *elem) } int -length(List * l) +length(List *l) { int i = 0; @@ -172,7 +172,7 @@ length(List * l) } void -freeList(List * list) +freeList(List *list) { while (list != NIL) { @@ -187,7 +187,7 @@ freeList(List * list) * below are for backwards compatibility */ List * -append(List * l1, List * l2) +append(List *l1, List *l2) { List *newlist, *newlist2, @@ -209,7 +209,7 @@ append(List * l1, List * l2) * below are for backwards compatibility */ List * -intAppend(List * l1, List * l2) +intAppend(List *l1, List *l2) { List *newlist, *newlist2, @@ -228,7 +228,7 @@ intAppend(List * l1, List * l2) } List * -nconc(List * l1, List * l2) +nconc(List *l1, List *l2) { List *temp; @@ -248,7 +248,7 @@ nconc(List * l1, List * l2) List * -nreverse(List * list) +nreverse(List *list) { List *rlist = NIL; List *p = NIL; @@ -278,7 +278,7 @@ nreverse(List * list) * XXX only good for IntList -ay */ bool -same(List * foo, List * bar) +same(List *foo, List *bar) { List *temp = NIL; @@ -300,7 +300,7 @@ same(List * foo, List * bar) } List * -LispUnion(List * foo, List * bar) +LispUnion(List *foo, List *bar) { List *retval = NIL; List *i = NIL; @@ -332,7 +332,7 @@ LispUnion(List * foo, List * bar) } List * -LispUnioni(List * foo, List * bar) +LispUnioni(List *foo, List *bar) { List *retval = NIL; List *i = NIL; @@ -369,7 +369,7 @@ LispUnioni(List * foo, List * bar) * bar */ bool -member(void *foo, List * bar) +member(void *foo, List *bar) { List *i; @@ -380,7 +380,7 @@ member(void *foo, List * bar) } bool -intMember(int foo, List * bar) +intMember(int foo, List *bar) { List *i; @@ -395,7 +395,7 @@ intMember(int foo, List * bar) * only does pointer comparisons. Removes 'elem' from the the linked list. */ List * -lremove(void *elem, List * list) +lremove(void *elem, List *list) { List *l; List *prev = NIL; @@ -422,7 +422,7 @@ lremove(void *elem, List * list) } List * -LispRemove(void *elem, List * list) +LispRemove(void *elem, List *list) { List *temp = NIL; List *prev = NIL; @@ -447,7 +447,7 @@ LispRemove(void *elem, List * list) #ifdef NOT_USED List * -intLispRemove(int elem, List * list) +intLispRemove(int elem, List *list) { List *temp = NIL; List *prev = NIL; @@ -473,7 +473,7 @@ intLispRemove(int elem, List * list) #endif List * -set_difference(List * list1, List * list2) +set_difference(List *list1, List *list2) { List *temp1 = NIL; List *result = NIL; @@ -490,7 +490,7 @@ set_difference(List * list1, List * list2) } List * -set_differencei(List * list1, List * list2) +set_differencei(List *list1, List *list2) { List *temp1 = NIL; List *result = NIL; diff --git a/src/backend/nodes/nodeFuncs.c b/src/backend/nodes/nodeFuncs.c index 9f343ac6c03..a7c5364ba1f 100644 --- a/src/backend/nodes/nodeFuncs.c +++ b/src/backend/nodes/nodeFuncs.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/nodeFuncs.c,v 1.5 1997/09/08 02:23:40 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/nodeFuncs.c,v 1.6 1997/09/08 21:44:06 momjian Exp $ * *------------------------------------------------------------------------- */ @@ -23,16 +23,16 @@ #include "nodes/nodeFuncs.h" #include "utils/lsyscache.h" -static bool var_is_inner(Var * var); +static bool var_is_inner(Var *var); /* * single_node - * Returns t if node corresponds to a single-noded expression */ bool -single_node(Node * node) +single_node(Node *node) { - if (IsA(node, Ident) || IsA(node, Const) || IsA(node, Var) || IsA(node, Param)) + if (IsA(node, Ident) ||IsA(node, Const) ||IsA(node, Var) ||IsA(node, Param)) return (true); else return (false); @@ -58,22 +58,22 @@ single_node(Node * node) * */ bool -var_is_outer(Var * var) +var_is_outer(Var *var) { return ((bool) (var->varno == OUTER)); } static bool -var_is_inner(Var * var) +var_is_inner(Var *var) { return ((bool) (var->varno == INNER)); } bool -var_is_rel(Var * var) +var_is_rel(Var *var) { return (bool) - ! (var_is_inner(var) || var_is_outer(var)); + !(var_is_inner(var) || var_is_outer(var)); } /***************************************************************************** @@ -90,7 +90,7 @@ var_is_rel(Var * var) * */ Oper * -replace_opid(Oper * oper) +replace_opid(Oper *oper) { oper->opid = get_opcode(oper->opno); oper->op_fcache = NULL; @@ -108,10 +108,10 @@ replace_opid(Oper * oper) * */ bool -non_null(Expr * c) +non_null(Expr *c) { - if (IsA(c, Const) && !((Const *) c)->constisnull) + if (IsA(c, Const) &&!((Const *) c)->constisnull) return (true); else return (false); diff --git a/src/backend/nodes/outfuncs.c b/src/backend/nodes/outfuncs.c index 9b6840ecb6a..4d12af6af89 100644 --- a/src/backend/nodes/outfuncs.c +++ b/src/backend/nodes/outfuncs.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.9 1997/09/08 20:55:56 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.10 1997/09/08 21:44:07 momjian Exp $ * * NOTES * Every (plan) node in POSTGRES has an associated "out" routine which @@ -53,7 +53,7 @@ static void _outNode(StringInfo str, void *obj); * converts a List of integers */ static void -_outIntList(StringInfo str, List * list) +_outIntList(StringInfo str, List *list) { List *l; char buf[500]; @@ -68,7 +68,7 @@ _outIntList(StringInfo str, List * list) } static void -_outQuery(StringInfo str, Query * node) +_outQuery(StringInfo str, Query *node) { char buf[500]; @@ -110,7 +110,7 @@ _outQuery(StringInfo str, Query * node) * print the basic stuff of all nodes that inherit from Plan */ static void -_outPlanInfo(StringInfo str, Plan * node) +_outPlanInfo(StringInfo str, Plan *node) { char buf[500]; @@ -142,7 +142,7 @@ _outPlanInfo(StringInfo str, Plan * node) * Stuff from plannodes.h */ static void -_outPlan(StringInfo str, Plan * node) +_outPlan(StringInfo str, Plan *node) { char buf[500]; @@ -153,7 +153,7 @@ _outPlan(StringInfo str, Plan * node) } static void -_outResult(StringInfo str, Result * node) +_outResult(StringInfo str, Result *node) { char buf[500]; @@ -171,7 +171,7 @@ _outResult(StringInfo str, Result * node) * Existential is a subclass of Plan. */ static void -_outExistential(StringInfo str, Existential * node) +_outExistential(StringInfo str, Existential *node) { char buf[500]; @@ -211,7 +211,7 @@ _outAppend(StringInfo str, Append *node) * Join is a subclass of Plan */ static void -_outJoin(StringInfo str, Join * node) +_outJoin(StringInfo str, Join *node) { char buf[500]; @@ -225,7 +225,7 @@ _outJoin(StringInfo str, Join * node) * NestLoop is a subclass of Join */ static void -_outNestLoop(StringInfo str, NestLoop * node) +_outNestLoop(StringInfo str, NestLoop *node) { char buf[500]; @@ -238,7 +238,7 @@ _outNestLoop(StringInfo str, NestLoop * node) * MergeJoin is a subclass of Join */ static void -_outMergeJoin(StringInfo str, MergeJoin * node) +_outMergeJoin(StringInfo str, MergeJoin *node) { char buf[500]; @@ -264,7 +264,7 @@ _outMergeJoin(StringInfo str, MergeJoin * node) * HashJoin is a subclass of Join. */ static void -_outHashJoin(StringInfo str, HashJoin * node) +_outHashJoin(StringInfo str, HashJoin *node) { char buf[500]; @@ -292,7 +292,7 @@ _outHashJoin(StringInfo str, HashJoin * node) * Scan is a subclass of Node */ static void -_outScan(StringInfo str, Scan * node) +_outScan(StringInfo str, Scan *node) { char buf[500]; @@ -309,7 +309,7 @@ _outScan(StringInfo str, Scan * node) * SeqScan is a subclass of Scan */ static void -_outSeqScan(StringInfo str, SeqScan * node) +_outSeqScan(StringInfo str, SeqScan *node) { char buf[500]; @@ -327,7 +327,7 @@ _outSeqScan(StringInfo str, SeqScan * node) * IndexScan is a subclass of Scan */ static void -_outIndexScan(StringInfo str, IndexScan * node) +_outIndexScan(StringInfo str, IndexScan *node) { char buf[500]; @@ -352,7 +352,7 @@ _outIndexScan(StringInfo str, IndexScan * node) * Temp is a subclass of Plan */ static void -_outTemp(StringInfo str, Temp * node) +_outTemp(StringInfo str, Temp *node) { char buf[500]; @@ -371,7 +371,7 @@ _outTemp(StringInfo str, Temp * node) * Sort is a subclass of Temp */ static void -_outSort(StringInfo str, Sort * node) +_outSort(StringInfo str, Sort *node) { char buf[500]; @@ -401,7 +401,7 @@ _outAgg(StringInfo str, Agg *node) } static void -_outGroup(StringInfo str, Group * node) +_outGroup(StringInfo str, Group *node) { char buf[500]; @@ -422,7 +422,7 @@ _outGroup(StringInfo str, Group * node) * For some reason, unique is a subclass of Temp. */ static void -_outUnique(StringInfo str, Unique * node) +_outUnique(StringInfo str, Unique *node) { char buf[500]; @@ -442,7 +442,7 @@ _outUnique(StringInfo str, Unique * node) * Hash is a subclass of Temp */ static void -_outHash(StringInfo str, Hash * node) +_outHash(StringInfo str, Hash *node) { char buf[500]; @@ -463,7 +463,7 @@ _outHash(StringInfo str, Hash * node) } static void -_outTee(StringInfo str, Tee * node) +_outTee(StringInfo str, Tee *node) { char buf[500]; @@ -494,7 +494,7 @@ _outTee(StringInfo str, Tee * node) * Resdom is a subclass of Node */ static void -_outResdom(StringInfo str, Resdom * node) +_outResdom(StringInfo str, Resdom *node) { char buf[500]; @@ -519,7 +519,7 @@ _outResdom(StringInfo str, Resdom * node) } static void -_outFjoin(StringInfo str, Fjoin * node) +_outFjoin(StringInfo str, Fjoin *node) { char buf[500]; int i; @@ -550,7 +550,7 @@ _outFjoin(StringInfo str, Fjoin * node) * Expr is a subclass of Node */ static void -_outExpr(StringInfo str, Expr * node) +_outExpr(StringInfo str, Expr *node) { char buf[500]; char *opstr = NULL; @@ -592,7 +592,7 @@ _outExpr(StringInfo str, Expr * node) * Var is a subclass of Expr */ static void -_outVar(StringInfo str, Var * node) +_outVar(StringInfo str, Var *node) { char buf[500]; @@ -614,7 +614,7 @@ _outVar(StringInfo str, Var * node) * Const is a subclass of Expr */ static void -_outConst(StringInfo str, Const * node) +_outConst(StringInfo str, Const *node) { char buf[500]; @@ -743,7 +743,7 @@ _outArrayRef(StringInfo str, ArrayRef *node) * Func is a subclass of Expr */ static void -_outFunc(StringInfo str, Func * node) +_outFunc(StringInfo str, Func *node) { char buf[500]; @@ -772,7 +772,7 @@ _outFunc(StringInfo str, Func * node) * Oper is a subclass of Expr */ static void -_outOper(StringInfo str, Oper * node) +_outOper(StringInfo str, Oper *node) { char buf[500]; @@ -791,7 +791,7 @@ _outOper(StringInfo str, Oper * node) * Param is a subclass of Expr */ static void -_outParam(StringInfo str, Param * node) +_outParam(StringInfo str, Param *node) { char buf[500]; @@ -818,7 +818,7 @@ _outParam(StringInfo str, Param * node) * EState is a subclass of Node. */ static void -_outEState(StringInfo str, EState * node) +_outEState(StringInfo str, EState *node) { char buf[500]; @@ -841,7 +841,7 @@ _outEState(StringInfo str, EState * node) * Stuff from relation.h */ static void -_outRel(StringInfo str, Rel * node) +_outRel(StringInfo str, Rel *node) { char buf[500]; @@ -917,7 +917,7 @@ _outRel(StringInfo str, Rel * node) * TargetEntry is a subclass of Node. */ static void -_outTargetEntry(StringInfo str, TargetEntry * node) +_outTargetEntry(StringInfo str, TargetEntry *node) { char buf[500]; @@ -940,7 +940,7 @@ _outTargetEntry(StringInfo str, TargetEntry * node) } static void -_outRangeTblEntry(StringInfo str, RangeTblEntry * node) +_outRangeTblEntry(StringInfo str, RangeTblEntry *node) { char buf[500]; @@ -966,7 +966,7 @@ _outRangeTblEntry(StringInfo str, RangeTblEntry * node) * Path is a subclass of Node. */ static void -_outPath(StringInfo str, Path * node) +_outPath(StringInfo str, Path *node) { char buf[500]; @@ -989,7 +989,7 @@ _outPath(StringInfo str, Path * node) * IndexPath is a subclass of Path. */ static void -_outIndexPath(StringInfo str, IndexPath * node) +_outIndexPath(StringInfo str, IndexPath *node) { char buf[500]; @@ -1030,7 +1030,7 @@ _outIndexPath(StringInfo str, IndexPath * node) * JoinPath is a subclass of Path */ static void -_outJoinPath(StringInfo str, JoinPath * node) +_outJoinPath(StringInfo str, JoinPath *node) { char buf[500]; @@ -1084,7 +1084,7 @@ _outJoinPath(StringInfo str, JoinPath * node) * MergePath is a subclass of JoinPath. */ static void -_outMergePath(StringInfo str, MergePath * node) +_outMergePath(StringInfo str, MergePath *node) { char buf[500]; @@ -1140,7 +1140,7 @@ _outMergePath(StringInfo str, MergePath * node) * HashPath is a subclass of JoinPath. */ static void -_outHashPath(StringInfo str, HashPath * node) +_outHashPath(StringInfo str, HashPath *node) { char buf[500]; @@ -1196,7 +1196,7 @@ _outHashPath(StringInfo str, HashPath * node) * OrderKey is a subclass of Node. */ static void -_outOrderKey(StringInfo str, OrderKey * node) +_outOrderKey(StringInfo str, OrderKey *node) { char buf[500]; @@ -1213,7 +1213,7 @@ _outOrderKey(StringInfo str, OrderKey * node) * JoinKey is a subclass of Node. */ static void -_outJoinKey(StringInfo str, JoinKey * node) +_outJoinKey(StringInfo str, JoinKey *node) { char buf[500]; @@ -1234,7 +1234,7 @@ _outJoinKey(StringInfo str, JoinKey * node) * MergeOrder is a subclass of Node. */ static void -_outMergeOrder(StringInfo str, MergeOrder * node) +_outMergeOrder(StringInfo str, MergeOrder *node) { char buf[500]; @@ -1258,7 +1258,7 @@ _outMergeOrder(StringInfo str, MergeOrder * node) * CInfo is a subclass of Node. */ static void -_outCInfo(StringInfo str, CInfo * node) +_outCInfo(StringInfo str, CInfo *node) { char buf[500]; @@ -1291,7 +1291,7 @@ _outCInfo(StringInfo str, CInfo * node) * JoinMethod is a subclass of Node. */ static void -_outJoinMethod(StringInfo str, JoinMethod * node) +_outJoinMethod(StringInfo str, JoinMethod *node) { char buf[500]; @@ -1313,7 +1313,7 @@ _outJoinMethod(StringInfo str, JoinMethod * node) * HInfo is a subclass of JoinMethod. */ static void -_outHInfo(StringInfo str, HInfo * node) +_outHInfo(StringInfo str, HInfo *node) { char buf[500]; @@ -1339,7 +1339,7 @@ _outHInfo(StringInfo str, HInfo * node) * JInfo is a subclass of Node. */ static void -_outJInfo(StringInfo str, JInfo * node) +_outJInfo(StringInfo str, JInfo *node) { char buf[500]; @@ -1431,7 +1431,7 @@ _outDatum(StringInfo str, Datum value, Oid type) } static void -_outIter(StringInfo str, Iter * node) +_outIter(StringInfo str, Iter *node) { appendStringInfo(str, "ITER"); @@ -1440,7 +1440,7 @@ _outIter(StringInfo str, Iter * node) } static void -_outStream(StringInfo str, Stream * node) +_outStream(StringInfo str, Stream *node) { char buf[500]; @@ -1472,7 +1472,7 @@ _outStream(StringInfo str, Stream * node) } static void -_outValue(StringInfo str, Value * value) +_outValue(StringInfo str, Value *value) { char buf[500]; diff --git a/src/backend/nodes/print.c b/src/backend/nodes/print.c index dfe9d563453..634870ab8ac 100644 --- a/src/backend/nodes/print.c +++ b/src/backend/nodes/print.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/print.c,v 1.8 1997/09/08 02:23:42 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/print.c,v 1.9 1997/09/08 21:44:10 momjian Exp $ * * HISTORY * AUTHOR DATE MAJOR EVENT @@ -33,7 +33,7 @@ #include "nodes/plannodes.h" #include "optimizer/clauses.h" -static char *plannode_type(Plan * p); +static char *plannode_type(Plan *p); /* * print-- @@ -135,7 +135,7 @@ pprint(void *obj) * print contents of range table */ void -print_rt(List * rtable) +print_rt(List *rtable) { List *l; int i = 1; @@ -160,7 +160,7 @@ print_rt(List * rtable) * print an expression */ void -print_expr(Node * expr, List * rtable) +print_expr(Node *expr, List *rtable) { if (expr == NULL) { @@ -230,7 +230,7 @@ print_expr(Node * expr, List * rtable) * temporary here. where is keys list of list?? */ void -print_keys(List * keys, List * rtable) +print_keys(List *keys, List *rtable) { List *k; @@ -251,7 +251,7 @@ print_keys(List * keys, List * rtable) * print targetlist in a more legible way. */ void -print_tl(List * tlist, List * rtable) +print_tl(List *tlist, List *rtable) { List *tl; @@ -280,7 +280,7 @@ print_tl(List * tlist, List * rtable) * print out the tuple with the given TupleTableSlot */ void -print_slot(TupleTableSlot * slot) +print_slot(TupleTableSlot *slot) { if (!slot->val) { @@ -297,7 +297,7 @@ print_slot(TupleTableSlot * slot) } static char * -plannode_type(Plan * p) +plannode_type(Plan *p) { switch (nodeTag(p)) { @@ -375,7 +375,7 @@ plannode_type(Plan * p) */ void -print_plan_recursive(Plan * p, Query * parsetree, int indentLevel, char *label) +print_plan_recursive(Plan *p, Query *parsetree, int indentLevel, char *label) { int i; char extraInfo[100]; @@ -386,7 +386,7 @@ print_plan_recursive(Plan * p, Query * parsetree, int indentLevel, char *label) printf(" "); printf("%s%s :c=%.4f :s=%d :w=%d ", label, plannode_type(p), p->cost, p->plan_size, p->plan_width); - if (IsA(p, Scan) || IsA(p, SeqScan)) + if (IsA(p, Scan) ||IsA(p, SeqScan)) { RangeTblEntry *rte; @@ -414,7 +414,7 @@ print_plan_recursive(Plan * p, Query * parsetree, int indentLevel, char *label) prints just the plan node types */ void -print_plan(Plan * p, Query * parsetree) +print_plan(Plan *p, Query *parsetree) { print_plan_recursive(p, parsetree, 0, ""); } diff --git a/src/backend/nodes/readfuncs.c b/src/backend/nodes/readfuncs.c index eca6c480a22..6caa2cc9a70 100644 --- a/src/backend/nodes/readfuncs.c +++ b/src/backend/nodes/readfuncs.c @@ -7,7 +7,7 @@ * * * IDENTIFICATION - * $Header: /cvsroot/pgsql/src/backend/nodes/readfuncs.c,v 1.8 1997/09/08 02:23:45 momjian Exp $ + * $Header: /cvsroot/pgsql/src/backend/nodes/readfuncs.c,v 1.9 1997/09/08 21:44:11 momjian Exp $ * * NOTES * Most of the read functions for plan nodes are tested. (In fact, they @@ -54,7 +54,7 @@ static Datum readDatum(Oid type); static List * -toIntList(List * list) +toIntList(List *list) { List *l; @@ -128,7 +128,7 @@ _readQuery() * ---------------- */ static void -_getPlan(Plan * node) +_getPlan(Plan *node) { char *token; int length; @@ -155,7 +155,7 @@ _getPlan(Plan * node) else { /* Disgusting hack until I figure out what * to do here */ - node->state = (EState *) ! NULL; + node->state = (EState *) !NULL; } token = lsptok(NULL, &length); /* eat :qptargetlist */ @@ -273,7 +273,7 @@ _readAppend() * ---------------- */ static void -_getJoin(Join * node) +_getJoin(Join *node) { _getPlan((Plan *) node); } @@ -396,7 +396,7 @@ _readHashJoin() * ---------------- */ static void -_getScan(Scan * node) +_getScan(Scan *node) { char *token; int length; |